


default search action
Combinatorics, Probability & Computing, Volume 9, 2000
Volume 9, Number 1, 2000
- Hanna D. Robalewska, Nicholas C. Wormald:
Random Star Processes. 33-43 - Noga Alon, Benny Sudakov:
Bipartite Subgraphs And The Smallest Eigenvalue. 1-12 - 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
- Miguel Angel Fiol, Ernest Garriga, J. Luis A. Yebra:
On Twisted Odd Graphs. 227-240 - John Mount:
Fast Unimodular Counting. 277-285 - Noga Alon, Miklós Bóna, Joel Spencer:
Packing Ferrers Shapes. 205-211 - Nikolai N. Kuzjurin:
Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings. 265-276 - Martin Anthony, Peter L. Bartlett:
Function Learning From Interpolation. 213-225 - 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 - Yair Caro, Raphael Yuster:
Dominating A Family Of Graphs With Small Connected Subgraphs. 309-313 - Benjamin Doerr:
Linear And Hereditary Discrepancy. 349-354 - Sándor Csörgo, Wei Biao Wu:
Random Graphs And The Strong Convergence Of Bootstrap Means. 315-347 - 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
- Shai Ben-David, Leonid Gurvits:
A Note On Vc-Dimension And Measure Of Sets Of Reals. 391-405 - Olle Häggström, Jeffrey E. Steif:
Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. 425-439 - Noga Alon, János Körner, Angelo Monti:
String Quartets In Binary. 381-390 - Péter Gács:
The Clairvoyant Demon Has A Hard Task. 421-424 - Joseph E. Bonin, Talmage James Reid:
Simple Matroids With Bounded Cocircuit Size. 407-419 - Gregory F. Lawler, Emily E. Puckette:
The Intersection Exponent For Simple Random Walk. 441-464 - 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 - Oliver Riordan, Alex Selby:
The Maximum Degree Of A Random Graph. 549-572 - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Restricted Sums. 513-518 - Noga Alon, Emanuela Fachini, János Körner:
Locally Thin Set Families. 481-488

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.