Coarse-Grained Complexity for Dynamic Algorithms

DOI10.1137/1.9781611975994.29MaRDI QIDQ5146795zbMATH OpenOpenAlexFDO

Authors Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.00336

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
• Dynamic Complexity under Definable Changes

This page was built for publication: Coarse-Grained Complexity for Dynamic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146795)