default search action
Andreas Klein 0001
Person information
- affiliation: Ghent University, Belgium
- affiliation: University of Giessen, Gießen, Germany
Other persons with the same name
- Andreas Klein — disambiguation page
- Andreas Klein 0002 — University of Kaiserslautern, Germany
- Andreas Klein 0003 — University of Freiburg, Germany
- Andreas Klein 0004 — Hochschule für Angewandte Wissenschaften München, Germany (and 1 more)
- Andreas Klein 0005 — University of Duisburg-Essen, Germany
- Andreas Klein 0006 — University of Kassel, Germany
- Andreas Klein 0007 — University of Erlangen-Nuremberg, Germany
- Andreas Klein 0008 — Spiegel Institut Mannheim, Brühl, Germany
- Andreas Klein 0009 — Charité Berlin, Institute of Molecular Biology and Bioinformatics, Germany
- Andreas Klein 0010 — RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j20]Manohar L. Aggarwal, Andreas Klein, Leo Storme
:
The characterisation of the smallest two fold blocking sets in PG(n, 2). Des. Codes Cryptogr. 63(2): 149-157 (2012) - 2011
- [j19]Andreas Klein, Leo Storme
On the non-minimality of the largest weight codewords in the binary Reed-Muller codes. Adv. Math. Commun. 5(2): 333-337 (2011) - [j18]Markus Holzer
Computational Complexity of NURIKABE. Fundam. Informaticae 110(1-4): 159-174 (2011) - [p1]Andreas Klein, Leo Storme:
Applications of finite geometry in coding theory and cryptography. Information Security, Coding Theory and Related Combinatorics 2011: 38-58 - 2010
- [j17]Jan De Beule
Galois geometries and applications. Des. Codes Cryptogr. 56(2-3): 85-86 (2010)
2000 – 2009
- 2009
- [j16]Andreas Klein, Martin Kutrib
Self-Assembling Finite Automata. J. Autom. Lang. Comb. 14(1): 75-92 (2009) - [j15]Andreas Klein, Jeroen Schillewaert, Leo Storme
Generalised dual arcs and Veronesean surfaces, with applications to cryptography. J. Comb. Theory A 116(3): 684-698 (2009) - [c9]Rudolf Freund, Andreas Klein, Martin Kutrib
On the Number of Membranes in Unary P Systems. DCFS 2009: 101-109 - 2008
- [j14]Andreas Klein:
How to say yes, no and maybe with visual cryptography. Adv. Math. Commun. 2(3): 249-259 (2008) - [j13]Jan De Beule
Partial ovoids and partial spreads in hermitian polar spaces. Des. Codes Cryptogr. 47(1-3): 21-34 (2008) - [j12]Andreas Klein:
Attacks on the RC4 stream cipher. Des. Codes Cryptogr. 48(3): 269-286 (2008) - [j11]Jan De Beule
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. Eur. J. Comb. 29(5): 1280-1297 (2008) - 2007
- [j10]Andreas Klein, Klaus Metsch:
Parameters for which the Griesmer bound is not sharp. Discret. Math. 307(22): 2695-2703 (2007) - [j9]Andreas Klein, Martin Kutrib
Cellular Devices and Unary Languages. Fundam. Informaticae 78(3): 343-368 (2007) - [j8]Andreas Klein, Markus Wessler:
Extended visual cryptography schemes. Inf. Comput. 205(5): 716-732 (2007) - [j7]Andreas Klein, Martin Kutrib
Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007) - 2005
- [j6]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 A 112(1): 173-174 (2005) - 2003
- [j5]Andreas Klein, Markus Wessler:
The largest small n-dimensional polytope with n+3 vertices. J. Comb. Theory A 102(2): 401-409 (2003) - [j4]Andreas Klein, Martin Kutrib
Fast one-way cellular automata. Theor. Comput. Sci. 295: 233-250 (2003) - 2002
- [j3]Thomas Buchholz, Andreas Klein, Martin Kutrib
On Interacting Automata with Limited Nondeterminism. Fundam. Informaticae 52(1-3): 15-38 (2002) - [j2]Andreas Klein, Martin Kutrib
Deterministic Turing machines in the range between real-time and linear-time. Theor. Comput. Sci. 289(1): 253-275 (2002) - [c8]Andreas Klein, Martin Kutrib
Self-Assembling Finite Automata. COCOON 2002: 310-319 - 2001
- [c7]Andreas Klein, Martin Kutrib
A Time Hierarchy for Bounded One-Way Cellular Automata. MFCS 2001: 439-450 - 2000
- [c6]Thomas Buchholz, Andreas Klein, Martin Kutrib:
Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics 2000: 73-87 - [c5]Thomas Buchholz, Andreas Klein, Martin Kutrib
Real-Time Language Recognition by Alternating Cellular Automata. IFIP TCS 2000: 213-225 - [c4]Thomas Buchholz, Andreas Klein, Martin Kutrib
Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252 - [i1]Andreas Klein, Martin Kutrib
Deterministic Turing Machines in the Range between Real-Time and Linear-Time. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [b1]Andreas Klein:
Generalisierte Berechnungen in iterativen Arrays. University of Giessen, Gießen, Germany, 1999, pp. 1-102 - [j1]Thomas Buchholz, Andreas Klein, Martin Kutrib
On time reduction and simulation in cellular spaces. Int. J. Comput. Math. 71(4): 459-474 (1999) - [c3]Thomas Buchholz, Andreas Klein, Martin Kutrib
On tally languages and generalized interacting automata. Developments in Language Theory 1999: 316-325 - [c2]Thomas Buchholz, Andreas Klein, Martin Kutrib
Iterative Arrays with a Wee Bit Alternation. FCT 1999: 173-184 - 1998
- [c1]Thomas Buchholz, Andreas Klein, Martin Kutrib
One Guess One-Way Cellular Arrays. MFCS 1998: 807-815
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: