David Peleg – författare

This volume presents the locality-sensitive approach to distributed network algorithms - the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications.Distributed Computing: A Locality-Sensitive Approach is the only book that gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.

This volume contains the invited and contributed papers selected for presen- tion at SOFSEM 2010, the 36th Conference on Current Trends in Theory and Practiceof Computer Science, held January23-29,2010 in the Hotel Bed? richov, ? Spindler? uv Mlyn, ' of the Krkono? se Mountains of the Czech Republic. SOFSEM(originally:SOFtwareSEMinar)isdevotedtoleadingresearch,and fosters the cooperation among researchers and professionals from academia and industry in all areas of computer science. As a well-established and fully int- national conference, SOFSEM maintains the best of its original Winter School aspects,suchasa highnumber of invitedtalksandanin-depth coverageofnovel research results in selected areas within computer science. SOFSEM 2010 was organized around the following four tracks: - Foundations of Computer Science (Chairs: David Peleg, Anca Muscholl) - Principles of Software Construction (Chair: Bernhard Rumpe) - Data, Knowledge, and Intelligent Systems (Chair: Jaroslav Pokorn' y) - Web Science (Chair: Jan van Leeuwen) With these tracks, SOFSEM 2010 covered the latest advances in research, both theoretical and applied, in leading areas of computer science.The SOFSEM 2010 Program Committee consisted of 78 international experts from 20 di?erent countries, representing the track areas with outstanding expertise. An integral part of SOFSEM 2010 was the traditional Student Research - rum (SRF, Chair: Ma 'ria Bielikov' a), organized with the aim to present student projects in the theory and practice of computer science and to give students feedback on both the originality of their scienti?c results and on their work in progress.

This book constitutes the refereed proceedings of the 25th International Symposium on Distributed Computing, DISC 2011, held in Rome, Italy, in September 2011. The 31 revised full papers presented together with invited lectures and brief announcements were carefully reviewed and selected from 136 submissions. The papers are organized in topical sections on distributed graph algorithms; shared memory; brief announcements; fault-tolerance and security; paxos plus; wireless; network algorithms; aspects of locality; consensus; concurrency.

This book constitutes the refereed proceedings of the 25th International Symposium on Distributed Computing, DISC 2011, held in Rome, Italy, in September 2011. The 31 revised full papers presented together with invited lectures and brief announcements were carefully reviewed and selected from 136 submissions. The papers are organized in topical sections on distributed graph algorithms; shared memory; brief announcements; fault-tolerance and security; paxos plus; wireless; network algorithms; aspects of locality; consensus; concurrency.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.