Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
John Iacono
2010 – today
- 2013
[j27]Amr Elmasry, Arash Farzan, John Iacono: On the hierarchy of distribution-sensitive properties for data structures. Acta Inf. 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 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 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)
- [i20]John Iacono: Why some heaps support constant-amortized-time decrease-key operations, and others do not. CoRR abs/1302.6641 (2013)
- [i19]
- [i18]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)
- [i17]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. CoRR abs/1304.7604 (2013)
- 2012
- [j23]John Iacono, Wolfgang Mulzer: A Static Optimality Transformation with Applications to Planar Point Location. Int. J. Comput. Geometry 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. Geometry 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 Transactions on Algorithms 8(3): 29 (2012)
- [c41]
- [c40]Sébastien Collette, John Iacono, Stefan Langerman: Confluent persistence revisited. SODA 2012: 593-601
- [i16]Sarah R. Allen, John Iacono: Packing identical simple polygons is NP-hard. CoRR abs/1209.5307 (2012)
- [i15]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 and Combinatorics 27(3): 363-376 (2011)
- [c39]John Iacono: A static optimality transformation with applications to planar point location. Symposium on Computational Geometry 2011: 21-26
- [c38]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189
- [c37]Amr Elmasry, Arash Farzan, John Iacono: A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222
- [e1]Frank Dehne, John Iacono, Jörg-Rüdiger Sack (Eds.): 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
- [i14]John Iacono, Mihai Patrascu: Using Hashing to Solve the Dictionary Problem (In External Memory). CoRR abs/1104.2799 (2011)
- [i13]Sébastien Collette, John Iacono, Stefan Langerman: Confluent Persistence Revisited. CoRR abs/1104.3045 (2011)
- [i12]John Iacono, Wolfgang Mulzer: A Static Optimality Transformation with Applications to Planar Point Location. CoRR abs/1104.5597 (2011)
- [i11]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011)
- [i10]
- 2010
- [j17]
- [j16]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)
- [c36]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja medians and centers of gravity. CCCG 2010: 147-150
- [c35]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
- [c34]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
- [c33]
- [c32]Andrej Brodnik, John Iacono: Unit-Time Predecessor Queries on Massive Data Sets. ISAAC (1) 2010: 133-144
- [c31]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
- [i9]
- [i8]Amr Elmasry, Arash Farzan, John Iacono: Priority Queues with Multiple Time Fingers. CoRR abs/1009.5538 (2010)
2000 – 2009
- 2009
- [j15]Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)
- [c30]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
- [c29]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
- [c28]Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
- [c27]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
- [i7]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009)
- [i6]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)
- [i5]Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set. CoRR abs/0908.2442 (2009)
- [i4]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009)
- 2008
- [j14]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)
- [c26]Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote: Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG 2008
- [c25]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921
- 2007
- [j13]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)
- [j12]Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
- [j11]Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2) (2007)
- [j10]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
- [j9]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)
- [c24]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
- [c23]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
- [c22]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
- [c21]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
- [c20]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
- [j8]
- [j7]
- [j6]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)
- [j5]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)
- [i3]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)
- [i2]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
- [j4]Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
- [j3]John Iacono: Expected asymptotically optimal planar point location. Comput. Geom. 29(1): 19-22 (2004)
- [j2]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004)
- [j1]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)
- [c19]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
- [c18]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
- [c17]Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. FOCS 2004: 484-490
- [c16]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
- [c15]
- [i1]Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy. CoRR cs.DS/0410048 (2004)
- 2003
- [c14]John Iacono, Stefan Langerman: Proximate planar point location. Symposium on Computational Geometry 2003: 220-226
- [c13]John Iacono: A 3-D visualization of kirkpatrick's planar point location algorithm. Symposium on Computational Geometry 2003: 377
- [c12]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
- [c11]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
- [c10]
- [c9]
- [c8]
- [c7]Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
- [c6]Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38
- 2001
- [c5]
- [c4]
- 2000
- [c3]John Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates. CCCG 2000
- [c2]
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:39 CEST by the dblp team