Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

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.

About the author

Prof. Dr. Juraj Hromkovic war 1997 - 2003 Professor für Algorithmen und Komplexität an der RWTH Aachen. Seit Januar 2004 ist er Professor für Informatik an der ETH Zürich. Seit 2010 ist er Mitglied der Academia Europaea.

Summary

This textbook provides an elegant route through the theoretical fundamentals of computer science. In doing so, it shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.
 

Product details

• Authors: Juraj Hromkovi¿, Juraj Hromkovi, Juraj Hromkovič, Juraj Hromkovic
• Publisher: Springer, Berlin
• Content: Book
• Product form: Paperback / Softback
• Publication date: 01.07.2011
• Subject: Natural sciences, medicine, IT, technology > IT, data processing > IT
• EAN: 9783642057298
• ISBN: 978-3-642-05729-8
• Pages: 313
• Illustrations: X, 313 p.
• Dimensions (packing): 15.5 x 23.6 x 23.3 cm
• Weight (packing): 496 g
• Series: Texts in Theoretical Computer Science. An EATCS Series; Texts in Theoretical Computer Science. An EATCS Series
• Subjects: B, Algorithms, computer science, Theory of Computation, Discrete Mathematics in Computer Science, Discrete Mathematics, Computers, Algorithms & data structures, Coding and Information Theory, Information theory, Coding theory & cryptology, Mathematical theory of computation, Coding theory, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices