An intro to data structures with locality of reference-type features
1–5 of 5 posts
Re: An intro to data structures with locality of reference-type features
#2Link to the course mentioned at the bottom 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/spring12/
Any Demaine specific lecture is worth watching.
Re: An intro to data structures with locality of reference-type features
#3Nice article, but why refer to a set as {n}?
Mathematicians read this as a set containing one element, n.
Re: An intro to data structures with locality of reference-type features
#4Regarding 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
Re: An intro to data structures with locality of reference-type features
#5Nice 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.