Search results for "Wait-Free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
114	John Havlicek	Computable Obstructions to Wait-Free Computability.	Distributed Comput.	2000	DBLP DOI BibTeX RDF	Decision tasks, Homology, Simplicial complexes, Wait-free computing
104	Hagit Attiya, Nancy A. Lynch, Nir Shavit	Are Wait-Free Algorithms Fast?	J. ACM	1994	DBLP DOI BibTeX RDF	approximate agreement, fault-tolerance, wait-free
104	Maurice Herlihy	Wait-Free Synchronization.	ACM Trans. Program. Lang. Syst.	1991	DBLP DOI BibTeX RDF	linearization, wait-free synchronization
87	John Havlicek	Computable Obstructions to Wait-free Computability.	FOCS	1997	DBLP DOI BibTeX RDF	computable obstructions, distributed decision task, wait-free protocol, fault-tolerant computation, computability, asynchronous distributed systems, shared-memory model, wait-free computability
85	Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov	The weakest failure detectors to boost obstruction-freedom.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Obstruction-free, Shared memory, Contention manager, Failure detector, Wait-free, Non-blocking
83	Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen	On utility accrual processor scheduling with wait-free synchronization for embedded real-time software.	SAC	2006	DBLP DOI BibTeX RDF	time/utility functions, wait-free synchronization
83	Rida A. Bazzi, Yin Ding	Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.	DISC	2006	DBLP DOI BibTeX RDF	Fault Tolerance, Replication, Atomic, Timestamps, Wait-Free, Byzantine
81	James H. Anderson, Mark Moir	Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations.	Distributed Comput.	1997	DBLP DOI BibTeX RDF	k -Assignment, k -Exclusion, Shared subjects, Shared-memory multiprocessors, Resiliency, Wait-free, Local spinning
75	Mark Moir	Transparent Support for Wait-Free Transactions.	WDAG	1997	DBLP DOI BibTeX RDF
73	Michel Raynal, Corentin Travers	In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement.	OPODIS	2006	DBLP DOI BibTeX RDF	Leader oracle, Participating process, Consensus, Asynchronous system, Shared object, Atomic register, Set agreement, Asynchronous algorithm, Wait-free algorithm
73	Michel Raynal	Wait-Free Objects for Real-Time Systems? (position paper).	Symposium on Object-Oriented Real-Time Distributed Computing	2002	DBLP DOI BibTeX RDF	Wait-Free Objects, Fault-Tolerance, Real-Time, Graceful Degradation
73	Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi	Randomized Naming Using Wait-Free Shared Variables.	Distributed Comput.	1998	DBLP DOI BibTeX RDF	Naming problem, Unique process ID, Asynchronous distributed protocols, Wait-free read/write registers, Test-and-set objects, Fault-tolerance, Randomized algorithms, Shared memory, Atomicity, Symmetry breaking, Adaptive adversary
73	Marina Papatriantafilou, Philippas Tsigas	On Self-Stabilizing Wait-Free Clock Synchronization.	SWAT	1994	DBLP DOI BibTeX RDF	PRAM computation model, Fault tolerance, Concurrency, Distributed Computing, Synchronization, Self-Stabilization, Synchronous Systems, Wait-Free Synchronization, Digital Clocks
71	Eric Schenk	Faster Approximate Agreement with Multi-Writer Registers.	FOCS	1995	DBLP DOI BibTeX RDF	multi-writer registers, wait-free approximate agreement problem, asynchronous shared memory, single-bit multi-writer multi-reader registers, wait-free single-writer multi-reader, wait-free multi-writer multi-reader, computational complexity, complexity, distributed algorithms, lower bounds, shared memory systems, upper bounds, shared registers
70	Scott M. Pike, Yantao Song, Srikanth Sastry	Wait-Free Dining Under Eventual Weak Exclusion.	ICDCN	2008	DBLP DOI BibTeX RDF	Failure Detectors, Wait-Freedom, Dining Philosophers
68	Hideyuki Takada, Ken Sakamura	A novel approach to multiprogrammed multiprocessor synchronization for real-time kernel.	RTSS	1997	DBLP DOI BibTeX RDF	multiprogrammed multiprocessor synchronization, inopportune preemption, preemption-safe locking, preemption cost, wait-free operations, complex data structures, SPEPP, Spinning Processor Executes for Preempted Processors, performance measurements, multiprogramming, wait-free synchronization, real-time kernels
66	Faith E. Fich, Danny Hendler, Nir Shavit	On the inherent weakness of conditional synchronization primitives.	PODC	2004	DBLP DOI BibTeX RDF	load-linked, store-conditional, test-and-set, lower bounds, compare-and-swap, wait-freedom, synchronization primitives
64	Maurice Herlihy	Taking concurrency seriously (position paper).	OOPSLA/ECOOP Workshop on Object-based Concurrent Programming	1988	DBLP DOI BibTeX RDF
63	Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen	Space-Optimal, Wait-Free Real-Time Synchronization.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	wait-free buffers, real-time systems, Nonblocking synchronization, space-optimality
63	Ling Cheung	Randomized Wait-Free Consensus Using an Atomicity Assumption.	OPODIS	2005	DBLP DOI BibTeX RDF	Asynchronous Consensus, Wait-Free Termination, Weak Adversary, Randomized Algorithms, Probabilistic Model Checking
62	Håkan Sundell	Wait-Free Reference Counting and Memory Management.	IPDPS	2005	DBLP DOI BibTeX RDF
62	Hui Gao, Jan Friso Groote, Wim H. Hesselink	Almost Wait-Free Resizable Hashtable.	IPDPS	2004	DBLP DOI BibTeX RDF
60	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	The weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2009	DBLP DOI BibTeX RDF	mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
60	Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus	Wait-free Programming for General Purpose Computations on Graphics Processors.	IPDPS	2008	DBLP DOI BibTeX RDF
60	Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas	Competitive Freshness Algorithms for Wait-Free Data Objects.	Euro-Par	2006	DBLP DOI BibTeX RDF
60	Prasad Jayanti	A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa.	DISC	1998	DBLP DOI BibTeX RDF
60	Jaap-Henk Hoepman, Marina Papatriantafilou, Philippas Tsigas	Self-Stabilization of Wait-Free Shared Memory Objects.	WDAG	1995	DBLP DOI BibTeX RDF
59	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations
57	Philippe Stellwag, Alexander Ditter, Wolfgang Schröder-Preikschat	A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions.	SIES	2009	DBLP DOI BibTeX RDF
57	Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit	Obstruction-Free Algorithms Can Be Practically Wait-Free.	DISC	2005	DBLP DOI BibTeX RDF
55	Wim H. Hesselink, Jan Friso Groote	Wait-free concurrent memory management by Create and Read until Deletion (CaRuD).	Distributed Comput.	2001	DBLP DOI BibTeX RDF	Shared memory, Consensus, Wait-free, Reference counting, Concurrent garbage collection, Terms
54	Yehuda Afek, Eli Gafni, Adam Morrison 0001	Common2 extended to stacks and unbounded concurrency.	Distributed Comput.	2007	DBLP DOI BibTeX RDF	Common2, Unbounded concurrency, Immediate snapshot, Stacks, Wait-free
54	Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport	On the weakest failure detector ever.	PODC	2007	DBLP DOI BibTeX RDF	wait-free impossibilities, weakest failure detector ever, failure detectors, set-agreement
54	Yehuda Afek, Eli Gafni, Adam Morrison 0001	Common2 extended to stacks and unbounded concurrency.	PODC	2006	DBLP DOI BibTeX RDF	common2, consensus number 2, immediate snapshot, unbounded concurrency, queue, stack, wait-free
54	Hagit Attiya, Arie Fouren, Eli Gafni	An adaptive collect algorithm with applications.	Distributed Comput.	2002	DBLP DOI BibTeX RDF	Contention-sensitive complexity, Read/write registers, Atomic snapshots, Immediate snapshots, Renaming, Wait-free algorithms, Asynchronous shared-memory systems
53	Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen	Synchronization for an optimal real-time scheduling algorithm on multiprocessors.	SIES	2007	DBLP DOI BibTeX RDF
53	Phong Chuong, Faith Ellen, Vijaya Ramachandran	A universal construction for wait-free transaction friendly data structures.	SPAA	2010	DBLP DOI BibTeX RDF	abortable data structure, transaction friendly, universal construction, wait-free, cache-efficiency
53	John Tromp, Paul M. B. Vitányi	Randomized two-process wait-free test-and-set.	Distributed Comput.	2002	DBLP DOI BibTeX RDF	Test-and-set objects, Asynchronous distributed protocols, Wait-free read/write registers, Fault-tolerance, Randomized algorithms, Shared memory, Atomicity, Symmetry breaking, Adaptive adversary
53	Håkan Sundell, Philippas Tsigas	Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information.	RTCSA	2000	DBLP DOI BibTeX RDF	space-efficient wait-free algorithm, real-time multiprocessor systems, deadline guarantees, nonblocking algorithms, unbounded time-stamps, time-stamp bounding, concurrent read/write operations, real-time systems, protocol, data structures, data structures, timing, multiprocessing systems, mutual exclusion, blocking, buffer storage, timing information, shared buffer, memory protocols
53	James H. Anderson, Rohit Jain, Srikanth Ramamurthy	Wait-free object-sharing schemes for real-time uniprocessors and multiprocessors.	RTSS	1997	DBLP DOI BibTeX RDF	wait-free object-sharing schemes, real-time uniprocessors, real-time multiprocessors, priority inheritance protocol, breakdown utilization experiments, lock-based schemes, multiprocessing systems, nonblocking, user level, priority ceiling protocol
49	Yantao Song, Scott M. Pike	Eventually k-Bounded Wait-Free Distributed Daemons.	DSN	2007	DBLP DOI BibTeX RDF	self-stabilization, wait-freedom, daemons
49	Philippas Tsigas, Yi Zhang 0004, Daniel Cederman, Tord Dellsen	Wait-Free Queue Algorithms for the Real-time Java Specification.	IEEE Real Time Technology and Applications Symposium	2006	DBLP DOI BibTeX RDF
49	Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen	A Space-Optimal Wait-Free Real-Time Synchronization Protocol.	ECRTS	2005	DBLP DOI BibTeX RDF
49	Prasad Jayanti, Srdjan Petrovic	Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks.	FSTTCS	2005	DBLP DOI BibTeX RDF
49	Pradeep Varma	Wait-Free Publish/Subscribe Using Atomic Registers.	PPAM	2003	DBLP DOI BibTeX RDF
49	Prasad Jayanti	Robust wait-free hierarchies.	J. ACM	1997	DBLP DOI BibTeX RDF	synchronization, robustness, implementation, shared memory, hierarchy, MIMD, shared objects, wait-freedom, asynchronous computing
49	Michiko Inoue, Sen Moriya, Toshimitsu Masuzawa, Hideo Fujiwara	Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System.	WDAG	1997	DBLP DOI BibTeX RDF	shared-memory multi-processor system, napping fault, fault-tolerance, clock-synchronization, wait-freedom
49	Hagit Attiya, Sergio Rajsbaum	The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract).	WDAG	1996	DBLP DOI BibTeX RDF
49	Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi	Randomized Wait-Free Naming.	ISAAC	1994	DBLP DOI BibTeX RDF
49	Soma Chaudhuri	Towards a complexity hierarchy of wait-free concurrent objects.	SPDP	1991	DBLP DOI BibTeX RDF
49	James H. Anderson, Srikanth Ramamurthy, Kevin Jeffay	Real-Time Computing with Lock-Free Shared Objects.	ACM Trans. Comput. Syst.	1997	DBLP DOI BibTeX RDF	scheduling, synchronization, earliest deadline first, hard real time, wait free, lock free, critical sections, rate monotonic, deadline monotonic
49	Mark Moir	Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions.	Distributed Comput.	2001	DBLP DOI BibTeX RDF	Synchronization, Wait-free, Lock-free, Nonblocking, Lazy
49	Maged M. Michael	Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS.	DISC	2004	DBLP DOI BibTeX RDF
44	Michel Raynal	Locks Considered Harmful: A Look at Non-traditional Synchronization.	SEUS	2008	DBLP DOI BibTeX RDF	Adaptive renaming, Lock-free synchronization, Fault-tolerance, Concurrency, Shared memory system, Asynchronous system, Failure detector, Process crash, Atomic register, Synchronization primitive, Wait-free computation
43	Maurice Herlihy, Victor Luchangco, Mark Moir	Obstruction-Free Synchronization: Double-Ended Queues as an Example.	ICDCS	2003	DBLP DOI BibTeX RDF
42	Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi	Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions.	PODC	2007	DBLP DOI BibTeX RDF	information theoretic, fault tolerance, replication, atomic, bounded, wait-free, byzantine
42	Rida A. Bazzi, Yin Ding	Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems.	PODC	2005	DBLP DOI BibTeX RDF	fault tolerance, replication, atomic, timestamps, wait-free, byzantine
42	Matei David	Brief announcement: a single enqueuer wait-free queue implementation.	PODC	2004	DBLP DOI BibTeX RDF	common2, implementation, queue, wait-free, linearizable
42	Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg	Fault-tolerant Wait-free Shared Objects	FOCS	1992	DBLP DOI BibTeX RDF	arbitrary, fault tolerant wait-free shared objects, nonresponsive object failures, object failures, R-crash, R-omission, R-arbitrary, responsive, crash, omission
42	Hagit Attiya, Nancy A. Lynch, Nir Shavit	Are Wait-Free Algorithms Fast? (Extended Abstract)	FOCS	1990	DBLP DOI BibTeX RDF	shared memory distributed systems, normal executions, approximate agreement, time complexity, computation models, wait-free algorithms, execution speed
41	Eli Gafni	The extended BG-simulation and the characterization of t-resiliency.	STOC	2009	DBLP DOI BibTeX RDF	solvability, t-resiliency, decidability, symmetry breaking, wait-freedom, renaming
41	Rachid Guerraoui, Michel Raynal	A Universal Construction for Concurrent Objects.	ARES	2007	DBLP DOI BibTeX RDF
41	Prasad Jayanti	f-arrays: implementation and applications.	PODC	2002	DBLP DOI BibTeX RDF
41	Faith E. Fich, Maurice Herlihy, Nir Shavit	On the Space Complexity of Randomized Synchronization.	J. ACM	1998	DBLP DOI BibTeX RDF	lower bounds, consensus, space complexity
39	Andrew Lutomirski, Victor Luchangco	Efficient Large Almost Wait-Free Single-Writer Multireader Atomic Registers.	OPODIS	2008	DBLP DOI BibTeX RDF
39	Prasad Jayanti, Tushar Deepak Chandra, Sam Toueg	Fault-Tolerant Wait-Free Shared Objects.	J. ACM	1998	DBLP DOI BibTeX RDF	fault-tolerance, synchronization, implementation, shared memory, MIMD, shared objects, asynchronous computing
39	James H. Anderson, Rohit Jain, David E. Ott	Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems.	DISC	1998	DBLP DOI BibTeX RDF
39	Prasad Jayanti	Wait-free Computing.	WDAG	1995	DBLP DOI BibTeX RDF
39	Ophir Rachman	Anomalies in the Wait-Free Hierarchy.	WDAG	1994	DBLP DOI BibTeX RDF
38	Maurice Herlihy	A Methodology for Implementing Highly Concurrent Objects.	ACM Trans. Program. Lang. Syst.	1993	DBLP DOI BibTeX RDF
38	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	PODC	2004	DBLP DOI BibTeX RDF	termination conditions, consensus, Byzantine failures, shared-memory emulations
38	Adnane Khattabi Riffi	On improving complexity of linearizable and wait-free implementations of concurrent objects by relaxing their specifications. (Amélioration de complexité d'implémentations linéarisables et wait-free d'objets concurrents en relaxant leurs spécifications).		2023	RDF
38	Pedro Ramalhete, Andreia Correia	POSTER: A Wait-Free Queue with Wait-Free Memory Reclamation.	PPoPP	2017	DBLP DOI BibTeX RDF
38	Prasad Jayanti	Fault-Tolerant Wait-Free Implementations and Robust Wait-Free Hierarchies.		1994	RDF
37	Hyungsoo Jung 0001, Heon Young Yeom	A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks.	Euro-Par	2006	DBLP DOI BibTeX RDF
36	James H. Anderson, Mark Moir	Universal Constructions for Large Objects.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	Concurrency, wait-free, lock-free, shared objects, nonblocking synchronization
36	Gadi Taubenfeld	Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms.	DISC	2007	DBLP DOI BibTeX RDF
34	Pierre Fraigniaud	Distributed computational complexities: are you volvo-addicted or nascar-obsessed?	PODC	2010	DBLP DOI BibTeX RDF	mobile computing, network computing, wait-free computing
34	Damien Imbs, Michel Raynal	Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation.	SSS	2009	DBLP DOI BibTeX RDF	t-Resilience, Wait-free environment, Fault-Tolerance, Distributed computability, Shared memory system, Reduction, Arbiter, Asynchronous processes, Process crash failure
34	Damien Imbs, Michel Raynal	Help When Needed, But No More: Efficient Read/Write Partial Snapshot.	DISC	2009	DBLP DOI BibTeX RDF	LL/SC atomic registers, Partial snapshot, Read/Write atomic register, Concurrency, Locality, Efficiency, Atomicity, Adaptive algorithm, Asynchrony, Process crash, Linearizability, Wait-free algorithm, Asynchronous shared memory system
34	Faith Ellen, Panagiota Fatourou, Eric Ruppert	The space complexity of unbounded timestamps.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Obstruction-free, Lower bounds, Anonymous, Shared memory, Timestamps, Wait-free
34	Dan Dobre, Matthias Majuntke, Neeraj Suri	On the Time-Complexity of Robust and Amnesic Storage.	OPODIS	2008	DBLP DOI BibTeX RDF	distributed storage, Byzantine failures, wait-free algorithms
34	Yehuda Afek, Eran Shalom	Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.	DISC	2006	DBLP DOI BibTeX RDF	Consensus hierarchy, Common2, Bounded-use, Bounded-size, Long-lived, Fetch&Add, Queues, Stacks, Set, Wait-free, Swap
34	Panagiota Fatourou, Nikolaos D. Kallimanis	Single-scanner multi-writer snapshot implementations are fast!	PODC	2006	DBLP DOI BibTeX RDF	atomic objects, multi-writer, single-scanner, shared memory systems, asynchronous, wait-free, snapshot
34	Hagit Attiya, Arie Fouren	Algorithms adapting to point contention.	J. ACM	2003	DBLP DOI BibTeX RDF	Contention-sensitive complexity, read/write registers, collect, renaming, wait-free algorithms, asynchronous shared-memory systems
34	James H. Anderson, Philip Holman	Efficient pure-buffer algorithms for real-time systems.	RTCSA	2000	DBLP DOI BibTeX RDF	efficient pure-buffer algorithms, multiprocessor real-time systems, multi-writer read/write pure-buffers, overwritten data, client processes, handshaking mechanisms, concurrent read/write operations safety, quantum-scheduled systems, priority-scheduled systems, buffer word length, real-time systems, computational complexity, distributed algorithms, safety, multiprocessing systems, time complexity, processor scheduling, optimized algorithms, buffer storage, space complexity, wait-free algorithms, shared buffers, processor number
34	Michiko Inoue, Wei Chen 0003	Linear-Time Snapshot Using Multi-writer Multi-reader Registers.	WDAG	1994	DBLP DOI BibTeX RDF	atomic snapshot, lattice agreement problem, shared memory system, linearizability, wait-free algorithm
33	Faith Ellen Fich, Danny Hendler, Nir Shavit	On the inherent weakness of conditional primitives.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	Space lower bounds, Object implementations, Mutual exclusion, Conditionals
33	Prasad Jayanti, Srdjan Petrovic	Efficiently Implementing a Large Number of LL/SC Objects.	OPODIS	2005	DBLP DOI BibTeX RDF
33	Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg	Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.	PODC	1994	DBLP DOI BibTeX RDF
32	Prasad Jayanti, Srdjan Petrovic	Efficient Wait-Free Implementation of Multiword LL/SC Variables.	ICDCS	2005	DBLP DOI BibTeX RDF
32	Marina Papatriantafilou, Philippas Tsigas	How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking.	MFCS	1994	DBLP DOI BibTeX RDF
31	Keren Censor-Hillel	Multi-sided shared coins and randomized set-agreement.	SPAA	2010	DBLP DOI BibTeX RDF	multi-valued shared coins, distributed computing, randomized algorithms, shared memory, set-agreement
31	Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport	On the weakest failure detector ever.	Distributed Comput.	2009	DBLP DOI BibTeX RDF
31	James Aspnes, Hagit Attiya, Keren Censor	Max registers, counters, and monotone circuits.	PODC	2009	DBLP DOI BibTeX RDF	max registers, distributed computing, shared memory, counters, monotone circuits
31	Eli Gafni, Petr Kuznetsov	N-Consensus is the Second Strongest Object for N+1 Processes.	OPODIS	2007	DBLP DOI BibTeX RDF
31	Rachid Guerraoui, Michel Raynal	Fault-Tolerant Techniques for Concurrent Objects.	LADC	2005	DBLP DOI BibTeX RDF
31	Burkhard Englert, Darin Goldstein	Can Memory Be Used Adaptively by Uniform Algorithms?	OPODIS	2005	DBLP DOI BibTeX RDF
31	Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni	On using network attached disks as shared memory.	PODC	2003	DBLP DOI BibTeX RDF
31	Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum	The BG distributed simulation algorithm.	Distributed Comput.	2001	DBLP DOI BibTeX RDF	Simulation, Fault-tolerance, Distributed computing, Consensus, Set-agreement