One Guess One-Way Cellular Arrays. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (MFCS, 1998)

On tally languages and generalized interacting automata. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (Developments in Language Theory, 1999)

Iterative Arrays with a Wee Bit Alternation. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (FCT, 1999)

On time reduction and simulation in cellular spaces. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (Int. J. Comput. Math., 1999)

Generalisierte Berechnungen in iterativen Arrays. - Andreas Klein 001 (1999)

Iterative Arrays With Limited Nondeterministic Communication Cell. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (Words, Languages & Combinatorics, 2000)

Real-Time Language Recognition by Alternating Cellular Automata. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (IFIP TCS, 2000)

Iterative Arrays with Small Time Bounds. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (MFCS, 2000)

A Time Hierarchy for Bounded One-Way Cellular Automata. - Andreas Klein 001; Martin Kutrib (MFCS, 2001)

On Interacting Automata with Limited Nondeterminism. - Thomas Buchholz; Andreas Klein 001; Martin Kutrib (Fundam. Informaticae, 2002)

Deterministic Turing machines in the range between real-time and linear-time. - Andreas Klein 001; Martin Kutrib (Theor. Comput. Sci., 2002)

The largest small n-dimensional polytope with n+3 vertices. - Andreas Klein 001; Markus Wessler (J. Comb. Theory A, 2003)

Fast one-way cellular automata. - Andreas Klein 001; Martin Kutrib (Theor. Comput. Sci., 2003)

A correction to "The largest small n-dimensional polytope with n+3 vertices": [J. Combin. Theory Ser. A 102 (2003) 401-409]. - Andreas Klein 001; Markus Wessler (J. Comb. Theory A, 2005)

Parameters for which the Griesmer bound is not sharp. - Andreas Klein 001; Klaus Metsch (Discret. Math., 2007)

Cellular Devices and Unary Languages. - Andreas Klein 001; Martin Kutrib (Fundam. Informaticae, 2007)

Extended visual cryptography schemes. - Andreas Klein 001; Markus Wessler (Inf. Comput., 2007)

Context-Free Grammars with Linked Nonterminals. - Andreas Klein 001; Martin Kutrib (Int. J. Found. Comput. Sci., 2007)

How to say yes, no and maybe with visual cryptography. - Andreas Klein 001 (Adv. Math. Commun., 2008)

Partial ovoids and partial spreads in hermitian polar spaces. - Jan De Beule; Andreas Klein 001; Klaus Metsch; Leo Storme (Des. Codes Cryptogr., 2008)

Attacks on the RC4 stream cipher. - Andreas Klein 001 (Des. Codes Cryptogr., 2008)

Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. - Jan De Beule; Andreas Klein 001; Klaus Metsch; Leo Storme (Eur. J. Comb., 2008)

On the Number of Membranes in Unary P Systems - Rudolf Freund; Andreas Klein 001; Martin Kutrib (DCFS, 2009)

Self-Assembling Finite Automata. - Andreas Klein 001; Martin Kutrib (J. Autom. Lang. Comb., 2009)

Generalised dual arcs and Veronesean surfaces, with applications to cryptography. - Andreas Klein 001; Jeroen Schillewaert; Leo Storme (J. Comb. Theory A, 2009)

Galois geometries and applications. - Jan De Beule; Yves Edel; Emilia Käsper; Andreas Klein 001; Svetla Nikova; Bart Preneel; Jeroen Schillewaert; Leo Storme (Des. Codes Cryptogr., 2010)

On the non-minimality of the largest weight codewords in the binary Reed-Muller codes. - Andreas Klein 001; Leo Storme (Adv. Math. Commun., 2011)

Computational Complexity of NURIKABE. - Markus Holzer 001; Andreas Klein 001; Martin Kutrib; Oliver Ruepp (Fundam. Informaticae, 2011)

Applications of finite geometry in coding theory and cryptography. - Andreas Klein 001; Leo Storme (Information Security, Coding Theory and Related Combinatorics, 2011)

The characterisation of the smallest two fold blocking sets in PG(n, 2). - Manohar L. Aggarwal; Andreas Klein 001; Leo Storme (Des. Codes Cryptogr., 2012)