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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540634379, 9783540695479

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A characterization of abstract families of algebraic power series

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

10.1007/bfb0029976 ◽

1997 ◽

pp. 327-336

Author(s):

Georg Karner ◽

Werner Kuich

Keyword(s):

Power Series ◽

Algebraic Power Series

Download Full-text

On the generation of trees by hyperedge replacement

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

10.1007/bfb0029966 ◽

1997 ◽

pp. 229-238 ◽

Cited By ~ 1

Author(s):

Frank Drewes

Keyword(s):

Hyperedge Replacement

Download Full-text

Accepting Zeno words without making time stand still

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

10.1007/bfb0029958 ◽

1997 ◽

pp. 149-158 ◽

Cited By ~ 9

Author(s):

Béatrice Bérard ◽

Claudine Picaronny

Download Full-text

Specifying computations using hyper transition systems

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

10.1007/bfb0029960 ◽

1997 ◽

pp. 169-178 ◽

Cited By ~ 1

Author(s):

Marcello M. Bonsangue ◽

Joost N. Kok

Keyword(s):

Transition Systems

Download Full-text

A tile-based coordination view of asynchronous π-calculus

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

10.1007/bfb0029949 ◽

1997 ◽

pp. 52-70 ◽

Cited By ~ 4

Author(s):

GianLuigi Ferrari ◽

Ugo Montanari

Keyword(s):

Π Calculus

Download Full-text

Partial characterization of synchronization languages

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

10.1007/bfb0029964 ◽

1997 ◽

pp. 209-218 ◽

Cited By ~ 1

Author(s):

Isabelle Ryl ◽

Yves Roos ◽

Mireille Clerbout

Keyword(s):

Partial Characterization

Download Full-text

Integrating the specification techniques of graph transformation and temporal logic

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

10.1007/bfb0029965 ◽

1997 ◽

pp. 219-228 ◽

Cited By ~ 7

Author(s):

Reiko Heckel ◽

Hartmut Ehrig ◽

Uwe Wolter ◽

Andrea Corradini

Keyword(s):

Temporal Logic ◽

Graph Transformation ◽

Specification Techniques

Download Full-text

Learning to perform knowledge-intensive inferences

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

10.1007/bfb0029953 ◽

1997 ◽

pp. 108-109

Author(s):

Dan Roth

Keyword(s):

Knowledge Intensive

Download Full-text

Relating conflict-free stable transition and event models (extended abstract)

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

10.1007/bfb0029970 ◽

1997 ◽

pp. 269-278 ◽

Cited By ~ 1

Author(s):

Zurab Khasidashvili ◽

John Glauert

Keyword(s):

Event Models

Download Full-text

Optimal algorithms for complete linkage clustering in d dimensions

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

10.1007/bfb0029980 ◽

1997 ◽

pp. 368-377

Author(s):

Drago Krznaric ◽

Christos Levcopoulos

Keyword(s):

Optimal Algorithms ◽

Complete Linkage

Download Full-text

Mathematical Foundations of Computer Science 1997 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A characterization of abstract families of algebraic power series

On the generation of trees by hyperedge replacement

Accepting Zeno words without making time stand still

Specifying computations using hyper transition systems

A tile-based coordination view of asynchronous π-calculus

Partial characterization of synchronization languages

Integrating the specification techniques of graph transformation and temporal logic

Learning to perform knowledge-intensive inferences

Relating conflict-free stable transition and event models (extended abstract)

Optimal algorithms for complete linkage clustering in d dimensions

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