Robert Tarjan | Academic Influence

Robert Tarjan's AcademicInfluence.com Rankings

Robert Tarjan

Computer Science

#64

World Rank

#66

Historical Rank

#38

USA Rank

Database

#46

World Rank

#48

Historical Rank

#25

USA Rank

computer-science Degrees

Download Badge

Computer Science

Robert Tarjan's Degrees

Bachelors Mathematics California Institute of Technology
Masters Mathematics University of California, Berkeley
PhD Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Robert Tarjan Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms, including his strongly connected components algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University.

(See a Problem?)

Robert Tarjan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Depth-First Search and Linear Graph Algorithms (1972) (6499)
Fibonacci heaps and their uses in improved network optimization algorithms (1984) (2974)
Amortized efficiency of list update and paging rules (1985) (2312)
Data structures and network algorithms (1983) (2198)
A new approach to the maximum flow problem (1986) (1651)
A Separator Theorem for Planar Graphs (1977) (1470)
Efficiency of a Good But Not Linear Set Union Algorithm (1972) (1420)
Self-adjusting binary search trees (1985) (1347)
Time Bounds for Selection (1973) (1313)
Algorithmic Aspects of Vertex Elimination on Graphs (1976) (1249)
Three Partition Refinement Algorithms (1987) (1247)
A data structure for dynamic trees (1981) (1197)
Fast Algorithms for Finding Nearest Common Ancestors (1984) (1197)
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (1984) (1153)
Efficient Planarity Testing (1974) (1152)
Algorithm 447: efficient algorithms for graph manipulation (1973) (945)
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas (1979) (921)
Dividing a Graph into Triconnected Components (1973) (878)
Making data structures persistent (1986) (845)
A new approach to the maximum-flow problem (1988) (834)
Applications of a planar separator theorem (1977) (804)
A quick method for finding shortest pairs of disjoint paths (1984) (769)
The recognition of Series Parallel digraphs (1979) (758)
A linear-time algorithm for a special case of disjoint set union (1983) (747)
A fast algorithm for finding dominators in a flowgraph (1979) (722)
A Fast Parametric Maximum Flow Algorithm and Applications (1989) (650)
Generalized nested dissection (1977) (590)
A locally adaptive data compression scheme (1986) (574)
Network Flow and Testing Graph Connectivity (1975) (567)
Faster algorithms for the shortest path problem (1990) (553)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (1986) (552)
The Planar Hamiltonian Circuit Problem is NP-Complete (1976) (532)
Scaling and related techniques for geometry problems (1984) (527)
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms (1980) (517)
Amortized Computational Complexity (1985) (516)
Dynamic perfect hashing: upper and lower bounds (1988) (474)
An Efficient Parallel Biconnectivity Algorithm (2011) (465)
Worst-case Analysis of Set Union Algorithms (1984) (464)
Finding a Maximum Independent Set (1976) (455)
A randomized linear-time algorithm to find minimum spanning trees (1995) (450)
Planar point location using persistent search trees (1986) (449)
Decomposition by clique separators (1985) (439)
Finding Minimum Spanning Trees (1976) (436)
Faster Scaling Algorithms for Network Problems (1989) (432)
Rotation distance, triangulations, and hyperbolic geometry (1986) (423)
Variations on the Common Subexpression Problem (1980) (389)
Graph Clustering and Minimum Cut Trees (2004) (382)
Finding optimum branchings (1977) (369)
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties (1988) (364)
Efficient algorithms for graph manipulation (1971) (362)
Finding Minimum-Cost Circulations by Successive Approximation (1990) (321)
Faster scaling algorithms for general graph matching problems (1991) (319)
Triangulating a Simple Polygon (1978) (314)
Applications of Path Compression on Balanced Trees (1979) (312)
Fast Algorithms for Solving Path Problems (1981) (303)
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (1987) (295)
A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets (1979) (294)
A Unified Approach to Path Problems (1981) (290)
Rectilinear planar layouts and bipolar orientations of planar graphs (1986) (287)
Computing an st -Numbering (1976) (284)
Augmentation Problems (1976) (275)
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees (1975) (270)
A Separator Theorem for Graphs of Bounded Genus (1984) (268)
Enumeration of the Elementary Circuits of a Directed Graph (1972) (260)
Testing flow graph reducibility (1973) (245)
Storing a sparse table (1979) (241)
Finding minimum-cost circulations by canceling negative cycles (1988) (239)
Solving minimum-cost flow problems by successive approximation (1987) (237)
Faster and simpler algorithm for sorting signed permutations by reversals (1997) (237)
A Note on Finding the Bridges of a Graph (1974) (228)
Finding Dominators in Directed Graphs (1974) (228)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation (1988) (222)
Fast exact and heuristic methods for role minimization problems (2008) (222)
A faster deterministic maximum flow algorithm (1992) (213)
Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines (1981) (209)
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) (1984) (205)
Sorting Using Networks of Queues and Stacks (1972) (203)
Dynamic Self-Checking Techniques for Improved Tamper Resistance (2001) (203)
Network Flow Algorithms (1989) (199)
An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon (1988) (185)
The pairing heap: A new form of self-adjusting heap (2005) (185)
Finding minimum-cost circulations by canceling negative cycles (1989) (181)
Faster parametric shortest path and minimum-balance algorithms (1991) (180)
Space bounds for a game on graphs (1976) (178)
Algorithms for Two Bottleneck Optimization Problems (1988) (178)
Maintenance of a minimum spanning forest in a dynamic planar graph (1990) (177)
Improved Algorithms for Bipartite Network Flow (1994) (166)
Clustering Social Networks (2007) (166)
Edge-disjoint spanning trees and depth-first search (1976) (161)
Design and Analysis of a Data Structure for Representing Sorted Lists (1978) (159)
Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees (1982) (156)
Improved Time Bounds for the Maximum Flow Problem (2018) (148)
Isomorphism of Planar Graphs (1972) (148)
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs (1999) (147)
Algorithmic aspects of vertex elimination on directed graphs. (1975) (146)
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time (1992) (145)
A Combinatorial Problem Which Is Complete in Polynomial Space (1976) (140)
Self-Adjusting Heaps (1986) (139)
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (1985) (136)
Biased Search Trees (1985) (136)
Self-adjusting binary trees (1983) (134)
Linear time algorithms for visibility and shortest path problems inside simple polygons (2011) (130)
Intersection graphs of curves in the plane (1976) (129)
The analysis of a nested dissection algorithm (1987) (129)
Finding minimum-cost flows by double scaling (2015) (128)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals (1999) (126)
Models of parallel computation: a survey and synthesis (1995) (122)
Time-space trade-offs in a pebble game (1977) (121)
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees (1986) (121)
A Fast Merging Algorithm (1979) (114)
Depth-First Search and Linear Graph Algorithms (Working Paper) (1971) (111)
Sequential access in splay trees takes linear time (1985) (110)
Resistance of digital watermarks to collusive attacks (1998) (109)
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm (1997) (108)
The pebbling problem is complete in polynomial space (1979) (107)
On a Greedy Heuristic for Complete Matching (1981) (107)
Algorithmic aspects of vertex elimination (1975) (104)
Better Approximation Algorithms for the Graph Diameter (2014) (104)
Efficient maximum flow algorithms (2014) (102)
Tight analyses of two local load balancing algorithms (1995) (97)
Notes on Introductory Combinatorics (1983) (96)
Maintaining bridge-connected and biconnected components on-line (1992) (93)
Maximum Flows by Incremental Breadth-First Search (2011) (92)
Planar Point Location Using Persistent Search Trees a (1989) (88)
A Linear Time Solution to the Single Function Coarsest Partition Problem (1985) (86)
Updating a Balanced Search Tree in O(1) Rotations (1983) (86)
Efficient Algorithms for a Family of Matroid Intersection Problems (1984) (84)
Scheduling Opposing Forests (1983) (84)
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance (2011) (82)
A randomized linear-time algorithm for finding minimum spanning trees (1994) (81)
A V log V Algorithm for Isomorphism of Triconnected Planar Graphs (1973) (80)
A fast las vegas algorithm for triangulating a simple polygon (1988) (80)
Finding Dominators in Practice (2004) (79)
Dominating Sets in Planar Graphs (1996) (79)
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems (2008) (74)
A V² Algorithm for Determining Isomorphism of Planar Graphs (1971) (69)
Graph theory and Gaussian elimination. (1975) (69)
Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping (1994) (69)
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem (1992) (65)
Unique maximum matching algorithms (1999) (64)
A simple version of Karzanov's blocking flow algorithm (1984) (63)
On Minimum-Cost Assignments in Unbalanced Bipartite Graphs (2012) (62)
Finding minimum spanning forests in logarithmic time and linear work using random sampling (1996) (62)
Strongly connected orientations of mixed multigraphs (1985) (57)
Use of dynamic trees in a network simplex algorithm for the maximum flow problem (1991) (55)
Self-adjusting top trees (2005) (55)
Finding Strongly Knit Clusters in Social Networks (2008) (54)
CBTree: A Practical Concurrent Self-Adjusting Search Tree (2012) (54)
A New Approach to Incremental Cycle Detection and Related Problems (2011) (53)
Complexity of combinatorial algorithms (1977) (53)
Strict fibonacci heaps (2012) (52)
Linear time bounds for median computations (1972) (52)
Almost-optimum speed-ups of algorithms for bipartite matching and related problems (1988) (50)
A linear-time algorithm for triangulating simple polygons (1986) (50)
Polygon triangulation in O(n log log n) time with simple data-structures (1990) (50)
Short Encodings of Evolving Structures (1992) (49)
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (1985) (48)
A Back-to-Basics Empirical Study of Priority Queues (2014) (48)
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (2015) (48)
Deques with Heap Order (1986) (45)
Purely functional representations of catenable sorted lists (1996) (45)
Persistent lists with catenation via recursive slow-down (1995) (45)
A Good Algorithm for Edge-Disjoint Branching (1974) (45)
An Improved Algorithm for Hierarchical Clustering Using Strong Components (1983) (45)
Finding Dominators Revisited (2004) (44)
A Tight Amortized Bound for Path Reversal (1989) (44)
Finding dominators revisited: extended abstract (2004) (43)
Amortized Analysis of Algorithms for Set Union with Backtracking (1988) (42)
Dynamic trees in practice (2007) (42)
Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations (1984) (40)
Dynamic rectangular intersection with priorities (2003) (39)
Fully persistent lists with catenation (1991) (39)
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem (1991) (39)
Meldable heaps and boolean union-find (2002) (39)
A combinatorial problem which is complete in polynomial space (1975) (37)
Two linear-time algorithms for five-coloring a planar graph (1980) (37)
Finding dominators via disjoint set union (2013) (36)
More Efficient Bottom-Up Multi-Pattern Matching in Trees (1992) (36)
Reference machines require non-linear time to maintain disjoint sets (1977) (36)
Linear Expected-Time Algorithms for Connectivity Problems (1980) (36)
Graph Algorithms in Chemical Computation (1977) (35)
If Piracy Is the Problem, Is DRM the Answer? (2003) (35)
HP Transforms Product Portfolio Management with Operations Research (2010) (34)
Randomized parallel algorithms for trapezoidal diagrams (1992) (34)
Amortized efficiency of list update rules (1984) (33)
Variations of a pebble game on graphs (1978) (33)
The Space Complexity of Pebble Games on Trees (1980) (33)
Rank-Pairing Heaps (2009) (33)
Testing graph connectivity (1974) (32)
Upper and lower bounds on time-space tradeoffs (1979) (31)
An efficient planarity algorithm (1971) (31)
Confluently persistent deques via data structuaral bootstrapping (1993) (31)
Finding a Maximum Clique. (1972) (30)
Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues (1992) (30)
Finding the Triconnected Components of a Graph (1972) (30)
Union-find with deletions (2002) (29)
Solving path problems on directed graphs. (1975) (29)
Robustness and Security of Digital Watermarks (1998) (28)
Purely functional, real-time deques with catenation (1999) (28)
Shortest-path feasibility algorithms: An experimental evaluation (2008) (28)
A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees (1994) (28)
Unique binary search tree representations and equality-testing of sets and sequences (1990) (28)
Dominator tree verification and vertex-disjoint paths (2005) (28)
Prime subprogram parsing of a program (1980) (28)
Complexity of monotone networks for computing conjunctions (1976) (27)
Thin heaps, thick heaps (2008) (27)
Rank-Balanced Trees (2009) (27)
Algorithms for maximum network flow (1986) (26)
Optimal Chain Partitions of Trees (1975) (26)
A Hierarchical Clustering Algorithm Using Strong Components (1982) (26)
Faster Algorithms for Incremental Topological Ordering (2008) (26)
Experimental Evaluation of Parametric Max-Flow Algorithms (2007) (25)
Faster kinetic heaps and their use in broadcast scheduling (2001) (25)
Space Bounds for a Game of Graphs (1976) (24)
A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs (2012) (24)
Dominator Tree Certification and Divergent Spanning Trees (2016) (24)
Simplified Linear-Time Jordan Sorting and Polygon Clipping (1990) (24)
Two new kinds of biased search trees (1983) (22)
Computing minimal spanning subgraphs in linear time (1992) (22)
Planarity Algorithms via PQ-Trees (Extended Abstract) (2008) (21)
Deletion without rebalancing in balanced binary trees (2010) (21)
The CB tree: a practical concurrent self-adjusting search tree (2014) (20)
Simple Confluently Persistent Catenable Lists (2000) (20)
b-Matchings in Trees (1976) (20)
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network (1993) (20)
Planarity Testing in V log V Steps: Extended Abstract (1971) (20)
A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network (1989) (20)
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. (1993) (20)
Iterative algorithms for global flow analysis (1976) (20)
Biased 2-3 trees (1980) (20)
Symbolic Program Analysis in Almost-Linear Time (1982) (19)
Balancing Applied to Maximum Network Flow Problems (2006) (19)
An Experimental Study of Minimum Mean Cycle Algorithms (2009) (18)
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest (1988) (18)
More Efficient Bottom-Up Tree Pattern Matching (1990) (18)
A representation for linear lists with movable fingers (1978) (18)
Algorithm design (1987) (18)
A Randomized Concurrent Algorithm for Disjoint Set Union (2016) (18)
Dominators, Directed Bipolar Orders, and Independent Spanning Trees (2012) (17)
Value-maximizing deadline scheduling and its application to animation rendering (2005) (16)
Transitive Compaction in Parallel via Branchings (1991) (16)
Network Flow Algorithm (1989) (16)
Melding priority queues (2004) (15)
Design and analysis of data structures for dynamic trees (2006) (15)
Dominator Tree Certification and Independent Spanning Trees (2012) (15)
A New Path from Splay to Dynamic Optimality (2019) (15)
Server Allocation Algorithms for Tiered Systems (2005) (14)
Randomized Concurrent Set Union and Generalized Wake-Up (2019) (14)
Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences (1994) (14)
Sorting Jordan sequences in linear time (1985) (14)
Design of data structures for mergeable trees (2006) (14)
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models (2021) (13)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (13)
Edge-disjoint spanning trees, dominators, and depth-first search. (1974) (13)
Culturally-induced information impactedness: a prescription for failure in software ventures (1998) (13)
Disjoint Set Union with Randomized Linking (2014) (13)
Rectilinear Planar Layouts and Bipolar Orientations of (1986) (12)
Notes on Introductory Combinatorics. (1986) (12)
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices (1979) (12)
Shortest Path Feasibility Algorithms: An Experimental Evaluation (2008) (12)
A Linear-Time Algorithm for Finding All Feedback Vertices (1978) (12)
Hollow Heaps (2015) (12)
Polygon triangulation inO(n log logn) time with simple data structures (1992) (12)
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries (2012) (12)
Simple Concurrent Labeling Algorithms for Connected Components (2018) (11)
Fibonacci Heaps with Applications to Parallel Computation (1988) (11)
Deletion without rebalancing in multiway search trees (2009) (11)
Linear-time algorithms for dominators and related problems (2005) (11)
Data structures for mergeable trees (2007) (11)
7. Shortest Paths (1983) (11)
Efficiency of the network simplex algorithm for the maximum flow problem (1989) (10)
Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344 (1977) (10)
Dominator Certification and Independent Spanning Trees: An Experimental Study (2013) (10)
Linear expected-time algorithms for connectivity problems (Extended Abstract) (1980) (10)
Space-Efficient Implementations of Graph Search Methods (1983) (10)
Culturally-induced Information Impactedness: A Prescription For Failure In Software Ventures (1998) (9)
Lower bounds on the lengths of node sequences in directed graphs (1976) (9)
Planarity Algorithms via PQ-Trees (2008) (9)
Input-output decomposition of dynamic systems is NP-complete (1984) (9)
Erratum: Randomized parallel algorithms for trapezoidal diagrams (1992) (9)
Minimum Cost Flows in Graphs with Unit Capacities (2015) (9)
Parallelism in multigrid methods: How much is too much? (1996) (9)
A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem (1984) (8)
Loop Nesting Forests, Dominators, and Applications (2014) (8)
Connected Components on a PRAM in Log Diameter Time (2020) (7)
Efficient algorithms for simple matroid intersection problems (1979) (7)
Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon (1988) (7)
Unstructured multigrid strategies on massively parallel computers: a case for integrated design (1994) (7)
Soft Heaps Simplified (2013) (7)
Two papers on the selection problem: Time Bounds for Selection [by Manual Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan] and Expected Time Bounds for Selection [by Robert W. Floyd and Ronald L. Rivest]. (1973) (7)
Optimal parallel verification of minimum spanning trees in logarithmic time (1994) (7)
Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications (1996) (7)
4. Applications 3. the Algorithm Slicing an Ear in Linear Time (1989) (7)
Fibonacci Heaps Revisited (2014) (7)
Server Allocation Problem for Multi-Tiered Applications (2004) (6)
Amortized rotation cost in AVL trees (2015) (6)
Incremental Topological Ordering and Strong Component Maintenance (2008) (6)
Addendum to “Dominator Tree Certification and Divergent Spanning Trees” (2016) (6)
A linear-time algorithm for finding an ambitus (2011) (5)
Splaying Preorders and Postorders (2019) (5)
Determining Whether a Groupoid is a Group (1972) (5)
Recent Developments in the Complexity of Combinatorial Algorithms (1980) (5)
A Faster Primal Network Simplex Algorithm (1996) (4)
Relaxed Heaps: An Alternative to Fibonacci Heaps, (1987) (4)
Correction: Space Bounds for a Game on Graphs (1977) (4)
Zip Trees (2018) (4)
Toward Efficient Unstructured Multigrid Preprocessing (1997) (4)
5. Linking and Cutting Trees (1983) (4)
Deletion Without Rebalancing in Binary Search Trees (2016) (4)
Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using Grasp (1997) (4)
Simple Confluently Persistent Catenable Lists (Extended Abstract) (1998) (4)
Concurrent disjoint set union (2020) (4)
New systems and algorithms for scalable fault tolerance (2013) (4)
Coding strings by pairs of strings (1985) (3)
Sidestep: Co-designed shiftable memory & software (2012) (3)
6. Minimum Spanning Trees (1983) (3)
New Paths from Splay to Dynamic Optimality (2019) (3)
A Fast Parametric Maximum Flow Algorithm. Revision (1987) (3)
Transitive reduction in parallel via branchings (1988) (3)
Efficiently Generating k-Best Solutions to Procurement Auctions (2009) (3)
A Critical Analysis of Multigrid Methods on Massively Parallel Computers (1993) (3)
Maximum flow techniques for network clustering (2002) (3)
Con uently Persistent Deques via Data-Structural Bootstrapping 1 (1993) (3)
Analysis of Smooth Heaps and Slim Heaps (2021) (3)
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20] (2014) (3)
Pólya’s Theory of Counting (1983) (2)
Heaps Simplified (2009) (2)
8. Network Flows (1983) (2)
Toward Efficient Unstructured Multigrid Preprocessing (Extended Abstract) (1996) (2)
Finding a feasible flow in a strongly connected network (2007) (2)
A New Algorithm for Finding Weak Components (1974) (2)
Problems in data structures and algorithms (2005) (2)
Proc. 26th annual symposium on Foundations of computer science (1985) (2)
Combinations and Permutations (2010) (1)
A Tight Analysis of Slim Heaps and Smooth Heaps (2021) (1)
Analysis of Multigrid Methods on Massively Parallel Computers: Architectural Implications (1)
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
A Note on Fault Tolerant Reachability for Directed Graphs (2015) (1)
Notes on Introductory Combinatorics (reprint of the 1983 edition) (2010) (1)
Principle of Inclusion and Exclusion (2010) (1)
An Analytical Positive Manifold Algorithm for Use With Latent Class Analysis (1971) (1)
Techniques and Amortized Efficiency Of List Ellis Horowitz Update and Paging Rules (1985) (1)
Nested Set Union (2014) (1)
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices☆ (1979) (1)
Minimum-Cost Flows in Unit-Capacity Networks (2017) (1)
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs (2002) (1)
Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems ; CU-CS-425-89 (1989) (1)
Hamiltonian and Eulerian Paths (2010) (1)
Simulating a stack using queues (2022) (1)
A Linear-Time Algorithm for a Special Case of Disjoint Set Union ; CU-CS-261-82 (1984) (1)
Graphs and Networks (Bernard Carré) (1981) (1)
Optimal resizable arrays (2022) (1)
Comparative Analysis of Dynamic Graph Techniques and Data Structure (2019) (1)
2. Disjoint Sets (1983) (0)
Reachability Problems on Directed Graphs (2008) (0)
Computer Group News (1965) (0)
Minimum Spanning Tree in Deterministic Linear Time For Graphs of High Girth (2014) (0)
ELEMENTARY MOVES ON POLYGONAL TRIANGULATIONS OF THE DISK (2006) (0)
Papers on the Selection Problem Time Bounds for Selection Expected Time Bounds for Selection Time Bounds for Selection By (1998) (0)
3.1.1 Triangulating a Monotone Polygon 3.2 Range Minima 2.3.2 Query Retrieval 3.1 All Nearest Smaller Values 2.2 Preex Minima and All Nearest Smaller Values (1998) (0)
Finding Strong Components Using Depth-First Search (2022) (0)
The CB tree: a practical concurrent self-adjusting search tree (2014) (0)
Randomized algorithms for trapezoidal decompositions (1991) (0)
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems (1992) (0)
5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
Data Structures A Locally Adaptive Data (1986) (0)
2 Problems in Data Structures and Algorithms (2005) (0)
An Algorithmic View of the Universe (2012) (0)
Correction to “Space Bounds for a Game on Graphs” by Wolfgang J. Paul, Robert Endre Tarjan and James R. Celoni (2005) (0)
Approximating The Minimum Equivalent Digraph (1995) (0)
Lazy structure sharing for query optimization (1995) (0)
Acknowledgements Design and Analysis of a Data Structure for Repre- Senting Sorted Lists. a Simple Linear-time Algorithm for in Situ Merging. 5 Open Problems (1992) (0)
Deadline scheduling for animation rendering (2005) (0)
A Linear-Time Algorithm for Finding an Ambitus 1 (0)
A Foundation for Proving Splay is Dynamically Optimal (2019) (0)
×øøö Ããòòøø Àààô× Òò Ììììö Í×× Ò Öóóó Blockin Blockin×ø Ë Blockinùððòò (2007) (0)
Programming Data Structures Techniques and Amortized Efficiency Of List (2002) (0)
ALGORITHM DESIGN The quest for efficiency in computational methods yields not only fast algorithms , but also insights that lead to elegant , simple , and general problem-solving methods (2004) (0)
Planarity and the Four-Color Theorem (2010) (0)
A Critical Analysis of MultigridMethods on Massively (1994) (0)
Matchings (Maximum Matchings) (2010) (0)
Update and Paging Rules (1985) (0)
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA (1999) (0)
An optimal work randomized parallel algorithm for minimum spanning trees (1994) (0)
Balancing applied to maximum network flow problems (Extended Abstract) (2006) (0)
M4 1 4 No.2.o>4f- *^^ Working Paper Alfred P. Sloan School of Management Finding Minimum-cost Flows Hy Double Scaling Finding Minimum-cost Flows I$y Double Scaling Finding Minimum-cost Flows by Double Scaling (2008) (0)
A Nearly-Tight Analysis of Multipass Pairing Heaps (2023) (0)
In Search of Good Structure (1998) (0)
Programming Techniques and Data Structures Planar Point Location Using (1999) (0)
The switchyard problem: sorting using networks of queues and stacks (1971) (0)
Ramsey theory graham pdf (2015) (0)
D S ] 2 2 O ct 2 01 5 Hollow Heaps ∗ (2015) (0)
Rithms for Nding a Sparse K-connected Spanning Subgraph of a K-connected Graph", Tenance of a Minimum Spanning Forest in a Dy- Namic Planar Graph". 3.2 a Dynamic 2-edge Connectivity Algorithm (1995) (0)
Theory vs. Practice in the Design and Analysis of Algorithms (2011) (0)
Deprh-first Search .ani) Lmear Gram Algorithms (working Paper) (2008) (0)
A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion (2022) (0)
Results and Problems on Self-adjusting Search Trees and Related Data Structures (2006) (0)
Matchings (Stable Marriages) (2010) (0)
Persistent Search Trees (1986) (0)
Advanced Topics in Algorithms (2012) (0)
00 CD qt INETWORK FLOW ALGORITHMS (0)
Server Allocation Algorithms for Tiered Systems 1 (0)
AN ASSESSMENT OF PROGRAMMING STYLES: ASSIGNMENT-ORIENTED LANGUAGES VERSUS FUNCTIONAL AND APPLICATIVE LANGUAGES Manfred Broy (2021) (0)
Transitive reduction in parallel via branchings. Technical report (1988) (0)
Frederickson, \data Structures for On-line Updating of Minimum Spanning Trees", Siam (2007) (0)
Simple Concurrent Connected Components Algorithms (2022) (0)
4. Search Trees (1983) (0)

This paper list is powered by the following services:

Other Resources About Robert Tarjan

en.wikipedia.org

What Schools Are Affiliated With Robert Tarjan?

Robert Tarjan is affiliated with the following schools:

Image Attributions

Image Source for Robert Tarjan