Juraj hromkovic, georg schnitger to cite this version. They may not be mustread but certainly very useful. According to the journal citation reports, its 2018 impact factor is 0. This is a list of important books to learn theory cs. Masters program in computer science masters track in. The book gives an introduction to design and analysis of randomized algorithms. Cp7201 theoretical foundations of computer science notes and ebooks download annaunivhub. Books by juraj hromkovic author of algorithmic adventures.
The big ideas in computer science for k12 curricula when teaching computer science it can be easy to focus on details and lose sight of the bigger picture. Direct doctorate in computer science masters track in. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography texts in theoretical computer science. Juraj hromkovic written the book namely theoretical computer science author. As the subtitle of the text indicates, it is a broadlyscoped introductory text to theoretical computer science, mainly discussing the. Graphtheoretic concepts in computer science, 30th international workshop,wg 2004, bad honnef, germany, june 2123, 2004, revised papers.
Juraj hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. What are mustread books on theoretical computer science. Combinatorial structures and algorithms, institute of. The acms special interest group on algorithms and computation theory sigact provides the following description.
Citeseerx two lower bounds on computational complexity. Review of the book algorithmic adventures by juraj. 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. Download juraj hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science.
He studied at comenius university where he received his ph. Theoretical computer science introduction to automata, computability, algorithmics, randomization, communication and cryptography by juraj hromkovi c springer, 2010 isbn. Theoretical insights are for practice often highly relevant for instance from algorithm theory or even intrinsically necessary for instance from cryptography. Algorithmics for hard problems juraj hromkovic bok. Dissemination of information in communication networks. Theoretical computer science tcs is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation it is difficult to circumscribe the theoretical areas precisely.
Introducing the communication complexity of boolean ci. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography by juraj hromkovic is an undergraduatelevel textbook covering the foundational topics in theoretical computer science. Theoretical computer science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Description juraj hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. To this end, overall, the text is a laudable e ort to minimize the amount of formal mathematics in a theoretical computer science book. It is a selfcontained textbook primarily for students. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. Communication complexity and parallel computing by juraj hromkovic 19970411 communication complexity and parallel computing 1997 edition by hromkovic, juraj 1997 hardcover.
In algorithmic adventures juraj hromkovi c provides a very readable account of some of the most beautiful results in theoretical computer science. Guide for authors theoretical computer science issn. Informatik theoretical computer science texts in theoretical computer science. As this topic is fundamental for computer science, this book tries to close this gap. Juraj hromkovic, manfred nagl, bernhard westfechtel. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their. The layout area of boolean circuits is considered as a complexity measure of boolean functions. Comparing descriptive and computational complexity of infinite words in. Bibliographic content of theoretical computer science, volume 51. Theoreticalcomputerscience connecting repositories. You may also be able to cite your work as a referee for theoretical computer science as part of your professional development requirements for various professional societies and. However, the background required varies from topic to topic, and some books are. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. The book also presents the development of the computer scientists way of thinking as well as fundamental.
Theoretical computer science tcs is a computer science journal published by elsevier, started in 1975 and covering theoretical computer science. A read is counted each time someone views a publication summary such as the title, abstract, and list of authors, clicks on a figure, or views or downloads the fulltext. It is abstracted and indexed by scopus and the science citation index. The benefits of refereeing for theoretical computer science include the opportunity to see and evaluate the latest work in your research area at an early stage.
Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography hardcover nov 5 2003. Typically, an undergraduate background in computer science will be assumed. Pdf algorithmics for hard problems download ebook for free. Cp7201 theoretical foundations of computer science anna. Randomization, communication, and cryptography texts in theoretical computer science. Focal areas of theory research at eth computer science include cryptography and complexity, as well as algorithms, discrete mathematics, and optimization, in part jointly with the. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography by juraj hromkovic 3. This textbook not only provides an elegant route through the theoretical fundamentals of computer science, it also shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, depth of research, and yet directly applicable. Texts in theoretical computer science an eatcs series. Walter unger preface due to the development of hardware technologies such as vlsi in the early 1980s, the interest in parallel and distributive computing has been rapidly. Bulletin of the european association for theoretical computer science eatcs. Introduction to combinatorial optimization, randomization, approximation, and heuristics texts in theoretical computer science. Direct doctorate in computer science masters track in theoretical computer science please find further information on how to plan your studies and the least amount of credits per course. Lecture notes in computer science 3353, springer 2004, isbn 35402429.
Request pdf on jan 1, 2001, rusins freivalds and others published rusins freivalds, juraj hromkovic, gheorghe paun, walter unger. Theoretical computer science juraj hromkovic springer. Computer science engineering information technology pdf download study material of theoretical computer science pdf download lacture notes of theoretical computer science pdf. Theoretical computer science by juraj hromkovic, 9783642057298, available at book depository with free delivery worldwide. Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. A short story about the development of computer science or why computer science is not a computer driving license. Texts published in this series are intended mostly for the graduate level. Lower bounds on the area complexity of boolean circuits. Broadcasting, gossiping, leader election, and faulttolerance.
He is the author of numerous monographs and scientific publications in the field of algorithmics, computational complexity theory, and randomization. Juraj hromkovic born 1958 is a slovak computer scientist and professor at eth zurich. Theory and algorithms department of computer science. This is particularly concerning with new pretertiary curricula being adopted in many countries as teachers grapple with a bewildering array of topics to teach. Theoretical computer science introduction to automata. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. Juraj hromkovic born august 24, 1958, german university.
547 834 373 985 262 1505 1191 1117 1358 1570 1545 557 384 8 864 581 189 842 175 1416 656 1427 356 1009 580 902 464 1188 326 279