( en | de | ru )

 

Disambiguation of "Wegener, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
Highlights aus der Informatik

(Eds.) Springer, (1996)

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.

Ingo Wegener

Wolfgang Ingold

Gert-Ludwig Ingold

Daniel P Ingold

Anna Ingólfsdóttir

 

Other publications of authors with the same name

Bekannte Sortierverfahren und eine HEAPSORT-Variante die QUICKSORT schlägt.. Inform. Spektrum, 13 (6): 321-330 (1990)On the complexity of minimizing the OBDD size for incompletely specified functions., and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 15 (11): 1435-1437 (1996)Randomized Search Heuristics as an Alternative to Exact Optimization.. Logic versus Approximation, volume 3075 of Lecture Notes in Computer Science, page 138-149. Springer, (2004)On the Expected Runtime and the Success Probability of Evolutionary Algorithms.. WG, volume 1928 of Lecture Notes in Computer Science, page 1-10. Springer, (2000)Bounds on the Number of Knight's Tours., , and . Discret. Appl. Math., 74 (2): 171-181 (1997)The critical complexity of all (monotone) Boolean functions and monotone graph properties.. FCT, volume 199 of Lecture Notes in Computer Science, page 494-502. Springer, (1985)Theoretical Aspects of Evolutionary Algorithms.. ICALP, volume 2076 of Lecture Notes in Computer Science, page 64-78. Springer, (2001)Kompendium Theoretische Informatik - eine Ideensammlung. B.G. Teubner Stuttgart, (1996)Theory of Evolutionary Algorithms and Genetic Programming, , , , , and . Advances in Computational Intelligence: Theory and Practice, chapter 5, Springer, (2003)The Complexity of Symmetric Functions in Bounded-Depth Circuits., and . Inf. Process. Lett., 25 (4): 217-219 (1987)