Pages that link to "Item:Q1987516"
From MaRDI portal
The following pages link to Space-efficient algorithms for longest increasing subsequence (Q1987516):
Displaying 5 items.
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
- Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)