Reports for Author "Tarjan, Robert E."
- TR-597-99 - New Heap Data Structures (1999)
- TR-585-98 - Resistance of Digital Watermarks to Collusive Attacks (1998)
- TR-584-98 - Strictly Functional, Real-Time Deques with Catenation (1998)
- TR-530-96 - Expected Performance of Dijkstra's Shortest Path Algorithm (1996)
- TR-511-96 - Purely Functional Representations of Catenable Sorted Lists (1996)
- TR-503-95 - Dynamic Trees as Search Trees via Euler Tours, Applied to the Network Simplex Algorithm (1995)
- TR-461-94 - Dominating Sets in Planar Graphs (1994)
- TR-457-94 - A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees (1994)
- TR-448-94 - A Critical Analysis of Multigrid Methods on Massively Parallel Computers (1994)
- TR-436-93 - A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees (1993)
- TR-422-93 - Lazy Structure Sharing for Query Optimization (1993)
- TR-420-93 - Confluently Persistent Deques via Data-Structural Bootstrapping (1993)
- TR-381-92 - Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues (1992)
- TR-356-91 - Computing Minimal Spanning Subgraphs in Linear Time (1991)
- TR-338-91 - Improved Algorithms for Bipartite Network Flow (1991)
- TR-327-91 - Polygon Triangulation in $O(N^log^log^N)$ Time with Simple Data Structures (1991)
- TR-318-91 - Randomized Parallel Algorithms for Trapezoidal Diagrams (1991)
- TR-311-91 - Efficient Maximum Flow Algorithms (1991)
- TR-310-91 - Dynamic Perfect Hashing: Upper and Lower Bounds (1991)
- TR-309-91 - An <i>O</i>(<i>m</i> log <i>n</i>)-Time Algorithm for the Maximal Planar Subgraph Problem (1991)
- TR-301-91 - A Linear-Time Algorithm for Finding an Ambitus (1991)
- TR-299-90 - Fully Persistent Lists with Catenation (1990)
- TR-289-90 - Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time (1990)
- TR-268-90 - More Efficient Bottom-Up Tree Pattern Matching (1990)
- TR-267-90 - Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (1989)
- TR-265-90 - Short Encodings of Evolving Structures (1990)
- TR-243-90 - Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph (1990)
- TR-228-89 - Maintaining Bridge-Connected and Biconnected Components Online (1989)
- TR-223-89 - Almost-Optimum Parallel Speed-ups of Algorithms for Bipartite Matching and Related Problems (1989)
- TR-222-89 - Faster Scaling Algorithms for General Graph Matching Problems (1989)
- TR-216-89 - Network Flow Algorithms (1989)
- TR-193-88 - Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem (1988)
- TR-189-88 - Simplified Linear-Time Jordan Sorting and Polygon Clipping (1988)
- TR-187-88 - Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem (1988)
- TR-186-88 - A Parallel Algorithm for Finding A Blocking Flow in an Acyclic Network (1988)
- TR-171-88 - Transitive Reduction in Parallel Via Branchings (1988)
- TR-164-88 - Finding Minimum-Cost Flows by Double Scaling (1988)
- TR-163-88 - A Tight Amortized Bound for Path Reversal (1988)
- TR-157-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon (1988)
- TR-154-88 - Faster Algorithms for the Shortest Path Problem (1988)
- TR-132-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon (1988)
- TR-131-88 - Rotation Distance, Triangulations and Hyperbolic Geometry (1988)
- TR-118-87 - Improved Time Bounds for the Maximum Flow Problem (1987)
- TR-111-87 - Faster Scaling Algorithms for Network Problems (1987)
- TR-109-87 - Relaxed Heaps: An Alternative to Fibronacci Heaps (1987)
- TR-108-87 - A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest (1987)
- TR-107-87 - Finding Minimum-Cost Circulations by Canceling Negative Cycles (1987)
- TR-106-87 - Finding Minimum-Cost Circulations by Successive Approximation (1987)
- TR-105-87 - A Fast Parametric Maximum Flow Algorithm (1987)
- TR-104-87 - Algorithms for Two Bottleneck Optimization Problems (1987)
- TR-103-87 - Amortized Analysis of Algorithms for Set Union with Backtracking (1987)
- TR-081-87 - Solving Minimum-Cost Flow Problems by Successive Approximation (1987)
- TR-069-86 - Designing Algorithms (1986)
- TR-052-86 - An O(n log log n)-Time Algorithm for Triangulating Simple Polygons (1986)
- TR-050-86 - A New Approach to the Maximum Flow Problem (1986)
- TR-049-86 - One-Processor Scheduling of Tasks with Preferred Starting Times (1986)
- TR-039-86 - Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons (1986)
- TR-038-86 - Three Partition Refinement Algorithms (1986)
- TR-013-85 - Two Streamlined Depth-First Search Algorithms (1985)
- TR-008-85 - The Pairing Heap: A New Form of Self-Adjusting Heap (1985)
- TR-007-85 - Rectilinear Planar Layouts of Planar Graphs and Bipolar Orientations (1985)
- TR-006-85 - Efficient Top-Down Updating of Red-Black Trees (1985)
- TR-005-85 - Planar Point Location Using Persistent Search Trees (1985)
- TR-004-85 - A Locally Adaptive Data Compression Scheme (1985)
- TR-003-85 - Rotation Distance (1985)