1@techreport{Adams-TR92,author="Stephen Adams", 2title="Implementing Sets Efficiently in a Functional Language", 3institution="University of Southampton, Department of Electronics and Computer Science",number="CSTR 92-10",year=1992} 4 5@article{Adams-JFP93, 6 author = {Stephen Adams}, 7 title = {Efficient Sets - {A} Balancing Act}, 8 journal = {J. Funct. Program.}, 9 volume = {3}, 10 number = {4}, 11 pages = {553--561}, 12 year = {1993} 13} 14 15@inproceedings{Andersson-WADS93,author={Arne Andersson}, 16title={Balanced search trees made simple},pages={60--71},year=1993, 17booktitle={Algorithms and Data Structures (WADS '93)}, 18series={LNCS},volume={709},publisher={Springer}} 19 20@inproceedings{BlellochFS-SPAA16, 21 author = {Guy E. Blelloch and 22 Daniel Ferizovic and 23 Yihan Sun}, 24 title = {Just Join for Parallel Ordered Sets}, 25 booktitle = {{SPAA}}, 26 pages = {253--264}, 27 publisher = {{ACM}}, 28 year = {2016} 29} 30 31@phdthesis{Crane72,author={Clark A. Crane}, 32title={Linear Lists and Prorty Queues as Balanced Binary Trees}, 33school={Computer Science Department, Stanford University},year=1972} 34 35@article{Hinze-bro12,author={Ralf Hinze}, 36title={Purely Functional 1-2 Brother Trees}, 37journal={J. Functional Programming}, 38volume=19,number={6},pages={633--644},year=2009} 39 40@article{HoffmannOD-TOPLAS82, 41author={Christoph M. Hoffmann and Michael J. O'Donnell}, 42title={Programming with Equations},journal={{ACM} Trans. Program. Lang. Syst.}, 43volume=4,number=1,pages={83--112},year=1982}} 44 45@article{Kahrs-JFP01,author={Stefan Kahrs},title={Red-Black Trees with Types}, 46journal={J. Functional Programming},volume=11,number=4,pages={425-432},year=2001} 47 48@misc{Kahrs-html,author={Stefan Kahrs},title={Red Black Trees}, 49note={\url{http://www.cs.ukc.ac.uk/people/staff/smk/redblack/rb.html}}} 50 51@unpublished{Nipkow16,author={Tobias Nipkow}, 52title={Automatic Functional Correctness Proofs for Functional Search Trees}, 53year=2016,month=feb,note={\url{http://www.in.tum.de/~nipkow/pubs/trees.html}}} 54 55@inproceedings{NunezPP95, 56 author = {Manuel N{\'{u}}{\~{n}}ez and 57 Pedro Palao and 58 Ricardo Pena}, 59 title = {A Second Year Course on Data Structures Based on Functional Programming}, 60 booktitle = {Functional Programming Languages in Education}, 61 pages = {65--84}, 62 year = {1995}, 63 editor = {Pieter H. Hartel and 64 Marinus J. Plasmeijer}, 65 series = {LNCS}, 66 volume = {1022}, 67 publisher = {Springer}, 68 year = {1995}, 69} 70 71 72@book{Okasaki,author={Chris Okasaki},title="Purely Functional Data Structures", 73publisher="Cambridge University Press",year=1998} 74 75@article{OttmannS76,author={Thomas Ottmann and Hans-Werner Six}, 76title={Eine neue {K}lasse von ausgeglichenen {B}in\"arb\"aumen}, 77journal={Angewandte Informatik},volume=18,number=9,pages={395--400},year=1976} 78 79@article{OttmannW-CJ80,author={Thomas Ottmann and Derick Wood}, 80title={1-2 Brother Trees or {AVL} Trees Revisited},journal={Comput. J.}, 81volume=23,number=3,pages={248--255},year=1980} 82 83@inproceedings{Ragde14,author={Prabhakar Ragde}, 84title={Simple Balanced Binary Search Trees},pages={78--87},year=2014, 85booktitle={Trends in Functional Programming in Education}, 86series={EPTCS},volume=170,editor={Caldwell and H\"olzenspies and Achten}} 87 88@article{Reade-SCP92,author={Chris Reade}, 89title={Balanced Trees with Removals: An Exercise in Rewriting and Proof}, 90journal={Sci. Comput. Program.},volume=18,number=2,pages={181--204},year=1992} 91 92@article{Schoenmakers-IPL93,author="Berry Schoenmakers", 93title="A Systematic Analysis of Splaying",journal={Information Processing Letters},volume=45,pages={41-50},year=1993} 94 95@article{SleatorT-JACM85,author={Daniel D. Sleator and Robert E. Tarjan}, 96title={Self-adjusting Binary Search Trees},journal={J. ACM}, 97volume=32,number=3,pages={652-686},year=1985} 98 99@misc{Turbak230,author={Franklyn Turbak}, 100title={{CS230 Handouts --- Spring 2007}},year=2007, 101note={\url{http://cs.wellesley.edu/~cs230/spring07/handouts.html}}} 102