Follow
John Iacono
Title
Cited by
Cited by
Year
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, 593-604, 2005
2752005
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ...
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006
197*2006
Dynamic optimality—almost
ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu
SIAM Journal on Computing 37 (1), 240-251, 2007
1362007
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
103*2004
A locality-preserving cache-oblivious dynamic dictionary
MA Bender, Z Duan, J Iacono, J Wu
Journal of Algorithms 53 (2), 115-136, 2004
932004
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
902001
Improved upper bounds for pairing heaps
J Iacono
arXiv preprint arXiv:1110.4428, 2011
84*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
822009
Retroactive data structures
ED Demaine, J Iacono, S Langerman
ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007
662007
Necklaces, Convolutions, and X+Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
Algorithmica 69 (2), 294-314, 2014
642014
Necklaces, Convolutions, and X + Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
European Symposium on Algorithms, 160-171, 2006
632006
Output-sensitive algorithms for Tukey depth and related problems
D Bremner, D Chen, J Iacono, S Langerman, P Morin
Statistics and Computing 18, 259-266, 2008
552008
Expected asymptotically optimal planar point location
J Iacono
Computational Geometry 29 (1), 19-22, 2004
52*2004
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
502011
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
492007
Proximity graphs: E, δ, Δ, χ and ω
P Bose, V Dujmović, F Hurtado, J Iacono, S Langerman, H Meijer, ...
International Journal of Computational Geometry & Applications 22 (05), 439-469, 2012
472012
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
472010
Using hashing to solve the dictionary problem (in external memory)
J Iacono, M Pătraşcu
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
422012
Key-independent optimality
J Iacono
Algorithmica 42, 3-10, 2005
422005
Wrapping spheres with flat paper
ED Demaine, ML Demaine, J Iacono, S Langerman
Computational geometry 42 (8), 748-757, 2009
38*2009
The system can't perform the operation now. Try again later.
Articles 1–20