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

9783540180883, 9783540477471

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Parallel construction of a suffix tree

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

10.1007/3-540-18088-5_26 ◽

1987 ◽

pp. 314-325 ◽

Cited By ~ 3

Author(s):

Gad M. Landau ◽

Baruch Schieber ◽

Uzi Vishkin

Keyword(s):

Suffix Tree ◽

Parallel Construction

Download Full-text

On word problems in equational theories

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

10.1007/3-540-18088-5_6 ◽

1987 ◽

pp. 54-71 ◽

Cited By ~ 63

Author(s):

Jieh Hsiang ◽

Michael Rusinowitch

Keyword(s):

Word Problems ◽

Equational Theories

Download Full-text

Readiness semantics for regular processes with silent actions

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

10.1007/3-540-18088-5_10 ◽

1987 ◽

pp. 115-125 ◽

Cited By ~ 3

Author(s):

Susanne Graf ◽

Joseph Sifakis

Download Full-text

The lexicographically first maximal subgraph problems: P-completeness and NC algorithms

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

10.1007/3-540-18088-5_36 ◽

1987 ◽

pp. 425-434 ◽

Cited By ~ 2

Author(s):

Satoru Miyano

Keyword(s):

Nc Algorithms

Download Full-text

Semantics for nondeterministic asynchronous broadcast networks

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

10.1007/3-540-18088-5_7 ◽

1987 ◽

pp. 72-83 ◽

Cited By ~ 6

Author(s):

R. K. Shyamasundar ◽

K. T. Narayana ◽

T. Pitassi

Keyword(s):

Broadcast Networks

Download Full-text

On the Knuth-Bendix completion for concurrent processes

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

10.1007/3-540-18088-5_5 ◽

1987 ◽

pp. 42-53 ◽

Cited By ~ 6

Author(s):

Volker Diekert

Keyword(s):

Concurrent Processes

Download Full-text

Partial algebras flow from algebraic specifications

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

10.1007/3-540-18088-5_45 ◽

1987 ◽

pp. 521-530 ◽

Cited By ~ 8

Author(s):

Hans-Jörg Kreowski

Keyword(s):

Algebraic Specifications ◽

Partial Algebras

Download Full-text

Efficient on-line algorithms for the knapsack problem

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

10.1007/3-540-18088-5_38 ◽

1987 ◽

pp. 445-456 ◽

Cited By ~ 1

Author(s):

Alberto Marchetti-Spaccamela ◽

Carlo Vercellis

Keyword(s):

Knapsack Problem ◽

On Line

Download Full-text

Uniform computational complexity of Taylor series

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

10.1007/3-540-18088-5_37 ◽

1987 ◽

pp. 435-444 ◽

Cited By ~ 18

Author(s):

N.Th. Müller

Keyword(s):

Computational Complexity ◽

Taylor Series

Download Full-text

Posets, boolean representations and quick path searching

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

10.1007/3-540-18088-5_35 ◽

1987 ◽

pp. 404-424 ◽

Cited By ~ 7

Author(s):

G. Gambosi ◽

J. Nešetřil ◽

M. Talamo

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Parallel construction of a suffix tree

On word problems in equational theories

Readiness semantics for regular processes with silent actions

The lexicographically first maximal subgraph problems: P-completeness and NC algorithms

Semantics for nondeterministic asynchronous broadcast networks

On the Knuth-Bendix completion for concurrent processes

Partial algebras flow from algebraic specifications

Efficient on-line algorithms for the knapsack problem

Uniform computational complexity of Taylor series

Posets, boolean representations and quick path searching

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