Lecture Notes in Computer Science - Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540081388, 9783540373896

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The LBA-problem and the transformability of the class ɛ2

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_29 ◽

1977 ◽

pp. 339-350

Author(s):

B. Monien

Download Full-text

An algorithm for transitive closure with linear expected time

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_28 ◽

1977 ◽

pp. 329-338 ◽

Cited By ~ 2

Author(s):

C. -P. Schnorr

Keyword(s):

Transitive Closure ◽

Expected Time

Download Full-text

Grobstrukturen für kontextfreie Grammatiken

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_8 ◽

1977 ◽

pp. 96-105

Author(s):

E. -W. Dieterich

Download Full-text

Systemes schematiques generalises

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_16 ◽

1977 ◽

pp. 184-189 ◽

Cited By ~ 1

Author(s):

L. Kott

Download Full-text

Formale Korrektheitsbeweise für While-Programme

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_17 ◽

1977 ◽

pp. 190-207

Author(s):

J. Loeckx

Download Full-text

Informatique et algebre la theorie des codes a longueur variable

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_3 ◽

1977 ◽

pp. 27-44 ◽

Cited By ~ 12

Author(s):

J. -F. Perrot

Download Full-text

Un langage algebrique non-generateur

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_12 ◽

1977 ◽

pp. 145-148 ◽

Cited By ~ 1

Author(s):

L. Boasson

Download Full-text

On polynomial time isomorphisms of complete sets

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_1 ◽

1977 ◽

pp. 1-16 ◽

Cited By ~ 4

Author(s):

L. Berman ◽

J. Hartmanis

Keyword(s):

Polynomial Time ◽

Complete Sets

Download Full-text

Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_30 ◽

1977 ◽

pp. 351-367 ◽

Cited By ~ 1

Author(s):

M. Stadel

Download Full-text

Decidabilite de la finitude des demi-groupes de matrices

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/3-540-08138-0_22 ◽

1977 ◽

pp. 259-269 ◽

Cited By ~ 3

Author(s):

G. Jacob

Download Full-text

Lecture Notes in Computer Science - Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The LBA-problem and the transformability of the class ɛ2

An algorithm for transitive closure with linear expected time

Grobstrukturen für kontextfreie Grammatiken

Systemes schematiques generalises

Formale Korrektheitsbeweise für While-Programme

Informatique et algebre la theorie des codes a longueur variable

Un langage algebrique non-generateur

On polynomial time isomorphisms of complete sets

Das Normalisierungsproblem und der Zusammenhang mit der Zeitkomplexität der kontextsensitiven Analyse

Decidabilite de la finitude des demi-groupes de matrices

Lecture Notes in Computer Science - Theoretical Computer Science
Latest Publications