Background
Hromkovic, Juraj was born on August 24, 1958 in Bratislava, Czechoslovakia. Son of Stanislav and Dana (Sprusanská) Hromkovic.
(Algorithmic design, especially for hard problems, is more...)
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.
http://www.amazon.com/gp/product/3540441344/?tag=2022091-20
(Algorithmic design, especially for hard problems, is more...)
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.
http://www.amazon.com/gp/product/3642079091/?tag=2022091-20
(The communication complexity of two-party protocols is an...)
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.
http://www.amazon.com/gp/product/354057459X/?tag=2022091-20
university professor computer scientist
Hromkovic, Juraj was born on August 24, 1958 in Bratislava, Czechoslovakia. Son of Stanislav and Dana (Sprusanská) Hromkovic.
He studied at Comenius University where he received his Doctor of Philosophy in 1986 (Doctor of Natural Science), habilitated in 1989 (Theoretical Cybernetics and Mathematical Informatics), and worked as a lecturer from 1989 to 1990.
He is the author of numerous monographs and scientific publications in the field of algorithmics, computational complexity theory, and randomization. From 1989 to 1994, he was a visiting professor at the group of Burkhard Monien at the University of Paderborn. In 1994, he received a professorship at the Institute of Informatics at the University of Kiel.
From 1997 to 2003, he led the Chair of Computer Science 1 at Rheinisch-Westfälische Technische Hochschule Aachen.
Since 2004, he has been a professor at the Federal Institute of Technology, Zurich for Information Technology and Education. Next to active research in various fields of theoretical computer science (about 170 publications), the main focus of his work lies on education for teachers of Computer Science and the illustration of basics of Computer Science to non-professionals.
(The communication complexity of two-party protocols is an...)
(Algorithmic design, especially for hard problems, is more...)
(Algorithmic design, especially for hard problems, is more...)
Member European Association for Theoretical Computer Science, Slovac Academy Society.
Married Tatiana Popovn+200ková, June 6, 1987. Children: Petra, Paula.