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
Proceedings ArticleDOI
Better approximation algorithms for the graph diameter
Shiri Chechik,Daniel H. Larkin,Liam Roditty,Grant Schoenebeck,Robert E. Tarjan,Virginia Vassilevska Williams +5 more
TL;DR: Two algorithms are deterministic, and thus the first deterministic (2 -- e)-approximation algorithm for the diameter that takes subquadratic time in sparse graphs is presented.
Proceedings ArticleDOI
Models of parallel computation: a survey and synthesis
TL;DR: A broad range of models of parallel computation and the different roles they serve in algorithm, language and machine design are presented to better understand which model characteristics are important to each design community, in order to elucidate the requirements of a unifying paradigm.
Journal ArticleDOI
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
TL;DR: In this paper, the authors present a simple implementation with O(logn) per tree operation, wheren is the number of tree vertices, where n is the size of the network.
Journal ArticleDOI
Asymptotically tight bounds on time-space trade-offs in a pebble game
Thomas Lengauer,Robert E. Tarjan +1 more
TL;DR: A tune-space trade-off of the form T -$2 2°~N/s) Is proved for the class of all directed acychc graphs, which holds whether the authors use only black or black and white pebbles.
Journal ArticleDOI
A Fast Merging Algorithm
Mark R. Brown,Robert E. Tarjan +1 more
TL;DR: An algorithm which merges sorted lists represented as balanced binary trees if the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order on all comparison-based algorithms for this problem.