Optimal halfspace range reporting in three dimensions P Afshani, TM Chan Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 102 | 2009 |
Instance-optimal geometric algorithms P Afshani, J Barbay, TM Chan Journal of the ACM (JACM) 64 (1), 1-38, 2017 | 95 | 2017 |
On dominance reporting in 3D P Afshani Algorithms-ESA 2008: 16th Annual European Symposium, Karlsruhe, Germany …, 2008 | 73 | 2008 |
On the spectrum of the forced matching number of graphs P Afshani, H Hatami, ES Mahmoodian arXiv preprint arXiv:0903.2578, 2009 | 62 | 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 | 55 | 2010 |
On approximate range counting and depth P Afshani, TM Chan Proceedings of the twenty-third annual symposium on Computational geometry …, 2007 | 55 | 2007 |
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 | 52 | 2012 |
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 | 52 | 2009 |
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 | 41 | 2011 |
On the complexity of range searching among curves P Afshani, A Driemel Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 40 | 2018 |
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: Papers in honor of …, 2013 | 32 | 2013 |
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 | 31 | 2005 |
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 | 29 | 2012 |
Lower bounds for multiplication via network coding P Afshani, CB Freksen, L Kamma, KG Larsen arXiv preprint arXiv:1902.10935, 2019 | 27 | 2019 |
A general approach for cache-oblivious range reporting and approximate range counting P Afshani, C Hamilton, N Zeh Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 24 | 2009 |
Independent range sampling, revisited again P Afshani, JM Phillips arXiv preprint arXiv:1903.08014, 2019 | 19 | 2019 |
Independent range sampling, revisited P Afshani, Z Wei 25th European Symposium on Algorithms, ESA 2017, 3: 1--3: 14, 2017 | 19 | 2017 |
Applications of incidence bounds in point covering problems P Afshani, E Berglin, I Van Duijn, JS Nielsen arXiv preprint arXiv:1603.07282, 2016 | 17 | 2016 |
On the complexity of finding an unknown cut via vertex queries P Afshani, E Chiniforooshan, R Dorrigiv, A Farzan, M Mirzazadeh, ... Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007 | 17 | 2007 |
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 | 16 | 2019 |