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 ContentDOI
Planar and Poly-Arc Lombardi Drawings
TL;DR: This work gives an example of a planar 3-tree that has no planar Lombardi drawing and shows that all outerpaths do have a planars Lombardi Drawing, and generalizes the notion of Lombardi drawings to that of (smooth) $k-Lombardi drawings, in which each edge may be drawn as a (differentiable) sequence of circular arcs.
Biased Finger Trees and Three-Dimensional Layers of Maxima
TL;DR: Ramaiyert et al. as discussed by the authors presented a method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the hee being changed).
Book ChapterDOI
Cache-Oblivious dictionaries and multimaps with negligible failure probability
TL;DR: This work designs hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with minimal space overhead and sub-polynomial probability that the data structure will require a rehash operation.
Posted Content
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
TL;DR: Wear-leveling techniques for cuckoo hashing are studied, showing that it is possible to achieve a memory wear bound of loglogn + O(1) after the insertion of n items into a table of size Cn for a suitable constant C using cuckoos hashing.
Book ChapterDOI
Confluent layered drawings
TL;DR: This work combines the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings, so that it is easier to understand the structures of graphs from the mixed style drawings.