Schliessen
Aufgabenbezogene, dialogorientierte Systementwicklung
In: Softwaretechnik-Trends, Jg. 1985, S. 105-135The 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-512CADDY-O
syntaxgestütztes, graphisches Entwerfen konzeptioneller DatenbankschemataIn: Notizen zu interaktiven Systemen, Jg. 17.1989 H. 18, S. 1-16Cognitive imperialism
In: Stanford Humanities Review, Jg. 4.1994 H. P.1, S. 72-74A comparison of two variations of a pebble game on graphs
In: Theoretical Computer Science, Jg. 13.1981, S. 315-322Deterministic two-way one-head pushdown automata are very powerful
In: Information processing letters, Jg. 18.1984, S. 239-242Efficiency of universal parallel computers
In: Acta Informatica, Jg. 19.1983, S. 269-296Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Erläuterungen zur attributierten Grammatik für PEARL
In: PEARL-Rundschau, Jg. 2.1981 H. 3, S. 19-31Fail-high reductions
In: Advances in Computer Chess 7, Jg. 1994, S. 111-128Fast algorithms for N-dimensional restrictions of hard problems
In: Journal of the Association for Computing Machinery, Jg. 1988, S. 740-747Die Gestaltung des Unsichtbaren
In: Computer Magazin, Jg. 1988, S. 39-41Das Heinz-Nixdorf-Institut der Universität-GH Paderborn
In: Informatik-Spektrum, Jg. 1990, S. 231-232How to find long paths efficiently
In: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254Infinite cube-connected cycles
In: Information Processing Letters, Jg. 1983, S. 1-2Insellösungen oder Wege zu CIM
In: PC-Magazin, Jg. 1986, S. 88-91The 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