Combinatorics, Probability & Computing, Volume 6, 1997
Volume 6, Number 1, March 1997
- Edward A. Bender, E. Rodney Canfield, Zhicheng Gao, L. Bruce Richmond: Submap Density and Asymmetry Results for Two Parameter Map Families. 17-25
- Laurent Decreusefond, Gilles Zémor: On the Error-Correcting Capabilities of Cycle Codes of Graphs. 27-38
- Tristan Denley: On a Result of Lemke and Kleitman. 39-43
- Kimmo Eriksson: Autocorrelation and the Enumeration of Strings Avoiding a Fixed String. 45-48
- Andrew S. Greenhalgh: A Model for Random Random-Walks on Finite Groups. 49-56
- Ulrich Martin Hirth: Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law. 57-77
- Colin McDiarmid: Centering Sequences with Bounded Differences. 79-86
- Dudley Stark: Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. 87-105
- Pou-Lin Wu: An Upper Bound on the Number of Edges of a 2-Connected Graph. 107-113
- Raphael Yuster: Independent Transversals and Independent Coverings in Sparse Partite Graphs. 115-125
Volume 6, Number 2, June 1997
- Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely: Intersecting Systems. 127-137
- S. Alesker: A Remark on the Szarek-Talagrand Theorem. 139-144
- Noga Alon: On the Edge-Expansion of Graphs. 145-152
- Peter J. Grabner, Helmut Prodinger: Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution. 179-183
- Ulrich Martin Hirth: From GEM back to Dirichlet via Hoppe's Urn. 185-195
- Luc Pronzato, Henry P. Wynn, Anatoly A. Zhigljavsky: Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms. 205-229
- Van H. Vu: On a Theorem of Ganter. 247-254
Volume 6, Number 3, September 1997
- Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. 255-261
- Neil J. Calkin: Dependent Sets of Constant Weight Binary Vectors. 263-271
- Charles M. Grinstead: On Medians of Lattice Distributions and a Game with Two Dice. 273-294
- Roland Häggkvist, Jeannette Janssen: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. 295-313
- Jennie C. Hansen: Limit Laws for the Optimal Directed Tree with Random Costs. 315-335
- Michael Krivelevich: Triangle Factors in Random Graphs. 337-347
- László A. Székely: Crossing Numbers and Hard Erdös Problems in Discrete Geometry. 353-358
- Ekkehard Weineck: Log-Concavity and the Spectral Gap of Stochastic Matrices. 371-379
Volume 6, Number 4, December 1997
- Hervé Daudé, Philippe Flajolet, Brigitte Vallée: An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. 397-433
- Nabil Kahale: Large Deviation Bounds for Markov Chains. 465-474
- Ulrich Matthias: Constructive Upper Bounds for the Turán Number. 475-479
- Miroslav Tanushev, Richard Arratia: A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains. 493-496
- Carsten Thomassen: The Zero-Free Intervals for Chromatic Polynomials of Graphs. 497-506
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-04T225754 by the dblp team