Volume 7,
Number 1,
1987
- Noga Alon, Ravi B. Boppana:
The monotone circuit complexity of Boolean functions.
1-22 BibTeX
- Anders Björner, Peter Frankl, Richard P. Stanley:
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.
23-34 BibTeX
- Béla Bollobás, Andrew Thomason:
Threshold functions.
35-38 BibTeX
- Andreas W. M. Dress, László Lovász:
On some combinatorial properties of algebraic matroids.
39-48 BibTeX
- András Frank, Éva Tardos:
An application of simultaneous Diophantine approximation in combinatorial optimization.
49-65 BibTeX
- Peter Frankl:
On a pursuit game on Cazley graphs.
67-70 BibTeX
- Joel Friedman, Nicholas Pippenger:
Expanding graphs contain all small trees.
71-76 BibTeX
- J. I. Hall:
A local characterization of the Johnson scheme.
77-85 BibTeX
- Eugene M. Luks:
Computing the composition factors of a permutation group in polynomial time.
87-99 BibTeX
- Ketan Mulmuley:
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field.
101-104 BibTeX
- Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching is as easy as matrix inversion.
105-113 BibTeX
- Hans Jürgen Prömel, B. L. Rothschild:
A canonical restricted version of van der Waerden's theorem.
115-119 BibTeX
- Eli Shamir, Joel Spencer:
Sharp concentration of the chromatic number on random graphs Gn, p.
121-129 BibTeX
- Micha Sharir:
Almost linear upper bounds on the length of general Davenport-Schinzel sequences.
131-143 BibTeX
- Carsten Thomassen:
On digraphs with no two disjoint directed cycles.
145-150 BibTeX
Volume 7,
Number 2,
1987
Volume 7,
Number 3,
1987
Volume 7,
Number 4,
1987
Copyright © Sat May 16 23:53:10 2009
by Michael Ley (ley@uni-trier.de)
