Robert E. Tarjan

Publication Activity (10 Years)

Years Active: 1975-2024
Publications (10 Years): 45

Top Topics

Connected Components

Parallel Computation

Top Venues

ACM Trans. Algorithms

Publications

Siddhartha Jayanti, Robert E. Tarjan
Fast, Scalable, and Machine-Verified Multicore Disjoint Set Union Data Structures and their Wide Deployment in Parallel Algorithms (Abstract). HOPC@SPAA (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. SOSA (2024)
Robert E. Tarjan, Uri Zwick
Finding strong components using depth-first search. Eur. J. Comb. 119 (2024)
Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Fast and Simple Sorting Using Partial Information. CoRR (2024)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Mikkel Thorup, Uri Zwick
Minimum-cost paths for electric cars. CoRR (2024)
Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR (2023)
Corwin Sinnamon, Robert E. Tarjan
A Tight Analysis of Slim Heaps and Smooth Heaps. SODA (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal Energetic Paths for Electric Cars. ESA (2023)
Ofek Gila, Michael T. Goodrich, Robert E. Tarjan
Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. CoRR (2023)
Corwin Sinnamon, Robert E. Tarjan
Efficiency of Self-Adjusting Heaps. CoRR (2023)
Ofek Gila, Michael T. Goodrich, Robert E. Tarjan
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. WADS (2023)
Robert E. Tarjan, Uri Zwick
Optimal resizable arrays. SOSA (2023)
Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Optimal energetic paths for electric cars. CoRR (2023)
Corwin Sinnamon, Robert E. Tarjan
A Nearly-Tight Analysis of Multipass Pairing Heaps. SODA (2023)
Corwin Sinnamon, Robert E. Tarjan
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion. CoRR (2022)
Haim Kaplan, Robert E. Tarjan, Or Zamir, Uri Zwick
Simulating a stack using queues. SODA (2022)
Robert E. Tarjan, Uri Zwick
Finding Strong Components Using Depth-First Search. CoRR (2022)
Robert E. Tarjan, Uri Zwick
Optimal resizable arrays. CoRR (2022)
Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. SOSA (2021)
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
Analysis of Smooth Heaps and Slim Heaps. CoRR (2021)
Maria Hartmann, László Kozma, Corwin Sinnamon, Robert E. Tarjan
Analysis of Smooth Heaps and Slim Heaps. ICALP (2021)
Siddhartha V. Jayanti, Robert E. Tarjan
Concurrent disjoint set union. Distributed Comput. 34 (6) (2021)
Corwin Sinnamon, Robert E. Tarjan
A Tight Analysis of Slim Heaps and Smooth Heaps. CoRR (2021)
Robert E. Tarjan, Caleb C. Levy, Stephen Timmel
Zip Trees. ACM Trans. Algorithms 17 (4) (2021)
S. Cliff Liu, Robert E. Tarjan, Peilin Zhong
Connected Components on a PRAM in Log Diameter Time. CoRR (2020)
Sixue Cliff Liu, Robert E. Tarjan, Peilin Zhong
Connected Components on a PRAM in Log Diameter Time. SPAA (2020)
Siddhartha V. Jayanti, Robert E. Tarjan
Concurrent Disjoint Set Union. CoRR (2020)
Caleb C. Levy, Robert E. Tarjan
New Paths from Splay to Dynamic Optimality. CoRR (2019)
Siddhartha V. Jayanti, Robert E. Tarjan, Enric Boix-Adserà
Randomized Concurrent Set Union and Generalized Wake-Up. PODC (2019)
Caleb C. Levy, Robert E. Tarjan
A New Path from Splay to Dynamic Optimality. SODA (2019)
Caleb C. Levy, Robert E. Tarjan
Splaying Preorders and Postorders. WADS (2019)
Caleb C. Levy, Robert E. Tarjan
Splaying Preorders and Postorders. CoRR (2019)
Sixue Liu, Robert E. Tarjan
Simple Concurrent Labeling Algorithms for Connected Components. SOSA (2019)
Robert E. Tarjan, Caleb C. Levy, Stephen Timmel
Zip Trees. WADS (2019)
Sixue Liu, Robert E. Tarjan
Simple Concurrent Labeling Algorithms for Connected Components. CoRR (2018)
Robert E. Tarjan, Caleb C. Levy
Zip Trees. CoRR (2018)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. ACM Trans. Algorithms 13 (3) (2017)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan
Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. 61 (4) (2017)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert E. Tarjan
A New Approach to Incremental Cycle Detection and Related Problems. ACM Trans. Algorithms 12 (2) (2016)
Siddhartha V. Jayanti, Robert E. Tarjan
A Randomized Concurrent Algorithm for Disjoint Set Union. CoRR (2016)
Siddhartha Sen, Robert E. Tarjan, David Hong Kyun Kim
Deletion Without Rebalancing in Binary Search Trees. ACM Trans. Algorithms 12 (4) (2016)
Siddhartha V. Jayanti, Robert E. Tarjan
A Randomized Concurrent Algorithm for Disjoint Set Union. PODC (2016)
Loukas Georgiadis, Robert E. Tarjan
Addendum to "Dominator Tree Certification and Divergent Spanning Trees". ACM Trans. Algorithms 12 (4) (2016)
Mahdi Amani, Kevin A. Lai, Robert E. Tarjan
Amortized rotation cost in AVL trees. Inf. Process. Lett. 116 (5) (2016)
Loukas Georgiadis, Robert E. Tarjan
Dominator Tree Certification and Divergent Spanning Trees. ACM Trans. Algorithms 12 (1) (2016)
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick
Hollow Heaps. CoRR (2015)
Loukas Georgiadis, Robert E. Tarjan
A Note on Fault Tolerant Reachability for Directed Graphs. CoRR (2015)
Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant
An Algorithmic View of the Universe. ACM-TURING (2012)
Robert E. Tarjan
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem. Math. Oper. Res. 16 (2) (1991)
Andrew V. Goldberg, Robert E. Tarjan
Finding Minimum-Cost Circulations by Successive Approximation. Math. Oper. Res. 15 (3) (1990)
Michael R. Garey, Robert E. Tarjan, Gordon T. Wilfong
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties. Math. Oper. Res. 13 (2) (1988)
James Roskind, Robert E. Tarjan
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees. Math. Oper. Res. 10 (4) (1985)
Joan Feigenbaum, Robert E. Tarjan
Two new kinds of biased search trees. Bell Syst. Tech. J. 62 (10) (1983)
Ronald C. Read, Robert E. Tarjan
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees. Networks 5 (3) (1975)