Paul Spirakis - Böcker

The foundations of parallel computation, especially the efficiency of computation, are the concern of this book. Distinguished international researchers have contributed fifteen chapters which together form a coherent stream taking the reader who has little prior knowledge of the field to a position of being familiar with leading edge issues. The book may also function as a source of teaching material and reference for researchers. The first part is devoted to the Parallel Random Access Machine (P-RAM) model of parallel computation. The initial chapters justify and define the model, which is then used for the development of algorithm design in a variety of application areas such as deterministic algorithms, randomisation and algorithm resilience. The second part deals with distributed memory models of computation. The question of efficiently implementing P-RAM algorithms within these models is addressed as are the immensely interesting prospects for general purpose parallel computation.

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

This book constitutes the refereed proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2017, held in Boston, MA, USA, in November 2017. The 29 revised full papers presented together with 8 revised short papers were carefully reviewed and selected from 68 initial submissions.

The book constitutes the refereed proceedings of the First International Conference on Distributed Computing in Sensor Systems, DCOSS 2005, held in Marina del Rey, California, USA in June/July 2005.The 26 revised full papers presented were carefully reviewed and selected from 85 submissions; also included are the abstracts of 3 invited talks, 2 short papers, 9 invited poster abstracts, and 10 contributed abstracts.The papers address all current aspects of distributed computing issues in large-scale networked sensor systems, including systematic design techniques and tools, algorithms, and applications.

This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995.The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.

This book constitutes the refereed proceedings of the Second International Workshop on Internet and Network Economics, WINE 2006, held in Patras, Greece in December 2006. It contains 32 papers that contain foundational and mathematical work for solving problems in internet technologies, grid computing, network communication protocols, as well as social economic issues in virtual communities enabled through the World Wide Web.

ICALP 2010, the 37th edition of the International Colloquium on Automata, Languages and Programming was held July 6-10, 2010 in Bordeaux, France. ICALP is a series of annual conference of the European Association for Th- retical Computer Science (EATCS) which ?rst took place in 1972, organized by MauriceNivatandhiscolleaguesinParis.Thisyear,theprogramconsistedofthe established trackA, focusing on Algorithms,Complexity and Games, chairedby Paul G. Spirakis; Track B, focusing on Logic, Semantics, Automata and Theory of Programming, chaired by Samson Abramsky; Track C focusing this year on Foundations of Networked Computation: Models, Algorithms and Information Management, chaired by Friedhelm Meyer auf der Heide. The three Program Committees received a total of 389 submissions: 222 for TrackA,114forTrackBand53forTrackC,writtenbyauthorsfrom45di?erent countries. Of these, 60, 30 and 16, respectively, were selected for inclusion in the scienti?c program. Each paper got on average 3.5 referee reports. The Programalsoincluded six invitedtalks byPierreFraigniaud(CNRS and Univ.ParisDiderot),JeanGoubault-Larrecq(ENSCachanandLSV),Burkhard Monien (Univ. Paderborn), Joel Ouaknine (Oxford Univ.Computing Lab.), Roger Wattenhofer (ETH Zurich), and Emo Welzl (ETH Zurich). These 112 contributed and invited papers are presented in two proceedings volumes. The ?rst contains the contributed papers of Track A and the invited talks of Burkhard Monien and Emo Welzl. The second volume contains the contributed papers of Tracks B and C as well as the invited talks of Pierre Fraigniaud, Jean Goubault-Larrecq, Joel Ouaknine and Roger Wattenhofer.

ICALP 2010, the 37th edition of the International Colloquium on Automata, Languages and Programming was held July 6-10, 2010 in Bordeaux, France. ICALP is a series of annual conference of the European Association for Th- retical Computer Science (EATCS) which ?rst took place in 1972, organized by MauriceNivatandhiscolleaguesinParis.Thisyear,theprogramconsistedofthe established trackA, focusing on Algorithms,Complexity and Games, chairedby Paul G. Spirakis; Track B, focusing on Logic, Semantics, Automata and Theory of Programming, chaired by Samson Abramsky; Track C focusing this year on Foundations of Networked Computation: Models, Algorithms and Information Management, chaired by Friedhelm Meyer auf der Heide. The three Program Committees received a total of 389 submissions: 222 for TrackA,114forTrackBand53forTrackC,writtenbyauthorsfrom45di?erent countries. Of these, 60, 30 and 16, respectively, were selected for inclusion in the scienti?c program. Each paper got on average 3.5 referee reports. The Programalsoincluded six invitedtalks byPierreFraigniaud(CNRS and Univ.ParisDiderot),JeanGoubault-Larrecq(ENSCachanandLSV),Burkhard Monien (Univ. Paderborn), Joel Ouaknine (Oxford Univ.Computing Lab.), Roger Wattenhofer (ETH Zurich), and Emo Welzl (ETH Zurich). These 112 contributed and invited papers are presented in two proceedings volumes. The ?rst contains the contributed papers of Track A and the invited talks of Burkhard Monien and Emo Welzl. The second volume contains the contributed papers of Tracks B and C as well as the invited talks of Pierre Fraigniaud, Jean Goubault-Larrecq, Joel Ouaknine and Roger Wattenhofer.