Dynamic algorithms for LIS and distance to monotonicity

DOI10.1145/3357713.3384240OpenAlexW3034398078MaRDI QIDQ5144953

Saeed Seddighin, Michael Mitzenmacher

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3357713.3384240

zbMATH Keywords

dynamicsublinearLISdistance to monotonicity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems

This page was built for publication: Dynamic algorithms for LIS and distance to monotonicity