- 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 25/08/2023
On-The-Fly Computing
Individualized IT-services in dynamic markets : Collaborative Research Centre 901 (2011 - 2023)Elektronische Ressource, Paderborn : Heinz Nixdorf Institut, 2023
- on 12/07/2023
On Cloud Assisted, Restricted, and Resource Constrained Scheduling
Elektronische Ressource, Paderborn, 2023
- on 08/06/2023
Local protocols for contracting and expanding robot formation problems
Elektronische Ressource, Paderborn, 2023Online algorithms for allocating heterogeneous resources
Elektronische Ressource, Paderborn, 2023
- on 02/03/2023
Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks
Elektronische Ressource, Paderborn, 2022
- on 21/12/2022
Situation-specific development of business models within software ecosystems
Elektronische Ressource, Paderborn, 2022
- on 21/02/2022
Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations
Elektronische Ressource, Paderborn, 2022
- on 26/11/2021
Automating network resource allocation for coflows with deadlines
Elektronische Ressource, Paderborn, 2021
- on 29/10/2021
Guaranteeing properties of reconfigurable hardware circuits with proof-carrying hardware
Elektronische Ressource, Paderborn, 2021
- on 10/09/2021
Models and algorithms for hybrid networks and hybrid programmable matter
Elektronische Ressource, Paderborn, 2021
- on 16/04/2021
Algorithms for distributed data structures and self-stabilizing overlay networks
Elektronische Ressource, Paderborn, 2021
- on 22/12/2020
Simulative performance evaluation of a provably collision free approach for managing autonomous cars on urban intersections
Elektronische Ressource, Paderborn, 2020
- on 03/09/2020
Local graph transformation primitives for some basic problems in Overlay networks
Elektronische Ressource, Paderborn, 2020
- on 31/01/2020
Mobile resource allocation
Elektronische Ressource, Paderborn, 2020
- on 19/11/2019
Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs
Elektronische Ressource, Paderborn, 2019
- on 15/11/2019
On scheduling with setup times
Elektronische Ressource, Paderborn, 2019
- on 16/08/2019
Big data: sublinear algorithms for distributed data streams
Elektronische Ressource, Paderborn, 2019
- on 09/04/2019
Reliable communication in distributed sensor networks
Elektronische Ressource, Paderborn, 2019
- on 15/02/2019
Approximate pure nash equilibria in congestion, opinion formation and facility location games
Elektronische Ressource, Paderborn, 2019
- on 28/09/2018
Efficient wireless communication in vehicular networks
Elektronische Ressource, Paderborn, 2018
- on 13/09/2018
Local strategies for swarm formations on a grid
Elektronische Ressource, Paderborn : Heinz Nixdorf Institut, Universität Paderborn, 2018
- on 16/02/2018
Local strategies for swarm formations on a grid
Elektronische Ressource, Paderborn, 2018
- on 30/01/2018
Distributed algorithms for overlay networks and programmable matter
Elektronische Ressource, Paderborn, 2018
- on 19/12/2017
Parallel fixed parameter tractable problems
Elektronische Ressource, Paderborn, 2017
- on 16/11/2017
Local algorithms for the continuous gathering problem
Elektronische Ressource, Paderborn, 2017Scheduling with scarce resources
Elektronische Ressource, Paderborn, 2017
- on 26/07/2017
Self-* Algorithms for distributed systems
programmable matter & overlay networksElektronische Ressource, Paderborn, 2017
- on 18/05/2017
Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)
11. und 12. Mai 2017 Heinz Nixdorf MuseumsForum, PaderbornElektronische Ressource, Paderborn : Heinz Nixdorf Institut, Universität Paderborn, 2017
- on 08/12/2016
Reconfigurable accelerators in the world of general-purpose computing
Elektronische Ressource, Paderborn, 2016
- on 13/07/2016
Existence and properties of pure nash equilibria in budget games
Elektronische Ressource, Paderborn, 2016
- on 14/06/2016
Augmented & Virtual Reality in der Produktentstehung
Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VRElektronische Ressource, Paderborn : Heinz Nixdorf Institut, Universität Paderborn, 2016
- on 11/04/2016
Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen
Elektronische Ressource, Paderborn, 2016
- on 11/03/2016
Dynamics and efficiency in topological self-stabilization
Elektronische Ressource, Paderborn, 2016
- on 02/03/2016
Insider-resistant distributed storage systems
Elektronische Ressource, Paderborn, 2016
- on 16/02/2016
Selfish network creation
on variants of network creation gamesElektronische Ressource, Paderborn, 2016
- on 18/09/2015
- on 21/07/2015
- on 10/07/2015
- on 22/04/2014
- on 07/03/2014
- on 27/02/2014
- on 14/01/2014
- on 07/01/2014
Acceleration of material flow simulations
using model coarsening by token sampling and online error estimation and accumulation controlling2014
- on 04/12/2013
- on 05/08/2013
- on 01/10/2012
- on 29/08/2012
- on 18/07/2012
- on 13/07/2012
- on 07/03/2012
- on 01/12/2011
Efficiency of universal parallel computers
In: Acta Informatica, Vol. 19.1983, page 269-296Efficiency 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-421A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Vol. 13.1981, page 315-322
- 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-229Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Vol. 1986, page 106-119Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Vol. 1985, page 413-420Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Vol. 1988, page 740-747Hashing strategies for simulating shared memory on distributed memory machines
In: Parallel architectures and their efficient use : proceedings, Vol. 1993, page 20-29Das Heinz-Nixdorf-Institut der Universität-GH Paderborn
In: Informatik-Spektrum, Vol. 1990, page 231-232Infinite cube-connected cycles
In: Information Processing Letters, Vol. 1983, page 1-2Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Vol. 1985, page 929-937Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Vol. 1985, page 195-211Nondeterministic versus probabilistic linear search algorithms
In: FOCS 1985, Vol. 1985, page 65-73On genuinely time bounded computations
In: STACS 1989, Vol. 1989, page 1-16A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Vol. 1984, page 668-676Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Vol. 1985, page 325-330Speeding up random access machines by few processors
In: STACS 1986, Vol. 1986, page 142-152
- on 19/09/2011
Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Vol. 1990, page 76-87
- on 17/08/2011
Trajektorienplanung mittels Diskretisierung und kombinatorischer Optimierung
am Beispiel des autonomen Kreuzungsmanagements für Kraftfahrzeuge2011
- on 22/06/2011
- on 19/05/2011
- on 18/05/2011