Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993
Latest Publications

TOTAL DOCUMENTS

68

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540571827, 9783540479277

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximate and exact deterministic parallel selection

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_27 ◽

1993 ◽

pp. 352-361 ◽

Author(s):

Shiva Chaudhuri ◽

Torben Hagerup ◽

Rajeev Raman

Keyword(s):

Parallel Selection

Download Full-text

Real-time refinement: Semantics and application

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_60 ◽

1993 ◽

pp. 693-702 ◽

Author(s):

David Scholefield ◽

Hussein Zedan ◽

He Jifeng

Keyword(s):

Download Full-text

On the communication complexity of parallel computation

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_43 ◽

1993 ◽

pp. 517-526

Author(s):

Oscar H. Ibarra ◽

Nicholas Trân

Keyword(s):

Parallel Computation ◽

Communication Complexity

Download Full-text

An expressive logic for Basic Process Algebra

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_37 ◽

1993 ◽

pp. 453-462

Author(s):

A. Fantechi ◽

S. Gnesi ◽

V. Perticaroli

Keyword(s):

Process Algebra ◽

Download Full-text

A model for real-time process algebras (extended abstract)

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_29 ◽

1993 ◽

pp. 372-381 ◽

Author(s):

Liang Chen

Keyword(s):

Real Time ◽

Time Process ◽

Process Algebras

Download Full-text

Defining soft sortedness by abstract interpretation

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_28 ◽

1993 ◽

pp. 362-371

Author(s):

Jian Chen ◽

John Staples

Keyword(s):

Abstract Interpretation

Download Full-text

Speedup of recognizable trace languages

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_25 ◽

1993 ◽

pp. 332-341 ◽

Author(s):

Christophe Cérin ◽

Antoine Petit

Download Full-text

On the amount of nondeterminism and the power of verifying

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_23 ◽

1993 ◽

pp. 311-320 ◽

Author(s):

Liming Cai ◽

Jianer Chen

Download Full-text

Rabin tree automata and finite monoids

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_18 ◽

1993 ◽

pp. 262-271

Author(s):

Danièle Beauquier ◽

Andreas Podelski

Keyword(s):

Tree Automata ◽

Download Full-text

On the tree inclusion problem

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 1993 ◽

10.1007/3-540-57182-5_13 ◽

1993 ◽

pp. 211-221 ◽

Author(s):

Laurent Alonso ◽

René Schott

Keyword(s):

Inclusion Problem

Download Full-text