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
Variations of a pebble game on graphs
John R. Gilbert,Robert E. Tarjan +1 more
TL;DR: The black-white pebble game of Cook and Sethi was shown to require as many pebbles in the worst case as the normal game, to within a constant factor as mentioned in this paper.
Journal ArticleDOI
Thin heaps, thick heaps
Haim Kaplan,Robert E. Tarjan +1 more
TL;DR: Three heap implementations are described (two versions of thin heaps and one of thick heaps) that have the same amortized efficiency as Fibonacci heaps, but need less space and promise better practical performance.
Journal ArticleDOI
Linear expected-time algorithms for connectivity problems
Richard M. Karp,Robert E. Tarjan +1 more
TL;DR: Algorithms that run in O(n) average time on n-vertex graphs are developed for finding connected components, strong components, and blocks using the random graph model of Erdos and Renyi.
Journal ArticleDOI
Amortized analysis of algorithms for set union with backtracking
TL;DR: It is proven that any separable pointer-based algorithm for the deunion problem required omega(log n/log log n) time per operation, thus showing that the upper bound an amortized time is tight.