Gerhard Lischke

According to our database1, Gerhard Lischke authored at least 23 papers between 1975 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Root clustering of words.
RAIRO - Theor. Inf. and Applic., 2014

2007
Corrigendum to "Generalized periodicity and primitivity for words".
Math. Log. Q., 2007

Generalized periodicity and primitivity for words.
Math. Log. Q., 2007

2006
Restorations of punctured languages and similarity of languages.
Math. Log. Q., 2006

2005
Squares of regular languages.
Math. Log. Q., 2005

2002
Roots and Powers of Regular Languages.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
The Root of a Language and Its Complexity.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

1999
Towards the Actual Relationship Between NP and Exponential Time.
Math. Log. Q., 1999

1990
Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989
Inklusion und Separation von Polynomial- und Exponentialzeitklassen bei Relativierungen.
PhD thesis, 1989

The Quality of Separation Between Polynomial Time and Exponential Time.
Elektronische Informationsverarbeitung und Kybernetik, 1989

Types of Separations for Relativized Complexity Classes.
Elektronische Informationsverarbeitung und Kybernetik, 1989

1987
Relativizations of NP and EL, Strongly Separating, and Sparse Sets.
Elektronische Informationsverarbeitung und Kybernetik, 1987

1986
Oracle-Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP.
Math. Log. Q., 1986

1981
Two Types of Properties for Complexity Measures.
Inf. Process. Lett., 1981

1979
Some Considerations about Complexity for Mazurkiewicz-algorithms.
Elektronische Informationsverarbeitung und Kybernetik, 1979

1978
Complexity Measures Defined by Mazurkiewicz-Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Natürliche Kompliziertheitsmasze und Erhaltungssätze II.
Math. Log. Q., 1977

Zwei Sätze Für Schwache Erhaltungsmasze.
Math. Log. Q., 1977

1976
Natürliche Kompliziertheitsmasze und Erhaltungssätze I.
Math. Log. Q., 1976

1975
Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse.
Math. Log. Q., 1975

Flußbildmaße.
Elektronische Informationsverarbeitung und Kybernetik, 1975

Flußbildmaße - Ein Versuch zur Definition natürlicher Kompliziertheitsmaße.
Elektronische Informationsverarbeitung und Kybernetik, 1975


  Loading...