Reference Work Entry

Fully Dynamic Connectivity: Upper and Lower Bounds
2000; Thorup

Giuseppe F. Italiano

2008, Encyclopedia of Algorithms, Part 6, Pages 1-99

• View HTML

Reference Work Entry

Geometric Spanners
2002; Gudmundsson, Levcopoulos, Narasimhan

Joachim Gudmundsson, Giri Narasimhan and Michiel Smid

2008, Encyclopedia of Algorithms, Part 7, Pages 1-99

• View HTML

Reference Work Entry

Quantum Search
1996; Grover

Lov K. Grover and Ben W. Reichardt

2008, Encyclopedia of Algorithms, Part 16, Pages 1-99

• View HTML

Reference Work Entry

Randomized Parallel Approximations to Max Flow
1991; Serna, Spirakis

Maria Serna

2008, Encyclopedia of Algorithms, Part 17, Pages 1-99

• View HTML

Reference Work Entry

Learning Automata
2000; Beimel, Bergadano, Bshouty, Kushilevitz, Varricchio

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz and Stefano Varricchio

2008, Encyclopedia of Algorithms, Part 11, Pages 1-99

• View HTML

Reference Work Entry

Local Approximation of Covering and Packing Problems
2003–2006; Kuhn, Moscibroda, Nieberg, Wattenhofer

Fabian Kuhn

2008, Encyclopedia of Algorithms, Part 11, Pages 1-99

• View HTML

Reference Work Entry

Sparsest Cut
2004; Arora, Rao, Vazirani

Shuchi Chawla

2008, Encyclopedia of Algorithms, Part 18, Pages 1-99

• View HTML

Reference Work Entry

Minimum Geometric Spanning Trees
1999; Krznaric, Levcopoulos, Nilsson

Christos Levcopoulos

2008, Encyclopedia of Algorithms, Part 12, Pages 1-99

• View HTML

Reference Work Entry

Suffix Tree Construction in RAM
1997; Farach-Colton

Jens Stoye

2008, Encyclopedia of Algorithms, Part 18, Pages 1-99

• View HTML