Sebastian Wild
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Succinct Preferential Attachment Graphs | Managing Memory 2025 | 2025-09-29 |
Claims a static rooted binary tree topology encodes in 2n bits plus o(n) and supports constant‑time navigation and subtree queries by grouping nodes into… | ||
| Algorithmic ideas, engineering tricks, and trivia behind CPython's new sorting algorithm | PyCon US 2023 | 2023-04-19 |
Writing a sorting function is easy - coding a fast and reliable reference implementation less so. In this talk, I tell the story behind CPython's latest… | ||
| nothing matches | ||