All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Brief Announcement: Decreasing Verification Radius in Local Certification

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00377666" target="_blank" >RIV/68407700:21240/24:00377666 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.4230/LIPIcs.DISC.2024.49" target="_blank" >https://doi.org/10.4230/LIPIcs.DISC.2024.49</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/LIPIcs.DISC.2024.49" target="_blank" >10.4230/LIPIcs.DISC.2024.49</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Brief Announcement: Decreasing Verification Radius in Local Certification

  • Original language description

    This paper deals with local certification, specifically locally checkable proofs: given a graph property, the task is to certify whether a graph satisfies the property. The verification of this certification needs to be done locally without the knowledge of the whole graph. We examine the trade-off between the visibility radius and the size of certificates. We describe a procedure that decreases the radius by encoding the neighbourhood of each vertex into its certificate. We also provide a corresponding lower bound on the required certificate size increase, showing that such an approach is close to optimal.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA24-12046S" target="_blank" >GA24-12046S: Computing and Approximating Equilibria in Games With Complex Strategy Spaces</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    38th International Symposium on Distributed Computing (DISC 2024)

  • ISBN

    978-3-95977-352-2

  • ISSN

    1868-8969

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    "49:1"-"49:6"

  • Publisher name

    Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

  • Place of publication

    Dagstuhl

  • Event location

    Madrid

  • Event date

    Oct 28, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article