scientific article; zbMATH DE number 7788453

DOI10.5555/3458064.3458179MaRDI QIDQ6147371zbMATH OpenFDO

Authors Michael Mitzenmacher, S. Seddighin

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458179

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Strongly sublinear algorithms for testing pattern freeness
• Streaming and query once space complexity of longest increasing subsequence
• Approximation algorithms for LCS and LIS with truly improved running times
• New sublinear algorithms and lower bounds for LIS estimation
• Range counting oracles for geometric problems

This page was built for publication:

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