Robert Tarjan

Robert Tarjan

Princeton University

H-index: 119

North America-United States

About Robert Tarjan

Robert Tarjan, With an exceptional h-index of 119 and a recent h-index of 63 (since 2020), a distinguished researcher at Princeton University, specializes in the field of data structures, graph algorithms, analysis of algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

Fast and Simple Sorting Using Partial Information

Minimum-cost paths for electric cars

Digital rights management systems and methods using efficient messaging schemes

A nearly-tight analysis of multipass pairing heaps

Finding strong components using depth-first search

Optimal resizable arrays

Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent

Efficiency of Self-Adjusting Heaps

Robert Tarjan Information

University

Princeton University

Position

Professor of Computer Science

Citations(all)

93629

Citations(since 2020)

15587

Cited By

83378

hIndex(all)

119

hIndex(since 2020)

63

i10Index(all)

310

i10Index(since 2020)

171

Email

University Profile Page

Princeton University

Robert Tarjan Skills & Research Interests

data structures

graph algorithms

analysis of algorithms

Top articles of Robert Tarjan

Title

Journal

Author(s)

Publication Date

Fast and Simple Sorting Using Partial Information

arXiv preprint arXiv:2404.04552

Bernhard Haeupler

Richard Hladík

John Iacono

Vaclav Rozhon

Robert Tarjan

...

2024/4/6

Minimum-cost paths for electric cars

Dani Dorfman

Haim Kaplan

Robert E Tarjan

Mikkel Thorup

Uri Zwick

2024

Digital rights management systems and methods using efficient messaging schemes

2023/11/16

A nearly-tight analysis of multipass pairing heaps

Corwin Sinnamon

Robert E Tarjan

2023

Finding strong components using depth-first search

European Journal of Combinatorics

Robert E Tarjan

Uri Zwick

2023/10/19

Optimal resizable arrays

Robert E Tarjan

Uri Zwick

2023

Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent

Ofek Gila

Michael T Goodrich

Robert E Tarjan

2023/7/28

Efficiency of Self-Adjusting Heaps

arXiv preprint arXiv:2307.02772

Corwin Sinnamon

Robert E Tarjan

2023/7/6

Optimal energetic paths for electric cars

arXiv preprint arXiv:2305.19015

Dani Dorfman

Haim Kaplan

Robert E Tarjan

Uri Zwick

2023/5/30

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps

arXiv preprint arXiv:2311.11793

Bernhard Haeupler

Richard Hladík

Václav Rozhoň

Robert Tarjan

Jakub Tětek

2023/11/20

A tight analysis of slim heaps and smooth heaps

Corwin Sinnamon

Robert E Tarjan

2023

A Simpler Proof that Pairing Heaps Take O (1) Amortized Time per Insertion

arXiv preprint arXiv:2208.11791

Corwin Sinnamon

Robert Tarjan

2022/8/24

Content management systems and methods using proxy reencryption

2022/9/29

Polyhedron Coloring

ML Fredman

RE Tarjan

2022/3/15

Simple Concurrent Connected Components Algorithms

ACM Transactions on Parallel Computing

S. Cliff Liu

Robert Endre Tarjan

2022/9/1

Simulating a stack using queues

Haim Kaplan

Robert E Tarjan

Or Zamir

Uri Zwick

2022

Analysis of smooth heaps and slim heaps

arXiv preprint arXiv:2107.04919

Maria Hartmann

László Kozma

Corwin Sinnamon

Robert E Tarjan

2021/7/10

Concurrent disjoint set union

Distributed Computing

Siddhartha V Jayanti

Robert E Tarjan

2021/12

An auction algorithm for bipartite matching in streaming and massively parallel computation models

Sepehr Assadi

S Cliff Liu

Robert E Tarjan

2021

Zip trees

ACM Transactions on Algorithms (TALG)

Robert E Tarjan

Caleb Levy

Stephen Timmel

2021/10/4

See List of Professors in Robert Tarjan University(Princeton University)

Robert Tarjan FAQs

What is Robert Tarjan's h-index at Princeton University?

The h-index of Robert Tarjan has been 63 since 2020 and 119 in total.

What are Robert Tarjan's top articles?

The articles with the titles of

Fast and Simple Sorting Using Partial Information

Minimum-cost paths for electric cars

Digital rights management systems and methods using efficient messaging schemes

A nearly-tight analysis of multipass pairing heaps

Finding strong components using depth-first search

Optimal resizable arrays

Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent

Efficiency of Self-Adjusting Heaps

...

are the top articles of Robert Tarjan at Princeton University.

What are Robert Tarjan's research interests?

The research interests of Robert Tarjan are: data structures, graph algorithms, analysis of algorithms

What is Robert Tarjan's total number of citations?

Robert Tarjan has 93,629 citations in total.

What are the co-authors of Robert Tarjan?

The co-authors of Robert Tarjan are Mihalis Yannakakis, James B. Orlin, Loukas Georgiadis.

Co-Authors

H-index: 94
Mihalis Yannakakis

Mihalis Yannakakis

Columbia University in the City of New York

H-index: 68
James B. Orlin

James B. Orlin

Massachusetts Institute of Technology

H-index: 20
Loukas Georgiadis

Loukas Georgiadis

University of Ioannina

academic-engine