![[ICO]](/icons/blank.gif){kind=icon}
![[PARENTDIR]](/icons/back.gif){kind=icon}
![[ ]](/icons/layout.gif){kind=icon}
![[ ]](/icons/unknown.gif){kind=icon}
| Name | Last modified | Size | Description |
|---|---|---|---|---|
| Parent Directory | - | ||
| space efficient algorithm for longest increasing subsequence.pdf | 2025-03-10 21:45 | 581K | |
| 20250319_leesh.pptx | 2025-03-19 14:20 | 539K | |
| A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem.pdf | 1980-01-01 00:00 | 175K | |
| 20250319_cheyis.pptx | 2025-03-19 16:00 | 110K | |
| A fast algorithm for computing a longest common increasing subsequence.pdf | 2025-02-19 19:04 | 95K | |
| 20250318_chenyl.pptx | 2025-03-19 16:13 | 75K | |