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
Finding Strongly Knit Clusters in Social Networks
TL;DR: This paper introduces a new criterion that overcomes limitations by combining internal density with external sparsity in a natural way, and explores combinatorial properties of internally dense and externally sparse clusters.
Journal ArticleDOI
A fast las vegas algorithm for triangulating a simple polygon
TL;DR: A randomized algorithm that triangulates a simple polygon onn vertices inO(n log*n) expected time is presented; the bound holds for any input polygon.
Journal ArticleDOI
Strongly connected orientations of mixed multigraphs
TL;DR: It is proved that, if a mixed multigraph of radius r has any strongly connected orientation, it must have an orientation of radius at most 42 + Ar, and the proof gives a polynomial-time algorithm for constructing such an orientation.
Proceedings ArticleDOI
Self-adjusting top trees
TL;DR: This work shows how topology trees and top trees can be combined to produce a data structure that is as generic as any other, very easy to adapt, and as practical as ST-trees.
Journal ArticleDOI
Tight Analyses of Two Local Load Balancing Algorithms
Bhaskar Ghosh,Frank Thomson Leighton,Bruce M. Maggs,S. Muthukrishnan,C. Greg Plaxton,C. Greg Plaxton,Rajmohan Rajaraman,Rajmohan Rajaraman,Andréa W. Richa,Robert E. Tarjan,David Zuckerman,David Zuckerman +11 more
TL;DR: The analysis of the following load balancing algorithm, which examines the number of tokens at each of its neighbors and sends a token to each neighbor with at least 2d+1 fewer tokens, is extended to a variant of this algorithm for dynamic and asynchronous networks.