1 <!-- Policy Based Data Structures: Biblio -->
2 <bibliography xmlns="http://docbook.org/ns/docbook" version="5.0"
3 xml:id="pbds.biblio" xreflabel="Bibliography">
4 <info><title>Bibliography</title></info>
7 <biblioentry xml:id="biblio.abrahams97exception">
9 <link xmlns:xlink="http://www.w3.org/1999/xlink"
10 xlink:href="https://www.open-std.org/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf">
11 STL Exception Handling Contract
36 <biblioentry xml:id="biblio.alexandrescu01modern">
38 Modern C++ Design: Generic Programming and Design Patterns Applied
57 Addison-Wesley Publishing Company
64 <biblioentry xml:id="biblio.andrew04mtf">
66 MTF, Bit, and COMB: A Guide to Deterministic and Randomized
67 Algorithms for the List Update Problem
96 <biblioentry xml:id="biblio.austern00noset">
98 Why You Shouldn't Use set - and What You Should Use Instead
123 <biblioentry xml:id="biblio.austern01htprop">
125 <link xmlns:xlink="http://www.w3.org/1999/xlink"
126 xlink:href="https://www.open-std.org/JTC1/sc22/wg21/docs/papers/2001/n1326.html">
127 A Proposal to Add Hashtables to the Standard Library
153 <biblioentry xml:id="biblio.austern98segmentedit">
155 Segmented iterators and hierarchical algorithms
180 <biblioentry xml:id="biblio.dawestimer">
182 <link xmlns:xlink="http://www.w3.org/1999/xlink"
183 xlink:href="http://www.boost.org/libs/timer/">
207 <biblioentry xml:id="biblio.clearypool">
209 <link xmlns:xlink="http://www.w3.org/1999/xlink"
210 xlink:href="http://www.boost.org/libs/pool/">
235 <biblioentry xml:id="biblio.maddocktraits">
237 <link xmlns:xlink="http://www.w3.org/1999/xlink"
238 xlink:href="http://www.boost.org/libs/type_traits/">
239 Boost Type Traits Library
272 <biblioentry xml:id="biblio.brodal96priority">
274 <link xmlns:xlink="http://www.w3.org/1999/xlink"
275 xlink:href="https://dl.acm.org/doi/10.5555/313852.313883">
276 Worst-case efficient priority queues
294 <biblioentry xml:id="biblio.bulkamayheweff">
296 Efficient C++ Programming Techniques
327 Addison-Wesley Publishing Company
333 <biblioentry xml:id="biblio.clrs2001">
335 Introduction to Algorithms, 2nd edition
393 <biblioentry xml:id="biblio.dubhashi98neg">
395 Balls and bins: A study in negative dependence
425 Random Structures and Algorithms 13
432 <biblioentry xml:id="biblio.fagin79extendible">
434 Extendible hashing - a fast access method for dynamic files
485 ACM Trans. Database Syst. 4
493 <biblioentry xml:id="biblio.filliatre2000ptset">
495 <link xmlns:xlink="http://www.w3.org/1999/xlink"
496 xlink:href="http://cristal.inria.fr/~frisch/icfp06_contest/advtr/applyOmatic/ptset.ml">
497 Ptset: Sets of integers implemented as Patricia trees
520 <biblioentry xml:id="biblio.fredman86pairing">
522 <link xmlns:xlink="http://www.w3.org/1999/xlink"
523 xlink:href="http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf">
524 The pairing heap: a new form of self-adjusting heap
576 <biblioentry xml:id="biblio.gof">
578 Design Patterns - Elements of Reusable Object-Oriented Software
627 Addison-Wesley Publishing Company
634 <biblioentry xml:id="biblio.garg86order">
636 Order-preserving key transformations
666 Trans. Database Syst. 11
672 <biblioentry xml:id="biblio.hyslop02making">
674 Making a real hash of things
711 <biblioentry xml:id="biblio.jossutis01stl">
713 The C++ Standard Library - A Tutorial and Reference
731 Addison-Wesley Publishing Company
737 <biblioentry xml:id="biblio.kt99fat_heaps">
739 <link xmlns:xlink="http://www.w3.org/1999/xlink"
740 xlink:href="https://www.cs.princeton.edu/research/techreps/TR-597-99">
741 New Heap Data Structures
774 <biblioentry xml:id="biblio.kleft00sets">
776 Are Set Iterators Mutable or Immutable?
813 <biblioentry xml:id="biblio.knuth98sorting">
815 The Art of Computer Programming - Sorting and Searching
834 Addison-Wesley Publishing Company
840 <biblioentry xml:id="biblio.liskov98data">
842 Data abstraction and hierarchy
867 <biblioentry xml:id="biblio.litwin80lh">
869 Linear hashing: A new tool for file and table addressing
888 Proceedings of International Conference on Very Large Data Bases
894 <biblioentry xml:id="biblio.maverick_lowerbounds">
896 Deamortization - Part 2: Binomial Heaps
915 <biblioentry xml:id="biblio.meyers96more">
917 More Effective C++: 35 New Ways to Improve Your Programs and Designs
936 Addison-Wesley Publishing Company
942 <biblioentry xml:id="biblio.meyers00nonmember">
944 How Non-Member Functions Improve Encapsulation
969 <biblioentry xml:id="biblio.meyers01stl">
971 Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library
990 Addison-Wesley Publishing Company
996 <biblioentry xml:id="biblio.meyers02both">
998 Class Template, Member Template - or Both?
1023 <biblioentry xml:id="biblio.motwani95random">
1025 Randomized Algorithms
1054 Cambridge University Press
1061 <biblioentry xml:id="biblio.mscom">
1063 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1064 xlink:href="https://learn.microsoft.com/en-us/windows/win32/com/the-component-object-model">
1065 The Component Object Model
1076 <biblioentry xml:id="biblio.musser95rationale">
1078 Rationale for Adding Hash Tables to the C++ Standard Template Library
1098 <biblioentry xml:id="biblio.musser96stltutorial">
1100 STL Tutorial and Reference Guide
1130 Addison-Wesley Publishing Company
1138 <biblioentry xml:id="biblio.nelson96stlpq">
1140 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1141 xlink:href="https://marknelson.us/posts/1996/01/01/priority-queues.html">Priority Queues and the STL
1168 <biblioentry xml:id="biblio.okasaki98mereable">
1170 Fast mergeable integer maps
1205 <biblioentry xml:id="biblio.sgi_stl">
1207 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1208 xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/">
1209 Standard Template Library Programmer's Guide
1231 <biblioentry xml:id="biblio.select_man">
1233 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1234 xlink:href="https://pubs.opengroup.org/onlinepubs/9699919799/functions/select.html">
1242 <biblioentry xml:id="biblio.sleator84amortized">
1244 Amortized Efficiency of List Update Problems
1275 ACM Symposium on Theory of Computing
1281 <biblioentry xml:id="biblio.sleator85self">
1283 Self-Adjusting Binary Search Trees
1315 ACM Symposium on Theory of Computing
1321 <biblioentry xml:id="biblio.stepanov94standard">
1323 The Standard Template Library
1353 <biblioentry xml:id="biblio.stroustrup97cpp">
1355 The C++ Programming Langugage
1374 Addison-Wesley Publishing Company
1380 <biblioentry xml:id="biblio.vandevoorde2002cpptemplates">
1382 C++ Templates: The Complete Guide
1412 Addison-Wesley Publishing Company
1419 <biblioentry xml:id="biblio.wickland96thirty">
1421 Thirty Years Among the Dead
1440 National Psychological Institute