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

9783540569398, 9783540478263

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Maintaining discrete probability distributions optimally

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

10.1007/3-540-56939-1_77 ◽

1993 ◽

pp. 253-264 ◽

Cited By ~ 10

Author(s):

Torben Hagerup ◽

Kurt Mehlhorn ◽

J. Ian Munro

Keyword(s):

Probability Distributions ◽

Discrete Probability ◽

Discrete Probability Distributions

Download Full-text

On the computational power of discrete Hopfield nets

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

10.1007/3-540-56939-1_74 ◽

1993 ◽

pp. 215-226 ◽

Cited By ~ 1

Author(s):

Pekka Orponen

Keyword(s):

Computational Power

Download Full-text

Fast parallel constraint satisfaction

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

10.1007/3-540-56939-1_91 ◽

1993 ◽

pp. 418-429

Author(s):

Lefteris M. Kirousis

Keyword(s):

Constraint Satisfaction

Download Full-text

Exact asymptotics of divide-and-conquer recurrences

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

10.1007/3-540-56939-1_68 ◽

1993 ◽

pp. 137-149 ◽

Cited By ~ 3

Author(s):

Philippe Flajolet ◽

Mordecai Golin

Keyword(s):

Divide And Conquer ◽

Exact Asymptotics

Download Full-text

Sparse networks supporting efficient reliable broadcasting

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

10.1007/3-540-56939-1_88 ◽

1993 ◽

pp. 388-397 ◽

Cited By ~ 10

Author(s):

Bogdan S. Chlebus ◽

Krzysztof Diks ◽

Andrzej Pelc

Keyword(s):

Sparse Networks

Download Full-text

On regular compatibility of semi-commutations

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

10.1007/3-540-56939-1_93 ◽

1993 ◽

pp. 445-456 ◽

Cited By ~ 2

Author(s):

Edward Ochmański ◽

Pierre-André Wacrenier

Download Full-text

Strongly adaptive token distribution

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

10.1007/3-540-56939-1_89 ◽

1993 ◽

pp. 398-409 ◽

Cited By ~ 6

Author(s):

Friedhelm Meyer auf der Heide ◽

Brigitte Oesterdiekhoff ◽

Rolf Wanka

Download Full-text

Finite automata as characterizations of minor closed tree families (extended abstract)

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

10.1007/3-540-56939-1_86 ◽

1993 ◽

pp. 359-370

Author(s):

Arvind Gupta

Keyword(s):

Finite Automata

Download Full-text

Algebras for classifying regular tree languages and an application to frontier testability

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

10.1007/3-540-56939-1_85 ◽

1993 ◽

pp. 347-358 ◽

Cited By ~ 2

Author(s):

Thomas Wilke

Keyword(s):

Regular Tree ◽

Tree Languages

Download Full-text

Cobham's Theorem seen through Büchi's Theorem

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

10.1007/3-540-56939-1_83 ◽

1993 ◽

pp. 325-334 ◽

Cited By ~ 2

Author(s):

Christian Michaux ◽

Roger Villemaire

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Maintaining discrete probability distributions optimally

On the computational power of discrete Hopfield nets

Fast parallel constraint satisfaction

Exact asymptotics of divide-and-conquer recurrences

Sparse networks supporting efficient reliable broadcasting

On regular compatibility of semi-commutations

Strongly adaptive token distribution

Finite automata as characterizations of minor closed tree families (extended abstract)

Algebras for classifying regular tree languages and an application to frontier testability

Cobham's Theorem seen through Büchi's Theorem

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