Michael T. Goodrich

University of California, Irvine — United States

Computer Science · Physical Sciences

57h-index11.7kcitations544works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(219), Data Management and Algorithms(96), Algorithms and Data Compression(92), Cryptography and Data Security(68), Complexity and Algorithms in Graphs(62)

Publications544 total

Circle Quasi-Cartograms: Dorling Cartograms with Edge Connections and Relaxed Overlap Conditions
2025Open Access
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
arXiv (Cornell University)·2025Open Access
The Rectilinear Marco Polo Problem
arXiv (Cornell University)·2025Open Access
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
arXiv (Cornell University)·2025Open Access
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
arXiv (Cornell University)·2025Open Access
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
ACM SIGMOD Record·2025
The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
arXiv (Cornell University)·2025Open Access
Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
arXiv (Cornell University)·2025Open Access
Fast Geographic Routing in Fixed-Growth Graphs
arXiv (Cornell University)·2025Open Access
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture
Information Processing Letters·2025· 1 citedOpen Access
Exact Learning of Weighted Graphs Using Composite Queries
Lecture notes in computer science·2025Open Access
Zip-Tries: Simple Dynamic Data Structures for Strings
Society for Industrial and Applied Mathematics eBooks·2025Open Access
Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Lecture notes in computer science·2025
Fast Geographic Routing in Fixed-Growth Graphs
Lecture notes in computer science·2025
Computational Geometry with Probabilistically Noisy Primitive Operations
arXiv (Cornell University)·2025Open Access
Dynamic Accountable Storage: An Efficient Protocol for Real-Time Cloud Storage Auditing
Lecture notes in computer science·2025
Parallel Joinable B-Trees in the Fork-Join I/O Model
arXiv (Cornell University)·2025Open Access
Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
arXiv (Cornell University)·2024Open Access
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
arXiv (Cornell University)·2024Open Access
Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
arXiv (Cornell University)·2024Open Access
page 1 of 28Next →

Frequent Co-authors

Roberto Tamassia(18), David Eppstein(8), Michael Mitzenmacher(5), Mikhail J. Atallah(4), Olga Ohrimenko(4), Stephen Kobourov(4), Darren Erik Vengroff(3), Jeffrey Scott Vitter(3), Edward F. Grove(2), Nodari Sitchinava(2), J. Z. Sun(2), Paweł Gajer(2), Frank Uyeda(2), George Varghese(2), Matthew T. Dickerson(2), Hervé Brönnimann(1), Yi‐Jen Chiang(1), Michael Sirivianos(1), John Solis(1), Gene Tsudik(1)