- 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
Acceleration of material flow simulations
using model coarsening by token sampling and online error estimation and accumulation controlling2014
Algorithms for distributed data structures and self-stabilizing overlay networks
Elektronische Ressource, Paderborn, 2021
Approximate pure nash equilibria in congestion, opinion formation and facility location games
Elektronische Ressource, Paderborn, 2019
Automating network resource allocation for coflows with deadlines
Elektronische Ressource, Paderborn, 2021
Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations
Elektronische Ressource, Paderborn, 2022
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), Jg. 1979, S. 411-421
A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322
Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks
Elektronische Ressource, Paderborn, 2022
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192

Distributed algorithms for overlay networks and programmable matter
Elektronische Ressource, Paderborn, 2018
Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-87
Dynamics and efficiency in topological self-stabilization
Elektronische Ressource, Paderborn, 2016
Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-241
Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs
Elektronische Ressource, Paderborn, 2019
Efficient simulations among several models of parallel computers
In: STACS 1984, Jg. 1984, S. 218-229
Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119

Existence and properties of pure nash equilibria in budget games
Elektronische Ressource, Paderborn, 2016
Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Jg. 1985, S. 413-420
