Redundancy in distributed proofs
Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well know...
Saved in:
| Published in | Distributed computing Vol. 34; no. 2; pp. 113 - 132 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.04.2021
Springer Nature B.V Springer Verlag |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0178-2770 1432-0452 1432-0452 |
| DOI | 10.1007/s00446-020-00386-z |
Cover
| Abstract | Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a
prover
that assigns a
certificate
to each node, and a distributed algorithm called a
verifier
that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the
size of the certificate
stored at every node, and the
number of rounds
of the verification protocol. |
|---|---|
| AbstractList | Abstract Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol. Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol. Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol. Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on objects distributed over the nodes (e.g., a spanning tree). We consider well known mechanisms consisting of two components: a prover that assigns a certificate to each node, and a distributed algorithm called a verifier that is in charge of verifying the distributed proof formed by the collection of all certificates. We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs to establish perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol. |
| Author | Hirvonen, Juho Fraigniaud, Pierre Paz, Ami Perry, Mor Feuilloley, Laurent |
| Author_xml | – sequence: 1 givenname: Laurent surname: Feuilloley fullname: Feuilloley, Laurent organization: Universidad de Chile – sequence: 2 givenname: Pierre surname: Fraigniaud fullname: Fraigniaud, Pierre organization: IRIF, CNRS, Université de – sequence: 3 givenname: Juho surname: Hirvonen fullname: Hirvonen, Juho organization: Aalto University – sequence: 4 givenname: Ami surname: Paz fullname: Paz, Ami email: ami.paz@univie.ac.at organization: Faculty of Computer Science, University of Vienna – sequence: 5 givenname: Mor surname: Perry fullname: Perry, Mor organization: Weizmann Institute of Science |
| BackLink | https://inria.hal.science/hal-03871467$$DView record in HAL |
| BookMark | eNqNkE1rFEEQhhuJmE30D3ha8KKH0erqr9mLEIIaYUEQPTc9MzVJh9nutXsmYfPr7c0sBPcQPDV0PU9VvXXGTkIMxNhbDh85gPmUAaTUFSBUAKLW1cMLtuBSYAVS4QlbADd1hcbAKTvL-RYKxTm-YqdCGgRcwYItf1I3hc6Fdrf0Ydn5PCbfTCN1y22Ksc-v2cveDZneHN5z9vvrl1-XV9X6x7fvlxfrqpW1GqtaUd8og4jkUJIC6oVsnHB9L8pKJLgQCkW_ErqhmlA7DpqaRpVy4UGcMzH3ncLW7e7dMNht8huXdpaD3ee1c15b8trHvPahWJ9nazs1G-paCmNyT2Z03v5bCf7GXsc7WysFXJvS4MPc4OZIu7pY2_1fGWS41OaOF_b9YViKfybKo9343NIwuEBxyhbViiNqqVYFfXeE3sYphXLAQoHWBvUjhTPVpphzov7_ItdHUutHN_q4D-iH59XDjXOZE64pPW31jPUXA2u4Pg |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2023_114068 crossref_primary_10_1016_j_dam_2022_10_004 crossref_primary_10_1016_j_tcs_2022_05_006 |
| Cites_doi | 10.1017/CBO9780511813603 10.1007/978-3-319-03089-0_10 10.1137/0220006 10.1007/978-3-319-12340-0_2 10.1007/978-3-662-49529-2_37 10.1007/978-3-319-69084-1_1 10.1137/1.9781611975994.67 10.1145/357195.357200 10.1007/s00446-007-0025-1 10.1145/1007352.1007407 10.1007/978-3-319-11764-5_2 10.1145/2499228 10.1007/s00446-018-0340-8 10.1007/978-3-319-49259-9_13 10.1145/197917.198104 10.1007/s00446-007-0029-x 10.1006/jpdc.2001.1823 10.1016/S0304-3975(96)00286-1 10.1016/j.tcs.2018.08.020 10.1016/j.tcs.2016.11.018 10.1145/3212734.3212771 10.1137/11085178X 10.1145/800135.804414 10.1007/s00446-010-0095-3 10.1007/s00446-015-0242-y 10.1007/978-3-662-49529-2_10 10.1137/1.9781611973099.91 10.1016/j.jpdc.2017.04.003 10.1007/978-3-319-72050-0_4 10.1137/1.9780898719772 10.1007/978-3-662-53426-7_3 10.1109/ICDCS.2015.66 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2020 The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. The Author(s) 2020. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: The Author(s) 2020 – notice: The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: The Author(s) 2020. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | C6C AAYXX CITATION 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U U9A 7X8 1XC 5PM ADTOC UNPAY |
| DOI | 10.1007/s00446-020-00386-z |
| DatabaseName | Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database (Proquest) Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Collection ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic Hyper Article en Ligne (HAL) PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | CrossRef MEDLINE - Academic Computer Science Database |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 3 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0452 |
| EndPage | 132 |
| ExternalDocumentID | 10.1007/s00446-020-00386-z PMC8550167 oai:HAL:hal-03871467v1 10_1007_s00446_020_00386_z |
| GrantInformation_xml | – fundername: Austrian Science Fund grantid: P 33775-N funderid: http://dx.doi.org/10.13039/501100002428 – fundername: ; grantid: P 33775-N |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 28- 29G 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV KOW LAS LLZTM M0N M4Y MA- N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZCA ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U U9A 7X8 1XC 5PM ADTOC UNPAY |
| ID | FETCH-LOGICAL-c485t-85efb57222ea24e50ef34ba3aff3143e3133523f936be8e26a106ebb5f3124e03 |
| IEDL.DBID | BENPR |
| ISSN | 0178-2770 1432-0452 |
| IngestDate | Sun Oct 26 04:06:44 EDT 2025 Tue Sep 30 16:18:32 EDT 2025 Tue Oct 14 20:46:37 EDT 2025 Wed Oct 01 15:04:35 EDT 2025 Sat Aug 23 13:03:26 EDT 2025 Wed Oct 01 04:43:47 EDT 2025 Thu Apr 24 22:53:08 EDT 2025 Fri Feb 21 02:49:32 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Distributed graph algorithms Proof-labeling schemes Space-time tradeoffs Distributed verification Nondeterminism |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c485t-85efb57222ea24e50ef34ba3aff3143e3133523f936be8e26a106ebb5f3124e03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0003-4534-4803 0000-0002-6629-8335 |
| OpenAccessLink | https://doi.org/10.1007/s00446-020-00386-z |
| PMID | 34720290 |
| PQID | 2506672659 |
| PQPubID | 31799 |
| PageCount | 20 |
| ParticipantIDs | unpaywall_primary_10_1007_s00446_020_00386_z pubmedcentral_primary_oai_pubmedcentral_nih_gov_8550167 hal_primary_oai_HAL_hal_03871467v1 proquest_miscellaneous_2591226459 proquest_journals_2506672659 crossref_primary_10_1007_s00446_020_00386_z crossref_citationtrail_10_1007_s00446_020_00386_z springer_journals_10_1007_s00446_020_00386_z |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-04-01 |
| PublicationDateYYYYMMDD | 2021-04-01 |
| PublicationDate_xml | – month: 04 year: 2021 text: 2021-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationTitle | Distributed computing |
| PublicationTitleAbbrev | Distrib. Comput |
| PublicationYear | 2021 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V Springer Verlag |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V – name: Springer Verlag |
| References | Fraigniaud, P., Rajsbaum, S., Travers, C.: Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings. In: 12th Latin American Symposium on Theoretical Informatics (LATIN), Springer, pp. 497–508 (2016) Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’94, ACM, New York, NY, USA, pp. 254–263 (1994) BeauquierJDelaëtSDolevSTixeuilSTransient fault detectorsDistrib. Comput.2007201395110.1007/s00446-007-0029-x Arfaoui, H., Fraigniaud, P., Ilcinkas, D., Mathieu, F.: Distributedly testing cycle-freeness. In: 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol. 8747, LNCS, Springer, pp. 15–28 (2014) Feuilloley, L., Fraigniaud, P., Hirvonen, J.: A hierarchy of local decision. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, pp. 118:1–118:15 (2016) Ostrovsky, R., Perry, M., Rosenbaum, W.: Space-time tradeoffs for distributed verification. In: 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 53–70 (2017) Chi-Chih Yao, A.: Some complexity questions related to distributive computing. In: 11th Symposium on Theory of Computing (STOC), ACM, pp. 209–213 (1979) Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 331–340 (2004) UllmanJDYannakakisMHigh-probability parallel transitive-closure algorithmsSIAM J. Comput.1991201100125108213810.1137/0220006 Blin, L., Fraigniaud, P.: Space-optimal time-efficient silent self-stabilizing constructions of constrained spanning trees. In: 35th International Conference on Distributed Computing Systems (ICDCS), IEEE, pp. 589–598 (2015) Crescenzi, P., Fraigniaud, P., Paz, A.: Trade-offs in distributed interactive proofs. In: 33rd International Symposium on Distributed Computing (DISC), pp. 13:1–13:17 (2019) Korhonen, J.H., Suomela, J.: Brief announcement: Towards a complexity theory for the congested clique. In: 31st International Symposium on Distributed Computing (DISC), pp. 55:1–55:3 (2017) Itkis, G., Levin, L.: Fast and lean self-stabilizing asynchronous protocols. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS ’94, IEEE Computer Society, Washington, DC, USA, pp. 226–239 (1994) AfekYKuttenSYungMThe local detection paradigm and its applications to self-stabilizationTheor. Comput. Sci.19971861199229147866810.1016/S0304-3975(96)00286-1 FoersterK-TLuediTSeidelJWattenhoferRLocal checkability, no strings attached: (a)cyclicity, reachability, loop free updates in sdnsTheor. Comput. Sci.20187094863373816310.1016/j.tcs.2016.11.018 FraigniaudPKormanAPelegDTowards a complexity theory for local distributed computingJ. ACM201360535312468410.1145/2499228 KormanAKuttenSDistributed verification of minimum spanning treesDistrib. Comput.20072025326610.1007/s00446-007-0025-1 KushilevitzENisanNCommunication Complexity1997New YorkCambridge University Press0869.68048 PelegDDistributed Computing: A Locality-Sensitive Approach2000PhiladelphiaSIAM10.1137/1.9780898719772 Fraigniaud, P., Rajsbaum, S., Travers, C., Kuznetsov, P., Rieutord, T.: Perfect failure detection with very few bits. In: 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10083, Springer, pp. 154–169 (2016) Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: 23rd Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 1150–1162 (2012) MitzenmacherMUpfalEProbability and Computing: Randomized Algorithms and Probabilistic Analysis2005CambridgeCambridge University Press10.1017/CBO9780511813603 FraigniaudPPatt-ShamirBPerryMRandomized proof-labeling schemesDistrib. Comput.2019323217234394642510.1007/s00446-018-0340-8 GallagerRGHumbletPASpiraPMA distributed algorithm for minimum-weight spanning treesACM Trans. Program. Lang. Syst. (TOPLAS)198351667710.1145/357195.357200 Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1096–115 (2020) KormanAKuttenSPelegDProof labeling schemesDistrib. Comput.201022421523310.1007/s00446-010-0095-3 Das SarmaAHolzerSKorLKormanANanongkaiDPanduranganGPelegDWattenhoferRDistributed verification and hardness of distributed approximationSIAM J. Comput.201241512351265302379210.1137/11085178X Feuilloley, L., Fraigniaud, P.: Survey of distributed decision. In: Bulletin of the EATCS, vol. 119 (2016) AfekYDolevSLocal stabilizerJ. Parallel Distrib. Comput.200262574576510.1006/jpdc.2001.1823 Kol, G., Oshman, R., Saxena, R.R.: Interactive distributed proofs. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC, pp. 255–264 (2018) Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: 35th Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 226–239 (1994) KormanAKuttenSMasuzawaTFast and compact self-stabilizing verification, computation, and fault detection of an MSTDistrib. Comput.2015284253295337555910.1007/s00446-015-0242-y Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: 30th International Symposium on Distributed Computing (DISC), pp. 29–42 (2016). arXiv:1901.01630 Balliu, A., D’Angelo, G., Fraigniaud, P., Olivetti, D.: What can be verified locally? In: 34th Symposium on Theoretical Aspects of Computer Science (STACS), vol. 66, LIPIcs, pp. 8:1–8:13 (2017) Feuilloley, L., Fraigniaud, P.: Error-sensitive proof-labeling schemes. In: 31st International Symposium on Distributed Computing (DISC), pp. 16:1–16:15 (2017) Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: 40th Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 253–261 (1999) Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, Springer, pp. 18–32 (2014) Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: 32nd Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 268–277 (1991) Bampas, E., Ilcinkas, D.: On mobile agent verifiable problems. In: 12th Latin American Symposium on Theoretical Informatics (LATIN), LNCS, vol. 9644, Springer, pp. 123–137 (2016) Censor-HillelKPazAPerryMApproximate proof-labeling schemesTheor. Comput. Sci.2020811112124406625910.1016/j.tcs.2018.08.020 GöösMSuomelaJLocally checkable proofs in distributed computingTheory Comput.201612113335181761401.68085 FraigniaudPPelcADecidability classes for mobile agents computingJ. Parallel Distrib. Comput.201710911712810.1016/j.jpdc.2017.04.003 Patt-Shamir, B., Perry, M.: Proof-labeling schemes: broadcast, unicast and in between. In: 19th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10616, Springer, pp. 1–17 (2017) Arfaoui, H., Fraigniaud, P., Pelc, A.: Local decision and verification with bounded-size outputs. In: 15th Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 8255, LNCS, Springer, pp. 133–147 (2013) Feuilloley, L., Fraigniaud, P., Hirvonen, J., Paz, A., Perry, M.: Redundancy in distributed proofs. In: Schmid, U., Widder, J. (eds), 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15–19, 2018, vol. 121, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 24:1–24:18 (2018) 386_CR40 D Peleg (386_CR43) 2000 JD Ullman (386_CR45) 1991; 20 386_CR42 386_CR20 386_CR41 386_CR21 386_CR44 Y Afek (386_CR3) 1997; 186 386_CR4 386_CR1 386_CR7 386_CR8 RG Gallager (386_CR29) 1983; 5 386_CR5 386_CR6 Y Afek (386_CR2) 2002; 62 386_CR9 J Beauquier (386_CR10) 2007; 20 A Das Sarma (386_CR16) 2012; 41 386_CR14 386_CR15 386_CR17 386_CR18 386_CR19 A Korman (386_CR36) 2015; 28 P Fraigniaud (386_CR23) 2013; 60 E Kushilevitz (386_CR38) 1997 386_CR31 386_CR33 386_CR11 386_CR32 A Korman (386_CR37) 2010; 22 386_CR12 386_CR34 M Mitzenmacher (386_CR39) 2005 M Göös (386_CR30) 2016; 12 K-T Foerster (386_CR22) 2018; 709 P Fraigniaud (386_CR24) 2019; 32 386_CR26 K Censor-Hillel (386_CR13) 2020; 811 386_CR28 386_CR27 P Fraigniaud (386_CR25) 2017; 109 A Korman (386_CR35) 2007; 20 |
| References_xml | – reference: KormanAKuttenSMasuzawaTFast and compact self-stabilizing verification, computation, and fault detection of an MSTDistrib. Comput.2015284253295337555910.1007/s00446-015-0242-y – reference: MitzenmacherMUpfalEProbability and Computing: Randomized Algorithms and Probabilistic Analysis2005CambridgeCambridge University Press10.1017/CBO9780511813603 – reference: Das SarmaAHolzerSKorLKormanANanongkaiDPanduranganGPelegDWattenhoferRDistributed verification and hardness of distributed approximationSIAM J. Comput.201241512351265302379210.1137/11085178X – reference: Kol, G., Oshman, R., Saxena, R.R.: Interactive distributed proofs. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC, pp. 255–264 (2018) – reference: Fraigniaud, P., Rajsbaum, S., Travers, C., Kuznetsov, P., Rieutord, T.: Perfect failure detection with very few bits. In: 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10083, Springer, pp. 154–169 (2016) – reference: Balliu, A., D’Angelo, G., Fraigniaud, P., Olivetti, D.: What can be verified locally? In: 34th Symposium on Theoretical Aspects of Computer Science (STACS), vol. 66, LIPIcs, pp. 8:1–8:13 (2017) – reference: KormanAKuttenSDistributed verification of minimum spanning treesDistrib. Comput.20072025326610.1007/s00446-007-0025-1 – reference: FraigniaudPPelcADecidability classes for mobile agents computingJ. Parallel Distrib. Comput.201710911712810.1016/j.jpdc.2017.04.003 – reference: Itkis, G., Levin, L.: Fast and lean self-stabilizing asynchronous protocols. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, SFCS ’94, IEEE Computer Society, Washington, DC, USA, pp. 226–239 (1994) – reference: AfekYKuttenSYungMThe local detection paradigm and its applications to self-stabilizationTheor. Comput. Sci.19971861199229147866810.1016/S0304-3975(96)00286-1 – reference: Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, Springer, pp. 18–32 (2014) – reference: FoersterK-TLuediTSeidelJWattenhoferRLocal checkability, no strings attached: (a)cyclicity, reachability, loop free updates in sdnsTheor. Comput. Sci.20187094863373816310.1016/j.tcs.2016.11.018 – reference: KushilevitzENisanNCommunication Complexity1997New YorkCambridge University Press0869.68048 – reference: BeauquierJDelaëtSDolevSTixeuilSTransient fault detectorsDistrib. Comput.2007201395110.1007/s00446-007-0029-x – reference: Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: 32nd Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 268–277 (1991) – reference: GallagerRGHumbletPASpiraPMA distributed algorithm for minimum-weight spanning treesACM Trans. Program. Lang. Syst. (TOPLAS)198351667710.1145/357195.357200 – reference: Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: 23rd Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 1150–1162 (2012) – reference: Feuilloley, L., Fraigniaud, P., Hirvonen, J.: A hierarchy of local decision. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP), LIPIcs, pp. 118:1–118:15 (2016) – reference: Ostrovsky, R., Perry, M., Rosenbaum, W.: Space-time tradeoffs for distributed verification. In: 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 53–70 (2017) – reference: Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: 30th International Symposium on Distributed Computing (DISC), pp. 29–42 (2016). arXiv:1901.01630 – reference: Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’94, ACM, New York, NY, USA, pp. 254–263 (1994) – reference: Feuilloley, L., Fraigniaud, P.: Survey of distributed decision. In: Bulletin of the EATCS, vol. 119 (2016) – reference: PelegDDistributed Computing: A Locality-Sensitive Approach2000PhiladelphiaSIAM10.1137/1.9780898719772 – reference: Arfaoui, H., Fraigniaud, P., Ilcinkas, D., Mathieu, F.: Distributedly testing cycle-freeness. In: 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol. 8747, LNCS, Springer, pp. 15–28 (2014) – reference: Crescenzi, P., Fraigniaud, P., Paz, A.: Trade-offs in distributed interactive proofs. In: 33rd International Symposium on Distributed Computing (DISC), pp. 13:1–13:17 (2019) – reference: Korhonen, J.H., Suomela, J.: Brief announcement: Towards a complexity theory for the congested clique. In: 31st International Symposium on Distributed Computing (DISC), pp. 55:1–55:3 (2017) – reference: Blin, L., Fraigniaud, P.: Space-optimal time-efficient silent self-stabilizing constructions of constrained spanning trees. In: 35th International Conference on Distributed Computing Systems (ICDCS), IEEE, pp. 589–598 (2015) – reference: Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: 40th Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 253–261 (1999) – reference: UllmanJDYannakakisMHigh-probability parallel transitive-closure algorithmsSIAM J. Comput.1991201100125108213810.1137/0220006 – reference: AfekYDolevSLocal stabilizerJ. Parallel Distrib. Comput.200262574576510.1006/jpdc.2001.1823 – reference: Patt-Shamir, B., Perry, M.: Proof-labeling schemes: broadcast, unicast and in between. In: 19th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS 10616, Springer, pp. 1–17 (2017) – reference: Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 331–340 (2004) – reference: FraigniaudPKormanAPelegDTowards a complexity theory for local distributed computingJ. ACM201360535312468410.1145/2499228 – reference: Feuilloley, L., Fraigniaud, P., Hirvonen, J., Paz, A., Perry, M.: Redundancy in distributed proofs. In: Schmid, U., Widder, J. (eds), 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15–19, 2018, vol. 121, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 24:1–24:18 (2018) – reference: KormanAKuttenSPelegDProof labeling schemesDistrib. Comput.201022421523310.1007/s00446-010-0095-3 – reference: Arfaoui, H., Fraigniaud, P., Pelc, A.: Local decision and verification with bounded-size outputs. In: 15th Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 8255, LNCS, Springer, pp. 133–147 (2013) – reference: GöösMSuomelaJLocally checkable proofs in distributed computingTheory Comput.201612113335181761401.68085 – reference: Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1096–115 (2020) – reference: Censor-HillelKPazAPerryMApproximate proof-labeling schemesTheor. Comput. Sci.2020811112124406625910.1016/j.tcs.2018.08.020 – reference: Feuilloley, L., Fraigniaud, P.: Error-sensitive proof-labeling schemes. In: 31st International Symposium on Distributed Computing (DISC), pp. 16:1–16:15 (2017) – reference: Bampas, E., Ilcinkas, D.: On mobile agent verifiable problems. In: 12th Latin American Symposium on Theoretical Informatics (LATIN), LNCS, vol. 9644, Springer, pp. 123–137 (2016) – reference: FraigniaudPPatt-ShamirBPerryMRandomized proof-labeling schemesDistrib. Comput.2019323217234394642510.1007/s00446-018-0340-8 – reference: Chi-Chih Yao, A.: Some complexity questions related to distributive computing. In: 11th Symposium on Theory of Computing (STOC), ACM, pp. 209–213 (1979) – reference: Fraigniaud, P., Rajsbaum, S., Travers, C.: Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings. In: 12th Latin American Symposium on Theoretical Informatics (LATIN), Springer, pp. 497–508 (2016) – reference: Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: 35th Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 226–239 (1994) – volume-title: Probability and Computing: Randomized Algorithms and Probabilistic Analysis year: 2005 ident: 386_CR39 doi: 10.1017/CBO9780511813603 – ident: 386_CR21 – ident: 386_CR5 doi: 10.1007/978-3-319-03089-0_10 – volume: 20 start-page: 100 issue: 1 year: 1991 ident: 386_CR45 publication-title: SIAM J. Comput. doi: 10.1137/0220006 – volume-title: Communication Complexity year: 1997 ident: 386_CR38 – ident: 386_CR4 doi: 10.1007/978-3-319-12340-0_2 – ident: 386_CR26 doi: 10.1007/978-3-662-49529-2_37 – ident: 386_CR31 – ident: 386_CR19 – ident: 386_CR42 doi: 10.1007/978-3-319-69084-1_1 – ident: 386_CR40 doi: 10.1137/1.9781611975994.67 – ident: 386_CR15 – volume: 5 start-page: 66 issue: 1 year: 1983 ident: 386_CR29 publication-title: ACM Trans. Program. Lang. Syst. (TOPLAS) doi: 10.1145/357195.357200 – volume: 20 start-page: 253 year: 2007 ident: 386_CR35 publication-title: Distrib. Comput. doi: 10.1007/s00446-007-0025-1 – ident: 386_CR17 doi: 10.1145/1007352.1007407 – ident: 386_CR12 doi: 10.1007/978-3-319-11764-5_2 – volume: 60 start-page: 35 issue: 5 year: 2013 ident: 386_CR23 publication-title: J. ACM doi: 10.1145/2499228 – volume: 32 start-page: 217 issue: 3 year: 2019 ident: 386_CR24 publication-title: Distrib. Comput. doi: 10.1007/s00446-018-0340-8 – ident: 386_CR8 – ident: 386_CR44 – ident: 386_CR27 doi: 10.1007/978-3-319-49259-9_13 – volume: 12 start-page: 1 issue: 1 year: 2016 ident: 386_CR30 publication-title: Theory Comput. – ident: 386_CR6 doi: 10.1145/197917.198104 – volume: 20 start-page: 39 issue: 1 year: 2007 ident: 386_CR10 publication-title: Distrib. Comput. doi: 10.1007/s00446-007-0029-x – volume: 62 start-page: 745 issue: 5 year: 2002 ident: 386_CR2 publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.2001.1823 – volume: 186 start-page: 199 issue: 1 year: 1997 ident: 386_CR3 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(96)00286-1 – volume: 811 start-page: 112 year: 2020 ident: 386_CR13 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2018.08.020 – volume: 709 start-page: 48 year: 2018 ident: 386_CR22 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.11.018 – ident: 386_CR33 doi: 10.1145/3212734.3212771 – ident: 386_CR18 – volume: 41 start-page: 1235 issue: 5 year: 2012 ident: 386_CR16 publication-title: SIAM J. Comput. doi: 10.1137/11085178X – ident: 386_CR32 – ident: 386_CR14 doi: 10.1145/800135.804414 – ident: 386_CR34 – volume: 22 start-page: 215 issue: 4 year: 2010 ident: 386_CR37 publication-title: Distrib. Comput. doi: 10.1007/s00446-010-0095-3 – volume: 28 start-page: 253 issue: 4 year: 2015 ident: 386_CR36 publication-title: Distrib. Comput. doi: 10.1007/s00446-015-0242-y – ident: 386_CR9 doi: 10.1007/978-3-662-49529-2_10 – ident: 386_CR28 doi: 10.1137/1.9781611973099.91 – volume: 109 start-page: 117 year: 2017 ident: 386_CR25 publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2017.04.003 – ident: 386_CR7 – ident: 386_CR20 – ident: 386_CR41 doi: 10.1007/978-3-319-72050-0_4 – volume-title: Distributed Computing: A Locality-Sensitive Approach year: 2000 ident: 386_CR43 doi: 10.1137/1.9780898719772 – ident: 386_CR1 doi: 10.1007/978-3-662-53426-7_3 – ident: 386_CR11 doi: 10.1109/ICDCS.2015.66 |
| SSID | ssj0003112 |
| Score | 2.3971953 |
| Snippet | Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the... Abstract Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on... |
| SourceID | unpaywall pubmedcentral hal proquest crossref springer |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 113 |
| SubjectTerms | Algorithms Boolean algebra Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Graph theory Nodes Redundancy Software Engineering/Programming and Operating Systems Theory of Computation |
| SummonAdditionalLinks | – databaseName: Springer Nature OA Free Journals dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5sPagH32K0ShRvNtBkN5PkWIqliHoQC72F3WSXFkpatFXsr3cnTaMtUvSanWyyM5lHmJlvAG7SIFJJitpJuCcc7qbGDkomHYZBov1QI3rUO_z4hJ0uv-_5vQImh3phVvL3OdgnpzJZ6n9mITqzCmwaJ4V5YhZbpdVlbp7ZpGnzjhcEjaJB5vc9lpxQpU8lkD_iy9XqyDJFugNb02wsPj_EcPjDC7X3YbcIH-3mXN4HsKGyQ9hbjGawC009AvtZUXsYmU57kNkpwePSZCuV2uYNjOM7hm777qXVcYphCIaLoT9xQl9p6QfGnSvhceU3lGZcCia0ZibmUcyl7immI4ZShcpDYX72lJS-WTb0DXYC1WyUqVOwU4GhQFShix5PeSSk0CiMdHgjYUKkFrgL7sRJgRROAyuGcYlxnHM0NhyNc47GMwtuy3vGc5yMtdTXhuklIUFcd5oPMV2jdDpZ73fXgtpCJnGhWG-xidgQAw_9yIKrctmoBOU5RKZGU6KJXOoPJppgSZZLT1xeyQb9HFybAN5cDCyoL6T-_fB1B6qXX8Yfzn_2v93PYdujUpq8YKgG1cnrVF2YWGgiL3Ml-AJoNv24 priority: 102 providerName: Springer Nature – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9NADLe27gF4YHxNBAYKiDeWrrlLnPSxAqYKwYQQlcZTdJfzaRNVVrF0iP712GkS1glNIF5jJxff-c4-2f4Z4JXLxlQ69FGZKBMlseNz0GobacxKn-YeUUnt8MdjnM6S9yfpyRa87Wphmmz3LiS5rmkQlKaqPlw4f9gXvjVxyEiuPhLawmg1ZPI27GDKHvkAdmbHnyZfm-xFviSprOkZx56BigRBvK2d-fOHNuzT9qlkR15xPa8nTvbR0ztwa1ktzM8fZj6_YqCOdoE60dZ5Kd-Gy9oOy9U11Mf_lf0e3G092HCyVrn7sEXVA9jtukOE7WHxEMLPJBVqcnqHZ1XoBKFXmmuRC_kf2fY-gtnRuy9vplHbj4EXMk_rKE_J2zRjj4KMSigdkdeJNdp4r3lyScdSwKX9WKOlnBQavm-StSmTmX-k92BQnVf0GEJnMDeIlMeoEpeMjTUeDStIMiq1MS6AuFuFomzByqVnxrzoYZabaSh4GopmGopVAK_7dxZrqI4buV_y4vaMgrI9nXwo5JlE9MWAXMYB7HdrX7R7-6JgpxExU6xqAbzoybwrJdRiKjpfCs84lhJl4ck2dGZjxE1KdXba4HsLxlyMWQAHnTL8HvwmgQ56DfwL-Z_8G_tTuK0km6fJWdqHQf19Sc_YHavt83a3_QJFIyqZ priority: 102 providerName: Unpaywall |
| Title | Redundancy in distributed proofs |
| URI | https://link.springer.com/article/10.1007/s00446-020-00386-z https://www.proquest.com/docview/2506672659 https://www.proquest.com/docview/2591226459 https://inria.hal.science/hal-03871467 https://pubmed.ncbi.nlm.nih.gov/PMC8550167 https://link.springer.com/content/pdf/10.1007/s00446-020-00386-z.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 34 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1432-0452 dateEnd: 20241101 omitProxy: true ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: ABDBF dateStart: 20030901 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1432-0452 dateEnd: 20241101 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: ADMLS dateStart: 19860101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: AFBBN dateStart: 19970201 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1432-0452 dateEnd: 20241101 omitProxy: true ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: BENPR dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1432-0452 dateEnd: 20241101 omitProxy: true ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: 8FG dateStart: 20000701 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9swDCaa5LDtsHcxb13gDbutwmLJpu1DUXhB0mCPoCgWoD0ZkiWhBQIn7ZIV7a-f6Npus0Owiw8SDVmkREom-RHgk45TU2i0rAi5ZGGgnR5UQjGBcWGjxCJyyh3-OcXJLPx2Gp3uwLTJhaGwykYnVopaLwr6R_7FmWrEmGOUHi4vGVWNIu9qU0JD1qUV9EEFMdaBHidkrC70vo6mxyetbhZB5f-kmvSMx_GgTqOpkukq3yaj6xS5y5DdbpiqzjkFSj44hf4bQ9k6Up_Ao3W5lDfXcj5_YKvGz-Fpfcj0s7tV8QJ2TPkSnjUFHPx6P78C_8RQEhkpWP-i9DWB6FL9K6N99wXOPL6G2Xj0azhhdckEx-skWrEkMlZFsTP6RvLQRANjRaikkNYKdzIyIqAcK2FTgcokhqN0V0KjVOS6Hf1A7EK3XJTmDfhaYiIRTRIgD3WYSiUtSifDcFAIKbUHQcOdvKjxxKmsxTxvkZArjuaOo3nF0fzWg8_tO8s7NI2t1B8d01tCAsKeZD9yaiOnO-n4P4EHe41M8nr7_c7vF4sHH9put3HIGyJLs1gTTRpQFjHRxBuy3Bhxs6e8OK8guAkGLsDYg_1G6veDb5vQfrsy_mP-b7dP7R085hRgU4UR7UF3dbU2790JaaX60EnGR33oZUdn30f9ehO41iEO3XPGM9c2mx5nZ38BCRYRBw |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR3LbtQwcNTHoXDgjQgUCAhONGJjO05yqFCBVlu6XaGqlXozduyolVbZhe5StR_HtzHjOmmXw4pLr_EktmfGM57MC-CdzUtXWVknlWA6EalFOWi4SbjMqzoraikZ5Q7vD2X_SHw7zo6X4E-bC0Nhla1M9ILajiv6R_4RVbWUOZNZ-WnyM6GuUeRdbVto6NBawW76EmMhsWPPXZyjCXe2ufsV6f2esZ3twy_9JHQZwOUV2TQpMlebLEc96TQTLuu5mgujua5rjpcJx1NKS-J1yaVxhWNSoxXljMlwGOF7HL-7DKuCixKNv9XP28PvB50u4Kn3tyLbIz_meS-k7fjkPe9LTch8I_ecTC7nVOPyCQVm3rj1_huz2Tlu78LarJnoi3M9Gt3QjTsP4F641MZbV1z4EJZc8wjutw0j4iA_HkN84ChpjQR6fNrElor2Ur8tZ2NcAarjJ3B0K8h7CivNuHHPILZaFlpKV6SSCStKbXQtNfKM6FVcaxtB2mJHVaF-ObXRGKmu8rLHqEKMKo9RdRnBh-6dyVX1joXQbxHpHSAV3u5vDRQ9Iyc_6ZTfaQTrLU1UOO5n6po5I3jTDeNBJe-Lbtx4RjBlSlnLBJPP0XJuxvmR5vTEl_ymsnOpzCPYaKl-PfmiDW10nPEf-3--eGuvYa1_uD9Qg93h3gu4wyi4x4cwrcPK9NfMvcTb2dS8Ckcghh-3fer-AimGR6k |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR3LbtQwcNQWiceBNyKlQEBwolE3dmInB4QqyrKlpUKISr0ZO7bVSqvsQndbtZ_Wr-uMN0m7HFZceo0nsT1PO_MCeGdl6SorfFJlTCdZalEPGm4SLmTl88ILwSh3-PueGOxn3w7ygyW4aHNhKKyy1YlBUdtRRf_IN9BUCyGZyMsN34RF_Njqfxr_SaiDFHla23YaMxbZcWeneH07_ri9hbR-z1j_y6_Pg6TpMIBLK_JJUuTOm1yijXSaZS7vOc8zo7n2nuNBwvGUUpK4L7kwrnBMaLxBOWNyHEb4HsfvLsMtSVXcKUu9_7WzAjwNnlZkeOREKXtNwk5I2wte1IQubuSYE8n5nFFcPqSQzGvn3X-jNTuX7T24M63H-uxUD4fXrGL_IdxvjrPx5oz_HsGSqx_Dg7ZVRNxojicQ_3SUrkaqPD6qY0vleqnTlrMxrgAN8VPYvxHUPYOVelS75xBbLQothCtSwTKbldpoLzRyS9aruNY2grTFjqqayuXUQGOouprLAaMKMaoCRtV5BB-6d8azuh0Lod8i0jtAKrk92NxV9Izc-2RNTtII1lqaqEbQj9UVW0bwphtGESW_i67daEowZUr5ygQj52g5N-P8SH10GIp9U8G5VMgI1luqX02-aEPrHWf8x_5XF2_tNdxGWVO723s7L-Auo6ieELu0BiuTv1P3Eo9lE_Mq8H8Mv29a4C4BHRBFQw |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9NADLe27gF4YHxNBAYKiDeWrrlLnPSxAqYKwYQQlcZTdJfzaRNVVrF0iP712GkS1glNIF5jJxff-c4-2f4Z4JXLxlQ69FGZKBMlseNz0GobacxKn-YeUUnt8MdjnM6S9yfpyRa87Wphmmz3LiS5rmkQlKaqPlw4f9gXvjVxyEiuPhLawmg1ZPI27GDKHvkAdmbHnyZfm-xFviSprOkZx56BigRBvK2d-fOHNuzT9qlkR15xPa8nTvbR0ztwa1ktzM8fZj6_YqCOdoE60dZ5Kd-Gy9oOy9U11Mf_lf0e3G092HCyVrn7sEXVA9jtukOE7WHxEMLPJBVqcnqHZ1XoBKFXmmuRC_kf2fY-gtnRuy9vplHbj4EXMk_rKE_J2zRjj4KMSigdkdeJNdp4r3lyScdSwKX9WKOlnBQavm-StSmTmX-k92BQnVf0GEJnMDeIlMeoEpeMjTUeDStIMiq1MS6AuFuFomzByqVnxrzoYZabaSh4GopmGopVAK_7dxZrqI4buV_y4vaMgrI9nXwo5JlE9MWAXMYB7HdrX7R7-6JgpxExU6xqAbzoybwrJdRiKjpfCs84lhJl4ck2dGZjxE1KdXba4HsLxlyMWQAHnTL8HvwmgQ56DfwL-Z_8G_tTuK0km6fJWdqHQf19Sc_YHavt83a3_QJFIyqZ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Redundancy+in+distributed+proofs&rft.jtitle=Distributed+computing&rft.au=Feuilloley+Laurent&rft.au=Fraigniaud+Pierre&rft.au=Hirvonen+Juho&rft.au=Paz+Ami&rft.date=2021-04-01&rft.pub=Springer+Nature+B.V&rft.issn=0178-2770&rft.eissn=1432-0452&rft.volume=34&rft.issue=2&rft.spage=113&rft.epage=132&rft_id=info:doi/10.1007%2Fs00446-020-00386-z&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon |