John Iacono

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 80

Top Venues

Publications

John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
Vertex Ranking of Degenerate Graphs. CoRR (2024)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA (2024)
Justin Dallant, John Iacono
How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. 992 (2024)
Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Fast and Simple Sorting Using Partial Information. CoRR (2024)
Sébastien Collette, John Iacono
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. SODA (2024)
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
Dynamic Schnyder woods. CCCG (2023)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109 (2023)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19 (3) (2023)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR (2023)
Sébastien Collette, John Iacono
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. CoRR (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13 (5) (2023)
Rathish Das, John Iacono, Yakov Nekrich
External-Memory Dictionaries with Worst-Case Update Cost. ISAAC (2022)
Rathish Das, John Iacono, Yakov Nekrich
External-memory dictionaries with worst-case update cost. CoRR (2022)
Justin Dallant, John Iacono
How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN (2022)
Justin Dallant, John Iacono
How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR (2022)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919 (2022)
Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava
Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS (2022)
Justin Dallant, John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA (2022)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CoRR (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR (2021)
Jean Cardinal, John Iacono, Grigorios Koumoutsos
Worst-Case Efficient Dynamic Geometric Independent Set. CoRR (2021)
Justin Dallant, John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR (2021)
Jean Cardinal, John Iacono
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA (2021)
Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
Dynamic Schnyder Woods. CoRR (2021)
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11 (1) (2021)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-Trees. Theory Comput. Syst. 65 (3) (2021)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CIAC (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CoRR (2021)
Jean Cardinal, John Iacono, Grigorios Koumoutsos
Worst-Case Efficient Dynamic Geometric Independent Set. ESA (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CCCG (2021)
Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
Dynamic Geometric Independent Set. CoRR (2020)
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. CoRR (2020)
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR (2020)
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28 (2020)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. SODA (2020)
Mirela Damian, John Iacono, Andrew Winslow
Spanning Properties of Theta-Theta-6. Graphs Comb. 36 (3) (2020)
Jean Cardinal, John Iacono
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. CoRR (2020)
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
Encoding 3SUM. CoRR (2019)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. CoRR (2019)
John Iacono, Riko Jacob, Konstantinos Tsakalidis
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ESA (2019)
John Iacono, Varunkumar Jayapaul, Ben Karsin
Locality. CoRR (2019)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-Trees. CSR (2019)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-trees. CoRR (2019)
John Iacono, Ben Karsin, Grigorios Koumoutsos
External Memory Planar Point Location with Fast Updates. ISAAC (2019)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic encodings for point configurations. J. Comput. Geom. 10 (2) (2019)
John Iacono, Ben Karsin, Grigorios Koumoutsos
External Memory Planar Point Location with Fast Updates. CoRR (2019)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61 (4) (2019)
John Iacono, Ben Karsin, Nodari Sitchinava
A parallel priority queue with fast updates for GPU architectures. CoRR (2019)
John Iacono, Riko Jacob, Konstantinos Tsakalidis
External memory priority queues with decrease-key and applications to graph algorithms. CoRR (2019)
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) (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. CoRR (2018)
John Iacono, Stefan Langerman
Weighted dynamic finger in binary search trees. CoRR (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)
Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. ICS (2018)
Mirela Damian, John Iacono, Andrew Winslow
Spanning Properties of Theta-Theta-6. CoRR (2018)
Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman
Encoding nearest larger values. Theor. Comput. Sci. 710 (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. ESA (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. CoRR (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. SoCG (2018)
John Iacono, Elena Khramtcova, Stefan Langerman
Searching Edges in the Overlap of Two Plane Graphs. WADS (2017)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58 (4) (2017)
Boris Aronov, John Iacono, Khadijeh Sheikhan
Nearest-Neighbor Search Under Uncertainty. CCCG (2017)
Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert
An Efficient Multiway Mergesort for GPU Architectures. CoRR (2017)
John Iacono, Elena Khramtcova, Stefan Langerman
Searching edges in the overlap of two plane graphs. CoRR (2017)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Queries. ACM Trans. Algorithms 13 (2) (2017)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG (2017)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
Encoding 2D range maximum queries. Theor. Comput. Sci. 609 (2016)
Jean Cardinal, John Iacono, Aurélien Ooms
Solving k-SUM Using Few Linear Queries. ESA (2016)
John Iacono, Mark V. Yagnatinsky
A Linear Potential Function for Pairing Heaps. CoRR (2016)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi diagrams. SoCG (2016)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi Diagrams. CoRR (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) (2016)
John Iacono, Mark V. Yagnatinsky
A Linear Potential Function for Pairing Heaps. COCOA (2016)
John Iacono, Stefan Langerman
Weighted dynamic finger in binary search trees. SODA (2016)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR (2016)
Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
Range Minimum Query Indexes in Higher Dimensions. CPM (2015)
Erik D. Demaine, John Iacono, Stefan Langerman
Worst-Case Optimal Tree Layout in External Memory. Algorithmica 72 (2) (2015)
John Iacono, Özgür Özkan
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) (2014)
Frank Dehne, John Iacono
Foreword. Comput. Geom. 47 (2) (2014)
Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
Cache-Oblivious Persistence. ESA (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) (2014)
Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC (2014)
Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
Cache-Oblivious Persistence. CoRR (2014)
Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer
The Complexity of Order Type Isomorphism. SODA (2014)
John Iacono, Özgür Özkan
A Tight Lower Bound for Decrease-Key in the Pure Heap Model. CoRR (2014)
Amr Elmasry, Arash Farzan, John Iacono
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50 (4) (2013)
John Iacono
In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
Oja centers and centers of gravity. Comput. Geom. 46 (2) (2013)
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
Combining Binary Search Trees. ICALP (1) (2013)
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)
John Howat, John Iacono, Pat Morin
The Fresh-Finger Property CoRR (2013)
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
Combining Binary Search Trees CoRR (2013)
John Iacono
Why some heaps support constant-amortized-time decrease-key operations, and others do not CoRR (2013)
John Iacono
In pursuit of the dynamic optimality conjecture. CoRR (2013)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Encodings for Range Selection and Top-k Queries. ESA (2013)
Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan
The Complexity of Order Type Isomorphism. CoRR (2013)
Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer
Efficient reconfiguration of lattice-based modular robots. Comput. Geom. 46 (8) (2013)

John Iacono.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

John Iacono