Lukas Bergdoll
where else to find them
github:Voultapher
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
- Andrei Alexandrescu27 talks
- Björn Fahller31 talks
- Pascal Hertleif5 talks
- Eduardo Madrid10 talks
- Danila Kutenin2 talks
- Christopher Fretz4 talks
| title | conference | date |
|---|---|---|
| Optimising stable sort in Rust and mostly failing | EuroRust 2022 | 2022-10-13 |
Porting a promising C sort (fluxsort) to Rust yields a concrete story: a copied slice::sort implementation, a battery of tests and Criterion benchmarks with… | ||
| Is std::function really the best we can do? | Meeting C++ 2017 | 2017-11-09 |
Argues that std::function carries predictable runtime and memory overhead and that replacing it with template-based delegates and small-object in-place… | ||
| Web | C++ | CppCon 2017 | 2017-09-24 |
Small voting webservice is implemented with WebSockets and FlatBuffers, showing end-to-end code and benchmarks: uWebSockets: ~2 MB memory for 10,000 concurrent… | ||
| Web | C++ | CppCon 2017 | 2017-09-24 |
Compares three C++ WebSocket stacks by building a working straw‑poll service that uses FlatBuffers for zero‑copy messages and a static HTML/JS client; measures… | ||
| nothing matches | ||