default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Iacono
Person information
- affiliation: Université libre de Bruxelles, Brussels, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. Discret. Comput. Geom. 72(2): 483-502 (2024)- [j45]Justin Dallant, John Iacono:
How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. 992: 114405 (2024) - [c79]Sébastien Collette, John Iacono:
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. SODA 2024: 2657-2678 - [c78]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA 2024: 215-223 - [e2]Timothy M. Chan, Johannes Fischer, John Iacono, Grzegorz Herman:
32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. LIPIcs 308, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-338-6 [contents] - [i60]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. CoRR abs/2404.04552 (2024) - [i59]John Iacono, Piotr Micek, Pat Morin, Bruce A. Reed:
Vertex Ranking of Degenerate Graphs. CoRR abs/2404.16340 (2024) - 2023
- [j44]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: 101945 (2023) - [j43]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - [c77]Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - [i58]Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono:
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR abs/2311.12471 (2023) - [i57]Sébastien Collette, John Iacono:
Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic. CoRR abs/2312.04235 (2023) - [i56]Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant:
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13(5): 114-135 (2023) - 2022
- [j42]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022) - [c76]Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava:
Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS 2022: 31-45 - [c75]Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA 2022: 39:1-39:17 - [c74]Justin Dallant, John Iacono:
How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN 2022: 13:1-13:19 - [c73]Rathish Das, John Iacono, Yakov Nekrich:
External-Memory Dictionaries with Worst-Case Update Cost. ISAAC 2022: 21:1-21:13 - [i55]Justin Dallant, John Iacono:
How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR abs/2202.10771 (2022) - [i54]Rathish Das, John Iacono, Yakov Nekrich:
External-memory dictionaries with worst-case update cost. CoRR abs/2211.06044 (2022) - 2021
- [j41]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. Theory Comput. Syst. 65(3): 541-558 (2021) - [c72]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021: 149-156 - [c71]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157 - [c70]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021: 24:1-24:14 - [c69]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. ESA 2021: 25:1-25:15 - [c68]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: 3:1-3:15 - [c67]Jean Cardinal, John Iacono:
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. SOSA 2021: 45-56 - [i53]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021) - [i52]Jean Cardinal, Justin Dallant, John Iacono:
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR abs/2106.05638 (2021) - [i51]Jean Cardinal, Justin Dallant, John Iacono:
Approximability of (Simultaneous) Class Cover for Boxes. CoRR abs/2106.12969 (2021) - [i50]Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono:
Dynamic Schnyder Woods. CoRR abs/2106.14451 (2021) - [i49]Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. CoRR abs/2108.08050 (2021) - [i48]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 abs/2109.07587 (2021) - [i47]Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR abs/2112.10095 (2021) - [i46]Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran:
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11(1): 1-23 (2021) - 2020
- [j40]Mirela Damian, John Iacono, Andrew Winslow:
Spanning Properties of Theta-Theta-6. Graphs Comb. 36(3): 525-538 (2020) - [j39]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28: 766-774 (2020) - [c66]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. SODA 2020: 1878-1891 - [i45]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 abs/2004.07996 (2020) - [i44]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR abs/2007.01686 (2020) - [i43]Sujoy Bhore, Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Dynamic Geometric Independent Set. CoRR abs/2007.08643 (2020) - [i42]Jean Cardinal, John Iacono:
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. CoRR abs/2008.08417 (2020)
2010 – 2019
- 2019
- [j38]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61(4): 698-734 (2019) - [j37]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic encodings for point configurations. J. Comput. Geom. 10(2): 99-126 (2019) - [c65]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. CSR 2019: 93-105 - [c64]John Iacono, Riko Jacob, Konstantinos Tsakalidis:
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ESA 2019: 60:1-60:14 - [c63]John Iacono, Ben Karsin, Grigorios Koumoutsos:
External Memory Planar Point Location with Fast Updates. ISAAC 2019: 58:1-58:18 - [i41]John Iacono, Varunkumar Jayapaul, Ben Karsin:
Locality. CoRR abs/1902.07928 (2019) - [i40]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i39]John Iacono, Riko Jacob, Konstantinos Tsakalidis:
External memory priority queues with decrease-key and applications to graph algorithms. CoRR abs/1903.03147 (2019) - [i38]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-trees. CoRR abs/1903.03560 (2019) - [i37]John Iacono, Ben Karsin, Grigorios Koumoutsos:
External Memory Planar Point Location with Fast Updates. CoRR abs/1905.02620 (2019) - [i36]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. CoRR abs/1908.00848 (2019) - [i35]John Iacono, Ben Karsin, Nodari Sitchinava:
A parallel priority queue with fast updates for GPU architectures. CoRR abs/1908.09378 (2019) - 2018
- [j36]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) - [j35]Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman:
Encoding nearest larger values. Theor. Comput. Sci. 710: 97-115 (2018) - [c62]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 - [c61]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. SoCG 2018: 20:1-20:14 - [c60]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 - [c59]Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava:
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. ICS 2018: 86-95 - [i34]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. CoRR abs/1801.01767 (2018) - [i33]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - [i32]Mirela Damian, John Iacono, Andrew Winslow:
Spanning Properties of Theta-Theta-6. CoRR abs/1808.04744 (2018) - [i31]John Iacono, Stefan Langerman:
Weighted dynamic finger in binary search trees. CoRR abs/1810.01785 (2018) - 2017
- [j34]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58(4): 822-848 (2017) - [j33]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) - [c58]Boris Aronov, John Iacono, Khadijeh Sheikhan:
Nearest-Neighbor Search Under Uncertainty. CCCG 2017: 89-94 - [c57]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - [c56]John Iacono, Elena Khramtcova, Stefan Langerman:
Searching Edges in the Overlap of Two Plane Graphs. WADS 2017: 473-484 - [i30]John Iacono, Elena Khramtcova, Stefan Langerman:
Searching edges in the overlap of two plane graphs. CoRR abs/1701.02229 (2017) - [i29]Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert:
An Efficient Multiway Mergesort for GPU Architectures. CoRR abs/1702.07961 (2017) - 2016
- [j32]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) - [j31]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) - [c55]John Iacono, Mark V. Yagnatinsky:
A Linear Potential Function for Pairing Heaps. COCOA 2016: 489-504 - [c54]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi diagrams. SoCG 2016: 15:1-15:16 - [c53]Jean Cardinal, John Iacono, Aurélien Ooms:
Solving k-SUM Using Few Linear Queries. ESA 2016: 25:1-25:17 - [c52]John Iacono, Stefan Langerman:
Weighted dynamic finger in binary search trees. SODA 2016: 672-691 - [i28]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. CoRR abs/1603.08485 (2016) - [i27]John Iacono, Mark V. Yagnatinsky:
A Linear Potential Function for Pairing Heaps. CoRR abs/1606.06389 (2016) - [i26]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
- [j30]Erik D. Demaine, John Iacono, Stefan Langerman:
Worst-Case Optimal Tree Layout in External Memory. Algorithmica 72(2): 369-378 (2015) - [c51]Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
Range Minimum Query Indexes in Higher Dimensions. CPM 2015: 149-159 - 2014
- [j29]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) - [j28]Frank Dehne, John Iacono:
Foreword. Comput. Geom. 47(2): 199 (2014) - [c50]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. ESA 2014: 296-308 - [c49]John Iacono, Özgür Özkan:
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) 2014: 637-649 - [c48]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 - [c47]Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. SODA 2014: 405-415 - [i25]Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan:
Cache-Oblivious Persistence. CoRR abs/1402.5492 (2014) - [i24]John Iacono, Özgür Özkan:
A Tight Lower Bound for Decrease-Key in the Pure Heap Model. CoRR abs/1407.6665 (2014) - 2013
- [j27]Amr Elmasry, Arash Farzan, John Iacono:
On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50(4): 289-295 (2013) - [j26]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin:
Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013) - [j25]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): 917-928 (2013) - [j24]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:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [c46]John Iacono:
In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms 2013: 236-250 - [c45]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 - [c44]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Encodings for Range Selection and Top-k Queries. ESA 2013: 553-564 - [c43]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan:
Combining Binary Search Trees. ICALP (1) 2013: 388-399 - [i23]John Iacono:
Why some heaps support constant-amortized-time decrease-key operations, and others do not. CoRR abs/1302.6641 (2013) - [i22]John Howat, John Iacono, Pat Morin:
The Fresh-Finger Property. CoRR abs/1302.6914 (2013) - [i21]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) - [i20]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan:
Combining Binary Search Trees. CoRR abs/1304.7604 (2013) - [i19]John Iacono:
In pursuit of the dynamic optimality conjecture. CoRR abs/1306.0207 (2013) - [i18]Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan:
The Complexity of Order Type Isomorphism. CoRR abs/1311.0928 (2013) - 2012
- [j23]John Iacono, Wolfgang Mulzer:
A Static Optimality Transformation with Applications to Planar Point Location. Int. J. Comput. Geom. Appl. 22(4): 327-340 (2012) - [j22]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. Geom. Appl. 22(5): 439-470 (2012) - [j21]Amr Elmasry, Arash Farzan, John Iacono:
A priority queue with the time-finger property. J. Discrete Algorithms 16: 206-212 (2012) - [j20]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) - [c42]John Iacono, Mihai Patrascu:
Using hashing to solve the dictionary problem. SODA 2012: 570-582 - [c41]Sébastien Collette, John Iacono, Stefan Langerman:
Confluent persistence revisited. SODA 2012: 593-601 - [i17]Sarah R. Allen, John Iacono:
Packing identical simple polygons is NP-hard. CoRR abs/1209.5307 (2012) - [i16]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
- [j19]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) - [j18]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke:
Continuous Blooming of Convex Polyhedra. Graphs Comb. 27(3): 363-376 (2011) - [c40]John Iacono:
A static optimality transformation with applications to planar point location. SCG 2011: 21-26 - [c39]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189 - [c38]Amr Elmasry, Arash Farzan, John Iacono:
A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222 - [c37]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono:
Meshes Preserving Minimum Feature Size. EGC 2011: 258-273 - [e1]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 [contents] - [i15]John Iacono, Mihai Patrascu:
Using Hashing to Solve the Dictionary Problem (In External Memory). CoRR abs/1104.2799 (2011) - [i14]