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
Patent
Method for discovery of clusters of objects in an arbitrary undirected graph using a difference between a fraction of internal connections and maximum fraction of connections by an outside object
TL;DR: In this paper, a method for discovery of a cluster of objects in an arbitrary undirected graph is presented, where a subset of objects is determined by performing a random walk starting from a first object of the objects and following a plurality of random edges of subsequent objects, the subset comprising the first object and subsequent objects.
Posted Content
Amortized Rotation Cost in AVL Trees
TL;DR: It is shown that, for infinitely many AVL trees, there is a set of set of trees with the property that, given any tree in E, deleting a certain leaf and then reinserting it produces a tree in $E, with the deletion having done $\Theta(\log n)$ rotations.
Journal ArticleDOI
An interview with the 1986 A. M. Turing Award recipients—John E. Hopcroft and Robert E. Tarjan
TL;DR: In the following interview, John Hopcroft and Robert Tarjan discuss their collaboration and its influence on their separate research today and comment on supercomputing and parallelism.
Patent
Generating a Shape Graph for a Routing Table
Siyu Yang,Zhiyong Shen,Peng Xie,Tang Yong,Ping Luo,Junqing Xie,Linpeng Tang,Mihalis Yannakakis,Robert E. Tarjan,David C. Lee +9 more
TL;DR: In this paper, a system and method for generating shape graphs for a routing table is described. The method includes splitting a binary trie representing the routing table of a router into a number of layers.
Posted Content
Data Structures for Mergeable Trees
TL;DR: This work considers a novel variant of the problem of efficiently maintaining a forest of dynamic rooted trees that includes an operation that merges two tree paths, and develops three different methods that need only polylogarithmic time per operation.