Andreas Klein

Affiliations:
  • Ghent University, Belgium
  • University of Giessen, Gießen, Germany


According to our database1, Andreas Klein authored at least 30 papers between 1998 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
The characterisation of the smallest two fold blocking sets in PG(n, 2).
Des. Codes Cryptogr., 2012

2011
Applications of finite geometry in coding theory and cryptography.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Computational Complexity of NURIKABE.
Fundam. Informaticae, 2011

On the non-minimality of the largest weight codewords in the binary Reed-Muller codes.
Adv. Math. Commun., 2011

2010
Galois geometries and applications.
Des. Codes Cryptogr., 2010

2009
Generalised dual arcs and Veronesean surfaces, with applications to cryptography.
J. Comb. Theory A, 2009

Self-Assembling Finite Automata.
J. Autom. Lang. Comb., 2009

On the Number of Membranes in Unary P Systems
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

2008
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces.
Eur. J. Comb., 2008

Attacks on the RC4 stream cipher.
Des. Codes Cryptogr., 2008

Partial ovoids and partial spreads in hermitian polar spaces.
Des. Codes Cryptogr., 2008

How to say yes, no and maybe with visual cryptography.
Adv. Math. Commun., 2008

2007
Context-Free Grammars with Linked Nonterminals.
Int. J. Found. Comput. Sci., 2007

Extended visual cryptography schemes.
Inf. Comput., 2007

Cellular Devices and Unary Languages.
Fundam. Informaticae, 2007

Parameters for which the Griesmer bound is not sharp.
Discret. Math., 2007

2005
A correction to "The largest small <i>n</i>-dimensional polytope with <i>n</i>+3 vertices": [J. Combin. Theory Ser. A 102 (2003) 401-409].
J. Comb. Theory A, 2005

2003
Fast one-way cellular automata.
Theor. Comput. Sci., 2003

The largest small n-dimensional polytope with n+3 vertices.
J. Comb. Theory A, 2003

2002
Deterministic Turing machines in the range between real-time and linear-time.
Theor. Comput. Sci., 2002

On Interacting Automata with Limited Nondeterminism.
Fundam. Informaticae, 2002

2001
A Time Hierarchy for Bounded One-Way Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
Iterative Arrays with Small Time Bounds.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Real-Time Language Recognition by Alternating Cellular Automata.
Proceedings of the Theoretical Computer Science, 2000

Iterative Arrays With Limited Nondeterministic Communication Cell.
Proceedings of the International Colloquium on Words, 2000

1999
Generalisierte Berechnungen in iterativen Arrays.
PhD thesis, 1999

On time reduction and simulation in cellular spaces.
Int. J. Comput. Math., 1999

Iterative Arrays with a Wee Bit Alternation.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On tally languages and generalized interacting automata.
Proceedings of the Developments in Language Theory, 1999

1998
One Guess One-Way Cellular Arrays.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998


  Loading...