


default search action
Computational Discrete Mathematics 2001
- Helmut Alt:

Computational Discrete Mathematics, Advanced Lectures. Lecture Notes in Computer Science 2122, Springer 2001, ISBN 3-540-42775-9 - Martin Aigner:

Lattice Paths and Determinants. 1-12 - Helmut Alt:

The Nearest Neighbor. 13-24 - Bernd Gärtner, Emo Welzl:

Explicit and Implicit Enforcing - Randomized Optimization. 25-46 - Tor Helleseth:

Codes over Z4. 47-55 - Heinz Adolf Jung:

Degree Bounds for Long Paths and Cycles in k-Connected Graphs. 56-60 - Christoph Meinel, Christian Stangier:

Data Structures for Boolean Functions. 61-78 - Rolf H. Möhring:

Scheduling under Uncertainty: Bounding the Makespan Distribution. 79-97 - Hans Jürgen Prömel, Anusch Taraz:

Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. 98-118 - Günter Rote:

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. 119-135 - Ralph-Hardo Schulz:

Check Character Systems and Anti-symmetric Mappings. 136-147 - Gernot Stroth:

Algorithms in Pure Mathematics. 148-158 - Günter M. Ziegler:

Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. 159-172

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














