Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Klein, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Context-free grammars with linked nonterminals
Andreas Klein
,
Martin Kutrib
International Journal of Foundations of Computer Science
18
(6), 2007, pp. 1271-1282
Extended visual cryptography schemes
Andreas Klein
,
Markus Wessler
Information and Computation
205
(5), 2007, pp. 716-732
Erratum to ''The largest small
n
-dimensional polytope with
n+3
vertices''
Andreas Klein
,
Markus Wessler
Journal of Combinatorial Theory Series A
112
(1), 2005, pp. 173-174
Fast one-way cellular automata
Andreas Klein
,
Martin Kutrib
Theoretical Computer Science
295
(1-3), 2003, pp. 233-250
The largest small
n
-dimensional polytope with
n+3
vertices
Andreas Klein
,
Markus Wessler
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 401-409
Self-assembling finite automata
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
2387
, 2002, pp. 310-319
Deterministic Turing machines in the range between real-time and linear-time
Andreas Klein
,
Martin Kutrib
Theoretical Computer Science
289
(1), 2002, pp. 253-275
A time hierarchy for bounded one-way cellular automata
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
2136
, 2001, pp. 439-450
Real-time language recognition by alternating cellular automata
Thomas Buchholz
,
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
1872
, 2000, pp. 213-225
Iterative arrays with small time bounds
Thomas Buchholz
,
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
1893
, 2000, pp. 243-252
Deterministic Turing machines in the range between real-time and linear-time
Andreas Klein
,
Martin Kutrib
Technical Report (TR00-075), 2000
One guess one-way cellular arrays
Thomas Buchholz
,
Andreas Klein
,
Martin Kutrib
Lecture Notes in Computer Science
1450
, 1998, pp. 807-815