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
Recent Developments in the Complexity of Combinatorial Algorithms
TL;DR: This paper surveys results and suggests directions for future research in the area of combinatorial algorithms, including improved algorithms for matrix multiplication and maximum network flow, a polynomial-time algorithm for linear programming, and steps toward a poynomial- time algorithm for graph isomorphism.
Book ChapterDOI
Splaying Preorders and Postorders
TL;DR: It is demonstrated that preorders and postorders of balanced search trees do not contain many large "jumps" in symmetric order, and the dynamic finger theorem is exploited, providing further evidence in favor of the elusive "dynamic optimality conjecture".
Patent
Allocation of resources for tiers of a multi-tiered system based on selecting items from respective sets
TL;DR: In this paper, the authors defined a set of items corresponding to plural tiers of a multi-tiered system, where the items represent amounts of resources to allocate to the tiers.
Posted Content
Hollow Heaps
TL;DR: The hollow heap is introduced, a very simple data structure with the same amortized efficiency as the classical Fibonacci heap, using a dag (directed acyclic graph) instead of a tree or set of trees to represent a heap.
Journal ArticleDOI
Amortized rotation cost in AVL trees
TL;DR: In this paper, the authors show a class of AVL trees that allow such expensive operations and show that mixed insertions and deletions can cause? (n log n ) rotations.