John Iacono

	2012
75		John Iacono, Mihai Patrascu: Using hashing to solve the dictionary problem. SODA 2012: 570-582
74		Sébastien Collette, John Iacono, Stefan Langerman: Confluent persistence revisited. SODA 2012: 593-601
	2011
73		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 Springer 2011
72		Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189
71		Amr Elmasry, Arash Farzan, John Iacono: A Unifying Property for Distribution-Sensitive Priority Queues. IWOCA 2011: 209-222
70		John Iacono: A static optimality transformation with applications to planar point location. Symposium on Computational Geometry 2011: 21-26
69		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)
68		John Iacono, Mihai Patrascu: Using Hashing to Solve the Dictionary Problem (In External Memory) CoRR abs/1104.2799: (2011)
67		Sébastien Collette, John Iacono, Stefan Langerman: Confluent Persistence Revisited CoRR abs/1104.3045: (2011)
66		John Iacono: A Static Optimality Transformation with Applications to Planar Point Location CoRR abs/1104.5597: (2011)
65		Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2-D Range Maximum Queries CoRR abs/1109.2885: (2011)
64		John Iacono: Improved Upper Bounds for Pairing Heaps CoRR abs/1110.4428: (2011)
63		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)
	2010
62		Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja medians and centers of gravity. CCCG 2010: 147-150
61		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
60		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
59		John Iacono, Özgür Özkan: Mergeable Dictionaries. ICALP (1) 2010: 164-175
58		Andrej Brodnik, John Iacono: Unit-Time Predecessor Queries on Massive Data Sets. ISAAC (1) 2010: 133-144
57		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
56		John Iacono, Özgür Özkan: Mergeable Dictionaries CoRR abs/1002.4248: (2010)
55		Amr Elmasry, Arash Farzan, John Iacono: Priority Queues with Multiple Time Fingers CoRR abs/1009.5538: (2010)
54		John Iacono: Editorial. Comput. Geom. 43(1): 1 (2010)
53		Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)
	2009
52		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
51		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
50		Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
49		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
48		Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions CoRR abs/0901.1908: (2009)
47		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)
46		Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set CoRR abs/0908.2442: (2009)
45		Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono: Minimum feature size preserving decompositions CoRR abs/0908.2493: (2009)
44		Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)
	2008
43		Dania El-Khechen, John Iacono, Thomas Fevens, Günter Rote: Partitioning a Polygon into Two Mirror Congruent Pieces. CCCG 2008
42		Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921
41		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)
	2007
40		Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2): (2007)
39		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)
38		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
37		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
36		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
35		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
34		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
33		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
32		Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu: The Complexity of Diffuse Reflections in a Simple Polygon. LATIN 2006: 93-104
31		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)
	2005
30		John Iacono: Key-Independent Optimality. Algorithmica 42(1): 3-10 (2005)
29		John Iacono, Stefan Langerman: Queaps. Algorithmica 42(1): 49-56 (2005)
28		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)
27		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)
26		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)
25		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)
	2004
24		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. FOCS 2004: 484-490
23		Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
22		Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. SODA 2004: 281-290
21		Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
20		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
19		Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy CoRR cs.DS/0410048: (2004)
18		Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
17		John Iacono: Expected asymptotically optimal planar point location. Comput. Geom. 29(1): 19-22 (2004)
16		Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms 53(2): 115-136 (2004)
15		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)
	2003
14		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
13		John Iacono, Stefan Langerman: Proximate planar point location. Symposium on Computational Geometry 2003: 220-226
12		John Iacono: A 3-D visualization of kirkpatrick's planar point location algorithm. Symposium on Computational Geometry 2003: 377
11		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
10		Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. CCCG 2002: 1-4
9		John Iacono, Stefan Langerman: Queaps. ISAAC 2002: 211-218
8		John Iacono: Key Independent Optimality. ISAAC 2002: 25-31
7		Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint: In-Place Planar Convex Hull Algorithms. LATIN 2002: 494-507
6		Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu: A locality-preserving cache-oblivious dynamic dictionary. SODA 2002: 29-38
	2001
5		John Iacono: Optimal planar point location. SODA 2001: 340-341
4		John Iacono: Alternatives to splay trees with O(log n) worst-case access times. SODA 2001: 516-522
	2000
3		John Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates. CCCG 2000
2		John Iacono, Stefan Langerman: Volume Queries in Polyhedra. JCDCG 2000: 156-159
1		John Iacono: Improved Upper Bounds for Pairing Heaps. SWAT 2000: 32-45

Coauthor Index

1	Vera Sacristán Adinolfi (Vera Sacristan)	[60]
2	Greg Aloupis	[45] [46] [51] [61]
3	Boris Aronov	[27] [32] [33]
4	Mihai Badoiu	[37]
5	Brad Ballinger	[49] [60]
6	Nadia Benbernou	[51] [60]
7	Michael A. Bender	[6] [14] [16] [69]
8	Prosenjit Bose	[21] [27] [33] [39] [60] [61]
9	David Bremner	[11] [26] [34] [41]
10	Gerth Stølting Brodal	[14] [57] [69]
11	Andrej Brodnik	[58]
12	Hervé Brönnimann	[7] [15]
13	Jean Cardinal	[46]
14	Timothy M. Chan	[34]
15	David Charlton	[49]
16	Dan Chen	[41] [62]
17	Justin Colannino	[28] [31]
18	Richard Cole	[37]
19	Sébastien Collette	[42] [46] [48] [61] [67] [74]
20	Mirela Damian (Mirela Damian-Iordache)	[28] [31] [36] [51] [60]
21	Alan R. Davis	[32]
22	Frank K. H. A. Dehne (Frank Dehne)	[73]
23	Erik D. Demaine	[10] [11] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [33] [34] [36] [37] [38] [39] [40] [44] [45] [47] [49] [50] [51] [53] [57] [60] [61] [63]
24	Martin L. Demaine	[36] [44] [45] [47] [49] [61] [63]
25	Olivier Devillers	[62]
26	Karim Douïeb	[61]
27	Ziyang Duan	[6] [16]
28	Vida Dujmovic	[36] [42] [45] [48] [60] [61]
29	Muriel Dulieu	[52]
30	Dania El-Khechen	[35] [36] [43] [52]
31	Amr Elmasry	[55] [71]
32	Jeff Erickson	[11] [20] [25] [26] [34]
33	Rolf Fagerberg	[14] [69]
34	Arash Farzan	[55] [71]
35	Thomas Fevens	[35] [43]
36	Jeremy T. Fineman	[57]
37	Robin Y. Flatland	[36] [51] [60]
38	Dongdong Ge	[14] [69]
39	Mordecai J. Golin	[65] [72]
40	Joachim Gudmundsson	[27] [33]
41	Dion Harmon	[24] [38] [50]
42	Vi Hart	[47] [63]
43	Simai He	[14] [69]
44	Haodong Hu	[14] [69]
45	Ferran Hurtado	[20] [21] [25] [28] [31] [34] [39] [60]
46	Daniel M. Kane	[50]
47	Jyrki Katajainen	[7] [15]
48	Danny Krizanc	[65] [72]
49	Stefan Langerman	[2] [3] [9] [10] [11] [13] [18] [19] [20] [21] [22] [23] [25] [26] [27] [29] [33] [34] [36] [39] [40] [41] [42] [44] [46] [47] [48] [53] [57] [61] [62] [63] [67] [74]
50	Ching-Hao Liu	[49]
51	Alejandro López-Ortiz (Alex López-Ortiz)	[14] [69]
52	Anna Lubiw	[60]
53	Henk Meijer	[20] [25] [28] [31] [36]
54	Pat Morin	[7] [11] [15] [21] [26] [39] [41] [42] [48] [60] [61] [62]
55	Jason Morrison	[7] [15]
56	J. Ian Munro	[57]
57	Joseph O'Rourke	[47] [63]
58	Nikolaj van Omme	[52]
59	Mark H. Overmars	[20] [25]
60	Özgür Özkan	[56] [59]
61	Mihai Patrascu	[24] [38] [50] [68] [75]
62	Sheung-Hung Poon	[49]
63	Rajeev Raman	[65] [72]
64	Suneeta Ramaswami	[28] [31] [36]
65	S. Srinivasa Rao (Srinivasa Rao Satti)	[65] [72]
66	Günter Rote	[43]
67	Jörg-Rüdiger Sack	[73]
68	Michiel H. M. Smid	[27] [33]
69	Diane L. Souvaine	[36] [60]
70	Perouz Taslakian	[34] [36]
71	Godfried T. Toussaint	[7] [11] [15] [26] [28] [31] [36]
72	Ryuhei Uehara	[60]
73	Sue Whitesides	[20] [25]
74	Jing Wu	[6] [16]
75	Stefanie Wuhrer	[51]
76	Albert Siu Cheong Yu	[32]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page