Author:
Mitzenmacher Michael,Seddighin Saeed
Publisher
Society for Industrial and Applied Mathematics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Streaming and Query Once Space Complexity of Longest Increasing Subsequence;Lecture Notes in Computer Science;2023-12-09
2. Estimating the Longest Increasing Subsequence in Nearly Optimal Time;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Improved dynamic algorithms for longest increasing subsequence;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15