Saeed Seddighin
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- François Le Gallonce
- Masoud Seddighinonce
who talks about the same things
- François Le Gall4 talks
- Nithin Varma3 talks
- Sofya Raskhodnikova7 talks
- Suhail Sherif3 talks
- Sepehr Assadi9 talks
- Amin Saberi6 talks
| title | conference | date |
|---|---|---|
| 3 + ε Approximation of Tree Edit Distance in Truly Subquadratic Time | ITCS 2022 | 2022-01-31 |
Proves a 3 + ε approximation for tree edit distance running in truly subquadratic time (about n^1.99). Converts rooted trees to strings via parenthesis… | ||
| Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems | ITCS 2022 | 2022-01-31 |
Presents quantum algorithms for longest palindromic substring and longest common substring with concrete bounds: LPS solved in sqrt(n) time (with matching… | ||
| nothing matches | ||