Pages that link to "Item:Q5737810"
From MaRDI portal
The following pages link to Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810):
Displaying 9 items.
- On the monotonicity of a data stream (Q1677498) (← links)
- Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- Erasure-Resilient Property Testing (Q4608990) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- Improved algorithm for permutation testing (Q6138826) (← links)
- Strongly sublinear algorithms for testing pattern freeness (Q6566461) (← links)
- Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)
