Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 8, 1999
Volume 8, Number 4, 1999
- Sven Erick Alm, John C. Wierman:
Inequalities For Means Of Restricted First-Passage Times In Percolation Theory. 307-315 - Robert P. Dobrow, James Allen Fill:
Total Path Length For Random Recursive Trees. 317-333 - Angelika Steger, Nicholas C. Wormald:
Generating Random Regular Graphs Quickly. 377-396 - Vojtech Rödl, Andrzej Rucinski, Anusch Taraz:
Hypergraph Packing And Graph Embedding. 363-376 - Peter Eichelsbacher, Malgorzata Roos:
Compound Poisson Approximation For Dissociated Random Variables Via Stein's Method. 335-346 - Svante Janson:
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. 347-361 - Rudolf Ahlswede, Ning Cai:
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. 301-305
Volume 8, Number 5, 1999
- Isa Cakir, Ourania Chryssaphinou, Marianne Månsson:
On A Conjecture By Eriksson Concerning Overlap In Strings. 429-440 - Richard Arratia, Andrew D. Barbour, Simon Tavaré:
The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process. 407-416 - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Sets With A Small Subset Sum. 461-466 - Michael Mitzenmacher:
Studying Balanced Allocations With Differential Equations. 473-482 - Stephen Guattery, Frank Thomson Leighton, Gary L. Miller:
The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. 441-460 - Riste Skrekovski:
A Grötzsch-Type Theorem For List Colourings With Impropriety One. 493-507 - Oleg Pikhurko:
The Minimum Size Of Saturated Hypergraphs. 483-492 - Helmut Alt, Ulrich Fuchs, Klaus Kriegel:
On The Number Of Simple Cycles In Planar Graphs. 397-405 - Alexandr V. Kostochka, Jaroslav Nesetril:
Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. 467-472 - Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann:
Sparse 0-1-Matrices And Forbidden Hypergraphs. 417-427
Volume 8, Number 6, 1999
- Jochen Harant, Anja Pruchnewski, Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs. 547-553 - Petros Hadjicostas:
The Asymptotic Proportion Of Subdivisions Of A 2 × 2 Table That Result In Simpson's Paradox. 599 - Dudley Stark:
Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies. 567-598 - Éva Czabarka:
Intersecting Chains In Finite Vector Spaces. 509-528 - Tristan Denley, Talmage James Reid:
On The Number Of Elements In Matroids With Small Circuits Or Cocircuits. 529-537 - Alan Stacey:
Searches On A Binary Tree With Random Edge-Weights. 555-565
a service of 
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 2024-04-22 20:03 CEST 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:
