Combinatorics, Probability & Computing, Volume 9, 2000
Volume 9, Number 1, 2000
- Van H. Vu: On The Choice Number Of Random Hypergraphs. 79-95
- Michael Krivelevich: The Choice Number Of Dense Random Graphs. 19-26
- David Reimer: Proof Of The Van Den Berg-Kesten Conjecture. 27-32
- C. R. Subramanian: Algorithms For Colouring Random K-Colourable Graphs. 45-77
- Alexander V. Gnedin: A Note On Sequential Selection From Permutations. 13-17
Volume 9, Number 2, 2000
- Lori Fern, Gary Gordon, Jason Leasure, Sharon Pronchik: Matroid Automorphisms And Symmetry Groups. 105-123
- Oliver Riordan: Spanning Subgraphs Of Random Graphs. 125-148
- David G. Wagner: Zeros Of Reliability Polynomials And F-Vectors Of Matroids. 167-190
- Yoav Seginer: The Expected Norm Of Random Matrices. 149-166
- J. Keith Dugdale, Anthony J. W. Hilton: A Sufficient Condition For A Graph To Be The Core Of A Class 2 Graph. 97-104
Volume 9, Number 3, 2000
- John Mount: Fast Unimodular Counting. 277-285
- Nikolai N. Kuzjurin: Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings. 265-276
- Alan M. Frieze, Lei Zhao: Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. 241-263
Volume 9, Number 4, 2000
- Margit Voigt: Algorithmic Aspects Of Partial List Colourings. 375-380
- Benjamin Doerr: Linear And Hereditary Discrepancy. 349-354
- Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega: On The Fluctuations Of The Giant Component. 287-304
- Joseph P. S. Kung: Critical Exponents, Colines, And Projective Geometries. 355-362
- Eunice Gogo Mphako: Tutte Polynomials Of Perfect Matroid Designs. 363-367
- Joseph E. Bonin: Involutions Of Connected Binary Matroids. 305-308
- Jacques Verstraëte: On Arithmetic Progressions Of Cycle Lengths In Graphs. 369-373
Volume 9, Number 5, 2000
- Olle Häggström, Jeffrey E. Steif: Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. 425-439
- Péter Gács: The Clairvoyant Demon Has A Hard Task. 421-424
- Jean-Pierre Tillich, Gilles Zémor: Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. 465-479
Volume 9, Number 6, 2000
- Pawel Hitczenko, Gilbert Stengle: Expected Number Of Distinct Part Sizes In A Random Integer Composition. 519-527
- Robin Thomas, Jan Mcdonald Thomson: Excluding Minors In Nonplanar Graphs Of Girth At Least Five. 573-585
- Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna: Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. 489-511
- Marianne Månsson: On Compound Poisson Approximation For Sequence Matching. 529-548
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team