New Topics In Theoretical Computer Science


Download New Topics In Theoretical Computer Science PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get New Topics In Theoretical Computer Science book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

New Topics in Theoretical Computer Science


New Topics in Theoretical Computer Science

Author: Oleg N. Terikhovsky

language: en

Publisher: Nova Publishers

Release Date: 2008


DOWNLOAD





Theoretical computer science focuses on the more abstract, logical and mathematical aspects of computing, such as the theory of computation, analysis of algorithms and semantics of programming languages. This new book presents the latest research in the field from around the globe.

Theoretical Computer Science


Theoretical Computer Science

Author: Juraj Hromkovič

language: en

Publisher: Springer Science & Business Media

Release Date: 2003-09-18


DOWNLOAD





Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author 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.

Current Trends in Theoretical Computer Science


Current Trends in Theoretical Computer Science

Author: Gheorghe P?un

language: en

Publisher: World Scientific

Release Date: 2004


DOWNLOAD





This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000OCo2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, OC Algorithms and ComplexityOCO and OC Formal Models and SemanticsOCO, reflecting the traditional division of the field. The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science. Contents: Vol 1: Algorithms; Computational Complexity; Distributed Computing; Natural Computing; Vol 2: Formal Specification; Logic in Computer Science; Concurrency; Formal Language Theory. Readership: Upper level undergraduates, graduate students and researchers in theoretical computer science and biocomputing."