Lecture Notes in Computer Science - Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

3540119736

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On algebras of computation sequences and proofs of equivalence of operational and denotational semantics

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036489 ◽

2006 ◽

pp. 289-299

Author(s):

Axel Poigné

Keyword(s):

Denotational Semantics

Download Full-text

Some operations and transductions that preserve rationality

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036488 ◽

2006 ◽

pp. 277-288 ◽

Cited By ~ 4

Author(s):

J. -E. Pin ◽

J. Sakarovitch

Download Full-text

A multifit algorithm for uniform multiprocessor scheduling

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036479 ◽

2006 ◽

pp. 175-185 ◽

Cited By ~ 4

Author(s):

Manfred Kunde

Keyword(s):

Multiprocessor Scheduling

Download Full-text

Controlled relativizations of P and NP

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036471 ◽

2006 ◽

pp. 85-90 ◽

Cited By ~ 1

Author(s):

Ronald V. Book ◽

Timothy J. Long ◽

Alan L. Selman

Download Full-text

A general scheme for some deterministically parsable grammars and their strong equivalents

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036485 ◽

2006 ◽

pp. 243-255

Author(s):

Anton Nijholt ◽

Jan Pittl

Keyword(s):

General Scheme

Download Full-text

Algebraic and operational semantics of exceptions and errors

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036476 ◽

2006 ◽

pp. 141-151

Author(s):

M. Gogolla ◽

K. Drosten ◽

U. Lipeck ◽

H. D. Ehrich

Keyword(s):

Operational Semantics

Download Full-text

Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036492 ◽

2006 ◽

pp. 325-333

Author(s):

Kurt Sieber

Download Full-text

Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036490 ◽

2006 ◽

pp. 301-311 ◽

Cited By ~ 2

Author(s):

Patrice Séébold

Download Full-text

Discreteness, K-density and D-continuity of occurrence nets

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036470 ◽

2006 ◽

pp. 73-83 ◽

Cited By ~ 2

Author(s):

Eike Best ◽

Agathe Merceron

Download Full-text

On the crossing-free, rectangular embedding of weighted graphs in the plane

Lecture Notes in Computer Science - Theoretical Computer Science ◽

10.1007/bfb0036469 ◽

2006 ◽

pp. 61-72

Author(s):

Bernd Becker

Keyword(s):

Weighted Graphs

Download Full-text

Lecture Notes in Computer Science - Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

On algebras of computation sequences and proofs of equivalence of operational and denotational semantics

Some operations and transductions that preserve rationality

A multifit algorithm for uniform multiprocessor scheduling

Controlled relativizations of P and NP

A general scheme for some deterministically parsable grammars and their strong equivalents

Algebraic and operational semantics of exceptions and errors

Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi

Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits

Discreteness, K-density and D-continuity of occurrence nets

On the crossing-free, rectangular embedding of weighted graphs in the plane

Lecture Notes in Computer Science - Theoretical Computer Science
Latest Publications