Dynamic complexity-Reference-Cited by-同舟云学术

Dynamic complexity

Published:2016-05-31 Issue:2 Volume:3 Page:30-52
ISSN:2372-3491
Container-title:ACM SIGLOG News
language:en
Short-container-title:ACM SIGLOG News

Author:

Schwentick Thomas¹,Zeume Thomas¹

Affiliation:

1. TU Dortmund University

Abstract

In many data management scenarios the data is subject to frequent modifications, and it is often essential to react to those changes quickly. When a train is canceled on short notice, travelers need to find alternative connections as fast as possible. When a web server is temporarily not available, data packages have to be rerouted immediately.

Funder

DFG

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/2948896.2948899

Reference38 articles.

1. Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach. Cambridge University Press. Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach . Cambridge University Press.

2. On uniformity within NC1

3. Lower bounds for constant-depth circuits in the presence of help bits

4. A taxonomy of problems with fast parallel algorithms

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dynamic Complexity of Parity Exists Queries;Logical Methods in Computer Science;2021-11-16

2. Work-sensitive Dynamic Complexity of Formal Languages;Lecture Notes in Computer Science;2021

3. Maintaining Triangle Queries under Updates;ACM Transactions on Database Systems;2020-09-25

4. Dynamic Complexity under Definable Changes;ACM Transactions on Database Systems;2018-11-26

5. Reachability Is in DynFO;Journal of the ACM;2018-09-18