Robert Endre Tarjan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
89
Venues
19
Active years
1971–2015
Best venue rank
A*
Where they publish
Papers
89 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2015 | ESA | Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck |
| 2015 | ICALP | Hollow Heaps. | Thomas Dueholm Hansen, Haim Kaplan, Robert Endre Tarjan, Uri Zwick |
| 2015 | STACS | Minimum Cost Flows in Graphs with Unit Capacities. | Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan |
| 2014 | ALENEX | A Back-to-Basics Empirical Study of Priority Queues. | Daniel H. Larkin, Siddhartha Sen, Robert Endre Tarjan |
| 2014 | ESA | Nested Set Union. | Daniel H. Larkin, Robert Endre Tarjan |
| 2014 | SODA | Better Approximation Algorithms for the Graph Diameter. | Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams |
| 2014 | SODA | Disjoint Set Union with Randomized Linking. | Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan |
| 2012 | FOCS | A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs. | Lyle Ramshaw, Robert Endre Tarjan |
| 2012 | ICALP | Dominators, Directed Bipolar Orders, and Independent Spanning Trees. | Loukas Georgiadis, Robert Endre Tarjan |
| 2012 | STOC | Strict fibonacci heaps. | Gerth Stlting Brodal, George Lagogiannis, Robert Endre Tarjan |
| 2011 | ESA | Maximum Flows by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2011 | WADS | Theory vs. Practice in the Design and Analysis of Algorithms. | Robert Endre Tarjan |
| 2010 | SODA | Deletion Without Rebalancing in Balanced Binary Trees. | Siddhartha Sen, Robert Endre Tarjan |
| 2009 | AAIM | Efficiently Generating k-Best Solutions to Procurement Auctions. | Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan |
| 2009 | ALENEX | An Experimental Study of Minimum Mean Cycle Algorithms. | Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2009 | ESA | Rank-Pairing Heaps. | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
| 2009 | ISAAC | Deletion without Rebalancing in Multiway Search Trees. | Siddhartha Sen, Robert Endre Tarjan |
| 2009 | WADS | Rank-Balanced Trees. | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
| 2008 | ALENEX | Shortest Path Feasibility Algorithms: An Experimental Evaluation. | Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2008 | ICALP | Faster Algorithms for Incremental Topological Ordering. | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |
| 2008 | ISAAC | Reachability Problems on Directed Graphs. | Robert Endre Tarjan |
| 2008 | SACMAT | Fast exact and heuristic methods for role minimization problems. | Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan |
| 2007 | WAW | Clustering Social Networks. | Nina Mishra, Robert Schreiber, Isabelle Stanton, Robert Endre Tarjan |
| 2006 | ESA | Balancing Applied to Maximum Network Flow Problems. | Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao |
| 2006 | SODA | Design of data structures for mergeable trees. | Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2005 | COCOON | Server Allocation Algorithms for Tiered Systems. | Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou |
| 2005 | SODA | Dominator tree verification and vertex-disjoint paths. | Loukas Georgiadis, Robert Endre Tarjan |
| 2005 | SODA | Self-adjusting top trees. | Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2005 | SIGMETRICS | Deadline scheduling for animation rendering. | Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou |
| 2005 | SPAA | Value-maximizing deadline scheduling and its application to animation rendering. | Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou |
| 2004 | ESA | Finding Dominators in Practice. | Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August |
| 2004 | SODA | Finding dominators revisited: extended abstract. | Loukas Georgiadis, Robert Endre Tarjan |
| 2003 | STOC | Dynamic rectangular intersection with priorities. | Haim Kaplan, Eyal Molad, Robert Endre Tarjan |
| 2002 | SODA | Union-find with deletions. | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
| 2002 | STOC | Meldable heaps and boolean union-find. | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
| 2001 | CCS | Dynamic Self-Checking Techniques for Improved Tamper Resistance. | Bill G. Horne, Lesley R. Matheson, Casey Sheehan, Robert Endre Tarjan |
| 2001 | SODA | Faster kinetic heaps and their use in broadcast scheduling. | Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsiouliklis |
| 1999 | STOC | Unique Maximum Matching Algorithms. | Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan |
| 1998 | FC | Robustness and Security of Digital Watermarks. | Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane |
| 1997 | RECOMB | Faster and simpler algorithm for sorting signed permutations by reversals. | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1997 | SODA | Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1996 | STOC | Purely Functional Representations of Catenable Sorted Lists. | Haim Kaplan, Robert Endre Tarjan |
| 1996 | SPAA | Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. | Richard Cole, Philip N. Klein, Robert Endre Tarjan |
| 1995 | STOC | Tight analyses of two local load balancing algorithms. | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andra W. Richa, Robert Endre Tarjan, David Zuckerman |
| 1995 | STOC | Persistent lists with catenation via recursive slow-down. | Haim Kaplan, Robert Endre Tarjan |
| 1994 | FOCS | Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1994 | STOC | A randomized linear-time algorithm for finding minimum spanning trees. | Philip N. Klein, Robert Endre Tarjan |
| 1993 | SODA | Confluently Persistent Deques via Data Structural Bootstrapping. | Adam L. Buchsbaum, Robert Endre Tarjan |
| 1992 | FOCS | Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues | Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan |
| 1992 | SODA | Computing Minimal Spanning Subgraphs in Linear Time. | Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan |
| 1992 | SODA | A Faster Deterministic Maximum Flow Algorithm. | Valerie King, S. Rao, Robert Endre Tarjan |
| 1991 | SODA | Fully Persistent Lists with Catenation. | James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan |
| 1990 | SODA | Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung |
| 1990 | STOC | Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences | Rajamani Sundar, Robert Endre Tarjan |
| 1988 | FOCS | Dynamic Perfect Hashing: Upper and Lower Bounds | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
| 1988 | STOC | Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems | Harold N. Gabow, Robert Endre Tarjan |
| 1988 | STOC | Finding Minimum-Cost Circulations by Canceling Negative Cycles | Andrew V. Goldberg, Robert Endre Tarjan |
| 1987 | FOCS | Correction to "A Linear-Time Algorithm for Triangulating Simple Polygons" | Robert Endre Tarjan, Christopher J. Van Wyk |
| 1987 | STOC | Solving Minimum-Cost Flow Problems by Successive Approximation | Andrew V. Goldberg, Robert Endre Tarjan |
| 1986 | STOC | Making Data Structures Persistent | James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan |
| 1986 | STOC | A New Approach to the Maximum Flow Problem | Andrew V. Goldberg, Robert Endre Tarjan |
| 1986 | STOC | Rotation Distance, Triangulations, and Hyperbolic Geometry | Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston |
| 1986 | STOC | A Linear-Time Algorithm for Triangulating Simple Polygons | Robert Endre Tarjan, Christopher J. Van Wyk |
| 1984 | FOCS | Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms | Michael L. Fredman, Robert Endre Tarjan |
| 1984 | FOCS | Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) | Robert Endre Tarjan, Uzi Vishkin |
| 1984 | ICALP | A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. | Robert Paige, Robert Endre Tarjan |
| 1984 | STOC | Scaling and Related Techniques for Geometry Problems | Harold N. Gabow, Jon Louis Bentley, Robert Endre Tarjan |
| 1984 | STOC | Amortized Efficiency of List Update Rules | Daniel Dominic Sleator, Robert Endre Tarjan |
| 1983 | STOC | A Linear-Time Algorithm for a Special Case of Disjoint Set Union | Harold N. Gabow, Robert Endre Tarjan |
| 1983 | STOC | Self-Adjusting Binary Trees | Daniel Dominic Sleator, Robert Endre Tarjan |
| 1981 | STOC | A Data Structure for Dynamic Trees | Daniel Dominic Sleator, Robert Endre Tarjan |
| 1980 | FOCS | Biased 2-3 Trees | Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan |
| 1980 | POPL | Prime Subprogram Parsing of a Program. | Robert Endre Tarjan |
| 1980 | STOC | Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) | Richard M. Karp, Robert Endre Tarjan |
| 1979 | FOCS | Efficient Algorithms for Simple Matroid Intersection Problems | Harold N. Gabow, Robert Endre Tarjan |
| 1979 | STOC | The Pebbling Problem is Complete in Polynomial Space | John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan |
| 1979 | STOC | Upper and Lower Bounds on Time-Space Tradeoffs | Thomas Lengauer, Robert Endre Tarjan |
| 1979 | STOC | The recognition of Series Parallel digraphs | Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler |
| 1978 | STOC | A Representation for Linear Lists with Movable Fingers | Mark R. Brown, Robert Endre Tarjan |
| 1977 | FOCS | Application of a Planar Separator Theorem | Richard J. Lipton, Robert Endre Tarjan |
| 1977 | ICALP | Time-Space Trade-Offs in a Pebble Game. | Wolfgang J. Paul, Robert Endre Tarjan |
| 1977 | STOC | Reference Machines Require Non-linear Time to Maintain Disjoint Sets | Robert Endre Tarjan |
| 1976 | STOC | Space Bounds for a Game of Graphs | Wolfgang J. Paul, Robert Endre Tarjan, James R. Celoni |
| 1975 | STOC | a Combinatorial Problem which is Complete in Polynomial Space | Shimon Even, Robert Endre Tarjan |
| 1975 | STOC | Algorithmic Aspects of Vertex Elimination | Donald J. Rose, Robert Endre Tarjan |
| 1974 | STOC | Testing Graph Connectivity | Robert Endre Tarjan |
| 1973 | STOC | Testing Flow Graph Reducibility | Robert Endre Tarjan |
| 1972 | STOC | Linear Time Bounds for Median Computations | Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan |
| 1971 | FOCS | Depth-First Search and Linear Graph Algorithms (Working Paper) | Robert Endre Tarjan |