An intro to data structures with locality of reference-type features (opens in new tab)

(borzov.ca)

32 pointsknowledgesale11y ago4 comments

4 comments

Any Demaine specific lecture is worth watching.

Regarding LPM for IP forwarding, there are similar high performance data structures: Luleå algorithm https://en.wikipedia.org/wiki/Lule%C3%A5_algorithm or hybrid trees http://epubl.ltu.se/1402-1544/2007/15/LTU-DT-0715-SE.pdf

Nice article, but why refer to a set as {n}? Mathematicians read this as a set containing one element, n.

I thought mathematicians defined notation to mean whatever they wanted or needed for a particular text.

j / k navigate · click thread line to collapse

Any Demaine specific lecture is worth watching.

benou11y ago

Nice article, but why refer to a set as {n}? Mathematicians read this as a set containing one element, n.

I thought mathematicians defined notation to mean whatever they wanted or needed for a particular text.

j / k navigate · click thread line to collapse