Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Kolmogorov's Heritage in Mathematics
  • Language: en
  • Pages: 326

Kolmogorov's Heritage in Mathematics

In this book, several world experts present (one part of) the mathematical heritage of Kolmogorov. Each chapter treats one of his research themes or a subject invented as a consequence of his discoveries. The authors present his contributions, his methods, the perspectives he opened to us, and the way in which this research has evolved up to now. Coverage also includes examples of recent applications and a presentation of the modern prospects.

STACS 2006
  • Language: en
  • Pages: 714

STACS 2006

  • Type: Book
  • -
  • Published: 2006-03-01
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, held in February 2006. The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, and logic in computer science.

STACS 2005
  • Language: en
  • Pages: 706

STACS 2005

  • Type: Book
  • -
  • Published: 2005-02-02
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005, held in Stuttgart, Germany in February 2005. The 54 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 217 submissions. A broad variety of topics from theoretical computer science are addressed, in particular complexity theory, algorithmics, computational discrete mathematics, automata theory, combinatorial optimization and approximation, networking and graph theory, computational geometry, grammar systems and formal languages, etc.

Cellular Automata
  • Language: en
  • Pages: 367

Cellular Automata

Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.

National Union Catalog
  • Language: en
  • Pages: 616

National Union Catalog

  • Type: Book
  • -
  • Published: 1973
  • -
  • Publisher: Unknown

Includes entries for maps and atlases.

Environmental Issues in Supply Chain Management
  • Language: en
  • Pages: 266

Environmental Issues in Supply Chain Management

The aim of the book is to present the emerging environmental issues in organization and management of complex supply chains. The book includes set of solutions which show different stakeholders' viewpoints on sustainability. The scope of book takes into consideration how the emerging environmental regulation might be transformed into business practices. Therefore, the authors present the innovative approach to eco-friendly organization and coordination of logistics processes and supply chain configuration. A broad scope of practical solutions from different countries and industries is provided

Mathematical Foundations of Computer Science 2004
  • Language: en
  • Pages: 904

Mathematical Foundations of Computer Science 2004

  • Type: Book
  • -
  • Published: 2004-08-06
  • -
  • Publisher: Springer

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Rangi...

Automata, Languages and Programming
  • Language: en
  • Pages: 1272

Automata, Languages and Programming

This book constitutes the refereed proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004, held in Turku, Finland, in July 2004. The 97 revised full papers presented together with abstracts of 6 invited talks were carefully reviewed and selected from 379 submissions. The papers address all current issues in theoretical computer science including algorithms, automata, complexity, cryptography, database logics, program semantics, and programming theory.

STACS 2007
  • Language: en
  • Pages: 723

STACS 2007

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, logic in computer science, semantics, specification, and verification of programs, rewriting and deduction, as well as current challenges like biological computing, quantum computing, and mobile and net computing.

STACS 2000
  • Language: en
  • Pages: 676

STACS 2000

  • Type: Book
  • -
  • Published: 2007-08-03
  • -
  • Publisher: Springer

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.