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
Proceedings ArticleDOI
Fixed-dimensional parallel linear programming via relative e-approximations
TL;DR: It is shown that linear programming in IRd can be solved deterministically in O(logn(loglogn)d-l) time using linear work in the PRAM model of computation, for any fixed constant d.
Journal ArticleDOI
Balanced aspect ratio trees and their use for drawing large graphs
TL;DR: A new approach for cluster-based drawing of large graphs, which obtains clusters by using binary space partition (BSP) trees and a novel BSP-type decomposition, called the balanced aspect ratio (BAR) tree, which guarantees that the cells produced are convex and have bounded aspect ratios.
Proceedings ArticleDOI
Teaching the analysis of algorithms with visual proofs
TL;DR: An approach for visually teaching important proofs in the Junior-Senior level course on the design and analysis of data structures and algorithms (CS7/DS&A) by using pictures that visualize proofs so clearly that the pictures can qualify as proofs themselves.
Journal ArticleDOI
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
TL;DR: Galoois theory is used to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials, and that such solutions cannot be computed exactly even in extended computational models that include such operations.
Constructing disjoint paths for secure communication
TL;DR: It is proved that a malicious adversary which attacks the algorithm during the process of construction of a k-system cannot learn anything more than if it had attacked the k- system once it was built.