2008 |
23 | EE | Jan De Beule,
Andreas Klein,
Klaus Metsch,
Leo Storme:
Partial ovoids and partial spreads in hermitian polar spaces.
Des. Codes Cryptography 47(1-3): 21-34 (2008) |
22 | EE | Andreas Klein:
Attacks on the RC4 stream cipher.
Des. Codes Cryptography 48(3): 269-286 (2008) |
21 | EE | Jan De Beule,
Andreas Klein,
Klaus Metsch,
Leo Storme:
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces.
Eur. J. Comb. 29(5): 1280-1297 (2008) |
2007 |
20 | EE | Andreas Klein,
Klaus Metsch:
Parameters for which the Griesmer bound is not sharp.
Discrete Mathematics 307(22): 2695-2703 (2007) |
19 | EE | Andreas Klein,
Martin Kutrib:
Cellular Devices and Unary Languages.
Fundam. Inform. 78(3): 343-368 (2007) |
18 | EE | Andreas Klein,
Markus Wessler:
Extended visual cryptography schemes.
Inf. Comput. 205(5): 716-732 (2007) |
17 | EE | Andreas Klein,
Martin Kutrib:
Context-Free Grammars with Linked Nonterminals.
Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007) |
2005 |
16 | | Andreas Klein:
Systematisierung und Beurteilung von Micropayment-Systemen aus Nachfragersicht.
MCTA 2005: 59-73 |
15 | EE | Andreas Klein,
Markus Wessler:
A correction to "The largest small n-dimensional polytope with n+3 vertices": [J. Combin. Theory Ser. A 102 (2003) 401-409].
J. Comb. Theory, Ser. A 112(1): 173-174 (2005) |
2004 |
14 | EE | Andreas Klein:
Partial Ovoids in Classical Finite Polar Spaces.
Des. Codes Cryptography 31(3): 221-226 (2004) |
13 | EE | Andreas Klein:
On codes meeting the Griesmer bound.
Discrete Mathematics 274(1-3): 289-297 (2004) |
2003 |
12 | EE | Andreas Klein,
Markus Wessler:
The largest small n-dimensional polytope with n+3 vertices.
J. Comb. Theory, Ser. A 102(2): 401-409 (2003) |
11 | EE | Andreas Klein,
Martin Kutrib:
Fast one-way cellular automata.
Theor. Comput. Sci. 295: 233-250 (2003) |
2002 |
10 | EE | Andreas Klein,
Martin Kutrib:
Self-Assembling Finite Automata.
COCOON 2002: 310-319 |
9 | EE | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
On Interacting Automata with Limited Nondeterminism.
Fundam. Inform. 52(1-3): 15-38 (2002) |
8 | | Andreas Klein,
Martin Kutrib:
Deterministic Turing machines in the range between real-time and linear-time.
Theor. Comput. Sci. 289(1): 253-275 (2002) |
2001 |
7 | EE | Andreas Klein,
Martin Kutrib:
A Time Hierarchy for Bounded One-Way Cellular Automata.
MFCS 2001: 439-450 |
2000 |
6 | EE | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
Real-Time Language Recognition by Alternating Cellular Automata.
IFIP TCS 2000: 213-225 |
5 | EE | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
Iterative Arrays with Small Time Bounds.
MFCS 2000: 243-252 |
4 | EE | Andreas Klein,
Martin Kutrib:
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Electronic Colloquium on Computational Complexity (ECCC) 7(75): (2000) |
1999 |
3 | | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
On tally languages and generalized interacting automata.
Developments in Language Theory 1999: 316-325 |
2 | EE | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
Iterative Arrays with a Wee Bit Alternation.
FCT 1999: 173-184 |
1998 |
1 | EE | Thomas Buchholz,
Andreas Klein,
Martin Kutrib:
One Guess One-Way Cellular Arrays.
MFCS 1998: 807-815 |