PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Wegener, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs.

, and . Inf. Process. Lett., 66 (2): 53-57 (1998)

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.

Jan Wegener University of Stuttgart

Ingo Tischler University of Stuttgart

Ingo Dalcolmo University of Stuttgart

PD Dr. Ingo Hartenbach University of Stuttgart

Univ. -Prof. Dr. Ingo Steinwart University of Stuttgart

 

Other publications of authors with the same name

On the complexity of minimizing the OBDD size for incompletely specified functions., and . IEEE Trans. on CAD of Integrated Circuits and Systems, 15 (11): 1435-1437 (1996)A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs., , and . Evolutionary Computation, 6 (2): 185-196 (1998)On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics., and . Combinatorics, Probability & Computing, 14 (1-2): 225-247 (2005)Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization., , , , , , , , , and 4 other author(s). PPSN, volume 3242 of Lecture Notes in Computer Science, page 21-30. Springer, (2004)Theoretical Aspects of Evolutionary Algorithms.. ICALP, volume 2076 of Lecture Notes in Computer Science, page 64-78. Springer, (2001)On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help., and . ESA, volume 1643 of Lecture Notes in Computer Science, page 184-193. Springer, (1999)Binary Decision Diagrams., , , , , and . Boolean Models and Methods, Cambridge University Press, (2010)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)Properties of Complexity Measures for PRAMs and WRAMs., , , and . MFCS, volume 233 of Lecture Notes in Computer Science, page 230-238. Springer, (1986)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)