291 Neuzugänge
Klassifikation
Schliessen
Filter
1

zu den Filteroptionen

vom 28.11.2011
Simulating probabilistic by deterministic algebraic computation trees
Meyer auf der Heide, Friedhelm
In: Theoretical Computer Science, Jg. 1985, S. 325-330
Speeding up random access machines by few processors
Meyer auf der Heide, Friedhelm
In: STACS 1986, Jg. 1986, S. 142-152

vom 23.11.2011
The bandwidth-minimization problem for caterpillars with hair length 3 is NP-complete
Monien, Burkhard
In: SIAM journal on algebraic and discrete methods, Jg. 7.1986 H. 4, S. 505-512
Simulating binary trees on x-trees
Monien, Burkhard
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, S. 147-158

vom 15.11.2011
The complexity of embedding graphs into binary trees
Monien, Burkhard
In: Fundamentals of computation theory, Jg. 5, S. 300-309
Deterministic two-way one-head pushdown automata are very powerful
Monien, Burkhard
In: Information processing letters, Jg. 18.1984, S. 239-242
How to find long paths efficiently
Monien, Burkhard
In: Annals of Discrete Mathematics, Jg. 25.1985, S. 239-254
Two-way multihead automata over a one-letter alphabet
Monien, Burkhard
In: R.A.I.R.O Informatique théorique, Jg. 14.1980, S. 67-82

vom 14.11.2011
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
Monien, Burkhard
In: Acta Informatica, Jg. 8.1977, S. 371-382
On a subclass of pseudopolynomial problems
Monien, Burkhard
In: Mathematical Foundations of Computer Science, Jg. 9, S. 414-425
Transformational methods and their application to complexity problems
Monien, Burkhard
In: Acta Informatica, Jg. 6.1976, S. 95-108

vom 9.11.2011
dedupv1
improving deduplication throughput using solid state drives ; technical report
Meister, Dirk ; Brinkmann, André
Paderborn : Universitätsbibliothek Paderborn, 2011

vom 22.10.2011
Characterizations of time-bounded computations by limited primitive recursion
Monien, Burkhard
In: Automata, languages and programming, Jg. 2.1974, S. 280-293
A recursive and a grammatical characterization of the exponential-time languages
Monien, Burkhard
In: Theoretical Computer Science, Jg. 3.1976 H. 3, S. 61-74
Relationships between pushdown automata with counters and complexity classes
Monien, Burkhard
In: Mathematical systems theory, Jg. 9.1975 H. No. 3, S. 248-264

vom 18.10.2011
Holistic use of analysis models in model-based system testing
Mlynarski, Michael
2011

vom 14.10.2011
The ring machine
Monien, Burkhard
In: Computers and artificial intelligence, Jg. 1987, S. 195-208

vom 6.10.2011
About the derivation languages of grammars and machines
Monien, Burkhard
In: Automata, languages and programming, Jg. 4.1977, S. 337-351
Relationships between pushdown automata and tape-bounded turing machines
Monien, Burkhard
In: Automata, languages and programming, Jg. 1973, S. 575-583

vom 28.9.2011
Calculations of dislocation pipe diffusion
Mimkes, Jürgen
In: Journal de Physique, Colloques, Jg. 1979 H. 40, S. C6-181
Gehe zu Seiten