FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4301490786> ?p ?o ?g. }

• W4301490786 abstract "Distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of Boolean predicates on the structure of the network, or on data-structures distributed over the nodes (e.g., spanning trees or routing tables). We consider mechanisms consisting of two components: a emph{prover} assigning a emph{certificate} to each node, and a distributed algorithm called emph{verifier} that is in charge of verifying the distributed proof formed by the collection of all certificates. In this paper, 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 for establishing perfect tradeoffs between the emph{size of the certificate} stored at every node, and the emph{number of rounds} of the verification protocol. If we allow every node to communicate to distance at most $t$, one might expect that the certificate sizes can be reduced by a multiplicative factor of at least~$t$. In trees, cycles and grids, we show that such tradeoffs can be established for emph{all} network predicates, i.e., it is always possible to linearly decrease the certificate size. In arbitrary graphs, we show that any part of the certificates common to all nodes can be evenly redistributed among these nodes, achieving even a better tradeoff: this common part of the certificate can be reduced by the size of a smallest ball of radius $t$ in the network. In addition to these general results, we establish several upper and lower bounds on the certificate sizes used for distributed proofs for spanning trees, minimum-weight spanning trees, diameter, additive and multiplicative spanners, and more, improving and generalizing previous results from the literature." @default.
• W4301490786 created "2022-10-05" @default.
• W4301490786 creator A5001023694 @default.
• W4301490786 creator A5025101185 @default.
• W4301490786 creator A5071967017 @default.
• W4301490786 creator A5080881555 @default.
• W4301490786 creator A5090307195 @default.
• W4301490786 date "2018-03-08" @default.
• W4301490786 modified "2023-10-14" @default.
• W4301490786 title "Redundancy in Distributed Proofs" @default.
• W4301490786 doi "https://doi.org/10.48550/arxiv.1803.03031" @default.
• W4301490786 hasPublicationYear "2018" @default.
• W4301490786 type Work @default.
• W4301490786 citedByCount "0" @default.
• W4301490786 crossrefType "posted-content" @default.
• W4301490786 hasAuthorship W4301490786A5001023694 @default.
• W4301490786 hasAuthorship W4301490786A5025101185 @default.
• W4301490786 hasAuthorship W4301490786A5071967017 @default.
• W4301490786 hasAuthorship W4301490786A5080881555 @default.
• W4301490786 hasAuthorship W4301490786A5090307195 @default.
• W4301490786 hasBestOaLocation W43014907861 @default.
• W4301490786 hasConcept C108710211 @default.
• W4301490786 hasConcept C111919701 @default.
• W4301490786 hasConcept C11413529 @default.
• W4301490786 hasConcept C114614502 @default.
• W4301490786 hasConcept C118615104 @default.
• W4301490786 hasConcept C127413603 @default.
• W4301490786 hasConcept C152124472 @default.
• W4301490786 hasConcept C2524010 @default.
• W4301490786 hasConcept C33923547 @default.
• W4301490786 hasConcept C41008148 @default.
• W4301490786 hasConcept C55439883 @default.
• W4301490786 hasConcept C62611344 @default.
• W4301490786 hasConcept C66938386 @default.
• W4301490786 hasConcept C80444323 @default.
• W4301490786 hasConcept C96865113 @default.
• W4301490786 hasConceptScore W4301490786C108710211 @default.
• W4301490786 hasConceptScore W4301490786C111919701 @default.
• W4301490786 hasConceptScore W4301490786C11413529 @default.
• W4301490786 hasConceptScore W4301490786C114614502 @default.
• W4301490786 hasConceptScore W4301490786C118615104 @default.
• W4301490786 hasConceptScore W4301490786C127413603 @default.
• W4301490786 hasConceptScore W4301490786C152124472 @default.
• W4301490786 hasConceptScore W4301490786C2524010 @default.
• W4301490786 hasConceptScore W4301490786C33923547 @default.
• W4301490786 hasConceptScore W4301490786C41008148 @default.
• W4301490786 hasConceptScore W4301490786C55439883 @default.
• W4301490786 hasConceptScore W4301490786C62611344 @default.
• W4301490786 hasConceptScore W4301490786C66938386 @default.
• W4301490786 hasConceptScore W4301490786C80444323 @default.
• W4301490786 hasConceptScore W4301490786C96865113 @default.
• W4301490786 hasLocation W43014907861 @default.
• W4301490786 hasOpenAccess W4301490786 @default.
• W4301490786 hasPrimaryLocation W43014907861 @default.
• W4301490786 hasRelatedWork W1019628555 @default.
• W4301490786 hasRelatedWork W1997440650 @default.
• W4301490786 hasRelatedWork W2074425862 @default.
• W4301490786 hasRelatedWork W2081685448 @default.
• W4301490786 hasRelatedWork W2116536633 @default.
• W4301490786 hasRelatedWork W2293021588 @default.
• W4301490786 hasRelatedWork W2366475145 @default.
• W4301490786 hasRelatedWork W2950028700 @default.
• W4301490786 hasRelatedWork W3030842888 @default.
• W4301490786 hasRelatedWork W4301176064 @default.
• W4301490786 isParatext "false" @default.
• W4301490786 isRetracted "false" @default.
• W4301490786 workType "article" @default.