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
HP Transforms Product Portfolio Management with Operations Research
Julie Ward,Bin Zhang,Shailendra K. Jain,Chris Fry,Thomas Olavson,Holger Mishal,Jason Amaral,Dirk Beyer,Ann Brecht,Brian Cargille,Russ Chadinha,Kathy Chou,Gavin DeNyse,Qi Feng,Cookie Padovani,Sesh Raj,Kurt Sunderbruch,Robert E. Tarjan,Krishna Venkatraman,Joseph Woods,Jing Zhou +20 more
TL;DR: Hewlett-Packard's breadth of product offering has helped the company achieve unparalleled market reach; however, it has co-ordinated efforts to improve the quality of its products and services.
Book ChapterDOI
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
TL;DR: It is shown that Excesses IBFS has the best overall practical performance on real-world instances, while maintaining the same polynomial running time guarantee of O(mn2) as IBFS, which it generalizes.
Journal ArticleDOI
Time-space trade-offs in a pebble game
TL;DR: It is shown that there exists a family of directed acyclic graphs Gn and constants c1, c2, c3 such that each graph Gn has n nodes and each node in Gn has indegree at most 2.
Proceedings ArticleDOI
Confluently persistent deques via data structuaral bootstrapping
TL;DR: This work introduces data-structural bootstrapping, a technique to design data structures recursively, and uses it to design confluently persistent deques, which allows a purely functional implementation, with no side effects.
Proceedings ArticleDOI
Unique maximum matching algorithms
TL;DR: This paper considers the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case, and proves a generalization of K&zig’s the+ rem characterizing unique f-factors in terms of bridges.