Filter your results
- 11
- 4
- 3
- 18
- 10
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 15
- 3
- 14
- 9
- 9
- 5
- 4
- 4
- 4
- 4
- 2
- 1
- 1
- 1
- 1
- 18
- 18
- 18
- 14
- 14
- 14
- 13
- 12
- 9
- 9
- 9
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 18
- 10
- 8
- 3
- 1
- 3
- 2
- 6
- 1
- 2
|
|
sorted by
|
|
La puissance de désaccord d'un adversaire12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Maria Gradinariu Potop-Butucaru et Hervé Rivano, 2010, Belle Dune, France
Conference papers
inria-00474206v1
|
||
|
Linear space bootstrap communication schemesTheoretical Computer Science, 2015, 561, pp.122-133. ⟨10.1016/j.tcs.2014.10.013⟩
Journal articles
hal-01251557v1
|
||
|
Byzantine Agreement with Homonyms (Accord Byzantin avec des Homonymes)2012
Preprints, Working Papers, ...
hal-00689119v1
|
||
A Separation of n-consensus and (n + 1)-consensus Based on Process SchedulingStructural Information and Communication Complexity - 22nd International Colloquium, {SIROCCO} 2015, Jul 2015, Montserrat, France. pp.385-398, ⟨10.1007/978-3-319-25258-2_27⟩
Conference papers
hal-01251571v1
|
|||
|
A Characterization of t-Resilient Colorless Task Anonymous SolvabilitySIROCCO 2018 - 25th International Colloquium Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. ⟨10.1007/978-3-030-01325-7_18⟩
Conference papers
hal-01955837v1
|
||
Byzantine Agreement with Homonyms in Synchronous SystemsICDCN, Jan 2012, Hong Kong, France. pp.76-90
Conference papers
hal-01269925v1
|
|||
Homonyms with Forgeable Identifiers.19th International Colloquium Structural Information and Communication Complexity, {SIROCCO}, Jun 2012, Reykjavik, France
Conference papers
hal-01269961v1
|
|||
|
Linear Space Boostrap Communication Scheme2012
Preprints, Working Papers, ...
hal-00717235v2
|
||
On the Space Complexity of Set Agreement?ACM Symposium on Principles of Distributed Computing, PODC 2015, Jul 2015, Donostia, France
Conference papers
hal-01251563v1
|
|||
Leader Election in Rings with Homonyms.NETYS, May 2014, Marrackech, Morocco. pp.9-24, ⟨10.1007/978-3-319-09581-32⟩
Conference papers
hal-01100776v1
|
|||
|
The Assignment ProblemInternational Conference on Distributed Computing and Networking, {ICDCN}, 2018, Varanasi, India
Conference papers
hal-01955902v1
|
||
|
The Disagreement Power of an Adversary2009
Preprints, Working Papers, ...
hal-00376981v1
|
||
|
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing SystemsIEEE Transactions on Parallel and Distributed Systems, 2018, 29 (9), pp.2033-2045. ⟨10.1109/TPDS.2018.2809551⟩
Journal articles
hal-01955906v1
|
||
|
Partial synchrony based on set timelinessDistributed Computing, 2012, 25 (3), pp.249-260. ⟨10.1007/s00446-012-0158-8⟩
Journal articles
hal-01269895v1
|
||
Wait-freedom with advice Symposium on Principles of Distributed Computing, ACM, Jul 2012, Funchal, France
Conference papers
hal-01269956v1
|
|||
An Exercise in Concurrency: From Non-blocking Objects to Fair ObjectsInternational Conference on Network-Based Information Systems( NBiS 2014), Sep 2014, Salerne, Italy
Conference papers
hal-01100781v1
|
|||
|
t-résilient snapshot immédiatALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France
Conference papers
hal-01517320v1
|
||
|
Fault-Tolerant Consensus in Unknown and Anonymous Networks2009
Preprints, Working Papers, ...
hal-00369280v1
|