VIAF

Virtual International Authority File

Search

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

Wegener, Ingo National Library of the Netherlands-test Wikipedia (en)-test Sudoc [ABES], France National Library of France Library of Congress/NACO

Wegener, Ingo, 1950- National Library of Latvia

VIAF ID: 69006430 (Personal)

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

ISNI-test: 0000  0001  1768  6625 

Open Section Close Section Preferred Forms

 

 

 

 

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

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

Open Section Close SectionWorks

Title Sources
Advances in computational intelligence, 2002: Sudoc [ABES], France Library of Congress/NACO
Branching programs and binary decision diagrams : theory and applications Sudoc [ABES], France Library of Congress/NACO
The complexity of Boolean functions National Library of the Netherlands-test Library of Congress/NACO Sudoc [ABES], France National Library of France German National Library
Complexity theory exploring the limits of efficient algorithms National Library of the Netherlands-test Sudoc [ABES], France National Library of Latvia Library of Congress/NACO German National Library
˜Aœ covering problem for finite boolean lattices German National Library
Effiziente Algorithmen für grundlegende Funktionen mit zahlreichen Aufgaben und Beispielen German National Library
Komplexitätstheorie Grenzen der Effizienz von Algorithmen National Library of Latvia German National Library
˜Theœ 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
Optimal nonadaptive strategies for the search in the presence of false targets with nonregular detection functions German National Library
˜Theœ range of new lower bound techniques for WRAMs and bounded depth circuits German National Library
Search problems National Library of the Netherlands-test Sudoc [ABES], France Library of Congress/NACO German National Library
˜Theœ 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
Theoretische Informatik eine algorithmenorientierte Einführung German National Library
˜Theœ theory of zero suppressed BDDs and the number of knights tours German National Library
Time space trade offs for branching programs German National Library
˜Theœ 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
Задачи поиска 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 About

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