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
Update and Paging Rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum as long as the access cost is a convex function, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off- line paging rule by a factor that depends on the size of fast memory.
Posted Content
A Note on Fault Tolerant Reachability for Directed Graphs
TL;DR: An application of low-high orders in fault-tolerant network design and an algorithm to compute a minimum-size valid set in O(m) time, where n = |V| and m = |A| is described.
Posted Content
Splaying Preorders and Postorders
Caleb Levy,Robert E. Tarjan +1 more
TL;DR: In this paper, the authors proved that preorders and postorders are pattern-avoiding, i.e. they contain no subsequences that are order-isomorphic to $(2,3,1) and $(3, 1,2), respectively.
Journal ArticleDOI
Simple Concurrent Connected Components Algorithms
Sixue Liu,Robert E. Tarjan +1 more
TL;DR: A class of simple algorithms for concurrently computing the connected components of an n-vertex, m-edge graph shows that even a basic problem like connected components still has secrets to reveal.
Journal Article
Finding Strong Components Using Depth-First Search
Robert E. Tarjan,Uri Zwick +1 more
TL;DR: Three algorithms that use depth-first search to find the strong components of a directed graph in linear time are surveyed: Tarjan’s algorithm; a cycle- finding algorithm; and a bidirectional search algorithm.