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
Rotation distance, triangulations, and hyperbolic geometry
Daniel D. Sleator,Daniel D. Sleator,Daniel D. Sleator,Robert E. Tarjan,William P. Thurston,William P. Thurston,William P. Thurston +6 more
TL;DR: In this paper, the authors established a tight bound of In 6 on the maximum rotation distance between two A2-node trees for all large n, using volumetric arguments in hyperbolic 3-space.
Efficient algorithms for graph manipulation
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths.
Proceedings ArticleDOI
Dynamic perfect hashing: upper and lower bounds
Martin Dietzfelbinger,Anna R. Karlin,Kurt Mehlhorn,F.M. auf der Heide,Hans Rohnert,Robert E. Tarjan +5 more
TL;DR: In this article, a randomized algorithm with O(1) worst-case time for lookup and O( 1) amortized expected time for insertion and deletion was given for the dictionary problem.
Journal ArticleDOI
One-processor scheduling with symmetric earliness and tardiness penalties
TL;DR: It is shown that the problem of finding minimum cost schedules is NP-complete; however, an efficient algorithm is given that finds minimum cost scheduling whenever the tasks either all have the same length or are required to be executed in a given fixed sequence.
Journal ArticleDOI
Rectilinear planar layouts and bipolar orientations of planar graphs
TL;DR: This work proposes a linear-time algorithm, a variant of one by Otten and van Wijk, that generally produces a more compact layout than theirs and allows the dual of the graph to be laid out in an interlocking way.