default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 11, 2002
Volume 11, Number 1, 2002
- André E. Kézdy
, Hunter S. Snevily:
Distinct Sums Modulo N And Tree Embeddings. 35-42 - Van H. Vu:
A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs. 103-111 - Jacques Verstraëte:
A Note On Vertex-Disjoint Cycles. 97-102 - Leslie Ann Goldberg, Mark Jerrum:
The "Burnside Process" Converges Slowly. 21-34 - Vivek S. Borkar:
On The Lock-In Probability Of Stochastic Approximation. 11-20 - Noga Alon, Bojan Mohar:
The Chromatic Number Of Graph Powers. 1-10 - Orlando Lee, Yoshiko Wakabayashi:
On The Circuit Cover Problemfor Mixed Graphs. 43-59 - Dudley Stark, Ayalvadi Ganesh, Neil O'Connell:
Information Loss In Riffle Shuffling. 79-95 - Eugenijus Manstavicius:
Mappings On Decomposable Combinatorial Structures: Analytic Approach. 61-78
Volume 11, Number 2, 2002
- Bogdan Oporowski:
Partitioning Matroids With Only Small Cocircuits. 191-197 - Vladimir Nikiforov:
Some Inequalities For The Largest Eigenvalue Of A Graph. 179-189 - Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
A Ratio Inequality For Binary Trees And The Best Secretary. 149-161 - Colin Cooper, Alan M. Frieze:
Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. 129-133 - Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum:
Convergence Of The Iterated Prisoner's Dilemma Game. 135-147 - Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On A Square Packing Problem. 113-127 - John M. Talbot:
Lagrangians Of Hypergraphs. 199-216 - Colin McDiarmid:
Concentration For Independent Permutations. 163-178
Volume 11, Number 3, 2002
- Dhruv Mubayi:
Some Exact Results And New Asymptotics For Hypergraph Turán Numbers. 299-309 - Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald:
Permutation Pseudographs And Contiguity. 273-298 - Edward Dobson:
Packing Trees Into The Complete Graph. 263-272 - Colin Cooper, Alan M. Frieze, Bruce A. Reed:
Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. 249-261 - Sven Erick Alm, Gregory B. Sorkin:
Exact Expectations And Distributions For The Random Assignment Problem. 217-248 - Gary K. Schwartz:
On The Automorphism Groups Of Dowling Geometries. 311-321
Volume 11, Number 4, 2002
- Edward Dobson:
Constructing Trees In Graphs Whose Complement Has No K2, S. 343-347 - Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Quickselect And The Dickman Function. 353-371 - Klaus Dohmen:
Bonferroni-Type Inequalities Via Chordal Graphs. 349-351 - James G. Oxley, Dominic J. A. Welsh:
Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients. 403-426 - Marianne Månsson:
Pattern Avoidance And Overlap In Strings. 393-402 - András Telcs:
A Note On Rough Isometry Invariance Of Resistance. 427-432 - Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. 373-392 - Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan:
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. 323-341
Volume 11, Number 5, 2002
- Jim Pitman:
Poisson-Dirichlet And Gem Invariant Distributions For Split-And-Merge Transformations Of An Interval Partition. 501-514 - Michael Krivelevich, Benny Sudakov, Van H. Vu:
A Sharp Threshold For Network Reliability. 465-474 - Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress:
Permutations With Restricted Cycle Structure And An Algorithmic Application. 447-464 - Samuel Kutin:
Constructing Large Set Systems With Given Intersection Sizes Modulo Composite Numbers. 475-486 - Sven Erick Alm, Robert Parviainen:
Lower And Upper Bounds For The Time Constant Of First-Passage Percolation. 433-445 - Daniel C. Slilaty:
Matroid Duality From Topological Duality In Surfaces Of Nonnegative Euler Characteristic. 515-528 - Elchanan Mossel:
The Minesweeper Game: Percolation And Complexity. 487-499 - Wolfgang Stadje:
The Residues Modulo M Of Products Of Random Integers. 529-540
Volume 11, Number 6, 2002
- Christian M. Reidys:
Distances In Random Induced Subgraphs Of Generalized N-Cubes. 599-605 - Joseph Samuel Myers:
Graphs Without Large Complete Minors Are Quasi-Random. 571-585 - Ralph Neininger:
The Wiener Index Of Random Trees. 587-597 - Stasys Jukna, Georg Schnitger:
Triangle-Freeness Is Hard To Detect. 549-569 - John C. Wierman:
An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability. 629-643 - Patrick Bellenbaum, Reinhard Diestel:
Two Short Proofs Concerning Tree-Decompositions. 541-547 - Dudley Stark:
Information Loss In Top To Random Shuffling. 607-627
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.
last updated on 2025-12-12 01:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
