|
|
Venues (Conferences, Journals, ...)
|
|
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 |
104 | Damien Imbs, Michel Raynal, Gadi Taubenfeld |
On asymmetric progress conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 55-64, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
fault-freedom, progress condition, liveness, process crash, wait-freedom, obstruction-freedom, asynchronous shared memory system, consensus number |
82 | Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi |
Byzantine disk paxos: optimal resilience with byzantine shared memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(5), pp. 387-408, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations |
62 | Gadi Taubenfeld |
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 450-464, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Hagit Brit, Shlomo Moran |
Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994, pp. 52-60, 1994, ACM, 0-89791-654-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
49 | Maurice Herlihy, Victor Luchangco, Mark Moir |
Obstruction-Free Synchronization: Double-Ended Queues as an Example. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 19-22 May 2003, Providence, RI, USA, pp. 522-529, 2003, IEEE Computer Society, 0-7695-1920-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Srikanth Sastry, Scott M. Pike, Jennifer L. Welch |
Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 365, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
contention managers, wait-freedom, obstruction-freedom |
45 | Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard |
Progress guarantee for parallel programs via bounded lock-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 144-154, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation |
44 | Damien Imbs, Michel Raynal |
The multiplicative power of consensus numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 26-35, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
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 |
44 | Gadi Taubenfeld |
On the Computational Power of Shared Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 13th International Conference, OPODIS 2009, Nîmes, France, December 15-18, 2009. Proceedings, pp. 270-284, 2009, Springer, 978-3-642-10876-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
power numbers, k-obstruction-freedom, wait-free hierarchy, power hierarchy, universality, Shared objects, wait-freedom, consensus numbers |
43 | Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov |
The weakest failure detectors to boost obstruction-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 20(6), pp. 415-433, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Obstruction-free, Shared memory, Contention manager, Failure detector, Wait-free, Non-blocking |
43 | Mark Moir |
Transparent Support for Wait-Free Transactions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings, pp. 305-319, 1997, Springer, 3-540-63575-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
39 | Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg |
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14-17, 1994, pp. 334-343, 1994, ACM, 0-89791-654-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
39 | Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit |
Obstruction-Free Algorithms Can Be Practically Wait-Free. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings, pp. 78-92, 2005, Springer, 3-540-29163-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Ambuj K. Singh |
An Axiomatization of Wait-Freedom and Low-Atomicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 154-163, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
36 | Philippe 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](Pics/bibsonomy.png) |
SIES ![In: IEEE Fourth International Symposium on Industrial Embedded Systems, SIES 2009, Ecole Polytechnique Federale de Lausanne, Switzerland, July 8-10, 2009, pp. 237-248, 2009, IEEE, 978-1-4244-4110-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Almost Wait-Free Resizable Hashtable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi |
Byzantine disk paxos: optimal resilience with byzantine shared memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 226-235, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
termination conditions, consensus, Byzantine failures, shared-memory emulations |
36 | Faith E. Fich, Maurice Herlihy, Nir Shavit |
On the Space Complexity of Randomized Synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(5), pp. 843-862, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
lower bounds, consensus, space complexity |
36 | Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin |
Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Parallel Distributed Comput. ![In: J. Parallel Distributed Comput. 163, pp. 181-197, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
36 | Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin |
Separating Lock-Freedom from Wait-Freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pp. 41-50, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
36 | Oksana Denysyuk, Philipp Woelfel |
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing - 29th International Symposium, DISC 2015, Tokyo, Japan, October 7-9, 2015, Proceedings, pp. 60-74, 2015, Springer, 978-3-662-48652-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
36 | Hagit Brit, Shlomo Moran |
Wait-Freedom vs. Bounded-Freedom in Public Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Univers. Comput. Sci. ![In: J. Univers. Comput. Sci. 2(1), pp. 2-19, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Brijesh Dongol |
Formalising Progress Properties of Non-blocking Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFEM ![In: Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, ICFEM 2006, Macao, China, November 1-3, 2006, Proceedings, pp. 284-303, 2006, Springer, 3-540-47460-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Eli Gafni, Petr Kuznetsov |
Brief announcement: on L-resilience, hitting sets, and colorless tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 81-82, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
distributed tasks, l-resilience, weak solvability, wait-freedom |
31 | Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh |
Verifying linearizability with hindsight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 85-94, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
hindsight, linearizability, wait-freedom, optimistic concurrency |
31 | Eli Gafni |
The extended BG-simulation and the characterization of t-resiliency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 85-92, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
solvability, t-resiliency, decidability, symmetry breaking, wait-freedom, renaming |
31 | Srikanth Sastry, Scott M. Pike, Jennifer L. Welch |
The weakest failure detector for wait-free dining under eventual weak exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, pp. 111-120, 2009, ACM, 978-1-60558-606-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers |
31 | Scott M. Pike, Yantao Song, Srikanth Sastry |
Wait-Free Dining Under Eventual Weak Exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008., pp. 135-146, 2008, Springer, 978-3-540-77443-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Failure Detectors, Wait-Freedom, Dining Philosophers |
31 | Yantao Song, Scott M. Pike |
Eventually k-Bounded Wait-Free Distributed Daemons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: The 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2007, 25-28 June 2007, Edinburgh, UK, Proceedings, pp. 645-655, 2007, IEEE Computer Society, 0-7695-2855-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
self-stabilization, wait-freedom, daemons |
31 | Faith E. Fich, Danny Hendler, Nir Shavit |
On the inherent weakness of conditional synchronization primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 80-87, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
load-linked, store-conditional, test-and-set, lower bounds, compare-and-swap, wait-freedom, synchronization primitives |
31 | Sibsankar Haldar, Paul M. B. Vitányi |
Bounded concurrent timestamp systems using vector clocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(1), pp. 101-126, 2002. The full citation details ...](Pics/full.jpeg) |
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 |
31 | Prasad Jayanti |
Robust wait-free hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(4), pp. 592-614, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
synchronization, robustness, implementation, shared memory, hierarchy, MIMD, shared objects, wait-freedom, asynchronous computing |
31 | Michiko Inoue, Sen Moriya, Toshimitsu Masuzawa, Hideo Fujiwara |
Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings, pp. 290-304, 1997, Springer, 3-540-63575-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
shared-memory multi-processor system, napping fault, fault-tolerance, clock-synchronization, wait-freedom |
31 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev |
Sharing Memory Robustly in Message-Passing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(1), pp. 124-142, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
processor and link failures, fault-tolerance, message passing, shared memory, emulation, atomic registers, wait-freedom |
31 | Sibsankar Haldar, K. Vidyasankar |
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(1), pp. 186-203, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
nonatomic operation execution, reader and writer, regular and atomic, shared variable-safe, wait-freedom |
25 | Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers |
Universal constructions that ensure disjoint-access parallelism and wait-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 29(4), pp. 251-277, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
Wait-freedom with advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 28(1), pp. 3-19, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Petr Kuznetsov, Srivatsan Ravi |
On Partial Wait-Freedom in Transactional Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, ICDCN 2015, Goa, India, January 4-7, 2015, pp. 10:1-10:9, 2015, ACM, 978-1-4503-2928-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Petr Kuznetsov, Srivatsan Ravi |
On Partial Wait-Freedom in Transactional Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.6876, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
25 | Michel Raynal, Julien Stainer, Gadi Taubenfeld |
Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014, pp. 206-208, 2014, ACM, 978-1-4503-2944-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers |
Universal constructions that ensure disjoint-access parallelism and wait-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012, pp. 115-124, 2012, ACM, 978-1-4503-1450-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
Wait-freedom with advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012, pp. 105-114, 2012, ACM, 978-1-4503-1450-3. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Damien Imbs, Michel Raynal |
A liveness condition for concurrent objects: x-wait-freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 23(17), pp. 2154-2166, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Eli Gafni, Petr Kuznetsov |
Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Distributed Computing and Networking - 12th International Conference, ICDCN 2011, Bangalore, India, January 2-5, 2011. Proceedings, pp. 191-202, 2011, Springer, 978-3-642-17678-4. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Damien Imbs, Michel Raynal |
The x-Wait-Freedom Progress Condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par (1) ![In: Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part I, pp. 584-595, 2010, Springer, 978-3-642-15276-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Marcos Kawazoe Aguilera, Sam Toueg |
Timeliness-based wait-freedom: a gracefully degrading progress condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, pp. 305-314, 2008, ACM, 978-1-59593-989-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Wai-Kau Lo |
More on t-Resilience vs. Wait-Freedom (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 20-23, 1995, pp. 110-119, 1995, ACM, 0-89791-710-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis |
Proving that non-blocking algorithms don't block. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 16-28, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
formal verification, concurrent programming, termination, liveness |
23 | Rachid Guerraoui, Thomas A. Henzinger, Barbara Jobstmann, Vasu Singh |
Model checking transactional memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, June 7-13, 2008, pp. 372-382, 2008, ACM, 978-1-59593-860-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
model checking, transactional memories |
21 | Wim H. Hesselink |
Progress Under Bounded Fairness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 12(4), pp. 197-207, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture |
13 | Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri |
Efficient Robust Storage Using Secret Tokens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 269-283, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Lisa Higham, Colette Johnen |
Relationships between communication models in networks using atomic registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger, Michael K. Reiter |
Efficient Byzantine-Tolerant Erasure-Coded Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June - 1 July 2004, Florence, Italy, Proceedings, pp. 135-144, 2004, IEEE Computer Society, 0-7695-2052-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Ravi Rajwar, James R. Goodman |
Transactional lock-free execution of lock-based programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASPLOS ![In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), San Jose, California, USA, October 5-9, 2002., pp. 5-17, 2002, ACM Press, 1-58113-574-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #54 of 54 (100 per page; Change: )
|
|