- 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
- Zeitzeugen der Digitalisierung
- Erwin Quedenfeldt: Einzelbilder vom Mittelrhein
- Erwin Quedenfeldt: Einzelbilder von der Mosel
- on 31/01/2023
Mensch-Tracking zur Identifizierung des Voranschreitens von Roboterunterstützten Rettungseinsätzen der Feuerwehr
In: Fachtagung Mechatronik 2022 / Bertram, Torsten; Burkhard, Corves; Janschek, Klaus; Rinderknecht, Stephan, page 151-156Elektronische Ressource,
- on 01/12/2011
Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Vol. 1983, page 221-241A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Conference record of the ... annual ACM Symposium on Theory of Computing, Vol. 1983, page 70-79Time-processor trade-offs for universal parallel computers
In: Mathematical foundations of computer science. 1975 : trbské Pleso, Czechoslovakia, August 31 - September 4, 1981 (Lecture notes in computer science : 118), Vol. 1981, page 433-441
- on 30/11/2011
A comparison between two variations of a pebble game on graphs
In: Automata, languages and programming. 1973 : Graz, Austria, July 16 - 20, 1979 (Lecture notes in computer science : 71), Vol. 1979, page 411-421
- on 28/11/2011
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Vol. 1989, page 181-192Efficient simulations among several models of parallel computers
In: STACS 1984, Vol. 1984, page 218-229Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Vol. 1985, page 413-420Hashing strategies for simulating shared memory on distributed memory machines
In: Parallel architectures and their efficient use : proceedings, Vol. 1993, page 20-29Nondeterministic versus probabilistic linear search algorithms
In: FOCS 1985, Vol. 1985, page 65-73On genuinely time bounded computations
In: STACS 1989, Vol. 1989, page 1-16Speeding up random access machines by few processors
In: STACS 1986, Vol. 1986, page 142-152
- on 23/11/2011
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
- on 15/11/2011
The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Vol. 5, page 300-309
- on 14/11/2011
On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Vol. 9, page 414-425
- on 22/10/2011
Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Vol. 2.1974, page 280-293
- on 06/10/2011
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
- on 19/09/2011
Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Vol. 1990, page 76-87