Credited in the library
Robert Tarjan
In the library
- Theory & AlgorithmsA Data Structure for Dynamic TreesSupplied bibliography entry.
- Theory & AlgorithmsA Locally Adaptive Data Compression SchemeSupplied bibliography entry.
- Theory & AlgorithmsAmortized Computational ComplexitySupplied bibliography entry.
- Theory & AlgorithmsAmortized Efficiency of List Update and Paging RulesSupplied bibliography entry.
- Theory & AlgorithmsData Structures and Network AlgorithmsSupplied bibliography entry.
- Theory & AlgorithmsDeletion in Scapegoat TreesSupplied bibliography entry.
- Theory & AlgorithmsDepth-First Search and Linear Graph AlgorithmsSupplied bibliography entry.
- Theory & AlgorithmsEfficient Planarity TestingSupplied bibliography entry.
- Theory & AlgorithmsFibonacci Heaps and Their UsesSupplied bibliography entry.
- Theory & AlgorithmsMaking Data Structures PersistentSupplied bibliography entry.
- Theory & AlgorithmsPlanar Point Location Using Persistent Search TreesSupplied bibliography entry.
- Theory & AlgorithmsSelf-Adjusting Binary Search TreesSupplied bibliography entry.
- Theory & AlgorithmsThe Pairing HeapSupplied bibliography entry.
- Theory & AlgorithmsWorst-Case Analysis of Set Union AlgorithmsSupplied bibliography entry.