- All Titles
- Klassifikation (DDC)
- Besondere Sammlungen
- Veröffentlichungen der Universität
- Erzbischöfliche Akademische Bibliothek Paderborn
- Amtliche Mitteilungen. Verkündungsblatt der Universität Paderborn.
- Socioeconomics of personnel papers
- Wirtschaftspädagogische Beiträge
- Verlagsschriftenreihe des Heinz Nixdorf Instituts
- Sammlung J. A. Schmoll gen. Eisenwerth
- Studien der Paderborner Komparatistik
- Paderborner Schriften zur sonderpädagogischen Förderung
- The Encyclopedia of Concise Concepts by Women Philosophers
- Sammlung Ralf-Günter Stefan
- Sonstiges
- Paderborner Historische Mitteilungen
- Sammlung Höxter
- Bibliothekskatalog der Paderborner Kapuziner von 1761
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
In: SIAM journal on algebraic and discrete methods, Vol. 7.1986 Issue 4, page 505-512
Simulating binary trees on x-trees
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, page 147-158
The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Vol. 5, page 300-309Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Vol. 18.1984, page 239-242How to find long paths efficiently
In: Annals of Discrete Mathematics, Vol. 25.1985, page 239-254Two-way multihead automata over a one-letter alphabet
In: R.A.I.R.O Informatique théorique, Vol. 14.1980, page 67-82
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Vol. 8.1977, page 371-382On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Vol. 9, page 414-425Transformational methods and their application to complexity problems
In: Acta Informatica, Vol. 6.1976, page 95-108
Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Vol. 2.1974, page 280-293A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Vol. 3.1976 Issue 3, page 61-74Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Vol. 9.1975 Issue No. 3, page 248-264
The ring machine
In: Computers and artificial intelligence, Vol. 1987, page 195-208
About the derivation languages of grammars and machines
In: Automata, languages and programming, Vol. 4.1977, page 337-351Relationships between pushdown automata and tape-bounded turing machines
In: Automata, languages and programming, Vol. 1973, page 575-583