- 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
- vom 1.12.2011
Atomic hydrogen centres in ionic crystals
In: Journal de Physique, Colloques, Jg. 1973 H. C9, S. 265-271
Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-241ESR, ENDOR and ODMR of color centers and other defects in ionic crystals
In: Crystal lattice defects and amorphous materials, Jg. 1985, S. 381-400Influence of zero-point vibration on the superhyperfine interactions of hydrogen and Deuterium centres in KCI
In: Physica Status Solidi, Jg. 1969, S. 171-181Magnetic resonance studies of vacancy centers in ionic crystals
In: Defects and their structure in nonmetallic solids : NATO advanced study institutes series : B, Jg. 1976, S. 155-172A 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-79Recent developments in magnetic resonance studies of defects in Ionic crystals
In: Journal de Physique, Colloques, Jg. 1980 H. C6, S. 13-16Time-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-441
- vom 30.11.2011
Artifacts in software design
In: Software development and reality construction, Jg. 1992, S. 168-188A 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-322Distributing resources through network utilisation
In: NetWORKing : connecting workers in and between organizations : proceedings of the IFIP WG 9.1 Working Conference on NetWORKing, Vienna, Austria, 16 - 18 June, 1993 (IFIP transactions : A ; 38), Jg. 1994, S. 165-168
- vom 28.11.2011
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192A concept for the editing of hardware resulting in an automatic hardware editor
In: 14th Design Automation Conference, New Orleans, Jg. 1977, S. 187-193DIGITEST II : an integrated structural and behavioural language
In: International Symposium on Computer Hardware Description Languages and their Applications, New York, 3, Jg. 1975, S. 38-44Efficient simulations among several models of parallel computers
In: STACS 1984, Jg. 1984, S. 218-229Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Jg. 1985, S. 413-420Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Hashing 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-16Petri net based description, analysis and simulation of concurrent processes
In: ACM SIGDA Newsletters, Jg. 1977, S. 15-27A 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-152An universal hardware editor based on an algebraic model of the time-behaviour of digital circuits
In: Discrete Systems = Diskretnye Sistemy, Vol. 5: Section GH : analysis and simulation , IFAC-Symposium Discrete Systems : (Dresden) : 1977.03.14-19, Jg. 1977, S. 36-45