John Iacono

Professor

Algorithms Research Group
Department of Computer Science
Université libre de Bruxelles
Office: 2.O8.114

Research Professor

Department of Computer Science and Engineering
Tandon School of Engineering
New York University

Postdocs

Seungbum Jo (2019)
Grigorios Koumoutsos (2018-)
Ben Karsin (2018-2019)
Varunkumar Jayapaul (2018)
Konstantinos Tsakalidis (2017-2018)
Pooya Davoodi (2012-13)

Ph.D. Students

Aurélien Ooms
Mark Yagnatinsky (2016)
Özgür Özkan (2013)
Dania El-Khechen (2009)

Master's Theses Supervised

Youri Hubaut (2018)
Kostyantyn Mazur (2013)
Ken Liu (2004)
Albert Siu Cheong Yu (2006)

Publications

2019

Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman and Boris Zolotov: Sublinear Explicit incremental planar Voronoi diagrams. Japan Conference on Discrete and Computational Geometry, Graphs, and Games: JCDCG^3. Abstract. 2019. To appear.

Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon: Subquadratic Algorithms for Algebraic 3SUM. Discrete & Computational Geometry 61(4): 698-734 (2019)

Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman: Belga B-Trees. CSR 2019: 93-105

John Iacono, Varunkumar Jayapaul, Ben Karsin: Locality. CoRR abs/1902.07928 (2019)

Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms: Encoding 3SUM. CoRR abs/1903.02645 (2019)

John Iacono, Riko Jacob, Konstantinos Tsakalidis: External memory priority queues with decrease-key and applications to graph algorithms. CoRR abs/1903.03147 (2019)

Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman: Belga B-trees. CoRR abs/1903.03560 (2019)

John Iacono, Ben Karsin, Grigorios Koumoutsos: External Memory Planar Point Location with Fast Updates. CoRR abs/1905.02620 (2019)

2018

Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80(11): 3316-3334 (2018)

Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman: Encoding nearest larger values. Theor. Comput. Sci. 710: 97-115 (2018)

Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth: Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60

Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms: Subquadratic Encodings for Point Configurations. Symposium on Computational Geometry 2018: 20:1-20:14

Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich: Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14

Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava: Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. ICS 2018: 86-95

Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms: Subquadratic Encodings for Point Configurations. CoRR abs/1801.01767 (2018)

Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich: Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018)

Mirela Damian, John Iacono, Andrew Winslow: Spanning Properties of Theta-Theta-6. CoRR abs/1808.04744 (2018)

John Iacono, Stefan Langerman: Weighted dynamic finger in binary search trees. CoRR abs/1810.01785 (2018)

John Iacono, Birgit Vogtenhuber: In Pursuit of a Dynamic Treewidth Decomposition. Japan Conference on Discrete and Computational Geometry, Graphs, and Games: JCDCG^3. Abstract. 2018.

Mirela Damian, John Iacono, Andrew Winslow: Spanning Properties of Theta-Theta-6. Japan Conference on Discrete and Computational Geometry, Graphs, and Games: JCDCG^3. Abstract. 2018.

2017

Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman: Incremental Voronoi Diagrams. Discrete & Computational Geometry 58(4): 822-848 (2017)

Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao: Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. ACM Trans. Algorithms 13(2): 28:1-28:31 (2017)

Boris Aronov, John Iacono, Khadijeh Sheikhan: Nearest-Neighbor Search Under Uncertainty. CCCG 2017: 89-94

Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon: Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Symposium on Computational Geometry 2017: 13:1-13:15

John Iacono, Elena Khramtcova, Stefan Langerman: Searching Edges in the Overlap of Two Plane Graphs. WADS 2017: 473-484

John Iacono, Elena Khramtcova, Stefan Langerman: Searching edges in the overlap of two plane graphs. CoRR abs/1701.02229 (2017)

Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert: An Efficient Multiway Mergesort for GPU Architectures. CoRR abs/1702.07961 (2017)

2016

Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman: The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica 76(4): 1264-1275 (2016)

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende: Encoding 2D range maximum queries. Theor. Comput. Sci. 609: 316-327 (2016)

John Iacono, Mark V. Yagnatinsky: A Linear Potential Function for Pairing Heaps. COCOA 2016: 489-504

Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman: Incremental Voronoi diagrams. Symposium on Computational Geometry 2016: 15:1-15:16

Jean Cardinal, John Iacono, Aurélien Ooms: Solving k-SUM Using Few Linear Queries. ESA 2016: 25:1-25:17

John Iacono, Stefan Langerman: Weighted dynamic finger in binary search trees. SODA 2016: 672-691

Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman: Incremental Voronoi Diagrams. CoRR abs/1603.08485 (2016)

John Iacono, Mark V. Yagnatinsky: A Linear Potential Function for Pairing Heaps. CoRR abs/1606.06389 (2016)

Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon: Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR abs/1612.02384 (2016)

2015

Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in External Memory. Algorithmica 72(2): 369-378 (2015)

Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein: Range Minimum Query Indexes in Higher Dimensions. CPM 2015: 149-159

2014

David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian: Necklaces, Convolutions, and X+Y. Algorithmica 69(2): 294-314 (2014)

Frank Dehne, John Iacono: Foreword. Comput. Geom. 47(2): 199 (2014)

Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan: Cache-Oblivious Persistence. ESA 2014: 296-308

John Iacono, Özgür Özkan: Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) 2014: 637-649

Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman: The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC 2014: 181-192

Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer: The Complexity of Order Type Isomorphism. SODA 2014: 405-415

Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan: Cache-Oblivious Persistence. CoRR abs/1402.5492 (2014)

John Iacono, Özgür Özkan: A Tight Lower Bound for Decrease-Key in the Pure Heap Model. CoRR abs/1407.6665 (2014)

2013

Amr Elmasry, Arash Farzan, John Iacono: On the hierarchy of distribution-sensitive properties for data structures. Acta Inf. 50(4): 289-295 (2013)

Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013)

Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer: Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46(8): 917-928 (2013)

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013)

John Iacono: In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms 2013: 236-250

Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky: How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG 2013

Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti: Encodings for Range Selection and Top-k Queries. ESA 2013: 553-564

Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. ICALP (1) 2013: 388-399

John Iacono: Why some heaps support constant-amortized-time decrease-key operations, and others do not. CoRR abs/1302.6641 (2013)

John Howat, John Iacono, Pat Morin: The Fresh-Finger Property. CoRR abs/1302.6914 (2013)

Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman: The Power and Limitations of Static Binary Search Trees with Lazy Finger. CoRR abs/1304.6897 (2013)

Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. CoRR abs/1304.7604 (2013)

John Iacono: In pursuit of the dynamic optimality conjecture. CoRR abs/1306.0207 (2013)

Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan: The Complexity of Order Type Isomorphism. CoRR abs/1311.0928 (2013)

2012

John Iacono, Wolfgang Mulzer: A Static Optimality Transformation with Applications to Planar Point Location. Int. J. Comput. Geometry Appl. 22(4): 327-340 (2012)

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood: PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geometry Appl. 22(5): 439-470 (2012)

Amr Elmasry, Arash Farzan, John Iacono: A priority queue with the time-finger property. J. Discrete Algorithms 16: 206-212 (2012)

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms 8(3): 29:1-29:18 (2012)

John Iacono, Mihai Patrascu: Using hashing to solve the dictionary problem. SODA 2012: 570-582

Sébastien Collette, John Iacono, Stefan Langerman: Confluent persistence revisited. SODA 2012: 593-601

Sarah R. Allen, John Iacono: Packing identical simple polygons is NP-hard. CoRR abs/1209.5307 (2012)

David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian: Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012)

2011

Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. Algorithmica 61(2): 463-505 (2011)

Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra. Graphs and Combinatorics 27(3): 363-376 (2011)

John Iacono: A static optimality transformation with applications to planar point location. Symposium on Computational Geometry 2011: 21-26

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189

Amr Elmasry, Arash Farzan, John Iacono: A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222

Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Meshes Preserving Minimum Feature Size. EGC 2011: 258-273

Frank Dehne, John Iacono, Jörg-Rüdiger Sack: Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Lecture Notes in Computer Science 6844, Springer 2011, ISBN 978-3-642-22299-3

John Iacono, Mihai Patrascu: Using Hashing to Solve the Dictionary Problem (In External Memory). CoRR abs/1104.2799 (2011)

Sébastien Collette, John Iacono, Stefan Langerman: Confluent Persistence Revisited. CoRR abs/1104.3045 (2011)

John Iacono, Wolfgang Mulzer: A Static Optimality Transformation with Applications to Planar Point Location. CoRR abs/1104.5597 (2011)

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011)

John Iacono: Improved Upper Bounds for Pairing Heaps. CoRR abs/1110.4428 (2011)

2010

John Iacono: Editorial. Comput. Geom. 43(1): 1 (2010)

Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)

Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja medians and centers of gravity. CCCG 2010: 147-150

Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54

Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara: Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15

John Iacono, Özgür Özkan: Mergeable Dictionaries. ICALP (1) 2010: 164-175

Andrej Brodnik, John Iacono: Unit-Time Predecessor Queries on Massive Data Sets. ISAAC (1) 2010: 133-144

Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro: Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA 2010: 1448-1456

John Iacono, Özgür Özkan: Mergeable Dictionaries. Data Structures 2010

John Iacono, Özgür Özkan: Mergeable Dictionaries. CoRR abs/1002.4248 (2010)

Amr Elmasry, Arash Farzan, John Iacono: Priority Queues with Multiple Time Fingers. CoRR abs/1009.5538 (2010)

2009

Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)

Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme: Packing 2×2 unit squares into grid polygons is NP-complete. CCCG 2009: 33-36

Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer: Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR 2009: 81-86

Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505

Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon: Minimal Locked Trees. WADS 2009: 61-73

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009)

Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra. CoRR abs/0906.2461 (2009)

Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set. CoRR abs/0908.2442 (2009)

Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009)

2008

David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin: Output-sensitive algorithms for Tukey depth and related problems. Statistics and Computing 18(3): 259-266 (2008)

Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote: Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG 2008

Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921

2007

Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic Ham-Sandwich Cuts. Discrete & Computational Geometry 37(3): 325-339 (2007)

Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)

Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Trans. Algorithms 3(2): 13 (2007)

Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2): 86-96 (2007)

2006

Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem. Journal of Computational Biology 13(4): 979-989 (2006)

Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint: Curves in the Sand: Algorithmic Drawing. CCCG 2006

Dania El-Khechen, Thomas Fevens, John Iacono: Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. CCCG 2006

David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian: Necklaces, Convolutions, and X + Y. ESA 2006: 160-171

Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN 2006: 80-92

Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu: The Complexity of Diffuse Reflections in a Simple Polygon. LATIN 2006: 93-104

2005

John Iacono: Key-Independent Optimality. Algorithmica 42(1): 3-10 (2005)

John Iacono, Stefan Langerman: Queaps. Algorithmica 42(1): 49-56 (2005)

David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discrete & Computational Geometry 33(4): 593-604 (2005)

Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating Point Sets in Polygonal Environments. Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005)

Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint: An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment. CoRR abs/cs/0507013 (2005)

Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid: Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. CoRR abs/cs/0512091 (2005)

2004

Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)

John Iacono: Expected asymptotically optimal planar point location. Comput. Geom. 29(1): 19-22 (2004)

Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004)

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321(1): 25-40 (2004)

Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9

Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating point sets in polygonal environments. Symposium on Computational Geometry 2004: 10-16

Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. FOCS 2004: 484-490

Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82

Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. SODA 2004: 281-290

Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy. CoRR cs.DS/0410048 (2004)

2003

John Iacono, Stefan Langerman: Proximate planar point location. Symposium on Computational Geometry 2003: 220-226

John Iacono: A 3-D visualization of kirkpatrick's planar point location algorithm. Symposium on Computational Geometry 2003: 377

Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. FOCS 2003: 271-282

David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint: Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461

2002

Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. CCCG 2002: 1-4

John Iacono: Key Independent Optimality. ISAAC 2002: 25-31

John Iacono, Stefan Langerman: Queaps. ISAAC 2002: 211-218

Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507

Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38

2001

John Iacono: Optimal planar point location. SODA 2001: 340-341

John Iacono: Alternatives to splay trees with O(log n) worst-case access times. SODA 2001: 516-522

John Iacono: Distribution-sensitive data structures. Ph.D. thesis. Rutgers, The State University of New Jersey — New Brunswick. 2001

2000

John Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates. CCCG 2000

John Iacono, Stefan Langerman: Volume Queries in Polyhedra. JCDCG 2000: 156-159

John Iacono: Improved Upper Bounds for Pairing Heaps. SWAT 2000: 32-45