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