László Babai:
On Lovász' lattice reduction and the nearest lattice point problem. 1-13 Mario Szegedy:
The solution of Graham's greatest common divisor problem. 67-71 Ioan Tomescu:
On the number of paths and cycles for almost all graphs and digraphs. 73-79
Manuel Blum:
Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. 97-108 Sergiu Hart,
Micha Sharir:
Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. 151-178 Peter W. Shor:
the average-case analysis of some on-line algorithms for bin packing. 179-200
Noga Alon:
Covering graphs by the minimum number of equivalence relations. 201-206 Noga Alon:
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. 207-219 Michele Elia:
On the non-existence of Barker sequences. 275-278 Peter Frankl:
Orthogonal vectors in the n-dimensional cube and codes with missing distances. 279-286
Thomas Andreae:
On well-quasi-ordering finite graphs by immersion. 287-298 Stephen Downes:
A completion problem for finite affine planes. 321-325 Wen-Lian Hsu:
Coloring planar perfect graphs by decomposition. 381-385
maintained by
at
Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-17 23:58 CEST by the dblp team