Publications

Smaller Publications

These are not research articles in mathematics.

• Andreas Klein and Herbert Kästner. Konstruktion magischer Quadrate aus verschiedenen Primzahlen. ALPHA, 2:12-15, 1996.
• Andreas Klein. Summen von Quadraten. MNU, Der mathematische und naturwissenschaftliche Unterricht, 4:249-250, 1996.
• Andreas Klein. Kalenderrechnungen. ALPHA, 1:28-29, 1997.
• Andreas Klein. Computeralgebra in Emacs. Computeralgebra Rundbrief, 2008
• Andreas Klein. Mathemaschinen. Einführung in das Computeralgebrasystem Axiom. Linux-Magazin 09/08.
• Andreas Klein and Jens-Cristoph Brendel Eine Teilmenge Allerlei Überblick über die verschiedensten Mathematikprogramme unter Linux. Linux-Magazin 09/08.
• Andreas Klein Mehr Mathe Das neue C++. Linux-Magazin 07/09

Explanations

• ALPHA addresses pupils.
• MNU (Mathematisch Naturwissenschaftlicher Unterricht) addresses teachers at a secondary school
• Der Computeralgebra Rundbrief is published by the Fachgruppe Computeralgebra of the german mathematical socity (DMV).
• The Linux-Magazin is the oldest and most importend german speaking publication for Linux themes.

Masterthesis, Phd. Thesis and Habilitation

A Habilitation is a special german degree that comes after the Phd.

• Andreas Klein. Äußere Mengen zu hyperbolischen Quadriken. Diplomarbeit, Institut für Mathematik Giessen, 1998.
• Andreas Klein. Generalisierte Berechnungen in iterativen Arrays. Dissertation, Institut für Informatik Giessen, 1999.
• Andreas Klein. Faltungscodes Habilitation, Fachbereich für Mathematik und Informatik Kassel, 2005.

Books

• Andreas Klein Visuelle Kryptographie Springer, 2007.

Journals and Conference Proceedings

All publication conference proceedings are refviewed like the journal articles by at least to indepentent referees.

• Andreas Klein. Ein neues iteratives Kryptosystem. Mitteilungen aus dem Mathem. Seminar Giessen, 229:29--44, 1997.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. One guess one-way cellular arrays. In Lubros Brim et al., editor, Mathematical Foundations of Computer Science 1998, Band 1450 von LNCS, Seiten 807--815, 1998.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. On time reduction and simulation in cellular spaces. International Journal of Computer Mathematics, 75, 1999.
• Andreas Klein. Exterior sets of hyperbolic quadrics. Bul. Belg. Math. Soc., 7:321-331, 2000.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. On tally languages and generalised interacting automata. In DLT 99, Seiten 19--20. Developments in Language Theory, World Scientific Publishing, Singapore.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. Iterative arrays with a wee bit alternation. In FCT 99, Band 1684 von LNCS, Seiten 173--184. Fundamentals of Computation Theory, Springer, 1999.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. Iterative Arrays with nondeterministic Communication Cell. In ICWLC. International Colloquium on Words, Languages and Combinatorics, 2000.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. Real-Time Language Recognition by Alternating Cellular Automata. In TCS 2000 IFIP International Conference on Theoretical Computer Sciences - Exploring New Frontier of Theoretical Informatics, Band 1872 von LNCS, Seiten 213--225., Springer, 2000.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. On Interacting Automata with Limited Nondeterminism. Fundamenta Informaticae, 2000.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. Iterative Arrays with small time Bounds. In MFCS 2000, Band 1893 von LNCS, Seiten 243--252. Mathematicla Foundations of Computer Science, Springer, 2000.
• Andreas Klein and Martin Kutrib. A Time Hierachie for Bounded One--Way Cellular Automata. In MFCS 2001, Band 2136 von LNCS, Seiten 439--450. Mathematicla Foundations of Computer Science, Springer, 2001.
• Andreas Klein, Martin Kutrib. Deterministic Turing machines in the range between real-time and linear-time. Theoretical Computer Science, 289 Seiten 253-275, 2002.
• Thomas Buchholz, Andreas Klein and Martin Kutrib. Iterative arrays with limited nondeterministic communication cell. In M. Ito (ed.): Words, Languages and Combinatorics, World Scientific Publishing, Singapore (2003), 73-87.
• Andreas Klein and Martin Kutrib Fast One-Way Cellular Automata. Theoretical Computer Science 295 (2003) 233-250.
• Andreas Klein and Martin Kutrib. Self-Assembling Finite Automata. In O. H. Ibarra, L. Zhang (eds.): Computing and Combinatorics (COCOON 2002), LNCS 2387, Springer 2002, 310-319.
• Andreas Klein. Partial Ovoids in Classical Finite Polar Spaces. Designs, Codes and Cryptography. 31 (2004) 221-226
• Andreas Klein and Markus Wessler. The largest small Polytopes. Journal of Combinatic Theory, Ser. A. 102, Seiten 401-409, 2003 Correction to: The largest small Polytopes Journal of Combinatic Theory, Ser. A. XXX
• Andreas Klein. On codes meeting the Griesmer bound. Disc. Math. 274 (2004) 289-297
• Andreas Klein. On perfect deletion-correcting codes. Journal of Combinatorial Designs 12(1) (2004) 72-77.
• Markus Holzer, Andreas Klein and Martin Kutrib. On The NP-Completeness of The NURIKABE Pencil Puzzle and Vaiants Thereof. FUN 2004
• Andreas Klein and Markus Wessler. Extended visual cryptography schemes. Information and Computation. to appear
• Andreas Klein and Klaus Metsch. New results on covers and partial spreads of polar spaces. Innovations in Incidence Geometry, 1 (2005)
• Andreas Klein Einführung in die visuelle Kryptographie. Mitteilungen der DMV 13-1, 2005
• Andreas Klein and Markus Wessler. On partitions of the q-ary Hamming Space in few spheres. Journal of Cominatorial Designs 14 (2006), 183-201
• Andreas Klein. A generalized Kahan-Babuška-Summation-Algorithm. Computing 76 (2006), 279-293
• Andreas Klein and Martin Kutrib. Cellular Devices and Unary Languages. Fundamenta Informaticae, to appear
• Andreas Klein and Klaus Metsch. Parameters for which the Griesmer bound is not sharp. Disc. Math., to appear
• Jan De Beule, Andereas Klein, Klaus Metsch and Leo Storme Partial ovoids and partial spreads in hermitian polar spaces Designs, Codes and Cryptography, to appear
• Andreas Klein and Martin Kutrib Context-free grammars with linked nonterminals. International Journal of Foundations of Computer Science, Volume 18 (6), 2007
• Andreas Klein Attacks on the RC4 stream cipher Designs, Codes and Cryptography 48(3), 2008
• Andreas Klein Different Attacks against the RC4 stream cipher Proceeding of the contact form, Bruessel 2008
• Andreas Klein, Jeroen Schillewart and Leo Storme Generalised dual arcs and Veroneseans surfaces with applications to cryptography Erscheint bei: Journal of Combinatorial Theory, Ser. A.
• Jan De Beule, Andereas Klein, Klaus Metsch and Leo Storme Partial ovoids and partial spreads in symplectic and orthogonal polar spaces European Journal of Combinatorics, 29 (2008), 1280-1297.
• Andreas Klein How to say Yes, No and Maybe with visual cryptography Advances in Mathematics of Communication, to appear
• Rudolf Freund, Andreas Klein, and Martin Kutrib On the Number of Membranes in Unary P Systems Erscheint bei: Descriptional Complexity of Formal Systems, Lecture Notes in Computersices.

Submitted Articles

• Andreas Klein Fast Substring Matching
• Andreas Klein, Klaus Metsch and Leo Storme Small maximal spreads in classical finite polar spaces
• Andreas Klein, Jeroen Schillewart and Leo Storme Generalised Veroneseans
• Andreas Klein A fast correlation attack
• Andreas Klein Fast computation of certain RC4 patterns
• Jan De Beule, Andereas Klein, Klaus Metsch and Leo Storme Partial ovoids and partial spreads of classical finite polar spaces

Talks at Conferences

• Andreas Klein. Iterative Arrays mit eingeschränktem Nichtdeterminismus. In Automaten und formale Sprachen, Seiten 31--32. 8. Theorietag der GI-Fachgruppe 0.1.5, 1998.
• Andreas Klein. Zeithierachiesätze für iterative Arrays. Automaten und formale Sprachen, Seiten 40--41. 9. Theorietag der GI-Fachgruppe 0.1.5, 1999.
• Thomas Buchholz, Andreas Klein und Martin Kutrib. Bounded Alternating Transitions in Iterative Arrays. In Automata' 99, Seiten 17--18. Workshop on Cellular Automata, 4th IFIP WG 1.5 Meeting, 1999.
• Thomas Buchholz, Andreas Klein und Martin Kutrib. Real--Time Recognition by Alternating Cellular Automata. In Automata' 99, Seiten 19--20. Workshop on Cellular Automata, 4th IFIP WG 1.5 Meeting, 1999.
• Andreas Klein. Parsen von erweiterten regulären Ausdrücken Theorietag 2000, Wien Österreich, Seiten 193-194.
• Andreas Klein und Martin Kutrib. Time-Hierachies for One--Way Cellular Automata. In CA 2000, Seite 29. International Workshop on Cellular Automata, 6th IFIP WG 1.5 Meeting, 2000.
• Andreas Klein. Faltungscodes aus Sicht der Automatentheorie Theorietag 2001, Wendgäben, Seite 79.
• Andreas Klein. Verallgemeinerte kontextfreie Grammatiken Theorietag 2002, Wittenberg, Seite 32-33.
• Andreas Klein. Algorithmen zur Korrektur von Fehlerbündeln mittels Faltungscodes Tagung der Fachgruppe Computeralgebra der DMV, Kassel 2003, Seite 8-9.
• Markus Holzer, Andreas Klein, Matrin Kutrib. On the NP-compleatness of the NURIKABE puzzle and variants thereof Theorietag 2003, München.
• Andreas Klein Erweiterte visuelle Kryptographie DMV Jahestagung 2004, Heidelberg Preis für den besten Vortrag in der Sektion Computeralgebra
• Andreas Klein Erweiterte visuelle Kryptographie CRYPTO-TAG 2005, Ulm
• Andreas Klein New results on covers and partial spreads of polar spaces ALCOMA 2005, Thurnau
• Andreas Klein Angriffe auf RC4 Tagung der Fachgruppe Computeralgebra 2005, Kassel
• Andreas Klein Partielle Ovoide von klassischen endlichen Polarräumen Baer-Kolloquium, Gießen 2005
• Andreas Klein Zur Sicherheit von RC4 CRYPTO-TAG 2005, Darmstadt
• Andreas Klein Fast Substring Matching Theorietag 2005, Lauterbad.
• Andreas Klein Härten von RC4 artigen Cryptosystemen CRYPTO-TAG 2006, Bochum
• Andreas Klein und Markus Wessler On partitions of the q-ary Hamming Space in few spheres Combinatorics 2006, Ischia.
• Andreas Klein und Klaus Metsch Parameters for which the Griesmer bound is not sharp Finite Geometry, Second Irsee Conference, Irsee 2006.

Last changed at2 15. 06. 2009

Navigation

• Home : Back to the Homepage of Andreas Klein
• Publications : All articles I have published so fare.
• Teaching : The lectures I have given in the last years.
  • Codierungstheorie WS2005
  • Kryptographie SS2005
  • Codierungstheorie WS2004
  • Seminar Geometrie WS2004 : Lehramt Grund-, Haupt-, Realschule
  • Kryptographie SS2004
  • Algebra II SS2004
  • Diskrete Mathematik II WS2003
  • Diskrete Mathematik I SS2003
  • Seminar Codierungstheorie und Kryptographie WS2002
  • Elementare Zahlentheorie WS2002
  • Diskrete Mathematik SS2002
  • Kryptographie SS2002
  • Einführung in die Programmierung WS2001
  • Computeralgebra SS2001
  • Algebra 1 WS2000
  • Programmierkurs Java WS2000
  • Programmierkurs C++ SS2000
  • Programmierkurs Perl WS1999
  • Programmierkurs C++ SS1999
  • Wissenschaftliche Grundlagen des Mathematischen Schulstoffs SS1998
• Mathematics : Even more mathematical links.
  • Visual Cryptography : Examples to Visual Kryptography, see also DMV Mitteilungen 1/2005
  • RC4 : An Attack against the RC4 stream chiffre, presented at the meeting of Fachgruppe Computeralgebra, Kassel 2005
  • Population Count : Conting 1 bits in an array.
  • RSA : Unsafe RSA intances
  • Galois extensions : Use this database to find polynomials with prescribe Galois group. The database was complied by J. Klüners and G. Malle, the Web interface is my work.
  • Contests : A list of mathematical contests for students.
• Computer : Programs, etc.
  • Debian Packages : A little Perl script that generates a Debian package from a Perl module.
  • CSS : Here I explain how I have constructed this side.
  • Literate Programming : Literate Programming allows the generation of documentation directly form the source code. Here is my own literate programming system.
  • Tuxmath : Tuxmath is for execising basic calculus. This is modification of tuxmath that include mental calculus tricks.