The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Wait-Free (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1987-1991 (22) 1992-1993 (18) 1994 (17) 1995-1996 (18) 1997 (19) 1998-1999 (21) 2000-2001 (20) 2002 (24) 2003-2004 (29) 2005 (19) 2006 (26) 2007 (24) 2008 (22) 2009 (23) 2010-2011 (17) 2012-2013 (18) 2014-2015 (23) 2016-2017 (25) 2018-2019 (26) 2020-2021 (20) 2022-2023 (27) 2024 (2)
Publication types (Num. hits)
article(134) incollection(6) inproceedings(311) phdthesis(9)
Venues (Conferences, Journals, ...)
PODC(53) DISC(40) CoRR(31) WDAG(29) Distributed Comput.(25) OPODIS(22) J. ACM(14) SPAA(14) IEEE Trans. Parallel Distribut...(12) PPoPP(12) STOC(11) IPDPS(8) SSS(7) Encyclopedia of Algorithms(6) FOCS(6) SIAM J. Comput.(6) More (+10 of total 118)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 519 occurrences of 209 keywords

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