Robert Endre Tarjan

ORCID

Publication Activity (10 Years)

Years Active: 1971-2022
Publications (10 Years): 1

Top Venues

CoRR

ESA

J. Discrete Algorithms

SODA

Publications

Sixue Cliff Liu, Robert Endre Tarjan
Simple Concurrent Connected Components Algorithms. ACM Trans. Parallel Comput. 9 (2) (2022)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Rank-Balanced Trees. ACM Trans. Algorithms 11 (4) (2015)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA (2015)
Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Hollow Heaps. ICALP (1) (2015)
Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan
Minimum Cost Flows in Graphs with Unit Capacities. STACS (2015)
Mahdi Amani, Kevin A. Lai, Robert Endre Tarjan
Amortized Rotation Cost in AVL Trees. CoRR (2015)
Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan
A Back-to-Basics Empirical Study of Priority Queues. ALENEX (2014)
Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. 27 (6) (2014)
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20]. J. Discrete Algorithms 26 (2014)
Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan
A Back-to-Basics Empirical Study of Priority Queues. CoRR (2014)
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
Loop Nesting Forests, Dominators, and Applications. SEA (2014)
Siddhartha Sen, Robert Endre Tarjan
Deletion without rebalancing in multiway search trees. ACM Trans. Database Syst. 39 (1) (2014)
Andrew V. Goldberg, Robert Endre Tarjan
Efficient maximum flow algorithms. Commun. ACM 57 (8) (2014)
Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Fibonacci Heaps Revisited. CoRR (2014)
Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan
Disjoint Set Union with Randomized Linking. SODA (2014)
Daniel H. Larkin, Robert Endre Tarjan
Nested Set Union. ESA (2014)
Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
Better Approximation Algorithms for the Graph Diameter. SODA (2014)
Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, Robert Endre Tarjan
Dominator Certification and Independent Spanning Trees: An Experimental Study. SEA (2013)
Haim Kaplan, Robert Endre Tarjan, Uri Zwick
Soft Heaps Simplified. SIAM J. Comput. 42 (4) (2013)
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
Finding Dominators via Disjoint Set Union. CoRR (2013)
Wojciech Fraczak, Loukas Georgiadis, Andrew Miller, Robert Endre Tarjan
Finding dominators via disjoint set union. J. Discrete Algorithms 23 (2013)
Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan
CBTree: A Practical Concurrent Self-Adjusting Search Tree. DISC (2012)
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Molad, Robert Endre Tarjan, Ke Yi
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. SIAM J. Comput. 41 (1) (2012)
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms 8 (1) (2012)
Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan
Strict fibonacci heaps. STOC (2012)
Lyle Ramshaw, Robert Endre Tarjan
A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs. FOCS (2012)
Loukas Georgiadis, Robert Endre Tarjan
Dominator Tree Certification and Independent Spanning Trees CoRR (2012)
Loukas Georgiadis, Robert Endre Tarjan
Dominators, Directed Bipolar Orders, and Independent Spanning Trees. ICALP (1) (2012)
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data structures for mergeable trees. ACM Trans. Algorithms 7 (2) (2011)
Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
Maximum Flows by Incremental Breadth-First Search. ESA (2011)
Robert Endre Tarjan
Theory vs. Practice in the Design and Analysis of Algorithms. WADS (2011)
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance CoRR (2011)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Rank-Pairing Heaps. SIAM J. Comput. 40 (6) (2011)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan
A New Approach to Incremental Cycle Detection and Related Problems CoRR (2011)
Julie Ward, Bin Zhang, Shailendra Jain, Chris Fry, Thomas Olavson, Holger Mishal, Jason Amaral, Dirk Beyer, Ann Brecht, Brian Cargille, Russ Chadinha, Kathy Chou, Gavin DeNyse, Qi Feng, Cookie Padovani, Sesh Raj, Kurt Sunderbruch, Robert Endre Tarjan, Krishna Venkatraman, Joseph Woods, Jing Zhou
HP Transforms Product Portfolio Management with Operations Research. Interfaces 40 (1) (2010)
Siddhartha Sen, Robert Endre Tarjan
Deletion Without Rebalancing in Balanced Binary Trees. SODA (2010)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Rank-Balanced Trees. WADS (2009)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics 14 (2009)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Dynamic trees in practice. ACM J. Exp. Algorithmics 14 (2009)
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan
Efficiently Generating k-Best Solutions to Procurement Auctions. AAIM (2009)
Siddhartha Sen, Robert Endre Tarjan
Deletion without Rebalancing in Multiway Search Trees. ISAAC (2009)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Heaps Simplified CoRR (2009)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Rank-Pairing Heaps. ESA (2009)
Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX (2009)
Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan
Fast exact and heuristic methods for role minimization problems. SACMAT (2008)
Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan
Incremental Topological Ordering and Strong Component Maintenance CoRR (2008)
Bernhard Haeupler, Robert Endre Tarjan
Planarity Algorithms via PQ-Trees (Extended Abstract). Electron. Notes Discret. Math. 31 (2008)
Robert Endre Tarjan
Reachability Problems on Directed Graphs. ISAAC (2008)
Bernhard Haeupler, Robert Endre Tarjan
Finding a feasible flow in a strongly connected network. Oper. Res. Lett. 36 (4) (2008)
Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38 (4) (2008)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX (2008)
Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan
Finding Strongly Knit Clusters in Social Networks. Internet Math. 5 (1) (2008)
Haim Kaplan, Robert Endre Tarjan
Thin heaps, thick heaps. ACM Trans. Algorithms 4 (1) (2008)
Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan
Faster Algorithms for Incremental Topological Ordering. ICALP (1) (2008)
Bernhard Haeupler, Robert Endre Tarjan
Finding a Feasible Flow in a Strongly Connected Network CoRR (2007)
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou
Server Allocation Algorithms for Tiered Systems. Algorithmica 48 (2) (2007)
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert Endre Tarjan, Renato Fonseca F. Werneck
Data Structures for Mergeable Trees CoRR (2007)
Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan
Clustering Social Networks. WAW (2007)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Dynamic Trees in Practice. WEA (2007)
Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA (2007)
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
Finding Dominators in Practice. J. Graph Algorithms Appl. 10 (1) (2006)
Robert Endre Tarjan
Results and Problems on Self-adjusting Search Trees and Related Data Structures. SWAT (2006)
Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao
Balancing Applied to Maximum Network Flow Problems. ESA (2006)
Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
Design of data structures for mergeable trees. SODA (2006)
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
Melding priority queues. ACM Trans. Algorithms 2 (4) (2006)
Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou
Deadline scheduling for animation rendering. SIGMETRICS (2005)
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou
Server Allocation Algorithms for Tiered Systems. COCOON (2005)
Loukas Georgiadis, Robert Endre Tarjan
Dominator tree verification and vertex-disjoint paths. SODA (2005)
Robert Endre Tarjan, Renato Fonseca F. Werneck
Self-adjusting top trees. SODA (2005)
Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou
Value-maximizing deadline scheduling and its application to animation rendering. SPAA (2005)
Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
Finding Dominators in Practice. ESA (2004)
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick
Melding Priority Queues. SWAT (2004)
Loukas Georgiadis, Robert Endre Tarjan
Finding dominators revisited: extended abstract. SODA (2004)
Haim Kaplan, Eyal Molad, Robert Endre Tarjan
Dynamic rectangular intersection with priorities. STOC (2003)
Gary William Flake, Robert Endre Tarjan, Kostas Tsioutsiouliklis
Graph Clustering and Minimum Cut Trees. Internet Math. 1 (4) (2003)
Neal E. Young, Robert Endre Tarjan, James B. Orlin
Faster Parametric Shortest Path and Minimum Balance Algorithms CoRR (2002)
Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Meldable heaps and boolean union-find. STOC (2002)
Haim Kaplan, Nira Shafrir, Robert Endre Tarjan
Union-find with deletions. SODA (2002)
Bill G. Horne, Lesley R. Matheson, Casey Sheehan, Robert Endre Tarjan
Dynamic Self-Checking Techniques for Improved Tamper Resistance. Digital Rights Management Workshop (2001)
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
Unique Maximum Matching Algorithms. J. Algorithms 40 (2) (2001)
Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis
Faster kinetic heaps and their use in broadcast scheduling. SODA (2001)
Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
Simple Confluently Persistent Catenable Lists. SIAM J. Comput. 30 (3) (2000)
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan
Unique Maximum Matching Algorithms. STOC (1999)
Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29 (1) (1999)
Haim Kaplan, Ron Shamir, Robert Endre Tarjan
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM J. Comput. 29 (3) (1999)
Haim Kaplan, Ron Shamir, Robert Endre Tarjan
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. SIAM J. Comput. 28 (5) (1999)
Haim Kaplan, Chris Okasaki, Robert Endre Tarjan
Simple Confluently Persistent Catenable Lists (Extended Abstract). SWAT (1998)
Lesley R. Matheson, Talal Shamoon, Robert Endre Tarjan
Culturally-Induced Information Impactedness: A Prescription for Failure in Software Ventures. HICSS (6) (1998)
Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane
Robustness and Security of Digital Watermarks. Financial Cryptography (1998)
Lesley R. Matheson, Robert Endre Tarjan
Culturally Induced Information Impactedness: A Prescription for Failure in Software Ventures. J. Manag. Inf. Syst. 15 (2) (1998)
Brandon Dixon, Robert Endre Tarjan
Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Algorithmica 17 (1) (1997)
Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan
Toward Efficient Unstructured Multigrid Preprocessing. Int. J. High Perform. Comput. Appl. 11 (1) (1997)
Haim Kaplan, Ron Shamir, Robert Endre Tarjan
Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SODA (1997)
Haim Kaplan, Ron Shamir, Robert Endre Tarjan
Faster and simpler algorithm for sorting signed permutations by reversals. RECOMB (1997)
Robert Endre Tarjan
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Program. 77 (1997)
Richard Cole, Philip N. Klein, Robert Endre Tarjan
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA (1996)
Susan E. Dorward, Lesley R. Matheson, Robert Endre Tarjan
Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract). IRREGULAR (1996)
Lesley R. Matheson, Robert Endre Tarjan
Dominating Sets in Planar Graphs. Eur. J. Comb. 17 (6) (1996)
Lesley R. Matheson, Robert Endre Tarjan
Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications. J. Parallel Distributed Comput. 33 (1) (1996)
Lesley R. Matheson, Robert Endre Tarjan
Parallelism in multigrid methods: How much is too much? Int. J. Parallel Program. 24 (5) (1996)

Robert Endre Tarjan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Robert Endre Tarjan