2026 Robert E. Tarjan: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	122	136	131	80	77	400	95082

Research.com Recognitions

2026 - Research.com Computer Science in United States Leader Award
2025 - Research.com Computer Science in United States Leader Award
2023 - Research.com Computer Science in United States Leader Award
2022 - Research.com Computer Science in United States Leader Award
2009 - SIAM Fellow For the design and analysis of algorithms.
2003 - Member of the European Academy of Sciences
1999 - ACM Paris Kanellakis Theory and Practice Award Splay Tree Data Structure
1994 - ACM Fellow For fundamental achievements in the design and analysis of algorithms and data structures.
1990 - Fellow of the American Association for the Advancement of Science (AAAS)
1988 - Member of the National Academy of Engineering For fundamental achievements in the design and analysis of data structures and computer algorithms.
1987 - Member of the National Academy of Sciences
1986 - A. M. Turing Award For fundamental achievements in the design and analysis of algorithms and data structures.
1985 - Fellow of the American Academy of Arts and Sciences
1982 - Rolf Nevanlinna Prize "Received the first Nevanlinna Prize for outstanding contributions to mathematical aspects of information science. "Pure mathematics enjoys the luxury of studying its constructions, whether finite or infinite, in complete independence of all questions of efficiency." explained Jacob Schwartz, who spoke on Tarjan's work. "By contrast, theoretical computer science must ultimately concern itself with computing engines which operate with limited speed and data storage, and therefore must take efficiency as one of its central concerns. Two closely related activities, algorithm design and algorithm analysis, grow out of this inevitable concern."[8]
1978 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

Robert E. Tarjan is affiliated with Princeton University in the United States and conducts research primarily in the field of Computer Science. Their work spans various subfields including Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Hardware and Architecture, and Software.

The scientist's research topics cover several domains such as Algorithms and Data Compression, Complexity and Algorithms in Graphs, Network Packet Processing and Optimization, Optimization and Search Problems, Software Testing and Debugging Techniques, Distributed Systems and Fault Tolerance, and Optimization and Packing Problems.

Recent publications by Robert E. Tarjan include:

Finding strong components using depth-first search (2023, European Journal of Combinatorics)
Zip Trees (2021, ACM Transactions on Algorithms)
Analysis of Smooth Heaps and Slim Heaps (2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))
Connected Components on a PRAM in Log Diameter Time (2020, arXiv (Cornell University))
Simple Concurrent Connected Components Algorithms (2022, ACM Transactions on Parallel Computing)

Frequent coauthors include:

Uri Zwick
Corwin Sinnamon
Bernhard Haeupler
Richard Hladík
Václav Rozhoň

Common venues for publishing their research are:

arXiv (Cornell University)
ACM Transactions on Algorithms
European Journal of Combinatorics
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Parallel Computing

Over the course of their career, Robert E. Tarjan has been recognized with several awards. These include the 1982 Rolf Nevanlinna Prize for contributions to the mathematical aspects of information science, the 1986 A. M. Turing Award for fundamental achievements in the design and analysis of algorithms and data structures, and the 1999 ACM Paris Kanellakis Theory and Practice Award for work related to the Splay Tree Data Structure.

Other distinctions include being named a SIAM Fellow in 2009 for contributions to algorithm design and analysis, a Fellow of the American Association for the Advancement of Science in 1990, a Fellow of the American Academy of Arts and Sciences in 1985, a Fellow of the John Simon Guggenheim Memorial Foundation in 1978, as well as membership in the National Academy of Engineering since 1988 and the National Academy of Sciences since 1987. Robert E. Tarjan has also been recognized as an ACM Fellow since 1994 and a member of the European Academy of Sciences since 2003.

Best Publications

Depth-First Search and Linear Graph Algorithms

Robert Endre Tarjan

9543
Citations
Fibonacci heaps and their uses in improved network optimization algorithms

Michael L. Fredman;Robert Endre Tarjan

4470
Citations
A new approach to the maximum-flow problem

Andrew V. Goldberg;Robert E. Tarjan

3721
Citations
Data Structures and Network Algorithms

Robert Endre Tarjan

3246
Citations
Amortized efficiency of list update and paging rules

Daniel D. Sleator;Robert E. Tarjan

3060
Citations
Efficiency of a Good But Not Linear Set Union Algorithm

Robert Endre Tarjan

1884
Citations
A Separator Theorem for Planar Graphs

Richard J. Lipton;Robert Endre Tarjan

1879
Citations
Self-adjusting binary search trees

Daniel Dominic Sleator;Robert Endre Tarjan

1877
Citations
The Recognition of Series Parallel Digraphs

Jacobo Valdes;Robert Endre Tarjan;Eugene L. Lawler

1804
Citations
Time bounds for selection

Manuel Blum;Robert W. Floyd;Vaughan Pratt;Ronald L. Rivest

1793
Citations
Efficient Planarity Testing

John Hopcroft;Robert Tarjan

1734
Citations
Three partition refinement algorithms

Robert Paige;Robert E. Tarjan

1697
Citations
A data structure for dynamic trees

Daniel D. Sleator;Robert Endre Tarjan

1648
Citations
Fast algorithms for finding nearest common ancestors

Dov Harel;Robert Endre Tarjan

1480
Citations
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

Robert E. Tarjan;Mihalis Yannakakis

1476
Citations
Algorithm 447: efficient algorithms for graph manipulation

John Hopcroft;Robert Tarjan

1476
Citations
Algorithmic Aspects of Vertex Elimination on Graphs

Unknown

1360
Citations
A linear-time algorithm for testing the truth of certain quantified boolean formulas☆

Bengt Aspvall;Michael F. Plass;Robert Endre Tarjan

1287
Citations
Applications of a Planar Separator Theorem

Richard J. Lipton;Robert Endre Tarjan

1162
Citations
A linear-time algorithm for a special case of disjoint set union

Harold N. Gabow;Robert Endre Tarjan

1150
Citations
Dividing a Graph into Triconnected Components

John E. Hopcroft;Robert Endre Tarjan

1150
Citations

Frequent Co-Authors

Haim Kaplan Tel Aviv University

Daniel D. Sleator Carnegie Mellon University

Harold N. Gabow University of Colorado Boulder

Andrew V. Goldberg Amazon (United States)

Renato F. Werneck Microsoft (United States)

John E. Hopcroft Cornell University

Kurt Mehlhorn Max Planck Institute for Informatics

Michael Randolph Garey Nokia (United States)

Uri Zwick Tel Aviv University

Thomas Lengauer Max Planck Institute for Informatics

External Links

Wikipedia of Robert E. Tarjan Personal website of Robert E. Tarjan Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees can open up diverse career pathways beyond traditional computer science roles. Many professionals choose to expand their skillsets or switch fields entirely by pursuing specialized degrees online. For example, individuals interested in leadership can consider an online executive MBA, a valuable credential for advancing into tech management or entrepreneurial roles.

Another unique option is the mlis degree, which blends information science with digital resource management—skills increasingly valuable in our data-driven economy. For those balancing cost and flexibility, there are numerous affordable graduate school choices online, helping you advance your education without overwhelming financial strain.

Ambitious professionals looking to lead innovation and change may also pursue the cheapest online doctorate in organizational leadership, paving the way for top executive or academic careers. Exploring these related online degree paths can significantly expand your options within and beyond computer science.