| 2026 | SPAA | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. | Michael A. Bender, Philip Bille, Martn Farach-Colton, Jeremy T. Fineman, Inge Li Grtz, Michael T. Goodrich, Hanna Komls, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou |
| 2026 | SOFSEM | Sublinear Work Parallel Quantum Algorithms for Computational Geometry. | Shion Fukuzawa, Michael T. Goodrich, Sandy Irani |
| 2025 | CIAC | Fast Geographic Routing in Fixed-Growth Graphs. | Ofek Gila, Michael T. Goodrich, Abraham M. Illickan, Vinesh Sridhar |
| 2025 | ESA | External-Memory Priority Queues with Optimal Insertions. | Gerth Stlting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2025 | ESA | Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. | David Eppstein, Michael T. Goodrich, Songyu Liu |
| 2025 | GD | Visualizing Treewidth. | Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nllenburg |
| 2025 | ISAAC | Parallel Joinable B-Trees in the Fork-Join I/O Model. | Michael T. Goodrich, Yan Gu, Ryuto Kitagawa, Yihan Sun |
| 2025 | IWOCA | Exact Learning of Weighted Graphs Using Composite Queries. | Michael T. Goodrich, Songyu Liu, Ioannis Panageas |
| 2025 | SOFSEM | Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. | Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher |
| 2025 | WADS | Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. | Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nllenburg |
| 2025 | WADS | Computational Geometry with Probabilistically Noisy Primitive Operations. | David Eppstein, Michael T. Goodrich, Vinesh Sridhar |
| 2024 | GD | Polygonally Anchored Graph Drawing (Poster Abstract). | Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich |
| 2024 | GD | Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bzier Curves with Bounded Curvature. | David Eppstein, Michael T. Goodrich, Abraham M. Illickan |
| 2023 | COCOA | Highway Preferential Attachment Models for Geographic Routing. | Ofek Gila, Evrim Ozel, Michael T. Goodrich |
| 2023 | GD | Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. | Alvin Chiu, David Eppstein, Michael T. Goodrich |
| 2023 | SPAA | Optimal Parallel Sorting with Comparison Errors. | Michael T. Goodrich, Riko Jacob |
| 2023 | WADS | Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. | Ofek Gila, Michael T. Goodrich, Robert E. Tarjan |
| 2023 | WADS | External-Memory Sorting with Comparison Errors. | Michael T. Goodrich, Evrim Ozel |
| 2022 | LATIN | Exact Learning of Multitrees and Almost-Trees Using Path Queries. | Ramtin Afshar, Michael T. Goodrich |
| 2022 | STACS | Mapping Networks via Parallel kth-Hop Traceroute Queries. | Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2021 | SODA | Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. | Michael T. Goodrich, Riko Jacob, Nodari Sitchinava |
| 2021 | SPAA | Parallel Network Mapping Algorithms. | Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2021 | WADS | How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. | Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias |
| 2020 | ESA | Reconstructing Biological and Digital Phylogenetic Trees in Parallel. | Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2020 | SPAA | Reconstructing Binary Trees in Parallel. | Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2020 | SPIRE | Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. | Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias |
| 2019 | COCOA | Minimum-Width Drawings of Phylogenetic Trees. | Juan Jos Besa Vial, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda |
| 2019 | ESA | Computing k-Modal Embeddings of Planar Digraphs. | Juan Jos Besa Vial, Giordano Da Lozzo, Michael T. Goodrich |
| 2019 | ISAAC | Tracking Paths in Planar Graphs. | David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias |
| 2019 | ISAAC | New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. | Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk |
| 2018 | ALENEX | Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | CCS | Isogrammic-Fusion ORAM: Improved Statistically Secure Privacy-Preserving Cloud Data Access for Thin Clients. | Michael T. Goodrich |
| 2018 | COCOON | Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. | Gill Barequet, Minati De, Michael T. Goodrich |
| 2018 | ICALP | Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. | Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2018 | ICALP | Optimally Sorting Evolving Data. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson |
| 2018 | LATIN | Reactive Proximity Data Structures for Graphs. | David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2018 | WG | Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. | Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta |
| 2017 | ACNS | Accountable Storage. | Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia |
| 2017 | ESA | The Online House Numbering Problem: Min-Max Online List Labeling. | William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz |
| 2017 | IWCIA | Algorithms for Stable Matching and Clustering in a Grid. | David Eppstein, Michael T. Goodrich, Nil Mamano |
| 2017 | PODS | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. | David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres |
| 2017 | SPAA | Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. | David Eppstein, Michael T. Goodrich |
| 2016 | ATMOS | Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. | Juan Jos Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich |
| 2016 | ESORICS | More Practical and Secure History-Independent Hash Tables. | Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia |
| 2016 | SPAA | Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. | William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj |
| 2016 | SPAA | Parallel Algorithms for Summing Floating-Point Numbers. | Michael T. Goodrich, Ahmed Eldawy |
| 2016 | SCN | Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. | Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia |
| 2016 | VizSec | J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode. | Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson |
| 2015 | GD | Knuthian Drawings of Series-Parallel Flowcharts. | Michael T. Goodrich, Timothy Johnson, Manuel R. Torres |
| 2014 | COCOA | Data-Oblivious Graph Algorithms in Outsourced External Memory. | Michael T. Goodrich, Joseph A. Simons |
| 2014 | GD | Balanced Circle Packings for Planar Graphs. | Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev |
| 2014 | GD | The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. | Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich |
| 2014 | ICALP | The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. | Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal |
| 2014 | STOC | Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time. | Michael T. Goodrich |
| 2013 | GD | Achieving Good Angular Resolution in 3D Arc Diagrams. | Michael T. Goodrich, Pawel Pszona |
| 2013 | GD | Streamed Graph Drawing and the File Maintenance Problem. | Michael T. Goodrich, Pawel Pszona |
| 2013 | WADS | Combinatorial Pair Testing: Distinguishing Workers from Slackers. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2012 | GD | Force-Directed Graph Drawing Using Social Gravity and Scaling. | Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott |
| 2012 | GD | On the Density of Maximal 1-Planar Graphs. | Franz-Josef Brandenburg, David Eppstein, Andreas Gleiner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber |
| 2012 | GD | Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. | Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia |
| 2012 | GD | More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. | Michael T. Goodrich, Joseph A. Simons |
| 2012 | ICALP | Anonymous Card Shuffling and Its Applications to Parallel Mixnets. | Michael T. Goodrich, Michael Mitzenmacher |
| 2012 | SODA | Privacy-preserving group data access via stateless oblivious RAM simulation. | Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia |
| 2011 | CCS | Oblivious RAM simulation with efficient worst-case access overhead. | Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia |
| 2011 | ESA | External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. | Michael T. Goodrich, Pawel Pszona |
| 2011 | GD | Force-Directed Lombardi-Style Graph Drawing. | Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G. Kobourov, Lowell Trott |
| 2011 | GD | Planar and Poly-arc Lombardi Drawings. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Lffler |
| 2011 | ICALP | Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. | Michael T. Goodrich, Michael Mitzenmacher |
| 2011 | ISAAC | External-Memory Multimaps. | Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler |
| 2011 | ISAAC | Fully Retroactive Approximate Range and Nearest Neighbor Searching. | Michael T. Goodrich, Joseph A. Simons |
| 2011 | ISAAC | Sorting, Searching, and Simulation in the MapReduce Framework. | Michael T. Goodrich, Nodari Sitchinava, Qin Zhang |
| 2011 | SIGCOMM | What's the difference?: efficient set reconciliation without prior context. | David Eppstein, Michael T. Goodrich, Frank C. Uyeda, George Varghese |
| 2011 | SPAA | Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. | Michael T. Goodrich |
| 2011 | SPAA | Brief announcement: large-scale multimaps. | Michael T. Goodrich, Michael Mitzenmacher |
| 2011 | WADS | Tracking Moving Objects with Few Handovers. | David Eppstein, Michael T. Goodrich, Maarten Lffler |
| 2010 | CCS | Bureaucratic protocols for secure two-party sorting, selection, and permuting. | Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenliang Du, Zutao Zhu |
| 2010 | COCOA | Extended Dynamic Subgraph Statistics Using | David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott |
| 2010 | ESA | Cloning Voronoi Diagrams via Retroactive Data Structures. | Matthew T. Dickerson, David Eppstein, Michael T. Goodrich |
| 2010 | GD | Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. | Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Lffler |
| 2010 | GD | Drawing Trees with Perfect Angular Resolution and Polynomial Area. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | GD | Lombardi Drawings of Graphs. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | ISAAC | Priority Range Trees. | Michael T. Goodrich, Darren Strash |
| 2010 | SODA | Randomized Shellsort: A Simple Oblivious Sorting Algorithm. | Michael T. Goodrich |
| 2009 | GD | Planar Drawings of Higher-Genus Graphs. | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
| 2009 | ISAAC | Succinct Greedy Geometric Routing in the Euclidean Plane. | Michael T. Goodrich, Darren Strash |
| 2009 | SODA | Linear-time algorithms for geometric graphs with sublinearly many crossings. | David Eppstein, Michael T. Goodrich, Darren Strash |
| 2009 | SP | The Mastermind Attack on Genomic Data. | Michael T. Goodrich |
| 2009 | SecureComm | Reliable Resource Searching in P2P Networks. | Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos |
| 2009 | WADS | On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
| 2008 | ESA | Straight Skeletons of Three-Dimensional Polyhedra. | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman |
| 2008 | GD | Succinct Greedy Graph Drawing in the Hyperbolic Plane. | David Eppstein, Michael T. Goodrich |
| 2008 | SPAA | Fundamental parallel algorithms for private-cache chip multiprocessors. | Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava |
| 2007 | ISAAC | Checking Value-Sensitive Data Structures in Sublinear Space. | Michael T. Goodrich, Jonathan Z. Sun |
| 2007 | WADS | Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. | Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu |
| 2007 | WADS | Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. | David Eppstein, Michael T. Goodrich |
| 2006 | DBSEC | Notarized Federated Identity Management for Web Services. | Michael T. Goodrich, Roberto Tamassia, Danfeng Yao |
| 2006 | GD | Choosing Colors for Geometric Graphs Via Color Space Embeddings. | Michael B. Dillencourt, David Eppstein, Michael T. Goodrich |
| 2006 | ICDCS | Loud and Clear: Human-Verifiable Authentication Based on Audio. | Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun |
| 2006 | Mobiquitous | LAAC: A Location-Aware Access Control Protocol. | YounSun Cho, Lichun Bao, Michael T. Goodrich |
| 2006 | SODA | The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. | Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun |
| 2006 | SPAA | Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. | Michael T. Goodrich, Daniel S. Hirschberg |
| 2005 | ACNS | Searching for High-Value Rare Events with Uncheatable Grid Computing. | Wenliang Du, Michael T. Goodrich |
| 2005 | ACNS | Indexing Information for Data Forensics. | Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia |
| 2005 | FC | Secure Biometric Authentication for Weak Computational Devices. | Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia |
| 2005 | GD | Delta-Confluent Drawings. | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2005 | GD | C-Planarity of Extrovert Clustered Graphs. | Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun |
| 2005 | PODC | Skip-webs: efficient distributed data structures for multi-dimensional data sets. | Lars Arge, David Eppstein, Michael T. Goodrich |
| 2005 | SP | Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. | Michael T. Goodrich |
| 2005 | WADS | Balanced Aspect Ratio Trees Revisited. | Amitabh Chaudhary, Michael T. Goodrich |
| 2005 | WADS | Improved Combinatorial Group Testing for Real-World Problem Sizes. | David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2004 | CRYPTO | Efficient Tree-Based Revocation in Groups of Low-State Devices. | Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia |
| 2004 | GD | Confluent Layered Drawings. | David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2003 | GD | Selected Open Problems in Graph Drawing. | Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel |
| 2003 | GD | Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. | Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng |
| 2003 | SODA | Straight-skeleton based contour interpolation. | Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner |
| 2003 | WADS | Drawing Graphs with Large Vertices and Thick Edges. | Gill Barequet, Michael T. Goodrich, Chris Riley |
| 2002 | CCS | Efficient packet marking for large-scale IP traceback. | Michael T. Goodrich |
| 2002 | ESA | Three-Dimensional Layers of Maxima. | Adam L. Buchsbaum, Michael T. Goodrich |
| 2002 | ISAAC | Biased Skip Lists. | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich |
| 2001 | NDSS | TRICERT: A Distributed Certified E-Mail Scheme. | Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich |
| 2001 | SIGCSE | Teaching internet algorithmics. | Michael T. Goodrich, Roberto Tamassia |
| 2001 | WADS | Seller-Focused Algorithms for Online Auctioning. | Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar |
| 2000 | ESA | Range Searching Over Tree Cross Products. | Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook |
| 2000 | ESA | K-D Trees Are Better when Cut on the Longest Side. | Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich |
| 2000 | GD | A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. | Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov |
| 2000 | SIGCSE | PILOT: an interactive tool for learning and grading. | Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia |
| 2000 | SIGCSE | SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. | Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia |
| 2000 | SODA | Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos |
| 2000 | SODA | Competitive tree-structured dictionaries. | Michael T. Goodrich |
| 1999 | ALENEX | Accessing the Internal Organization of Data Structures in the JDSL Library. | Michael T. Goodrich, Mark Handy, Benot Hudson, Roberto Tamassia |
| 1999 | GD | Drawing Planar Graphs with Circular Arcs. | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
| 1999 | GD | Planarity-Preserving Clustering and Embedding for Large Planar Graphs. | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
| 1999 | SIGCSE | Testers and visualizers for teaching data structures. | Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel |
| 1999 | SIGCSE | Using randomization in the teaching of data structures and algorithms. | Michael T. Goodrich, Roberto Tamassia |
| 1999 | SODA | Balanced Aspect Ratio Trees: Combining the Advantages of | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
| 1999 | WADS | Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. | Michael T. Goodrich, John G. Kloss II |
| 1998 | GD | Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov |
| 1998 | GD | A Framework for Drawing Planar Graphs with Curves and Polylines. | Michael T. Goodrich, Christopher G. Wagner |
| 1998 | SIGCSE | Teaching data structure design patterns. | Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia |
| 1998 | SIGCSE | Teaching the analysis of algorithms with visual proofs. | Michael T. Goodrich, Roberto Tamassia |
| 1997 | SODA | Efficient Approximation and Optimization Algorithms for Computational Metrology. | Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos |
| 1997 | SODA | Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). | Michael T. Goodrich |
| 1997 | SODA | Methods for Achieving Fast Query Times in Point Location Data Structures. | Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer |
| 1997 | WADS | Offset-Polygon Annulus Placement Problems. | Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich |
| 1997 | WADS | Voronoi Diagrams for Polygon-Offset Distance Functions. | Gill Barequet, Matthew Dickerson, Michael T. Goodrich |
| 1996 | GD | Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. | Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia |
| 1996 | SODA | Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. | Michael T. Goodrich |
| 1996 | STOC | Communication-Efficient Parallel Sorting (Preliminary Version). | Michael T. Goodrich |
| 1995 | SODA | External-Memory Graph Algorithms. | Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter |
| 1995 | STOC | Computing faces in segment and simplex arrangements (Preliminary Version). | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos |
| 1995 | WADS | Topology B-Trees and Their Applications. | Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer |
| 1995 | WADS | On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). | Gautam Das, Michael T. Goodrich |
| 1994 | FOCS | Parallel Algorithms for Higher-Dimensional Convex Hulls | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos |
| 1994 | GD | Characterization and Recognition of Point-Halfspace and Related Orders. | Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman |
| 1994 | SODA | Optimal Parallel Approximation for Prefix Sums and Integer Sorting. | Michael T. Goodrich, Yossi Matias, Uzi Vishkin |
| 1993 | FOCS | External-Memory Computational Geometry (Preliminary Version) | Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter |
| 1993 | PODS | Blocking for External Graph Searching. | Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter |
| 1993 | WADS | Point Probe Decision Trees for Geometric Concept Classes. | Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena |
| 1992 | STOC | Planar Separators and Parallel Polygon Triangulation (Preliminary Version) | Michael T. Goodrich |
| 1991 | FOCS | Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) | Michael T. Goodrich |
| 1991 | STOC | Dynamic Trees and Dynamic Point Location (Preliminary Version) | Michael T. Goodrich, Roberto Tamassia |
| 1991 | SPAA | In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). | Mujtaba R. Ghouse, Michael T. Goodrich |
| 1991 | SPAA | Constructing Arrangements Optimally in Parallel (Preliminary Version). | Michael T. Goodrich |
| 1990 | ICALP | Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). | Richard Cole, Michael T. Goodrich, Colm 'Dnlaing |
| 1990 | ICALP | An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). | Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars |
| 1990 | SODA | Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. | Michael T. Goodrich |
| 1990 | SPAA | P-Complete Geometric Problems. | Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich |
| 1990 | SPAA | Generalized Sweep Methods for Parallel Computational Geometry. | Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright |
| 1989 | FOCS | Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) | Michael T. Goodrich, S. Rao Kosaraju |
| 1989 | SPAA | Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. | Michael T. Goodrich |
| 1989 | WADS | Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). | Michael T. Goodrich, Colm 'Dnlaing, Chee-Keng Yap |
| 1989 | WADS | Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). | Michael T. Goodrich, Jack Snoeyink |
| 1987 | FOCS | Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms | Mikhail J. Atallah, Richard Cole, Michael T. Goodrich |
| 1985 | ICPP | Efficient Parallel Solutions to Geometric Problems. | Mikhail J. Atallah, Michael T. Goodrich |