Estimating the Longest Increasing Subsequence in Nearly Optimal Time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein 0001. Estimating the Longest Increasing Subsequence in Nearly Optimal Time. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022. pages 708-719, IEEE, 2022. [doi]

This author has not been identified. Look up 'Alexandr Andoni' in GoogleThis author has not been identified. Look up 'Negev Shekel Nosatzki' in GoogleThis author has not been identified. Look up 'Sandip Sinha' in GoogleThis author has not been identified. Look up 'Clifford Stein 0001' in Google

runs on WebDSL