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

9783540505174, 9783540460305

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On functional independencies

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

10.1007/3-540-50517-2_98 ◽

1988 ◽

pp. 487-508 ◽

Cited By ~ 2

Author(s):

Jürgen M. Janas

Download Full-text

Knowledgebases as structured theories

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

10.1007/3-540-50517-2_97 ◽

1988 ◽

pp. 469-486 ◽

Cited By ~ 1

Author(s):

José Fiadeiro ◽

Amílcar Sernadas ◽

Cristina Sernadas

Download Full-text

Algebraic and operational semantics of positive/negative conditional algebraic specifications

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

10.1007/3-540-50517-2_94 ◽

1988 ◽

pp. 419-434

Author(s):

Stéphane Kaplan

Keyword(s):

Operational Semantics ◽

Algebraic Specifications

Download Full-text

Constant-space string-matching

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

10.1007/3-540-50517-2_72 ◽

1988 ◽

pp. 80-87 ◽

Cited By ~ 1

Author(s):

Maxime Crochemore

Keyword(s):

String Matching

Download Full-text

Accumulators: New logic variable abstractions for functional languages

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

10.1007/3-540-50517-2_92 ◽

1988 ◽

pp. 377-399 ◽

Cited By ~ 1

Author(s):

Keshav Pingali ◽

Kattamuri Ekanadham

Keyword(s):

Functional Languages

Download Full-text

A generic algorithm for transaction processing during network partitioning

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

10.1007/3-540-50517-2_99 ◽

1988 ◽

pp. 509-519

Author(s):

Bharat Bhargava ◽

Shirley Browne

Keyword(s):

Transaction Processing ◽

Network Partitioning ◽

Generic Algorithm

Download Full-text

Relation level semantics

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

10.1007/3-540-50517-2_88 ◽

1988 ◽

pp. 304-328

Author(s):

Jules Desharnais ◽

Nazim H. Madhavji

Download Full-text

Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes

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

10.1007/3-540-50517-2_81 ◽

1988 ◽

pp. 193-210 ◽

Cited By ~ 8

Author(s):

Jürgen Kämper

Keyword(s):

Complexity Classes ◽

Proof Systems ◽

New Framework

Download Full-text

On parallel sorting and addition with concurrent writes

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

10.1007/3-540-50517-2_77 ◽

1988 ◽

pp. 143-153

Author(s):

Sanjeev Saxena ◽

P. C. P. Bhatt ◽

V. C. Prasad

Keyword(s):

Parallel Sorting

Download Full-text

Semi-unification

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

10.1007/3-540-50517-2_95 ◽

1988 ◽

pp. 435-454 ◽

Cited By ~ 8

Author(s):

Deepak Kapur ◽

David Musser ◽

Paliath Narendran ◽

Jonathan Stillman

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 functional independencies

Knowledgebases as structured theories

Algebraic and operational semantics of positive/negative conditional algebraic specifications

Constant-space string-matching

Accumulators: New logic variable abstractions for functional languages

A generic algorithm for transaction processing during network partitioning

Relation level semantics

Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes

On parallel sorting and addition with concurrent writes

Semi-unification

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