The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1990-2003 (15) 2004-2009 (21) 2010-2015 (15) 2016-2022 (3)
Publication types (Num. hits)
article(14) inproceedings(40)
Venues (Conferences, Journals, ...)
PODC(14) Distributed Comput.(5) J. ACM(5) DISC(3) ICDCN(3) DSN(2) IPDPS(2) PLDI(2) SPAA(2) WDAG(2) ASPLOS(1) Concurr. Comput. Pract. Exp.(1) CoRR(1) Euro-Par (1)(1) ICCI(1) ICDCS(1) More (+10 of total 24)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 97 occurrences of 60 keywords

Results
Found 54 publication records. Showing 54 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
104Damien Imbs, Michel Raynal, Gadi Taubenfeld On asymmetric progress conditions. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF fault-freedom, progress condition, liveness, process crash, wait-freedom, obstruction-freedom, asynchronous shared memory system, consensus number
82Ittai 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
62Gadi Taubenfeld Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
50Hagit Brit, Shlomo Moran Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). Search on Bibsonomy PODC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
49Maurice 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
49Srikanth Sastry, Scott M. Pike, Jennifer L. Welch Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF contention managers, wait-freedom, obstruction-freedom
45Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard Progress guarantee for parallel programs via bounded lock-freedom. Search on Bibsonomy PLDI The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation
44Damien Imbs, Michel Raynal The multiplicative power of consensus numbers. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF bg simulation, synchronization power, t-resilience, simulation, fault-tolerance, distributed computability, shared memory system, system model, wait-freedom, asynchronous processes, k-set agreement, consensus number, reduction algorithm, process crash failure
44Gadi Taubenfeld On the Computational Power of Shared Objects. Search on Bibsonomy OPODIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF power numbers, k-obstruction-freedom, wait-free hierarchy, power hierarchy, universality, Shared objects, wait-freedom, consensus numbers
43Rachid 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
43Mark Moir Transparent Support for Wait-Free Transactions. Search on Bibsonomy WDAG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
39Tushar 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
39Faith 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
38Ambuj K. Singh An Axiomatization of Wait-Freedom and Low-Atomicity. Search on Bibsonomy ICCI The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
36Philippe 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
36Hui 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
36Ittai 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
36Faith 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
36Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
36Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin Separating Lock-Freedom from Wait-Freedom. Search on Bibsonomy PODC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
36Oksana Denysyuk, Philipp Woelfel Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. Search on Bibsonomy DISC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
36Hagit Brit, Shlomo Moran Wait-Freedom vs. Bounded-Freedom in Public Data Structures. Search on Bibsonomy J. Univers. Comput. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
31Brijesh Dongol Formalising Progress Properties of Non-blocking Programs. Search on Bibsonomy ICFEM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
31Eli Gafni, Petr Kuznetsov Brief announcement: on L-resilience, hitting sets, and colorless tasks. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF distributed tasks, l-resilience, weak solvability, wait-freedom
31Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh Verifying linearizability with hindsight. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF hindsight, linearizability, wait-freedom, optimistic concurrency
31Eli 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
31Srikanth 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
31Scott 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
31Yantao 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
31Faith 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
31Sibsankar Haldar, Paul M. B. Vitányi Bounded concurrent timestamp systems using vector clocks. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Concurrent reading while writing, labeling and scan, nonatomic operation execution, operation execution, operation-read and write, regular and atomic, shared variable-safe, timestamp system, traceability, label, wait-freedom, vector clock
31Prasad 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
31Michiko 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
31Hagit Attiya, Amotz Bar-Noy, Danny Dolev Sharing Memory Robustly in Message-Passing Systems. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF processor and link failures, fault-tolerance, message passing, shared memory, emulation, atomic registers, wait-freedom
31Sibsankar Haldar, K. Vidyasankar Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF nonatomic operation execution, reader and writer, regular and atomic, shared variable-safe, wait-freedom
25Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers Universal constructions that ensure disjoint-access parallelism and wait-freedom. Search on Bibsonomy Distributed Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov Wait-freedom with advice. Search on Bibsonomy Distributed Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
25Petr Kuznetsov, Srivatsan Ravi On Partial Wait-Freedom in Transactional Memory. Search on Bibsonomy ICDCN The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
25Petr Kuznetsov, Srivatsan Ravi On Partial Wait-Freedom in Transactional Memory. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
25Michel Raynal, Julien Stainer, Gadi Taubenfeld Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. Search on Bibsonomy PODC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
25Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers Universal constructions that ensure disjoint-access parallelism and wait-freedom. Search on Bibsonomy PODC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
25Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov Wait-freedom with advice. Search on Bibsonomy PODC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
25Damien Imbs, Michel Raynal A liveness condition for concurrent objects: x-wait-freedom. Search on Bibsonomy Concurr. Comput. Pract. Exp. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Eli Gafni, Petr Kuznetsov Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. Search on Bibsonomy ICDCN The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
25Damien Imbs, Michel Raynal The x-Wait-Freedom Progress Condition. Search on Bibsonomy Euro-Par (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
25Marcos Kawazoe Aguilera, Sam Toueg Timeliness-based wait-freedom: a gracefully degrading progress condition. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Wai-Kau Lo More on t-Resilience vs. Wait-Freedom (Extended Abstract). Search on Bibsonomy PODC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
23Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis Proving that non-blocking algorithms don't block. Search on Bibsonomy POPL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF formal verification, concurrent programming, termination, liveness
23Rachid Guerraoui, Thomas A. Henzinger, Barbara Jobstmann, Vasu Singh Model checking transactional memories. Search on Bibsonomy PLDI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF model checking, transactional memories
21Wim H. Hesselink Progress Under Bounded Fairness. Search on Bibsonomy Distributed Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture
13Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri Efficient Robust Storage Using Secret Tokens. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
13Lisa Higham, Colette Johnen Relationships between communication models in networks using atomic registers. Search on Bibsonomy IPDPS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
13Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger, Michael K. Reiter Efficient Byzantine-Tolerant Erasure-Coded Storage. Search on Bibsonomy DSN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
13Ravi Rajwar, James R. Goodman Transactional lock-free execution of lock-based programs. Search on Bibsonomy ASPLOS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #54 of 54 (100 per page; Change: )
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