Estimating the longest increasing subsequence in nearly optimal time

DOI10.1109/FOCS54457.2022.00073MaRDI QIDQ6943019zbMATH OpenFDO

Authors Sandip Sinha, Negev Shekel Nosatzki, Clifford Stein, Alexandr Andoni

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS54457.2022.00073

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

This page was built for publication: Estimating the longest increasing subsequence in nearly optimal time

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