References

1. A. Aho, J. Hopcroft & J. Ullman (1974): The Design And Analysis of Computer Programs. Addison-Wesley.
2. A. Andersson (1993): Balanced search trees made simple. In: Proceedings of the 3rd Workshop on Algorithms and Data Structures. Springer Verlag, pp. 60–71, doi:10.1007/3-540-57155-8_236.
3. W. Braun & M. Rem (1983): A logarithmic implementation of flexible arrays. Technical Report MR83/4. Eindhoven Institute of Technology.
4. (2014): Data.Set.RBTree. Available at http://hackage.haskell.org/package/llrbtree-0.1.1/docs/src/Data-Set-RBTree.html.
5. L. J. Guibas & R. Sedgewick (1978): A dichromatic framework for balanced trees. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science. IEEE, pp. 8–21, doi:10.1109/SFCS.1978.3.
6. (2014): Haskell. Available at http://www.haskell.org.
7. S. Kahrs (2001): Red-black trees with types. Journal of Functional Programming 11(4), doi:10.1017/S0956796801004026.
8. S. Kahrs (2014): Untyped red-black trees. Available at http://www.cs.kent.ac.uk/people/staff/smk/redblack/Untyped.hs.
9. M. Might (2014): Deletion from red-black trees: the missing method. Available at http://matt.might.net/articles/red-black-delete/.
10. C. Okasaki (1999): Red-black trees in a functional setting. Journal of Functional Programming 9(4), doi:10.1017/S0956796899003494.
11. (2014): Racket. Available at http://www.racket-lang.org.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org