The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase set-agreement (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1993-2002 (16) 2003-2006 (17) 2007-2008 (16) 2009 (17) 2010-2011 (18) 2012-2015 (23) 2016-2018 (16) 2019-2023 (18)
Publication types (Num. hits)
article(42) incollection(2) inproceedings(97)
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
15Zohir Bouzid, Corentin Travers Parallel Consensus is Harder than Set Agreement in Message Passing. Search on Bibsonomy ICDCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
15Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Michel Raynal, Julien Stainer Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. Search on Bibsonomy NCA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
15Hagit Attiya, Ami Paz Counting-Based Impossibility Proofs for Renaming and Set Agreement. Search on Bibsonomy DISC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
15Armando 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 PODC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
15Armando 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 LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
15François Bonnet 0001, Michel Raynal On the road to the weakest failure detector for k-set agreement in message-passing systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Solving k-Set Agreement with Stable Skeleton Graphs Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
15Michel Raynal Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results. Search on Bibsonomy Bull. EATCS The full citation details ... 2011 DBLP  BibTeX  RDF
15Eli Gafni, Rachid Guerraoui, Bastian Pochon The Complexity of Early Deciding Set Agreement. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Hagit Attiya, Armando Castañeda A Non-topological Proof for the Impossibility of k-Set Agreement. Search on Bibsonomy SSS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Michel Raynal, Julien Stainer Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. Search on Bibsonomy SSS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Solving k-Set Agreement with Stable Skeleton Graphs. Search on Bibsonomy IPDPS Workshops The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Easy impossibility proofs for k-set agreement in message passing systems. Search on Bibsonomy PODC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems. Search on Bibsonomy OPODIS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
15Piotr Zielinski Anti-Omega: the weakest failure detector for set agreement. Search on Bibsonomy Distributed Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Michel Raynal, Corentin Travers Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
15Philippe Raipin Parvédy, Michel Raynal, Corentin Travers Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
15Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers Brief Announcement: New Bounds for Partially Synchronous Set Agreement. Search on Bibsonomy DISC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
15Zohir Bouzid, Corentin Travers (anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. Search on Bibsonomy OPODIS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
15Rachid Guerraoui, Maurice Herlihy, Bastian Pochon A topological treatment of early-deciding set-agreement. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
15Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers From adaptive renaming to set agreement. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
15Michel Raynal Set Agreement. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15Achour 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 SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15Piotr Zielinski Anti-Omega: the weakest failure detector for set agreement. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15François Bonnet 0001, Michel Raynal Looking for the optimal conditions for solving set agreement. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15Achour 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 DISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
15Rachid Guerraoui, Bastian Pochon The Complexity of Early Deciding Set Agreement: How can Topology help? Search on Bibsonomy GETCO@DISC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
15Maurice Herlihy, Lucia Draque Penso tight bounds for k-set agreement with limited-scope failure detectors. Search on Bibsonomy PODC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
15Rachid Guerraoui, Petr Kouznetsov, Bastian Pochon A Note on Set Agreement with Omission Failures. Search on Bibsonomy GETCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Michel Raynal A Condition for k-Set Agreement in Asynchronous Distributed Systems. Search on Bibsonomy IPDPS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
15Michael E. Saks, Fotios Zaharoglou Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
15Dimitris Michailidis Fast Set Agreement in the Presence of Timing Uncertainty. Search on Bibsonomy PODC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
15Michael E. Saks, Fotios Zaharoglou Wait-free k-set agreement is impossible: the topology of public knowledge. Search on Bibsonomy STOC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
12Eli Gafni, Petr Kuznetsov On Set Consensus Numbers. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
12Damien Imbs, Michel Raynal Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF t-Resilience, Wait-free environment, Fault-Tolerance, Distributed computability, Shared memory system, Reduction, Arbiter, Asynchronous processes, Process crash failure
6Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Vibhor Bhatt, Nicholas Christman, Prasad Jayanti Extracting quorum failure detectors. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fault tolerance, mutual exclusion, asynchronous system, failure detector
6Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems. Search on Bibsonomy OPODIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
6Marcos Kawazoe Aguilera, Wei Chen 0013, Sam Toueg Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication. Search on Bibsonomy WDAG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #101 - #141 of 141 (100 per page; Change: )
Pages: [<<][1][2]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license