Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540602491, 9783540447702

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

PRAM's towards realistic parallelism: BRAM's

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_68 ◽

1995 ◽

pp. 363-373 ◽

Cited By ~ 1

Author(s):

Rolf Niedermeier ◽

Peter Rossmanith

Download Full-text

On polynomial ideals, their complexity, and applications

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_42 ◽

1995 ◽

pp. 89-105

Author(s):

Ernst W. Mayr

Keyword(s):

Polynomial Ideals

Download Full-text

Dummy elimination: Making termination easier

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_56 ◽

1995 ◽

pp. 243-252 ◽

Cited By ~ 16

Author(s):

M. C. F. Ferreira ◽

H. Zantema

Download Full-text

On the synchronization of semi-traces

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_71 ◽

1995 ◽

pp. 393-403 ◽

Cited By ~ 1

Author(s):

Klaus Reinhardt

Download Full-text

The power of frequency computation

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_64 ◽

1995 ◽

pp. 323-332 ◽

Cited By ~ 7

Author(s):

Martin Kummer ◽

Frank Stephan

Download Full-text

Optimal contiguous expression DAG evaluations

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_61 ◽

1995 ◽

pp. 293-302

Author(s):

Christoph W. Keßler ◽

Thomas Rauber

Download Full-text

Implementation of a UU-algorithm for primitive recursive tree functions

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_55 ◽

1995 ◽

pp. 233-242

Author(s):

Heinz Faßbender

Keyword(s):

Recursive Tree ◽

Primitive Recursive

Download Full-text

Efficient rewriting in cograph trace monoids

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_47 ◽

1995 ◽

pp. 146-155

Author(s):

Michael Bertol

Download Full-text

From a concurrent λ-calculus to the π-calculus

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_43 ◽

1995 ◽

pp. 106-115 ◽

Cited By ~ 4

Author(s):

Roberto M. Amadio ◽

Lone Leth ◽

Bent Thomsen

Keyword(s):

Π Calculus

Download Full-text

A delegation-based object calculus with subtyping

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-60249-6_40 ◽

1995 ◽

pp. 42-61 ◽

Cited By ~ 29

Author(s):

Kathleen Fisher ◽

John C. Mitchell

Download Full-text

Fundamentals of Computation Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

PRAM's towards realistic parallelism: BRAM's

On polynomial ideals, their complexity, and applications

Dummy elimination: Making termination easier

On the synchronization of semi-traces

The power of frequency computation

Optimal contiguous expression DAG evaluations

Implementation of a UU-algorithm for primitive recursive tree functions

Efficient rewriting in cograph trace monoids

From a concurrent λ-calculus to the π-calculus

A delegation-based object calculus with subtyping

Fundamentals of Computation Theory - Lecture Notes in Computer Science
Latest Publications