18 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke → Informatik, Wissen, Systeme → Informatik, Informationswissenschaft, allgemeine Werke 2
zu den Filteroptionen18 Titel in Klassifikation (DDC) → Informatik, Informationswissenschaft, allgemeine Werke → Informatik, Wissen, Systeme → Informatik, Informationswissenschaft, allgemeine Werke
2
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
A 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-242Efficient simulations among several models of parallel computers
In: SIAM journal on computing, Jg. 1986, S. 106-119Fail-high reductions
In: Advances in Computer Chess 7, Jg. 1994, S. 111-128How 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-2The 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-382Lifetime analysis for attributes
In: Acta Informatica, Jg. 24.1987 H. 6, S. 633-652Lower 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-211Ordered attributed grammars
In: Acta Informatica, Jg. 13.1980 H. 3, S. 229-256A recursive and a grammatical characterization of the exponential-time languages
In: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-74Relationships between pushdown automata with counters and complexity classes
In: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-264The ring machine
In: Computers and artificial intelligence, Jg. 1987, S. 195-208Simulating probabilistic by deterministic algebraic computation trees
In: Theoretical Computer Science, Jg. 1985, S. 325-330Transformational methods and their application to complexity problems
In: Acta Informatica, Jg. 6.1976, S. 95-108Two-way multihead automata over a one-letter alphabet
In: R.A.I.R.O Informatique théorique, Jg. 14.1980, S. 67-82