|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11 occurrences of 5 keywords
|
|
|
|
|
Results
Found 5 publication records. Showing 5 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov |
The complexity of obstruction-free implementations.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
perturbable objects, solo-fast implementations, step contention, lower bounds, Shared memory, memory contention |
| 2 | Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov |
Computing with Reads and Writes in the Absence of Step Contention. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri |
Abortable Fork-Linearizable Storage. |
OPODIS |
2009 |
DBLP DOI BibTeX RDF |
Fork-linearizability, abortable objects, lock-freedom, shared memory, online collaboration |
| 1 | Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg |
Abortable and query-abortable objects and their efficient implementation. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
abortable types, non-triviality, universal constructions, shared memory, memory contention, obstruction-freedom |
| 1 | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov |
Synchronizing without locks is inherently expensive. |
PODC |
2006 |
DBLP DOI BibTeX RDF |
lock-free implementations, perturbable objects, step contention, lower bound, memory contention, obstruction-freedom |
Displaying result #1 - #5 of 5 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")