You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
SIROCCO 2005 was the twelfth in this series, held in Mont Saint-Michel, France, May 24 26, 2005.
This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994. Besides the 23 research papers carefully selected by the program committee, the book contains 3 invited papers. The volume covers all relevant aspects of distributed algorithms; the topics discussed include network protocols, distributed control and communication, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.
This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S ̃ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before,...
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in September 2006, in the context of the combined conference ALGO 2006. The 70 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 287 submissions. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions.
The papers in this volume were presented at the 12th International Sym- sium on Stabilization, Safety, and Security of Distributed Systems (SSS), held September 20–22, 2010 at Columbia University, NYC, USA. The SSS symposium is an international forum for researchersand practiti- ers in the design and development of distributed systems with self-* properties: (theclassical)self-stabilizing,self-con?guring,self-organizing,self-managing,se- repairing,self-healing,self-optimizing,self-adaptive,andself-protecting. Research in distributed systems is now at a crucial point in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wi- lesssensornetwor...
This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.
This book constitutes the refereed proceedings of the 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2006, held in Dallas, TX, USA in November 2006. The 36 revised full papers and 12 revised short papers presented together with the extended abstracts of 2 invited lectures address all aspects of self-stabilization, safety and security, recovery oriented systems and programming.
This book constitutes the refereed proceedings of the 20th international Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2000, held in New Delhi, India in December 2000. The 36 revised full papers presented were carefully reviewed and selected from a total of 141 submissions; also included are six invited papers. The volume provides broad coverage of the logical and mathematical foundations of computer science and spans the whole range of theoretical computer science.
The proceedings of the January 1995 symposium, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics, comprise 70 papers. Among the topics: on-line approximate list indexing with applications; finding subsets maximizing minimum structures; register allocation in structured programs; and splay trees for data compression. No index. Annotation copyright by Book News, Inc., Portland, OR