John Iacono - RankMe

199 papers A* 20A 13B 16C 3Misc 2Journal 112Unranked 33

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A General Technique for Searching in Implicit Sets via Function Inversion. Algorithmica Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2026	J	`jnl`	Partition-based Simple Heaps. CoRR Gerth Stølting Brodal, John Iacono, Casper Moldrup Rysgaard, Sebastian Wild
2025	J	`jnl`	Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191). Dagstuhl Reports Michael A. Bender, John Iacono, László Kozma, Eva Rotenberg, Justin Dallant
2025	A	`conf`	An Improved Bound for Plane Covering Paths. ESA 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	J	`jnl`	An Improved Bound for Plane Covering Paths. CoRR 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	J	`jnl`	Conditional Lower Bounds for Dynamic Geometric Measure Problems. ACM Trans. Algorithms Justin Dallant, John Iacono
2025	A	`conf`	External-Memory Priority Queues with Optimal Insertions. ESA Gerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning
2025	A*	`conf`	Fast and Simple Sorting Using Partial Information. SODA Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2025	A*	`conf`	Incremental Planar Nearest Neighbor Queries with Optimal Query Time. SoCG John Iacono, Yakov Nekrich
2025	J	`jnl`	Incremental Planar Nearest Neighbor Queries with Optimal Query Time. CoRR John Iacono, Yakov Nekrich
2025	B	`conf`	Tight Bounds on the Number of Closest Pairs in Vertical Slabs. WADS Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2025	J	`jnl`	Tight Bounds on the Number of Closest Pairs in Vertical Slabs. CoRR Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung, Jean-Lou De Carufel, John Iacono, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth
2024	A	`ed.`	32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024 ESA Timothy M. Chan, Johannes Fischer, John Iacono, Grzegorz Herman
2024	—	`conf`	A General Technique for Searching in Implicit Sets via Function Inversion. SOSA Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2024	A*	`conf`	Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. SODA Sébastien Collette, John Iacono
2024	J	`jnl`	Fast and Simple Sorting Using Partial Information. CoRR Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2024	J	`jnl`	How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. Justin Dallant, John Iacono
2024	J	`jnl`	The Complexity of Order Type Isomorphism. Discret. Comput. Geom. Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer
2024	J	`jnl`	Vertex Ranking of Degenerate Graphs. CoRR John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed
2023	J	`jnl`	A General Technique for Searching in Implicit Sets via Function Inversion. CoRR Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2023	J	`jnl`	Competitive Online Search Trees on Trees. ACM Trans. Algorithms Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2023	J	`jnl`	Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. CoRR Sébastien Collette, John Iacono
2023	—	`conf`	Dynamic Schnyder woods. CCCG Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
2023	J	`jnl`	Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
2023	J	`jnl`	Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2022	A	`conf`	Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA Justin Dallant, John Iacono
2022	B	`conf`	External-Memory Dictionaries with Worst-Case Update Cost. ISAAC Rathish Das, John Iacono, Yakov Nekrich
2022	J	`jnl`	External-memory dictionaries with worst-case update cost. CoRR Rathish Das, John Iacono, Yakov Nekrich
2022	J	`jnl`	Fragile complexity of adaptive algorithms. Theor. Comput. Sci. Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2022	J	`jnl`	How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR Justin Dallant, John Iacono
2022	Misc	`conf`	How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN Justin Dallant, John Iacono
2022	—	`conf`	Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava
2021	A	`conf`	An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA Jean Cardinal, Justin Dallant, John Iacono
2021	J	`jnl`	An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR Jean Cardinal, Justin Dallant, John Iacono
2021	—	`conf`	Approximability of (Simultaneous) Class Cover for Boxes. CCCG Jean Cardinal, Justin Dallant, John Iacono
2021	J	`jnl`	Approximability of (Simultaneous) Class Cover for Boxes. CoRR Jean Cardinal, Justin Dallant, John Iacono
2021	J	`jnl`	Belga B-Trees. Theory Comput. Syst. Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2021	J	`jnl`	Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR Justin Dallant, John Iacono
2021	J	`jnl`	Dynamic Schnyder Woods. CoRR Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
2021	C	`conf`	Fragile Complexity of Adaptive Algorithms. CIAC Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021	J	`jnl`	Fragile Complexity of Adaptive Algorithms. CoRR Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
2021	—	`conf`	Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA Jean Cardinal, John Iacono
2021	J	`jnl`	Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
2021	B	`conf`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	J	`jnl`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	A	`conf`	Worst-Case Efficient Dynamic Geometric Independent Set. ESA Jean Cardinal, John Iacono, Grigorios Koumoutsos
2021	J	`jnl`	Worst-Case Efficient Dynamic Geometric Independent Set. CoRR Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020	J	`jnl`	Compatible Paths on Labelled Point Sets. CoRR Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
2020	A*	`conf`	Competitive Online Search Trees on Trees. SODA Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2020	J	`jnl`	Dynamic Geometric Independent Set. CoRR Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos
2020	J	`jnl`	Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. CoRR Jean Cardinal, John Iacono
2020	J	`jnl`	Spanning Properties of Theta-Theta-6. Graphs Comb. Mirela Damian, John Iacono, Andrew Winslow
2020	J	`jnl`	Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
2020	J	`jnl`	Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
2019	J	`jnl`	A parallel priority queue with fast updates for GPU architectures. CoRR John Iacono, Ben Karsin, Nodari Sitchinava
2019	Misc	`conf`	Belga B-Trees. CSR Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019	J	`jnl`	Belga B-trees. CoRR Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019	J	`jnl`	Competitive Online Search Trees on Trees. CoRR Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2019	J	`jnl`	Encoding 3SUM. CoRR Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
2019	B	`conf`	External Memory Planar Point Location with Fast Updates. ISAAC John Iacono, Ben Karsin, Grigorios Koumoutsos
2019	J	`jnl`	External Memory Planar Point Location with Fast Updates. CoRR John Iacono, Ben Karsin, Grigorios Koumoutsos
2019	A	`conf`	External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ESA John Iacono, Riko Jacob, Konstantinos Tsakalidis
2019	J	`jnl`	External memory priority queues with decrease-key and applications to graph algorithms. CoRR John Iacono, Riko Jacob, Konstantinos Tsakalidis
2019	J	`jnl`	Locality. CoRR John Iacono, Varunkumar Jayapaul, Ben Karsin
2019	J	`jnl`	Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2019	J	`jnl`	Subquadratic encodings for point configurations. J. Comput. Geom. Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018	A	`conf`	Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. ICS Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava
2018	—	`conf`	Compatible Paths on Labelled Point Sets. CCCG Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth
2018	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2018	A	`conf`	Dynamic Trees with Almost-Optimal Access Cost. ESA Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Dynamic Trees with Almost-Optimal Access Cost. CoRR Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Encoding nearest larger values. Theor. Comput. Sci. Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman
2018	J	`jnl`	Spanning Properties of Theta-Theta-6. CoRR Mirela Damian, John Iacono, Andrew Winslow
2018	A*	`conf`	Subquadratic Encodings for Point Configurations. SoCG Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018	J	`jnl`	Subquadratic Encodings for Point Configurations. CoRR Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
2018	J	`jnl`	Weighted dynamic finger in binary search trees. CoRR John Iacono, Stefan Langerman
2017	J	`jnl`	An Efficient Multiway Mergesort for GPU Architectures. CoRR Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert
2017	J	`jnl`	Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- ACM Trans. Algorithms Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
2017	J	`jnl`	Incremental Voronoi Diagrams. Discret. Comput. Geom. Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
2017	—	`conf`	Nearest-Neighbor Search Under Uncertainty. CCCG Boris Aronov, John Iacono, Khadijeh Sheikhan
2017	B	`conf`	Searching Edges in the Overlap of Two Plane Graphs. WADS John Iacono, Elena Khramtcova, Stefan Langerman
2017	J	`jnl`	Searching edges in the overlap of two plane graphs. CoRR John Iacono, Elena Khramtcova, Stefan Langerman
2017	A*	`conf`	Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2016	C	`conf`	A Linear Potential Function for Pairing Heaps. COCOA John Iacono, Mark V. Yagnatinsky
2016	J	`jnl`	A Linear Potential Function for Pairing Heaps. CoRR John Iacono, Mark V. Yagnatinsky
2016	J	`jnl`	Encoding 2D range maximum queries. Theor. Comput. Sci. Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
2016	J	`jnl`	Incremental Voronoi Diagrams. CoRR Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
2016	A*	`conf`	Incremental Voronoi diagrams. SoCG Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
2016	A	`conf`	Solving k-SUM Using Few Linear Queries. ESA Jean Cardinal, John Iacono, Aurélien Ooms
2016	J	`jnl`	Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
2016	J	`jnl`	The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
2016	A*	`conf`	Weighted dynamic finger in binary search trees. SODA John Iacono, Stefan Langerman
2015	B	`conf`	Range Minimum Query Indexes in Higher Dimensions. CPM Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein
2015	J	`jnl`	Worst-Case Optimal Tree Layout in External Memory. Algorithmica Erik D. Demaine, John Iacono, Stefan Langerman
2014	J	`jnl`	A Tight Lower Bound for Decrease-Key in the Pure Heap Model. CoRR John Iacono, Özgür Özkan
2014	A	`conf`	Cache-Oblivious Persistence. ESA Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
2014	J	`jnl`	Cache-Oblivious Persistence. CoRR Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
2014	J	`jnl`	Foreword. Comput. Geom. Frank Dehne, John Iacono
2014	J	`jnl`	Necklaces, Convolutions, and X+Y. Algorithmica David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2014	A*	`conf`	The Complexity of Order Type Isomorphism. SODA Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer
2014	B	`conf`	The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
2014	—	`conf`	Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) John Iacono, Özgür Özkan
2013	J	`jnl`	Combining Binary Search Trees CoRR Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
2013	—	`conf`	Combining Binary Search Trees. ICALP (1) Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
2013	J	`jnl`	Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 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 Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara
2013	J	`jnl`	Efficient reconfiguration of lattice-based modular robots. Comput. Geom. Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer
2013	A	`conf`	Encodings for Range Selection and Top-k Queries. ESA Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2013	—	`conf`	How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky
2013	—	`conf`	In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms John Iacono
2013	J	`jnl`	In pursuit of the dynamic optimality conjecture. CoRR John Iacono
2013	J	`jnl`	Oja centers and centers of gravity. Comput. Geom. Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
2013	J	`jnl`	On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica Amr Elmasry, Arash Farzan, John Iacono
2013	J	`jnl`	The Complexity of Order Type Isomorphism. CoRR Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan
2013	J	`jnl`	The Fresh-Finger Property CoRR John Howat, John Iacono, Pat Morin
2013	J	`jnl`	The Power and Limitations of Static Binary Search Trees with Lazy Finger CoRR Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
2013	J	`jnl`	Why some heaps support constant-amortized-time decrease-key operations, and others do not CoRR John Iacono
2012	J	`jnl`	A Static Optimality Transformation with Applications to Planar Point Location. Int. J. Comput. Geom. Appl. John Iacono, Wolfgang Mulzer
2012	J	`jnl`	A priority queue with the time-finger property. J. Discrete Algorithms Amr Elmasry, Arash Farzan, John Iacono
2012	A*	`conf`	Confluent persistence revisited. SODA Sébastien Collette, John Iacono, Stefan Langerman
2012	J	`jnl`	Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
2012	J	`jnl`	Necklaces, Convolutions, and X+Y CoRR David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2012	J	`jnl`	PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood
2012	J	`jnl`	Packing identical simple polygons is NP-hard CoRR Sarah R. Allen, John Iacono
2012	A*	`conf`	Using hashing to solve the dictionary problem. SODA John Iacono, Mihai Patrascu
2011	J	`jnl`	A Static Optimality Transformation with Applications to Planar Point Location CoRR John Iacono, Wolfgang Mulzer
2011	C	`conf`	A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA Amr Elmasry, Arash Farzan, John Iacono
2011	—	`conf`	A static optimality transformation with applications to planar point location. SCG John Iacono
2011	B	`ed.`	Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings WADS Frank Dehne, John Iacono, Jörg-Rüdiger Sack
2011	J	`jnl`	Confluent Persistence Revisited CoRR Sébastien Collette, John Iacono, Stefan Langerman
2011	J	`jnl`	Continuous Blooming of Convex Polyhedra. Graphs Comb. Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke
2011	J	`jnl`	Encoding 2-D Range Maximum Queries CoRR Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011	B	`conf`	Encoding 2D Range Maximum Queries. ISAAC Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011	J	`jnl`	Improved Upper Bounds for Pairing Heaps CoRR John Iacono
2011	—	`conf`	Meshes Preserving Minimum Feature Size. EGC Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono
2011	J	`jnl`	The Cost of Cache-Oblivious Searching. Algorithmica Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2011	J	`jnl`	Using Hashing to Solve the Dictionary Problem (In External Memory) CoRR John Iacono, Mihai Patrascu
2010	A*	`conf`	Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
2010	—	`conf`	Common Unfoldings of Polyominoes and Polycubes. CGGA Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
2010	—	`conf`	Coverage with COCOA (2) 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 Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara
2010	J	`jnl`	Editorial. Comput. Geom. John Iacono
2010	J	`jnl`	Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geom. Appl. Erik D. Demaine, John Iacono, Stefan Langerman
2010	J	`jnl`	Mergeable Dictionaries CoRR John Iacono, Özgür Özkan
2010	—	`conf`	Mergeable Dictionaries. Data Structures John Iacono, Özgür Özkan
2010	—	`conf`	Mergeable Dictionaries. ICALP (1) John Iacono, Özgür Özkan
2010	—	`conf`	Oja medians and centers of gravity. CCCG Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
2010	J	`jnl`	Priority Queues with Multiple Time Fingers CoRR Amr Elmasry, Arash Farzan, John Iacono
2010	—	`conf`	Unit-Time Predecessor Queries on Massive Data Sets. ISAAC (1) Andrej Brodnik, John Iacono
2009	J	`jnl`	Continuous Blooming of Convex Polyhedra CoRR Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke
2009	J	`jnl`	Detecting all regular polygons in a point set CoRR Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman
2009	—	`conf`	Efficient Reconfiguration of Lattice-Based Modular Robots. ECMR Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer
2009	J	`jnl`	Entropy, Triangulation, and Point Location in Planar Subdivisions CoRR Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
2009	B	`conf`	Minimal Locked Trees. WADS Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, Sheung-Hung Poon
2009	J	`jnl`	Minimum feature size preserving decompositions CoRR Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono
2009	—	`conf`	Packing 2×2 unit squares into grid polygons is NP-complete. CCCG Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme
2009	A*	`conf`	The geometry of binary search trees. SODA Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu
2009	J	`jnl`	Wrapping spheres with flat paper. Comput. Geom. Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman
2008	A*	`conf`	Distribution-sensitive point location in convex subdivisions. SODA Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin
2008	J	`jnl`	Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin
2008	—	`conf`	Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote
2007	J	`jnl`	A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
2007	J	`jnl`	Dynamic Optimality - Almost. SIAM J. Comput. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
2007	J	`jnl`	Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
2007	J	`jnl`	Retroactive data structures. ACM Trans. Algorithms Erik D. Demaine, John Iacono, Stefan Langerman
2006	J	`jnl`	An J. Comput. Biol. Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2006	—	`conf`	Curves in the Sand: Algorithmic Drawing. CCCG 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
2006	B	`conf`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. LATIN Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2006	A	`conf`	Necklaces, Convolutions, and ESA David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
2006	—	`conf`	Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. CCCG Dania El-Khechen, Thomas Fevens, John Iacono
2006	B	`conf`	The Complexity of Diffuse Reflections in a Simple Polygon. LATIN Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu
2005	J	`jnl`	An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment CoRR Justin Colannino, Mirela Damian, Ferran Hurtado, John Iacono, Henk Meijer, Suneeta Ramaswami, Godfried T. Toussaint
2005	J	`jnl`	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams CoRR Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
2005	J	`jnl`	Key-Independent Optimality. Algorithmica John Iacono
2005	J	`jnl`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2005	J	`jnl`	Queaps. Algorithmica John Iacono, Stefan Langerman
2005	J	`jnl`	Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	J	`jnl`	A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
2004	A*	`conf`	Dynamic Optimality - Almost. FOCS Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
2004	J	`jnl`	Expected asymptotically optimal planar point location. Comput. Geom. John Iacono
2004	—	`conf`	Geodesic ham-sandwich cuts. SCG Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
2004	—	`conf`	Grid Vertex-Unfolding Orthostacks. JCDCG Erik D. Demaine, John Iacono, Stefan Langerman
2004	J	`jnl`	Proximate point searching. Comput. Geom. Erik D. Demaine, John Iacono, Stefan Langerman
2004	A*	`conf`	Retroactive data structures. SODA Erik D. Demaine, John Iacono, Stefan Langerman
2004	—	`conf`	Separating point sets in polygonal environments. SCG Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
2004	J	`jnl`	Space-efficient planar convex hull algorithms. Theor. Comput. Sci. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2004	J	`jnl`	Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR Erik D. Demaine, John Iacono, Stefan Langerman
2003	—	`conf`	A 3-D visualization of kirkpatrick's planar point location algorithm. SCG John Iacono
2003	B	`conf`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2003	—	`conf`	Proximate planar point location. SCG John Iacono, Stefan Langerman
2003	A*	`conf`	The Cost of Cache-Oblivious Searching. FOCS Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
2002	A*	`conf`	A locality-preserving cache-oblivious dynamic dictionary. SODA Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
2002	B	`conf`	In-Place Planar Convex Hull Algorithms. LATIN Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
2002	B	`conf`	Key Independent Optimality. ISAAC John Iacono
2002	—	`conf`	Proximate point searching. CCCG Erik D. Demaine, John Iacono, Stefan Langerman
2002	B	`conf`	Queaps. ISAAC John Iacono, Stefan Langerman
2001	A*	`conf`	Alternatives to splay trees with O(log n) worst-case access times. SODA John Iacono
2001	A*	`conf`	Optimal planar point location. SODA John Iacono
2000	—	`conf`	Dynamic point location in fat hyperrectangles with integer coordinates. CCCG John Iacono, Stefan Langerman
2000	—	`conf`	Improved Upper Bounds for Pairing Heaps. SWAT John Iacono
2000	—	`conf`	Volume Queries in Polyhedra. JCDCG John Iacono, Stefan Langerman