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

9783540186250, 9783540480334

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

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

10.1007/3-540-18625-5_68 ◽

1987 ◽

pp. 456-469

Author(s):

V. Arvind ◽

S. Biswas

Keyword(s):

Satisfiability Problem ◽

Cnf Formulas

Download Full-text

Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols

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

10.1007/3-540-18625-5_55 ◽

1987 ◽

pp. 265-281

Author(s):

R. C. Hansdah ◽

L. M. Patnaik

Keyword(s):

Weak Consistency

Download Full-text

Submodule construction as equation solving in CCS

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

10.1007/3-540-18625-5_46 ◽

1987 ◽

pp. 103-123 ◽

Cited By ~ 8

Author(s):

Joachim Parrow

Keyword(s):

Equation Solving

Download Full-text

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

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

10.1007/3-540-18625-5_43 ◽

1987 ◽

pp. 65-78

Author(s):

P. Shanthi Sastry ◽

N. Jayakumar ◽

C. E. Veni Madhavan

Keyword(s):

Efficient Algorithms ◽

Permutation Graphs

Download Full-text

Algebraic operational semantics

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

10.1007/3-540-18625-5_37 ◽

1987 ◽

pp. 1-2

Author(s):

Yuri Gurevich

Keyword(s):

Operational Semantics

Download Full-text

Automata, games, and positive monadic theories of trees

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

10.1007/3-540-18625-5_41 ◽

1987 ◽

pp. 44-57 ◽

Cited By ~ 1

Author(s):

Michel Parigot

Download Full-text

Merge and termination in process algebra

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

10.1007/3-540-18625-5_49 ◽

1987 ◽

pp. 153-172 ◽

Cited By ~ 13

Author(s):

J. C. M. Baeten ◽

R. J. Glabbeek

Keyword(s):

Process Algebra

Download Full-text

Retrospection on the PQCC compiler structure

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

10.1007/3-540-18625-5_71 ◽

1987 ◽

pp. 500-527

Author(s):

K. V. Nori ◽

Sanjeev Kumar ◽

M. Pavan Kumar

Download Full-text

Extension of weakest precondition formalism to a low level language

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

10.1007/3-540-18625-5_70 ◽

1987 ◽

pp. 485-499

Author(s):

A. Sanyal ◽

S. Biswas ◽

V. M. Malhotra

Keyword(s):

Weakest Precondition ◽

Low Level

Download Full-text

An algorithm for colouring perfect planar graphs

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

10.1007/3-540-18625-5_42 ◽

1987 ◽

pp. 58-64 ◽

Cited By ~ 1

Author(s):

Iain A. Stewart

Keyword(s):

Planar Graphs

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

On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols

Submodule construction as equation solving in CCS

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

Algebraic operational semantics

Automata, games, and positive monadic theories of trees

Merge and termination in process algebra

Retrospection on the PQCC compiler structure

Extension of weakest precondition formalism to a low level language

An algorithm for colouring perfect planar graphs

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