Plus d’un million de livres à portée de main !
Bookbot

Horst Reichel

    Fundamentals of computation theory
    Initial computability, algebraic specifications, and partial algebras
    Proceedings / STACS 2000
    • Proceedings / STACS 2000

      • 662pages
      • 24 heures de lecture

      This book constitutes the refereed proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, held in Lille, France in February 2000. The 51 revised full papers presented together with the three invited papers were carefully reviewed and selected from a total of 146 submissions on the basis of some 700 reviewers' reports. The papers address fundamental issues from all current areas of theoretical computer science including algorithms, data structures, automata, formal languages, complexity, verification, logic, cryptography, graph theory, optimization, etc.

      Proceedings / STACS 2000
    • Fundamentals of computation theory

      • 433pages
      • 16 heures de lecture

      This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, computational geometry, systems specification, learning theory, parallelism and concurrency, rewriting and high-level replacement systems, and semantics.

      Fundamentals of computation theory