- Alle Titel
- 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
- Zeitzeugen der Digitalisierung
- Erwin Quedenfeldt: Einzelbilder vom Mittelrhein
- Erwin Quedenfeldt: Einzelbilder von der Mosel
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
In: SIAM journal on algebraic and discrete methods, Jg. 7.1986 H. 4, S. 505-512
Calculations of dislocation pipe diffusion
In: Journal de Physique, Colloques, Jg. 1979 H. 40, S. C6-181A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Jg. 18.1984, S. 239-242Diffusion along pipe dislocations
In: Physica status solidi, Jg. 1973 H. 58, S. K31-K34Efficiency of universal parallel computers
In: Acta Informatica, Jg. 19.1983, S. 269-296Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Das Heinz-Nixdorf-Institut der Universität-GH Paderborn
In: Informatik-Spektrum, Jg. 1990, S. 231-232How to find long paths efficiently
In: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Jg. 8.1977, S. 371-382Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Jg. 1985, S. 929-937Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Jg. 1985, S. 195-211Pipe diffusion along isolated dislocations
In: Thin Solid Films, Jg. 25, S. 221-230A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676Pressure coefficient Ko' of bulk modulus for cubic elements
In: Annalen der Physik, Jg. 1992 H. 1, S. 281-287A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-74Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-264The ring machine
In: Computers and artificial intelligence, Jg. 1987, S. 195-208