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

9783540520481, 9783540468721

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A new class of separators and planarity of chordal graphs

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

10.1007/3-540-52048-1_30 ◽

1989 ◽

pp. 30-43 ◽

Cited By ~ 4

Author(s):

P. Sreenivasa Kumar ◽

C. E. Veni Madhavan

Keyword(s):

Chordal Graphs ◽

New Class

Download Full-text

A proof system for communicating processes with value-passing (extended abstract)

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

10.1007/3-540-52048-1_54 ◽

1989 ◽

pp. 325-339 ◽

Cited By ~ 2

Author(s):

M. Hennessy

Keyword(s):

Proof System ◽

Communicating Processes

Download Full-text

The frobenius problem

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

10.1007/3-540-52048-1_47 ◽

1989 ◽

pp. 242-251 ◽

Cited By ~ 3

Author(s):

Ravi Kannan

Keyword(s):

Frobenius Problem

Download Full-text

Query evaluation with null values: How complex is completeness?

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

10.1007/3-540-52048-1_45 ◽

1989 ◽

pp. 204-222 ◽

Cited By ~ 4

Author(s):

V. S. Lakshmanan

Keyword(s):

Query Evaluation ◽

Null Values

Download Full-text

A natural semantics for logic programs with negation

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

10.1007/3-540-52048-1_34 ◽

1989 ◽

pp. 78-88 ◽

Cited By ~ 6

Author(s):

Phan Minh Dung ◽

Kanchana Kanchanasut

Keyword(s):

Logic Programs

Download Full-text

A linear-time recognition algorithm for P 4-reducible graphs

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

10.1007/3-540-52048-1_28 ◽

1989 ◽

pp. 1-19 ◽

Cited By ~ 4

Author(s):

B. Jamison ◽

S. Olariu

Keyword(s):

Linear Time ◽

Recognition Algorithm

Download Full-text

Impossibility results in the presence of multiple faulty processes

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

10.1007/3-540-52048-1_37 ◽

1989 ◽

pp. 109-120 ◽

Cited By ~ 7

Author(s):

Gadi Taubenfeld ◽

Shumel Katz ◽

Shlomo Moran

Keyword(s):

Impossibility Results

Download Full-text

Parallel parsing on a one-way linear array of finite-state machines

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

10.1007/3-540-52048-1_51 ◽

1989 ◽

pp. 291-300 ◽

Cited By ~ 2

Author(s):

Oscar H. Ibarra ◽

Tao Jiang ◽

Hui Wang

Keyword(s):

Linear Array ◽

Finite State Machines ◽

State Machines ◽

Finite State

Download Full-text

Gate matrix layout revisited: Algorithmic performance and probabilistic analysis

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

10.1007/3-540-52048-1_50 ◽

1989 ◽

pp. 280-290 ◽

Cited By ~ 1

Author(s):

Sajal K. Das ◽

Narsingh Deo ◽

Sushil Prasad

Keyword(s):

Probabilistic Analysis ◽

Gate Matrix

Download Full-text

Fast parallel approximations of the maximum weighted cut problem through derandomization

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

10.1007/3-540-52048-1_29 ◽

1989 ◽

pp. 20-29 ◽

Cited By ~ 7

Author(s):

Grammati Pantziou ◽

Paul Spirakis ◽

Christos Zaroliagis

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

A new class of separators and planarity of chordal graphs

A proof system for communicating processes with value-passing (extended abstract)

The frobenius problem

Query evaluation with null values: How complex is completeness?

A natural semantics for logic programs with negation

A linear-time recognition algorithm for P 4-reducible graphs

Impossibility results in the presence of multiple faulty processes

Parallel parsing on a one-way linear array of finite-state machines

Gate matrix layout revisited: Algorithmic performance and probabilistic analysis

Fast parallel approximations of the maximum weighted cut problem through derandomization

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