Christian Scheideler

Andrea Werneck Richa

This book constitutes the refereed conference proceedings of the 27th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2020, held in Paderborn, Germany, in June 2020.* The 19 full papers and 2 invited papers presented in this book were carefully reviewed and selected from 41 submissions. They are divided into seven sections, i.e. invited papers; mobile robots; dynamic graphs; network communication; multi-agent systems; communication complexity; and game theory. * The conference was held virtually due to the COVID-19 pandemic.

27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings

Structural Information and Communication Complexity

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, held in Bordeaux, France, in July 2010. The 15 full papers and two brief announcements were carefully reviewed and selected from 31 submissions. The workshop aimed at bringing together research contributions related to diverse algorithmic and complexity-theoretic aspects of wireless sensor networks. In 2010 the focus was extended to comprise also contributions about related types of networks such as ad hoc wireless networks, mobile networks, radio networks and distributed systems of robots.

6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers

Algorithms for Sensor Systems

Berthold Vöcking

Helmut Alt

Martin Dietzfelbinger

Rüdiger Reischuk

Heribert Vollmer

Dorothea Wagner

Hinter vielen Computer-Programmen stecken intelligente Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Zahlen-Aufgaben, sondern auch ganz alltägliche Probleme: Wie ermittle ich den kürzesten Weg zwischen zwei Orten? Oder, wie kann ich einen Kuchen gerecht aufteilen? In diesem Buch erklären Informatiker 43 besonders elegante Algorithmen und illustrieren die Grundprinzipien des Algorithmendesigns anhand von interessanten Anwendungen, ohne dabei vom Leser spezielle Vorkenntnisse zu erwarten.

Taschenbuch der Algorithmen

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.

22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings

James Aspnes

Anish Arora

Samuel Madden

This book constitutes the refereed proceedings of the Third International Conference on Distributed Computing in Sensor Systems, DCOSS 2007, held in Sante Fe, NM, USA in June 2007. It covers algorithms, applications, and systems. It bridges the gap between theory and practice and between the broader field of distributed computing and the specific issues arising in sensor networks and related systems.

Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings

Distributed Computing in Sensor Systems

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.

Christian Scheideler

About

Books

Join the club