@article{DBLP:journals/jacm/SleatorT85,
    author    = {Daniel Dominic Sleator and Robert Endre Tarjan},
	title     = {Self-Adjusting Binary Search Trees},
	journal   = {J. {ACM}},
	year      = {1985},
	volume    = {32},
	number    = {3},
	pages     = {652--686},
	url       = {http://doi.acm.org/10.1145/3828.3835},
	doi       = {10.1145/3828.3835},
	timestamp = {Thu, 25 Sep 2014 01:28:59 +0200},
	biburl    = {http://dblp.uni-trier.de/rec/bib/journals/jacm/SleatorT85},
	bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{DBLP:journals/siamcomp/ColeMSS00,
  author    = {Richard Cole and
               Bud Mishra and
               Jeanette P. Schmidt and
               Alan Siegel},
  title     = {On the Dynamic Finger Conjecture for Splay Trees. Part {I:} Splay
               Sorting log n-Block Sequences},
  journal   = {{SIAM} J. Comput.},
  year      = {2000},
  volume    = {30},
  number    = {1},
  pages     = {1--43},
  url       = {http://dx.doi.org/10.1137/S0097539797326988},
  doi       = {10.1137/S0097539797326988},
  timestamp = {Thu, 25 Sep 2014 03:16:19 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/ColeMSS00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{DBLP:journals/siamcomp/Cole00,
  author    = {Richard Cole},
  title     = {On the Dynamic Finger Conjecture for Splay Trees. Part {II:} The Proof},
  journal   = {{SIAM} J. Comput.},
  year      = {2000},
  volume    = {30},
  number    = {1},
  pages     = {44--85},
  url       = {http://dx.doi.org/10.1137/S009753979732699X},
  doi       = {10.1137/S009753979732699X},
  timestamp = {Thu, 25 Sep 2014 03:17:02 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/Cole00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{DBLP:conf/soda/Iacono01a,
  author    = {John Iacono},
  title     = {Alternatives to splay trees with O(log n) worst-case access times},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA.}},
  year      = {2001},
  pages     = {516--522},
  crossref  = {DBLP:conf/soda/2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365522},
  timestamp = {Thu, 25 Sep 2014 03:29:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/Iacono01a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2001,
  editor    = {S. Rao Kosaraju},
  title     = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  year      = {2001},
  publisher = {{ACM/SIAM}},
  url       = {http://dl.acm.org/citation.cfm?id=365411},
  isbn      = {0-89871-490-7},
  timestamp = {Thu, 25 Sep 2014 03:29:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{DBLP:conf/wads/DerryberryS09,
  author    = {Jonathan Derryberry and
               Daniel Dominic Sleator},
  title     = {Skip-Splay: Toward Achieving the Unified Bound in the {BST} Model},
  booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  year      = {2009},
  pages     = {194--205},
  crossref  = {DBLP:conf/wads/2009},
  url       = {http://dx.doi.org/10.1007/978-3-642-03367-4_18},
  doi       = {10.1007/978-3-642-03367-4_18},
  timestamp = {Thu, 25 Sep 2014 03:39:37 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wads/DerryberryS09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@proceedings{DBLP:conf/wads/2009,
  editor    = {Frank K. H. A. Dehne and
               Marina L. Gavrilova and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Csaba D. T{\'{o}}th},
  title     = {Algorithms and Data Structures, 11th International Symposium, {WADS}
               2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  year      = {2009},
  volume    = {5664},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-03367-4},
  doi       = {10.1007/978-3-642-03367-4},
  isbn      = {978-3-642-03366-7},
  timestamp = {Thu, 25 Sep 2014 03:39:37 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/wads/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@inproceedings{DBLP:conf/focs/DemaineHIP04,
  author    = {Erik D. Demaine and
               Dion Harmon and
               John Iacono and
               Mihai Patrascu},
  title     = {Dynamic Optimality - Almost},
  booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  year      = {2004},
  pages     = {484--490},
  crossref  = {DBLP:conf/focs/2004},
  url       = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.23},
  doi       = {10.1109/FOCS.2004.23},
  timestamp = {Thu, 25 Sep 2014 03:55:14 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/DemaineHIP04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@proceedings{DBLP:conf/focs/2004,
  title     = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  year      = {2004},
  publisher = {{IEEE} Computer Society},
  isbn      = {0-7695-2228-9},
  timestamp = {Thu, 25 Sep 2014 03:55:14 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/focs/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}