Nicholas Ormrod
where else to find them
what they talk about
where they keep going back
- CppCon2 editions2016–2017
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Fantastic Algorithms and Where To Find Them | Meeting C++ 2017 | 2017-11-09 |
Describes concrete algorithms and what they actually guarantee: heavy hitters (Boyer‑Moore style) flags every key above an x% threshold with a single pass but… | ||
| Fantastic Algorithms and Where To Find Them | CppCon 2017 | 2017-09-24 |
Describes concrete, deployable techniques: Boyer-Moore majority and its 1/k generalization for heavy hitters used to throttle DOSy callers (variant run per… | ||
| The strange details of std::string at Facebook | CppCon 2016 | 2016-09-18 |
Shows concrete internals: GCC 4 uses a 25-byte global empty string plus copy-on-write with refcount-minus-one, while Facebook's fbstring uses a 24-byte struct… | ||
| nothing matches | ||