The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John Iacono: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:1-4 [Conf]
  2. John Iacono, Stefan Langerman
    Dynamic point location in fat hyperrectangles with integer coordinates. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  4. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  5. John Iacono
    A 3-D visualization of kirkpatrick's planar point location algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:377- [Conf]
  6. John Iacono, Stefan Langerman
    Proximate planar point location. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:220-226 [Conf]
  7. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:271-282 [Conf]
  9. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality -- Almost. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:484-490 [Conf]
  10. John Iacono
    Key Independent Optimality. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:25-31 [Conf]
  11. John Iacono, Stefan Langerman
    Queaps. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:211-218 [Conf]
  12. Erik D. Demaine, John Iacono, Stefan Langerman
    Grid Vertex-Unfolding Orthostacks. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:76-82 [Conf]
  13. John Iacono, Stefan Langerman
    Volume Queries in Polyhedra. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:156-159 [Conf]
  14. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    In-Place Planar Convex Hull Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:494-507 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  16. Boris Aronov, Alan R. Davis, John Iacono, Albert Siu Cheong Yu
    The Complexity of Diffuse Reflections in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:93-104 [Conf]
  17. Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
    A locality-preserving cache-oblivious dynamic dictionary. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:29-38 [Conf]
  18. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:281-290 [Conf]
  19. John Iacono
    Optimal planar point location. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:340-341 [Conf]
  20. John Iacono
    Alternatives to splay trees with O(log n) worst-case access times. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:516-522 [Conf]
  21. John Iacono
    Improved Upper Bounds for Pairing Heaps. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:32-45 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  23. John Iacono
    Key-Independent Optimality. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:3-10 [Journal]
  24. John Iacono, Stefan Langerman
    Queaps. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:49-56 [Journal]
  25. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:29-40 [Journal]
  26. John Iacono
    Expected asymptotically optimal planar point location. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:19-22 [Journal]
  27. Erik D. Demaine, John Iacono, Stefan Langerman
    Worst-Case Optimal Tree Layout in a Memory Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  28. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  29. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  30. Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
    A locality-preserving cache-oblivious dynamic dictionary. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:2, pp:115-136 [Journal]
  31. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality - Almost. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:240-251 [Journal]
  32. Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
    Space-efficient planar convex hull algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:25-40 [Journal]
  33. Dania El-Khechen, Thomas Fevens, John Iacono
    Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  35. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]
  36. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
  37. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
    A unified access bound on comparison-based dynamic dictionaries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:86-96 [Journal]

  38. Partitioning a Polygon into Two Mirror Congruent Pieces. [Citation Graph (, )][DBLP]


  39. Packing 2×2 unit squares into grid polygons is NP-complete. [Citation Graph (, )][DBLP]


  40. Oja medians and centers of gravity. [Citation Graph (, )][DBLP]


  41. Mergeable Dictionaries. [Citation Graph (, )][DBLP]


  42. Distribution-sensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]


  43. The geometry of binary search trees. [Citation Graph (, )][DBLP]


  44. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]


  45. Minimal Locked Trees. [Citation Graph (, )][DBLP]


  46. Wrapping spheres with flat paper. [Citation Graph (, )][DBLP]


  47. Editorial. [Citation Graph (, )][DBLP]


  48. An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment [Citation Graph (, )][DBLP]


  49. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  50. Entropy, Triangulation, and Point Location in Planar Subdivisions [Citation Graph (, )][DBLP]


  51. Continuous Blooming of Convex Polyhedra [Citation Graph (, )][DBLP]


  52. Detecting all regular polygons in a point set [Citation Graph (, )][DBLP]


  53. Minimum feature size preserving decompositions [Citation Graph (, )][DBLP]


  54. Mergeable Dictionaries [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002