Payas Rajan
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 |
|---|---|---|
| Supercharged Dijkstra’s: Computing ‘shortest’ paths on large road... | !!Con 2020 | 2020-05-26 |
Claims a working Contraction Hierarchies implementation in Rust that answers shortest‑path queries on real road graphs (≈300,000 nodes, 800,000 edges)… | ||
| nothing matches | ||