Filtrer vos résultats
- 89
- 25
- 46
- 36
- 22
- 10
- 33
- 3
- 1
- 109
- 2
- 21
- 3
- 2
- 1
- 1
- 6
- 7
- 8
- 14
- 16
- 4
- 3
- 1
- 7
- 6
- 4
- 5
- 10
- 4
- 2
- 1
- 1
- 2
- 1
- 4
- 1
- 111
- 3
- 90
- 74
- 34
- 32
- 12
- 8
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 114
- 47
- 28
- 13
- 12
- 12
- 10
- 8
- 8
- 8
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
114 résultats
|
|
D.1.3 – Protocols for emergent localities[Technical Report] D1.3, IRISA; LINA-University of Nantes; Inria Rennes Bretagne Atlantique; Lancaster University. 2016
Rapport
hal-01343348v1
|
||
|
|
Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes[Research Report] PI 1758, 2005, pp.24
Rapport
inria-00000604v1
|
||
|
|
Exploring Gafni's reduction land: from $\Omega^k$ to wait-free adaptive $(2p-\lceil\frac{p}{k}\rceil)$-renaming via $k$-set agreement[Research Report] PI 1794, 2006, pp.19
Rapport
inria-00001189v1
|
||
|
|
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime[Research Report] PI 1799, 2006, pp.12
Rapport
inria-00001261v2
|
||
|
|
A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure[Research Report] RR-2041, INRIA. 1993
Rapport
inria-00074630v1
|
||
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set AgreementSIAM Journal on Computing, 2008, 38 (4), pp.1574-1601
Article dans une revue
hal-00432973v1
|
|||
|
|
A New Insight into Local Coin-Based Randomized ConsensusPRDC 2019 - 24th IEEE Pacific Rim International Symposium on Dependable Computing, Dec 2019, Kyoto, Japan. pp.207-216, ⟨10.1109/PRDC47002.2019.00051⟩
Communication dans un congrès
hal-02484620v1
|
||
|
|
Extending the Wait-free Hierarchy to Multi-Threaded SystemsPODC '20: ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, France. pp.21-30, ⟨10.1145/3382734.3405723⟩
Communication dans un congrès
hal-02941703v1
|
||
|
|
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing SystemsComputing, 2019, 101 (1), pp.3-17. ⟨10.1007/s00607-018-0615-8⟩
Article dans une revue
hal-01784210v1
|
||
|
|
Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems37th IEEE International Symposium on Reliable Distributed Systems (SRDS), Oct 2018, Salvador de Bahia, Brazil
Communication dans un congrès
hal-01778901v2
|
||
|
|
Large-scale networked systems: from anarchy to geometric self-structuring[Research Report] PI 1876, 2007, pp.21
Rapport
inria-00196714v2
|
||
|
|
Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative EditingDocument Changes: Modeling, Detection, Storage and Visualization, Sep 2013, Florence, Italy. pp.0--7
Communication dans un congrès
hal-00921655v1
|
||
|
|
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORCNETYS - 3rd International Conference on NETwork sYStems, May 2015, Agadir, Morocco
Communication dans un congrès
hal-01152761v1
|
||
|
|
On Composition and Implementation of Sequential Consistency30th International Symposium on Distributed Computing, Sep 2016, Paris, France
Communication dans un congrès
hal-01347069v2
|
||
Asynchronous Agreement and Its Relation with Error-Correcting CodesIEEE Transactions on Computers, 2007, 56 (7), pp.865-875
Article dans une revue
inria-00338071v1
|
|||
|
|
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 Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement[Research Report] PI 1897, 2008, pp.30
Rapport
inria-00294706v1
|
||
From Renaming to Set Agreement14th International Colloquium on Structural Information and Communication Complexity, Jun 2007, Castiglioncello, Italy. pp.66-80
Communication dans un congrès
inria-00338090v1
|
|||
|
|
Causal Broadcast: How to Forget?The 22nd International Conference on Principles of Distributed Systems (OPODIS), Dec 2018, Hong Kong, China
Communication dans un congrès
hal-01923830v2
|
||
|
|
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
|
||
|
|
Efficiently Summarizing Distributed Data Streams over Sliding Windows[Research Report] LINA-University of Nantes; Centre de Recherche en Économie et Statistique; Inria Rennes Bretagne Atlantique. 2015, 19 p
Rapport
hal-01073877v3
|
||
|
|
Signature-Free Asynchronous Byzantine Consensus with $t < n/3$ and $O(n^2)$ MessagesACM PODC, Jul 2014, Paris, France. pp.2-9
Communication dans un congrès
hal-00944019v2
|
||
|
|
Résumer efficacement des flux de données massifs en fenêtre glissanteALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Communication dans un congrès
hal-01303882v1
|
||
|
|
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value[Research Report] PI-1953, 2010, pp.15
Rapport
inria-00495653v1
|
||
|
|
A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus[Research Report] PI 1954, 2010, pp.8
Rapport
inria-00521646v1
|
||
Towards a Computing Model for Open Distributed SystemsParallel Computing Technologies, 9th International Conference, Sep 2007, Pereslavl-Zalessky, Russia. pp.74-79
Communication dans un congrès
inria-00338075v1
|
|||
From omega to Omega: A simple bounded quiescent reliable broadcast-based transformationJournal of Parallel and Distributed Computing, 2007, 67 (1), pp.125-129
Article dans une revue
inria-00338081v1
|
|||
From adaptive renaming to set agreementTheoretical Computer Science, 2009, 410 (14), pp.1328-1335
Article dans une revue
hal-00432970v1
|
|||
On the computability power and the robustness of set agreement-oriented failure detector classesDistributed Computing, 2008, 21 (3), pp.201-222
Article dans une revue
hal-00432977v1
|