No. Title Author Year
1 Brief Annoucement: On Extending Brandt’s Speedup Theorem from LOCAL to Round-Based Full-Information Models Bastide, Paul et al. 2021
2 Distributed Quantum Proofs for Replicated Data Fraigniaud, Pierre et al. 2021
3 Brief Announcement: Distributed Quantum Proofs for Replicated Data Fraigniaud, Pierre et al. 2020
4 The Topology of Local Computing in Networks Fraigniaud, Pierre et al. 2020
5 Trade-Offs in Distributed Interactive Proofs Crescenzi, Pierluigi et al. 2019
6 Equilibria of Games in Networks for Local Tasks Collet, Simon et al. 2018
7 Redundancy in Distributed Proofs Feuilloley, Laurent et al. 2018
8 Certification of Compact Low-Stretch Routing Schemes Balliu, Alkida et al. 2017
9 Error-Sensitive Proof-Labeling Schemes Feuilloley, Laurent et al. 2017
10 Three Notes on Distributed Property Testing Even, Guy et al. 2017
11 What Can Be Verified Locally? Balliu, Alkida et al. 2017
12 A Hierarchy of Local Decision Feuilloley, Laurent et al. 2016
13 Decentralized Asynchronous Crash-Resilient Runtime Verification Bonakdarpour, Borzoo et al. 2016
14 Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042) Doerr, Benjamin et al. 2013
15 Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) Fomin, Fedor V. et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 15


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI