Frank Dehne

Jörg-Rüdiger Sack

Nicola Santoro

Workshop on Algorithms and Data Structures

This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.

2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings

Algorithms and Data Structures

International Workshop on Distributed Algorithms (4, 1990, Bari)

Università di Bari. Istituto di scienze dell'informazione

Jan van Leeuwen, informaticien

Proceedings of the 4th of a series of workshops on distributed algorithms. The workshop was a forum for researchers and others to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems.

4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings.

Distributed Algorithms

Sue Whitesides

The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.

Third Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings

Michel Raynal

Tarek F. Abdelzaher

OPODIS, the International Conference on Principles of Distributed Systems, is an annual forum for presentation of state-of-the-art knowledge on principles of distributed computing systems, including theory, design, analysis, implemen- tion and application of distributed systems, among researchers from around the world. The 13th edition of OPODIS was held during December 15–18,in Nimes, France. There were 71 submissions, and this volume contains the 23 regular cont- butions and the 4 brief annoucements selected by the Progam Committee. All submitted papers were read and evaluated by three to ?ve PC members assisted by external reviewers. The ?nal decision regarding every paper was taken after long discussions through EasyChair. This year the Best Paper Award was shared by two papers: “On the C- putational Power of Shared Objects” by Gadi Taubenfeld and “Transactional SchedulingforRead-DominatedWorkloads”byHagitAttiyaandAlessiaMilani. The Best Student Paper Award was given to the paper “Decentralized Polling withRespectableParticipants”co-authoredKevinHugueninandMaximeMonod and their advisors. TheconferencealsofeaturedtwoveryinterestinginvitedtalksbyAnne-Marie Kermarrec and Maurice Herlihy. Anne-Marie's talk was on “Navigating Web 2.0 with Gossple” and Maurice's talk was on “Transactional Memory Today: A Status Report.” OPODIShasnowfoundits placeamongthe internationalconferencesrelated toprinciplesofdistributedcomputinganddistributedsystems.Wehopethatthis 13theditionwill contributeto the growthandthe developmentofthe conference and continue to increase its visibility. Finally we would like to thank Nicola Santoro, Conference General Chair, Hac` eneFouchal,Steering Committee Chair,andBernardThibault for their c- stant help.

13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings

Principles of Distributed Systems

Giuseppe Prencipe

Paola Flocchini

Distributed Computing by Mobile Entities is concerned with the study of the computational and complexity issues arising in systems of decentralized computational entities operating in a spatial universe Encompassing and modeling a large variety of application environments and systems, from robotic swarms to networks of mobile sensors, from software mobile agents in communication networks to crawlers and viruses on the web, the theoretical research in this area intersects distributed computing with the fields of computational geometry (especially for continuous spaces), control theory, graph theory and combinatorics (especially for discrete spaces). The research focus is on determining what tasks can be performed by the entities, under what conditions, and at what cost. In particular, the central question is to determine what minimal hypotheses allow a given problem to be solved. This book is based on the lectures and tutorial presented at the research meeting on “Moving and Computing" (mac) held at La Maddalena Island in June 2017. Greatly expanded, revised and updated, each of the lectures forms an individual Chapter. Together, they provide a map of the current knowledge about the boundaries of distributed computing by mobile entities.

Current Research in Moving and Computing

Distributed Computing by Mobile Entities

The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions

Distributed Computing by Oblivious Mobile Robots

This text is based on a simple and fully reactive computational model that allows for intuitive comprehension and logical designs. The principles and techniques presented can be applied to any distributed computing environment (e.g., distributed systems, communication networks, data networks, grid networks, internet, etc.). The text provides a wealth of unique material for learning how to design algorithms and protocols perform tasks efficiently in a distributed computing environment.

Design and Analysis of Distributed Algorithms

Ayrton Senna Da Silva non è stato solo un grande pilota automobilistico, forse il più grande, ma un personaggio ideale, irripetibile, il portabandiera di un paese disagiato, divenuto mito contemporaneo. Serio, educato, attento nei modi, con quell’aria normale, “per bene”, riusciva immediatamente simpatico. Una volta in macchina, poi, si trasformava in un fenomeno che incantava tutti. Con tre mondiali vinti e sessantacinque pole position all’attivo, nulla sembrava poterlo fermare. La sua morte, apparentemente inspiegabile, inaspettata, improvvisa, alla guida della migliore monoposto di quegli anni, ha cristallizzato il mito, che resiste a vent’anni di distanza. Senna, Senna, Senna, i social media ne sono invasi: infiniti sono i video che lo ritraggono nelle sue gesta più note; ormai appartiene all’immaginario collettivo, sta nell’Olimpo dei grandi. Questo ebook tratta del processo seguito alla sua morte, che ha catalizzato l’attenzione dell’opinione pubblica a causa dei molti misteri rimasti insoluti. Riporta i fatti giudiziari, romanzando un evento tenico-giuridico memorabile. Si tratta del processo di primo grado tenutosi tra il 1996 e il 1999, anno della prima pubblicazione. La presente versione, aggiornata dall’autore, contiene un’appendice sui successivi processi di Appello e Cassazione. Un ebook imperdibile per i lettori che vogliono scoprire un personaggio immenso e addentrarsi nel giallo della sua scomparsa. Un bellissimo regalo per tutti gli appassionati della Formula 1.

Il caso Ayrton Senna. Tutta la verità sul processo

Ugo Montanari

Ricardo Baeza-Yates

Foundations of Information Technology in the Era of Network and Mobile Computing is presented in two distinct but interrelated tracks: -Algorithms, Complexity and Models of Computation; -Logic, Semantics, Specification and Verification. This volume contains 45 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), which was held in conjunction with the 17th World Computer Congress, sponsored by the International Federation for Information Processing (IFIP), and which convened in Montréal, Québec, Canada in August 2002.

IFIP 17th World Computer Congress — TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002) August 25–30, 2002, Montréal, Québec, Canada

Nicola Santoro

About

Books

Join the club