( en | de | ru )

 

Disambiguation of "Wegener, Ingo"

Author of the publication

copydeleteadd this publication to your clipboard
Komplexitätstheorie

. Springer, (2003)

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

Switching Functions Whose Monotone Complexity Is Nearly Quadratic. STOC, page 143-149. ACM, (1978)The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions.. WG, volume 790 of Lecture Notes in Computer Science, page 252-263. Springer, (1993)Simulated Annealing Beats Metropolis in Combinatorial Optimization.. ICALP, volume 3580 of Lecture Notes in Computer Science, page 589-601. Springer, (2005)Fitness Landscapes Based on Sorting and Shortest Paths Problems., , and . PPSN, volume 2439 of Lecture Notes in Computer Science, page 54-63. Springer, (2002)Komplexitätstheorie. Springer, (2003)BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small). Theoretical Computer Science, 118 (1): 81 - 98 (1993)The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities.. Math. Oper. Res., 5 (3): 373-380 (1980)Branching Programs and Binary Decision Diagrams. SIAM, (2000)On the Complexity of Slice Functions.. MFCS, volume 176 of Lecture Notes in Computer Science, page 553-561. Springer, (1984)Komplexitätstheorie: Grenzen der Effizienz von Algorithmen. Springer, (2003)