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
Two linear-time algorithms for five-coloring a planar graph
TL;DR: This paper uses graph contraction arguments instead of bicolor interchange and improves both the sequential processing and batch processing methods to obtain five-coloring algorithms that operate in O(n) time.
Journal ArticleDOI
Rank-Pairing Heaps
TL;DR: The rank-pairing heap is introduced, an implementation of heaps that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps.
Proceedings ArticleDOI
Upper and lower bounds on time-space tradeoffs
Thomas Lengauer,Robert E. Tarjan +1 more
TL;DR: Asymptotically tight bounds on the time-space tradeoffs for pebbling three different classes of directed acyclic graphs are derived.
Proceedings ArticleDOI
Amortized efficiency of list update rules
TL;DR: The amortized complexity of two well-known algorithms used in system software, the "move-to-front" rule for maintaining an unsorted linear list representing a set, and the "least-recently-used" replacement rule for reducing page faults in a two-level paged memory are studied.
Book ChapterDOI
Complexity of monotone networks for computing conjunctions
TL;DR: This class of examples shows that an algorithm given in [STAN-CS-75-512] for computing functions defined on paths in trees is optimum to within a constant factor.