Rathish Das
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
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Approximation hardness and online algorithms for resource scheduling | Managing Parallelism 2025 | 2025-10-20 |
Proves concrete hardness: a gap-preserving reduction shows no (3/2 − ε)-approximation for makespan under integer resource demands unless P=NP, and the natural… | ||
| nothing matches | ||