1 <!DOCTYPE HTML PUBLIC
"-//W3C//DTD HTML 4.0 Transitional//EN">
5 <title>References
</title>
8 <body bgcolor =
"white">
11 <li> [
<a name=
"abrahams97exception">abrahams97exception
</a>] Dave Abrahams,
12 STL Exception Handling Contract,
13 <a href=
"http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf">http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/
1997/N1075.pdf
</a>
15 <li> [
<a name =
"alexandrescu01modern">alexandrescu01modern
</a>] Andrei Alexandrescu,
<i>Modern C++ Design: Generic Programming and Design Patterns Applied
</i>, Addison-Wesley Publishing Company,
2001 </li>
17 <li> [
<a name =
"andrew04mtf">andrew04mtf
</a>] K. Andrew and D. Gleich,
"MTF, Bit, and COMB: A Guide to Deterministic and Randomized Algorithms for the List Update Problem"</li>
19 <li> [
<a name =
"austern00noset">austern00noset
</a>] Matthew Austern,
"Why You shouldn't use <tt>set</tt> - and What You Should Use Instead", C++ Report, April,
2000 </li>
21 <li> [
<a name =
"austern01htprop">austern01htprop
</a>] Matthew Austern,
"A Proposal to Add Hashtables to the Standard Library",
<a href=
"http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2001/n1326l.html">http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/
2001/n1326l.html
</a> </li>
23 <li> [
<a name =
"austern98segmented">austern98segmented
</a>] Matthew Austern,
"Segmented iterators and hierarchical algorithms", Generic Programming, April
1998, pp.
80-
90 </li>
25 <li> [
<a name =
"boost_timer">boost_timer
</a>],
"Boost <tt>timer</tt> library",
<a href =
"http://www.boost.org/">http://www.boost.org
</a> by Beman Dawes
</li>
27 <li> [
<a name =
"boost_type_traits">boost_type_traits
</a>],
"Boost <tt>type_traits</tt> library",
<a href =
"http://www.boost.org/">http://www.boost.org
</a> by John Maddock, Steve Cleary,
<i>et. al.
</i> </li>
29 <li> [
<a name =
"bulka99efficient">bulka99efficient
</a>] D. Bulka, and D. Mayhew,
"Efficient C++ Programming Techniques.", Addison-Wesley Publishing Company, Addison-Wesley,
1997 </li>
31 <li> [
<a name =
"clrs2001">clrs2001
</a>] T. H. Cormen, C. E., Leiserson, R. L. Rivest, C. and Stein,
"Introduction to Algorithms, 2nd ed.", MIT Press,
2001 </li>
33 <li> [
<a name =
"dinkumware_stl">dinkumware_stl
</a>],
"Dinkumware C++ Library Reference",
<a href =
"http://www.dinkumware.com/htm_cpl/index.html">http://www.dinkumware.com/htm_cpl/index.html
</a> </li>
35 <li> [
<a name =
"dubhashi98neg">dubhashi98neg
</a>] D. Dubashi, and D. Ranjan,
"Balls and bins: A study in negative dependence.", Random Structures and Algorithms
13,
2 (
1998),
99-
124 </li>
37 <li> [
<a name =
"fagin79extendible">fagin79extendible
</a>] 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 </li>
39 <li> [
<a name =
"gamma95designpatterns">gamma95designpatterns
</a>] E. Gamma, R. Helm, R. Johnson, and J. Vlissides,
"Design Patterns - Elements of Reusable Object-Oriented Software", Addison-Wesley Publishing Company, Addison-Wesley,
1995 </li>
41 <li> [
<a name =
"garg86order">garg86order
</a>] A. K. Garg and C. C. Gotlieb,
"Order-preserving key transformations", Trans. Database Syst.
11,
2 (
1986),
213-
234 </li>
43 <li> [
<a name =
"genome_dna">genome_dna
</a>],
"Whole Genome Shotgun entries",
<a href =
"ftp://ftp.ebi.ac.uk/pub/databases/embl/wgs/wgs_aady01.dat.gz">ftp://ftp.ebi.ac.uk/pub/databases/embl/wgs/wgs/_aady01.dat.gz
</a> </li>
45 <li> [
<a name =
"hyslop02making">hyslop02making
</a>] J. Hyslop, and H. Sutter,
"Making a real hash of things", C++ Report, May
2002 </li>
47 <li> [
<a name =
"jossutis01stl">jossutis01stl
</a>] N. M. Jossutis,
"The C++ Standard Library - A Tutorial and Reference", Addison-Wesley Publishing Company, Addison-Wesley,
2001 </li>
49 <li> [
<a name =
"kleft00sets">kleft00sets
</a>] Klaus Kleft and Angelika Langer,
"Are Set Iterators Mutable or Immutable?", C/C++ Users Jornal, October
2000 </li>
51 <li> [
<a name =
"knuth98sorting">knuth98sorting
</a>] D. E. Knuth,
"The Art of Computer Programming - Sorting and Searching", Addison-Wesley Publishing Company, Addison-Wesley,
1998 </li>
53 <li> [
<a name =
"liskov98data">liskov98data
</a>] B. Liskov,
"Data abstraction and hierarchy", SIGPLAN Notices
23,
5 (May
1998)
</li>
55 <li> [
<a name =
"litwin80lh">litwin80lh
</a>] 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 </li>
57 <li> [
<a name =
"metrowerks_stl">metrowerks_stl
</a>],
"Metrowerks CodeWarrior Pro 7 MSL C++ Reference Manual",
</li>
59 <li> [
<a name =
"meyers96more">meyers96more
</a>] S. Meyers,
"More Effective C++: 35 New Ways to Improve Your Programs and Designs - 2nd ed.", Addison-Wesley Publishing Company, Addison-Wesley,
1996 </li>
61 <li> [
<a name =
"meyers00nonmember">meyers00nonmember
</a>] S. Meyers,
"How Non-Member Functions Improve Encapsulation", C/C++ Users Journal,
2000 </li>
63 <li> [
<a name =
"meyers01stl">meyers01stl
</a>] S. Meyers,
"Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library", Addison-Wesley Publishing Company, Addison-Wesley,
2001 </li>
65 <li> [
<a name =
"meyers02both">meyers02both
</a>] S. Meyers,
"Class Template, Member Template - or Both?", C/C++ Users Journal,
2003 </li>
67 <li> [
<a name =
"motwani95random">motwani95random
</a>] R. Motwani, and P. Raghavan,
"Randomized Algorithms", Cambridge University Press
</li>
69 <li> [
<a name =
"mscom">mscom
</a>]
<a href =
"http://www.microsoft.com/com">COM: Component Model Object Technologies
</a> </li>
71 <li> [
<a name =
"musser95rationale">musser95rationale
</a>], David R. Musser,
"Rationale for Adding Hash Tables to the C++ Standard Template Library" </li>
73 <li> [
<a name =
"musser96stltutorial">musser96stltutorial
</a>] D. R. Musser and A. Saini,
"STL Tutorial and Reference Guide", Addison-Wesley Publishing Company, Addison-Wesley,
1996 </li>
75 <li> [
<a name =
"sgi_stl">sgi_stl
</a>] SGI,
"Standard Template Library Programmer's Guide",
<a href =
"http://www.sgi.com/tech/stl">http://www.sgi.com/tech/stl
</a> </li>
77 <li> [
<a name =
"sleator84amortized">sleator84amortized
</a>] D. D. Sleator and R. E. Tarjan,
"Amortized Efficiency of List Update Problems", ACM Symposium on Theory of Computing,
1984 </li>
79 <li> [
<a name =
"sleator85self">sleator85self
</a>] D. D. Sleator and R. E. Tarjan,
"Self-Adjusting Binary Search Trees", ACM Symposium on Theory of Computing,
1985 </li>
81 <li> [
<a name =
"stepanov94standard">stepanov94standard
</a>] A. A. Stepanov and M. Lee
", "The Standard Template Library
" </li>
83 <li> [<a name = "stroustrup97cpp
">stroustrup97cpp</a>] Bjarne Stroustrup, <i>The C++ Programming Langugage -3rd ed.</i>, Addison-Wesley Publishing Company,Reading, MA, USA, 1997 </li>
85 <li> [<a name = "vandevoorde2002cpptemplates
">vandevoorde2002cpptemplates</a>] D. Vandevoorde, and N. M. Josuttis, "C++ Templates: The Complete Guide
", Addison-Wesley Publishing Company, Addison-Wesley, 2002 </li>
87 <li> [<a name = "wickland96thirty
">wickland96thirty</a>] C. A. Wickland, "Thirty Years Among the Dead
", National Psychological Institute, Los Angeles, 1996,<a href = "http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip
">http://myweb.wvnet.edu/gsa00121/books/amongdead30.zip</a></li>