Juraj Hromkovič – författare

Visar alla böcker från författaren Juraj Hromkovič. Handla med fri frakt och snabb leverans.

56 produkter

Kategorier

56 produkter

Stochastik 2
Von der Standardabweichung bis zur Beurteilenden Statistik
AvMichael Barot,Juraj Hromkovič
Häftad, Tyska, 2020
367 kr
Skickas inom 10-15 vardagar
Aufbauend auf dem ersten Band, werden in diesem Buch weiterführende Konzepte der Wahrscheinlichkeitstheorie ausführlich und verständlich diskutiert. Mit vielen exemplarisch durchgerechneten Aufgaben, einer Vielzahl weiterer Problemstellungen und ausführlichen Lösungen bietet es dem Leser die Möglichkeit, die eigenen Fähigkeiten ständig zu erweitern und kritisch zu überprüfen und ein tieferes Verständnis der Materie zu erlangen. Realitätsnahe Anwendungen ermöglichen einen Ausblick in die breite Verwendbarkeit dieser Theorie.Auch in diesem Band wird auf die Entwicklung der Begriffsbildung und der mathematischen Konzepte besonderer Wert gelegt, sodass man ihre Bedeutung bei der Erzeugung wie auch ständige Verbesserung von Forschungsinstrumenten für die Untersuchung unserer Welt erleben kann.Gerichtet ist das Buch an Gymnasiasten, Studienanfänger an Hochschulen, Lehrer und Interessierte, die sich mit diesem Gebiet vertraut machen möchten.
Stochastik 2
Von der Standardabweichung bis zur Beurteilenden Statistik
AvJuraj Hromkovic,Michael Barot
E-bok
Tyska, 2020
347 kr
Läs direkt efter köp
Aufbauend auf dem ersten Band, werden in diesem Buch weiterführende Konzepte der Wahrscheinlichkeitstheorie ausführlich und verständlich diskutiert. Mit vielen exemplarisch durchgerechneten Aufgaben, einer Vielzahl weiterer Problemstellungen und ausführlichen Lösungen bietet es dem Leser die Möglichkeit, die eigenen Fähigkeiten ständig zu erweitern und kritisch zu überprüfen und ein tieferes Verständnis der Materie zu erlangen. Realitätsnahe Anwendungen ermöglichen einen Ausblick in die breite Verwendbarkeit dieser Theorie.
Auch in diesem Band wird auf die Entwicklung der Begriffsbildung und der mathematischen Konzepte besonderer Wert gelegt, sodass man ihre Bedeutung bei der Erzeugung wie auch ständige Verbesserung von Forschungsinstrumenten für die Untersuchung unserer Welt erleben kann.
Gerichtet ist das Buch an Gymnasiasten, Studienanfänger an Hochschulen, Lehrer und Interessierte, die sich mit diesem Gebiet vertraut machen möchten.
einfach Informatik. Programmieren. Bundesausgabe ab 2018
AvJuraj Hromkovic,Tobias Kohn
Häftad, Tyska, 2018
452 kr
Skickas inom 3-6 vardagar
einfach Informatik. Daten darstellen, verschlüsseln, komprimieren. Bundesausgabe ab 2018
AvJuraj Hromkovic
Häftad, Tyska, 2018
276 kr
Skickas inom 3-6 vardagar
Stochastik
Diskrete Wahrscheinlichkeit und Kombinatorik
AvJuraj Hromkovič,Michael Barot
Häftad, Tyska, 2017
311 kr
Skickas inom 10-15 vardagar
Die grundlegenden Konzepte der Wahrscheinlichkeitstheorie werden in diesem Buch ausführlich und verständlich diskutiert. Mit vielen exemplarisch durchgerechneten Aufgaben, einer Vielzahl weiterer Problemstellungen und ausführlichen Lösungen bietet es dem Leser die Möglichkeit, die eigenen Fähigkeiten ständig zu erweitern und kritisch zu überprüfen und bilden so die Grundlage für ein solides Verständnis der Materie. Die realitätsnahen Anwendungen ermöglichen einen Ausblick in die breite Verwendbarkeit dieser wichtigen Theorie.Auf die Entwicklung der Begriffsbildung und mathematischen Konzepte wird besonderer Wert gelegt, so dass man Ihre Bedeutung bei der Erzeugung wie auch ständige Verbesserung von Forschungsinstrumenten für die Untersuchung unserer Welt erleben kann.Gerichtet ist das Buch an Gymnasiasten, Studienanfänger an Hochschulen, Lehrer und Interessierte, die sich mit diesem Gebiet vertraut machen möchten.
Stochastik
Diskrete Wahrscheinlichkeit und Kombinatorik
AvMichael Barot,Juraj Hromkovic
E-bok
Tyska, 2017
287 kr
Läs direkt efter köp
Die grundlegenden Konzepte der Wahrscheinlichkeitstheorie werden in diesem Buch ausführlich und verständlich diskutiert. Mit vielen exemplarisch durchgerechneten Aufgaben, einer Vielzahl weiterer Problemstellungen und ausführlichen Lösungen bietet es dem Leser die Möglichkeit, die eigenen Fähigkeiten ständig zu erweitern und kritisch zu überprüfen und bilden so die Grundlage für ein solides Verständnis der Materie. Die realitätsnahen Anwendungen ermöglichen einen Ausblick in die breite Verwendbarkeit dieser wichtigen Theorie.
Auf die Entwicklung der Begriffsbildung und mathematischen Konzepte wird besonderer Wert gelegt, so dass man Ihre Bedeutung bei der Erzeugung wie auch ständige Verbesserung von Forschungsinstrumenten für die Untersuchung unserer Welt erleben kann.
Gerichtet ist das Buch an Gymnasiasten, Studienanfänger an Hochschulen, Lehrer und Interessierte, die sich mit diesem Gebiet vertraut machen möchten.
Randomisierte Algorithmen
Methoden zum Entwurf von zufallsgesteuerten Systemen für Einsteiger
AvJuraj Hromkovic
E-bok
PDF, Tyska, 2013
407 kr
Läs direkt efter köp
Algorithmische Konzepte der Informatik
Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie. Eine Einführung
AvJuraj Hromkovic
E-bok
PDF, Tyska, 2013
553 kr
Läs direkt efter köp
Dieses Buch ist eine einfache Einführung in algorithmische Grundkonzepte der Theoretischen Informatik. Die Theoretische Informatik ist weltweit ein fester Bestandteil des Informatikstudiums. Im Unterschied zu den ingenieursmäßig geprägten Gebieten der Praktischen und der Technischen Informatik hebt die Theoretische Informatik mehr die naturwissenschaftlichen und mathemati schen Aspekte der Informatik hervor. Gerade die mathematische Prägung ist oft ein Grund dafür, dass die Theoretische Informatik für zu schwer gehal ten wird und dadurch ein nicht gerade beliebter Teil der Ausbildung ist. Der Schwierigkeitsgrad der Theoretischen Informatik ist aber meiner Meinung nach nicht der einzige Grund ihrer Unbeliebtheit, insbesondere wenn die Studieren den in ihrer Beurteilung ausserdem noch das Prädikat "schwach motiviert" oder sogar "langweilig" verwenden. Das könnte auch damit zusammenhängen, dass sich die Einführung in die Theoretische Informatik im Grundstudium an vielen deutschen Hochschulen auf den klassischen Stoff der Berechenbarkeit, der Theorie der formalen Sprachen und der abstrakten Komplexitätstheorie be man dabei überwiegend nur die Konzepte und Ansichten, die schränkt. Dass vor dem Jahr 1970 entstanden sind, vermittelt, dürfte alleine nicht schlimm sein. Es führt aber oft dazu, daß man mit einer einzigen Motivation zu viele Vorlesungen der Art Definition - Satz - Beweis absolvieren muß und so hal biert sich die Wichtigkeit dieser Motivation in den Augen der Studierenden mit jeder weiteren Vorlesung, die anknüpft, ohne eine eigene Motivation zu bringen. Um Abhilfe von diesem Zustand zu schaffen, muß man sich die Entwicklung der Theoretischen Informatik in den letzten 30 Jahren ansehen.
Theoretische Informatik
Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie. Eine Einführung
AvJuraj Hromkovic
E-bok
PDF, Tyska, 2013
559 kr
Läs direkt efter köp
Dieses Buch ist eine einfache Einführung in algorithmische Grundkonzepte der Theoretischen Informatik. Die Theoretische Informatik ist weltweit ein fester Bestandteil des Informatikstudiums. Im Unterschied zu den ingenieursmäßig geprägten Gebieten der Praktischen und der Technischen Informatik hebt die Theoretische Informatik mehr die naturwissenschaftlichen und mathemati schen Aspekte der Informatik hervor. Gerade die mathematische Prägung ist oft ein Grund dafür, dass die Theoretische Informatik für zu schwer gehal ten wird und dadurch ein nicht gerade beliebter Teil der Ausbildung ist. Der Schwierigkeitsgrad der Theoretischen Informatik ist aber meiner Meinung nach nicht der einzige Grund ihrer Unbeliebtheit, insbesondere wenn die Studieren den in ihrer Beurteilung ausserdem noch das Prädikat "schwach motiviert" oder sogar "langweilig" verwenden. Das könnte auch damit zusammenhängen, dass sich die Einführung in die Theoretische Informatik im Grundstudium an vielen deutschen Hochschulen auf den klassischen Stoff der Berechenbarkeit, der Theorie der formalen Sprachen und der abstrakten Komplexitätstheorie be schränkt. Dass man dabei überwiegend nur die Konzepte und Ansichten, die vor dem Jahr 1970 entstanden sind, vermittelt, dürfte alleine nicht schlimm sein. Es führt aber oft dazu, dass man mit einer einzigen Motivation zu viele Vorlesungen der Art Definition - Satz - Beweis absolvieren muß und so hal biert sich die Wichtigkeit dieser Motivation in den Augen der Studierenden mit jeder weiteren Vorlesung, die anknüpft, ohne eine eigene Motivation zu bringen. Um Abhilfe von diesem Zustand zu schaffen, muß man sich die Entwicklung der Theoretischen Informatik in den letzten 30 Jahren ansehen.
Randomisierte Algorithmen
Methoden zum Entwurf von zufallsgesteuerten Systemen für Einsteiger
AvJuraj Hromkovic
Häftad, Tyska, 2004
537 kr
Skickas inom 10-15 vardagar
Zufall ist ein erfolgreiches Mittel fur Entwurf und Entwicklung vieler Systeme in Informatik und Technik. Zufallsgesteuerte Algorithmen sind oft effizienter, einfacher, preiswerter und uberraschenderweise auch zuverlassiger als die besten deterministischen Programme. Warum ist die Zufallssteuerung so erfolgreich und wie entwirft man randomisierte Systeme? Einfach, intuitiv und trotzdem formal prazise gibt dieses Buch dem Leser einen Einstieg in die wunderbare Welt zufallsgesteuerter Algorithmen.
Dissemination of Information in Communication Networks
Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
AvJuraj Hromkovič,Ralf Klasingm. fl.
Inbunden, Engelska, 2005
574 kr
Skickas inom 10-15 vardagar
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 growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook“IntroductiontoParallelAlgorithmsandArchitectures”by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality – the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation forwriting this book.
Theoretical Computer Science
Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
AvJuraj Hromkovič
Inbunden, Engelska, 2003
1 255 kr
Skickas inom 10-15 vardagar
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.
Graph-Theoretic Concepts in Computer Science
30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
AvJuraj Hromkovič,Manfred Naglm. fl.
Häftad, Engelska, 2004
574 kr
Skickas inom 10-15 vardagar
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.
Dissemination of Information in Communication Networks
Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
AvWalter Unger,Peter Ruzickam. fl.
E-bok
PDF, Engelska, 2005
718 kr
Läs direkt efter köp
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 growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook“IntroductiontoParallelAlgorithmsandArchitectures”by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality – the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation forwriting this book.
Graph-Theoretic Concepts in Computer Science
30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
AvBernhard Westfechtel,Manfred Naglm. fl.
E-bok
PDF, Engelska, 2005
718 kr
Läs direkt efter köp
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.
Algorithmics for Hard Problems
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
AvJuraj Hromkovič
Inbunden, Engelska, 2002
1 028 kr
Skickas inom 10-15 vardagar
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.
Graph-Theoretic Concepts in Computer Science
24th International Workshop, WG''98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings
AvOndrej Sykora,Juraj Hromkovic
E-bok
PDF, Engelska, 2005
718 kr
Läs direkt efter köp
Communication Complexity and Parallel Computing
AvJuraj Hromkovič
Inbunden, Engelska, 1997
574 kr
Skickas inom 10-15 vardagar
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.
Graph-Theoretic Concepts in Computer Science
24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, Proceedings
AvJuraj Hromkovič,Ondrej Sykora
Häftad, Engelska, 1998
574 kr
Skickas inom 10-15 vardagar
The International Workshop on Graph-Theoretic Concepts in Computer Science is one of the most traditional and high quality conferences in Computer Science. PreviousconferenceswereorganizedatvariousplacesinAustria,Germany,Italy, and the Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The workshop is well-balanced with respect to established researchers and young scientists. th The24 InternationalWorkshoponGraph-TheoreticConceptsinComputer Science(WG'98)washeldatSmoleniceCastle,nearBratislava,SlovakRepublic, June 18-20, 1998. It was organized by the Slovak Academy of Computer Science in cooperation with the Department of Computer Science I at RWTH Aachen (Germany) and with Slovak Society for Computer Science. For the ?rst time in its history, WG took place in a country of the former eastern block, in the Slovak Republic. The program committee of WG'98 consisted of: H. Bodlaender, Utrecht (NL) A. Brandst. adt, Rostock (D) M.Habib, Montpellier (F) J. Hromkovi? c, Aachen (D) L. Kirousis, Patras (GR) L. Ku? cera, Praha (CR) A. Marchetti-Spaccamela, Roma (I) E. Mayr, Munc .. hen (D) R. Moehring, Berlin (D) M. Nagl, Aachen (D) H. Noltemeier, Wurzburg .. (D) F. Parisi Presicce, Roma (I) O. Syk ' ora, Bratislava (SK) G. Tinhofer, Munc .. hen (D) D. Wagner, Konstanz (D) P.
Stochastic Algorithms: Foundations and Applications
4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
AvJuraj Hromkovič,Richard Královiçm. fl.
Häftad, Engelska, 2007
558 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.
Stochastic Algorithms: Foundations and Applications
4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
AvPeter Widmayer,Marc Nunkesserm. fl.
E-bok
PDF, Engelska, 2007
718 kr
Läs direkt efter köp
Algorithmic Adventures
From Knowledge to Magic
AvJuraj Hromkovič
Inbunden, Engelska, 2009
613 kr
Skickas inom 10-15 vardagar
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.
Algorithmic Adventures
From Knowledge to Magic
AvJuraj Hromkovic
E-bok
PDF, Engelska, 2009
837 kr
Läs direkt efter köp
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.
Dissemination of Information in Communication Networks
Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
AvJuraj Hromkovič,Ralf Klasingm. fl.
Häftad, Engelska, 2010
574 kr
Skickas inom 10-15 vardagar
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 growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents,severalbooksonparallelcomputingwerewritten. The involvedtextbook“IntroductiontoParallelAlgorithmsandArchitectures”by F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality – the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation forwriting this book.
Theoretical Computer Science
Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
AvJuraj Hromkovič
Häftad, Engelska, 2010
1 255 kr
Skickas inom 10-15 vardagar
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.
Algorithmics for Hard Problems
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
AvJuraj Hromkovič
Häftad, Engelska, 2010
723 kr
Skickas inom 10-15 vardagar
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.
Communication Complexity and Parallel Computing
AvJuraj Hromkovič
Häftad, Engelska, 2010
574 kr
Skickas inom 10-15 vardagar
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.
Teaching Fundamental Concepts of Informatics
4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010, Proceedings
AvJuraj Hromkovič,Rastislav Královicm. fl.
Häftad, Engelska, 2010
542 kr
Skickas inom 10-15 vardagar
The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitioners in the area of computer science education with a focus on secondary schools. The ISSEP series started in 2005 in Klagenfurt, and continued in 2006 in Vilnius, and in 2008 in Torun. ´ The 4th ISSEP took part in Zurich. This volume presents 4 of the 5 invited talks and 14 regular contributions chosen from 32 submissions to ISSEP 2010. The ISSEP conference series is devoted to all aspects of computer science teaching. In the preface of the proceedings of ISSEP 2006, Roland Mittermeir wrote: “ISSEP aims at educating ‘informatics proper’ by showing the beauty of the discipline, hoping to create interest in a later professional career in c- puting, and it will give answers di?erent from the opinion of those who used to familiarize pupils with the basics of ICT in order to achieve computer lit- acy for the young generation. ” This is an important message at this time, when several countries have reduced teaching informatics to educating about current softwarepackagesthatchangefromyeartoyear. ThegoalofISSEPistosupport teaching of the basic concepts and methods of informatics, thereby making it a subject in secondary schools that is comparable in depth and requirements with mathematics or natural sciences. As we tried to present in our book “Algori- mic Adventures.
Teaching Fundamental Concepts of Informatics
4th International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2010, Zurich, Switzerland, January 13-15, 2010, Proceedings
AvJan Vahrenhold,Rastislav Kralovicm. fl.
E-bok
PDF, Engelska, 2009
710 kr
Läs direkt efter köp
The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitioners in the area of computer science education with a focus on secondary schools. The ISSEP series started in 2005 in Klagenfurt, and continued in 2006 in Vilnius, and in 2008 in Torun. ´ The 4th ISSEP took part in Zurich. This volume presents 4 of the 5 invited talks and 14 regular contributions chosen from 32 submissions to ISSEP 2010. The ISSEP conference series is devoted to all aspects of computer science teaching. In the preface of the proceedings of ISSEP 2006, Roland Mittermeir wrote: “ISSEP aims at educating ‘informatics proper’ by showing the beauty of the discipline, hoping to create interest in a later professional career in c- puting, and it will give answers di?erent from the opinion of those who used to familiarize pupils with the basics of ICT in order to achieve computer lit- acy for the young generation. ” This is an important message at this time, when several countries have reduced teaching informatics to educating about current softwarepackagesthatchangefromyeartoyear. ThegoalofISSEPistosupport teaching of the basic concepts and methods of informatics, thereby making it a subject in secondary schools that is comparable in depth and requirements with mathematics or natural sciences. As we tried to present in our book “Algori- mic Adventures.
SOFSEM 2011: Theory and Practice of Computer Science
37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings
AvIvana Cerná,Tibor Gyimóthym. fl.
Häftad, Engelska, 2011
574 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011, held in Nový, Smokovec, Slovakia in January 2011.The 41 revised full papers, presented together with 5 invited contributions, were carefully reviewed and selected from 122 submissions. SOFSEM 2011 was organized around the following four tracks: foundations of computer science; software, systems, and services; processing large datasets; and cryptography, security, and trust.

Juraj Hromkovič – författare

Stochastik 2

Stochastik 2

einfach Informatik. Programmieren. Bundesausgabe ab 2018

einfach Informatik. Daten darstellen, verschlüsseln, komprimieren. Bundesausgabe ab 2018

Stochastik

Stochastik

Randomisierte Algorithmen

Algorithmische Konzepte der Informatik

Theoretische Informatik

Randomisierte Algorithmen

Dissemination of Information in Communication Networks

Theoretical Computer Science

Graph-Theoretic Concepts in Computer Science

Dissemination of Information in Communication Networks

Graph-Theoretic Concepts in Computer Science

Algorithmics for Hard Problems

Graph-Theoretic Concepts in Computer Science

Communication Complexity and Parallel Computing

Graph-Theoretic Concepts in Computer Science

Stochastic Algorithms: Foundations and Applications

Stochastic Algorithms: Foundations and Applications

Algorithmic Adventures

Algorithmic Adventures

Dissemination of Information in Communication Networks

Theoretical Computer Science

Algorithmics for Hard Problems

Communication Complexity and Parallel Computing

Teaching Fundamental Concepts of Informatics

Teaching Fundamental Concepts of Informatics

SOFSEM 2011: Theory and Practice of Computer Science