Chapter 8: Sorting in Linear Time

| < Day Day Up > |

# List of Corollaries

## Chapter 8: Sorting in Linear Time

Corollary 8.2

## Chapter 11: Hash Tables

Corollary 11.4
Corollary 11.7
Corollary 11.11
Corollary 11.12

## Chapter 16: Greedy Algorithms

Corollary 16.9

## Chapter 19: Binomial Heaps

Corollary 19.2

## Chapter 20: Fibonacci Heaps

Corollary 20.4

## Chapter 21: Data Structures for Disjoint Sets

Corollary 21.5

## Chapter 22: Elementary Graph Algorithms

Corollary 22.4
Corollary 22.8: (Nesting of Descendants' Intervals)
Corollary 22.15

## Chapter 23: Minimum Spanning Trees

Corollary 23.2

## Chapter 24: Single-Source Shortest Paths

Corollary 24.3
Corollary 24.7
Corollary 24.12: (No-path property)

## Chapter 25: All-Pairs Shortest Paths

## Chapter 26: Maximum Flow

Corollary 26.4
Corollary 26.6
Corollary 26.12
Corollary 26.22: (Bound on relabel operations)
Corollary 26.26

## Chapter 28: Matrix Operations

Corollary 28.3
Corollary 28.12

## Chapter 29: Linear Programming

Corollary 29.9

## Chapter 30: Polynomials and the FFT

Corollary 30.4

## Chapter 31: Number-Theoretic Algorithms

Corollary 31.3
Corollary 31.4
Corollary 31.5
Corollary 31.16
Corollary 31.18
Corollary 31.19
Corollary 31.21
Corollary 31.22
Corollary 31.25
Corollary 31.26
Corollary 31.28
Corollary 31.29
Corollary 31.35

## Chapter 32: String Matching

Corollary 32.7

## Chapter 35: Approximation Algorithms

Corollary 35.5

## Appendix C: Counting and Probability

Corollary C.3
Corollary C.5
Corollary C.6
Corollary C.7
Corollary C.9

| < Day Day Up > |