4 ms·
An intro to data structures with locality of reference-type features
- agumonkey 12y agoLink to the course mentioned at the bottom https://www.youtube.com/watch?v=-sEdiFMntMA&list=PLFDnELG9dpVxEpbyL53CYebmLI58qJhlt https://www.youtube.com/watch?v=-sEdiFMntMA&list=PLFDnELG9dp... http://courses.csail.mit.edu/6.851/spring14/lectures/ http://courses.csail.mit.edu/6.851/spring14/lectures/ http://courses.csail.mit.edu/6.851/spring12/ http://courses.csail.mit.edu/6.851/spring12/ Any Demaine specific lecture is worth watching.
- amelius 12y agoNice article, but why refer to a set as {n}? Mathematicians read this as a set containing one element, n.
- kzrdude 12y agoI thought mathematicians defined notation to mean whatever they wanted or needed for a particular text.
- benou 12y agoRegarding LPM for IP forwarding, there are similar high performance data structures: Luleå algorithm https://en.wikipedia.org/wiki/Lule%C3%A5_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 http://epubl.ltu.se/1402-1544/2007/15/LTU-DT-0715-SE.pdf