http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
20th international symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006 : proceedings
Exploring Gafni's reduction land : from [Omega][superscript k] to wait-free adaptive (2p -- [p/k])-renaming via [kappa]-set agreement / Achour Mostefaoui, Michel Raynal and Corentin Travers -- Renaming in message passing systems with Byzantine failures / Michael Okun and Amnon Barak -- Built-in coloring for highly-concurrent doubly-linked lists / Hagit Attiya and Eshar Hillel -- Fault-tolerant and self-stabilizing mobile robots gathering / Xavier Defago, Maria Gradinariu, Stephane Messika and Philippe Raipin-Parvedy -- Fast Computation by population protocols with a leader / Dana Angluin, James Aspnes and David Eisenstat -- On self-stabilizing search trees / Doina Bein, Ajoy K. Datta and Lawrence L. Larmore -- Efficient dynamic aggregation / Yitzhak Birk, Idit Keidar, Liran Liss and Assaf Schuster -- Groupings and pairings in anonymous networks / Jeremie Chalopin, Shantanu Das and Nicola Santoro -- A new proof of the GHS minimum spanning tree algorithm / Yoram Moses and Benny Shimony -- A knowledge-based analysis of global function computation / Joseph Y. Halpern and Sabina Petride -- Checking a multithreaded algorithm with [superscript +]CAL / Leslie Lamport -- Capturing register and control dependence in memory consistency models with applications to the Itanium architecture / Lisa Higham, LillAnne Jackson and Jalal Kawash -- Conflict detection and validation strategies for software transactional memory / Michael F. Spear, Virendra J. Marathe, William N. Scherer III and Michael L. Scott -- Transactional locking II / Dave Dice, Ori Shalev and Nir Shavit -- Less is more : consensus gaps between restricted and unrestricted objects / Yehuda Afek and Eran Shalom -- One-step consensus solvability / Taisuke Izumi and Toshimitsu Masuzawa -- Time-bounded task-PIOAs : a framework for analyzing security protocols / Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira and Roberto Segala -- On consistency of encrypted files / Alina Oprea and Michael K. Reiter -- Agreeing to agree : conflict resolution for optimistically replicated data / Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce and Alan Schmitt -- A lazy snapshot algorithm with eager validation / Torvald Riegel, Pascal Felber and Christof Fetzer -- Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients / Rida A. Bazzi and Yin Ding -- Time and communication efficient consensus for crash failures / Bogdan S. Chlebus and Dariusz R. Kowalski -- Subconsensus tasks : renaming is weaker than set agreement / Eli Gafni, Sergio Rajsbaum and Maurice Herlihy -- Exact distance labelings yield additive-stretch compact routing schemes / Arthur Brady and Lenore Cowen -- A fast distributed approximation algorithm for minimum spanning trees / Maleq Khan and Gopal Pandurangan -- On randomized broadcasting in power law networks / Robert Elsasser -- Distributed approximation algorithms in unit-disk graphs / A. Czygrinow and M. Hanckowiak -- The weakest failure detectors to boost obstruction-freedom / Rachid Guerraoui, Michal Kapalka and Petr Kouznetsov -- Fully-adaptive algorithms for long-lived renaming / Alex Brodsky, Faith Ellen and Philipp Woelfel -- Constructing shared objects that are both robust and high-throughput / Danny Hendler and Shay Kutten -- Byzantine and multi-writer K-quorums / Amitanand S. Aiyer, Lorenzo Alvisi and Rida A. Bazzi -- On minimizing the number of ADMs in a general topology optical network / Michele Flammini, Mordechai Shalom and Shmuel Zaks -- Robust network supercomputing with malicious processes / Kishori M. Konwar, Sanguthevar Rajasekaran and Alexander A. Shvartsman -- Distributed resource allocation in stream processing systems / Cathy H. Xia, James A. Broberg, Zhen Liu and Li Zhang -- Low-latency atomic broadcast in the presence of contention / Piotr Zielinski -- Oblivious gradient clock synchronization / Thomas Locher and Roger Wattenhofer -- Abortable and query-abortable objects / Marcos K. Aguilera, Svend Frolund, Vassos Hadzilacos, Stephanie Loraine Horn and Sam Toueg -- Fault-tolerant semifast implementations of atomic read/write registers / Chryssis Georgiou, Nicolas C. Nicolaou and Alexander A. Shvartsman -- Convergence analysis of scalable gossip protocols / Stacy Patterson, Bassam Bamieh and Amr El Abbadi -- Computing automatically the stabilization time against the worst and the best schedules / Joffroy Beauquier, Colette Johnen and Stephane Messika -- Many slices are better than one / Vinit A. Ogale and Vijay K. Garg -- On augmented graph navigability / Pierre Fraigniaud, Emmanuelle Lebhar and Zvi Lotker -- Decoupled quorum-based Byzantine-resilient coordination in open distributed systems / Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga and Lau Cheuk Lung -- Optimistic algorithms for partial database replication / Nicolas Schiper, Rodrigo Schmidt and Fernando Pedone -- Performance analysis of cyclon, an inexpensive membership management for unstructured P2P overlays / Francois Bonnet, Frederic Tronel and Spyros Voulgaris -- Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance / Yu Chen and Wei Chen -- Monitoring of linear distributed computations / Anton Esin, Rostislav Yavoraskiy and Nikolay Zemtsov -- Communication-optimal implementation of failure detector class [actual symbol not reproducible][actual symbol not reproducible] / Mikel Larrea, Alberto Lafuente and Joachim Wieland -- Synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks / Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal and S. Venkatesan.
Access restricted to subscribing institutions.
Includes bibliographical references and index.
Lecture notes in computer science ; 4167
Theoretical computer science and general issues