Volume 13,
Number 1,
January 2004
- Magnus Bordewich:
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs.
1-16 BibTeX
- Ehud Friedgut:
Influences in Product Spaces: KKL and BKKKL Revisited.
17-29 BibTeX
- Hans Garmo, Svante Janson, Michal Karonski:
On Generalized Random Railways.
31-35 BibTeX
- André E. Kézdy, Hunter S. Snevily:
Polynomials that Vanish on Distinct nth Roots of Unity.
37-59 BibTeX
- Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
The Turán Theorem for Random Graphs.
61-91 BibTeX
- Daniela Kühn, Deryk Osthus:
Large Topological Cliques in Graphs Without a 4-Cycle.
93-102 BibTeX
- Robert Parviainen:
Random Assignment with Integer Costs.
103-113 BibTeX
- Béla Bollobás:
How Sharp is the Concentration of the Chromatic Number?
115-117 BibTeX
- Imre Leader:
Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp.
119-121 BibTeX
- Alexander D. Scott:
Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp.
122 BibTeX
Volume 13,
Number 2,
March 2004
Volume 13,
Number 3,
May 2004
- Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct Distances in Three and Higher Dimensions.
283-293 BibTeX
- Geoffrey Atkinson, Alan M. Frieze:
On the b-Independence Number of Sparse Random Graphs.
295-309 BibTeX
- Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Longest Paths in Circular Arc Graphs.
311-317 BibTeX
- Colin Cooper, Alan M. Frieze:
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence.
319-337 BibTeX
- Steven N. Evans:
Embedding a Markov Chain into a Random Walk on a Permutation Group.
339-351 BibTeX
- Don R. Hush, Clint Scovel:
Fat-Shattering of Affine Functions.
353-360 BibTeX
- Daniela Kühn, Deryk Osthus:
Subdivisions of Kr+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth.
361-371 BibTeX
- Gregory L. McColm:
Threshold Functions for Random Graphs on a Line Segment.
373-387 BibTeX
- Shakhar Smorodinsky, Micha Sharir:
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles.
389-411 BibTeX
- Andrew Thomason:
Two Minor Problems.
412 BibTeX
Volume 13,
Number 4-5,
Juli 2004
Research Articles
Paper
- Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
And/Or Trees Revisited.
475-497
Electronic Edition (link) BibTeX
- Benoit Daireaux, Brigitte Vallée:
Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm.
499-536
Electronic Edition (link) BibTeX
- Olivier Dubois, Guy Louchard, Jacques Mandler:
Additive Decompositions, Random Allocations, and Threshold Phenomena.
537-575
Electronic Edition (link) BibTeX
- Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
Boltzmann Samplers for the Random Generation of Combinatorial Structures.
577-625
Electronic Edition (link) BibTeX
- Predrag R. Jelenkovic, Ana Radovanovic:
Optimizing LRU Caching for Variable Document Sizes.
627-643
Electronic Edition (link) BibTeX
- Olgica Milenkovic, Kevin J. Compton:
Probabilistic Transforms for Combinatorial Urn Models.
645-675
Electronic Edition (link) BibTeX
- Kate Morris, Alois Panholzer, Helmut Prodinger:
On Some Parameters in Heap Ordered Trees.
677-696
Electronic Edition (link) BibTeX
- Michel Nguyen The:
Area and Inertial Moment of Dyck Paths.
697-716
Electronic Edition (link) BibTeX
- Alois Panholzer:
Distribution of the Steiner Distance in Generalized M-ary Search Trees.
717-733
Electronic Edition (link) BibTeX
- Robin Pemantle, Mark C. Wilson:
Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety.
735-761
Electronic Edition (link) BibTeX
- Werner Schachinger:
Concentration of Size and Path Length of Tries.
763-793
Electronic Edition (link) BibTeX
Volume 37,
Number 6,
November 2004
Paper
Problem Section
Book Reviews
Copyright © Wed Jun 4 19:06:06 2008
by Michael Ley (ley@uni-trier.de)
