Volume 31,
Number 1,
August 2007
Volume 31,
Number 2,
September 2007
- Noga Alon, Michael R. Capalbo:
Sparse universal graphs for bounded-degree graphs.
123-133
- Fabio Martinelli, Alistair Sinclair, Dror Weitz:
Fast mixing for independent sets, colorings, and other models on trees.
134-172
- Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi:
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas.
173-185
- Anna Rudas, Bálint Tóth, Benedek Valkó:
Random trees and general branching processes.
186-202
- Alois Panholzer, Helmut Prodinger:
Level of nodes in increasing trees revisited.
203-226
- Michael H. Albert:
On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation.
227-238
- Béla Bollobás, Svante Janson, Oliver Riordan:
Spread-out percolation in Rd.
239-246
- Aaron D. Jaggard:
An almost-bijective proof of an asymptotic property of partitions.
247-250
Volume 31,
Number 3,
October 2007
- Thomas P. Hayes, Eric Vigoda:
Variable length path coupling.
251-272
- Qunqiang Feng, Chun Su:
The structure and distances in Yule recursive trees.
273-287
- Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani:
Counting connected graphs and hypergraphs via the probabilistic method.
288-329
- Mihyun Kang, Taral Guldahl Seierstad:
Phase transition of the minimum degree random multigraph process.
330-353
- Marek Biskup, Lincoln Chayes, S. A. Smith:
Large-deviations/thermodynamic approach to percolation on the complete graph.
354-370
- Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the distance to a monotone function.
371-383
- Noga Alon, Toshiya Itoh, Tatsuya Nagatani:
On (epsilon, k)-min-wise independent permutations.
384-389
Volume 31,
Number 4,
December 2007
Copyright © Thu Nov 26 19:45:46 2009
by Michael Ley (ley@uni-trier.de)
