peyman afshani
peyman afshani
Dirección de correo verificada de madalgo.au.dk - Página principal
TítuloCitado porAño
Optimal halfspace range reporting in three dimensions
P Afshani, TM Chan
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
622009
On dominance reporting in 3D
P Afshani
European Symposium on Algorithms, 41-51, 2008
582008
Instance-optimal geometric algorithms
P Afshani, J Barbay, TM Chan
Journal of the ACM (JACM) 64 (1), 3, 2017
562017
On approximate range counting and depth
P Afshani, TM Chan
Discrete & Computational Geometry 42 (1), 3-21, 2009
412009
On the spectrum of the forced matching number of graphs
P Afshani, H Hatami, ES Mahmoodian
arXiv preprint arXiv:0903.2578, 2009
392009
Orthogonal range reporting in three and higher dimensions
P Afshani, L Arge, KD Larsen
Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009
382009
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
372010
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
302012
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
302011
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
262005
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
182010
Cache-oblivious range reporting with optimal queries requires superlinear space
P Afshani, C Hamilton, N Zeh
Discrete & Computational Geometry 45 (4), 824-850, 2011
162011
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
152013
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
142012
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
122007
(Approximate) uncertain skylines
P Afshani, PK Agarwal, L Arge, KG Larsen, JM Phillips
Theory of Computing Systems 52 (3), 342-366, 2013
102013
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.
P Afshani, TM Chan
CCCG, 19-22, 2005
92005
Fast computation of output-sensitive maxima in a word RAM
P Afshani
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
72014
Improved space bounds for cache-oblivious range reporting
P Afshani, N Zeh
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
72011
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
62014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20