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
Order Statistics and Other Complex Data Operations On Tree-Structured Dictionary Machines
TL;DR: This work considers how to perform multi-selections, sorting, and operations based on the ranks of data, including ExtractU), which simultaneously selects and deletes the J"·th smallest data item.
Proceedings ArticleDOI
New applications of nearest-neighbor chains: Euclidean TSP and motorcycle graphs
Nil Mamano,Alon Efrat,David Eppstein,Daniel Frishberg,Michael T. Goodrich,Stephen G. Kobourov,Pedro Matias,Valentin Polishchuk +7 more
TL;DR: New applications of the nearest-neighbor chain algorithm are shown, a technique that originated in agglomerative hierarchical clustering that is used to construct the greedy multi-fragment tour for Euclidean TSP and for Steiner TSP in planar graphs in O(n √ n log n) time.
Journal ArticleDOI
Simplified Chernoff bounds with powers-of-two probabilities
TL;DR: In this article , simplified Chernoff bounds with powers-of-two probabilities were derived and used in analyzing probabilistic algorithms, and their use was shown to be useful in the analysis of stochastic algorithms.
Posted Content
On the Optical Accuracy of the Salvator Mundi.
TL;DR: Alternative theories regarding the composition of the orb, such as that it was a solid calcite ball, provide empirical evidence that such alternatives are unlikely to produce images similar to the painting, and that the orb is instead hollow.