- 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
The GAG-system : A tool for compiler construction
In: Methods and tools for compiler construction, Jg. 1984, S. 165-181
Implementation of visit-oriented attribute evaluators
In: Attribute grammars, applications and systems (Lecture notes in computer science : 545), Jg. 1991, S. 114-139
Lifetime analysis for attributes
In: Acta Informatica, Jg. 24.1987 H. 6, S. 633-652
Ordered attributed grammars
In: Acta Informatica, Jg. 13.1980 H. 3, S. 229-256
Towards the MaSHReC manufacturing system under real time constraints
a contribution to the application of real time system advances to production control systems2002
Artifacts in software design
In: Software development and reality construction, Jg. 1992, S. 168-188
Cognitive imperialism
In: Stanford Humanities Review, Jg. 4.1994 H. P.1, S. 72-74
Distributing 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
An ecological approach to responsible systems development
In: Directions and Implications of Advanced Computing (DIAC-87), Jg. 1989, S. 82-96
Imparting practical skills in software engineering
In: Technik und Informationsgesellschaft, Jg. 1987, S. 517-522
SDI considered harmful
Ansätze zum Umdenken in der SoftwaretechnikIn: Die Zukunft der Informationssysteme, Jg. 1986, S. 634-643
Supporting participative systems development by task-oriented requirements analysis
In: SYSTEM DESIGN for Human Development and Productivity: Participation and Beyond, Jg. 1987, S. 113-124



The effect of electric fields on blue phases
In: Molecular crystals and liquid crystals, Jg. 1991, S. 51-83
Polymer-dispersed liquid crystals
from the nematic curvilinear aligned phase to ferroelectric filmsIn: Liquid crystals, Jg. 16 H. 1, S. 1-31









The endocategory of a module
In: Representation theory of algebras (Conference proceedings / Canadian Mathematical Society : 18), Jg. 1996, S. 419-432
Endomorphisms of words in a quiver
In: Journal of combinatorial theory, Series A, Jg. 1993, S. 216-245
The kernel of an irreducible map
In: Proceedings of the American Mathematical Society, Jg. 1994, S. 57-66
Maps between tree and band modules
In: Journal of algebra, Jg. 1991, S. 186-194
A note on infinite string modules
In: Representations of algebras (Conference proceedings / Canadian Mathematical Society : 14), Jg. 1993, S. 309-312
On the four terms in the middle theorem for almost split sequences
In: Archiv der Mathematik, Jg. 1994, S. 501-505
On the number of almost split sequences with indecomposable middle term
In: The bulletin of the London Mathematical Society, Jg. 1994, S. 422-426




Modeling long-range proton transfer
new developments and application to the photosynthetic bacterial reaction center2005
























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
Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192
Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-87
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 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
Fast algorithms for n-dimensional restrictions of hard problems
In: STOC 1985, Jg. 1985, S. 413-420
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-29
Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2
Lower bounds for solving linear diophantine equations on random access machines
In: Journal of the Association for Computing Machinery, Jg. 1985, S. 929-937
Lower time bounds for solving linear diophantine equations on several parallel computational models
In: Information and Control, Jg. 1985, S. 195-211
Nondeterministic versus probabilistic linear search algorithms
In: FOCS 1985, Jg. 1985, S. 65-73
On genuinely time bounded computations
In: STACS 1989, Jg. 1989, S. 1-16
A 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-79
A polynomial linear search algorithm for the N-dimensional Knapsack problem
In: Journal of the Association for Computing Machinery, Jg. 1984, S. 668-676
Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Jg. 1985, S. 325-330
Speeding up random access machines by few processors
In: STACS 1986, Jg. 1986, S. 142-152
Time-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




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