Andreas Klein

32 papers B 4C 1Misc 1Journal 21Unranked 3
YearRankTypeTitle / Venue / Authors
2012 J jnl
The characterisation of the smallest two fold blocking sets in PG(n, 2).
Des. Codes Cryptogr.
Manohar L. Aggarwal, Andreas Klein, Leo Storme
2011 — ch.
Applications of finite geometry in coding theory and cryptography.
Information Security, Coding Theory and Related Combinatorics
Andreas Klein, Leo Storme
2011 J jnl
Computational Complexity of NURIKABE.
Fundam. Informaticae
Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp
2011 J jnl
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes.
Adv. Math. Commun.
Andreas Klein, Leo Storme
2010 J jnl
Galois geometries and applications.
Des. Codes Cryptogr.
Jan De Beule, Yves Edel, Emilia Käsper, Andreas Klein, Svetla Nikova, Bart Preneel, Jeroen Schillewaert, Leo Storme
2009 J jnl
Generalised dual arcs and Veronesean surfaces, with applications to cryptography.
J. Comb. Theory A
Andreas Klein, Jeroen Schillewaert, Leo Storme
2009 — conf
On the Number of Membranes in Unary P Systems
DCFS
Rudolf Freund, Andreas Klein, Martin Kutrib
2009 J jnl
Self-Assembling Finite Automata.
J. Autom. Lang. Comb.
Andreas Klein, Martin Kutrib
2008 J jnl
Attacks on the RC4 stream cipher.
Des. Codes Cryptogr.
Andreas Klein
2008 J jnl
How to say yes, no and maybe with visual cryptography.
Adv. Math. Commun.
Andreas Klein
2008 J jnl
Partial ovoids and partial spreads in hermitian polar spaces.
Des. Codes Cryptogr.
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme
2008 J jnl
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces.
Eur. J. Comb.
Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme
2007 J jnl
Cellular Devices and Unary Languages.
Fundam. Informaticae
Andreas Klein, Martin Kutrib
2007 J jnl
Context-Free Grammars with Linked Nonterminals.
Int. J. Found. Comput. Sci.
Andreas Klein, Martin Kutrib
2007 J jnl
Extended visual cryptography schemes.
Inf. Comput.
Andreas Klein, Markus Wessler
2007 J jnl
Parameters for which the Griesmer bound is not sharp.
Discret. Math.
Andreas Klein, Klaus Metsch
2005 J jnl
A correction to "The largest small
J. Comb. Theory A
Andreas Klein, Markus Wessler
2003 J jnl
Fast one-way cellular automata.
Theor. Comput. Sci.
Andreas Klein, Martin Kutrib
2003 J jnl
The largest small n-dimensional polytope with n+3 vertices.
J. Comb. Theory A
Andreas Klein, Markus Wessler
2002 J jnl
Deterministic Turing machines in the range between real-time and linear-time.
Theor. Comput. Sci.
Andreas Klein, Martin Kutrib
2002 J jnl
On Interacting Automata with Limited Nondeterminism.
Fundam. Informaticae
Thomas Buchholz, Andreas Klein, Martin Kutrib
2002 Misc conf
Self-Assembling Finite Automata.
COCOON
Andreas Klein, Martin Kutrib
2001 B conf
A Time Hierarchy for Bounded One-Way Cellular Automata.
MFCS
Andreas Klein, Martin Kutrib
2000 J jnl
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Electron. Colloquium Comput. Complex.
Andreas Klein, Martin Kutrib
2000 — conf
Iterative Arrays With Limited Nondeterministic Communication Cell.
Words, Languages & Combinatorics
Thomas Buchholz, Andreas Klein, Martin Kutrib
2000 B conf
Iterative Arrays with Small Time Bounds.
MFCS
Thomas Buchholz, Andreas Klein, Martin Kutrib
2000 — conf
Real-Time Language Recognition by Alternating Cellular Automata.
IFIP TCS
Thomas Buchholz, Andreas Klein, Martin Kutrib
1999 — —
Generalisierte Berechnungen in iterativen Arrays.
Andreas Klein
1999 B conf
Iterative Arrays with a Wee Bit Alternation.
FCT
Thomas Buchholz, Andreas Klein, Martin Kutrib
1999 C conf
On tally languages and generalized interacting automata.
Developments in Language Theory
Thomas Buchholz, Andreas Klein, Martin Kutrib
1999 J jnl
On time reduction and simulation in cellular spaces.
Int. J. Comput. Math.
Thomas Buchholz, Andreas Klein, Martin Kutrib
1998 B conf
One Guess One-Way Cellular Arrays.
MFCS
Thomas Buchholz, Andreas Klein, Martin Kutrib