|
|
Venues (Conferences, Journals, ...)
|
|
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 |
31 | Soma Chaudhuri, Mark R. Tuttle |
Fast Increment Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings, pp. 74-88, 1994, Springer, 3-540-58449-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Maurice Herlihy |
A Methodology for Implementing Highly Concurrent Data Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: Proceedings of the Second ACM SIGPLAN Symposium on Princiles & Practice of Parallel Programming (PPOPP), Seattle, Washington, USA, March 14-16, 1990, pp. 197-206, 1990, ACM, 0-89791-350-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi |
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 7-19, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Thomas F. Wenisch, Anastassia Ailamaki, Babak Falsafi, Andreas Moshovos |
Mechanisms for store-wait-free multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 34th International Symposium on Computer Architecture (ISCA 2007), June 9-13, 2007, San Diego, California, USA, pp. 266-277, 2007, ACM, 978-1-59593-706-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
store buffer design, memory consistency models |
29 | Stephen Paynter, Neil Henderson, James M. Armstrong |
Metastability in Asynchronous Wait-Free Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 55(3), pp. 292-303, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
asynchronous operation, model checking, formal models, Protocol verification |
29 | Scott M. Pike, Yantao Song, Kaustav Ghoshal |
Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 8th International Symposium, SSS 2006, Dallas, TX, USA, November 17-19, 2006, Proceedings, pp. 578-579, 2006, Springer, 978-3-540-49018-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Achour Mostéfaoui, Michel Raynal, Corentin Travers |
Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 1-15, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Matei David |
A Single-Enqueuer Wait-Free Queue Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4-7, 2004, Proceedings, pp. 132-143, 2004, Springer, 3-540-23306-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Paul M. B. Vitányi |
Simple Wait-Free Multireader Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pp. 118-132, 2002, Springer, 3-540-00073-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Hagit Attiya, Zvi Avidor |
Wait-Free n-Set Consensus When Inputs Are Restricted. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pp. 326-338, 2002, Springer, 3-540-00073-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | James Aspnes, Gauri Shah, Jatin Shah |
Wait-free consensus with infinite arrivals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 524-533, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Maurice Herlihy, Sergio Rajsbaum |
A Wait-Free Classification of Loop Agreement Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998, Proceedings, pp. 175-185, 1998, Springer, 3-540-65066-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Eric Goubault |
Optimal Implementation of Wait-Free Binary Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings, pp. 225-236, 1997, Springer, 3-540-62781-2. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
29 | James H. Anderson, Mark Moir |
Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 39-53, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Amos Israeli, Lihu Rappoport |
Efficient Wait-Free Implementation of a Concurrent Priority Queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 1-17, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi |
Wait-free Test-and-Set (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, Proceedings, pp. 85-94, 1992, Springer, 3-540-56188-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
29 | James H. Anderson, Bojan Groselj |
Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings, pp. 52-70, 1991, Springer, 3-540-55236-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Ming Li 0001, Paul M. B. Vitányi |
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 488-505, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
25 | Maged M. Michael |
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, PODC 2002, Monterey, California, USA, July 21-24, 2002, pp. 21-30, 2002, ACM, 1-58113-485-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov |
The Weakest Failure Detectors to Boost Obstruction-Freedom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 399-412, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Mark Moir |
Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA., pp. 61-70, 2000, ACM, 1-58113-183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Gadi Taubenfeld |
Contention-Sensitive Data Structures and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 157-171, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Contention-sensitive, shortcut code, disable-free, prevention-free, k-obstruction-free, synchronization, locks, wait-free, starvation, livelock |
24 | Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers |
Brief announcement: weakest failure detectors via an egg-laying simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 290-291, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
distributed computing, lower bounds, shared memory, failure detectors, wait-free |
24 | 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 |
24 | Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas |
Multiword atomic read/write registers on multiprocessor systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
synchronization, wait-free, Atomic register |
24 | Michel Raynal |
Synchronization is Coming Back, But is it the Same? ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA ![In: 22nd International Conference on Advanced Information Networking and Applications, AINA 2008, GinoWan, Okinawa, Japan, March 25-28, 2008, pp. 1-10, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Adaptive renaming, Atomic snapshot, Test & set, t-Resilience, Shared memory, Reduction, Asynchronous system, Process crash, Atomic register, Set agreement, Wait-free algorithm |
24 | Hagit Attiya, Rachid Guerraoui, Eric Ruppert |
Partial snapshot objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008, pp. 336-343, 2008, ACM, 978-1-59593-973-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
active set, shared-memory, asynchronous, wait-free, snapshot |
24 | Faith Ellen, Panagiota Fatourou, Eric Ruppert |
Time lower bounds for implementations of multi-writer snapshots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(6), pp. 30, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Distributed computing, lower bound, shared memory, wait-free, snapshot, registers |
24 | Panagiota Fatourou, Nikolaos D. Kallimanis |
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 33-42, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
linearizable objects, single-scanner, wait-free implementations, distributed algorithms, asynchronous, snapshots, compare-and-swap (CAS) |
24 | Michel Raynal, Gadi Taubenfeld |
The notion of a timed register and its application to indulgent synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 200-209, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
test&set, timing assumption, universal object, wait-free implementation, consensus, mutual exclusion, timing constraint, contention manager, process crash, simplicity, atomic register, renaming, concurrent object, asynchronous shared memory system |
24 | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
Time-space tradeoffs for implementations of snapshots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 169-178, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
anonymous processes, distributed computing, lower bound, shared memory, wait-free, snapshot, time-space tradeoff |
24 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Lock-free dynamic hash tables with open addressing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(1), pp. 21-42, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Distributed algorithms, Wait-free, Lock-free, Hash tables |
24 | Prasad Jayanti |
An optimal multi-writer snapshot algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 723-732, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
fault-tolerant, asynchronous, wait-free, snapshot, lock-free, concurrent algorithm |
24 | Wim H. Hesselink |
An assertional proof for a construction of an atomic variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 16(4), pp. 387-393, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Invariant, Atomicity, Wait-free, Safeness |
24 | Stephen Paynter, Neil Henderson, James M. Armstrong |
Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 16(4), pp. 332-351, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Simpsons 4-slot ACM, Atomic, Wait-free, Metastability, Safe, Freshness |
24 | Norman Scaife, Paul Caspi |
Integrating Model-Based Design and Preemptive Scheduling in Mixed Time- and Event-Triggered Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 16th Euromicro Conference on Real-Time Systems (ECRTS 2004), 30 June - 2 July 1004, Catania, Italy, Proceedings, pp. 119-126, 2004, IEEE Computer Society, 0-7695-2176-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
wait-free communication, double buffers, model-based design, synchrony, preemptive scheduling, fixed priority |
24 | Philippe Raipin Parvédy, Michel Raynal |
Reliable Compare & Swap for Fault-Tolerant Synchronization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WORDS ![In: 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), 15-17 January 2003, Guadalajara, Mexico, pp. 50-55, 2003, IEEE Computer Society, 0-7695-1929-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Compare&Swap, Fault-Tolerance, Graceful Degradation, Crash Failure, Wait-free Synchronization, Omission Failure |
24 | Yehuda Afek, Gideon Stupp, Dan Touitou |
Long lived adaptive splitter and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 15(2), pp. 67-86, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Read/write shared memory, Long-lived, Mutual exclusion, Contention, Adaptive algorithms, Wait-free, Renaming |
24 | Michel Raynal |
An Introduction to the Renaming Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 9th Pacific Rim International Symposium on Dependable Computing (PRDC 2002), 16-18 December 2002, Tsukuba-City, Ibarski, Japan, pp. 121-124, 2002, IEEE Computer Society, 0-7695-1852-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Renaming problem, Fault-tolerance, Concurrency, Shared memory system, Process crash, Message passing system, Atomic register, Wait-free computation |
24 | Danny Hendler, Nir Shavit |
Work dealing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 164-172, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
load-balancing, distributed, wait-free |
24 | Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen |
An algorithm for the asynchronous Write-All problem based on process collision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 14(2), pp. 75-81, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Write-all problem, Distributed algorithms, Dynamic load balancing, PRAM, Wait-free, Work complexity |
24 | Hagit Attiya, Eyal Dagan |
Improved implementations of binary universal operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(5), pp. 1013-1037, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
contention-sensitive algorithms, deterministic coin tossing, load-linked/store-conditional operations, universal operations, wait-free algorithms, Asynchronous shared-memory systems |
24 | Frank A. Stomp, Gadi Taubenfeld |
Constructing a Reliable Test&Set Bit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 10(3), pp. 252-265, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Test&set bits, omission faults, gracefully degradation, reliability, wait-free algorithms |
24 | Yehuda Afek, Gideon Stupp, Dan Touitou |
ong-lived Adaptive Collect with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 262-272, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
long-lived, adaptive, distributed algorithms, mutual-exclusion, collect, wait-free, snapshot |
24 | Jing Chen, Alan Burns 0001 |
Loop-Free Asynchronous Data Sharing in Multiprocessor Real-Time Systems Based on Timing Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 13-16 December 1999, Hong Kong, China, pp. 236-246, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Data sharing mechanism, Asynchronous data sharing, Wait-free, Lock-free, Loop-free |
24 | Nir Shavit, Asaph Zemach |
Diffracting Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 14(4), pp. 385-428, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
index distribution, contention, wait free, lock free, counting networks |
24 | Ambuj K. Singh, James H. Anderson, Mohamed G. Gouda |
The Elusive Atomic Register. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(2), pp. 311-339, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
linearizability, atomic register, wait-free synchronization |
24 | Maurice Herlihy, Nir Shavit, Orli Waarts |
Low Contention Linearizable Counting ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 526-535, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
network gates, nonblocking construction, wait free construction, asynchronous concurrent processes, real-time order, linearizable counting networks, data structures |
23 | Gaurav Bhardwaj, Ayaz Ahmed, Sathya Peri |
Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: Proceedings of the 25th International Conference on Distributed Computing and Networking, ICDCN 2024, Chennai, India, January 4-7, 2024, pp. 258-259, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Pooja Aggarwal, Smruti R. Sarangi |
Lock-Free and Wait-Free Slot Scheduling Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 27(5), pp. 1387-1400, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are Lock-Free Concurrent Algorithms Practically Wait-Free? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 63(4), pp. 31:1-31:20, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Pooja Aggarwal, Giridhar Yasa, Smruti R. Sarangi |
RADIR: Lock-free and wait-free bandwidth allocation models for solid state drives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: 21st International Conference on High Performance Computing, HiPC 2014, Goa, India, December 17-20, 2014, pp. 1-10, 2014, IEEE Computer Society, 978-1-4799-5976-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Brief announcement: are lock-free concurrent algorithms practically wait-free? ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014, pp. 50-52, 2014, ACM, 978-1-4503-2944-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are lock-free concurrent algorithms practically wait-free? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pp. 714-723, 2014, ACM, 978-1-4503-2710-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Shahar Timnat, Erez Petrank |
A practical wait-free simulation for lock-free data structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPoPP ![In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '14, Orlando, FL, USA, February 15-19, 2014, pp. 357-368, 2014, ACM, 978-1-4503-2656-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are Lock-Free Concurrent Algorithms Practically Wait-Free? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.3200, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Pooja Aggarwal, Smruti R. Sarangi |
Lock-Free and Wait-Free Slot Scheduling Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 27th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2013, Cambridge, MA, USA, May 20-24, 2013, pp. 961-972, 2013, IEEE Computer Society, 978-1-4673-6066-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
|
23 | Prasad Jayanti, Srdjan Petrovic |
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWDC ![In: Distributed Computing - IWDC 2005, 7th International Workshop, Kharagpur, India, December 27-30, 2005, Proceedings, pp. 45-56, 2005, Springer, 3-540-30959-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Maged M. Michael |
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(6), pp. 491-504, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Sergio Rajsbaum, Michel Raynal, Corentin Travers |
The Iterated Restricted Immediate Snapshot Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 487-497, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Rachid Guerraoui, Michel Raynal |
From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PaCT ![In: Parallel Computing Technologies, 9th International Conference, PaCT 2007, Pereslavl-Zalessky, Russia, September 3-7, 2007, Proceedings, pp. 47-61, 2007, Springer, 978-3-540-73939-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Achour Mostéfaoui, Michel Raynal, Corentin Travers |
From Renaming to Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pp. 66-80, 2007, Springer, 978-3-540-72918-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Burkhard Englert |
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, pp. 64-80, 2006, Springer, 3-540-49990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
The Committee Decision Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 502-514, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Sergio Rajsbaum |
Musical Benches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings, pp. 63-77, 2005, Springer, 3-540-29163-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Alex Brodsky, Faith Ellen Fich |
Efficient synchronous snapshots. ![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. 70-79, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
multiprocessor algorithms, shared memory objects |
20 | Lisa Higham, Jalal Kawash |
Implementing Sequentially Consistent Programs on Processor Consistent Platforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 326-331, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Michael Merritt, Gadi Taubenfeld |
Resilient Consensus for Infinitely Many Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings, pp. 1-15, 2003, Springer, 3-540-20184-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Kleoni Ioannidou |
Transformations of Self-Stabilizing Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pp. 103-117, 2002, Springer, 3-540-00073-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | David Hovemeyer, William W. Pugh, Jaime Spacco |
Atomic Instructions in Java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2002 - Object-Oriented Programming, 16th European Conference, Malaga, Spain, June 10-14, 2002, Proceedings, pp. 133-154, 2002, Springer, 3-540-43759-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
The concurrency hierarchy, and algorithms for unbounded concurrency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 161-169, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Jerry James, Ambuj K. Singh |
Fault Tolerance Bounds for Memory Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings, pp. 200-214, 1997, Springer, 3-540-63575-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
20 | Jaap-Henk Hoepman, John Tromp |
Binary Snapshots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, Proceedings, pp. 18-25, 1993, Springer, 3-540-57271-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
waitfree implementations, shared memory, atomicity, snapshot, linearisability |
20 | Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi |
A Proof Technique for Register Automicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings, pp. 286-303, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch |
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.14120, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Radha Rani, Dharmendra Prasad Mahato |
A randomized algorithm for the wait-free consensus problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 79(4), pp. 3666-3690, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Dan Alistarh, Faith Ellen, Joel Rybicki |
Wait-free approximate agreement on graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 948, pp. 113733, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Armando Castañeda, Gilde Valeria Rodríguez |
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.02638, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Ilya Kokorin, Dan Alistarh, Vitaly Aksenov |
Wait-free Trees with Asymptotically-Efficient Range Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.05293, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee, Sathya Peri |
Wait-Free Updates and Range Search using Uruv. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.14744, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Sathya Peri, Pratik Shetty |
Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.02380, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hossein Naderibeni, Eric Ruppert |
A Wait-free Queue with Polylogarithmic Step Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.07229, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Radha Rani, Dharmendra Prasad Mahato |
Survey on wait-free consensus protocol in distributed systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Commun. Networks Distributed Syst. ![In: Int. J. Commun. Networks Distributed Syst. 29(2), pp. 166-208, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Sathya Peri, Pratik Shetty |
Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings, pp. 106-110, 2023, Springer, 978-3-031-44273-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri |
Wait-Free Updates and Range Search Using Uruv. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings, pp. 435-450, 2023, Springer, 978-3-031-44273-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Matthew J. Parkinson, Sylvan Clebsch, Ben Simner |
Wait-Free Weak Reference Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMM ![In: Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management, ISMM 2023, Orlando, FL, USA, 18 June 2023, pp. 85-96, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hossein Naderibeni, Eric Ruppert |
A Wait-free Queue with Polylogarithmic Step Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 124-134, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Armando Castañeda, Gilde Valeria Rodríguez |
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 90-101, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Shalom M. Asbell, Eric Ruppert |
A Wait-Free Deque With Polylogarithmic Step Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: 27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan, pp. 17:1-17:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-308-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Marco Bornstein, Tahseen Rabbani, Evan Wang, Amrit S. Bedi, Furong Huang |
SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
19 | Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza |
Extending the wait-free hierarchy to multi-threaded systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 35(4), pp. 375-398, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xiangzhen Ouyang, Yian Zhu |
wfspan: Wait-free Dynamic Memory Management. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 21(4), pp. 43:1-43:26, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars |
An Efficient Wait-free Resizable Hash Table. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.09624, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Takamitsu Shioi, Takashi Kambayashi, Suguru Arakawa, Ryoji Kurosawa, Satoshi Hikida, Haruo Yokota |
Serializable HTAP with Abort-/Wait-free Snapshot Read. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.07993, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
19 | Marco Bornstein, Tahseen Rabbani, Evan Wang, Amrit Singh Bedi, Furong Huang |
SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.14026, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Ruslan Nikolaev 0001, Binoy Ravindran |
wCQ: A Fast Wait-Free Queue with Bounded Memory Usage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.02179, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
19 | Dolev Adas, Roy Friedman |
A Fast Wait-Free Multi-Producers Single-Consumer Queue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4 - 7, 2022, pp. 77-86, 2022, ACM, 978-1-4503-9560-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Naama Ben-David, Guy E. Blelloch |
Fast and Fair Randomized Wait-Free Locks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 187-197, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 460 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ >>] |
|