| Series |
Lecture notes in computer science ; 2122
Lecture notes in computer science 2122. ^A466336
|
| Contents |
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. |
| Bibliography note | Includes bibliographical references and index. |
| Other forms | Also available via the World Wide Web. |
| LCCN | 2001055072 |
| ISBN | 3540427759 (pbk. : acid-free paper) |
