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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540133452, 9783540388869

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness

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

10.1007/3-540-13345-3_37 ◽

1984 ◽

pp. 403-413 ◽

Cited By ~ 30

Author(s):

Wolfgang Reisig

Keyword(s):

Partial Order ◽

Interleaving Semantics ◽

Partial Order Semantics

Download Full-text

AVL-trees for localized search

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

10.1007/3-540-13345-3_44 ◽

1984 ◽

pp. 473-485 ◽

Cited By ~ 4

Author(s):

Athanasios K. Tsakalidis

Keyword(s):

Avl Trees

Download Full-text

A hardware implementation of the CSP primitives and its verification

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

10.1007/3-540-13345-3_39 ◽

1984 ◽

pp. 423-435 ◽

Cited By ~ 1

Author(s):

Dorit Ron ◽

Flavia Rosemberg ◽

Amir Pnueli

Keyword(s):

Hardware Implementation

Download Full-text

Oriented equational clauses as a programming language

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

10.1007/3-540-13345-3_15 ◽

1984 ◽

pp. 162-173 ◽

Cited By ~ 8

Author(s):

L. Fribourg

Keyword(s):

Programming Language

Download Full-text

Complexité des facteurs des mots infinis engendrés par morphismes itérés

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

10.1007/3-540-13345-3_34 ◽

1984 ◽

pp. 380-389 ◽

Cited By ~ 37

Author(s):

Jean-Jacques Pansiot

Download Full-text

Sampling algorithms for differential batch retrieval problems (extended abstract)

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

10.1007/3-540-13345-3_48 ◽

1984 ◽

pp. 514-526 ◽

Cited By ~ 5

Author(s):

Dan E. Willard

Keyword(s):

Sampling Algorithms

Download Full-text

Encoding graphs by derivations and implications for the theory of graph grammars

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

10.1007/3-540-13345-3_47 ◽

1984 ◽

pp. 503-513 ◽

Cited By ~ 3

Author(s):

Emo Welzl

Keyword(s):

Graph Grammars

Download Full-text

Robust algorithms: A different approach to oracles

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

10.1007/3-540-13345-3_41 ◽

1984 ◽

pp. 448-453 ◽

Cited By ~ 1

Author(s):

Uwe Schöning

Keyword(s):

Robust Algorithms

Download Full-text

On the interpretation of infinite computations in logic programming

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

10.1007/3-540-13345-3_32 ◽

1984 ◽

pp. 358-370 ◽

Cited By ~ 12

Author(s):

M. A. Nait Abdallah

Keyword(s):

Logic Programming

Download Full-text

On probabilistic tape complexity and fast circuits for matrix inversion problems

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

10.1007/3-540-13345-3_25 ◽

1984 ◽

pp. 281-291 ◽

Cited By ~ 5

Author(s):

Hermann Jung

Keyword(s):

Matrix Inversion

Download Full-text

Automata, Languages and Programming - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Partial order semantics versus interleaving semantics for CSP — like languages and its impact on fairness

AVL-trees for localized search

A hardware implementation of the CSP primitives and its verification

Oriented equational clauses as a programming language

Complexité des facteurs des mots infinis engendrés par morphismes itérés

Sampling algorithms for differential batch retrieval problems (extended abstract)

Encoding graphs by derivations and implications for the theory of graph grammars

Robust algorithms: A different approach to oracles

On the interpretation of infinite computations in logic programming

On probabilistic tape complexity and fast circuits for matrix inversion problems

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