R
Robert E. Tarjan
Researcher at Princeton University
Publications - 408
Citations - 70538
Robert E. Tarjan is an academic researcher from Princeton University. The author has contributed to research in topics: Time complexity & Spanning tree. The author has an hindex of 114, co-authored 400 publications receiving 67305 citations. Previous affiliations of Robert E. Tarjan include AT&T & Massachusetts Institute of Technology.
Papers
More filters
Proceedings ArticleDOI
Reference machines require non-linear time to maintain disjoint sets
TL;DR: A machine model intended to be useful in deriving realistic complexity bounds for tasks requiring list processing is described, showing that any such machine requires non-linear time in the worst case to compute unions of disjoint sets on-line.
Proceedings ArticleDOI
Dynamic rectangular intersection with priorities
TL;DR: This work presents efficient data structures to maintain dynamic set of rectangles, each with priority assigned to it, such that it can efficiently find the rectangle of maximum priority containing a query point.
Journal ArticleDOI
Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations
TL;DR: A simple linear-time algorithm that solves all three recognition problems and is previously used in general planarity testing, called a pile of twin stacks is described.
Proceedings ArticleDOI
Fully persistent lists with catenation
TL;DR: In this paper, the authors consider the problem of represmrtirrg stacks with catenation so that any stack, old or new, is available for access or update operations.
Book
More efficient bottom-up multi-pattern matching in trees
TL;DR: This work offers asymptotic improvements in both time and space to Chase's bottom-up algorithm for pattern preprocessing and shows how to modify the algorithm using a new decomposition method to obtain a space/time tradeoff.