Robert E. Tarjan

64 papers A* 10A 1B 4Journal 41Unranked 7

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