Volume 9,
Number 1-2,
August-September 1996
- Laurent Alonso, Philippe Chassaing, René Schott:
The average complexity of a coin-weighing problem.
1-14
- József Beck:
Foundations of positional games.
15-47
- Neil J. Calkin:
Dependent sets of constant weight vectors in GF(q).
49-53
- Fan R. K. Chung, Ronald L. Graham, S.-T. Yau:
On sampling with Markov chains.
55-77
- Robert P. Dobrow, Robert T. Smythe:
Poisson approximations for functionals of random trees.
79-92
- Wenceslas Fernandez de la Vega:
The largest induced tree in a sparse random graph.
93-97
- Anna Gál, Avi Wigderson:
Boolean complexity classes vs. their arithmetic analogs.
99-111
- Hans Garmo:
Random railways modeled as random 3-regular graphs.
113-136
- Erhard Godehardt, Jerzy Jaworski:
On the connectivity of a random interval graph.
137-161
- Thomas Hofmeister, Hanno Lefmann:
A combinatorial design approach to MAXCUT.
163-175
- Alexander K. Kelmans:
On graphs with the maximum number of spanning trees.
177-192
- János Komlós, Gábor N. Sárközy, Endre Szemerédi:
On the square of a Hamiltonian cycle in dense graphs.
193-211
- Alexandr V. Kostochka:
An intersection theorem for systems of sets.
213-221
- James Gary Propp, David Bruce Wilson:
Exact sampling with coupled Markov chains and applications to statistical mechanics.
223-252
- Nicholas C. Wormald:
The perturbation method and triangle-free random graphs.
253-269
Volume 9,
Number 3,
October 1996
Volume 9,
Number 4,
December 1996
Copyright © Tue Feb 9 19:47:58 2010
by Michael Ley (ley@uni-trier.de)
