Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540575290, 9783540482116

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Order structures and generalisations of Szpilrajn's theorem

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_68 ◽

1993 ◽

pp. 348-357 ◽

Cited By ~ 3

Author(s):

Ryszard Janicki ◽

Maciej Koutny

Keyword(s):

Order Structures

Download Full-text

A graphic language based on timing diagrams

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_63 ◽

1993 ◽

pp. 306-316

Author(s):

Christian Antoine ◽

Bernard Goff ◽

Jean-Eric Pin

Keyword(s):

Timing Diagrams ◽

Graphic Language

Download Full-text

Reuse of proofs in software verification

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_61 ◽

1993 ◽

pp. 284-293 ◽

Cited By ~ 26

Author(s):

Wolfgang Reif ◽

Kurt Stenzel

Keyword(s):

Software Verification

Download Full-text

A lower bound for solvability of polynomial equations

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_60 ◽

1993 ◽

pp. 268-283

Author(s):

Ketan Mulmuley

Keyword(s):

Lower Bound ◽

Polynomial Equations

Download Full-text

Recursiveness over the complex numbers is time-bounded

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_59 ◽

1993 ◽

pp. 260-267 ◽

Cited By ~ 1

Author(s):

Felipe Cucker ◽

Francesc Rosselló

Keyword(s):

Complex Numbers

Download Full-text

Proving termination of logic programs by transforming them into equivalent term rewriting systems

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_47 ◽

1993 ◽

pp. 114-124 ◽

Cited By ~ 6

Author(s):

G. Aguzzi ◽

U. Modigliani

Keyword(s):

Term Rewriting ◽

Logic Programs ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Data-independences of parallel random access machines

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_46 ◽

1993 ◽

pp. 104-113 ◽

Cited By ~ 3

Author(s):

Klaus-Jörn Lange ◽

Rolf Niedermeier

Keyword(s):

Random Access

Download Full-text

On reduction-based process semantics

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_70 ◽

1993 ◽

pp. 373-387 ◽

Cited By ~ 7

Author(s):

Kohei Honda ◽

Nobuko Yoshida

Download Full-text

Label-selective λ-calculus syntax and confluence

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_41 ◽

1993 ◽

pp. 24-40 ◽

Cited By ~ 2

Author(s):

Hassan Aït-Kaci ◽

Jacques Garrigue

Download Full-text

Complexity results for 1-safe nets

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/3-540-57529-4_66 ◽

1993 ◽

pp. 326-337 ◽

Cited By ~ 22

Author(s):

Allan Cheng ◽

Javier Esparza ◽

Jens Palsberg

Keyword(s):

Complexity Results

Download Full-text

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Order structures and generalisations of Szpilrajn's theorem

A graphic language based on timing diagrams

Reuse of proofs in software verification

A lower bound for solvability of polynomial equations

Recursiveness over the complex numbers is time-bounded

Proving termination of logic programs by transforming them into equivalent term rewriting systems

Data-independences of parallel random access machines

On reduction-based process semantics

Label-selective λ-calculus syntax and confluence

Complexity results for 1-safe nets

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science
Latest Publications