Computational Discrete Mathematics, Advanced Lectures - researchr publication

researchr

You are not signed in
Sign in
Sign up

Helmut Alt, editor, Computational Discrete Mathematics, Advanced Lectures. Volume 2122 of Lecture Notes in Computer Science, Springer, 2001.

Conference: ac

Abstract is missing.

Lattice Paths and DeterminantsMartin Aigner. 1-12 [doi]

The Nearest NeighborHelmut Alt. 13-24 [doi]

Explicit and Implicit Enforcing - Randomized OptimizationBernd Gärtner, Emo Welzl. 25-46 [doi]

Codes over Z::4::Tor Helleseth. 47-55 [doi]

Degree Bounds for Long Paths and Cycles in k-Connected GraphsHeinz Adolf Jung. 56-60 [doi]

Data Structures for Boolean FunctionsChristoph Meinel, Christian Stangier. 61-78 [doi]

Scheduling under Uncertainty: Bounding the Makespan DistributionRolf H. Möhring. 79-97 [doi]

Random Graphs, Random Triangle-Free Graphs, and Random Partial OrdersHans Jürgen Prömel, Anusch Taraz. 98-118 [doi]

Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial ApproachesGünter Rote. 119-135 [doi]

Check Character Systems and Anti-symmetric MappingsRalph-Hardo Schulz. 136-147 [doi]

Algorithms in Pure MathematicsGernot Stroth. 148-158 [doi]

Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low DimensionsGünter M. Ziegler. 159-172 [doi]

runs on WebDSL