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
Book ChapterDOI
Tracking moving objects with few handovers
TL;DR: In this article, the authors studied the online problem of assigning a moving point to a base station region that contains it, and the goal is to minimize the number of handovers that occur when the point moves outside its assigned region and must be assigned to a new one.
Posted ContentDOI
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
TL;DR: It is shown that a querier can efficiently reconstruct an n-node degree-d tree, T, with a logarithmic number of rounds and quasilinear number of queries, with high probability, for various types of queries; including relative-distance queries and path queries.
Output-Sensitive Hidden Surface Elimination for Rectangles
TL;DR: An algorithm for the well-known hidden-surface elimination problem for rectangles, which is also known as the window rendering problem, is presented and is asymptotically faster than previous ones.
Patent
Notarized federated identity management
TL;DR: In this article, the authors present a federated identity management system that can support efficient user authentication when providers are unknown to each other and/or for avoiding direct communication between identity providers and service providers, which provides improved privacy protection for users.
Book ChapterDOI
Minimum-Width Drawings of Phylogenetic Trees
TL;DR: It is shown that finding a minimum-width orthogonal upward drawing of a phylogenetic tree is NP-hard for binary trees with unconstrained combinatorial order and an algorithm is provided to provide a linear-time algorithm for ordered trees.