Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540091189, 9783540355175

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An efficient on-line position tree construction algorithm

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_21 ◽

1979 ◽

pp. 190-198

Author(s):

M. Majster ◽

A. Reiser

Keyword(s):

Line Position ◽

Construction Algorithm ◽

Tree Construction ◽

On Line

Download Full-text

Information content characterizations of complexity theoretic properties

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_8 ◽

1979 ◽

pp. 58-66 ◽

Cited By ~ 1

Author(s):

Victor L. Bennison

Keyword(s):

Information Content

Download Full-text

Negative results on counting

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_6 ◽

1979 ◽

pp. 38-46 ◽

Cited By ~ 1

Author(s):

L. G. Valiant

Keyword(s):

Negative Results

Download Full-text

Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_32 ◽

1979 ◽

pp. 310-318 ◽

Cited By ~ 1

Author(s):

Kai Wöhl

Download Full-text

Can partial correctness assertions specify programming language semantics?

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_3 ◽

1979 ◽

pp. 25-26 ◽

Cited By ~ 1

Author(s):

Irene Greif ◽

Albert R. Meyer

Keyword(s):

Programming Language ◽

Partial Correctness ◽

Programming Language Semantics ◽

Language Semantics

Download Full-text

Transition diagrams and strict deterministic grammars

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_13 ◽

1979 ◽

pp. 113-123 ◽

Cited By ~ 5

Author(s):

Dietmar Friede

Download Full-text

Strong non-deterministic context-free languages

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_7 ◽

1979 ◽

pp. 47-57

Author(s):

Joffroy Beauquier

Keyword(s):

Context Free

Download Full-text

Remarks on the nonexistence of some covering grammars

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_31 ◽

1979 ◽

pp. 298-309 ◽

Cited By ~ 2

Author(s):

Esko Ukkonen

Download Full-text

On the additive complexity of polynomials and some new lower bounds

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_30 ◽

1979 ◽

pp. 286-297 ◽

Cited By ~ 1

Author(s):

C. P. Schnorr

Keyword(s):

Lower Bounds ◽

Additive Complexity

Download Full-text

Über eine minimale universelle Turing-Maschine

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference ◽

10.1007/3-540-09118-1_26 ◽

1979 ◽

pp. 244-259

Author(s):

Lutz Priese

Download Full-text

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI ConferenceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

An efficient on-line position tree construction algorithm

Information content characterizations of complexity theoretic properties

Negative results on counting

Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme

Can partial correctness assertions specify programming language semantics?

Transition diagrams and strict deterministic grammars

Strong non-deterministic context-free languages

Remarks on the nonexistence of some covering grammars

On the additive complexity of polynomials and some new lower bounds

Über eine minimale universelle Turing-Maschine

Lecture Notes in Computer Science - Theoretical Computer Science 4th GI Conference
Latest Publications