Jakub Beránek
where else to find them
what they talk about
- rust1
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 |
|---|---|---|
| CPU design effects | Meeting C++ 2019 | 2019-11-14 |
Examples identify concrete costs and fixes: a filter loop runs >2× faster on sorted data because branch mispredictions drop (about 100M vs 400k branch-misses… | ||
| nothing matches | ||