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

9783540108436, 9783540387459

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the generation of cryptographically strong pseudo-random sequences

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

10.1007/3-540-10843-2_43 ◽

1981 ◽

pp. 544-550 ◽

Cited By ~ 27

Author(s):

Adi Shamir

Keyword(s):

Random Sequences

Download Full-text

Flow analysis of lambda expressions

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

10.1007/3-540-10843-2_10 ◽

1981 ◽

pp. 114-128 ◽

Cited By ~ 24

Author(s):

Neil D. Jones

Keyword(s):

Flow Analysis

Download Full-text

The implication problem for data dependencies

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

10.1007/3-540-10843-2_7 ◽

1981 ◽

pp. 73-85 ◽

Cited By ~ 80

Author(s):

C. Beeri ◽

M. Y. Vardi

Keyword(s):

Data Dependencies ◽

Implication Problem

Download Full-text

Cost tradeoffs in graph embeddings, with applications

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

10.1007/3-540-10843-2_4 ◽

1981 ◽

pp. 41-55 ◽

Cited By ~ 2

Author(s):

Hong Jia-Wei ◽

Kurt Mehlhorn ◽

Arnold L. Rosenberg

Keyword(s):

Graph Embeddings

Download Full-text

Impartiality, justice and fairness: The ethics of concurrent termination

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

10.1007/3-540-10843-2_22 ◽

1981 ◽

pp. 264-277 ◽

Cited By ~ 88

Author(s):

D. Lehmann ◽

A. Pnueli ◽

J. Stavi

Download Full-text

Automatic construction of verification condition generators from hoare logics

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

10.1007/3-540-10843-2_30 ◽

1981 ◽

pp. 363-377 ◽

Cited By ~ 7

Author(s):

Mark Moriconi ◽

Richard L. Schwartz

Keyword(s):

Automatic Construction ◽

Verification Condition

Download Full-text

Circular expressions: Elimination of static environments

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

10.1007/3-540-10843-2_31 ◽

1981 ◽

pp. 378-392

Author(s):

Ravi Sethi

Download Full-text

Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems

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

10.1007/3-540-10843-2_35 ◽

1981 ◽

pp. 432-447 ◽

Cited By ~ 3

Author(s):

Alberto Pettorossi

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems ◽

Path Ordering ◽

Termination Proofs ◽

Recursive Path

Download Full-text

Chomsky-Schotzenberger representations for families of languages and grammatical types

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

10.1007/3-540-10843-2_28 ◽

1981 ◽

pp. 333-347

Author(s):

Sorin Istrail

Download Full-text

A decision procedure for the equivalence of two dpdas one of which is linear

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

10.1007/3-540-10843-2_19 ◽

1981 ◽

pp. 229-237 ◽

Cited By ~ 1

Author(s):

Yair Itzhaik

Keyword(s):

Decision Procedure

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the generation of cryptographically strong pseudo-random sequences

Flow analysis of lambda expressions

The implication problem for data dependencies

Cost tradeoffs in graph embeddings, with applications

Impartiality, justice and fairness: The ethics of concurrent termination

Automatic construction of verification condition generators from hoare logics

Circular expressions: Elimination of static environments

Comparing and putting together recursive path ordering, simplification orderings and Non-Ascending Property for termination proofs of term rewriting systems

Chomsky-Schotzenberger representations for families of languages and grammatical types

A decision procedure for the equivalence of two dpdas one of which is linear

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