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, communication 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.

This book constitutes the refereed proceedings of the 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2012, held in Toronto, Canada, in October 2012. The 21 full papers and 10 brief announcements presented in this volume were carefully reviewed and selected from 75 submissions. The conference provides a wide spectrum of topics, covered in the following tracks: self-stabilization, ad-hoc and sensor networks, fault-tolerance and dependable systems, safety and security, cloud computing, formal methods, social networks, peer-to-peer, self-organizing and autonomic systems.

The 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.

The 27 revised full papers presented were carefully reviewed and selected from 71 submissions. The papers class in three tracks covering the areas of algorithms, applications, and systems, thus bridging 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.

This book presents the history and state of the art of universal routing strategies, which can be applied to networks independently of their respective topologies. It opens with a self-contained introduction, accessible also to newcomers. The main original results are new universal network protocols for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.

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.

This book constitutes revised selected papers from the 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, held in Munich, Germany, in September 2019. The 11 full papers presented in this volume were carefully reviewed and selected from 16 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks.

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.

Hinter vielen Programmen stecken clevere Verfahren, die man als Algorithmen bezeichnet. Algorithmen losen nicht nur mathematische Aufgaben, die sich mit Zahlen beschaftigen, sondern auch andere, ganz alltagliche Problemstellungen, bei denen logischer Spursinn, raumliche Orientierung oder geschicktes Verhandeln gefragt sind, beispielsweise: Wie sollten Seerauber eine Schatzkarte aufteilen, bzw. Bankangestellte den Geheimcode des Tresors? Wie ermittle ich den kurzesten Weg zwischen zwei Orten? Wie kann ich einen Kuchen gerecht aufteilen? Dieses Buch vollfuhrt einen Streifzug durch die faszinierende Welt der Algorithmen. Es verlangt keine Vorkenntnisse, so dass Schuler ab der Mittelstufe und Informatik-interessierte Laien neue und uberraschende Einblicke gewinnen konnen. In 43 Artikeln von Informatikern, die an Universitaten im In- und Ausland lehren, werden besonders elegante Algorithmen anschaulich und umgangssprachlich erklart, so dass die besondere Faszination der Informatik spurbar wird."