Author of the publication

Theoretische Informatik - eine algorithmenorientierte Einführung.

. Leitfäden und Monographien der Informatik Teubner, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the complexity of branching programs and decision trees for clique functions.. J. ACM, 35 (2): 461-471 (1988)Exact OBDD Bounds for some Fundamental Functions., , and . Electronic Colloquium on Computational Complexity (ECCC), (2007)Detecting high-order interactions of single nucleotide polymorphisms using genetic programming., , , , and . Bioinformatics, 23 (24): 3280-3288 (2007)Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams, and . Electronic Colloquium on Computational Complexity (ECCC), (1995)The Number of Knight's Tours Equals 33,439,123,484,294 - Counting with Binary Decision Diagrams, and . Electronic Colloquium on Computational Complexity (ECCC), (1995)Simulated Annealing Beats Metropolis in Combinatorial Optimization. Electronic Colloquium on Computational Complexity (ECCC), (2004)New Results on the Complexity of the Middle Bit of Multiplication., and . Computational Complexity, 16 (3): 298-323 (2007)Optimal ordered binary decision diagrams for read-once formulas., , and . Discrete Applied Mathematics, 103 (1-3): 237-258 (2000)Prime implicants and parallel complexity.. Bulletin of the EATCS, (1988)The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help., and . Algorithmica, 34 (1): 47-66 (2002)