Juraj Hromkovi's Books

Algorithmic Adventures

From Knowledge to Magic

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithmic Adventures

From Knowledge to Magic

By: Juraj Hromkovič

The ?rst and foremost goal of this lecture series was to show the beauty, depth and usefulness of the key ideas in computer science. While working on the lecture notes, we came to understand that one can recognize the true spirit of a scienti?c discipline only by viewing its contributions in the framework of science as a whole. We present computer science here as a fundamental science that, interacting with other scienti?c disciplines, changed and changes our view on the world, that contributes to our understanding of the fundamental concepts of science and that sheds new light on and brings new meaning to several of these concepts. We show that computer science is a discipline that discovers spectacular, unexpected facts, that ?nds ways out in seemingly unsolvable s- uations, and that can do true wonders. The message of this book is that computer science is a fascinating research area with a big impact on the real world, full of spectacular ideas and great ch- lenges. It is an integral part of science and engineering with an above-average dynamic over the last 30 years and a high degree of interdisciplinarity. The goal of this book is not typical for popular science writing, whichoftenrestrictsitselftooutliningtheimportanceofaresearch area. Whenever possible we strive to bring full understanding of the concepts and results presented.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

367

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540859861

ISBN 13

9783540859864

Theoretical Computer Science

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

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Theoretical Computer Science

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

By: Juraj Hromkovič

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.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

336

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540140158

ISBN 13

9783540140153

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Presents the background and context of all ideas, concepts, algorithms, analyses and arguments before discussing details. Accessible to both beginners as well as specialists.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

365

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540266631

ISBN 13

9783540266631

Graph-Theoretic Concepts in Computer Science

30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Graph-Theoretic Concepts in Computer Science

30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers

By: Juraj Hromkovič

This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004. The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and exponential algorithms; counting, combinatorics, and optimization; applications in bioinformatics and graph drawing; and graph classes and NP-hard problems.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

413

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540241329

ISBN 13

9783540241324

Theoretical Computer Science

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

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Theoretical Computer Science

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

By: Juraj Hromkovič

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

336

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540140158

ISBN 13

9783540140153

Automata, Languages and Programming

26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings

By: Juraj Wiedermann

Write a review Read reviews Take a Quiz Solve Book Puzzle

Automata, Languages and Programming

26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings

By: Juraj Wiedermann

This book constitutes the refereed proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99, held in Prague, Czech Republic, in July 1999. The 56 revised full papers presented were carefully reviewed and selected from a total of 126 submissions; also included are 11 inivited contributions. Among the topics addressed are approximation algorithms, algebra and circuits, concurrency, semantics and rewriting, process algebras, graphs, distributed computing, logic of programs, sorting and searching, automata, nonstandard computing, regular languages, combinatorial optimization, automata and logics, string algorithms, and applied logics.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

735

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540662243

ISBN 13

9783540662242

Communication Complexity and Parallel Computing

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Communication Complexity and Parallel Computing

By: Juraj Hromkovič

The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen dent area of complexity theory. In addition to a strong relation to several funda mental complexity measures (and so to several fundamental problems of com plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in strumental in the study of several central open problems of recent complexity theory.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

347

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3662034425

ISBN 13

9783662034422

Algorithmics for Hard Problems

Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithmics for Hard Problems

Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

By: Juraj Hromkovič

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. 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. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com municated to students and practitioners.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

548

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3662052695

ISBN 13

9783662052693

Algorithmic Adventures

From Knowledge to Magic

By: Juraj Hromkovič

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithmic Adventures

From Knowledge to Magic

By: Juraj Hromkovič

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

367

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540859861

ISBN 13

9783540859864

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Presents the background and context of all ideas, concepts, algorithms, analyses and arguments before discussing details. Accessible to both beginners as well as specialists.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

365

Publisher

Springer Science & Business Media

Published Date

ISBN 10

3540008462

ISBN 13

9783540008460

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

By: Juraj Hromkovič,Ralf Klasing,A. Pelc,Peter Ruzicka,Walter Unger

Presents the background and context of all ideas, concepts, algorithms, analyses and arguments before discussing details. Accessible to both beginners as well as specialists.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

364

Publisher

Springer

Published Date

ISBN 10

3540800107

ISBN 13

9783540800101

Book's by Juraj Hromkovi

Algorithmic Adventures

Algorithmic Adventures

Theoretical Computer Science

Theoretical Computer Science

Dissemination of Information in Communication Networks

Dissemination of Information in Communication Networks

Graph-Theoretic Concepts in Computer Science

Graph-Theoretic Concepts in Computer Science

Theoretical Computer Science

Theoretical Computer Science

Automata, Languages and Programming

Automata, Languages and Programming

Communication Complexity and Parallel Computing

Communication Complexity and Parallel Computing

Algorithmics for Hard Problems

Algorithmics for Hard Problems

Algorithmic Adventures

Algorithmic Adventures

Dissemination of Information in Communication Networks

Dissemination of Information in Communication Networks

Dissemination of Information in Communication Networks

Dissemination of Information in Communication Networks

Username

Password

Username

Password

Password again

Birthday

Email