Filter your results
- 88
- 25
- 46
- 36
- 22
- 9
- 33
- 3
- 108
- 2
- 21
- 1
- 3
- 1
- 1
- 6
- 7
- 8
- 14
- 16
- 4
- 3
- 1
- 7
- 6
- 4
- 5
- 10
- 4
- 2
- 1
- 1
- 2
- 1
- 4
- 1
- 111
- 2
- 90
- 74
- 31
- 30
- 12
- 8
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 113
- 47
- 27
- 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
113 Results
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set AgreementSIAM Journal on Computing, 2008, 38 (4), pp.1574-1601
Journal articles
hal-00432973v1
|
|||
|
D.1.3 – Protocols for emergent localities[Technical Report] D1.3, IRISA; LINA-University of Nantes; Inria Rennes Bretagne Atlantique; Lancaster University. 2016
Reports
hal-01343348v1
|
||
|
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing SystemsComputing, 2019, 101 (1), pp.3-17. ⟨10.1007/s00607-018-0615-8⟩
Journal articles
hal-01784210v1
|
||
|
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⟩
Conference papers
hal-02484620v1
|
||
|
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
Conference papers
hal-01778901v2
|
||
|
Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes[Research Report] PI 1758, 2005, pp.24
Reports
inria-00000604v1
|
||
|
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime[Research Report] PI 1799, 2006, pp.12
Reports
inria-00001261v2
|
||
|
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
Reports
inria-00001189v1
|
||
|
A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure[Research Report] RR-2041, INRIA. 1993
Reports
inria-00074630v1
|
||
|
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⟩
Conference papers
hal-02941703v1
|
||
|
Causal Broadcast: How to Forget?The 22nd International Conference on Principles of Distributed Systems (OPODIS), Dec 2018, Hong Kong, China
Conference papers
hal-01923830v2
|
||
|
Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative EditingDocument Changes: Modeling, Detection, Storage and Visualization, Sep 2013, Florence, Italy. pp.0--7
Conference papers
hal-00921655v1
|
||
|
On Composition and Implementation of Sequential Consistency30th International Symposium on Distributed Computing, Sep 2016, Paris, France
Conference papers
hal-01347069v2
|
||
|
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORCNETYS - 3rd International Conference on NETwork sYStems, May 2015, Agadir, Morocco
Conference papers
hal-01152761v1
|
||
|
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
Reports
hal-01073877v3
|
||
|
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement[Research Report] PI 1897, 2008, pp.30
Reports
inria-00294706v1
|
||
|
Large-scale networked systems: from anarchy to geometric self-structuring[Research Report] PI 1876, 2007, pp.21
Reports
inria-00196714v2
|
||
Asynchronous Agreement and Its Relation with Error-Correcting CodesIEEE Transactions on Computers, 2007, 56 (7), pp.865-875
Journal articles
inria-00338071v1
|
|||
From Renaming to Set Agreement14th International Colloquium on Structural Information and Communication Complexity, Jun 2007, Castiglioncello, Italy. pp.66-80
Conference papers
inria-00338090v1
|
|||
|
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
Reports
hal-01476201v1
|
||
|
Which Broadcast Abstraction Captures $k$-Set Agreement?2017
Preprints, Working Papers, ...
hal-01660664v1
|
||
|
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⟩
Conference papers
hal-01787801v1
|
||
|
Update Consistency for Wait-free Concurrent ObjectsIPDPS - IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India
Conference papers
hal-01101657v1
|
||
|
Causal multicasts in overlapping groups : towards a low cost approach[Research Report] RR-1871, INRIA. 1993
Reports
inria-00074802v1
|
||
(BA) From Anarchy to Geometric Structuring: the Power of Virtual CoordinatesProceedings of ACM Sigact-Sigops Symposium on Principles of Distributed Computing (PODC), Aug 2008, Toronto, Canada
Conference papers
inria-00334356v1
|
|||
Byzantine Consensus with Few Synchronous Links11th International Conference On Principles Of Distributed Systems, Dec 2007, Guadeloupe, French West Indies, France. pp.76-89
Conference papers
inria-00338059v1
|
|||
Towards the minimal synchrony for byzantine consensus26th Annual ACM Symposium on Principles of Distributed Computing, Aug 2007, Portland, United States. pp.314-315
Conference papers
inria-00338092v1
|
|||
|
Looking for Efficient Implementations of Concurrent Objects[Research Report] PI-1969, 2011, pp.10
Reports
inria-00576742v1
|
||
|
Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2 ) Messages, O(1) Time, and no Signature2015
Preprints, Working Papers, ...
hal-01102496v1
|
||
Signature-Free Broadcast-Based Intrusion Tolerance14th International Conference On Principles Of Distributed Systems (OPODIS 2010), Dec 2010, Tozeur, Tunisia. pp.143-159
Conference papers
inria-00544650v1
|