An intro to data structures with locality of reference-type features

32 points by knowledgesale 11 years ago | 4 comments

agumonkey 11 years ago |

Any Demaine specific lecture is worth watching.

benou 11 years ago |

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

amelius 11 years ago |

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

kzrdude 11 years ago | |

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