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
Dynamic Perfect Hashing: Upper and Lower Bounds
Martin Dietzfelbinger,Anna R. Karlin,Kurt Mehlhorn,Friedhelm Meyer auf der Heide,Hans Rohnert,Robert E. Tarjan +5 more
TL;DR: Lower bounds for the time complexity of a class of deterministic algorithms for the dictionary problem are proved and this class encompasses realistic hashing-based schemes that use linear space.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Computing an st-numbering
Shimon Even,Robert E. Tarjan +1 more
TL;DR: This paper provides a linear-time algorithm for computing an st-numbering for any biconnected graph and can be combined with some new results by Booth and Lueker to provide alinear-time implementation of the Lempel-Even-Cederbaum planarity-testing algorithm.
Journal ArticleDOI
A Separator Theorem for Graphs of Bounded Genus
TL;DR: The main result of this paper is that if the authors can draw a graph on a surface of genus g, then they can bisect it by removing $O(\sqrt{gn})$ vertices, best possible to within a constant factor.
Journal ArticleDOI
Fast Algorithms for Solving Path Problems
TL;DR: A method to compute path expressions by dividing G into components, computing path expressions on the components by Gaussian elimination, and combining the solutions is described, which requires O(m $\alpha$(m,n) time on a reducible flow graph.