| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" |
| "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> |
| |
| <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> |
| <head> |
| <meta name="generator" content= |
| "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" /> |
| |
| <title>References</title> |
| <meta http-equiv="Content-Type" content= |
| "text/html; charset=us-ascii" /> |
| </head> |
| |
| <body> |
| <div id="page"> |
| <h1>References</h1> |
| |
| <ol> |
| <li>[<a name="abrahams97exception" id= |
| "abrahams97exception">abrahams97exception</a>] Dave Abrahams, |
| STL Exception Handling Contract, <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></li> |
| |
| <li>[<a name="alexandrescu01modern" id= |
| "alexandrescu01modern">alexandrescu01modern</a>] Andrei |
| Alexandrescu, <i>Modern C++ Design: Generic Programming and |
| Design Patterns Applied</i>, Addison-Wesley Publishing |
| Company, 2001</li> |
| |
| <li>[<a name="andrew04mtf" id="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> |
| |
| <li>[<a name="austern00noset" id= |
| "austern00noset">austern00noset</a>] Matthew Austern, "Why |
| You shouldn't use <tt>set</tt> - and What You Should Use |
| Instead", C++ Report, April, 2000</li> |
| |
| <li>[<a name="austern01htprop" id= |
| "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> |
| |
| <li>[<a name="austern98segmented" id= |
| "austern98segmented">austern98segmented</a>] Matthew Austern, |
| "Segmented iterators and hierarchical algorithms", Generic |
| Programming, April 1998, pp. 80-90</li> |
| |
| <li>[<a name="boost_timer" id="boost_timer">boost_timer</a>], |
| "Boost timer library", <a href= |
| "http://www.boost.org/">http://www.boost.org</a> by Beman |
| Dawes</li> |
| |
| <li>[<a name="boost_pool" id="boost_pool">boost_pool</a>], |
| "Boost pool library", <a href= |
| "http://www.boost.org/">http://www.boost.org</a> by Stephen |
| Cleary</li> |
| |
| <li>[<a name="boost_type_traits" id= |
| "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> |
| |
| <li>[<a name="brodal96priority" id= |
| "brodal96priority">brodal96priority</a>] Gerth Stolting |
| Brodal, <a href= |
| "http://portal.acm.org/citation.cfm?id=313883">Worst-case |
| efficient priority queues</a></li> |
| |
| <li>[<a name="bulka99efficient" id= |
| "bulka99efficient">bulka99efficient</a>] D. Bulka, and D. |
| Mayhew, "Efficient C++ Programming Techniques.", |
| Addison-Wesley Publishing Company, Addison-Wesley, 1997</li> |
| |
| <li>[<a name="clrs2001" id="clrs2001">clrs2001</a>] T. H. |
| Cormen, C. E., Leiserson, R. L. Rivest, C. and Stein, |
| "Introduction to Algorithms, 2nd ed.", MIT Press, 2001</li> |
| |
| <li>[<a name="dinkumware_stl" id= |
| "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> |
| |
| <li>[<a name="dubhashi98neg" id= |
| "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> |
| |
| <li>[<a name="fagin79extendible" id= |
| "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> |
| |
| <li>[<a name="filliatre2000ptset" id= |
| "filliatre2000ptset">filliatre2000ptset</a>], J. C. |
| Filliatre, "Ptset: Sets of integers implemented as Patricia |
| trees", <a href= |
| "http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml">http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml</a></li> |
| |
| <li>[<a name="fredman86pairing" id= |
| "fredman86pairing">fredman86pairing</a>], M. L. Fredman, R |
| Sedgewick, D. D. Sleator, R. E. Tarjan, <a href= |
| "http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf">The |
| pairing heap: a new form of self-adjusting heap</a></li> |
| |
| <li>[<a name="gamma95designpatterns" id= |
| "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> |
| |
| <li>[<a name="garg86order" id="garg86order">garg86order</a>] |
| A. K. Garg and C. C. Gotlieb, "Order-preserving key |
| transformations", Trans. Database Syst. 11, 2 (1986), |
| 213-234</li> |
| |
| <li>[<a name="hyslop02making" id= |
| "hyslop02making">hyslop02making</a>] J. Hyslop, and H. |
| Sutter, "Making a real hash of things", C++ Report, May |
| 2002</li> |
| |
| <li>[<a name="jossutis01stl" id= |
| "jossutis01stl">jossutis01stl</a>] N. M. Jossutis, "The C++ |
| Standard Library - A Tutorial and Reference", Addison-Wesley |
| Publishing Company, Addison-Wesley, 2001</li> |
| |
| <li>[<a name="kt99fat_heaps" id= |
| "kt99fat_heaps">kt99fat_heas</a>] Haim Kaplan and Robert E. |
| Tarjan, <a href= |
| "http://www.cs.princeton.edu/research/techreps/TR-597-99">New |
| Heap Data Structures</a></li> |
| |
| <li>[<a name="kleft00sets" id="kleft00sets">kleft00sets</a>] |
| Klaus Kleft and Angelika Langer, "Are Set Iterators Mutable |
| or Immutable?", C/C++ Users Jornal, October 2000</li> |
| |
| <li>[<a name="knuth98sorting" id= |
| "knuth98sorting">knuth98sorting</a>] D. E. Knuth, "The Art of |
| Computer Programming - Sorting and Searching", Addison-Wesley |
| Publishing Company, Addison-Wesley, 1998</li> |
| |
| <li>[<a name="liskov98data" id= |
| "liskov98data">liskov98data</a>] B. Liskov, "Data abstraction |
| and hierarchy", SIGPLAN Notices 23, 5 (May 1998)</li> |
| |
| <li>[<a name="litwin80lh" id="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> |
| |
| <li>[<a name="maverik_lowerbounds" id= |
| "maverik_lowerbounds">maverik_lowerbounds</a>] Maverik Woo, |
| <a href= |
| "http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps/"> |
| Deamortization - Part 2: Binomial Heaps</a></li> |
| |
| <li>[<a name="metrowerks_stl" id= |
| "metrowerks_stl">metrowerks_stl</a>], "Metrowerks CodeWarrior |
| Pro 7 MSL C++ Reference Manual",</li> |
| |
| <li>[<a name="meyers96more" id= |
| "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> |
| |
| <li>[<a name="meyers00nonmember" id= |
| "meyers00nonmember">meyers00nonmember</a>] S. Meyers, "How |
| Non-Member Functions Improve Encapsulation", C/C++ Users |
| Journal, 2000</li> |
| |
| <li>[<a name="meyers01stl" id="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> |
| |
| <li>[<a name="meyers02both" id= |
| "meyers02both">meyers02both</a>] S. Meyers, "Class Template, |
| Member Template - or Both?", C/C++ Users Journal, 2003</li> |
| |
| <li>[<a name="motwani95random" id= |
| "motwani95random">motwani95random</a>] R. Motwani, and P. |
| Raghavan, "Randomized Algorithms", Cambridge University |
| Press</li> |
| |
| <li>[<a name="mscom" id="mscom">mscom</a>] <a href= |
| "http://www.microsoft.com/com">COM: Component Model Object |
| Technologies</a></li> |
| |
| <li>[<a name="musser95rationale" id= |
| "musser95rationale">musser95rationale</a>], David R. Musser, |
| "Rationale for Adding Hash Tables to the C++ Standard |
| Template Library"</li> |
| |
| <li>[<a name="musser96stltutorial" id= |
| "musser96stltutorial">musser96stltutorial</a>] D. R. Musser |
| and A. Saini, "STL Tutorial and Reference Guide", |
| Addison-Wesley Publishing Company, Addison-Wesley, 1996</li> |
| |
| <li>[<a name="nelson96stlpq" id= |
| "nelson96stlpq">nelson96stlpql</a>] Mark Nelson, <a href= |
| "http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority |
| Queues and the STL</a>, Dr. Dobbs Journal, January, 1996</li> |
| |
| <li>[<a name="okasaki98mereable" id= |
| "okasaki98mereable">okasaki98mereable</a>] C. Okasaki and A. |
| Gill, "Fast mergeable integer maps", In Workshop on ML, pages |
| 77--86, September 1998. 95</li> |
| |
| <li>[<a name="sgi_stl" id="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> |
| |
| <li>[<a name="select_man" id="select_man">select_man</a>] |
| <a href= |
| "http://www.scit.wlv.ac.uk/cgi-bin/mansec?3C+select"><tt>select</tt> |
| man page.</a></li> |
| |
| <li>[<a name="sleator84amortized" id= |
| "sleator84amortized">sleator84amortized</a>] D. D. Sleator |
| and R. E. Tarjan, "Amortized Efficiency of List Update |
| Problems", ACM Symposium on Theory of Computing, 1984</li> |
| |
| <li>[<a name="sleator85self" id= |
| "sleator85self">sleator85self</a>] D. D. Sleator and R. E. |
| Tarjan, "Self-Adjusting Binary Search Trees", ACM Symposium |
| on Theory of Computing, 1985</li> |
| |
| <li>[<a name="stepanov94standard" id= |
| "stepanov94standard">stepanov94standard</a>] A. A. Stepanov |
| and M. Lee", "The Standard Template Library"</li> |
| |
| <li>[<a name="stroustrup97cpp" id= |
| "stroustrup97cpp">stroustrup97cpp</a>] Bjarne Stroustrup, |
| <i>The C++ Programming Langugage -3rd ed.</i>, Addison-Wesley |
| Publishing Company,Reading, MA, USA, 1997</li> |
| |
| <li>[<a name="vandevoorde2002cpptemplates" id= |
| "vandevoorde2002cpptemplates">vandevoorde2002cpptemplates</a>] |
| D. Vandevoorde, and N. M. Josuttis, "C++ Templates: The |
| Complete Guide", Addison-Wesley Publishing Company, |
| Addison-Wesley, 2002</li> |
| |
| <li>[<a name="wickland96thirty" id= |
| "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> |
| </ol> |
| <hr /> |
| </div> |
| </body> |
| </html> |
