World's Best Scientists 2026 revealed!
Award Badge
Computer Science
USA
2026

D-Index & Metrics

Computer Science

D-Index
122
Citations
95082
World Ranking
136
National Ranking
80

Robert E. Tarjan publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Robert E. Tarjan sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 400 publications — 87th percentile

87% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Robert E. Tarjan D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Robert E. Tarjan sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 122 D-Index — 99th percentile

99% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

  • Fibonacci heaps and their uses in improved network optimization algorithms

    Michael L. Fredman;Robert Endre Tarjan

  • A new approach to the maximum-flow problem

    Andrew V. Goldberg;Robert E. Tarjan

  • Data Structures and Network Algorithms

    Robert Endre Tarjan

  • Amortized efficiency of list update and paging rules

    Daniel D. Sleator;Robert E. Tarjan

  • Efficiency of a Good But Not Linear Set Union Algorithm

    Robert Endre Tarjan

  • A Separator Theorem for Planar Graphs

    Richard J. Lipton;Robert Endre Tarjan

  • Self-adjusting binary search trees

    Daniel Dominic Sleator;Robert Endre Tarjan

  • The Recognition of Series Parallel Digraphs

    Jacobo Valdes;Robert Endre Tarjan;Eugene L. Lawler

  • Time bounds for selection

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

  • Efficient Planarity Testing

    John Hopcroft;Robert Tarjan

  • Three partition refinement algorithms

    Robert Paige;Robert E. Tarjan

  • A data structure for dynamic trees

    Daniel D. Sleator;Robert Endre Tarjan

  • Fast algorithms for finding nearest common ancestors

    Dov Harel;Robert Endre Tarjan

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

    Robert E. Tarjan;Mihalis Yannakakis

  • Algorithm 447: efficient algorithms for graph manipulation

    John Hopcroft;Robert Tarjan

  • Algorithmic Aspects of Vertex Elimination on Graphs

    Unknown

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

    Bengt Aspvall;Michael F. Plass;Robert Endre Tarjan

  • Applications of a Planar Separator Theorem

    Richard J. Lipton;Robert Endre Tarjan

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

    Harold N. Gabow;Robert Endre Tarjan

  • Dividing a Graph into Triconnected Components

    John E. Hopcroft;Robert Endre Tarjan

Frequent Co-Authors

Haim Kaplan
Haim Kaplan Tel Aviv University
Daniel D. Sleator
Daniel D. Sleator Carnegie Mellon University
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Renato F. Werneck
Renato F. Werneck Microsoft (United States)
John E. Hopcroft
John E. Hopcroft Cornell University
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Uri Zwick
Uri Zwick Tel Aviv University
Michael Randolph Garey
Michael Randolph Garey Nokia (United States)
George Polya
George Polya Stanford University

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Robert E. Tarjan

Trending Scientists

Recently Published Articles