Wegener, Ingo.
Wegener, Ingo, 1950-2008
Ingo Wegener
Wegener, Ingo, 1950-
VIAF ID: 69006430 ( Personal )
Permalink: http://viaf.org/viaf/69006430
Preferred Forms
- 100 0 _ ‡a Ingo Wegener
- 200 _ | ‡a Wegener ‡b Ingo
- 100 1 _ ‡a Wegener, Ingo
-
-
- 100 1 _ ‡a Wegener, Ingo
-
-
-
- 100 1 _ ‡a Wegener, Ingo
-
- 100 1 _ ‡a Wegener, Ingo ‡d 1950-2008
- 100 1 _ ‡a Wegener, Ingo ‡d 1950-2008
-
-
-
4xx's: Alternate Name Forms (18)
5xx's: Related Names (6)
- 551 _ _ ‡a Bielefeld
- 551 _ _ ‡a Bremen
- 551 _ _ ‡a Dortmund
- 551 _ _ ‡a Frankfurt am Main
- 510 2 _ ‡a Universität Dortmund ‡b Fachbereich Informatik ‡b Lehrstuhl 2 ‡e Affiliation
- 510 2 _ ‡a Universität Dortmund ‡b Lehrstuhl für Informatik 1
Works
Title | Sources |
---|---|
Advances in computational intelligence, 2002: | |
Automata, languages and programming : 33rd international colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006 : proceedings. | |
Branching programs and binary decision diagrams : theory and applications | |
comparison of free BDDs and transformed BDDs | |
complexity of boolean functions | |
Complexity theory exploring the limits of efficient algorithms | |
covering problem for finite boolean lattices | |
Efficient simulation of circuits by EREW PRAMs | |
Effiziente Algorithmen für grundlegende Funktionen mit zahlreichen Aufgaben und Beispielen | |
Fitness landscapes based on sorting and shortest path problems | |
Functions that have read once branching programs of quadratic size are not necessarily testable | |
Graph driven BDD's - a new data structure for boolean functions | |
Highlights aus der Informatik | |
How far can we count in constant depth with a polylogarithmic number of gates? | |
How to compute minimal sums for totally symmetric functions | |
Improving the variable ordering of OBDDs is NP-complete | |
Ising model on the ring mutation versus recombination | |
Ist die Informatiksprache patriarchalisiert? | |
Komplexitätstheorie | |
Komplexitätstheorie : Grenzen der Effizienz von Algorithmen | |
Minimal polynomials for the conjunction of functions on disjoint variables can be very simple | |
Minimum spanning trees made easier via multi-objective optimization | |
natural and simple function wich is hard for all evolutionary algorithms | |
new framework for the valuation of algorithms for black box optimization | |
note on the relations between critical and sensitive complexity | |
number of knight's tours equals 33,439,123,484,294 counting with binary decision diagrams | |
Numbers, Information and Complexity | |
On converting CNF to DNF | |
On the analysis of the (1 + 1) evolutionary algorithm | |
On the choice of the mutation probability for the (1+1) EA | |
On the complexity of encoding in analog circuits | |
On the cut off point for combinatorial group testing | |
Optimal attribute efficient learning of disjunction, parity, and threshold functions | |
Optimal nonadaptive strategies for the search in the presence of false targets with nonregular detection functions | |
Optimal ordered binary decision diagrams for tree like circuits | |
Parity OBDDs cannot be handled efficiently enough | |
Perhaps not a free lunch but at least a free appetizer | |
Plädoyer für eine lebendige und anschauliche Fachsprache | |
Prime implicants and parallel [complexity] | |
range of new lower bound techniques for WRAMs and bounded depth circuits | |
Real royal road functions for constant population size | |
Real royal road functions - where crossover provably is essential | |
Reduction of BDDs in linear time | |
Relating branching program size and formula size over the full binary basis | |
Search problems | |
Searching randomly for maximum matchings | |
simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantly | |
Simulated annealing beats metropolis in combinatorial optimization | |
size of reduced OBDDs and optimal read once branching programs for almost all Boolean functions | |
Suchprobleme | |
Symmetric functions in ACO can be computed in constant depth with very small size | |
Teaching BDDs some instructive examples | |
Theoretische Informatik eine algorithmenorientierte Einführung | |
theory of zero suppressed BDDs and the number of knights tours | |
Threshold formulae and decision tree complexity | |
Tight bounds for blind search on the integers | |
Time space trade offs for branching programs | |
Upper and lower bounds for randomized search heuristics in black box optimization | |
Variable orderings for OBDDs, simulated annealing and the hidden weighted bit function | |
worst-case complexity of McDiarmid and Reed's variant of bottom up heap sort is less than n log n + 1.1n | |
Zadači poiska | |
Задачи поиска |