|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 129 occurrences of 55 keywords
|
|
|
Results
Found 141 publication records. Showing 141 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Zohir Bouzid, Corentin Travers |
Parallel Consensus is Harder than Set Agreement in Message Passing. |
ICDCS |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers |
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Michel Raynal, Julien Stainer |
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. |
NCA |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Hagit Attiya, Ami Paz |
Counting-Based Impossibility Proofs for Renaming and Set Agreement. |
DISC |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Armando Castañeda, Sergio Rajsbaum, Michel Raynal |
Brief announcement: there are plenty of tasks weaker than perfect renaming and stronger than set agreement. |
PODC |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal |
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
15 | François Bonnet 0001, Michel Raynal |
On the road to the weakest failure detector for k-set agreement in message-passing systems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Solving k-Set Agreement with Stable Skeleton Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
15 | Michel Raynal |
Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. |
Bull. EATCS |
2011 |
DBLP BibTeX RDF |
|
15 | Eli Gafni, Rachid Guerraoui, Bastian Pochon |
The Complexity of Early Deciding Set Agreement. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Hagit Attiya, Armando Castañeda |
A Non-topological Proof for the Impossibility of k-Set Agreement. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Michel Raynal, Julien Stainer |
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. |
SSS |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Solving k-Set Agreement with Stable Skeleton Graphs. |
IPDPS Workshops |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Easy impossibility proofs for k-set agreement in message passing systems. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. |
OPODIS |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Piotr Zielinski |
Anti-Omega: the weakest failure detector for set agreement. |
Distributed Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Michel Raynal, Corentin Travers |
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers |
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers |
Brief Announcement: New Bounds for Partially Synchronous Set Agreement. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Zohir Bouzid, Corentin Travers |
(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. |
OPODIS |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Rachid Guerraoui, Maurice Herlihy, Bastian Pochon |
A topological treatment of early-deciding set-agreement. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers |
From adaptive renaming to set agreement. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Michel Raynal |
Set Agreement. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Piotr Zielinski |
Anti-Omega: the weakest failure detector for set agreement. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
15 | François Bonnet 0001, Michel Raynal |
Looking for the optimal conditions for solving set agreement. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
15 | 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. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Rachid Guerraoui, Bastian Pochon |
The Complexity of Early Deciding Set Agreement: How can Topology help? |
GETCO@DISC |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Maurice Herlihy, Lucia Draque Penso |
tight bounds for k-set agreement with limited-scope failure detectors. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Rachid Guerraoui, Petr Kouznetsov, Bastian Pochon |
A Note on Set Agreement with Omission Failures. |
GETCO |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Michel Raynal |
A Condition for k-Set Agreement in Asynchronous Distributed Systems. |
IPDPS |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Michael E. Saks, Fotios Zaharoglou |
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Dimitris Michailidis |
Fast Set Agreement in the Presence of Timing Uncertainty. |
PODC |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Michael E. Saks, Fotios Zaharoglou |
Wait-free k-set agreement is impossible: the topology of public knowledge. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
12 | Eli Gafni, Petr Kuznetsov |
On Set Consensus Numbers. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Damien Imbs, Michel Raynal |
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. |
SSS |
2009 |
DBLP DOI BibTeX RDF |
t-Resilience, Wait-free environment, Fault-Tolerance, Distributed computability, Shared memory system, Reduction, Arbiter, Asynchronous processes, Process crash failure |
6 | Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg |
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Vibhor Bhatt, Nicholas Christman, Prasad Jayanti |
Extracting quorum failure detectors. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
fault tolerance, mutual exclusion, asynchronous system, failure detector |
6 | Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg |
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems. |
OPODIS |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Marcos Kawazoe Aguilera, Wei Chen 0013, Sam Toueg |
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication. |
WDAG |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #141 of 141 (100 per page; Change: ) Pages: [ <<][ 1][ 2] |
|