8652 results in Discrete Mathematics, Information Theory and Coding
Information Loss in Riffle Shuffling
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 79-95
-
- Article
- Export citation
On the Circuit Cover Problem for Mixed Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 43-59
-
- Article
- Export citation
Distinct Sums Modulo n and Tree Embeddings
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 35-42
-
- Article
- Export citation
A Note on Vertex-Disjoint Cycles
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 97-102
-
- Article
- Export citation
The ‘Burnside Process’ Converges Slowly
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 21-34
-
- Article
- Export citation
On the Lock-in Probability of Stochastic Approximation
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 11-20
-
- Article
- Export citation
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 11 / Issue 1 / January 2002
- Published online by Cambridge University Press:
- 14 February 2002, pp. 103-111
-
- Article
- Export citation
Weakly Saturated Hypergraphs and Exterior Algebra
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 12 December 2001, pp. 435-451
-
- Article
- Export citation
G-Intersecting Families
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 12 December 2001, pp. 367-384
-
- Article
- Export citation
Spanning Trees in Dense Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 12 December 2001, pp. 397-416
-
- Article
- Export citation
On Minimally 3-Connected Binary Matroids
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 453-461
-
- Article
- Export citation
A Note on Counting Very Different Sequences
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 501-504
-
- Article
- Export citation
Characterization Results Based on a Functional Derivative Approach
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 417-434
-
- Article
- Export citation
On the Independence Number of Random Interval Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 5 / September 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 385-396
-
- Article
- Export citation
Maximum-Sized Matroids with No Minors Isomorphic to U2,5, F7, F−7 or P7
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 531-542
-
- Article
- Export citation
Algorithmic Aspects of a Chip-Firing Game
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 505-529
-
- Article
- Export citation
A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 557-565
-
- Article
- Export citation
On the Edge Distribution of a Graph
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 543-555
-
- Article
- Export citation
Packing Circuits into KN
-
- Journal:
- Combinatorics, Probability and Computing / Volume 10 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 10 December 2001, pp. 463-499
-
- Article
- Export citation
8 - Producing random numbers and letters
-
- Book:
- Codes and Ciphers
- Published online:
- 13 August 2009
- Print publication:
- 06 December 2001, pp 94-109
-
- Chapter
- Export citation