- 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-441Calculations of dislocation pipe diffusion
In: Journal de Physique, Colloques, Jg. 1979 H. 40, S. C6-181Diffusion along pipe dislocations
In: Physica status solidi, Jg. 1973 H. 58, S. K31-K34Pipe diffusion along isolated dislocations
In: Thin Solid Films, Jg. 25, S. 221-230Pressure coefficient Ko' of bulk modulus for cubic elements
In: Annalen der Physik, Jg. 1992 H. 1, S. 281-287Self-diffusion in Au along isolated dislocations
In: Physical review, B, Condensed matter and materials physics, Jg. 9 H. 12, S. 5320-5322Thermal expansion, heat of fusion, and electron density of monovalent metals
In: Physica status solidi : B, Basic research, Jg. 148, S. 91-100About the derivation languages of grammars and machines
In: Automata, languages and programming, Jg. 4.1977, S. 337-351The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
In: SIAM journal on algebraic and discrete methods, Jg. 7.1986 H. 4, S. 505-512Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Jg. 2.1974, S. 280-293The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Jg. 5, S. 300-309Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Jg. 18.1984, S. 239-242How to find long paths efficiently
In: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
In: Acta Informatica, Jg. 8.1977, S. 371-382On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Jg. 9, S. 414-425