---

Prof. Dr. Ludwig Staiger

Prof. Dr. Ludwig Staiger (*1948, Jena) studied Mathematics at the Friedrich-Schiller-Universität Jena   (Diplom 1970, Promotion 1977, Habilitation 1979). From 1970 till 1973 he had a postgraduate study at the Yerevan State University (with Prof. R. R. Varshamov). From 1973 till 1982 he was staff member at the mathematical department  of the Friedrich-Schiller-Universität Jena.
From 1982 till 1989 he was a scientific researcher  at the Academy of Sciences in Berlin (East): at the Cental Institute of Cybernetics and Information Processes and at the Karl-Weierstraß-Institute of Mathematics.
In 1989 he was Associate Professor for Algebra at the Technical University Otto-von-Guericke Magdeburg.
In the years 1990 till 1995 he was visiting professor at the RWTH Aachen, the universities Dortmund, Siegen, Cottbus and again at the RWTH Aachen, and was a guest professor at the TU Wien.
Since April 1, 1995 he is full professor for Theoretical Computer Science at the Martin-Luther-Universität Halle-Wittenberg.
From September 2000 till August 2006 he was the head of the Department for Mathematics and Computer Scinece.

Dr. Staiger`s Erdös number    is 2.

Dr. Staiger is external researcher of the CDMTCS.

He is a member of the Advisory Board of the Journal of Automata, Languages and Combinatorics   .

Recent publications

Ludwig Staiger, Oscillation-free Chaitin h-random sequences,
Electronic Colloquium on Computational Complexity TR 11-132   

Ludwig Staiger, Constructive Dimension and Hausdorff Dimension: The
Case of Exact Dimension,
in: Fundamentals of Computation Theory,
(O. Owe, M. Steffen and A. Telle Eds.)  Lecture Notes in
Comput. Sci. No. 6914, Springer-Verlag, Berlin 2011, 252 - 263.

Ludwig Staiger, From Error-Correcting Codes to Algorithmic Information Theory, in: Randomness Through Computation: Some Answers, More Questions (H. Zenil Ed.), World Scientific, Singapore 2011, 293 - 296.

Christian S. Calude, André Nies, Ludwig Staiger und Frank Stephan,
Universal Recursively Enumerable Sets of Strings,
Theoret. Comput. Sci. 412 (2011), 2253 – 2261.

Ludwig Staiger, Joint Topologies for Finite and Infinite Words,
in: Developments in Language Theory, (Yuan Gao, Hanlin Lu, Shinnosuke
Seki and Sheng Yu Eds.), Lecture Notes in
Comput. Sci. No. 6224, Springer-Verlag, Berlin 2010, 442 - 443.

Sibylle Schwarz and Ludwig Staiger
Topologies refining the Cantor topology on X^ω,
in: Theoretical Computer Science (Cristian S. Calude et al. Eds.), IFIP Advances in  Information and Communication Technology Vol. 323, Springer-Verlag, Berlin 2010, 271 - 285,

Ronny Polley and Ludwig Staiger,
The maximal subword complexity of quasiperiodic infinite words,
in:  Proceedings Twelfth Annual Workshop on Descriptional Complexity of  Formal Systems, (I. McQuillan and G. Pighizzini Eds.),  Electronic  Proceedings in Theoretical Computer Science, Vol.~31 (2010), 169 - 176.
1008.1659    (externe Datei)

Ludwig Staiger and Klaus Wagner,
There are 49 Kuratowski Lattices,
in:  'Programs, Proofs, Processes', (F. Ferreira, H. Guera,  E. Mayordomo  and L. Rasga Eds.), Proc. 6th Conf. CiE 2010, Abstract and Handout Booklet, Univ. of the Acores,Ponta Delgada 2010, 357 - 368.
accepted_papers.html    (externe Datei)

Jöran Mielke and Ludwig Staiger,
On Oscillation-free ε-random Sequences II,
in: Proc. 6th International Conf. Computability and Complexity in Analysis (CCA 2009), (A. Bauer, P. Hertling and Ker-I Ko Eds.),Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
2269    (externe Datei)

Christian S. Calude, Helmut Jürgensen und Ludwig Staiger,
Topology on Words,
Theoret. Comput. Sci. 410 (2009), 2323 - 2335.

Christian S. Calude und Ludwig Staiger,
On Universal Computably Enumerable Prefix Codes,
Mathematical Structures in Computer Science 19 (2009), 45 - 57.

Up