Michael Goodrich

Employment

• University of California Irvine Distinguished Professor
  2001 - Present
• Johns Hopkins University Professor
  1987 - 2001

Education

• Purdue University Computer Sciences
  1983 - 1987
• Calvin College Math and Computer Science
  1979 - 1983

Projects & Funding

Projects & funding information is unavailable.

Publications (490)

• Simple Low-Overhead Communication-Efficient String Reconciliation and Edit Distance
  2027 DOI: 10.1007/978-3-032-42866-0_11
  +Save
• Visualizing Treewidth
  Journal of Graph Algorithms and Applications 2026 DOI: 10.7155/jgaa.v30i2.3273
  +Save
• The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically
  2026 DOI: 10.1145/3816782.3819205
  +Save
• Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
  Algorithmica 2026 DOI: 10.1007/s00453-025-01364-2
  +Save
• History-Independent Dynamic Partitioning with Applications to B-Trees, Skip Lists and Fusion Trees
  ACM Transactions on Database Systems 2026 DOI: 10.1145/3810240
  +Save
• Sublinear Work Parallel Quantum Algorithms for Computational Geometry
  2026 DOI: 10.1007/978-3-032-17801-5_17
  +Save
• Circle Quasi-Cartograms: Dorling Cartograms with Edge Connections and Relaxed Overlap Conditions
  2025 DOI: 10.1145/3764917.3771335
  +Save
• SGV: Spatial Graph Visualization
  2025 DOI: 10.1145/3748636.3762772
  +Save
• A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture
  Information Processing Letters 2025 DOI: 10.1016/j.ipl.2025.106558
  +Save
• Leveraging parameterized Chernoff bounds for simplified algorithm analyses
  Information Processing Letters 2025 DOI: 10.1016/j.ipl.2024.106516
  +Save
• Computational Geometry with Probabilistically Noisy Primitive Operations
  CoRR 2025 DOI: 10.48550/ARXIV.2501.07707
  +Save
• Dynamic Accountable Storage: An Efficient Protocol for Real-Time Cloud Storage Auditing
  2025 DOI: 10.1007/978-3-031-94677-6_3
  +Save
• Exact Learning of Weighted Graphs Using Composite Queries
  2025 DOI: 10.1007/978-3-031-98740-3_8
  +Save
• Fast Geographic Routing in Fixed-Growth Graphs
  CoRR 2025 DOI: 10.48550/ARXIV.2502.03663
  +Save
• Fast Geographic Routing in Fixed-Growth Graphs
  2025 DOI: 10.1007/978-3-031-92935-9_10
  +Save
• Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
  SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedi… 2025 DOI: 10.1007/978-3-031-82697-9\_6
  +Save
• Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
  LIPIcs, Volume 332, SoCG 2025 2025 DOI: 10.4230/LIPICS.SOCG.2025.51
  +Save
• Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
  LIPIcs, Volume 349, WADS 2025 2025 DOI: 10.4230/LIPICS.WADS.2025.14
  +Save
• History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
  Proceedings of the ACM on Management of Data 2024 DOI: 10.1145/3651609
  +Save
• Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
  32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria 2024 DOI: 10.4230/LIPICS.GD.2024.39
  +Save