- 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
Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747
Hashing strategies for simulating shared memory on distributed memory machines
In: Parallel architectures and their efficient use : proceedings, Jg. 1993, S. 20-29Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2Lower 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-211Nondeterministic versus probabilistic linear search algorithms
In: FOCS 1985, Jg. 1985, S. 65-73On genuinely time bounded computations
In: STACS 1989, Jg. 1989, S. 1-16A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Conference record of the ... annual ACM Symposium on Theory of Computing, Jg. 1983, S. 70-79A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Jg. 1985, S. 325-330Speeding up random access machines by few processors
In: STACS 1986, Jg. 1986, S. 142-152Time-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), Jg. 1981, S. 433-441On scheduling with setup times
Elektronische Ressource, Paderborn, 2019Reliable communication in distributed sensor networks
Elektronische Ressource, Paderborn, 2019Local algorithms for the continuous gathering problem
Elektronische Ressource, Paderborn, 2017On Cloud Assisted, Restricted, and Resource Constrained Scheduling
Elektronische Ressource, Paderborn, 2023Acceleration of material flow simulations
using model coarsening by token sampling and online error estimation and accumulation controlling2014Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs
Elektronische Ressource, Paderborn, 2019