peyman afshani
Cited by
Cited by
Optimal halfspace range reporting in three dimensions
P Afshani, TM Chan
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
Instance-optimal geometric algorithms
P Afshani, J Barbay, TM Chan
Journal of the ACM (JACM) 64 (1), 1-38, 2017
On dominance reporting in 3D
P Afshani
European Symposium on Algorithms, 41-51, 2008
On approximate range counting and depth
P Afshani, TM Chan
Discrete & Computational Geometry 42 (1), 3-21, 2009
On the spectrum of the forced matching number of graphs
P Afshani, H Hatami, ES Mahmoodian
arXiv preprint arXiv:0903.2578, 2009
Orthogonal range reporting in three and higher dimensions
P Afshani, L Arge, KD Larsen
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 149-158, 2009
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
P Afshani, L Arge, KD Larsen
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
P Afshani, L Arge, KG Larsen
Proceedings of the twenty-eighth annual Symposium on Computational Geometry …, 2012
Ordered and unordered top-k range reporting in large data sets
P Afshani, GS Brodal, N Zeh
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
Circular chromatic index of graphs of maximum degree 3
P Afshani, M Ghandehari, M Ghandehari, H Hatami, R Tusserkani, X Zhu
Journal of Graph Theory 49 (4), 325-335, 2005
The query complexity of finding a hidden permutation
P Afshani, M Agrawal, B Doerr, C Doerr, KG Larsen, K Mehlhorn
Space-efficient data structures, streams, and algorithms, 1-11, 2013
On the complexity of range searching among curves
P Afshani, A Driemel
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
P Afshani
Proceedings of the twenty-eighth annual Symposium on Computational Geometry …, 2012
A general approach for cache-oblivious range reporting and approximate range counting
P Afshani, C Hamilton, N Zeh
Computational Geometry 43 (8), 700-712, 2010
The query complexity of a permutation-based variant of Mastermind
P Afshani, M Agrawal, B Doerr, C Doerr, KG Larsen, K Mehlhorn
Discrete Applied Mathematics 260, 28-50, 2019
Lower bounds for multiplication via network coding
P Afshani, CB Freksen, L Kamma, KG Larsen
arXiv preprint arXiv:1902.10935, 2019
On the complexity of finding an unknown cut via vertex queries
P Afshani, E Chiniforooshan, R Dorrigiv, A Farzan, M Mirzazadeh, ...
International Computing and Combinatorics Conference, 459-469, 2007
Applications of incidence bounds in point covering problems
P Afshani, E Berglin, I Van Duijn, JS Nielsen
arXiv preprint arXiv:1603.07282, 2016
Cache-oblivious range reporting with optimal queries requires superlinear space
P Afshani, C Hamilton, N Zeh
Discrete & Computational Geometry 45 (4), 824-850, 2011
Deterministic rectangle enclosure and offline dominance reporting on the RAM
P Afshani, TM Chan, K Tsakalidis
International Colloquium on Automata, Languages, and Programming, 77-88, 2014
The system can't perform the operation now. Try again later.
Articles 1–20