Andreas Klein

Des. Codes Cryptogr., 2012

2011

Applications of finite geometry in coding theory and cryptography.

[BibT_eX]

[DOI]

Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Computational Complexity of NURIKABE.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

On the non-minimality of the largest weight codewords in the binary Reed-Muller codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

2010

Galois geometries and applications.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

2009

Generalised dual arcs and Veronesean surfaces, with applications to cryptography.

[BibT_eX]

[DOI]

Jeroen Schillewaert

J. Comb. Theory, Ser. A, 2009

Self-Assembling Finite Automata.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2009

On the Number of Membranes in Unary P Systems

[BibT_eX]

[DOI]

Rudolf Freund

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.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

Attacks on the RC4 stream cipher.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Partial ovoids and partial spreads in hermitian polar spaces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

How to say yes, no and maybe with visual cryptography.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2008

2007

Context-Free Grammars with Linked Nonterminals.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Extended visual cryptography schemes.

[BibT_eX]

[DOI]

Markus Wessler

Inf. Comput., 2007

Cellular Devices and Unary Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

Parameters for which the Griesmer bound is not sharp.

[BibT_eX]

[DOI]

Klaus Metsch

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].

[BibT_eX]

[DOI]

Markus Wessler

J. Comb. Theory, Ser. A, 2005

2003

Fast one-way cellular automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The largest small n-dimensional polytope with n+3 vertices.

[BibT_eX]

[DOI]

Markus Wessler

J. Comb. Theory, Ser. A, 2003

2002

Deterministic Turing machines in the range between real-time and linear-time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On Interacting Automata with Limited Nondeterminism.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

2001

A Time Hierarchy for Bounded One-Way Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Iterative Arrays with Small Time Bounds.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Real-Time Language Recognition by Alternating Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Iterative Arrays With Limited Nondeterministic Communication Cell.

[BibT_eX]

Proceedings of the International Colloquium on Words, 2000

1999

Generalisierte Berechnungen in iterativen Arrays.

[BibT_eX]

[DOI]

PhD thesis, 1999

On time reduction and simulation in cellular spaces.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1999

Iterative Arrays with a Wee Bit Alternation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

On tally languages and generalized interacting automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

1998

One Guess One-Way Cellular Arrays.

[BibT_eX]

[DOI]