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

Link to the course mentioned at the bottom <a href="https://www.youtube.com/watch?v=-sEdiFMntMA&amp;list=PLFDnELG9dpVxEpbyL53CYebmLI58qJhlt" rel="nofollow">https:&#x2F;&#x2F;www.youtube.com&#x2F;watch?v=-sEdiFMntMA&amp;list=PLFDnELG9dp...</a><p><a href="http://courses.csail.mit.edu/6.851/spring14/lectures/" rel="nofollow">http:&#x2F;&#x2F;courses.csail.mit.edu&#x2F;6.851&#x2F;spring14&#x2F;lectures&#x2F;</a> <a href="http://courses.csail.mit.edu/6.851/spring12/" rel="nofollow">http:&#x2F;&#x2F;courses.csail.mit.edu&#x2F;6.851&#x2F;spring12&#x2F;</a><p>Any Demaine specific lecture is worth watching.

Regarding LPM for IP forwarding, there are similar high performance data structures: Luleå algorithm <a href="https://en.wikipedia.org/wiki/Lule%C3%A5_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Lule%C3%A5_algorithm</a> or hybrid trees <a href="http://epubl.ltu.se/1402-1544/2007/15/LTU-DT-0715-SE.pdf" rel="nofollow">http:&#x2F;&#x2F;epubl.ltu.se&#x2F;1402-1544&#x2F;2007&#x2F;15&#x2F;LTU-DT-0715-SE.pdf</a>

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