M
Michael T. Goodrich
Researcher at University of California, Irvine
Publications - 445
Citations - 14652
Michael T. Goodrich is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 61, co-authored 430 publications receiving 14045 citations. Previous affiliations of Michael T. Goodrich include New York University & Technion – Israel Institute of Technology.
Papers
More filters
Journal ArticleDOI
Almost optimal set covers in finite VC-dimension
TL;DR: A deterministic polynomial-time method for finding a set cover in a set system (X, ℛ) of dual VC-dimensiond such that the size of the authors' cover is at most a factor ofO(d log(dc)) from the optimal size,c.
Book
Data Structures and Algorithms in Java
TL;DR: This book incorporates the object-oriented design paradigm, using Java as the implementation language while also providing the fundamental intuition and analysis of each data structure studied.
External-Memory Graph Algorithms
Yi-Feng Chian,Michael T. Goodrich,Edward Grove,Roberto Tamassia,Darren Erik Vengroff,Jeffrey Scott Vitter +5 more
Proceedings ArticleDOI
External-memory graph algorithms
Yi-Jen Chiang,Michael T. Goodrich,Edward F. Grove,Roberto Tamassia,Darren Erik Vengroff,Jeffrey Scott Vitter +5 more
TL;DR: A collection of new techniques for designing and analyzing external-memory algorithms for graph problems and illustrating how these techniques can be applied to a wide variety of speci c problems are presented.
Book ChapterDOI
Privacy-preserving access of outsourced data via oblivious RAM simulation
TL;DR: This work describes schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithsmic amortized increase in access times, with a very high probability of success, while keeping the external storage to be of size O(n).