- 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
About the derivation languages of grammars and machines
In: Automata, languages and programming, Jg. 4.1977, S. 337-351
Analysis and integration of Web 2.0 data sources into a system for analysis and storage of Artefact-Actor-Networks
Elektronische Ressource, Paderborn, 2010The 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-512Calculations of dislocation pipe diffusion
In: Journal de Physique, Colloques, Jg. 1979 H. 40, S. C6-181Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Jg. 2.1974, S. 280-293Coherence and cohesion in early immersion students' L2 narratives
Implications for cognitive and linguistic development2010A 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-322The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Jg. 5, S. 300-309Computing minimum spanning forests on 1- and 2-dimensional processor arrays
In: STACS 1989, Jg. 1989, S. 181-192Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Jg. 18.1984, S. 239-242Diffusion along pipe dislocations
In: Physica status solidi, Jg. 1973 H. 58, S. K31-K34Dynamic hashing strategies
In: Mathematical foundations of computer science 1990, Jg. 1990, S. 76-87Efficiency of universal parallel computers
In: Theoretical computer science : Dortmund, January 5 - 7, 1983 (Lecture notes in computer science : 145), Jg. 1983, S. 221-241Efficient 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-119