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
Posted Content
Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data
TL;DR: In this paper, Du and Atallah give efficient data-oblivious algorithms for several fundamental geometric problems that are relevant to geographic information systems, including planar convex hulls and all-nearest neighbors.
Journal ArticleDOI
Parallel algorithms for shortest path problems in polygons
TL;DR: In this paper, a divide-and-conquer algorithm for finding the shortest path between two points and each vertex of a simple polygon is presented. But the algorithm requires O(log 2 n) time and O(n) processors.
Book ChapterDOI
Three-Dimensional Layers of Maxima
TL;DR: An O(n log n)-time algorithm to solve the three-dimensional layers-of-maxima problem is presented, an improvement over the prior O( n log n log log n-time solution.
Proceedings ArticleDOI
J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode
TL;DR: It is shown through experiments involving test cases provided by DARPA that the canonical drawing paradigm used in J-Viz is effective for identifying potential security vulnerabilities for algorithmic complexity attacks.
Book ChapterDOI
Biased Skip Lists
TL;DR: This work designs a variation of skip lists that performs well for generally biased access sequences and presents deterministic and randomized variations, which are nearly identical.