TY  - BOOK
AU  - Alt,Helmut
TI  - Computational discrete mathematics: advanced lectures 
T2  - Lecture notes in computer science,
SN  - 3540427759 (pbk. : acid-free paper)
AV  - QA39.3 .C66 2001
U1  - 510 21
PY  - 2001///
CY  - Berlin, New York
PB  - Springer
KW  - Mathematics
KW  - Computer science
N1  - Includes bibliographical references and index; Lattice paths and determinants / Martin Aigner -- The nearest neighbor / Helmut Alt -- Explicit and implicit enforcing -- randomized optimization / Bernd Gärtner and Emo Welzl -- Codes over Z₄ / Tor Helleseth -- Degree bounds for long paths and cycles in k-connected graphs / Heinz Adolf Jung -- Data strucutres for Boolean functions / Christoph Meinel and Christian Stangier -- Scheduling under uncertainty : bounding the makespan distribution / Rolf H. Möhring -- Random graphs, random triangle-free graphs, and random partial orders / Hans Jürgen Prömel and Anusch Taraz -- Division-free algorithms for the determinant and the Pfaffian : algebraic and combinatorial approaches / Günter Rote -- Check character systems and anti-symmetric mappings / Ralph-Hardo Schulz -- Algorithms in pure mathematics / Gernot Stroth -- Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions / Günter M. Ziegler
UR  - http://catdir.loc.gov/catdir/enhancements/fy0816/2001055072-d.html
ER  -