[lisp-interface-library-devel] requested urls for bibliography

Dan Lentz danlentz at gmail.com
Wed Oct 31 14:12:41 UTC 2012


I used the following references as the basis for implementation of the The
wb and rb trees:

* Implementing Sets Efficiently in a Functional
Language<http://www.google.com/url?sa=t&rct=j&q=implementing%20sets%20efficiently%20in%20a%20functional&source=web&cd=1&ved=0CCEQFjAA&url=http%3A%2F%2Fgroups.csail.mit.edu%2Fmac%2Fusers%2Fadams%2FBB%2F92-10.ps&ei=USyRUO6UBqS00QHp-4HgCA&usg=AFQjCNHX6Xr1MTYSD2wKv6RWJqjcHdwuJw&sig2=fyBudmQYTWdUydEGZQX7Ag>
* Balancing weight-balanced
trees<http://www.google.com/url?sa=t&rct=j&q=weight%20balancing%20tree&source=web&cd=3&ved=0CD0QFjAC&url=http%3A%2F%2Fhagi.is.s.u-tokyo.ac.jp%2F~yh%2Fbst.pdf&ei=oi2RUOb5Hu7W0gGzgYHABA&usg=AFQjCNGv8Su2vlrCIqD2Rr-HjLxTzReLBg&sig2=MDdlqszo2IqDhJbvnehL9Q>
* Weight-Balanced Trees - MIT/GNU Scheme
9.1<http://www.gnu.org/software/mit-scheme/documentation/mit-scheme-ref/Weight_002dBalanced-Trees.html>
* kazu-yamamoto wttree <https://github.com/kazu-yamamoto/wttree>

(and to a much lesser extent) a little bit of general background from

* Making Data Structures Persistent* - CMU School of Computer
...<http://www.google.com/url?sa=t&rct=j&q=making%20data%20structures%20persistent&source=web&cd=1&ved=0CCEQFjAA&url=http%3A%2F%2Fwww.cs.cmu.edu%2F~sleator%2Fpapers%2Fmaking-data-structures-persistent.pdf&ei=6C-RUKfNA6nC0QGEjYFw&usg=AFQjCNGsl-xbpzX1UAwiBhapQ5EusOjAgw&sig2=67wXGRY3xVJpcf6CKII51g>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.common-lisp.net/pipermail/lisp-interface-library-devel/attachments/20121031/1b2b1576/attachment.html>


More information about the lisp-interface-library-devel mailing list