Search results for "set-agreement"

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