6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
![](https://assets.cambridge.org/97805217/70934/cover/9780521770934.jpg)
The Discrepancy Method
- Randomness and Complexity
-
- Published online:
- 05 October 2013
- Print publication:
- 24 July 2000
Contents
-
- Book:
- The Discrepancy Method
- Published online:
- 05 October 2013
- Print publication:
- 24 July 2000, pp v-x
-
- Chapter
- Export citation
9 - Pseudorandomness
-
- Book:
- The Discrepancy Method
- Published online:
- 05 October 2013
- Print publication:
- 24 July 2000, pp 316-345
-
- Chapter
- Export citation
3 - Lower Bound Techniques
-
- Book:
- The Discrepancy Method
- Published online:
- 05 October 2013
- Print publication:
- 24 July 2000, pp 133-168
-
- Chapter
- Export citation
6 - Complexity Lower Bounds
-
- Book:
- The Discrepancy Method
- Published online:
- 05 October 2013
- Print publication:
- 24 July 2000, pp 228-282
-
- Chapter
- Export citation
Computing ϵ-Free NFA from Regular Expressions in O(n log2(n)) Time
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 4 / July 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 257-277
- Print publication:
- July 2000
-
- Article
- Export citation
Semi-commutations and Partial commutations
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 4 / July 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 307-330
- Print publication:
- July 2000
-
- Article
- Export citation
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 4 / July 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 297-305
- Print publication:
- July 2000
-
- Article
- Export citation
On the Horton-Strahler Number for Combinatorial Tries
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 4 / July 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 279-296
- Print publication:
- July 2000
-
- Article
- Export citation
Fast Unimodular Counting
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 277-285
-
- Article
- Export citation
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 241-263
-
- Article
- Export citation
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 213-255
- Print publication:
- May 2000
-
- Article
- Export citation
Approximation Algorithms for the Traveling Salesman Problem with Range Condition
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 173-181
- Print publication:
- May 2000
-
- Article
- Export citation
Closure under union and composition of iterated rational transductions
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 34 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 15 April 2002, pp. 183-212
- Print publication:
- May 2000
-
- Article
- Export citation
Function Learning from Interpolation
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 213-225
-
- Article
- Export citation
Packing Ferrers Shapes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 205-211
-
- Article
- Export citation
Mixing Time for a Markov Chain on Cladograms
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 191-204
-
- Article
- Export citation
Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 265-276
-
- Article
- Export citation
On Twisted Odd Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 3 / May 2000
- Published online by Cambridge University Press:
- 01 May 2000, pp. 227-240
-
- Article
- Export citation
Zeros of Reliability Polynomials and f-vectors of Matroids
-
- Journal:
- Combinatorics, Probability and Computing / Volume 9 / Issue 2 / March 2000
- Published online by Cambridge University Press:
- 01 March 2000, pp. 167-190
-
- Article
- Export citation