Filtrer vos résultats
- 28
- 20
- 22
- 18
- 5
- 2
- 1
- 18
- 38
- 2
- 3
- 1
- 5
- 2
- 1
- 3
- 10
- 9
- 8
- 4
- 47
- 1
- 47
- 47
- 8
- 6
- 5
- 4
- 4
- 3
- 1
- 1
- 1
- 1
- 48
- 37
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
48 résultats
|
|
|
triés par
|
On Asymmetric Progress Conditions29th ACM Symposium on Principles of Distributed Computing (PODC'10), Jul 2010, Zurich, Switzerland. pp.55-64
Communication dans un congrès
inria-00543131v1
|
|||
|
|
Visiting Gafni's Reduction Land: from the BG Simulation to the Extended BG Simulation[Research Report] PI 1931, 2009, pp.12
Rapport
inria-00389682v1
|
||
|
|
On Asymmetric Progress Conditions[Research Report] PI-1952, 2010, pp.15
Rapport
inria-00486977v1
|
||
|
|
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual ExclusionPODC 2019 - ACM Symposium on Principles of Distributed Computing, Jul 2019, Toronto, Canada. pp.157-166, ⟨10.1145/3293611.3331594⟩
Communication dans un congrès
hal-02394246v1
|
||
|
|
A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition[Research Report] PI 1923, 2009, pp.23
Rapport
inria-00362844v1
|
||
|
|
On the Consistency Conditions of Transactional Memories[Research Report] PI 1917, 2008, pp.23
Rapport
inria-00350131v1
|
||
|
|
Help when needed, but no more: Efficient Read/Write Partial Snapshot[Research Report] PI 1907, 2008, pp.26
Rapport
inria-00339292v1
|
||
The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid CommunicationProc. 13th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'11), 2011, Grenoble, France. pp.268-282
Communication dans un congrès
hal-00646899v1
|
|||
|
|
Anonymous Read/Write Memory: Leader Election and De-anonymizationSIROCCO'19 - 26th International Colloquium on Structural Information and Communication Complexity, Jul 2019, L'Aquila, Italy. pp.246-261, ⟨10.1007/978-3-030-24922-9_17⟩
Communication dans un congrès
hal-02445121v1
|
||
|
|
Mutex-Based De-anonymization of an Anonymous Read/Write MemoryNETYS 2019 - 7th International Conference on Networked Systems, Jun 2019, Marrakech, Morocco. pp.311-326, ⟨10.1007/978-3-030-31277-0_21⟩
Communication dans un congrès
hal-02445119v1
|
||
|
|
Leader-based de-anonymization of an anonymous read/write memoryTheoretical Computer Science, 2020, 836, pp.110-123. ⟨10.1016/j.tcs.2020.07.027⟩
Article dans une revue
hal-03162641v1
|
||
A liveness condition for concurrent objects: x-wait-freedomConcurrency and Computation: Practice and Experience, 2011, 23 (17), pp.2154-2166
Article dans une revue
hal-00646908v1
|
|||
The Multiplicative Power of Consensus Numbers.29th ACM Symposium on Principles of Distributed Computing (PODC'10), Jul 2010, Zurich, Switzerland. pp.26-35
Communication dans un congrès
inria-00543130v1
|
|||
A versatile STM protocol with invisible read operations that satisfies the virtual world consistency condition16th Colloquium on Structural Information and Communication Complexity (SIROCCO'09), May 2009, Piran, Slovenia
Communication dans un congrès
inria-00440375v1
|
|||
|
|
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version)[Research Report] IRISA, Inria Rennes; LS2N-University of Nantes; Technion - Israel Institute of Technology. 2017
Rapport
hal-01476201v1
|
||
|
|
Which Broadcast Abstraction Captures $k$-Set Agreement?2017
Pré-publication, Document de travail
hal-01660664v1
|
||
|
|
The x-Wait-freedom Progress Condition[Research Report] PI 1944, 2010, pp.11
Rapport
inria-00454386v1
|
||
|
|
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), Nov 2009, lyon, France. ⟨10.1007/978-3-642-05118-0_26⟩
Communication dans un congrès
inria-00440398v1
|
||
|
|
Which Broadcast Abstraction Captures k-Set Agreement?31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. pp.1-16, ⟨10.4230/LIPIcs.DISC.2017.27⟩
Communication dans un congrès
hal-01787801v1
|
||
|
|
Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems[Research Report] PI-2018, 2014
Rapport
hal-00993400v1
|
||
|
|
The weakest failure detector to implement a register in asynchronous systems with hybrid communication[Research Report] PI-1972, 2011, pp.11
Rapport
inria-00583155v1
|
||
The x-Wait-freedom Progress ConditionProc. 16th Int'l European Parallel Computing Conference (EUROPAR'10), 2010, Ischia - Naples, Italy. pp.584-595
Communication dans un congrès
inria-00543134v1
|
|||
|
|
Progress-Space Tradeoffs in Single-Writer Memory Implementations21st International Conference on Principles of Distributed Systems (OPODIS 2017), Dec 2017, Lisbon, Portugal. ⟨10.4230/LIPIcs.OPODIS.2017.9⟩
Communication dans un congrès
hal-01787848v1
|
||
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing SystemsStructural Information and Communication Complexity, 2014, Hida Takayama, Japan. pp.37-53, ⟨10.1007/978-3-319-09620-9_5⟩
Communication dans un congrès
hal-01097383v1
|
|||
|
|
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits[Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017
Rapport
hal-01540010v1
|
||
|
|
Calculabilité et conditions de progression des objets partagés en présence de défaillancesCalcul parallèle, distribué et partagé [cs.DC]. Université Rennes 1, 2012. Français. ⟨NNT : ⟩
Thèse
tel-00722855v1
|
||
|
|
Generalized Symmetry Breaking Tasks2013
Pré-publication, Document de travail
hal-00862230v2
|
||
|
|
A Lock-based Protocol for Software Transactional Memory[Research Report] PI 1893, 2008, pp.26
Rapport
inria-00277378v1
|
||
|
|
Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early Abort[Research Report] PI 1894, 2008, pp.20
Rapport
inria-00281550v1
|
||
On Adaptive Renaming under Eventually Limited ContentionProc. 12th Int'l Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'10), 2010, New York, United States. pp.377-387
Communication dans un congrès
inria-00543135v1
|
- 1
- 2