Search the dblp DataBase
Robert Endre Tarjan :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Robert Endre Tarjan Depth-First Search and Linear Graph Algorithms. [Citation Graph (27, 0)][DBLP ] SIAM J. Comput., 1972, v:1, n:2, pp:146-160 [Journal ] Peter J. Downey , Ravi Sethi , Robert Endre Tarjan Variations on the Common Subexpression Problem. [Citation Graph (16, 0)][DBLP ] J. ACM, 1980, v:27, n:4, pp:758-771 [Journal ] Robert Endre Tarjan , Mihalis Yannakakis Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (14, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:3, pp:566-579 [Journal ] James R. Driscoll , Neil Sarnak , Daniel Dominic Sleator , Robert Endre Tarjan Making Data Structures Persistent. [Citation Graph (13, 0)][DBLP ] J. Comput. Syst. Sci., 1989, v:38, n:1, pp:86-124 [Journal ] Daniel Dominic Sleator , Robert Endre Tarjan Amortized Efficiency of List Update and Paging Rules. [Citation Graph (6, 0)][DBLP ] Commun. ACM, 1985, v:28, n:2, pp:202-208 [Journal ] Robert Endre Tarjan , Andrew Chi-Chih Yao Storing a Sparse Table. [Citation Graph (6, 0)][DBLP ] Commun. ACM, 1979, v:22, n:11, pp:606-611 [Journal ] Neil Sarnak , Robert Endre Tarjan Planar Point Location Using Persistent Search Trees. [Citation Graph (5, 0)][DBLP ] Commun. ACM, 1986, v:29, n:7, pp:669-679 [Journal ] Martin Dietzfelbinger , Anna R. Karlin , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert , Robert Endre Tarjan Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP ] FOCS, 1988, pp:524-531 [Conf ] Daniel Dominic Sleator , Robert Endre Tarjan Self-Adjusting Binary Search Trees [Citation Graph (4, 0)][DBLP ] J. ACM, 1985, v:32, n:3, pp:652-686 [Journal ] Robert Endre Tarjan Efficiency of a Good But Not Linear Set Union Algorithm. [Citation Graph (4, 0)][DBLP ] J. ACM, 1975, v:22, n:2, pp:215-225 [Journal ] Manuel Blum , Robert W. Floyd , Vaughan R. Pratt , Ronald L. Rivest , Robert Endre Tarjan Time Bounds for Selection. [Citation Graph (4, 0)][DBLP ] J. Comput. Syst. Sci., 1973, v:7, n:4, pp:448-461 [Journal ] James R. Driscoll , Neil Sarnak , Daniel Dominic Sleator , Robert Endre Tarjan Making Data Structures Persistent [Citation Graph (3, 0)][DBLP ] STOC, 1986, pp:109-121 [Conf ] Bengt Aspvall , Michael F. Plass , Robert Endre Tarjan A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. [Citation Graph (3, 0)][DBLP ] Inf. Process. Lett., 1979, v:8, n:3, pp:121-123 [Journal ] Robert Paige , Robert Endre Tarjan Three Partition Refinement Algorithms. [Citation Graph (3, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:6, pp:973-989 [Journal ] Richard J. Lipton , Robert Endre Tarjan Application of a Planar Separator Theorem [Citation Graph (2, 0)][DBLP ] FOCS, 1977, pp:162-170 [Conf ] Michael L. Fredman , Robert Sedgewick , Daniel Dominic Sleator , Robert Endre Tarjan The Pairing Heap: A New Form of Self-Adjusting Heap. [Citation Graph (2, 0)][DBLP ] Algorithmica, 1986, v:1, n:1, pp:111-129 [Journal ] Jon Louis Bentley , Daniel Dominic Sleator , Robert Endre Tarjan , Victor K. Wei A Locally Adaptive Data Compression Scheme. [Citation Graph (2, 0)][DBLP ] Commun. ACM, 1986, v:29, n:4, pp:320-330 [Journal ] John E. Hopcroft , Robert Endre Tarjan Efficient Planarity Testing. [Citation Graph (2, 0)][DBLP ] J. ACM, 1974, v:21, n:4, pp:549-568 [Journal ] Edward G. Coffman Jr. , M. R. Garey , David S. Johnson , Robert Endre Tarjan Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:4, pp:808-826 [Journal ] Harold N. Gabow , Robert Endre Tarjan Faster Scaling Algorithms for Network Problems. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:5, pp:1013-1036 [Journal ] Dov Harel , Robert Endre Tarjan Fast Algorithms for Finding Nearest Common Ancestors. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:2, pp:338-355 [Journal ] Robert Endre Tarjan , Mihalis Yannakakis Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (2, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:1, pp:254-255 [Journal ] Robert Endre Tarjan , Uzi Vishkin Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) [Citation Graph (1, 0)][DBLP ] FOCS, 1984, pp:12-20 [Conf ] Philip N. Klein , Robert Endre Tarjan A randomized linear-time algorithm for finding minimum spanning trees. [Citation Graph (1, 0)][DBLP ] STOC, 1994, pp:9-15 [Conf ] Daniel Dominic Sleator , Robert Endre Tarjan Self-Adjusting Binary Trees [Citation Graph (1, 0)][DBLP ] STOC, 1983, pp:235-245 [Conf ] Daniel Dominic Sleator , Robert Endre Tarjan Amortized Efficiency of List Update Rules [Citation Graph (1, 0)][DBLP ] STOC, 1984, pp:488-492 [Conf ] John E. Hopcroft , Robert Endre Tarjan Efficient Algorithms for Graph Manipulation [H] (Algorithm 447). [Citation Graph (1, 0)][DBLP ] Commun. ACM, 1973, v:16, n:6, pp:372-378 [Journal ] M. R. Garey , David S. Johnson , Franco P. Preparata , Robert Endre Tarjan Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1978, v:7, n:4, pp:175-179 [Journal ] Robert Endre Tarjan Updating a Balanced Search Tree in O(1) Rotations. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1983, v:16, n:5, pp:253-257 [Journal ] Mark R. Brown , Robert Endre Tarjan A Fast Merging Algorithm. [Citation Graph (1, 0)][DBLP ] J. ACM, 1979, v:26, n:2, pp:211-226 [Journal ] Michael L. Fredman , Robert Endre Tarjan Fibonacci heaps and their uses in improved network optimization algorithms. [Citation Graph (1, 0)][DBLP ] J. ACM, 1987, v:34, n:3, pp:596-615 [Journal ] Harold N. Gabow , Robert Endre Tarjan Faster Scaling Algorithms for General Graph-Matching Problems. [Citation Graph (1, 0)][DBLP ] J. ACM, 1991, v:38, n:4, pp:815-853 [Journal ] Andrew V. Goldberg , Robert Endre Tarjan A new approach to the maximum-flow problem. [Citation Graph (1, 0)][DBLP ] J. ACM, 1988, v:35, n:4, pp:921-940 [Journal ] Robert Endre Tarjan A Unified Approach to Path Problems. [Citation Graph (1, 0)][DBLP ] J. ACM, 1981, v:28, n:3, pp:577-593 [Journal ] Robert Endre Tarjan Fast Algorithms for Solving Path Problems. [Citation Graph (1, 0)][DBLP ] J. ACM, 1981, v:28, n:3, pp:594-614 [Journal ] Daniel Dominic Sleator , Robert Endre Tarjan A Data Structure for Dynamic Trees. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1983, v:26, n:3, pp:362-391 [Journal ] Robert Endre Tarjan A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1979, v:18, n:2, pp:110-127 [Journal ] Mark R. Brown , Robert Endre Tarjan Design and Analysis of a Data Structure for Representing Sorted Lists. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:3, pp:594-614 [Journal ] David R. Cheriton , Robert Endre Tarjan Finding Minimum Spanning Trees. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:4, pp:724-742 [Journal ] Kapali P. Eswaran , Robert Endre Tarjan Augmentation Problems. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:4, pp:653-665 [Journal ] M. R. Garey , David S. Johnson , Robert Endre Tarjan The Planar Hamiltonian Circuit Problem is NP-Complete. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:4, pp:704-714 [Journal ] Richard J. Lipton , Robert Endre Tarjan Applications of a Planar Separator Theorem. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:3, pp:615-627 [Journal ] Donald J. Rose , Robert Endre Tarjan , George S. Lueker Algorithmic Aspects of Vertex Elimination on Graphs. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:2, pp:266-283 [Journal ] Robert Endre Tarjan , Christopher J. Van Wyk An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:1, pp:143-178 [Journal ] Thomas Lengauer , Robert Endre Tarjan A Fast Algorithm for Finding Dominators in a Flowgraph. [Citation Graph (1, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1979, v:1, n:1, pp:121-141 [Journal ] Jiazhen Cai , Robert Paige , Robert Endre Tarjan More Efficient Bottom-Up Tree Pattern Matching. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:72-86 [Conf ] Bill G. Horne , Lesley R. Matheson , Casey Sheehan , Robert Endre Tarjan Dynamic Self-Checking Techniques for Improved Tamper Resistance. [Citation Graph (0, 0)][DBLP ] Digital Rights Management Workshop, 2001, pp:141-159 [Conf ] Brandon Dixon , Robert Endre Tarjan Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. [Citation Graph (0, 0)][DBLP ] Canada-France Conference on Parallel and Distributed Computing, 1994, pp:13-22 [Conf ] Kamalika Chaudhuri , Anshul Kothari , Rudi Pendavingh , Ram Swaminathan , Robert Endre Tarjan , Yunhong Zhou Server Allocation Algorithms for Tiered Systems. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:632-643 [Conf ] Kenneth L. Clarkson , Richard Cole , Robert Endre Tarjan Randomized Parallel Algorithms for Trapezoidal Diagrams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1991, pp:152-161 [Conf ] Kenneth L. Clarkson , Robert Endre Tarjan , Christopher J. Van Wyk A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1988, pp:18-22 [Conf ] Leonidas J. Guibas , John Hershberger , Daniel Leven , Micha Sharir , Robert Endre Tarjan Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1986, pp:1-13 [Conf ] David G. Kirkpatrick , Maria M. Klawe , Robert Endre Tarjan Polygon Triangulation in O(n log log n) Time with Simple Data-Structures. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1990, pp:34-43 [Conf ] Stuart Haber , Bill G. Horne , Joe Pato , Tomas Sander , Robert Endre Tarjan If Piracy Is the Problem, Is DRM the Answer? [Citation Graph (0, 0)][DBLP ] Digital Rights Management, 2003, pp:224-233 [Conf ] Loukas Georgiadis , Renato Fonseca F. Werneck , Robert Endre Tarjan , Spyridon Triantafyllis , David I. August Finding Dominators in Practice. [Citation Graph (0, 0)][DBLP ] ESA, 2004, pp:677-688 [Conf ] Robert Endre Tarjan , Julie Ward , Bin Zhang , Yunhong Zhou , Jia Mao Balancing Applied to Maximum Network Flow Problems. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:612-623 [Conf ] Lesley R. Matheson , Stephen G. Mitchell , Talal Shamoon , Robert Endre Tarjan , Francis Zane Robustness and Security of Digital Watermarks. [Citation Graph (0, 0)][DBLP ] Financial Cryptography, 1998, pp:227-240 [Conf ] Samuel W. Bent , Daniel Dominic Sleator , Robert Endre Tarjan Biased 2-3 Trees [Citation Graph (0, 0)][DBLP ] FOCS, 1980, pp:248-254 [Conf ] Adam L. Buchsbaum , Rajamani Sundar , Robert Endre Tarjan Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:40-49 [Conf ] Michael L. Fredman , Robert Endre Tarjan Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms [Citation Graph (0, 0)][DBLP ] FOCS, 1984, pp:338-346 [Conf ] Harold N. Gabow , Robert Endre Tarjan Efficient Algorithms for Simple Matroid Intersection Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1979, pp:196-204 [Conf ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:780-791 [Conf ] Robert Endre Tarjan Depth-First Search and Linear Graph Algorithms (Working Paper) [Citation Graph (0, 0)][DBLP ] FOCS, 1971, pp:114-121 [Conf ] Robert Endre Tarjan , Christopher J. Van Wyk Correction to ``A Linear-Time Algorithm for Triangulating Simple Polygons'' [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:486- [Conf ] Susan E. Dorward , Lesley R. Matheson , Robert Endre Tarjan Unstructured Multigrid Strategies on Massively Parallel Computers: A Case for Integrated Design. [Citation Graph (0, 0)][DBLP ] HICSS (2), 1994, pp:169-178 [Conf ] Bruce M. Maggs , Lesley R. Matheson , Robert Endre Tarjan Models of parallel computation: a survey and synthesis. [Citation Graph (0, 0)][DBLP ] HICSS (2), 1995, pp:61-0 [Conf ] Lesley R. Matheson , Talal Shamoon , Robert Endre Tarjan Culturally-Induced Information Impactedness: A Prescription for Failure in Software Ventures. [Citation Graph (0, 0)][DBLP ] HICSS (6), 1998, pp:329-338 [Conf ] Wolfgang J. Paul , Robert Endre Tarjan Time-Space Trade-Offs in a Pebble Game. [Citation Graph (0, 0)][DBLP ] ICALP, 1977, pp:365-369 [Conf ] Robert Paige , Robert Endre Tarjan A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:371-379 [Conf ] John E. Hopcroft , Robert Endre Tarjan Planarity Testing in V log V Steps: Extended Abstract. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1971, pp:85-90 [Conf ] Susan E. Dorward , Lesley R. Matheson , Robert Endre Tarjan Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract). [Citation Graph (0, 0)][DBLP ] IRREGULAR, 1996, pp:105-118 [Conf ] Robert Endre Tarjan Prime Subprogram Parsing of a Program. [Citation Graph (0, 0)][DBLP ] POPL, 1980, pp:95-105 [Conf ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Faster and simpler algorithm for sorting signed permutations by reversals. [Citation Graph (0, 0)][DBLP ] RECOMB, 1997, pp:163- [Conf ] Eric Anderson , Dirk Beyer 0002 , Kamalika Chaudhuri , Terence Kelly , Norman Salazar , Cipriano Santos , Ram Swaminathan , Robert Endre Tarjan , Janet L. Wiener , Yunhong Zhou Deadline scheduling for animation rendering. [Citation Graph (0, 0)][DBLP ] SIGMETRICS, 2005, pp:384-385 [Conf ] Adam L. Buchsbaum , Robert Endre Tarjan Confluently Persistent Deques via Data Structural Bootstrapping. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:155-164 [Conf ] James R. Driscoll , Daniel Dominic Sleator , Robert Endre Tarjan Fully Persistent Lists with Catenation. [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:89-99 [Conf ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. [Citation Graph (0, 0)][DBLP ] SODA, 1990, pp:1-11 [Conf ] Loukas Georgiadis , Robert Endre Tarjan Finding dominators revisited: extended abstract. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:869-878 [Conf ] Loukas Georgiadis , Robert Endre Tarjan Dominator tree verification and vertex-disjoint paths. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:433-442 [Conf ] Loukas Georgiadis , Robert Endre Tarjan , Renato Fonseca F. Werneck Design of data structures for mergeable trees. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:394-403 [Conf ] Xiaofeng Han , Pierre Kelsen , Vijaya Ramachandran , Robert Endre Tarjan Computing Minimal Spanning Subgraphs in Linear Time. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:146-156 [Conf ] Haim Kaplan , Nira Shafrir , Robert Endre Tarjan Union-find with deletions. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:19-28 [Conf ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:344-351 [Conf ] Haim Kaplan , Robert Endre Tarjan , Kostas Tsioutsiouliklis Faster kinetic heaps and their use in broadcast scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:836-844 [Conf ] V. King , S. Rao , Robert Endre Tarjan A Faster Deterministic Maximum Flow Algorithm. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:157-164 [Conf ] Robert Endre Tarjan , Renato Fonseca F. Werneck Self-adjusting top trees. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:813-822 [Conf ] Eric Anderson , Dirk Beyer 0002 , Kamalika Chaudhuri , Terence Kelly , Norman Salazar , Cipriano Santos , Ram Swaminathan , Robert Endre Tarjan , Janet L. Wiener , Yunhong Zhou Value-maximizing deadline scheduling and its application to animation rendering. [Citation Graph (0, 0)][DBLP ] SPAA, 2005, pp:299-308 [Conf ] Richard Cole , Philip N. Klein , Robert Endre Tarjan Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. [Citation Graph (0, 0)][DBLP ] SPAA, 1996, pp:243-250 [Conf ] Manuel Blum , Robert W. Floyd , Vaughan R. Pratt , Ronald L. Rivest , Robert Endre Tarjan Linear Time Bounds for Median Computations [Citation Graph (0, 0)][DBLP ] STOC, 1972, pp:119-124 [Conf ] Mark R. Brown , Robert Endre Tarjan A Representation for Linear Lists with Movable Fingers [Citation Graph (0, 0)][DBLP ] STOC, 1978, pp:19-29 [Conf ] Shimon Even , Robert Endre Tarjan a Combinatorial Problem which is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP ] STOC, 1975, pp:66-71 [Conf ] Harold N. Gabow , Jon Louis Bentley , Robert Endre Tarjan Scaling and Related Techniques for Geometry Problems [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:135-143 [Conf ] Harold N. Gabow , Haim Kaplan , Robert Endre Tarjan Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:70-78 [Conf ] Harold N. Gabow , Robert Endre Tarjan A Linear-Time Algorithm for a Special Case of Disjoint Set Union [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:246-251 [Conf ] Harold N. Gabow , Robert Endre Tarjan Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:514-527 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:548-558 [Conf ] John R. Gilbert , Thomas Lengauer , Robert Endre Tarjan The Pebbling Problem is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:237-248 [Conf ] Andrew V. Goldberg , Robert Endre Tarjan A New Approach to the Maximum Flow Problem [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:136-146 [Conf ] Andrew V. Goldberg , Robert Endre Tarjan Solving Minimum-Cost Flow Problems by Successive Approximation [Citation Graph (0, 0)][DBLP ] STOC, 1987, pp:7-18 [Conf ] Andrew V. Goldberg , Robert Endre Tarjan Finding Minimum-Cost Circulations by Canceling Negative Cycles [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:388-397 [Conf ] Haim Kaplan , Eyal Molad , Robert Endre Tarjan Dynamic rectangular intersection with priorities. [Citation Graph (0, 0)][DBLP ] STOC, 2003, pp:639-648 [Conf ] Haim Kaplan , Nira Shafrir , Robert Endre Tarjan Meldable heaps and boolean union-find. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:573-582 [Conf ] Haim Kaplan , Robert Endre Tarjan Persistent lists with catenation via recursive slow-down. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:93-102 [Conf ] Haim Kaplan , Robert Endre Tarjan Purely Functional Representations of Catenable Sorted Lists. [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:202-211 [Conf ] Richard M. Karp , Robert Endre Tarjan Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:368-377 [Conf ] Thomas Lengauer , Robert Endre Tarjan Upper and Lower Bounds on Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:262-277 [Conf ] Wolfgang J. Paul , Robert Endre Tarjan , James R. Celoni Space Bounds for a Game of Graphs [Citation Graph (0, 0)][DBLP ] STOC, 1976, pp:149-160 [Conf ] Donald J. Rose , Robert Endre Tarjan Algorithmic Aspects of Vertex Elimination [Citation Graph (0, 0)][DBLP ] STOC, 1975, pp:245-254 [Conf ] Daniel Dominic Sleator , Robert Endre Tarjan A Data Structure for Dynamic Trees [Citation Graph (0, 0)][DBLP ] STOC, 1981, pp:114-122 [Conf ] Daniel Dominic Sleator , Robert Endre Tarjan , William P. Thurston Rotation Distance, Triangulations, and Hyperbolic Geometry [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:122-135 [Conf ] Rajamani Sundar , Robert Endre Tarjan Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:18-25 [Conf ] Robert Endre Tarjan Testing Flow Graph Reducibility [Citation Graph (0, 0)][DBLP ] STOC, 1973, pp:96-107 [Conf ] Robert Endre Tarjan Testing Graph Connectivity [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:185-193 [Conf ] Robert Endre Tarjan Reference Machines Require Non-linear Time to Maintain Disjoint Sets [Citation Graph (0, 0)][DBLP ] STOC, 1977, pp:18-29 [Conf ] Robert Endre Tarjan , Christopher J. Van Wyk A Linear-Time Algorithm for Triangulating Simple Polygons [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:380-388 [Conf ] Jacobo Valdes , Robert Endre Tarjan , Eugene L. Lawler The recognition of Series Parallel digraphs [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:1-12 [Conf ] Haim Kaplan , Chris Okasaki , Robert Endre Tarjan Simple Confluently Persistent Catenable Lists (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SWAT, 1998, pp:119-130 [Conf ] Ran Mendelson , Robert Endre Tarjan , Mikkel Thorup , Uri Zwick Melding Priority Queues. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:223-235 [Conf ] Robert Endre Tarjan Results and Problems on Self-adjusting Search Trees and Related Data Structures. [Citation Graph (0, 0)][DBLP ] SWAT, 2006, pp:2- [Conf ] Adam L. Buchsbaum , Rajamani Sundar , Robert Endre Tarjan Lazy Structure Sharing for Query Optimization [Citation Graph (0, 0)][DBLP ] Acta Inf., 1995, v:32, n:3, pp:255-270 [Journal ] Wolfgang J. Paul , Robert Endre Tarjan Time-Space Trade-Offs in a Pebble Game. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1978, v:10, n:, pp:111-115 [Journal ] Robert Endre Tarjan Edge-Disjoint Spanning Trees and Depth-First Search. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1976, v:6, n:, pp:171-185 [Journal ] Brandon Dixon , Robert Endre Tarjan Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:17, n:1, pp:11-18 [Journal ] Leonidas J. Guibas , John Hershberger , Daniel Leven , Micha Sharir , Robert Endre Tarjan Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1987, v:2, n:, pp:209-233 [Journal ] Bhubaneswar Mishra , Robert Endre Tarjan A Linear-Time Algorithm for Finding an Ambitus. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:5&6, pp:521-554 [Journal ] Jeffery Westbrook , Robert Endre Tarjan Maintaining Bridge-Connected and Biconnected Components On-Line. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:5&6, pp:433-464 [Journal ] James R. Driscoll , Harold N. Gabow , Ruth Shrairman , Robert Endre Tarjan Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1988, v:31, n:11, pp:1343-1354 [Journal ] Robert Endre Tarjan Algorithmic Design. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1987, v:30, n:3, pp:204-212 [Journal ] Harold N. Gabow , Zvi Galil , Thomas H. Spencer , Robert Endre Tarjan Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:2, pp:109-122 [Journal ] Robert Endre Tarjan Sequential access in play trees takes linear time. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1985, v:5, n:4, pp:367-378 [Journal ] Neal E. Young , Robert Endre Tarjan , James B. Orlin Faster Parametric Shortest Path and Minimum Balance Algorithms [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Kenneth L. Clarkson , Robert Endre Tarjan , Christopher J. Van Wyk A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1989, v:4, n:, pp:423-432 [Journal ] David G. Kirkpatrick , Maria M. Klawe , Robert Endre Tarjan Polygon Triangulation in O (n log log n) Time with Simple Data Structures. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1992, v:7, n:, pp:329-346 [Journal ] Pierre Rosenstiehl , Robert Endre Tarjan Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1986, v:1, n:, pp:343-353 [Journal ] Lesley R. Matheson , Robert Endre Tarjan Dominating Sets in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1996, v:17, n:6, pp:565-568 [Journal ] Kurt Hoffman , Kurt Mehlhorn , Pierre Rosenstiehl , Robert Endre Tarjan Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees [Citation Graph (0, 0)][DBLP ] Information and Control, 1986, v:68, n:1-3, pp:170-184 [Journal ] Kenneth L. Clarkson , Richard Cole , Robert Endre Tarjan Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:117-133 [Journal ] Kenneth L. Clarkson , Richard Cole , Robert Endre Tarjan Erratum: Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:341-343 [Journal ] Khun Yee Fung , Tina M. Nicholl , Robert Endre Tarjan , Christopher J. Van Wyk Simplified Linear-Time Jordan Sorting and Polygon Clipping. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:35, n:2, pp:85-92 [Journal ] Harold N. Gabow , Robert Endre Tarjan A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:27, n:5, pp:259-263 [Journal ] H. Gajewska , Robert Endre Tarjan Deques with Heap Order. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1986, v:22, n:4, pp:197-200 [Journal ] M. R. Garey , Robert Endre Tarjan A Linear-Time Algorithm for Finding All Feedback Vertices. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1978, v:7, n:6, pp:274-276 [Journal ] David Ginat , Daniel Dominic Sleator , Robert Endre Tarjan A Tight Amortized Bound for Path Reversal. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:31, n:1, pp:3-5 [Journal ] Andrew V. Goldberg , Robert Endre Tarjan A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:31, n:5, pp:265-271 [Journal ] John E. Hopcroft , Robert Endre Tarjan A V² Algorithm for Determining Isomorphism of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1971, v:1, n:1, pp:32-34 [Journal ] Thomas Lengauer , Robert Endre Tarjan The Space Complexity of Pebble Games on Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1980, v:10, n:4/5, pp:184-188 [Journal ] Jayadev Misra , Robert Endre Tarjan Optimal Chain Partitions of Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1975, v:4, n:1, pp:24-26 [Journal ] Robert Endre Tarjan Determining Whether a Groupoid is a Group. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1972, v:1, n:3, pp:120-124 [Journal ] Robert Endre Tarjan A Note on Finding the Bridges of a Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1974, v:2, n:6, pp:160-161 [Journal ] Robert Endre Tarjan A New Algorithm for Finding Weak Components. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1974, v:3, n:1, pp:13-15 [Journal ] Robert Endre Tarjan A Good Algorithm for Edge-Disjoint Branching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1974, v:3, n:2, pp:51-53 [Journal ] Robert Endre Tarjan A Hierarchical Clustering Algorithm Using Strong Components. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:1, pp:26-29 [Journal ] Robert Endre Tarjan Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:14, n:1, pp:30-33 [Journal ] Robert Endre Tarjan An Improved Algorithm for Hierarchical Clustering Using Strong Components. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1983, v:17, n:1, pp:37-41 [Journal ] Ravindra K. Ahuja , Kurt Mehlhorn , James B. Orlin , Robert Endre Tarjan Faster Algorithms for the Shortest Path Problem [Citation Graph (0, 0)][DBLP ] J. ACM, 1990, v:37, n:2, pp:213-223 [Journal ] James R. Driscoll , Daniel Dominic Sleator , Robert Endre Tarjan Fully Persistent Lists with Catenation. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:5, pp:943-959 [Journal ] Shimon Even , Robert Endre Tarjan A Combinatorial Problem Which Is Complete in Polynomial Space. [Citation Graph (0, 0)][DBLP ] J. ACM, 1976, v:23, n:4, pp:710-719 [Journal ] Andrew V. Goldberg , Robert Endre Tarjan Finding minimum-cost circulations by canceling negative cycles. [Citation Graph (0, 0)][DBLP ] J. ACM, 1989, v:36, n:4, pp:873-886 [Journal ] David R. Karger , Philip N. Klein , Robert Endre Tarjan A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] J. ACM, 1995, v:42, n:2, pp:321-328 [Journal ] Thomas Lengauer , Robert Endre Tarjan Asymptotically tight bounds on time-space trade-offs in a pebble game. [Citation Graph (0, 0)][DBLP ] J. ACM, 1982, v:29, n:4, pp:1087-1130 [Journal ] Robert Endre Tarjan Sorting Using Networks of Queues and Stacks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1972, v:19, n:2, pp:341-346 [Journal ] Robert Endre Tarjan Applications of Path Compression on Balanced Trees. [Citation Graph (0, 0)][DBLP ] J. ACM, 1979, v:26, n:4, pp:690-715 [Journal ] Robert Endre Tarjan , Jan van Leeuwen Worst-case Analysis of Set Union Algorithms. [Citation Graph (0, 0)][DBLP ] J. ACM, 1984, v:31, n:2, pp:245-281 [Journal ] Adam L. Buchsbaum , Robert Endre Tarjan Confluently Persistent Deques via Data-Structural Bootstrapping. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:18, n:3, pp:513-547 [Journal ] Heather Booth , Robert Endre Tarjan Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:3, pp:416-446 [Journal ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1992, v:13, n:1, pp:33-54 [Journal ] David Eppstein , Giuseppe F. Italiano , Roberto Tamassia , Robert Endre Tarjan , Jeffery Westbrook , Moti Yung Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:1, pp:173- [Journal ] Harold N. Gabow , Haim Kaplan , Robert Endre Tarjan Unique Maximum Matching Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:40, n:2, pp:159-183 [Journal ] Harold N. Gabow , Robert Endre Tarjan Efficient Algorithms for a Family of Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1984, v:5, n:1, pp:80-131 [Journal ] Harold N. Gabow , Robert Endre Tarjan Algorithms for Two Bottleneck Optimization Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1988, v:9, n:3, pp:411-417 [Journal ] Phillip B. Gibbons , Richard M. Karp , Vijaya Ramachandran , Danny Soroker , Robert Endre Tarjan Transitive Compaction in Parallel via Branchings. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1991, v:12, n:1, pp:110-125 [Journal ] John R. Gilbert , Joan P. Hutchinson , Robert Endre Tarjan A Separator Theorem for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1984, v:5, n:3, pp:391-407 [Journal ] Richard M. Karp , Robert Endre Tarjan Linear Expected-Time Algorithms for Connectivity Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1980, v:1, n:4, pp:374-393 [Journal ] V. King , S. Rao , Robert Endre Tarjan A Faster Deterministic Maximum Flow Algorithm. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1994, v:17, n:3, pp:447-474 [Journal ] Pierre Rosenstiehl , Robert Endre Tarjan Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1984, v:5, n:3, pp:375-390 [Journal ] Harold N. Gabow , Robert Endre Tarjan A Linear-Time Algorithm for a Special Case of Disjoint Set Union. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1985, v:30, n:2, pp:209-221 [Journal ] John E. Hopcroft , Robert Endre Tarjan A V log V Algorithm for Isomorphism of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1973, v:7, n:3, pp:323-331 [Journal ] Robert Endre Tarjan Testing Flow Graph Reducibility. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1974, v:9, n:3, pp:355-365 [Journal ] Gideon Ehrlich , Shimon Even , Robert Endre Tarjan Intersection graphs of curves in the plane. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:8-20 [Journal ] Lesley R. Matheson , Robert Endre Tarjan Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:33-43 [Journal ] Ravindra K. Ahuja , Andrew V. Goldberg , James B. Orlin , Robert Endre Tarjan Finding minimum-cost flows by double scaling. [Citation Graph (0, 0)][DBLP ] Math. Program., 1992, v:53, n:, pp:243-266 [Journal ] Andrew V. Goldberg , Michael D. Grigoriadis , Robert Endre Tarjan Use of dynamic trees in a network simplex algorithm for the maximum flow problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1991, v:50, n:, pp:277-290 [Journal ] Robert Endre Tarjan Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. [Citation Graph (0, 0)][DBLP ] Math. Program., 1997, v:77, n:, pp:169-177 [Journal ] Wolfgang J. Paul , Robert Endre Tarjan , James R. Celoni Space Bounds for a Game on Graphs. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1977, v:10, n:, pp:239-251 [Journal ] Wolfgang J. Paul , Robert Endre Tarjan , James R. Celoni Correction: Space Bounds for a Game on Graphs. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1977, v:11, n:, pp:85- [Journal ] Ravindra K. Ahuja , James B. Orlin , Clifford Stein , Robert Endre Tarjan Improved Algorithms for Bipartite Network Flow. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:5, pp:906-933 [Journal ] Ravindra K. Ahuja , James B. Orlin , Robert Endre Tarjan Improved Time Bounds for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:5, pp:939-954 [Journal ] Samuel W. Bent , Daniel Dominic Sleator , Robert Endre Tarjan Biased Search Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:3, pp:545-568 [Journal ] Adam L. Buchsbaum , Rajamani Sundar , Robert Endre Tarjan Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:6, pp:1190-1206 [Journal ] Jiazhen Cai , Xiaofeng Han , Robert Endre Tarjan An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:6, pp:1142-1162 [Journal ] Martin Dietzfelbinger , Anna R. Karlin , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert , Robert Endre Tarjan Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal ] Brandon Dixon , Monika Rauch , Robert Endre Tarjan Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:6, pp:1184-1192 [Journal ] Shimon Even , Robert Endre Tarjan Network Flow and Testing Graph Connectivity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1975, v:4, n:4, pp:507-518 [Journal ] Giorgio Gallo , Michael D. Grigoriadis , Robert Endre Tarjan A Fast Parametric Maximum Flow Algorithm and Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:1, pp:30-55 [Journal ] M. R. Garey , David S. Johnson , Barbara B. Simons , Robert Endre Tarjan Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:2, pp:256-269 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal ] John R. Gilbert , Thomas Lengauer , Robert Endre Tarjan The Pebbling Problem is Complete in Polynomial Space. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1980, v:9, n:3, pp:513-524 [Journal ] S. E. Goodman , Stephen T. Hedetniemi , Robert Endre Tarjan b-Matchings in Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:1, pp:104-108 [Journal ] Xiaofeng Han , Pierre Kelsen , Vijaya Ramachandran , Robert Endre Tarjan Computing Minimal Spanning Subgraphs in Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:6, pp:1332-1358 [Journal ] John E. Hopcroft , Robert Endre Tarjan Dividing a Graph into Triconnected Components. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1973, v:2, n:3, pp:135-158 [Journal ] Haim Kaplan , Chris Okasaki , Robert Endre Tarjan Simple Confluently Persistent Catenable Lists. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:3, pp:965-977 [Journal ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:3, pp:880-892 [Journal ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:5, pp:1906-1922 [Journal ] John H. Reif , Robert Endre Tarjan Symbolic Program Analysis in Almost-Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:1, pp:81-93 [Journal ] Edward M. Reingold , Robert Endre Tarjan On a Greedy Heuristic for Complete Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:4, pp:676-681 [Journal ] Daniel Dominic Sleator , Robert Endre Tarjan Self-Adjusting Heaps. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1986, v:15, n:1, pp:52-69 [Journal ] Rajamani Sundar , Robert Endre Tarjan Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:1, pp:24-44 [Journal ] Robert Endre Tarjan Enumeration of the Elementary Circuits of a Directed Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1973, v:2, n:3, pp:211-216 [Journal ] Robert Endre Tarjan Finding Dominators in Directed Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1974, v:3, n:1, pp:62-89 [Journal ] Robert Endre Tarjan , Anthony E. Trojanowski Finding a Maximum Independent Set. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1977, v:6, n:3, pp:537-546 [Journal ] Robert Endre Tarjan , Uzi Vishkin An Efficient Parallel Biconnectivity Algorithm. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:4, pp:862-874 [Journal ] Robert Endre Tarjan , Christopher J. Van Wyk Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:5, pp:1061- [Journal ] Jacobo Valdes , Robert Endre Tarjan , Eugene L. Lawler The Recognition of Series Parallel Digraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:2, pp:298-313 [Journal ] Jeffery Westbrook , Robert Endre Tarjan Amortized Analysis of Algorithms for Set Union with Backtracking. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:1, pp:1-11 [Journal ] Daniel Dominic Sleator , Robert Endre Tarjan , William P. Thurston Short Encodings of Evolving Structures. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1992, v:5, n:3, pp:428-450 [Journal ] Ran Mendelson , Robert Endre Tarjan , Mikkel Thorup , Uri Zwick Melding priority queues. [Citation Graph (0, 0)][DBLP ] ACM Transactions on Algorithms, 2006, v:2, n:4, pp:535-556 [Journal ] Jiazhen Cai , Robert Paige , Robert Endre Tarjan More Efficient Bottom-Up Multi-Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:106, n:1, pp:21-60 [Journal ] Shimon Even , Robert Endre Tarjan Computing an st -Numbering. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:2, n:3, pp:339-344 [Journal ] Shimon Even , Robert Endre Tarjan Corrigendum: Computing an st -Numbering. TCS 2(1976):339-344. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1977, v:4, n:1, pp:123- [Journal ] Robert Paige , Robert Endre Tarjan , Robert Bonic A Linear Time Solution to the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:40, n:, pp:67-84 [Journal ] Nina Mishra , Robert Schreiber , Isabelle Stanton , Robert Endre Tarjan Clustering Social Networks. [Citation Graph (0, 0)][DBLP ] WAW, 2007, pp:56-67 [Conf ] Maxim A. Babenko , Jonathan Derryberry , Andrew Goldberg , Robert Endre Tarjan , Yunhong Zhou Experimental Evaluation of Parametric Max-Flow Algorithms. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:256-269 [Conf ] Robert Endre Tarjan , Renato Fonseca F. Werneck Dynamic Trees in Practice. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:80-93 [Conf ] Kamalika Chaudhuri , Anshul Kothari , Rudi Pendavingh , Ram Swaminathan , Robert Endre Tarjan , Yunhong Zhou Server Allocation Algorithms for Tiered Systems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:48, n:2, pp:129-146 [Journal ] Robert Endre Tarjan Decomposition by clique separators. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:55, n:2, pp:221-232 [Journal ] Efficiently Generating k-Best Solutions to Procurement Auctions. [Citation Graph (, )][DBLP ] An Experimental Study of Minimum Mean Cycle Algorithms. [Citation Graph (, )][DBLP ] Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP ] Sorting Jordan sequences in linear time. [Citation Graph (, )][DBLP ] Rank-Pairing Heaps. [Citation Graph (, )][DBLP ] Faster Algorithms for Incremental Topological Ordering. [Citation Graph (, )][DBLP ] Reachability Problems on Directed Graphs. [Citation Graph (, )][DBLP ] Deletion without Rebalancing in Multiway Search Trees. [Citation Graph (, )][DBLP ] Fast exact and heuristic methods for role minimization problems. [Citation Graph (, )][DBLP ] Deletion Without Rebalancing in Balanced Binary Trees. [Citation Graph (, )][DBLP ] Rank-Balanced Trees. [Citation Graph (, )][DBLP ] Data Structures for Mergeable Trees [Citation Graph (, )][DBLP ] Finding a Feasible Flow in a Strongly Connected Network [Citation Graph (, )][DBLP ] Incremental Topological Ordering and Strong Component Maintenance [Citation Graph (, )][DBLP ] Heaps Simplified [Citation Graph (, )][DBLP ] Search in 0.015secs, Finished in 0.028secs