VIAF

Virtual International Authority File

Search

Wegener, Ingo, 1950-2008 National Library of the Czech Republic ISNI German National Library

Wegener, Ingo. National Library of the Netherlands NUKAT Center of Warsaw University Library Sudoc [ABES], France Library of Congress/NACO National Library of France

Wegener, Ingo, 1950- National Library of Latvia

Ingo Wegener informaticien allemand Wikidata

VIAF ID: 69006430 (Personal)

Permalink: http://viaf.org/viaf/69006430

ISNI: 0000  0001  1768  6625 

Open Section Close Section Preferred Forms

 

 

 

 

Open Section Close Section 4xx's: Alternate Name Forms (10)

Open Section Close Section 5xx's: Related Names (6)

Open Section Close SectionWorks

Title Sources
Advances in computational intelligence, 2002: NUKAT Center of Warsaw University Library Sudoc [ABES], France Library of Congress/NACO
Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems German National Library
Automata, Languages and Programming 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II Sudoc [ABES], France
Branching programs and binary decision diagrams : theory and applications NUKAT Center of Warsaw University Library Sudoc [ABES], France Library of Congress/NACO National Library of France German National Library
comparison of free BDDs and transformed BDDs German National Library
complexity of Boolean functions Library of Congress/NACO German National Library National Library of the Netherlands Sudoc [ABES], France National Library of France
Complexity theory exploring the limits of efficient algorithms Library of Congress/NACO German National Library Sudoc [ABES], France NUKAT Center of Warsaw University Library National Library of the Netherlands National Library of Latvia
covering problem for finite boolean lattices German National Library
Distributed hybrid genetic programming for learning Boolean functions German National Library
Dynamic parameter control in simple evolutionary algorithms German National Library
Efficient algorithms for the transformation between different types of binary decision diagrams German National Library
Efficient simulation of circuits by EREW PRAMs German National Library
Effiziente Algorithmen für grundlegende Funktionen mit zahlreichen Aufgaben und Beispielen German National Library
Fitness landscapes based on sorting and shortest path problems German National Library
Functions that have read once branching programs of quadratic size are not necessarily testable German National Library
Graph driven BDD's - a new data structure for boolean functions German National Library
Highlights aus der Informatik mit 5 Tabellen German National Library
How far can we count in constant depth with a polylogarithmic number of gates? German National Library
How to compute minimal sums for totally symmetric functions German National Library
Improving the variable ordering of OBDDs is NP-complete German National Library
Ising model on the ring mutation versus recombination German National Library
Ist die Informatiksprache patriarchalisiert? German National Library
Komplexitätstheorie : Grenzen der Effizienz von Algorithmen xR Extended Titles NUKAT Center of Warsaw University Library German National Library National Library of Latvia
Minimal polynomials for the conjunction of functions on disjoint variables can be very simple German National Library
Minimum spanning trees made easier via multi-objective optimization German National Library
natural and simple function wich is hard for all evolutionary algorithms German National Library
new framework for the valuation of algorithms for black box optimization German National Library
note on the relations between critical and sensitive complexity German National Library
number of knight's tours equals 33,439,123,484,294 counting with binary decision diagrams German National Library
On the analysis of the (1 + 1) evolutionary algorithm German National Library
On the choice of the mutation probability for the (1+1) EA German National Library
On the complexity of encoding in analog circuits German National Library
On the cut off point for combinatorial group testing German National Library
Optimal attribute efficient learning of disjunction, parity, and threshold functions German National Library
Optimal nonadaptive strategies for the search in the presence of false targets with nonregular detection functions German National Library
Optimal ordered binary decision diagrams for tree like circuits German National Library
Parity OBDDs cannot be handled efficiently enough German National Library
Perhaps not a free lunch but at least a free appetizer German National Library
Plädoyer für eine lebendige und anschauliche Fachsprache German National Library
Prime implicants and parallel [complexity] German National Library
range of new lower bound techniques for WRAMs and bounded depth circuits German National Library
Real royal road functions for constant population size German National Library
Real royal road functions - where crossover provably is essential German National Library
Reduction of BDDs in linear time German National Library
Relating branching program size and formula size over the full binary basis German National Library
Search problems National Library of the Netherlands Sudoc [ABES], France Library of Congress/NACO German National Library
Searching randomly for maximum matchings German National Library
simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantly German National Library
Simulated annealing beats metropolis in combinatorial optimization German National Library
size of reduced OBDDs and optimal read once branching programs for almost all Boolean functions German National Library
Suchprobleme Sudoc [ABES], France National Library of Latvia Library of Congress/NACO German National Library
Symmetric functions in ACO can be computed in constant depth with very small size German National Library
Teaching BDDs some instructive examples German National Library
Theoretische Informatik eine algorithmenorientierte Einführung Sudoc [ABES], France German National Library
theory of zero suppressed BDDs and the number of knights tours German National Library
Threshold formulae and decision tree complexity German National Library
Time space trade offs for branching programs German National Library
Upper and lower bounds for randomized search heuristics in black box optimization German National Library
Variable orderings for OBDDs, simulated annealing and the hidden weighted bit function German National Library
worst-case complexity of McDiarmid and Reed's variant of bottom up heap sort is less than n log n + 1.1n German National Library
Zadači poiska NUKAT Center of Warsaw University Library German National Library
Задачи поиска National Library of Latvia

Open Section Close Section Selected Co-authors

Open Section Close Section Countries of Publication (4)

Open Section Close Section Publication Statistics

Open Section Close Section Selected Publishers (10)

Open Section Close Section History of VIAF ID:69006430 (32)