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
85Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers On the computability power and the robustness of set agreement-oriented failure detector classes. Search on Bibsonomy Distributed Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Fault-tolerance, Distributed algorithm, Asynchronous system, Unreliable failure detector, Set-agreement
79Wei Chen 0013, Jialin Zhang 0001, Yu Chen, Xuezheng Liu Weakening Failure Detectors for k -Set Agreement Via the Partition Approach. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF partitioned failure detectors, Failure detector, k-set agreement
69Eli Gafni, Rachid Guerraoui, Bastian Pochon From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF early decision, simulation, reduction, set agreement
67Keren Censor-Hillel Multi-sided shared coins and randomized set-agreement. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF multi-valued shared coins, distributed computing, randomized algorithms, shared memory, set-agreement
62Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal The combined power of conditions and failure detectors to solve asynchronous set agreement. Search on Bibsonomy PODC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF shared memory, consensus, asynchronous system, failure detection, condition, snapshot, process crash, set agreement
61Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers Irreducibility and additivity of set agreement-oriented failure detector classes. Search on Bibsonomy PODC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF fault-tolerance, asynchronous system, unreliable failure detector
57Xingwu Liu, Juhua Pu, Jianzhong Pan A Classification of Degenerate Loop Agreement. Search on Bibsonomy IFIP TCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF loop agreement, classification, distributed computing, computability
57Achour Mostéfaoui, Michel Raynal Randomized k-set agreement. Search on Bibsonomy SPAA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF fault-tolerance, consensus, asynchronous system, randomized protocol, k-set Agreement
56Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
56Michel Raynal, Corentin Travers In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. Search on Bibsonomy OPODIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Leader oracle, Participating process, Consensus, Asynchronous system, Shared object, Atomic register, Set agreement, Asynchronous algorithm, Wait-free algorithm
51Achour Mostéfaoui, Michel Raynal, Corentin Travers Narrowing Power vs. Efficiency in Synchronous Set Agreement. Search on Bibsonomy ICDCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
50Rachid Guerraoui, Maurice Herlihy, Bastian Pochon A Topological Treatment of Early-Deciding Set-Agreement. Search on Bibsonomy OPODIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF early global decision, lower bound, topology, time complexity, Set-agreement
50Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. Search on Bibsonomy OPODIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
50Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy Condition-Based Protocols for Set Agreement Problems. Search on Bibsonomy DISC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
47Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum The BG distributed simulation algorithm. Search on Bibsonomy Distributed Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Simulation, Fault-tolerance, Distributed computing, Consensus, Set-agreement
45François Bonnet 0001, Michel Raynal Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road? Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
44Achour Mostéfaoui, Michel Raynal, Corentin Travers From Renaming to Set Agreement. Search on Bibsonomy SIROCCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
44Eli Gafni, Petr Kuznetsov The weakest failure detector for solving k-set agreement. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF BG-simulation, synchrony assumptions, weakest failure detector, failure detectors, k-set agreement
44Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport On the weakest failure detector ever. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF wait-free impossibilities, weakest failure detector ever, failure detectors, set-agreement
44Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
44Achour Mostéfaoui, Michel Raynal k-set agreement with limited accuracy failure detectors. Search on Bibsonomy PODC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
43Philippe Raipin Parvédy, Michel Raynal, Corentin Travers Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Search on Bibsonomy SIROCCO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle Tight bounds for k-set agreement. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Spwener's Lemma, crash failure model, topology, synchronous systems, message-passing systems, k-set agreement
39Marcos Kawazoe Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg Partial synchrony based on set timeliness. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bivalency, algorithms, consensus, failure detectors, timeliness, partial synchrony, set agreement, impossibility
39Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The Weakest Failure Detector for Message Passing Set-Agreement. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF failure detectors, set-agreement
38François Bonnet 0001, Michel Raynal Conditions for Set Agreement with an Application to Synchronous Systems. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF lower bound, efficiency, condition, synchronous system, agreement problem
38Michel Raynal, Corentin Travers Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems). Search on Bibsonomy PRDC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Emmanuelle Anceaume, Michel Hurfin, Philippe Raipin Parvédy An Efficient Solution to the k-Set Agreement Problem. Search on Bibsonomy EDCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Wei Chen 0013, Jialin Zhang 0001, Yu Chen, Xuezheng Liu Partition approach to failure detectors for k-set agreement. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF partition approach, failure detector, k-set agreement
33Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle A Tight Lower Bound for k-Set Agreement Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF tight lower bound, message-passing model, proof techniques, fault tolerance, communication, consensus, tradeoff, k-set agreement
32Wei Chen 0013, Jialin Zhang 0001, Yu Chen, Xuezheng Liu Failure Detectors and Extended Paxos for k-Set Agreement. Search on Bibsonomy PRDC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Maurice Herlihy, Lucia Draque Penso Tight bounds for k-set agreement with limited-scope failure detectors. Search on Bibsonomy Distributed Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Philippe Raipin Parvédy, Michel Raynal, Corentin Travers Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. Search on Bibsonomy PaCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Philippe Raipin Parvédy, Michel Raynal, Corentin Travers Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. Search on Bibsonomy PRDC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Maurice Herlihy, Sergio Rajsbaum A Wait-Free Classification of Loop Agreement Tasks. Search on Bibsonomy DISC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
31Maurice Herlihy, Sergio Rajsbaum The topology of shared-memory adversaries. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF fault-tolerance, shared-memory, set agreement, combinatorial topology
30Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers Brief announcement: weakest failure detectors via an egg-laying simulation. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF distributed computing, lower bounds, shared memory, failure detectors, wait-free
28Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal Distributed Agreement and Its Relation with Error-Correcting Codes. Search on Bibsonomy DISC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Erroneous Value, Fault-Tolerance, Distributed Computing, Error-Correcting Code, Consensus, Hamming Distance, Asynchronous Distributed System, Condition, Crash Failure, Code Theory, Interactive Consistency
28Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle A New Synchronous Lower Bound for Set Agreement. Search on Bibsonomy DISC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, Calvin C. Newport On the weakest failure detector ever. Search on Bibsonomy Distributed Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26François Bonnet 0001, Michel Raynal Conditions for Set Agreement with an Application to Synchronous Systems. Search on Bibsonomy ICDCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Eli Gafni, Sergio Rajsbaum, Maurice Herlihy Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. Search on Bibsonomy DISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
24Michel Raynal, Julien Stainer Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems. Search on Bibsonomy SIROCCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
20Maurice Herlihy, Lucia Draque Penso Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors. Search on Bibsonomy DISC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
19Eli Gafni, Michel Raynal, Corentin Travers Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. Search on Bibsonomy SRDS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
19Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers The Committee Decision Problem. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Damien Imbs, Michel Raynal The multiplicative power of consensus numbers. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF bg simulation, synchronization power, t-resilience, simulation, fault-tolerance, distributed computability, shared memory system, system model, wait-freedom, asynchronous processes, k-set agreement, consensus number, reduction algorithm, process crash failure
18Michel Raynal Synchronization is Coming Back, But is it the Same? Search on Bibsonomy AINA The full citation details ... 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
17Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann The disagreement power of an adversary: extended abstract. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF fault-tolerance, failure-detectors, adversaries
16Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing? Search on Bibsonomy Future Directions in Distributed Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal, Mouna Safir Optimal algorithms for synchronous Byzantine k-set agreement. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yannis Coutouly, Emmanuel Godard A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Delporte-Gallet Carole, Fauconnier Hugues, Safir Mouna Some New Results With k-set agreement. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Yannis Coutouly, Emmanuel Godard A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. Search on Bibsonomy DISC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Sean Ovens Brief Announcement: The Space Complexity of Set Agreement Using Swap. Search on Bibsonomy DISC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
15Susumu Nishimura Proving Unsolvability of Set Agreement Task with Epistemic mu-Calculus. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal Distributed computability: Relating k-immediate snapshot and x-set agreement. Search on Bibsonomy Inf. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal, Mouna Safir Optimal Algorithms for Synchronous Byzantine k-Set Agreement. Search on Bibsonomy SSS The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
15David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg Life beyond set agreement. Search on Bibsonomy Distributed Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Adam Shimi, Armando Castañeda K set-agreement bounds in round-based models through combinatorial topology. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
15Koki Yagi, Susumu Nishimura Logical Obstruction to Set Agreement Tasks for Superset-Closed Adversaries. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
15Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal k-Immediate Snapshot and x-Set Agreement: How Are They Related? Search on Bibsonomy SSS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Michel Raynal, Gadi Taubenfeld Fully Anonymous Consensus and Set Agreement Algorithms. Search on Bibsonomy NETYS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Mouna Safir Byzantine k-Set Agreement. Search on Bibsonomy NETYS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Adam Shimi, Armando Castañeda K-set agreement bounds in round-based models through combinatorial topology. Search on Bibsonomy PODC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
15Hugo Rincon Galeana, Kyrill Winkler, Ulrich Schmid 0001, Sergio Rajsbaum A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus. Search on Bibsonomy SSS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
15Felipe de Azevedo Piovezan, Vassos Hadzilacos, Sam Toueg On Deterministic Linearizable Set Agreement Objects. Search on Bibsonomy OPODIS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
15Gadi Taubenfeld Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. Search on Bibsonomy SIROCCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
15Zohir Bouzid, Michel Raynal, Pierre Sutra Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read/write registers. Search on Bibsonomy Distributed Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Hamouma Moumen, Michel Raynal Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001, Manfred Schwarz, Kyrill Winkler Gracefully degrading consensus and k-set agreement in directed dynamic networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
15Anaïs Durand, Michel Raynal, Gadi Taubenfeld Set Agreement and Renaming in the Presence of Contention-Related Crash Failures. Search on Bibsonomy SSS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
15David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg On the Classification of Deterministic Objects via Set Agreement Power. Search on Bibsonomy PODC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
15Denis Jeanneau, Thibault Rieutord, Luciana Arantes, Pierre Sens 0001 Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
15Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal Which Broadcast Abstraction Captures $k$-Set Agreement? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
15Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal Which Broadcast Abstraction Captures k-Set Agreement?. Search on Bibsonomy DISC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
15Hammurabi Mendes, Maurice Herlihy Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. Search on Bibsonomy DISC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
15David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects. Search on Bibsonomy DISC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
15David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg Life Beyond Set Agreement. Search on Bibsonomy PODC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
15Michel Raynal Set Agreement. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
15Zohir Bouzid, Damien Imbs, Michel Raynal A necessary condition for Byzantine k-set agreement. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
15Hagit Attiya, Ami Paz Counting-based impossibility proofs for set agreement and renaming. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
15Achour Mostéfaoui, Hamouma Moumen, Michel Raynal Modular randomized byzantine k-set agreement in asynchronous message-passing systems. Search on Bibsonomy ICDCN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
15Emmanuel Godard, Eloi Perdereau k-Set Agreement in Communication Networks with Omission Faults. Search on Bibsonomy OPODIS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
15Zohir Bouzid, Damien Imbs, Michel Raynal A Necessary Condition for Byzantine $k$-Set Agreement. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
15Zohir Bouzid, Michel Raynal, Pierre Sutra Anonymous Obstruction-free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
15Hammurabi Mendes, Maurice Herlihy Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert On the Space Complexity of Set Agreement. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001, Manfred Schwarz, Kyrill Winkler Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
15Sergio Arévalo, Ernesto Jiménez, Jian Tang 0010, Rommel Torres Set agreement and the loneliness failure detector in crash-recovery systems. Search on Bibsonomy Comput. Syst. Sci. Eng. The full citation details ... 2015 DBLP  BibTeX  RDF
15Denis Jeanneau, Thibault Rieutord, Luciana Arantes, Pierre Sens 0001 A Failure Detector for k-Set Agreement in Dynamic Systems. Search on Bibsonomy NCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001, Manfred Schwarz, Kyrill Winkler Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. Search on Bibsonomy NETYS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert On the Space Complexity of Set Agreement. Search on Bibsonomy PODC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
15Zohir Bouzid, Michel Raynal, Pierre Sutra Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. Search on Bibsonomy OPODIS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
15Martin Biely, Peter Robinson 0002, Ulrich Schmid 0001 The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
15Manfred Schwarz, Kyrill Winkler, Ulrich Schmid 0001, Martin Biely, Peter Robinson 0002 Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. Search on Bibsonomy PODC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
15Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers The Opinion Number of Set-Agreement. Search on Bibsonomy OPODIS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
15Hagit Attiya, Armando Castañeda A non-topological proof for the impossibility of k-set agreement. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
15Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Sergio Rajsbaum Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|. Search on Bibsonomy NETYS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
15Sergio Arévalo, Ernesto Jiménez, Jian Tang 0010 Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems. Search on Bibsonomy NETYS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 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