Monien, Burkhard, 1943-....
Monien, B.
Monien, Burkhard
Burkhard Monien
VIAF ID: 72600866 ( Personal )
Permalink: http://viaf.org/viaf/72600866
Preferred Forms
- 100 0 _ ‡a Burkhard Monien
-
-
-
-
- 100 1 0 ‡a Monien, B.
-
-
- 100 1 _ ‡a Monien, Burkhard
-
- 100 1 _ ‡a Monien, Burkhard ‡d 1943-
- 100 1 _ ‡a Monien, Burkhard ‡d 1943-
-
- 100 1 _ ‡a Monien, Burkhard, ‡d 1943-....
4xx's: Alternate Name Forms (14)
5xx's: Related Names (6)
- 510 2 _ ‡a Association française pour la cybernétique économique et technique
- 510 2 _ ‡a Gesellschaft für Informatik
- 510 2 _ ‡a Universität Paderborn ‡e Affiliation
- 510 2 _ ‡a Universität Dortmund Abteilung Informatik
- 510 2 _ ‡a Universität Paderborn
- 510 2 _ ‡a naturwiss. F
Works
Title | Sources |
---|---|
About the derivation languages of grammars and machines | |
Algorithmic game theory first international symposium ; proceedings | |
Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996 : proceedings | |
bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete | |
Characterizations of time-bounded computations by limited primitive recursion | |
complexity of embedding graphs into binary trees | |
complexity of local max-cut | |
Data structures and efficient algorithms final report on the DFG special joint initiative | |
Deterministic two-way one-head pushdown automata are very powerful | |
Einführung in parallele Algorithmen und Architekturen Gitter, Bäume und Hypercubes | |
Entwicklungssätze bei Operatorenbüscheln | |
Euro-Par 2002 parallel processing : 8th International Euro-Par Conference Paderborn, Germany, August 27–30, 2002 : proceedings | |
High performance computing : HiPC 2001 : 8th international conference, Hyderabad, India, December 17-20, 2001 : proceedings | |
HiPC 2001 | |
How to find long paths efficiently | |
ICALP '96 | |
LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet | |
Multiscale phenomenon and their simulation : proceedings of the international conference, Bielefeld, Germany, 30 September-4 October, 1996 | |
On a subclass of pseudopolynomial problems | |
On the hardness of computing local optima | |
Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings | |
A recursive and a grammatical characterization of the exponential-time languages | |
Relationships between pushdown automata with counters and complexity classes | |
ring machine | |
SAGT 2008 | |
Simulating binary trees on x-trees | |
STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986 | |
STACS 89 : proceedings | |
STACS eighty-nine | |
Sym. on Theor. Asp. of Comp. Sci. (6th : 1989 : Paderborn, Germ.). STACS 89, 1989: | |
Transformational methods and their application to complexity problems | |
Über die Komplexität der Ableitungssprachen von Grammatiken und Maschinen | |
Über die Schwierigkeit der Berechnung Lokaler Optima |