The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael T. Goodrich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter
    External-Memory Computational Geometry (Preliminary Version) [Citation Graph (8, 0)][DBLP]
    FOCS, 1993, pp:714-723 [Conf]
  2. Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter
    Blocking for External Graph Searching. [Citation Graph (2, 8)][DBLP]
    PODS, 1993, pp:222-232 [Conf]
  3. Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter
    Blocking for External Graph Searching. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:181-214 [Journal]
  4. Mikhail J. Atallah, Michael T. Goodrich
    Efficient Plane Sweeping in Parallel. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:216-225 [Conf]
  5. Hervé Brönnimann, Michael T. Goodrich
    Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:293-302 [Conf]
  6. Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer
    Topology B-Trees and Their Applications. [Citation Graph (1, 0)][DBLP]
    WADS, 1995, pp:381-392 [Conf]
  7. Wenliang Du, Michael T. Goodrich
    Searching for High-Value Rare Events with Uncheatable Grid Computing. [Citation Graph (0, 0)][DBLP]
    ACNS, 2005, pp:122-137 [Conf]
  8. Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia
    Indexing Information for Data Forensics. [Citation Graph (0, 0)][DBLP]
    ACNS, 2005, pp:206-221 [Conf]
  9. Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
    Accessing the Internal Organization of Data Structures in the JDSL Library. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:124-139 [Conf]
  10. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
    Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:1-10 [Conf]
  11. Matthew Dickerson, Michael T. Goodrich
    Matching points to a convex polygonal boundary. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:89-92 [Conf]
  12. L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
    Geometric Pattern Matching Under Euclidean Motion. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:151-156 [Conf]
  13. Michael T. Goodrich
    Efficient packet marking for large-scale IP traceback. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2002, pp:117-126 [Conf]
  14. Michael T. Goodrich, Roberto Tamassia, Danfeng Yao
    Accredited DomainKeys: A Service Architecture for Improved Email Validation. [Citation Graph (0, 0)][DBLP]
    CEAS, 2005, pp:- [Conf]
  15. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    Linear-time triangulation of a simple polygon made easier via randomization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:201-212 [Conf]
  16. Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer
    Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:150-159 [Conf]
  17. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:144-151 [Conf]
  18. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
    Animating the Polygon-Offset Distance Function. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:479-480 [Conf]
  19. Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia
    Classical Computational Geometry in GeomNet. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:412-414 [Conf]
  20. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop
    Efficient Perspective-Accurate Silhouette Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:417-418 [Conf]
  21. Gill Barequet, Michael T. Goodrich
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:317-326 [Conf]
  22. Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
    Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:319-328 [Conf]
  23. Richard Cole, Michael T. Goodrich
    Optimal Parallel Algorithms for Polygon and Point-Set Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:201-210 [Conf]
  24. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
    The skip quadtree: a simple dynamic data structure for multidimensional data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:296-305 [Conf]
  25. Ashim Garg, Michael T. Goodrich, Roberto Tamassia
    Area-Efficient Upward Tree Drawings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:359-368 [Conf]
  26. Michael T. Goodrich
    Geometric Partitioning Made Easier, Even in Parallel. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:73-82 [Conf]
  27. Michael T. Goodrich
    Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:322-331 [Conf]
  28. Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum
    Snap Rounding Line Segments Efficiently in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:284-293 [Conf]
  29. Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
    Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:103-112 [Conf]
  30. Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
    Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:73-82 [Conf]
  31. Michael T. Goodrich, Roberto Tamassia
    Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:318-327 [Conf]
  32. Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar
    Efficient perspective-accurate silhouette computation and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:60-68 [Conf]
  33. David Eppstein, Michael T. Goodrich, Nodari Sitchinava
    Guard placement for efficient point-in-polygon proofs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:27-36 [Conf]
  34. Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia
    Efficient Tree-Based Revocation in Groups of Low-State Devices. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:511-527 [Conf]
  35. Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen
    Authenticated Data Structures for Graph and Geometric Searching. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2003, pp:295-313 [Conf]
  36. Michael T. Goodrich, Roberto Tamassia, Danfeng Yao
    Notarized Federated Identity Management for Web Services. [Citation Graph (0, 0)][DBLP]
    DBSec, 2006, pp:133-147 [Conf]
  37. Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia
    Distributed Data Authenication (System Demonstration). [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:58-59 [Conf]
  38. Michael T. Goodrich, Roberto Tamassia
    Efficient and Scalable Infrastructure Support for Dynamic Coalitions. [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:246-251 [Conf]
  39. Adam L. Buchsbaum, Michael T. Goodrich
    Three-Dimensional Layers of Maxima. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:257-269 [Conf]
  40. Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook
    Range Searching Over Tree Cross Products. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:120-131 [Conf]
  41. Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
    K-D Trees Are Better when Cut on the Longest Side. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:179-190 [Conf]
  42. Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia
    Secure Biometric Authentication for Weak Computational Devices. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2005, pp:357-371 [Conf]
  43. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    Parallel Algorithms for Higher-Dimensional Convex Hulls [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:683-694 [Conf]
  44. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
    Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:151-160 [Conf]
  45. Michael T. Goodrich
    Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:711-722 [Conf]
  46. Michael T. Goodrich, S. Rao Kosaraju
    Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:190-195 [Conf]
  47. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
    Selected Open Problems in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:515-539 [Conf]
  48. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
    Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:63-75 [Conf]
  49. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:111-124 [Conf]
  50. C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Drawing Planar Graphs with Circular Arcs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:117-126 [Conf]
  51. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Layered Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:184-194 [Conf]
  52. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Delta-Confluent Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:165-176 [Conf]
  53. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Planarity-Preserving Clustering and Embedding for Large Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:186-196 [Conf]
  54. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:1-12 [Conf]
  55. Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
    A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:211-221 [Conf]
  56. Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
    C-Planarity of Extrovert Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:211-222 [Conf]
  57. Michael T. Goodrich, Christopher G. Wagner
    A Framework for Drawing Planar Graphs with Curves and Polylines. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:153-166 [Conf]
  58. Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman
    Characterization and Recognition of Point-Halfspace and Related Orders. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:234-245 [Conf]
  59. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs Via Color Space Embeddings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:294-305 [Conf]
  60. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:432-445 [Conf]
  61. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
    An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:689-702 [Conf]
  62. Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun
    Loud and Clear: Human-Verifiable Authentication Based on Audio. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:10- [Conf]
  63. Mikhail J. Atallah, Michael T. Goodrich
    Efficient Parallel Solutions to Geometric Problems. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:411-417 [Conf]
  64. Mujtaba R. Ghouse, Michael T. Goodrich
    Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:549-556 [Conf]
  65. Michael T. Goodrich, Yossi Matias, Uzi Vishkin
    Approximate Parallel Prefix Computation and its Applications. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:318-325 [Conf]
  66. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
    Biased Skip Lists. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:1-13 [Conf]
  67. Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia
    Persistent Authenticated Dictionaries and Their Applications. [Citation Graph (0, 0)][DBLP]
    ISC, 2001, pp:379-393 [Conf]
  68. Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic
    An Efficient Dynamic and Distributed Cryptographic Accumulator. [Citation Graph (0, 0)][DBLP]
    ISC, 2002, pp:372-388 [Conf]
  69. Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough
    Authenticated Dictionaries for Fresh Attribute Credentials. [Citation Graph (0, 0)][DBLP]
    iTrust, 2003, pp:332-347 [Conf]
  70. Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich
    TRICERT: A Distributed Certified E-Mail Scheme. [Citation Graph (0, 0)][DBLP]
    NDSS, 2001, pp:- [Conf]
  71. Lars Arge, David Eppstein, Michael T. Goodrich
    Skip-webs: efficient distributed data structures for multi-dimensional data sets. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:69-76 [Conf]
  72. Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel
    Testers and visualizers for teaching data structures. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1999, pp:261-265 [Conf]
  73. Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia
    PILOT: an interactive tool for learning and grading. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2000, pp:139-143 [Conf]
  74. Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia
    SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2000, pp:300-304 [Conf]
  75. Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia
    Teaching data structure design patterns. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:331-335 [Conf]
  76. Michael T. Goodrich, Roberto Tamassia
    Teaching internet algorithmics. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:129-133 [Conf]
  77. Michael T. Goodrich, Roberto Tamassia
    Teaching the analysis of algorithms with visual proofs. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:207-211 [Conf]
  78. Michael T. Goodrich, Roberto Tamassia
    Using randomization in the teaching of data structures and algorithms. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1999, pp:53-57 [Conf]
  79. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:705-706 [Conf]
  80. Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
    Straight-skeleton based contour interpolation. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:119-127 [Conf]
  81. Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
    External-Memory Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:139-149 [Conf]
  82. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:300-309 [Conf]
  83. Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos
    Efficient Approximation and Optimization Algorithms for Computational Metrology. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:121-130 [Conf]
  84. Michael T. Goodrich
    Competitive tree-structured dictionaries. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:494-495 [Conf]
  85. Michael T. Goodrich
    Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:118-128 [Conf]
  86. Michael T. Goodrich
    Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:132-141 [Conf]
  87. Michael T. Goodrich
    Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:767-776 [Conf]
  88. Michael T. Goodrich, Yossi Matias, Uzi Vishkin
    Optimal Parallel Approximation for Prefix Sums and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:241-250 [Conf]
  89. Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun
    The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:384-393 [Conf]
  90. Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer
    Methods for Achieving Fast Query Times in Point Location Data Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:757-766 [Conf]
  91. Michael T. Goodrich
    Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2005, pp:196-207 [Conf]
  92. Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
    P-Complete Geometric Problems. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:317-326 [Conf]
  93. Mujtaba R. Ghouse, Michael T. Goodrich
    In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:192-203 [Conf]
  94. Michael T. Goodrich
    Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:127-137 [Conf]
  95. Michael T. Goodrich
    Constructing Arrangements Optimally in Parallel (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:169-179 [Conf]
  96. Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright
    Generalized Sweep Methods for Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:280-289 [Conf]
  97. Michael T. Goodrich, Daniel S. Hirschberg
    Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:118-127 [Conf]
  98. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    Computing faces in segment and simplex arrangements (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:672-682 [Conf]
  99. Michael T. Goodrich
    Planar Separators and Parallel Polygon Triangulation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:507-516 [Conf]
  100. Michael T. Goodrich
    Communication-Efficient Parallel Sorting (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:247-256 [Conf]
  101. Michael T. Goodrich, Roberto Tamassia
    Dynamic Trees and Dynamic Point Location (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:523-533 [Conf]
  102. Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
    Point Probe Decision Trees for Geometric Concept Classes. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:95-106 [Conf]
  103. Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
    Seller-Focused Algorithms for Online Auctioning. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:135-147 [Conf]
  104. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-Polygon Annulus Placement Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:378-391 [Conf]
  105. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:200-209 [Conf]
  106. Gill Barequet, Michael T. Goodrich, Chris Riley
    Drawing Graphs with Large Vertices and Thick Edges. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:281-293 [Conf]
  107. Amitabh Chaudhary, Michael T. Goodrich
    Balanced Aspect Ratio Trees Revisited. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:73-85 [Conf]
  108. Gautam Das, Michael T. Goodrich
    On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:74-85 [Conf]
  109. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:86-98 [Conf]
  110. Michael T. Goodrich, John G. Kloss II
    Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:205-216 [Conf]
  111. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:12-23 [Conf]
  112. Michael T. Goodrich, Jack Snoeyink
    Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:231-242 [Conf]
  113. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu
    Constructing Disjoint Paths for Secure Communication. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:181-195 [Conf]
  114. Mikhail J. Atallah, Michael T. Goodrich
    Parallel Algorithms for Some Functions of two Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:535-548 [Journal]
  115. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
    Biased Skip Lists. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:31-48 [Journal]
  116. Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
    Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:150-167 [Journal]
  117. Adam L. Buchsbaum, Michael T. Goodrich
    Three-Dimensional Layers of Maxima. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:4, pp:275-286 [Journal]
  118. Richard Cole, Michael T. Goodrich
    Optimal Parallel Algorithms for Point-Set and Polygon Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:1, pp:3-23 [Journal]
  119. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:6, pp:569-617 [Journal]
  120. Michael T. Goodrich
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:271- [Journal]
  121. Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright
    Sweep Methods for Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:2, pp:126-153 [Journal]
  122. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:128-141 [Journal]
  123. Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
    Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:461-486 [Journal]
  124. Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
    An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:515-516 [Journal]
  125. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-polygon annulus placement problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:125-141 [Journal]
  126. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
    Optimizing area and aspect ration in straight-line orthogonal tree drawings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:153-162 [Journal]
  127. L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
    Geometric Pattern Matching Under Euclidean Motion. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:113-124 [Journal]
  128. Gautam Das, Michael T. Goodrich
    On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:123-137 [Journal]
  129. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Planarity-preserving clustering and embedding for large planar graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:95-114 [Journal]
  130. Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
    A multi-dimensional approach to force-directed layouts of large graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:3-18 [Journal]
  131. Mujtaba R. Ghouse, Michael T. Goodrich
    Fast Randomized Parallel Methods for Planar Convex Hull Construction. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:219-235 [Journal]
  132. Michael T. Goodrich
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:1-2 [Journal]
  133. Michael T. Goodrich
    Constructing the Convex Hull of a Partially Sorted Set of Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:267-278 [Journal]
  134. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  135. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic Sampling and Range Counting in Geometric Data Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  136. Thomas H. Cormen, Michael T. Goodrich
    A Bridging Model for Parallel Computation, Communication, and I/O. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:208- [Journal]
  137. Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
    Contour interpolation by straight skeletons. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2004, v:66, n:4, pp:245-260 [Journal]
  138. Michael T. Goodrich
    A polygonal approach to hidden-line and hidden-surface elimination. [Citation Graph (0, 0)][DBLP]
    CVGIP: Graphical Model and Image Processing, 1992, v:54, n:1, pp:1-12 [Journal]
  139. Michael T. Goodrich, Jack Snoeyink
    Stabbing Parallel Segments with a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1990, v:49, n:2, pp:152-170 [Journal]
  140. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
    A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:245-265 [Journal]
  141. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Convex Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:271-291 [Journal]
  142. Hervé Brönnimann, Michael T. Goodrich
    Almost Optimal Set Covers in Finite VC-Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:463-479 [Journal]
  143. C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Drawing Planar Graphs with Circular Arcs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:405-418 [Journal]
  144. Michael T. Goodrich
    Constructing Arrangement Optimally in Parallel. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:371-385 [Journal]
  145. Michael T. Goodrich
    Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:445-462 [Journal]
  146. Michael T. Goodrich, Edgar A. Ramos
    Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:4, pp:397-420 [Journal]
  147. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
    Output-Sensitive Methods for Rectilinear Hidden Surface Removal [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:1, pp:1-24 [Journal]
  148. Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
    P-complete geometric problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:443-462 [Journal]
  149. Ashim Garg, Michael T. Goodrich, Roberto Tamassia
    Planar upward tree drawings with optimal area. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:333-356 [Journal]
  150. Michael T. Goodrich
    An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:1, pp:1-24 [Journal]
  151. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia
    GeomNet: Geometric Computing Over the Internet. [Citation Graph (0, 0)][DBLP]
    IEEE Internet Computing, 1999, v:3, n:2, pp:21-29 [Journal]
  152. Michael T. Goodrich
    Finding the Convex Hull of a Sorted Point Set in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:173-179 [Journal]
  153. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
    Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:6, pp:1049-1088 [Journal]
  154. Michael T. Goodrich, S. Rao Kosaraju
    Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:2, pp:331-361 [Journal]
  155. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:303-333 [Journal]
  156. Michael T. Goodrich
    Triangulating a Polygon in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:3, pp:327-351 [Journal]
  157. Michael T. Goodrich, Roberto Tamassia
    Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:51-73 [Journal]
  158. Michael T. Goodrich, Christopher G. Wagner
    A Framework for Drawing Planar Graphs with Curves and Polylines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:399-421 [Journal]
  159. Michael T. Goodrich
    Planar Separators and Parallel Polygon Triangulation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:374-389 [Journal]
  160. Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
    Optimizing a constrained convex polygonal annulus. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:1-26 [Journal]
  161. Gill Barequet, Michael T. Goodrich, Chris Riley
    Drawing Planar Graphs with Large Vertices and Thick Edges. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:3-20 [Journal]
  162. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:31-52 [Journal]
  163. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:19-46 [Journal]
  164. Mikhail J. Atallah, Michael T. Goodrich
    Efficient Parallel Solutions to Some Geometric Problems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1986, v:3, n:4, pp:492-507 [Journal]
  165. Michael T. Goodrich, Mikhail J. Atallah
    On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:9, n:1, pp:69-76 [Journal]
  166. Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
    Approximate Geometric Pattern Matching Under Rigid Motions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1999, v:21, n:4, pp:371-379 [Journal]
  167. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
    Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:499-532 [Journal]
  168. Michael T. Goodrich
    Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:4, pp:737-755 [Journal]
  169. Michael T. Goodrich
    Communication-Efficient Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:416-432 [Journal]
  170. Michael T. Goodrich, Roberto Tamassia
    Dynamic Trees and Dynamic Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:612-636 [Journal]
  171. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1360-1375 [Journal]
  172. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer
    Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:10, pp:1352-1367 [Journal]
  173. Hossam A. ElGindy, Michael T. Goodrich
    Parallel algorithms for shortest path problems in polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:371-378 [Journal]
  174. John K. Johnstone, Michael T. Goodrich
    A localized method for intersecting plane algebraic curve segments. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1991, v:7, n:2, pp:60-71 [Journal]
  175. Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu
    Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:114-126 [Conf]
  176. David Eppstein, Michael T. Goodrich
    Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:637-648 [Conf]
  177. Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia
    On the Cost of Persistence and Authentication in Skip Lists. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:94-107 [Conf]
  178. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Layered Drawings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:439-452 [Journal]
  179. David Eppstein, Michael T. Goodrich
    Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  180. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs via Color Space Embeddings [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  181. David Eppstein, Michael T. Goodrich, Nodari Sitchinava
    Guard Placement For Wireless Localization [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  182. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  183. Bureaucratic protocols for secure two-party sorting, selection, and permuting. [Citation Graph (, )][DBLP]


  184. Super-Efficient Verification of Dynamic Outsourced Databases. [Citation Graph (, )][DBLP]


  185. Straight Skeletons of Three-Dimensional Polyhedra. [Citation Graph (, )][DBLP]


  186. Cloning Voronoi Diagrams via Retroactive Data Structures. [Citation Graph (, )][DBLP]


  187. Succinct Greedy Graph Drawing in the Hyperbolic Plane. [Citation Graph (, )][DBLP]


  188. Planar Drawings of Higher-Genus Graphs. [Citation Graph (, )][DBLP]


  189. Studying (non-planar) road networks through an algorithmic lens. [Citation Graph (, )][DBLP]


  190. Two-site Voronoi diagrams in geographic networks. [Citation Graph (, )][DBLP]


  191. Going off-road: transversal complexity in road networks. [Citation Graph (, )][DBLP]


  192. Checking Value-Sensitive Data Structures in Sublinear Space. [Citation Graph (, )][DBLP]


  193. Athos: Efficient Authentication of Outsourced File Systems. [Citation Graph (, )][DBLP]


  194. Approximate topological matching of quadrilateral meshes. [Citation Graph (, )][DBLP]


  195. Linear-time algorithms for geometric graphs with sublinearly many crossings. [Citation Graph (, )][DBLP]


  196. Randomized Shellsort: A Simple Oblivious Sorting Algorithm. [Citation Graph (, )][DBLP]


  197. The Mastermind Attack on Genomic Data. [Citation Graph (, )][DBLP]


  198. Fundamental parallel algorithms for private-cache chip multiprocessors. [Citation Graph (, )][DBLP]


  199. On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. [Citation Graph (, )][DBLP]


  200. Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. [Citation Graph (, )][DBLP]


  201. Motorcycle Graphs: Canonical Quad Mesh Partitioning. [Citation Graph (, )][DBLP]


  202. Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes [Citation Graph (, )][DBLP]


  203. The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data [Citation Graph (, )][DBLP]


  204. Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets [Citation Graph (, )][DBLP]


  205. Confluent Layered Drawings [Citation Graph (, )][DBLP]


  206. Delta-confluent Drawings [Citation Graph (, )][DBLP]


  207. Straight Skeletons of Three-Dimensional Polyhedra [Citation Graph (, )][DBLP]


  208. Succinct Greedy Graph Drawing in the Hyperbolic Plane [Citation Graph (, )][DBLP]


  209. Studying (Non-Planar) Road Networks Through an Algorithmic Lens [Citation Graph (, )][DBLP]


  210. Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings [Citation Graph (, )][DBLP]


  211. Succinct Greedy Geometric Routing in R^2 [Citation Graph (, )][DBLP]


  212. On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem [Citation Graph (, )][DBLP]


  213. The Mastermind Attack on Genomic Data [Citation Graph (, )][DBLP]


  214. Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric [Citation Graph (, )][DBLP]


  215. On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results [Citation Graph (, )][DBLP]


  216. An Efficient Dynamic and Distributed RSA Accumulator [Citation Graph (, )][DBLP]


  217. Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis [Citation Graph (, )][DBLP]


  218. The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure [Citation Graph (, )][DBLP]


  219. Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations [Citation Graph (, )][DBLP]


  220. Planar Drawings of Higher-Genus Graphs [Citation Graph (, )][DBLP]


  221. Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems [Citation Graph (, )][DBLP]


  222. Randomized Shellsort: A Simple Oblivious Sorting Algorithm [Citation Graph (, )][DBLP]


  223. Going Off-road: Transversal Complexity in Road Networks [Citation Graph (, )][DBLP]


  224. Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry [Citation Graph (, )][DBLP]


  225. Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks [Citation Graph (, )][DBLP]


  226. Cloning Voronoi Diagrams via Retroactive Data Structures [Citation Graph (, )][DBLP]


  227. MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations [Citation Graph (, )][DBLP]


Search in 1.653secs, Finished in 1.664secs
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