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
Book ChapterDOI
Rank-Balanced Trees
TL;DR: It is shown that both bottom-up and top-down rebalancing modify nodes exponentially infrequently in their heights, so the rank-balanced tree is introduced, a relaxation of AVL trees.
ReportDOI
Efficiency of the network simplex algorithm for the maximum flow problem
TL;DR: This paper describes how to implement the network simplex algorithm to run in O(nm log n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan.
Journal ArticleDOI
Parallelism in multigrid methods: how much is too much?
TL;DR: An elliptic model problem on simple domains, discretized with finite difference techniques on block-structured meshes in two or three dimensions with up to 106 or 109 points, is studied and performance is analyzed using three models of parallel computation: the PRAM and two bridging models.
Journal ArticleDOI
Erratum: an O ( n log log n )-time algorithm for triangulating a simple polygon
Proceedings Article
Shortest path feasibility algorithms: an experimental evaluation
TL;DR: This is an experimental study of algorithms for the shortest-path feasibility problem: Given a directed weighted graph, find a negative cycle or present a short proof that none exists.