Michael T. Goodrich

503 papers A* 40A 61B 61C 13Misc 2Journal 236Unranked 79

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms. CoRR Ofek Gila, Michael T. Goodrich, Vinesh Sridhar
2026	B	`conf`	Sublinear Work Parallel Quantum Algorithms for Computational Geometry. SOFSEM Shion Fukuzawa, Michael T. Goodrich, Sandy Irani
2026	J	`jnl`	Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. Algorithmica Ofek Gila, Michael T. Goodrich, Robert E. Tarjan
2025	J	`jnl`	A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture. Inf. Process. Lett. Michael T. Goodrich
2025	A	`conf`	Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. ESA David Eppstein, Michael T. Goodrich, Songyu Liu
2025	J	`jnl`	Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing. CoRR David Eppstein, Michael T. Goodrich, Songyu Liu
2025	J	`jnl`	Combinatorial Drone Searching. CoRR Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	B	`conf`	Computational Geometry with Probabilistically Noisy Primitive Operations. WADS David Eppstein, Michael T. Goodrich, Vinesh Sridhar
2025	J	`jnl`	Computational Geometry with Probabilistically Noisy Primitive Operations. CoRR David Eppstein, Michael T. Goodrich, Vinesh Sridhar
2025	—	`conf`	Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness. CCCG David Eppstein, Michael T. Goodrich, Abraham M. Illickan, Claire A. To
2025	J	`jnl`	Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness. CoRR David Eppstein, Michael T. Goodrich, Abraham M. Illickan, Claire A. To
2025	C	`conf`	Exact Learning of Weighted Graphs Using Composite Queries. IWOCA Michael T. Goodrich, Songyu Liu, Ioannis Panageas
2025	J	`jnl`	Exact Learning of Weighted Graphs Using Composite Queries. CoRR Michael T. Goodrich, Songyu Liu, Ioannis Panageas
2025	A	`conf`	External-Memory Priority Queues with Optimal Insertions. ESA Gerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning
2025	—	`conf`	Fast Geographic Routing in Fixed-Growth Graphs. CIAC (2) Ofek Gila, Michael T. Goodrich, Abraham M. Illickan, Vinesh Sridhar
2025	J	`jnl`	Fast Geographic Routing in Fixed-Growth Graphs. CoRR Ofek Gila, Michael T. Goodrich, Abraham M. Illickan, Vinesh Sridhar
2025	J	`jnl`	History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. SIGMOD Rec. Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós
2025	J	`jnl`	Leveraging parameterized Chernoff bounds for simplified algorithm analyses. Inf. Process. Lett. Michael B. Dillencourt, Michael T. Goodrich, Michael Mitzenmacher
2025	—	`conf`	Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations. CCCG Michael T. Goodrich, Vinesh Sridhar
2025	J	`jnl`	Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations. CoRR Michael T. Goodrich, Vinesh Sridhar
2025	B	`conf`	Parallel Joinable B-Trees in the Fork-Join I/O Model. ISAAC Michael T. Goodrich, Yan Gu, Ryuto Kitagawa, Yihan Sun
2025	J	`jnl`	Parallel Joinable B-Trees in the Fork-Join I/O Model. CoRR Michael T. Goodrich, Yan Gu, Ryuto Kitagawa, Yihan Sun
2025	—	`conf`	Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds. SOFSEM (2) Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher
2025	A*	`conf`	Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction. SoCG Shion Fukuzawa, Michael T. Goodrich, Sandy Irani
2025	J	`jnl`	Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction. CoRR Shion Fukuzawa, Michael T. Goodrich, Sandy Irani
2025	B	`conf`	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. WADS Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg
2025	J	`jnl`	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. CoRR Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nöllenburg
2025	—	`conf`	SGV: Spatial Graph Visualization. SIGSPATIAL/GIS Tarlan Bahadori, Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich
2025	—	`conf`	The Marco Polo Problem: A Combinatorial Approach to Geometric Localization. CCCG Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	—	`conf`	The Rectilinear Marco Polo Problem. CCCG Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	J	`jnl`	The Rectilinear Marco Polo Problem. CoRR Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	A	`conf`	Visualizing Treewidth. GD Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg
2025	J	`jnl`	Visualizing Treewidth. CoRR Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg
2025	—	`conf`	Zip-Tries: Simple Dynamic Data Structures for Strings. ACDA David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa
2025	J	`jnl`	Zip-Tries: Simple Dynamic Data Structures for Strings. CoRR David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa
2024	A	`conf`	Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. GD David Eppstein, Michael T. Goodrich, Abraham M. Illickan
2024	J	`jnl`	Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. CoRR David Eppstein, Michael T. Goodrich, Abraham M. Illickan
2024	—	`conf`	Dynamic Accountable Storage: An Efficient Protocol for Real-Time Cloud Storage Auditing. ALGOCLOUD Michael T. Goodrich, Ryuto Kitagawa, Vinesh Sridhar
2024	J	`jnl`	Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing. CoRR Michael T. Goodrich, Ryuto Kitagawa, Vinesh Sridhar
2024	J	`jnl`	Highway Preferential Attachment Models for Geographic Routing. CoRR Ofek Gila, Evrim Ozel, Michael T. Goodrich
2024	J	`jnl`	History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. Proc. ACM Manag. Data Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich, Hanna Komlós
2024	J	`jnl`	Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm. CoRR Michael T. Goodrich, Ryuto Kitagawa
2024	A	`conf`	Polygonally Anchored Graph Drawing (Poster Abstract). GD Alvin Chiu, Ahmed Eldawy, Michael T. Goodrich
2023	B	`conf`	External-Memory Sorting with Comparison Errors. WADS Michael T. Goodrich, Evrim Ozel
2023	J	`jnl`	Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search. CoRR Alvin Chiu, Mithun Ghosh, Abu Reyan Ahmed, Kwang-Sung Jun, Stephen G. Kobourov, Michael T. Goodrich
2023	J	`jnl`	Hiding Access-pattern is Not Enough! Veil: A Storage and Communication Efficient Volume-Hiding Algorithm. CoRR Shanshan Han, Vishal Chakraborty, Michael T. Goodrich, Sharad Mehrotra, Shantanu Sharma
2023	—	`conf`	Highway Preferential Attachment Models for Geographic Routing. COCOA (2) Ofek Gila, Evrim Ozel, Michael T. Goodrich
2023	J	`jnl`	Improved kernels for tracking paths. Inf. Process. Lett. Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman
2023	—	`conf`	Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. GD (2) Alvin Chiu, David Eppstein, Michael T. Goodrich
2023	J	`jnl`	Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. CoRR Alvin Chiu, David Eppstein, Michael T. Goodrich
2023	B	`conf`	Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. SEA Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel
2023	B	`conf`	Optimal Parallel Sorting with Comparison Errors. SPAA Michael T. Goodrich, Riko Jacob
2023	J	`jnl`	Quantum Tutte Embeddings. CoRR Shion Fukuzawa, Michael T. Goodrich, Sandy Irani
2023	J	`jnl`	Secure and Accurate Summation of Many Floating-Point Numbers. CoRR Marina Blanton, Michael T. Goodrich, Chen Yuan
2023	J	`jnl`	Secure and Accurate Summation of Many Floating-Point Numbers. Proc. Priv. Enhancing Technol. Marina Blanton, Michael T. Goodrich, Chen Yuan
2023	J	`jnl`	Simplified Chernoff bounds with powers-of-two probabilities. Inf. Process. Lett. Michael B. Dillencourt, Michael T. Goodrich
2023	J	`jnl`	Veil: A Storage and Communication Efficient Volume-Hiding Algorithm. Proc. ACM Manag. Data Shanshan Han, Vishal Chakraborty, Michael T. Goodrich, Sharad Mehrotra, Shantanu Sharma
2023	B	`conf`	Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. WADS Ofek Gila, Michael T. Goodrich, Robert E. Tarjan
2023	J	`jnl`	Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. CoRR Ofek Gila, Michael T. Goodrich, Robert E. Tarjan
2022	J	`jnl`	Beyond big O: teaching experimental algorithmics. J. Comput. Sci. Coll. Michael Shindler, Michael T. Goodrich, Ofek Gila, Michael B. Dillencourt
2022	—	`conf`	Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CCCG Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2022	J	`jnl`	Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. CoRR Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2022	B	`conf`	Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. SEA Ramtin Afshar, Michael T. Goodrich, Evrim Ozel
2022	B	`conf`	Exact Learning of Multitrees and Almost-Trees Using Path Queries. LATIN Ramtin Afshar, Michael T. Goodrich
2022	J	`jnl`	Exact Learning of Multitrees and Almost-Trees Using Path Queries. CoRR Ramtin Afshar, Michael T. Goodrich
2022	A	`conf`	Mapping Networks via Parallel kth-Hop Traceroute Queries. STACS Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2022	J	`jnl`	Modeling the Small-World Phenomenon with Road Networks. CoRR Michael T. Goodrich, Evrim Ozel
2022	—	`conf`	Modeling the small-world phenomenon with road networks. SIGSPATIAL/GIS Michael T. Goodrich, Evrim Ozel
2022	—	`conf`	Optimally Confining Lattice Polymers. CCCG Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel
2021	J	`jnl`	A competitive analysis for the Start-Gap algorithm for online memory wear leveling. Inf. Process. Lett. William E. Devanny, Michael T. Goodrich, Sandy Irani
2021	A*	`conf`	Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. SODA Michael T. Goodrich, Riko Jacob, Nodari Sitchinava
2021	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2021	J	`jnl`	Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. Algorithmica Gill Barequet, Minati De, Michael T. Goodrich
2021	B	`conf`	How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. WADS Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias
2021	J	`jnl`	How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. CoRR Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias
2021	B	`conf`	Parallel Network Mapping Algorithms. SPAA Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	C	`conf`	Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. SPIRE Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias
2020	J	`jnl`	Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors, and Jumbled-Index Queries in String Reconstruction. CoRR Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias
2020	B	`conf`	Reconstructing Binary Trees in Parallel. SPAA Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	A	`conf`	Reconstructing Biological and Digital Phylogenetic Trees in Parallel. ESA Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	J	`jnl`	Reconstructing Biological and Digital Phylogenetic Trees in Parallel. CoRR Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda
2020	J	`jnl`	Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2019	B	`conf`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	A	`conf`	Computing k-Modal Embeddings of Planar Digraphs. ESA Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich
2019	J	`jnl`	Computing k-Modal Embeddings of Planar Digraphs. CoRR Juan José Besa Vial, Giordano Da Lozzo, Michael T. Goodrich
2019	J	`jnl`	Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains. CoRR Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Nil Mamano, Pedro Matias, Valentin Polishchuk
2019	C	`conf`	Minimum-Width Drawings of Phylogenetic Trees. COCOA Juan José Besa Vial, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda
2019	B	`conf`	New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs. ISAAC Nil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk
2019	J	`jnl`	On the Optical Accuracy of the Salvator Mundi. CoRR Marco Liang, Michael T. Goodrich, Shuang Zhao
2019	B	`conf`	Tracking Paths in Planar Graphs. ISAAC David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
2019	J	`jnl`	Tracking Paths in Planar Graphs. CoRR David Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias
2018	Misc	`conf`	Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON Gill Barequet, Minati De, Michael T. Goodrich
2018	—	`conf`	Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CCCG David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres
2018	J	`jnl`	Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching. CoRR David Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres
2018	A	`conf`	Isogrammic-Fusion ORAM: Improved Statistically Secure Privacy-Preserving Cloud Data Access for Thin Clients. AsiaCCS Michael T. Goodrich
2018	—	`conf`	Low Ply Drawings of Trees and 2-Trees. CCCG Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Low Ply Drawings of Trees and 2-Trees. CoRR Michael T. Goodrich, Timothy Johnson
2018	A*	`conf`	Optimally Sorting Evolving Data. ICALP Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Optimally Sorting Evolving Data. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Planar and poly-arc Lombardi drawings. J. Comput. Geom. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg
2018	A	`conf`	Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	J	`jnl`	Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson
2018	B	`conf`	Reactive Proximity Data Structures for Graphs. LATIN David Eppstein, Michael T. Goodrich, Nil Mamano
2018	J	`jnl`	Reactive Proximity Data Structures for Graphs. CoRR David Eppstein, Michael T. Goodrich, Nil Mamano
2018	A*	`conf`	Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2018	J	`jnl`	Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. CoRR Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano
2018	B	`conf`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2018	J	`jnl`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2017	A*	`conf`	2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection. PODS David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Manuel R. Torres
2017	B	`conf`	Accountable Storage. ACNS Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia
2017	C	`conf`	Algorithms for Stable Matching and Clustering in a Grid. IWCIA David Eppstein, Michael T. Goodrich, Nil Mamano
2017	J	`jnl`	Algorithms for Stable Matching and Clustering in a Grid. CoRR David Eppstein, Michael T. Goodrich, Nil Mamano
2017	—	`conf`	Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters. SIGSPATIAL/GIS Michael T. Goodrich
2017	J	`jnl`	Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters. CoRR Michael T. Goodrich
2017	A	`conf`	Auditable Data Structures. EuroS&P Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2017	—	`conf`	BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage. WPES@CCS Michael T. Goodrich
2017	J	`jnl`	BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage. CoRR Michael T. Goodrich
2017	B	`conf`	Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. SPAA David Eppstein, Michael T. Goodrich
2017	—	`conf`	Defining Equitable Geographic Districts in Road Networks via Stable Matching. SIGSPATIAL/GIS David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano
2017	J	`jnl`	Defining Equitable Geographic Districts in Road Networks via Stable Matching. CoRR David Eppstein, Michael T. Goodrich, Doruk Korkmaz, Nil Mamano
2017	J	`jnl`	Secure Fingerprint Alignment and Matching Protocols. CoRR Fattaneh Bayatbabolghani, Marina Blanton, Mehrdad Aliasgari, Michael T. Goodrich
2017	A	`conf`	The Online House Numbering Problem: Min-Max Online List Labeling. ESA William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz
2016	J	`jnl`	A Topological Algorithm for Determining How Road Networks Evolve Over Time. CoRR Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres
2016	—	`conf`	A topological algorithm for determining how road networks evolve over time. SIGSPATIAL/GIS Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres
2016	J	`jnl`	Auditable Data Structures. IACR Cryptol. ePrint Arch. Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	J	`jnl`	Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. CoRR Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich
2016	C	`conf`	J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode. VizSEC Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson
2016	J	`jnl`	J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode. CoRR Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson
2016	C	`conf`	Models and Algorithms for Graph Watermarking. ISC David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	J	`jnl`	Models and Algorithms for Graph Watermarking. CoRR David Eppstein, Michael T. Goodrich, Jenny Lam, Nil Mamano, Michael Mitzenmacher, Manuel R. Torres
2016	—	`conf`	More Practical and Secure History-Independent Hash Tables. ESORICS (2) Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	J	`jnl`	More Practical and Secure History-Independent Hash Tables. IACR Cryptol. ePrint Arch. Michael T. Goodrich, Evgenios M. Kornaropoulos, Michael Mitzenmacher, Roberto Tamassia
2016	B	`conf`	Parallel Algorithms for Summing Floating-Point Numbers. SPAA Michael T. Goodrich, Ahmed Eldawy
2016	J	`jnl`	Parallel Algorithms for Summing Floating-Point Numbers. CoRR Michael T. Goodrich, Ahmed Eldawy
2016	B	`conf`	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. SPAA William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj
2016	J	`jnl`	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. CoRR William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj
2016	A	`ed.`	Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016 ALENEX Michael T. Goodrich, Michael Mitzenmacher
2016	C	`conf`	Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. ATMOS Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
2016	J	`jnl`	Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection. CoRR Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich
2016	Misc	`conf`	Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees. SCN Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
2015	J	`jnl`	Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data. IACR Cryptol. ePrint Arch. Esha Ghosh, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
2015	A	`conf`	Knuthian Drawings of Series-Parallel Flowcharts. GD Michael T. Goodrich, Timothy Johnson, Manuel R. Torres
2015	J	`jnl`	Knuthian Drawings of Series-Parallel Flowcharts. CoRR Michael T. Goodrich, Timothy Johnson, Manuel R. Torres
2015	J	`jnl`	The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. J. Graph Algorithms Appl. Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2014	J	`jnl`	Accountable Storage. IACR Cryptol. ePrint Arch. Giuseppe Ateniese, Michael T. Goodrich, Vassilios Lekakis, Charalampos Papamanthou, Evripidis Paraskevas, Roberto Tamassia
2014	A	`conf`	Balanced Circle Packings for Planar Graphs. GD Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev
2014	J	`jnl`	Balanced Circle Packings for Planar Graphs. CoRR Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev
2014	C	`conf`	Data-Oblivious Graph Algorithms in Outsourced External Memory. COCOA Michael T. Goodrich, Joseph A. Simons
2014	J	`jnl`	Data-Oblivious Graph Algorithms in Outsourced External Memory. CoRR Michael T. Goodrich, Joseph A. Simons
2014	J	`jnl`	Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons. Algorithmica Michael T. Goodrich
2014	A	`conf`	The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. GD Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2014	J	`jnl`	The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. CoRR Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich
2014	—	`conf`	The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. ICALP (2) Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
2014	J	`jnl`	The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. CoRR Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal
2014	J	`jnl`	Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes. CoRR Michael T. Goodrich, Pawel Pszona
2014	—	`conf`	Two-phase bicriterion search for finding fast and efficient electric vehicle routes. SIGSPATIAL/GIS Michael T. Goodrich, Pawel Pszona
2014	B	`conf`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. SEA David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2014	J	`jnl`	Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. CoRR David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, Pawel Pszona
2014	—	`conf`	Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CCCG Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
2014	J	`jnl`	Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets. CoRR Michael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott
2014	J	`jnl`	Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time. CoRR Michael T. Goodrich
2014	A*	`conf`	Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time. STOC Michael T. Goodrich
2013	A	`conf`	Achieving Good Angular Resolution in 3D Arc Diagrams. GD Michael T. Goodrich, Pawel Pszona
2013	J	`jnl`	Achieving Good Angular Resolution in 3D Arc Diagrams. CoRR Michael T. Goodrich, Pawel Pszona
2013	J	`jnl`	Category-based routing in social networks: Membership dimension and the small-world phenomenon. Theor. Comput. Sci. David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2013	—	`conf`	Cole's Parametric Search Technique Made Practical. CCCG Michael T. Goodrich, Pawel Pszona
2013	J	`jnl`	Cole's Parametric Search Technique Made Practical. CoRR Michael T. Goodrich, Pawel Pszona
2013	J	`jnl`	Combinatorial Pair Testing: Distinguishing Workers from Slackers CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2013	B	`conf`	Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2013	—	`conf`	Computing betweenness centrality in external memory. IEEE BigData Lars Arge, Michael T. Goodrich, Freek van Walderveen
2013	J	`jnl`	Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discret. Comput. Geom. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2013	J	`jnl`	External-Memory Multimaps. Algorithmica Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2013	J	`jnl`	Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies. IEEE Trans. Knowl. Data Eng. Arthur U. Asuncion, Michael T. Goodrich
2013	—	`ch.`	Planar Orthogonal and Polyline Drawing Algorithms. Handbook of Graph Drawing and Visualization Christian A. Duncan, Michael T. Goodrich
2013	—	`conf`	Set-Difference Range Queries. CCCG David Eppstein, Michael T. Goodrich, Joseph A. Simons
2013	J	`jnl`	Set-Difference Range Queries. CoRR David Eppstein, Michael T. Goodrich, Joseph A. Simons
2013	A	`conf`	Streamed Graph Drawing and the File Maintenance Problem. GD Michael T. Goodrich, Pawel Pszona
2013	J	`jnl`	Streamed Graph Drawing and the File Maintenance Problem. CoRR Michael T. Goodrich, Pawel Pszona
2012	—	`conf`	Anonymous Card Shuffling and Its Applications to Parallel Mixnets. ICALP (2) Michael T. Goodrich, Michael Mitzenmacher
2012	J	`jnl`	Anonymous Card Shuffling and its Applications to Parallel Mixnets CoRR Michael T. Goodrich, Michael Mitzenmacher
2012	—	`conf`	Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2012	J	`jnl`	Data-Oblivious Graph Drawing Model and Algorithms CoRR Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
2012	J	`jnl`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. J. Graph Algorithms Appl. Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2012	J	`jnl`	Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers. Proc. VLDB Endow. Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes
2012	J	`jnl`	Extended dynamic subgraph statistics using h-index parameterized data structures. Theor. Comput. Sci. David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2012	J	`jnl`	Force-Directed Graph Drawing Using Social Gravity and Scaling CoRR Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
2012	A	`conf`	Force-Directed Graph Drawing Using Social Gravity and Scaling. GD Michael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott
2012	A	`conf`	Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. GD Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia
2012	J	`jnl`	Learning Character Strings via Mastermind Queries, With a Case Study Involving mtDNA. IEEE Trans. Inf. Theory Michael T. Goodrich
2012	J	`jnl`	Lombardi Drawings of Graphs. J. Graph Algorithms Appl. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2012	A	`conf`	More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. GD Michael T. Goodrich, Joseph A. Simons
2012	A	`conf`	On the Density of Maximal 1-Planar Graphs. GD Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber
2012	—	`conf`	Practical oblivious storage. CODASPY Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2012	A*	`conf`	Privacy-preserving group data access via stateless oblivious RAM simulation. SODA Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2012	J	`jnl`	Verifying Search Results Over Web Collections CoRR Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes
2011	B	`conf`	Brief announcement: large-scale multimaps. SPAA Michael T. Goodrich, Michael Mitzenmacher
2011	J	`jnl`	Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	J	`jnl`	Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	—	`conf`	Category-based routing in social networks: Membership dimension and the small-world phenomenon. CASoN David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott
2011	J	`jnl`	Data-Oblivious External-Memory Algorithms for the Compaction, Selection, and Sorting of Outsourced Data CoRR Michael T. Goodrich
2011	B	`conf`	Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. SPAA Michael T. Goodrich
2011	J	`jnl`	Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos
2011	J	`jnl`	External-Memory Multimaps CoRR Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2011	B	`conf`	External-Memory Multimaps. ISAAC Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
2011	J	`jnl`	External-Memory Network Analysis Algorithms for Naturally Sparse Graphs CoRR Michael T. Goodrich, Pawel Pszona
2011	A	`conf`	External-Memory Network Analysis Algorithms for Naturally Sparse Graphs. ESA Michael T. Goodrich, Pawel Pszona
2011	A	`conf`	Force-Directed Lombardi-Style Graph Drawing. GD Roman Chernobelskiy, Kathryn I. Cunningham, Michael T. Goodrich, Stephen G. Kobourov, Lowell Trott
2011	J	`jnl`	Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps CoRR Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2011	J	`jnl`	Fully Retroactive Approximate Range and Nearest Neighbor Searching CoRR Michael T. Goodrich, Joseph A. Simons
2011	B	`conf`	Fully Retroactive Approximate Range and Nearest Neighbor Searching. ISAAC Michael T. Goodrich, Joseph A. Simons
2011	J	`jnl`	Invertible Bloom Lookup Tables CoRR Michael T. Goodrich, Michael Mitzenmacher
2011	—	`conf`	Invertible bloom lookup tables. Allerton Michael T. Goodrich, Michael Mitzenmacher
2011	J	`jnl`	Oblivious RAM Simulation with Efficient Worst-Case Access Overhead CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	—	`conf`	Oblivious RAM simulation with efficient worst-case access overhead. CCSW Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	J	`jnl`	Oblivious Storage with Low I/O Overhead CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	J	`jnl`	Planar Drawings of Higher-Genus Graphs. J. Graph Algorithms Appl. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2011	J	`jnl`	Planar and Poly-Arc Lombardi Drawings CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler
2011	A	`conf`	Planar and Poly-arc Lombardi Drawings. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler
2011	J	`jnl`	Privacy-Enhanced Methods for Comparing Compressed DNA Sequences CoRR David Eppstein, Michael T. Goodrich, Pierre Baldi
2011	J	`jnl`	Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions CoRR Michael T. Goodrich, Florian Kerschbaum
2011	—	`conf`	Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. ICALP (2) Michael T. Goodrich, Michael Mitzenmacher
2011	J	`jnl`	Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation CoRR Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2011	—	`conf`	Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions. CODASPY Michael T. Goodrich, Florian Kerschbaum
2011	J	`jnl`	Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm. J. ACM Michael T. Goodrich
2011	J	`jnl`	Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. Trans. Comput. Sci. Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson, Ying Daisy Zhuo
2011	J	`jnl`	Sorting, Searching, and Simulation in the MapReduce Framework CoRR Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
2011	B	`conf`	Sorting, Searching, and Simulation in the MapReduce Framework. ISAAC Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
2011	—	`conf`	Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. ANALCO Michael T. Goodrich
2011	J	`jnl`	Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. IEEE Trans. Knowl. Data Eng. David Eppstein, Michael T. Goodrich
2011	J	`jnl`	Succinct Greedy Geometric Routing Using Hyperbolic Geometry. IEEE Trans. Computers David Eppstein, Michael T. Goodrich
2011	J	`jnl`	Tracking Moving Objects with Few Handovers CoRR David Eppstein, Michael T. Goodrich, Maarten Löffler
2011	B	`conf`	Tracking Moving Objects with Few Handovers. WADS David Eppstein, Michael T. Goodrich, Maarten Löffler
2011	A*	`conf`	What's the difference?: efficient set reconciliation without prior context. SIGCOMM David Eppstein, Michael T. Goodrich, Frank C. Uyeda, George Varghese
2010	A	`conf`	Bureaucratic protocols for secure two-party sorting, selection, and permuting. AsiaCCS Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenliang Du, Zutao Zhu
2010	J	`jnl`	Cloning Voronoi Diagrams via Retroactive Data Structures CoRR Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
2010	—	`conf`	Cloning Voronoi Diagrams via Retroactive Data Structures. ESA (1) Matthew T. Dickerson, David Eppstein, Michael T. Goodrich
2010	J	`jnl`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area CoRR Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2010	A	`conf`	Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. GD Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler
2010	J	`jnl`	Drawing Trees with Perfect Angular Resolution and Polynomial Area CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	A	`conf`	Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	—	`conf`	Extended Dynamic Subgraph Statistics Using COCOA (1) David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2010	J	`jnl`	Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics CoRR David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott
2010	J	`jnl`	Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. SIAM J. Comput. David Eppstein, Michael T. Goodrich, Darren Strash
2010	J	`jnl`	Lombardi Drawings of Graphs CoRR Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	A	`conf`	Lombardi Drawings of Graphs. GD Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
2010	J	`jnl`	MapReduce Parallel Cuckoo Hashing and Oblivious RAM Simulations CoRR Michael T. Goodrich, Michael Mitzenmacher
2010	J	`jnl`	Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies CoRR Arthur U. Asuncion, Michael T. Goodrich
2010	A	`conf`	Parallel external memory graph algorithms. IPDPS Lars Arge, Michael T. Goodrich, Nodari Sitchinava
2010	J	`jnl`	Priority Range Trees CoRR Michael T. Goodrich, Darren Strash
2010	—	`conf`	Priority Range Trees. ISAAC (1) Michael T. Goodrich, Darren Strash
2010	J	`jnl`	Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data CoRR David Eppstein, Michael T. Goodrich, Roberto Tamassia
2010	—	`conf`	Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS David Eppstein, Michael T. Goodrich, Roberto Tamassia
2010	A*	`conf`	Randomized Shellsort: A Simple Oblivious Sorting Algorithm. SODA Michael T. Goodrich
2010	J	`jnl`	Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks CoRR Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson
2010	—	`conf`	Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks. ISVD Matthew T. Dickerson, Michael T. Goodrich, Thomas D. Dickerson
2010	J	`jnl`	Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry CoRR Michael T. Goodrich
2010	J	`jnl`	Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons CoRR Michael T. Goodrich
2010	—	`conf`	Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors. WPES Arthur U. Asuncion, Michael T. Goodrich
2009	J	`jnl`	An Efficient Dynamic and Distributed RSA Accumulator CoRR Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic
2009	J	`jnl`	Approximate topological matching of quad meshes. Vis. Comput. David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2009	J	`jnl`	Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric CoRR Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu
2009	J	`jnl`	Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems CoRR Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos
2009	J	`jnl`	Going Off-road: Transversal Complexity in Road Networks CoRR David Eppstein, Michael T. Goodrich, Lowell Trott
2009	—	`conf`	Going off-road: transversal complexity in road networks. GIS David Eppstein, Michael T. Goodrich, Lowell Trott
2009	J	`jnl`	Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis CoRR Michael T. Goodrich, Daniel S. Hirschberg
2009	A*	`conf`	Linear-time algorithms for geometric graphs with sublinearly many crossings. SODA David Eppstein, Michael T. Goodrich, Darren Strash
2009	J	`jnl`	On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results CoRR Michael T. Goodrich
2009	J	`jnl`	On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem CoRR Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
2009	B	`conf`	On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. WADS Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker
2009	J	`jnl`	On the algorithmic complexity of the Mastermind game with black-peg results. Inf. Process. Lett. Michael T. Goodrich
2009	J	`jnl`	Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations CoRR Michael T. Goodrich
2009	J	`jnl`	Planar Drawings of Higher-Genus Graphs CoRR Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2009	A	`conf`	Planar Drawings of Higher-Genus Graphs. GD Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2009	J	`jnl`	Randomized Shellsort: A Simple Oblivious Sorting Algorithm CoRR Michael T. Goodrich
2009	C	`conf`	Reliable Resource Searching in P2P Networks. SecureComm Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos
2009	B	`conf`	Succinct Greedy Geometric Routing in the Euclidean Plane. ISAAC Michael T. Goodrich, Darren Strash
2009	J	`jnl`	The Mastermind Attack on Genomic Data CoRR Michael T. Goodrich
2009	A*	`conf`	The Mastermind Attack on Genomic Data. SP Michael T. Goodrich
2009	J	`jnl`	The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree P2P Relay Structure CoRR Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun
2009	J	`jnl`	Using audio in secure device pairing. Int. J. Secur. Networks Michael T. Goodrich, Michael Sirivianos, John Solis, Claudio Soriente, Gene Tsudik, Ersin Uzun
2008	—	`conf`	Approximate topological matching of quadrilateral meshes. Shape Modeling International David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2008	C	`conf`	Athos: Efficient Authentication of Outsourced File Systems. ISC Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos
2008	B	`conf`	Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava
2008	J	`jnl`	Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. Michael T. Goodrich, Daniel S. Hirschberg
2008	J	`jnl`	Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings CoRR David Eppstein, Michael T. Goodrich, Darren Strash
2008	J	`jnl`	Motorcycle Graphs: Canonical Quad Mesh Partitioning. Comput. Graph. Forum David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
2008	J	`jnl`	Notarized federated ID management and authentication. J. Comput. Secur. Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao
2008	J	`jnl`	Pipelined algorithms to detect cheating in long-term grid computations. Theor. Comput. Sci. Michael T. Goodrich
2008	J	`jnl`	Probabilistic packet marking for large-scale IP traceback. IEEE/ACM Trans. Netw. Michael T. Goodrich
2008	J	`jnl`	Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. Int. J. Comput. Geom. Appl. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2008	J	`jnl`	Straight Skeletons of Three-Dimensional Polyhedra CoRR Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
2008	A	`conf`	Straight Skeletons of Three-Dimensional Polyhedra. ESA Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
2008	J	`jnl`	Studying (Non-Planar) Road Networks Through an Algorithmic Lens CoRR David Eppstein, Michael T. Goodrich
2008	—	`conf`	Studying (non-planar) road networks through an algorithmic lens. GIS David Eppstein, Michael T. Goodrich
2008	J	`jnl`	Succinct Greedy Geometric Routing in R^2 CoRR Michael T. Goodrich, Darren Strash
2008	J	`jnl`	Succinct Greedy Graph Drawing in the Hyperbolic Plane CoRR David Eppstein, Michael T. Goodrich
2008	A	`conf`	Succinct Greedy Graph Drawing in the Hyperbolic Plane. GD David Eppstein, Michael T. Goodrich
2008	B	`conf`	Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos
2008	—	`conf`	Two-site Voronoi diagrams in geographic networks. GIS Matthew T. Dickerson, Michael T. Goodrich
2007	B	`conf`	Checking Value-Sensitive Data Structures in Sublinear Space. ISAAC Michael T. Goodrich, Jonathan Z. Sun
2007	J	`jnl`	Confluent Layered Drawings. Algorithmica David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2007	J	`jnl`	Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2007	B	`conf`	Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. WADS Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu
2007	—	`ch.`	Distributed Peer-to-Peer Data Structures. Handbook of Parallel Computing Michael T. Goodrich, Michael J. Nelson
2007	—	`conf`	Guard placement for efficient point-in-polygon proofs. SCG David Eppstein, Michael T. Goodrich, Nodari Sitchinava
2007	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2007	—	`conf`	On the Cost of Persistence and Authentication in Skip Lists. WEA Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia
2007	B	`conf`	Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. WADS David Eppstein, Michael T. Goodrich
2007	J	`jnl`	Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters CoRR David Eppstein, Michael T. Goodrich
2006	J	`jnl`	Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information. IEEE Trans. Knowl. Data Eng. Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer
2006	A	`conf`	Choosing Colors for Geometric Graphs Via Color Space Embeddings. GD Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
2006	J	`jnl`	Choosing Colors for Geometric Graphs via Color Space Embeddings CoRR Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
2006	B	`conf`	Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA Michael T. Goodrich, Daniel S. Hirschberg
2006	J	`jnl`	Guard Placement For Wireless Localization CoRR David Eppstein, Michael T. Goodrich, Nodari Sitchinava
2006	C	`conf`	LAAC: A Location-Aware Access Control Protocol. MobiQuitous YounSun Cho, Lichun Bao, Michael T. Goodrich
2006	A	`conf`	Loud and Clear: Human-Verifiable Authentication Based on Audio. ICDCS Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun
2006	B	`conf`	Notarized Federated Identity Management for Web Services. DBSec Michael T. Goodrich, Roberto Tamassia, Danfeng Yao
2006	A*	`conf`	The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. SODA Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun
2005	—	`conf`	Accredited DomainKeys: A Service Architecture for Improved Email Validation. CEAS Michael T. Goodrich, Roberto Tamassia, Danfeng Yao
2005	B	`conf`	Balanced Aspect Ratio Trees Revisited. WADS Amitabh Chaudhary, Michael T. Goodrich
2005	J	`jnl`	Biased Skip Lists. Algorithmica Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
2005	A	`conf`	C-Planarity of Extrovert Clustered Graphs. GD Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
2005	J	`jnl`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. J. Graph Algorithms Appl. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Confluent Layered Drawings CoRR David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	A	`conf`	Delta-Confluent Drawings. GD David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Delta-confluent Drawings CoRR David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2005	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005	B	`conf`	Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005	B	`conf`	Indexing Information for Data Forensics. ACNS Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia
2005	—	`conf`	Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts. S&P Michael T. Goodrich
2005	J	`jnl`	Loud and Clear: Human-Verifiable Authentication Based on Audio. IACR Cryptol. ePrint Arch. Michael T. Goodrich, Michael Sirivianos, John Solis, Gene Tsudik, Ersin Uzun
2005	J	`jnl`	Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
2005	B	`conf`	Searching for High-Value Rare Events with Uncheatable Grid Computing. ACNS Wenliang Du, Michael T. Goodrich
2005	—	`conf`	Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia
2005	J	`jnl`	Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets CoRR Lars Arge, David Eppstein, Michael T. Goodrich
2005	A*	`conf`	Skip-webs: efficient distributed data structures for multi-dimensional data sets. PODC Lars Arge, David Eppstein, Michael T. Goodrich
2005	J	`jnl`	The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data CoRR David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2005	—	`conf`	The skip quadtree: a simple dynamic data structure for multidimensional data. SCG David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
2004	J	`jnl`	A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
2004	—	`ch.`	Approximate Geometric Query Structures. Handbook of Data Structures and Applications Christian A. Duncan, Michael T. Goodrich
2004	A	`conf`	Confluent Layered Drawings. GD David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2004	J	`jnl`	Contour interpolation by straight skeletons. Graph. Model. Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
2004	—	`ch.`	Data Structures in JDSL. Handbook of Data Structures and Applications Michael T. Goodrich, Roberto Tamassia, Luca Vismara
2004	—	`book`	Data structures and algorithms in C++. Michael T. Goodrich, Roberto Tamassia, David M. Mount
2004	—	`conf`	Deterministic sampling and range counting in geometric data streams. SCG Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2004	J	`jnl`	Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. Gill Barequet, Michael T. Goodrich, Chris Riley
2004	A*	`conf`	Efficient Tree-Based Revocation in Groups of Low-State Devices. CRYPTO Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia
2004	—	`ch.`	Parallel algorithms in geometry. Handbook of Discrete and Computational Geometry, 2nd Ed. Michael T. Goodrich
2004	J	`jnl`	Three-Dimensional Layers of Maxima. Algorithmica Adam L. Buchsbaum, Michael T. Goodrich
2003	B	`conf`	Authenticated Data Structures for Graph and Geometric Searching. CT-RSA Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen
2003	—	`conf`	Authenticated Dictionaries for Fresh Attribute Credentials. iTrust Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough
2003	A	`conf`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. GD Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2003	A	`conf`	Constructing Disjoint Paths for Secure Communication. DISC Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu
2003	—	`book`	Data structures and algorithms in Java (3. ed.). Michael T. Goodrich, Roberto Tamassia
2003	J	`jnl`	Deterministic Sampling and Range Counting in Geometric Data Streams CoRR Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
2003	—	`conf`	Distributed Data Authenication (System Demonstration). DISCEX (2) Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia
2003	B	`conf`	Drawing Graphs with Large Vertices and Thick Edges. WADS Gill Barequet, Michael T. Goodrich, Chris Riley
2003	—	`conf`	Efficient and Scalable Infrastructure Support for Dynamic Coalitions. DISCEX (2) Michael T. Goodrich, Roberto Tamassia
2003	J	`jnl`	Planarity-preserving clustering and embedding for large planar graphs. Comput. Geom. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2003	A	`conf`	Selected Open Problems in Graph Drawing. GD Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
2003	A*	`conf`	Straight-skeleton based contour interpolation. SODA Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner
2002	—	`book`	Algorithm design - foundations, analysis and internet examples. Michael T. Goodrich, Roberto Tamassia
2002	C	`conf`	An Efficient Dynamic and Distributed Cryptographic Accumulator. ISC Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic
2002	B	`conf`	Biased Skip Lists. ISAAC Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
2002	J	`jnl`	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way CoRR Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
2002	A*	`conf`	Efficient packet marking for large-scale IP traceback. CCS Michael T. Goodrich
2002	J	`jnl`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
2002	A	`ed.`	Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers GD Stephen G. Kobourov, Michael T. Goodrich
2002	J	`jnl`	Guest Editor's Foreword. Algorithmica Michael T. Goodrich
2002	J	`jnl`	Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
2002	A	`conf`	Three-Dimensional Layers of Maxima. ESA Adam L. Buchsbaum, Michael T. Goodrich
2001	J	`jnl`	A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. Discret. Comput. Geom. Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
2001	J	`jnl`	Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. J. Algorithms Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2001	J	`jnl`	Drawing Planar Graphs with Circular Arcs. Discret. Comput. Geom. C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2001	—	`conf`	Efficient perspective-accurate silhouette computation and applications. SCG Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar
2001	—	`conf`	Matching points to a convex polygonal boundary. CCCG Matthew Dickerson, Michael T. Goodrich
2001	C	`conf`	Persistent Authenticated Dictionaries and Their Applications. ISC Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia
2001	B	`conf`	Seller-Focused Algorithms for Online Auctioning. WADS Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
2001	A*	`conf`	TRICERT: A Distributed Certified E-Mail Scheme. NDSS Giuseppe Ateniese, Breno de Medeiros, Michael T. Goodrich
2001	A	`conf`	Teaching internet algorithmics. SIGCSE Michael T. Goodrich, Roberto Tamassia
2001	J	`jnl`	Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discret. Comput. Geom. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
2000	J	`jnl`	A Framework for Drawing Planar Graphs with Curves and Polylines. J. Algorithms Michael T. Goodrich, Christopher G. Wagner
2000	A	`conf`	A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. GD Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
2000	J	`jnl`	Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. J. Graph Algorithms Appl. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
2000	A*	`conf`	Competitive tree-structured dictionaries. SODA Michael T. Goodrich
2000	A*	`conf`	Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. SODA Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
2000	J	`jnl`	Editorial. Comput. Geom. Michael T. Goodrich
2000	—	`ch.`	Geometric Data Structures. Handbook of Computational Geometry Michael T. Goodrich, Kumar Ramaiyer
2000	A	`conf`	K-D Trees Are Better when Cut on the Longest Side. ESA Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
2000	—	`conf`	Linear-time triangulation of a simple polygon made easier via randomization. SCG Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
2000	A	`conf`	PILOT: an interactive tool for learning and grading. SIGCSE Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia
2000	A	`conf`	Range Searching Over Tree Cross Products. ESA Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook
2000	A	`conf`	SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. SIGCSE Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia
1999	A	`conf`	Accessing the Internal Organization of Data Structures in the JDSL Library. ALENEX Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
1999	A	`ed.`	Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers ALENEX Michael T. Goodrich, Catherine C. McGeoch
1999	J	`jnl`	Approximate Geometric Pattern Matching Under Rigid Motions. IEEE Trans. Pattern Anal. Mach. Intell. Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
1999	A*	`conf`	Balanced Aspect Ratio Trees: Combining the Advantages of SODA Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
1999	J	`jnl`	Communication-Efficient Parallel Sorting. SIAM J. Comput. Michael T. Goodrich
1999	A	`conf`	Drawing Planar Graphs with Circular Arcs. GD C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
1999	—	`conf`	Efficient Perspective-Accurate Silhouette Computation. SCG Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop
1999	J	`jnl`	GeomNet: Geometric Computing Over the Internet. IEEE Internet Comput. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia
1999	A	`conf`	Planarity-Preserving Clustering and Embedding for Large Planar Graphs. GD Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
1999	A	`conf`	Testers and visualizers for teaching data structures. SIGCSE Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel
1999	B	`conf`	Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. WADS Michael T. Goodrich, John G. Kloss II
1999	A	`conf`	Using randomization in the teaching of data structures and algorithms. SIGCSE Michael T. Goodrich, Roberto Tamassia
1998	A	`conf`	A Framework for Drawing Planar Graphs with Curves and Polylines. GD Michael T. Goodrich, Christopher G. Wagner
1998	J	`jnl`	An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction. Int. J. Comput. Geom. Appl. Michael T. Goodrich
1998	A	`conf`	Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. GD Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
1998	—	`book`	Data structures and algorithms in Java. Michael T. Goodrich, Roberto Tamassia
1998	J	`jnl`	Dynamic Trees and Dynamic Point Location. SIAM J. Comput. Michael T. Goodrich, Roberto Tamassia
1998	—	`conf`	Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. SCG Gill Barequet, Michael T. Goodrich, Danny Z. Chen, Ovidiu Daescu, Jack Snoeyink
1998	J	`jnl`	Offset-polygon annulus placement problems. Comput. Geom. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
1998	A	`conf`	Teaching data structure design patterns. SIGCSE Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia
1998	A	`conf`	Teaching the analysis of algorithms with visual proofs. SIGCSE Michael T. Goodrich, Roberto Tamassia
1997	—	`conf`	Animating the Polygon-Offset Distance Function. SCG Gill Barequet, Amy J. Briggs, Matthew Dickerson, Cristian Dima, Michael T. Goodrich
1997	J	`jnl`	Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. Discret. Comput. Geom. Michael T. Goodrich, Edgar A. Ramos
1997	—	`conf`	Classical Computational Geometry in GeomNet. SCG Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia
1997	J	`jnl`	Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms Michael T. Goodrich, Roberto Tamassia
1997	A*	`conf`	Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos
1997	J	`jnl`	Fast Randomized Parallel Methods for Planar Convex Hull Construction. Comput. Geom. Mujtaba R. Ghouse, Michael T. Goodrich
1997	J	`jnl`	Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1997	A*	`conf`	Methods for Achieving Fast Query Times in Point Location Data Structures. SODA Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer
1997	B	`conf`	Offset-Polygon Annulus Placement Problems. WADS Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
1997	J	`jnl`	On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. Gautam Das, Michael T. Goodrich
1997	A*	`conf`	Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). SODA Michael T. Goodrich
1997	—	`conf`	Snap Rounding Line Segments Efficiently in Two and Three Dimensions. SCG Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum
1997	B	`conf`	Voronoi Diagrams for Polygon-Offset Distance Functions. WADS Gill Barequet, Matthew Dickerson, Michael T. Goodrich
1996	J	`jnl`	A Bridging Model for Parallel Computation, Communication, and I/O. ACM Comput. Surv. Thomas H. Cormen, Michael T. Goodrich
1996	J	`jnl`	A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1996	J	`jnl`	Blocking for External Graph Searching. Algorithmica Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter
1996	A*	`conf`	Communication-Efficient Parallel Sorting (Preliminary Version). STOC Michael T. Goodrich
1996	—	`conf`	Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). SCG Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
1996	A*	`conf`	Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. SODA Michael T. Goodrich
1996	A	`conf`	Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
1996	J	`jnl`	Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. Ashim Garg, Michael T. Goodrich, Roberto Tamassia
1996	J	`jnl`	Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. J. ACM Michael T. Goodrich, S. Rao Kosaraju
1996	J	`jnl`	Sweep Methods for Parallel Computational Geometry. Algorithmica Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright
1995	J	`jnl`	Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. Hervé Brönnimann, Michael T. Goodrich
1995	A*	`conf`	Computing faces in segment and simplex arrangements (Preliminary Version). STOC Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
1995	J	`jnl`	Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. Discret. Comput. Geom. Michael T. Goodrich
1995	A*	`conf`	External-Memory Graph Algorithms. SODA Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
1995	B	`conf`	On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS Gautam Das, Michael T. Goodrich
1995	J	`jnl`	Planar Separators and Parallel Polygon Triangulation. J. Comput. Syst. Sci. Michael T. Goodrich
1995	B	`conf`	Topology B-Trees and Their Applications. WADS Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer
1994	—	`conf`	Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). SCG Hervé Brönnimann, Michael T. Goodrich
1994	—	`conf`	Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). SCG Mikhail J. Atallah, Michael T. Goodrich, Kumar Ramaiyer
1994	A	`conf`	Characterization and Recognition of Point-Halfspace and Related Orders. GD Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman
1994	—	`conf`	Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version). SCG Michael T. Goodrich
1994	A*	`conf`	Optimal Parallel Approximation for Prefix Sums and Integer Sorting. SODA Michael T. Goodrich, Yossi Matias, Uzi Vishkin
1994	J	`jnl`	Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
1994	A*	`conf`	Parallel Algorithms for Higher-Dimensional Convex Hulls FOCS Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
1994	—	`conf`	Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motions (Preliminary Version). SCG Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
1994	A*	`ed.`	Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada STOC Frank Thomson Leighton, Michael T. Goodrich
1993	J	`jnl`	An Addendum to Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
1993	—	`conf`	Approximate Parallel Prefix Computation and its Applications. IPPS Michael T. Goodrich, Yossi Matias, Uzi Vishkin
1993	—	`conf`	Area-Efficient Upward Tree Drawings. SCG Ashim Garg, Michael T. Goodrich, Roberto Tamassia
1993	A*	`conf`	Blocking for External Graph Searching. PODS Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter
1993	J	`jnl`	Constructing Arrangement Optimally in Parallel. Discret. Comput. Geom. Michael T. Goodrich
1993	J	`jnl`	Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1993	—	`conf`	Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. SCG Michael T. Goodrich, Roberto Tamassia
1993	—	`conf`	Experimental Evidence for the Power of Random Samplings in Practical Parallel Algorithms. IPPS Mujtaba R. Ghouse, Michael T. Goodrich
1993	A*	`conf`	External-Memory Computational Geometry (Preliminary Version) FOCS Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff, Jeffrey Scott Vitter
1993	—	`conf`	Geometric Partitioning Made Easier, Even in Parallel. SCG Michael T. Goodrich
1993	—	`conf`	Geometric Pattern Matching Under Euclidean Motion. CCCG L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1993	J	`jnl`	Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
1993	J	`jnl`	P-complete geometric problems. Int. J. Comput. Geom. Appl. Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
1993	J	`jnl`	Parallel algorithms column 1: models of computation. SIGACT News Michael T. Goodrich
1993	B	`conf`	Point Probe Decision Trees for Geometric Concept Classes. WADS Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
1992	J	`jnl`	A polygonal approach to hidden-line and hidden-surface elimination. CVGIP Graph. Model. Image Process. Michael T. Goodrich
1992	J	`jnl`	Constructing the Convex Hull of a Partially Sorted Set of Points. Comput. Geom. Michael T. Goodrich
1992	J	`jnl`	Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica Richard Cole, Michael T. Goodrich
1992	J	`jnl`	Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons. Algorithmica Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
1992	A*	`conf`	Planar Separators and Parallel Polygon Triangulation (Preliminary Version) STOC Michael T. Goodrich
1991	J	`jnl`	A localized method for intersecting plane algebraic curve segments. Vis. Comput. John K. Johnstone, Michael T. Goodrich
1991	B	`conf`	Constructing Arrangements Optimally in Parallel (Preliminary Version). SPAA Michael T. Goodrich
1991	A*	`conf`	Dynamic Trees and Dynamic Point Location (Preliminary Version) STOC Michael T. Goodrich, Roberto Tamassia
1991	B	`conf`	In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version). SPAA Mujtaba R. Ghouse, Michael T. Goodrich
1991	J	`jnl`	Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors. SIAM J. Comput. Michael T. Goodrich
1991	A*	`conf`	Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version) FOCS Michael T. Goodrich
1990	A*	`conf`	An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). ICALP Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
1990	A*	`conf`	Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. SODA Michael T. Goodrich
1990	B	`conf`	Generalized Sweep Methods for Parallel Computational Geometry. SPAA Michael T. Goodrich, Mujtaba R. Ghouse, J. Bright
1990	A*	`conf`	Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1990	J	`jnl`	On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. J. Parallel Distributed Comput. Michael T. Goodrich, Mikhail J. Atallah
1990	B	`conf`	P-Complete Geometric Problems. SPAA Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
1990	—	`conf`	Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version). SCG Michael T. Goodrich, Steven B. Shauck, Sumanta Guha
1990	J	`jnl`	Stabbing Parallel Segments with a Convex Polygon. Comput. Vis. Graph. Image Process. Michael T. Goodrich, Jack Snoeyink
1989	J	`jnl`	Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
1989	B	`conf`	Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1989	B	`conf`	Intersecting Line Segments in Parallel With an Output-Sensitive Number of Processors. SPAA Michael T. Goodrich
1989	A*	`conf`	Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) FOCS Michael T. Goodrich, S. Rao Kosaraju
1989	B	`conf`	Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). WADS Michael T. Goodrich, Jack Snoeyink
1989	J	`jnl`	Triangulating a Polygon in Parallel. J. Algorithms Michael T. Goodrich
1988	—	`conf`	Optimal Parallel Algorithms for Polygon and Point-Set Problems. SCG Richard Cole, Michael T. Goodrich
1988	—	`conf`	Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
1988	J	`jnl`	Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica Mikhail J. Atallah, Michael T. Goodrich
1987	A*	`conf`	Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms FOCS Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
1987	—	`—`	Efficient parallel techniques for computational geometry Michael T. Goodrich
1987	J	`jnl`	Finding the Convex Hull of a Sorted Point Set in Parallel. Inf. Process. Lett. Michael T. Goodrich
1986	J	`jnl`	Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distributed Comput. Mikhail J. Atallah, Michael T. Goodrich
1986	—	`conf`	Efficient Plane Sweeping in Parallel. SCG Mikhail J. Atallah, Michael T. Goodrich
1985	B	`conf`	Efficient Parallel Solutions to Geometric Problems. ICPP Mikhail J. Atallah, Michael T. Goodrich