|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, pp. 611-620, 2013, IEEE Computer Society, 978-0-7695-5000-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(1-2), pp. 595-629, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCA ![In: 11th IEEE International Symposium on Network Computing and Applications, NCA 2012, Cambridge, MA, USA, August 23-25, 2012, pp. 44-51, 2012, IEEE Computer Society, 978-1-4673-2214-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Hagit Attiya, Ami Paz |
Counting-Based Impossibility Proofs for Renaming and Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, pp. 356-370, 2012, Springer, 978-3-642-33650-8. The full citation details ...](Pics/full.jpeg) |
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. ![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. 97-98, 2012, ACM, 978-1-4503-1450-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, pp. 145-156, 2012, Springer, 978-3-642-29343-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(33), pp. 4273-4284, 2011. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.3671, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Solving k-Set Agreement with Stable Skeleton Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.4423, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Michel Raynal |
Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 103, pp. 74-95, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Eli Gafni, Rachid Guerraoui, Bastian Pochon |
The Complexity of Early Deciding Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 40(1), pp. 63-78, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Hagit Attiya, Armando Castañeda |
A Non-topological Proof for the Impossibility of k-Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Grenoble, France, October 10-12, 2011. Proceedings, pp. 108-119, 2011, Springer, 978-3-642-24549-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Grenoble, France, October 10-12, 2011. Proceedings, pp. 341-355, 2011, Springer, 978-3-642-24549-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 |
Solving k-Set Agreement with Stable Skeleton Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings, pp. 1488-1495, 2011, IEEE, 978-1-61284-425-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011, pp. 227-228, 2011, ACM, 978-1-4503-0719-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, pp. 299-312, 2011, Springer, 978-3-642-25872-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Piotr Zielinski |
Anti-Omega: the weakest failure detector for set agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 22(5-6), pp. 335-348, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(1), pp. 58-69, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 47(1), pp. 259-287, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers |
Brief Announcement: New Bounds for Partially Synchronous Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, pp. 404-405, 2010, Springer, 978-3-642-15762-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Zohir Bouzid, Corentin Travers |
(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems - 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings, pp. 189-204, 2010, Springer, 978-3-642-17652-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Rachid Guerraoui, Maurice Herlihy, Bastian Pochon |
A topological treatment of early-deciding set-agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(6-7), pp. 570-580, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers |
From adaptive renaming to set agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(14), pp. 1328-1335, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Michel Raynal |
Set Agreement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(4), pp. 1574-1601, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Piotr Zielinski |
Anti-Omega: the weakest failure detector for set agreement. ![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. 55-64, 2008, ACM, 978-1-59593-989-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | François Bonnet 0001, Michel Raynal |
Looking for the optimal conditions for solving set agreement. ![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. 446, 2008, ACM, 978-1-59593-989-0. The full citation details ...](Pics/full.jpeg) |
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. ![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 |
|
15 | Rachid Guerraoui, Bastian Pochon |
The Complexity of Early Deciding Set Agreement: How can Topology help? ![Search on Bibsonomy](Pics/bibsonomy.png) |
GETCO@DISC ![In: Proceedings of the Workshops on Geometric and Topological Methods in Concurrency Theory, GETCO@DISC 2004, Amsterdam, The Netherlands, 2004 + GETCO@CONCUR October 2005, San Francisco, CA, USA, August 2005 + GETCO 2006, Bonn, Germany, 2006, pp. 71-78, 2004, Elsevier. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Maurice Herlihy, Lucia Draque Penso |
tight bounds for k-set agreement with limited-scope failure detectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13-16, 2003, pp. 221, 2003, ACM, 1-58113-708-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Rachid Guerraoui, Petr Kouznetsov, Bastian Pochon |
A Note on Set Agreement with Omission Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GETCO ![In: 4th Workshop on GEometry and Topology in COncurrency and distributed systems theory, GETCO 2002, Satellite workshop of DISC 2002, Toulouse, France, October 2002, pp. 48-58, 2002, Elsevier. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Achour Mostéfaoui, Michel Raynal |
A Condition for k-Set Agreement in Asynchronous Distributed Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), San Francisco, CA, USA, April 23-27, 2001, pp. 78, 2001, IEEE Computer Society, 0-7695-0990-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Michael E. Saks, Fotios Zaharoglou |
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 29(5), pp. 1449-1483, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Dimitris Michailidis |
Fast Set Agreement in the Presence of Timing Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, PODC, '99Atlanta, Georgia, USA, May 3-6, 1999, pp. 249-256, 1999, ACM, 1-58113-099-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Michael E. Saks, Fotios Zaharoglou |
Wait-free k-set agreement is impossible: the topology of public knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 101-110, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
12 | Eli Gafni, Petr Kuznetsov |
On Set Consensus Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 35-47, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Damien Imbs, Michel Raynal |
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. ![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. 369-383, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 358-359, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Vibhor Bhatt, Nicholas Christman, Prasad Jayanti |
Extracting quorum failure detectors. ![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. 73-82, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
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. ![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. 115-128, 2009, Springer, 978-3-642-10876-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Marcos Kawazoe Aguilera, Wei Chen 0013, Sam Toueg |
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings, pp. 126-140, 1997, Springer, 3-540-63575-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #141 of 141 (100 per page; Change: ) Pages: [ <<][ 1][ 2] |
|