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
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion
Corwin Sinnamon,Robert E. Tarjan +1 more
TL;DR: This analysis uses the natural representation of pairing heaps instead of the conversion to a binary tree used in the original analysis and in Iacono’s, to reduce the amortized time per insertion to O(1) and that of meld to zero while preserving the O(log n ) amortization time bound for the other update operations.
Book ChapterDOI
A Nearly-Tight Analysis of Multipass Pairing Heaps
Corwin Sinnamon,Robert E. Tarjan +1 more
Proceedings ArticleDOI
Optimal resizable arrays
Robert E. Tarjan,Uri Zwick +1 more
TL;DR: Brodnik et al. as discussed by the authors show that for any data structure from a wide class of data structures that uses only $N+O(N^{1-1/r})$ space to store the array, the amortized cost of grow is O(1)$ worst-case time, even if only grow and access operations are allowed.
Journal ArticleDOI
Optimal energetic paths for electric cars
TL;DR: In this paper , the authors show that the single-source minimum energetic paths problem can be solved using simple, but subtle, adaptations of the Bellman-Ford and Dijkstra algorithms.