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

9783540171799, 9783540472391

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An efficient parallel algorithm for term matching

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

10.1007/3-540-17179-7_31 ◽

1986 ◽

pp. 504-518 ◽

Cited By ~ 5

Author(s):

Rakesh M. Verma ◽

T. Krishnaprasad ◽

I. V. Ramakrishnan

Keyword(s):

Parallel Algorithm

Download Full-text

On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies

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

10.1007/3-540-17179-7_30 ◽

1986 ◽

pp. 488-503 ◽

Cited By ~ 25

Author(s):

Sanjay V. Rajopadhye ◽

S. Purushothaman ◽

Richard M. Fujimoto

Keyword(s):

Systolic Arrays ◽

Recurrence Equations

Download Full-text

Complexity of sufficient-completeness

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

10.1007/3-540-17179-7_26 ◽

1986 ◽

pp. 426-442 ◽

Cited By ~ 6

Author(s):

Deepak Kapur ◽

Paliath Narendran ◽

Hantao Zhang

Download Full-text

A framework for intelligent backtracking in logic programs

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

10.1007/3-540-17179-7_7 ◽

1986 ◽

pp. 108-123 ◽

Cited By ~ 7

Author(s):

Vipin Kumar ◽

Yow-Jian Lin

Keyword(s):

Logic Programs ◽

Intelligent Backtracking

Download Full-text

An implementation of OBJ2: An object-oriented language for abstract program specification

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

10.1007/3-540-17179-7_5 ◽

1986 ◽

pp. 81-95 ◽

Cited By ~ 3

Author(s):

S. Sridhar

Keyword(s):

Object Oriented ◽

Program Specification

Download Full-text

Explicit representation of terms defined by counter examples

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

10.1007/3-540-17179-7_6 ◽

1986 ◽

pp. 96-107 ◽

Cited By ~ 2

Author(s):

J. -L. Lassez ◽

K. Marriott

Keyword(s):

Explicit Representation

Download Full-text

Basis reduction and evidence for transcendence of certain numbers

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

10.1007/3-540-17179-7_16 ◽

1986 ◽

pp. 263-269 ◽

Cited By ~ 1

Author(s):

Ravi Kannan ◽

Lyle A. McGeoch

Keyword(s):

Basis Reduction

Download Full-text

On simple and creative sets in NP

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

10.1007/3-540-17179-7_25 ◽

1986 ◽

pp. 412-425 ◽

Cited By ~ 1

Author(s):

Steven Homer

Download Full-text

An optimal parallel algorithm for dynamic expression evaluation and its applications

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

10.1007/3-540-17179-7_28 ◽

1986 ◽

pp. 453-469 ◽

Cited By ~ 21

Author(s):

Alan Gibbons ◽

Wojciech Rytter

Keyword(s):

Parallel Algorithm ◽

Dynamic Expression ◽

Expression Evaluation

Download Full-text

Recovery of noncurrent variables in source-level debugging of optimized code

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

10.1007/3-540-17179-7_3 ◽

1986 ◽

pp. 36-56

Author(s):

Amitabh Srivastava

Keyword(s):

Source Level ◽

Optimized Code

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

An efficient parallel algorithm for term matching

On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies

Complexity of sufficient-completeness

A framework for intelligent backtracking in logic programs

An implementation of OBJ2: An object-oriented language for abstract program specification

Explicit representation of terms defined by counter examples

Basis reduction and evidence for transcendence of certain numbers

On simple and creative sets in NP

An optimal parallel algorithm for dynamic expression evaluation and its applications

Recovery of noncurrent variables in source-level debugging of optimized code

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