- 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
Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-87
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-421A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322Time-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-441A 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-79Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-241Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676Efficient simulations among several models of parallel computers
In: STACS 1984, Jg. 1984, S. 218-229Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Jg. 1985, S. 413-420Lower 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-73Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Jg. 1985, S. 325-330Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Speeding up random access machines by few processors
In: STACS 1986, Jg. 1986, S. 142-152Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192On genuinely time bounded computations
In: STACS 1989, Jg. 1989, S. 1-16Hashing strategies for simulating shared memory on distributed memory machines
In: Parallel architectures and their efficient use : proceedings, Jg. 1993, S. 20-29