Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

58

(FIVE YEARS 0)

H-INDEX

14

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540557197, 9783540472780

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A new metric between polygons, and how to compute it

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_92 ◽

1992 ◽

pp. 404-415

Author(s):

Günter Rote

Download Full-text

Approximation algorithms for graph augmentation

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_85 ◽

1992 ◽

pp. 330-341 ◽

Author(s):

Samir Khuller ◽

Ramakrishna Thurimella

Keyword(s):

Approximation Algorithms ◽

Graph Augmentation

Download Full-text

The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_76 ◽

1992 ◽

pp. 223-234 ◽

Author(s):

Ulrich Schmid

Keyword(s):

Collision Resolution ◽

Resolution Algorithm

Download Full-text

New results concerning synchronized finite automata

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_69 ◽

1992 ◽

pp. 126-137

Author(s):

Oscar H. Ibarra ◽

Nicholas Q. Trân

Keyword(s):

Finite Automata

Download Full-text

A parametric approach to localities

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_109 ◽

1992 ◽

pp. 617-628 ◽

Author(s):

Ugo Montanari ◽

Daniel Yankelevich

Keyword(s):

Parametric Approach

Download Full-text

Timing Petri Nets categorically

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_105 ◽

1992 ◽

pp. 571-582 ◽

Author(s):

Carolyn Brown ◽

Doug Gurr

Keyword(s):

Download Full-text

Philosophical issues in Kolmogorov complexity

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_59 ◽

1992 ◽

pp. 1-15 ◽

Author(s):

Ming Li ◽

Paul M. B. Vitányi

Keyword(s):

Kolmogorov Complexity

Download Full-text

On nearest-neighbor graphs

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_93 ◽

1992 ◽

pp. 416-426 ◽

Author(s):

Michael S. Paterson ◽

F. Frances Yao

Keyword(s):

Nearest Neighbor

Download Full-text

Testing preorders for probabilistic processes

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_116 ◽

1992 ◽

pp. 708-719 ◽

Author(s):

Rance Cleaveland ◽

Scott A. Smolka ◽

Amy Zwarico

Keyword(s):

Probabilistic Processes

Download Full-text

Program composition via unification

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-55719-9_113 ◽

1992 ◽

pp. 672-684 ◽

Author(s):

Limor Fix ◽

Nissim Francez ◽

Orna Grumberg

Keyword(s):

Program Composition

Download Full-text