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
Journal ArticleDOI
Planar point location using persistent search trees
Neil Sarnak,Robert E. Tarjan +1 more
TL;DR: This work develops a persistent form of binary search tree that supports insertions and deletions in the present and queries in the past, and provides an alternative to Chazelle's "hive graph" structure, which has a variety of applications in geometric retrieval.
Journal ArticleDOI
Amortized Computational Complexity
TL;DR: This paper surveys recent work by several researchers on amortized complexity and obtains “self-adjusting” data structures that are simple, flexible and efficient.
Journal ArticleDOI
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
TL;DR: This work analyzes several “level-oriented” algorithms for packing rectangles into a unit-width, infinite-height bin and gives more refined bounds for special cases in which the widths of the given rectangles are restricted and in which only squares are to be packed.
Book
An Efficient Parallel Biconnectivity Algorithm
Robert E. Tarjan,Uzi Vishkin +1 more
TL;DR: A new algorithm for finding the blocks (biconnected components) of an undirected graph and a general algorithmic technique that simplifies and improves computation of various functions on trees is introduced.
Journal ArticleDOI
Finding a maximum independent set
TL;DR: An algorithm is presented which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time and can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.