References
    
      - [abrahams97exception] Dave Abrahams,
      STL Exception Handling Contract, 
      http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf
- [alexandrescu01modern] Andrei
      Alexandrescu, Modern C++ Design: Generic Programming and
      Design Patterns Applied, Addison-Wesley Publishing
      Company, 2001
- [andrew04mtf]
      K. Andrew and D. Gleich, "MTF, Bit, and COMB: A Guide to
      Deterministic and Randomized Algorithms for the List Update
      Problem"
- [austern00noset] Matthew Austern, "Why
      You shouldn't use set - and What You Should Use
      Instead", C++ Report, April, 2000
- [austern01htprop] Matthew Austern, "A
      Proposal to Add Hashtables to the Standard Library", 
      http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html
- [austern98segmented] Matthew Austern,
      "Segmented iterators and hierarchical algorithms", Generic
      Programming, April 1998, pp. 80-90
- [boost_timer],
      "Boost timer library", http://www.boost.org by Beman
      Dawes
- [boost_pool],
      "Boost pool library", http://www.boost.org by Stephen
      Cleary
- [boost_type_traits], "Boost
      type_traits library", http://www.boost.org by John
      Maddock, Steve Cleary, et. al.
- [brodal96priority] Gerth Stolting
      Brodal, Worst-case
      efficient priority queues
- [bulka99efficient] D. Bulka, and D.
      Mayhew, "Efficient C++ Programming Techniques.",
      Addison-Wesley Publishing Company, Addison-Wesley, 1997
- [clrs2001] T. H.
      Cormen, C. E., Leiserson, R. L. Rivest, C. and Stein,
      "Introduction to Algorithms, 2nd ed.", MIT Press, 2001
- [dinkumware_stl], "Dinkumware C++ Library
      Reference", http://www.dinkumware.com/htm_cpl/index.html
- [dubhashi98neg] D. Dubashi, and D. Ranjan,
      "Balls and bins: A study in negative dependence.", Random
      Structures and Algorithms 13, 2 (1998), 99-124
- [fagin79extendible] R. Fagin, J.
      Nievergelt, N. Pippenger, and H. R. Strong, "Extendible
      hashing - a fast access method for dynamic files", ACM Trans.
      Database Syst. 4, 3 (1979), 315-344
- [filliatre2000ptset], J. C.
      Filliatre, "Ptset: Sets of integers implemented as Patricia
      trees", http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml
- [fredman86pairing], M. L. Fredman, R
      Sedgewick, D. D. Sleator, R. E. Tarjan, The
      pairing heap: a new form of self-adjusting heap
- [gamma95designpatterns] E. Gamma,
      R. Helm, R. Johnson, and J. Vlissides, "Design Patterns -
      Elements of Reusable Object-Oriented Software",
      Addison-Wesley Publishing Company, Addison-Wesley, 1995
- [garg86order]
      A. K. Garg and C. C. Gotlieb, "Order-preserving key
      transformations", Trans. Database Syst. 11, 2 (1986),
      213-234
- [hyslop02making] J. Hyslop, and H.
      Sutter, "Making a real hash of things", C++ Report, May
      2002
- [jossutis01stl] N. M. Jossutis, "The C++
      Standard Library - A Tutorial and Reference", Addison-Wesley
      Publishing Company, Addison-Wesley, 2001
- [kt99fat_heas] Haim Kaplan and Robert E.
      Tarjan, New
      Heap Data Structures
- [kleft00sets]
      Klaus Kleft and Angelika Langer, "Are Set Iterators Mutable
      or Immutable?", C/C++ Users Jornal, October 2000
- [knuth98sorting] D. E. Knuth, "The Art of
      Computer Programming - Sorting and Searching", Addison-Wesley
      Publishing Company, Addison-Wesley, 1998
- [liskov98data] B. Liskov, "Data abstraction
      and hierarchy", SIGPLAN Notices 23, 5 (May 1998)
- [litwin80lh] W.
      Litwin, "Linear hashing: A new tool for file and table
      addressing", Proceedings of International Conference on Very
      Large Data Bases (June 1980), pp. 212-223
- [maverik_lowerbounds] Maverik Woo,
      
      Deamortization - Part 2: Binomial Heaps
- [metrowerks_stl], "Metrowerks CodeWarrior
      Pro 7 MSL C++ Reference Manual",
- [meyers96more] S. Meyers, "More Effective
      C++: 35 New Ways to Improve Your Programs and Designs - 2nd
      ed.", Addison-Wesley Publishing Company, Addison-Wesley,
      1996
- [meyers00nonmember] S. Meyers, "How
      Non-Member Functions Improve Encapsulation", C/C++ Users
      Journal, 2000
- [meyers01stl]
      S. Meyers, "Effective STL: 50 Specific Ways to Improve Your
      Use of the Standard Template Library", Addison-Wesley
      Publishing Company, Addison-Wesley, 2001
- [meyers02both] S. Meyers, "Class Template,
      Member Template - or Both?", C/C++ Users Journal, 2003
- [motwani95random] R. Motwani, and P.
      Raghavan, "Randomized Algorithms", Cambridge University
      Press
- [mscom] COM: Component Model Object
      Technologies
- [musser95rationale], David R. Musser,
      "Rationale for Adding Hash Tables to the C++ Standard
      Template Library"
- [musser96stltutorial] D. R. Musser
      and A. Saini, "STL Tutorial and Reference Guide",
      Addison-Wesley Publishing Company, Addison-Wesley, 1996
- [nelson96stlpql] Mark Nelson, Priority
      Queues and the STL, Dr. Dobbs Journal, January, 1996
- [okasaki98mereable] C. Okasaki and A.
      Gill, "Fast mergeable integer maps", In Workshop on ML, pages
      77--86, September 1998. 95
- [sgi_stl] SGI,
      "Standard Template Library Programmer's Guide", http://www.sgi.com/tech/stl
- [select_man]
      select
      man page.
- [sleator84amortized] D. D. Sleator
      and R. E. Tarjan, "Amortized Efficiency of List Update
      Problems", ACM Symposium on Theory of Computing, 1984
- [sleator85self] D. D. Sleator and R. E.
      Tarjan, "Self-Adjusting Binary Search Trees", ACM Symposium
      on Theory of Computing, 1985
- [stepanov94standard] A. A. Stepanov
      and M. Lee", "The Standard Template Library"
- [stroustrup97cpp] Bjarne Stroustrup,
      The C++ Programming Langugage -3rd ed., Addison-Wesley
      Publishing Company,Reading, MA, USA, 1997
- [vandevoorde2002cpptemplates]
      D. Vandevoorde, and N. M. Josuttis, "C++ Templates: The
      Complete Guide", Addison-Wesley Publishing Company,
      Addison-Wesley, 2002
- [wickland96thirty] C. A. Wickland,
      "Thirty Years Among the Dead", National Psychological
      Institute, Los Angeles, 1996,http://myweb.wvnet.edu/gsa00121/books/amongdead30.zip