John Iacono
Titolo
Citata da
Citata da
Anno
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ...
Discrete & Computational Geometry 33 (4), 593-604, 2005
2112005
A locality-preserving cache-oblivious dynamic dictionary
MA Bender, Z Duan, J Iacono, J Wu
Journal of Algorithms 53 (2), 115-136, 2004
972004
Space-efficient planar convex hull algorithms
H Br÷nnimann, J Iacono, J Katajainen, P Morin, J Morrison, G Toussaint
Theoretical Computer Science 321 (1), 25-40, 2004
93*2004
Dynamic optimality—almost
ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu
SIAM Journal on Computing 37 (1), 240-251, 2007
902007
Alternatives to splay trees with O (log n) worst-case access times
J Iacono
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithmsá…, 2001
842001
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D ▄nay, Z ăataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes iná…, 2010
802010
Improved upper bounds for pairing heaps
J Iacono
arXiv preprint arXiv:1110.4428, 2011
70*2011
The geometry of binary search trees
ED Demaine, D Harmon, J Iacono, D Kane, M Patraşcu
Proceedings of the twentieth annual ACM-SIAM symposium on Discreteá…, 2009
492009
A unified access bound on comparison-based dynamic dictionaries
M Bădoiu, R Cole, ED Demaine, J Iacono
Theoretical Computer Science 382 (2), 86-96, 2007
472007
Retroactive data structures
ED Demaine, J Iacono, S Langerman
ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007
472007
The cost of cache-oblivious searching
MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ...
Algorithmica 61 (2), 463-505, 2011
46*2011
Expected asymptotically optimal planar point location
J Iacono
Computational Geometry 29 (1), 19-22, 2004
46*2004
Necklaces, Convolutions, and X + Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
European Symposium on Algorithms, 160-171, 2006
452006
Output-sensitive algorithms for Tukey depth and related problems
D Bremner, D Chen, J Iacono, S Langerman, P Morin
Statistics and Computing 18 (3), 259, 2008
442008
Necklaces, Convolutions, and X+Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
Algorithmica 69 (2), 294-314, 2014
412014
Key-independent optimality
J Iacono
Algorithmica 42 (1), 3-10, 2005
392005
Cache-oblivious dynamic dictionaries with update/query tradeoffs
GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro
Proceedings of the twenty-first annual ACM-SIAM symposium on Discreteá…, 2010
362010
Geodesic ham-sandwich cuts
P Bose, ED Demaine, F Hurtado, J Iacono, S Langerman, P Morin
Discrete & Computational Geometry 37 (3), 325-339, 2007
322007
Data structures for halfplane proximity queries and incremental voronoi diagrams
B Aronov, P Bose, ED Demaine, J Gudmundsson, J Iacono, S Langerman, ...
Latin American Symposium on Theoretical Informatics, 80-92, 2006
312006
Encoding 2D range maximum queries
M Golin, J Iacono, D Krizanc, R Raman, SS Rao
International Symposium on Algorithms and Computation, 180-189, 2011
29*2011
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20