Lower Bounds for Semi-adaptive Data Structures via Corruption

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10421924" target="_blank" >RIV/00216208:11320/20:10421924 - isvavai.cz</a>

Result on the web

<a href="https://drops.dagstuhl.de/opus/volltexte/2020/13261/" target="_blank" >https://drops.dagstuhl.de/opus/volltexte/2020/13261/</a>

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Lower Bounds for Semi-adaptive Data Structures via Corruption

Original language description

We generalized a result of Ko and Weinstein [FOCS, 2020]. We proved that query time of any dynamic semi-adaptive data structure computing a function f is bounded by the corruption bound of f, provided that the data structure has sufficiently small update time.

Czech name

—

Czech description

—

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)

Project

<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>

Continuities

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

Publication year

2020

Confidentiality

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

Article name in the collection

40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)

ISBN

978-3-95977-174-0

ISSN

1868-8969

e-ISSN

—

Number of pages

15

Pages from-to

1-15

Publisher name

Schloss Dagstuhl-Leibniz-Zentrum für Informatik

Place of publication

Dagstuhl, Německo

Event location

Goa, Indie

Event date

Dec 14, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—