Theory & AlgorithmsEfficient Planarity TestingJohn Hopcroft & Robert TarjanTheory & AlgorithmsEfficient Planarity TestingJohn Hopcroft & Robert TarjanSupplied bibliography entry.Read now
Theory & AlgorithmsDepth-First Search and Linear Graph AlgorithmsRobert TarjanTheory & AlgorithmsDepth-First Search and Linear Graph AlgorithmsRobert TarjanSupplied bibliography entry.Read now
Theory & AlgorithmsAmortized Computational ComplexityRobert TarjanTheory & AlgorithmsAmortized Computational ComplexityRobert TarjanSupplied bibliography entry.Read now
Theory & AlgorithmsSelf-Adjusting Binary Search TreesDaniel Sleator & Robert TarjanTheory & AlgorithmsSelf-Adjusting Binary Search TreesDaniel Sleator & Robert TarjanSupplied bibliography entry.Read now
Computer ScienceHomotopy Type Theory: Univalent Foundations of MathematicsThe Univalent Foundations ProgramComputer ScienceHomotopy Type Theory: Univalent Foundations of MathematicsThe Univalent Foundations ProgramType theory and proposed foundations for mathematics.Read now
Theory & AlgorithmsFibonacci Heaps and Their UsesMichael Fredman & Robert TarjanTheory & AlgorithmsFibonacci Heaps and Their UsesMichael Fredman & Robert TarjanSupplied bibliography entry.Read now
Theory & AlgorithmsThe Cell Probe Complexity of Dynamic Data StructuresMichael Fredman & Michael SaksTheory & AlgorithmsThe Cell Probe Complexity of Dynamic Data StructuresMichael Fredman & Michael SaksSupplied bibliography entry.Read now
Theory & AlgorithmsLogarithmic Lower Bounds in the Cell-Probe ModelMihai Pătraşcu & Erik DemaineTheory & AlgorithmsLogarithmic Lower Bounds in the Cell-Probe ModelMihai Pătraşcu & Erik DemaineSupplied bibliography entry.Read now
Theory & AlgorithmsUnifying the Landscape of Cell-Probe Lower BoundsMihai PătraşcuTheory & AlgorithmsUnifying the Landscape of Cell-Probe Lower BoundsMihai PătraşcuSupplied bibliography entry.Read now
Theory & AlgorithmsA New Algorithm for Optimal 2-Constraint SatisfactionRyan WilliamsTheory & AlgorithmsA New Algorithm for Optimal 2-Constraint SatisfactionRyan WilliamsSupplied bibliography entry.Read now
Theory & AlgorithmsOn the Complexity of k-SATRussell Impagliazzo & Ramamohan PaturiTheory & AlgorithmsOn the Complexity of k-SATRussell Impagliazzo & Ramamohan PaturiSupplied bibliography entry.Read now
Theory & AlgorithmsWhich Problems Have Strongly Exponential Complexity?Russell Impagliazzo, Ramamohan Paturi, Francis ZaneTheory & AlgorithmsWhich Problems Have Strongly Exponential Complexity?Russell Impagliazzo, Ramamohan Paturi, Francis ZaneSupplied bibliography entry.Read now