Skip to main content

Theoretical Computer Science

Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

  • Textbook
  • © 2011

Overview

  • Extremly well readable, transparent introduction to TCS
  • All basic ideas and concepts (proofs) are first developed intuitively in context with already known facts and then formalized into detail
  • Includes supplementary material: sn.pub/extras

Buy print copy

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Keywords

  • Algorithmics
  • Communication
  • Complexity
  • Computability
  • Cryptography
  • Hard problems
  • Interconnection networks
  • algorithm analysis and problem complexity

About this book

The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.

An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.

Authors and Affiliations

  • ETH Zürich Informationstechnologie und Ausbildung, Zürich, Switzerland

    Juraj Hromkovič

About the author

 Also Author of our books "Communication Complexity and Parallel Computing", 57459-X and "Algorithmics for Hard Problems" 2nd ed., 44134-4; Advisory Board member of the EATCS series.

Bibliographic Information

  • Book Title: Theoretical Computer Science

  • Book Subtitle: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

  • Authors: Juraj Hromkovič

  • Series Title: Texts in Theoretical Computer Science. An EATCS Series

  • Publisher: Springer Berlin, Heidelberg

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2011

  • Hardcover ISBN: 978-3-540-14015-3Published: 18 September 2003

  • Softcover ISBN: 978-3-642-05729-8Published: 06 December 2010

  • Series ISSN: 1862-4499

  • Series E-ISSN: 1862-4502

  • Edition Number: 1

  • Number of Pages: X, 313

Publish with us