World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
72
Citations
16428
World Ranking
1713
National Ranking
871

Research.com Recognitions

  • 2009 - ACM Fellow For contributions to data structures and algorithms for combinatorial and geometric problems.
  • 2009 - IEEE Fellow For contributions to parallel and distributed algorithms for combinatorial and geometric problems
  • 2007 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 2006 - ACM Distinguished Member

Overview

Michael T. Goodrich is affiliated with the University of California, Irvine in the United States. Their research contributions are primarily within the field of Computer Science, with a focus on areas such as Artificial Intelligence, Computer Networks and Communications, and Computational Theory and Mathematics.

The scientist has published extensively, with over one hundred research papers. Frequent publication venues include arXiv (Cornell University), Information Processing Letters, and the Proceedings of the ACM on Management of Data, among others.

Recent papers authored by or involving Michael T. Goodrich include:

  • Modeling the small-world phenomenon with road networks, 2022, Proceedings of the 30th International Conference on Advances in Geographic Information Systems
  • Veil: A Storage and Communication Efficient Volume-Hiding Algorithm, 2023, Proceedings of the ACM on Management of Data
  • Secure and Accurate Summation of Many Floating-Point Numbers, 2023, Proceedings on Privacy Enhancing Technologies
  • Reconstructing Biological and Digital Phylogenetic Trees in Parallel, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • A competitive analysis for the Start-Gap algorithm for online memory wear leveling, 2020, Information Processing Letters

Michael T. Goodrich frequently collaborates with other researchers. Some of their most common coauthors are Ofek Gila, David Eppstein, Ryuto Kitagawa, Evrim Ozel, and Vinesh Sridhar.

The scientist's research covers several specialized topics within computer science, including:

  • Algorithms and Data Compression
  • Computational Geometry and Mesh Generation
  • Advanced Data Storage Technologies
  • Data Management and Algorithms
  • Advanced Graph Theory Research
  • Cryptography and Data Security
  • Caching and Content Delivery

Key subfields represented in their work include Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, and Molecular Biology.

Michael T. Goodrich has been recognized with multiple awards, including:

  • ACM Fellow (2009) for contributions to data structures and algorithms for combinatorial and geometric problems
  • IEEE Fellow (2009) for contributions to parallel and distributed algorithms for combinatorial and geometric problems
  • Fellow of the American Association for the Advancement of Science (AAAS) (2007)
  • ACM Distinguished Member (2006)

Best Publications

  • Data Structures and Algorithms in Java

    Michael T. Goodrich;Roberto Tamassia

  • Almost optimal set covers in finite VC-dimension

    H. Brönnimann;M. T. Goodrich

  • External-memory graph algorithms

    Yi-Jen Chiang;Michael T. Goodrich;Edward F. Grove;Roberto Tamassia

  • Cascading Divide-and-conquer: A Technique for Designing Parallel Algorithms

    Mikhail J. Atallah;Richard Cole;Michael T. Goodrich

  • Loud and Clear: Human-Verifiable Authentication Based on Audio

    M.T. Goodrich;M. Sirivianos;J. Solis;G. Tsudik

  • External-memory computational geometry

    M.T. Goodrich;Jyh-Jong Tsay;D.E. Vengroff;J.S. Vitter

  • Privacy-preserving access of outsourced data via oblivious RAM simulation

    Michael T. Goodrich;Michael Mitzenmacher

  • Privacy-preserving group data access via stateless oblivious RAM simulation

    Michael T. Goodrich;Michael Mitzenmacher;Olga Ohrimenko;Roberto Tamassia

  • Algorithm Design: Foundations, Analysis, and Internet Examples

    Michael T. Goodrich;Roberto Tamassia

  • Efficient packet marking for large-scale IP traceback

    Michael T. Goodrich

  • Sorting, searching, and simulation in the mapreduce framework

    Michael T. Goodrich;Nodari Sitchinava;Qin Zhang

  • Efficient tree-based revocation in groups of low-state devices

    Michael T. Goodrich;Jonathan Z. Sun;Roberto Tamassia

  • Implementation of an authenticated dictionary with skip lists and commutative hashing

    M.T. Goodrich;R. Tamassia;A. Schwerin

  • Invertible bloom lookup tables

    Michael T. Goodrich;Michael Mitzenmacher

  • Geometric pattern matching under Euclidean motion

    L. Paul Chew;Michael T. Goodrich;Daniel P. Huttenlocher;Klara Kedem

  • Communication-Efficient Parallel Sorting

    Michael T. Goodrich

  • A multi-dimensional approach to force-directed layouts of large graphs

    Pawel Gajer;Michael T. Goodrich;Stephen G. Kobourov

  • Oblivious RAM simulation with efficient worst-case access overhead

    Michael T. Goodrich;Michael Mitzenmacher;Olga Ohrimenko;Roberto Tamassia

  • Probabilistic packet marking for large-scale IP traceback

    Michael T. Goodrich

  • Persistent Authenticated Dictionaries and Their Applications

    Aris Anagnostopoulos;Michael T. Goodrich;Roberto Tamassia

  • External-Memory Computational Geometry (Preliminary Version)

    Michael T. Goodrich;Jyh-Jong Tsay;Darren Erik Vengroff;Jeffrey Scott Vitter

  • External-Memory Graph Algorithms

    Yi-Feng Chian;Michael T. Goodrich;Edward Grove;Roberto Tamassia

Frequent Co-Authors

David Eppstein
David Eppstein University of California, Irvine
Roberto Tamassia
Roberto Tamassia Brown University
Stephen G. Kobourov
Stephen G. Kobourov University of Arizona
Michael Mitzenmacher
Michael Mitzenmacher Harvard University
Mikhail J. Atallah
Mikhail J. Atallah Purdue University West Lafayette
Nancy M. Amato
Nancy M. Amato University of Illinois at Urbana-Champaign
Jeffrey Scott Vitter
Jeffrey Scott Vitter University of Mississippi
Richard Cole
Richard Cole New York University
Lars Arge
Lars Arge Aarhus University
Jack Snoeyink
Jack Snoeyink University of North Carolina at Chapel Hill

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related online degree programs and exciting career pathways. Many students consider not only core computer science, but also broader fields like environmental science, engineering, and accelerated programs.

For those interested in diverse applications of their skills, you may wonder, what can I do with an environmental science degree? The fusion of technology and environmental study can lead to innovative careers addressing today’s critical challenges.

If flexibility and speed are priorities, consider a 2-year computer science degree online. These accelerated programs allow you to build technical skills and start your career sooner, often from the comfort of your home.

Engineering fields are also highly accessible online. Those passionate about sustainability might be interested in environmental engineering online degree options. Alternatively, online mechanical engineering degrees offer another pathway to a versatile and rewarding profession.

Each of these programs provides a unique combination of flexibility, affordability, and career potential, making them excellent complements to computer science studies.

Best Scientists Citing Michael T. Goodrich

Trending Scientists

Recently Published Articles