John Iacono
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
56
Venues
14
Active years
2001–2026
Best venue rank
A*
Where they publish
Papers
56 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Learning-Augmented Online Sorting and TSP. | Ioana O. Bercea, Gerth Stlting Brodal, John Iacono, Lszl Kozma, Debmalya Panigrahi |
| 2026 | ESA | Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines. | Ivor van der Hoog, John Iacono, Eva Rotenberg, Daniel Rutschmann |
| 2026 | ICALP | Incremental k-Lowest Planes and Planar k-Nearest Neighbor with Optimal Query Time. | John Iacono, Yakov Nekrich, Martin P. Seybold |
| 2025 | ESA | An Improved Bound for Plane Covering Paths. | Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane L. Souvaine, Leonidas Theocharous |
| 2025 | ESA | External-Memory Priority Queues with Optimal Insertions. | Gerth Stlting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2025 | SODA | Fast and Simple Sorting Using Partial Information. | Bernhard Haeupler, Richard Hladk, John Iacono, Vclav Rozhon, Robert E. Tarjan, Jakub Tetek |
| 2025 | WADS | Tight Bounds on the Number of Closest Pairs in Vertical Slabs. | Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tth |
| 2024 | SODA | Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. | Sbastien Collette, John Iacono |
| 2022 | ESA | Conditional Lower Bounds for Dynamic Geometric Measure Problems. | Justin Dallant, John Iacono |
| 2022 | FUN | How Fast Can We Play Tetris Greedily with Rectangular Pieces? | Justin Dallant, John Iacono |
| 2022 | ISAAC | External-Memory Dictionaries with Worst-Case Update Cost. | Rathish Das, John Iacono, Yakov Nekrich |
| 2021 | CIAC | Fragile Complexity of Adaptive Algorithms. | Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman |
| 2021 | ESA | An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. | Jean Cardinal, Justin Dallant, John Iacono |
| 2021 | ESA | Worst-Case Efficient Dynamic Geometric Independent Set. | Jean Cardinal, John Iacono, Grigorios Koumoutsos |
| 2021 | ISAAC | Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. | Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir |
| 2020 | SODA | Competitive Online Search Trees on Trees. | Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2019 | CSR | Belga B-Trees. | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2019 | ESA | External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. | John Iacono, Riko Jacob, Konstantinos Tsakalidis |
| 2019 | ISAAC | External Memory Planar Point Location with Fast Updates. | John Iacono, Ben Karsin, Grigorios Koumoutsos |
| 2018 | ESA | Dynamic Trees with Almost-Optimal Access Cost. | Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2018 | ICS | Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. | Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava |
| 2017 | WADS | Searching Edges in the Overlap of Two Plane Graphs. | John Iacono, Elena Khramtcova, Stefan Langerman |
| 2016 | COCOA | A Linear Potential Function for Pairing Heaps. | John Iacono, Mark V. Yagnatinsky |
| 2016 | ESA | Solving k-SUM Using Few Linear Queries. | Jean Cardinal, John Iacono, Aurlien Ooms |
| 2016 | SODA | Weighted dynamic finger in binary search trees. | John Iacono, Stefan Langerman |
| 2015 | CPM | Range Minimum Query Indexes in Higher Dimensions. | Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein |
| 2014 | ESA | Cache-Oblivious Persistence. | Pooya Davoodi, Jeremy T. Fineman, John Iacono, zgr zkan |
| 2014 | ICALP | Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. | John Iacono, zgr zkan |
| 2014 | ISAAC | The Power and Limitations of Static Binary Search Trees with Lazy Finger. | Prosenjit Bose, Karim Doueb, John Iacono, Stefan Langerman |
| 2014 | SODA | The Complexity of Order Type Isomorphism. | Greg Aloupis, John Iacono, Stefan Langerman, zgr zkan, Stefanie Wuhrer |
| 2013 | ESA | Encodings for Range Selection and Top-k Queries. | Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti |
| 2013 | ICALP | Combining Binary Search Trees. | Erik D. Demaine, John Iacono, Stefan Langerman, zgr zkan |
| 2012 | SODA | Confluent persistence revisited. | Sbastien Collette, John Iacono, Stefan Langerman |
| 2012 | SODA | Using hashing to solve the dictionary problem. | John Iacono, Mihai Patrascu |
| 2011 | ISAAC | Encoding 2D Range Maximum Queries. | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
| 2011 | IWOCA | A Unifying Property for Distribution-Sensitive Priority Queues. | Amr Elmasry, Arash Farzan, John Iacono |
| 2010 | COCOA | Coverage with | Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristn Adinolfi, Diane L. Souvaine, Ryuhei Uehara |
| 2010 | ICALP | Mergeable Dictionaries. | John Iacono, zgr zkan |
| 2010 | ISAAC | Unit-Time Predecessor Queries on Massive Data Sets. | Andrej Brodnik, John Iacono |
| 2010 | SODA | Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. | Gerth Stlting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
| 2009 | SODA | The geometry of binary search trees. | Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu |
| 2009 | WADS | Minimal Locked Trees. | Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon |
| 2008 | SODA | Distribution-sensitive point location in convex subdivisions. | Sbastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin |
| 2006 | ESA | Necklaces, Convolutions, and | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian |
| 2006 | LATIN | Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. | Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid |
| 2006 | LATIN | The Complexity of Diffuse Reflections in a Simple Polygon. | Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu |
| 2004 | FOCS | Dynamic Optimality - Almost. | Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu |
| 2004 | SODA | Retroactive data structures. | Erik D. Demaine, John Iacono, Stefan Langerman |
| 2003 | FOCS | The Cost of Cache-Oblivious Searching. | Michael A. Bender, Gerth Stlting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro Lpez-Ortiz |
| 2003 | WADS | Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. | David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint |
| 2002 | ISAAC | Key Independent Optimality. | John Iacono |
| 2002 | ISAAC | Queaps. | John Iacono, Stefan Langerman |
| 2002 | LATIN | In-Place Planar Convex Hull Algorithms. | Herv Brnnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint |
| 2002 | SODA | A locality-preserving cache-oblivious dynamic dictionary. | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu |
| 2001 | SODA | Optimal planar point location. | John Iacono |
| 2001 | SODA | Alternatives to splay trees with O(log n) worst-case access times. | John Iacono |