| blob | 11f798fd2320fd90e5320a6c52aa8a6ae3aa783f |
2 <!-- Policy Based Data Structures: Biblio -->
3 <bibliography xmlns="http://docbook.org/ns/docbook" version="5.0"
4 xml:id="pbds.biblio" xreflabel="Bibliography">
5 <info><title>Bibliography</title></info>
7 <!-- 01 -->
8 <biblioentry xml:id="biblio.abrahams97exception">
9 <title>
10 <link xmlns:xlink="http://www.w3.org/1999/xlink"
11 xlink:href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/1997/N1075.pdf">
12 STL Exception Handling Contract
13 </link>
14 </title>
15 <date>1997</date>
17 <author>
18 <personname>
19 <firstname>
20 Dave
21 </firstname>
22 <surname>
23 Abrahams
24 </surname>
25 </personname>
26 </author>
28 <publisher>
29 <publishername>
30 ISO SC22/WG21
31 </publishername>
32 </publisher>
33 </biblioentry>
36 <!-- 02 -->
37 <biblioentry xml:id="biblio.alexandrescu01modern">
38 <title>
39 Modern C++ Design: Generic Programming and Design Patterns Applied
40 </title>
41 <date>
42 2001
43 </date>
45 <author>
46 <personname>
47 <firstname>
48 Andrei
49 </firstname>
50 <surname>
51 Alexandrescu
52 </surname>
53 </personname>
54 </author>
56 <publisher>
57 <publishername>
58 Addison-Wesley Publishing Company
59 </publishername>
60 </publisher>
61 </biblioentry>
64 <!-- 03 -->
65 <biblioentry xml:id="biblio.andrew04mtf">
66 <title>
67 MTF, Bit, and COMB: A Guide to Deterministic and Randomized
68 Algorithms for the List Update Problem
69 </title>
71 <authorgroup>
72 <author>
73 <personname>
74 <firstname>
75 K.
76 </firstname>
77 <surname>
78 Andrew
79 </surname>
80 </personname>
81 </author>
83 <author>
84 <personname>
85 <firstname>
86 D.
87 </firstname>
88 <surname>
89 Gleich
90 </surname>
91 </personname>
92 </author>
93 </authorgroup>
94 </biblioentry>
96 <!-- 04 -->
97 <biblioentry xml:id="biblio.austern00noset">
98 <title>
99 Why You Shouldn't Use set - and What You Should Use Instead
100 </title>
101 <date>
102 April, 2000
103 </date>
105 <author>
106 <personname>
107 <firstname>
108 Matthew
109 </firstname>
110 <surname>
111 Austern
112 </surname>
113 </personname>
114 </author>
116 <publisher>
117 <publishername>
118 C++ Report
119 </publishername>
120 </publisher>
121 </biblioentry>
123 <!-- 05 -->
124 <biblioentry xml:id="biblio.austern01htprop">
125 <title>
126 <link xmlns:xlink="http://www.w3.org/1999/xlink"
127 xlink:href="http://www.open-std.org/JTC1/sc22/wg21/docs/papers/2001/n1326.html">
128 A Proposal to Add Hashtables to the Standard Library
129 </link>
130 </title>
131 <date>
132 2001
133 </date>
135 <author>
136 <personname>
137 <firstname>
138 Matthew
139 </firstname>
140 <surname>
141 Austern
142 </surname>
143 </personname>
144 </author>
146 <publisher>
147 <publishername>
148 ISO SC22/WG21
149 </publishername>
150 </publisher>
151 </biblioentry>
153 <!-- 06 -->
154 <biblioentry xml:id="biblio.austern98segmentedit">
155 <title>
156 Segmented iterators and hierarchical algorithms
157 </title>
158 <date>
159 April, 1998
160 </date>
162 <author>
163 <personname>
164 <firstname>
165 Matthew
166 </firstname>
167 <surname>
168 Austern
169 </surname>
170 </personname>
171 </author>
173 <publisher>
174 <publishername>
175 Generic Programming
176 </publishername>
177 </publisher>
178 </biblioentry>
180 <!-- 07 -->
181 <biblioentry xml:id="biblio.dawestimer">
182 <title>
183 <link xmlns:xlink="http://www.w3.org/1999/xlink"
184 xlink:href="www.boost.org/doc/libs/release/libs/timer/">
185 Boost Timer Library
186 </link>
187 </title>
189 <author>
190 <personname>
191 <firstname>
192 Beeman
193 </firstname>
194 <surname>
195 Dawes
196 </surname>
197 </personname>
198 </author>
200 <publisher>
201 <publishername>
202 Boost
203 </publishername>
204 </publisher>
205 </biblioentry>
207 <!-- 08 -->
208 <biblioentry xml:id="biblio.clearypool">
209 <title>
210 <link xmlns:xlink="http://www.w3.org/1999/xlink"
211 xlink:href="www.boost.org/doc/libs/release/libs/pool/">
212 Boost Pool Library
213 </link>
214 </title>
216 <author>
217 <personname>
218 <firstname>
219 Stephen
220 </firstname>
221 <surname>
222 Cleary
223 </surname>
224 </personname>
225 </author>
227 <publisher>
228 <publishername>
229 Boost
230 </publishername>
231 </publisher>
232 </biblioentry>
235 <!-- 09 -->
236 <biblioentry xml:id="biblio.maddocktraits">
237 <title>
238 <link xmlns:xlink="http://www.w3.org/1999/xlink"
239 xlink:href="www.boost.org/doc/libs/release/libs/type_traits/">
240 Boost Type Traits Library
241 </link>
242 </title>
243 <authorgroup>
244 <author>
245 <personname>
246 <firstname>
247 Maddock
248 </firstname>
249 <surname>
250 John
251 </surname>
252 </personname>
253 </author>
254 <author>
255 <personname>
256 <firstname>
257 Stephen
258 </firstname>
259 <surname>
260 Cleary
261 </surname>
262 </personname>
263 </author>
264 </authorgroup>
265 <publisher>
266 <publishername>
267 Boost
268 </publishername>
269 </publisher>
270 </biblioentry>
272 <!-- 10 -->
273 <biblioentry xml:id="biblio.brodal96priority">
274 <title>
275 <link xmlns:xlink="http://www.w3.org/1999/xlink"
276 xlink:href="https://dl.acm.org/citation.cfm?id=313883">
277 Worst-case efficient priority queues
278 </link>
279 </title>
281 <author>
282 <personname>
283 <firstname>
284 Gerth
285 </firstname>
286 <surname>
287 Stolting Brodal
288 </surname>
289 </personname>
290 </author>
292 </biblioentry>
294 <!-- 11 -->
295 <biblioentry xml:id="biblio.bulkamayheweff">
296 <title>
297 Efficient C++ Programming Techniques
298 </title>
299 <date>
300 1997
301 </date>
303 <authorgroup>
304 <author>
305 <personname>
306 <firstname>
307 D.
308 </firstname>
309 <surname>
310 Bulka
311 </surname>
312 </personname>
313 </author>
314 <author>
315 <personname>
316 <firstname>
317 D.
318 </firstname>
319 <surname>
320 Mayhew
321 </surname>
322 </personname>
323 </author>
324 </authorgroup>
326 <publisher>
327 <publishername>
328 Addison-Wesley Publishing Company
329 </publishername>
330 </publisher>
331 </biblioentry>
333 <!-- 12 -->
334 <biblioentry xml:id="biblio.clrs2001">
335 <title>
336 Introduction to Algorithms, 2nd edition
337 </title>
338 <date>
339 2001
340 </date>
341 <authorgroup>
342 <author>
343 <personname>
344 <firstname>
345 T. H.
346 </firstname>
347 <surname>
348 Cormen
349 </surname>
350 </personname>
351 </author>
353 <author>
354 <personname>
355 <firstname>
356 C. E.
357 </firstname>
358 <surname>
359 Leiserson
360 </surname>
361 </personname>
362 </author>
364 <author>
365 <personname>
366 <firstname>
367 R. L.
368 </firstname>
369 <surname>
370 Rivest
371 </surname>
372 </personname>
373 </author>
375 <author>
376 <personname>
377 <firstname>
378 C.
379 </firstname>
380 <surname>
381 Stein
382 </surname>
383 </personname>
384 </author>
385 </authorgroup>
386 <publisher>
387 <publishername>
388 MIT Press
389 </publishername>
390 </publisher>
391 </biblioentry>
393 <!-- 13 -->
394 <biblioentry xml:id="biblio.dubhashi98neg">
395 <title>
396 Balls and bins: A study in negative dependence
397 </title>
398 <date>
399 1998
400 </date>
401 <authorgroup>
402 <author>
403 <personname>
404 <firstname>
405 D.
406 </firstname>
407 <surname>
408 Dubashi
409 </surname>
410 </personname>
411 </author>
412 <author>
413 <personname>
414 <firstname>
415 D.
416 </firstname>
417 <surname>
418 Ranjan
419 </surname>
420 </personname>
421 </author>
422 </authorgroup>
424 <publisher>
425 <publishername>
426 Random Structures and Algorithms 13
427 </publishername>
428 </publisher>
429 </biblioentry>
432 <!-- 14 -->
433 <biblioentry xml:id="biblio.fagin79extendible">
434 <title>
435 Extendible hashing - a fast access method for dynamic files
436 </title>
437 <date>
438 1979
439 </date>
441 <authorgroup>
442 <author>
443 <personname>
444 <firstname>
445 R.
446 </firstname>
447 <surname>
448 Fagin
449 </surname>
450 </personname>
451 </author>
452 <author>
453 <personname>
454 <firstname>
455 J.
456 </firstname>
457 <surname>
458 Nievergelt
459 </surname>
460 </personname>
461 </author>
462 <author>
463 <personname>
464 <firstname>
465 N.
466 </firstname>
467 <surname>
468 Pippenger
469 </surname>
470 </personname>
471 </author>
472 <author>
473 <personname>
474 <firstname>
475 H. R.
476 </firstname>
477 <surname>
478 Strong
479 </surname>
480 </personname>
481 </author>
482 </authorgroup>
484 <publisher>
485 <publishername>
486 ACM Trans. Database Syst. 4
487 </publishername>
488 </publisher>
489 </biblioentry>
493 <!-- 15 -->
494 <biblioentry xml:id="biblio.filliatre2000ptset">
495 <title>
496 <link xmlns:xlink="http://www.w3.org/1999/xlink"
497 xlink:href="http://cristal.inria.fr/~frisch/icfp06_contest/advtr/applyOmatic/ptset.ml">
498 Ptset: Sets of integers implemented as Patricia trees
499 </link>
500 </title>
502 <date>
503 2000
504 </date>
506 <author>
507 <personname>
508 <firstname>
509 Jean-Christophe
510 </firstname>
511 <surname>
512 Filliatre
513 </surname>
514 </personname>
515 </author>
516 </biblioentry>
520 <!-- 16 -->
521 <biblioentry xml:id="biblio.fredman86pairing">
522 <title>
523 <link xmlns:xlink="http://www.w3.org/1999/xlink"
524 xlink:href="http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf">
525 The pairing heap: a new form of self-adjusting heap
526 </link>
527 </title>
528 <date>
529 1986
530 </date>
531 <authorgroup>
532 <author>
533 <personname>
534 <firstname>
535 M. L.
536 </firstname>
537 <surname>
538 Fredman
539 </surname>
540 </personname>
541 </author>
542 <author>
543 <personname>
544 <firstname>
545 R.
546 </firstname>
547 <surname>
548 Sedgewick
549 </surname>
550 </personname>
551 </author>
552 <author>
553 <personname>
554 <firstname>
555 D. D.
556 </firstname>
557 <surname>
558 Sleator
559 </surname>
560 </personname>
561 </author>
562 <author>
563 <personname>
564 <firstname>
565 R. E.
566 </firstname>
567 <surname>
568 Tarjan
569 </surname>
570 </personname>
571 </author>
572 </authorgroup>
573 </biblioentry>
576 <!-- 17 -->
577 <biblioentry xml:id="biblio.gof">
578 <title>
579 Design Patterns - Elements of Reusable Object-Oriented Software
580 </title>
581 <date>
582 1995
583 </date>
584 <authorgroup>
585 <author>
586 <personname>
587 <firstname>
588 E.
589 </firstname>
590 <surname>
591 Gamma
592 </surname>
593 </personname>
594 </author>
595 <author>
596 <personname>
597 <firstname>
598 R.
599 </firstname>
600 <surname>
601 Helm
602 </surname>
603 </personname>
604 </author>
605 <author>
606 <personname>
607 <firstname>
608 R.
609 </firstname>
610 <surname>
611 Johnson
612 </surname>
613 </personname>
614 </author>
615 <author>
616 <personname>
617 <firstname>
618 J.
619 </firstname>
620 <surname>
621 Vlissides
622 </surname>
623 </personname>
624 </author>
625 </authorgroup>
626 <publisher>
627 <publishername>
628 Addison-Wesley Publishing Company
629 </publishername>
630 </publisher>
631 </biblioentry>
634 <!-- 18 -->
635 <biblioentry xml:id="biblio.garg86order">
636 <title>
637 Order-preserving key transformations
638 </title>
639 <date>
640 1986
641 </date>
642 <authorgroup>
643 <author>
644 <personname>
645 <firstname>
646 A. K.
647 </firstname>
648 <surname>
649 Garg
650 </surname>
651 </personname>
652 </author>
653 <author>
654 <personname>
655 <firstname>
656 C. C.
657 </firstname>
658 <surname>
659 Gotlieb
660 </surname>
661 </personname>
662 </author>
663 </authorgroup>
665 <publisher>
666 <publishername>
667 Trans. Database Syst. 11
668 </publishername>
669 </publisher>
670 </biblioentry>
672 <!-- 19 -->
673 <biblioentry xml:id="biblio.hyslop02making">
674 <title>
675 Making a real hash of things
676 </title>
677 <date>
678 May 2002
679 </date>
680 <authorgroup>
681 <author>
682 <personname>
683 <firstname>
684 J.
685 </firstname>
686 <surname>
687 Hyslop
688 </surname>
689 </personname>
690 </author>
691 <author>
692 <personname>
693 <firstname>
694 Herb
695 </firstname>
696 <surname>
697 Sutter
698 </surname>
699 </personname>
700 </author>
701 </authorgroup>
703 <publisher>
704 <publishername>
705 C++ Report
706 </publishername>
707 </publisher>
708 </biblioentry>
711 <!-- 20 -->
712 <biblioentry xml:id="biblio.jossutis01stl">
713 <title>
714 The C++ Standard Library - A Tutorial and Reference
715 </title>
716 <date>
717 2001
718 </date>
720 <author>
721 <personname>
722 <firstname>
723 N. M.
724 </firstname>
725 <surname>
726 Jossutis
727 </surname>
728 </personname>
729 </author>
730 <publisher>
731 <publishername>
732 Addison-Wesley Publishing Company
733 </publishername>
734 </publisher>
735 </biblioentry>
737 <!-- 21 -->
738 <biblioentry xml:id="biblio.kt99fat_heaps">
739 <title>
740 <link xmlns:xlink="http://www.w3.org/1999/xlink"
741 xlink:href="http://www.cs.princeton.edu/research/techreps/TR-597-99">
742 New Heap Data Structures
743 </link>
744 </title>
745 <date>
746 1999
747 </date>
749 <authorgroup>
750 <author>
751 <personname>
752 <firstname>
753 Haim
754 </firstname>
755 <surname>
756 Kaplan
757 </surname>
758 </personname>
759 </author>
760 <author>
761 <personname>
762 <firstname>
763 Robert E.
764 </firstname>
765 <surname>
766 Tarjan
767 </surname>
768 </personname>
769 </author>
770 </authorgroup>
771 </biblioentry>
774 <!-- 22 -->
775 <biblioentry xml:id="biblio.kleft00sets">
776 <title>
777 Are Set Iterators Mutable or Immutable?
778 </title>
779 <date>
780 October 2000
781 </date>
782 <authorgroup>
783 <author>
784 <personname>
785 <firstname>
786 Angelika
787 </firstname>
788 <surname>
789 Langer
790 </surname>
791 </personname>
792 </author>
794 <author>
795 <personname>
796 <firstname>
797 Klaus
798 </firstname>
799 <surname>
800 Kleft
801 </surname>
802 </personname>
803 </author>
804 </authorgroup>
806 <publisher>
807 <publishername>
808 C/C++ Users Jornal
809 </publishername>
810 </publisher>
811 </biblioentry>
813 <!-- 23 -->
814 <biblioentry xml:id="biblio.knuth98sorting">
815 <title>
816 The Art of Computer Programming - Sorting and Searching
817 </title>
818 <date>
819 1998
820 </date>
822 <author>
823 <personname>
824 <firstname>
825 D. E.
826 </firstname>
827 <surname>
828 Knuth
829 </surname>
830 </personname>
831 </author>
833 <publisher>
834 <publishername>
835 Addison-Wesley Publishing Company
836 </publishername>
837 </publisher>
838 </biblioentry>
840 <!-- 24 -->
841 <biblioentry xml:id="biblio.liskov98data">
842 <title>
843 Data abstraction and hierarchy
844 </title>
845 <date>
846 May 1998
847 </date>
849 <author>
850 <personname>
851 <firstname>
852 B.
853 </firstname>
854 <surname>
855 Liskov
856 </surname>
857 </personname>
858 </author>
860 <publisher>
861 <publishername>
862 SIGPLAN Notices 23
863 </publishername>
864 </publisher>
865 </biblioentry>
867 <!-- 25 -->
868 <biblioentry xml:id="biblio.litwin80lh">
869 <title>
870 Linear hashing: A new tool for file and table addressing
871 </title>
872 <date>
873 June 1980
874 </date>
876 <author>
877 <personname>
878 <firstname>
879 W.
880 </firstname>
881 <surname>
882 Litwin
883 </surname>
884 </personname>
885 </author>
887 <publisher>
888 <publishername>
889 Proceedings of International Conference on Very Large Data Bases
890 </publishername>
891 </publisher>
892 </biblioentry>
894 <!-- 26 -->
895 <biblioentry xml:id="biblio.maverik_lowerbounds">
896 <title>
897 <link xmlns:xlink="http://www.w3.org/1999/xlink"
898 xlink:href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps">
899 Deamortization - Part 2: Binomial Heaps
900 </link>
901 </title>
902 <date>
903 2005
904 </date>
906 <author>
907 <personname>
908 <firstname>
909 Maverik
910 </firstname>
911 <surname>
912 Woo
913 </surname>
914 </personname>
915 </author>
916 </biblioentry>
918 <!-- 27 -->
919 <biblioentry xml:id="biblio.meyers96more">
920 <title>
921 More Effective C++: 35 New Ways to Improve Your Programs and Designs
922 </title>
923 <date>
924 1996
925 </date>
927 <author>
928 <personname>
929 <firstname>
930 Scott
931 </firstname>
932 <surname>
933 Meyers
934 </surname>
935 </personname>
936 </author>
938 <publisher>
939 <publishername>
940 Addison-Wesley Publishing Company
941 </publishername>
942 </publisher>
943 </biblioentry>
945 <!-- 28 -->
946 <biblioentry xml:id="biblio.meyers00nonmember">
947 <title>
948 How Non-Member Functions Improve Encapsulation
949 </title>
950 <date>
951 2000
952 </date>
954 <author>
955 <personname>
956 <firstname>
957 Scott
958 </firstname>
959 <surname>
960 Meyers
961 </surname>
962 </personname>
963 </author>
965 <publisher>
966 <publishername>
967 C/C++ Users Journal
968 </publishername>
969 </publisher>
970 </biblioentry>
972 <!-- 29 -->
973 <biblioentry xml:id="biblio.meyers01stl">
974 <title>
975 Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library
976 </title>
977 <date>
978 2001
979 </date>
981 <author>
982 <personname>
983 <firstname>
984 Scott
985 </firstname>
986 <surname>
987 Meyers
988 </surname>
989 </personname>
990 </author>
992 <publisher>
993 <publishername>
994 Addison-Wesley Publishing Company
995 </publishername>
996 </publisher>
997 </biblioentry>
999 <!-- 30 -->
1000 <biblioentry xml:id="biblio.meyers02both">
1001 <title>
1002 Class Template, Member Template - or Both?
1003 </title>
1004 <date>
1005 2003
1006 </date>
1008 <author>
1009 <personname>
1010 <firstname>
1011 Scott
1012 </firstname>
1013 <surname>
1014 Meyers
1015 </surname>
1016 </personname>
1017 </author>
1019 <publisher>
1020 <publishername>
1021 C/C++ Users Journal
1022 </publishername>
1023 </publisher>
1024 </biblioentry>
1026 <!-- 31 -->
1027 <biblioentry xml:id="biblio.motwani95random">
1028 <title>
1029 Randomized Algorithms
1030 </title>
1031 <date>
1032 2003
1033 </date>
1034 <authorgroup>
1035 <author>
1036 <personname>
1037 <firstname>
1038 R.
1039 </firstname>
1040 <surname>
1041 Motwani
1042 </surname>
1043 </personname>
1044 </author>
1045 <author>
1046 <personname>
1047 <firstname>
1048 P.
1049 </firstname>
1050 <surname>
1051 Raghavan
1052 </surname>
1053 </personname>
1054 </author>
1055 </authorgroup>
1056 <publisher>
1057 <publishername>
1058 Cambridge University Press
1059 </publishername>
1060 </publisher>
1061 </biblioentry>
1064 <!-- 32 -->
1065 <biblioentry xml:id="biblio.mscom">
1066 <title>
1067 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1068 xlink:href="https://www.microsoft.com/com/">
1069 COM: Component Model Object Technologies
1070 </link>
1071 </title>
1072 <publisher>
1073 <publishername>
1074 Microsoft
1075 </publishername>
1076 </publisher>
1077 </biblioentry>
1079 <!-- 33 -->
1080 <biblioentry xml:id="biblio.musser95rationale">
1081 <title>
1082 Rationale for Adding Hash Tables to the C++ Standard Template Library
1083 </title>
1084 <date>
1085 1995
1086 </date>
1088 <author>
1089 <personname>
1090 <firstname>
1091 David R.
1092 </firstname>
1093 <surname>
1094 Musser
1095 </surname>
1096 </personname>
1097 </author>
1099 </biblioentry>
1101 <!-- 35 -->
1102 <biblioentry xml:id="biblio.musser96stltutorial">
1103 <title>
1104 STL Tutorial and Reference Guide
1105 </title>
1106 <date>
1107 1996
1108 </date>
1110 <authorgroup>
1111 <author>
1112 <personname>
1113 <firstname>
1114 David R.
1115 </firstname>
1116 <surname>
1117 Musser
1118 </surname>
1119 </personname>
1120 </author>
1121 <author>
1122 <personname>
1123 <firstname>
1124 A.
1125 </firstname>
1126 <surname>
1127 Saini
1128 </surname>
1129 </personname>
1130 </author>
1131 </authorgroup>
1132 <publisher>
1133 <publishername>
1134 Addison-Wesley Publishing Company
1135 </publishername>
1136 </publisher>
1138 </biblioentry>
1141 <!-- 36 -->
1142 <biblioentry xml:id="biblio.nelson96stlpq">
1143 <title>
1144 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1145 xlink:href="http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority Queues and the STL
1146 </link>
1147 </title>
1148 <date>
1149 January 1996
1150 </date>
1152 <author>
1153 <personname>
1154 <firstname>
1155 Mark
1156 </firstname>
1157 <surname>
1158 Nelson
1159 </surname>
1160 </personname>
1161 </author>
1163 <publisher>
1164 <publishername>
1165 Dr. Dobbs Journal
1166 </publishername>
1167 </publisher>
1168 </biblioentry>
1171 <!-- 37 -->
1172 <biblioentry xml:id="biblio.okasaki98mereable">
1173 <title>
1174 Fast mergeable integer maps
1175 </title>
1176 <date>
1177 September 1998
1178 </date>
1179 <authorgroup>
1180 <author>
1181 <personname>
1182 <firstname>
1183 C.
1184 </firstname>
1185 <surname>
1186 Okasaki
1187 </surname>
1188 </personname>
1189 </author>
1190 <author>
1191 <personname>
1192 <firstname>
1193 A.
1194 </firstname>
1195 <surname>
1196 Gill
1197 </surname>
1198 </personname>
1199 </author>
1200 </authorgroup>
1201 <publisher>
1202 <publishername>
1203 In Workshop on ML
1204 </publishername>
1205 </publisher>
1206 </biblioentry>
1208 <!-- 38 -->
1209 <biblioentry xml:id="biblio.sgi_stl">
1210 <title>
1211 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1212 xlink:href="http://www.sgi.com/tech/stl/">
1213 Standard Template Library Programmer's Guide
1214 </link>
1215 </title>
1216 <author>
1217 <personname>
1218 <firstname>
1219 Matt
1220 </firstname>
1221 <surname>
1222 Austern
1223 </surname>
1224 </personname>
1225 </author>
1227 <publisher>
1228 <publishername>
1229 SGI
1230 </publishername>
1231 </publisher>
1232 </biblioentry>
1234 <!-- 39 -->
1235 <biblioentry xml:id="biblio.select_man">
1236 <title>
1237 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1238 xlink:href="http://pubs.opengroup.org/onlinepubs/9699919799/functions/select.html">
1239 select
1240 </link>
1241 </title>
1242 </biblioentry>
1245 <!-- 40 -->
1246 <biblioentry xml:id="biblio.sleator84amortized">
1247 <title>
1248 Amortized Efficiency of List Update Problems
1249 </title>
1250 <date>
1251 1984
1252 </date>
1253 <authorgroup>
1254 <author>
1255 <personname>
1256 <firstname>
1257 D. D.
1258 </firstname>
1259 <surname>
1260 Sleator
1261 </surname>
1262 </personname>
1263 </author>
1265 <author>
1266 <personname>
1267 <firstname>
1268 R. E.
1269 </firstname>
1270 <surname>
1271 Tarjan
1272 </surname>
1273 </personname>
1274 </author>
1275 </authorgroup>
1277 <publisher>
1278 <publishername>
1279 ACM Symposium on Theory of Computing
1280 </publishername>
1281 </publisher>
1282 </biblioentry>
1284 <!-- 41 -->
1285 <biblioentry xml:id="biblio.sleator85self">
1286 <title>
1287 Self-Adjusting Binary Search Trees
1288 </title>
1289 <date>
1290 1985
1291 </date>
1293 <authorgroup>
1294 <author>
1295 <personname>
1296 <firstname>
1297 D. D.
1298 </firstname>
1299 <surname>
1300 Sleator
1301 </surname>
1302 </personname>
1303 </author>
1305 <author>
1306 <personname>
1307 <firstname>
1308 R. E.
1309 </firstname>
1310 <surname>
1311 Tarjan
1312 </surname>
1313 </personname>
1314 </author>
1315 </authorgroup>
1317 <publisher>
1318 <publishername>
1319 ACM Symposium on Theory of Computing
1320 </publishername>
1321 </publisher>
1322 </biblioentry>
1324 <!-- 42 -->
1325 <biblioentry xml:id="biblio.stepanov94standard">
1326 <title>
1327 The Standard Template Library
1328 </title>
1329 <date>
1330 1984
1331 </date>
1332 <authorgroup>
1333 <author>
1334 <personname>
1335 <firstname>
1336 A. A.
1337 </firstname>
1338 <surname>
1339 Stepanov
1340 </surname>
1341 </personname>
1342 </author>
1343 <author>
1344 <personname>
1345 <firstname>
1346 M.
1347 </firstname>
1348 <surname>
1349 Lee
1350 </surname>
1351 </personname>
1352 </author>
1353 </authorgroup>
1354 </biblioentry>
1356 <!-- 43 -->
1357 <biblioentry xml:id="biblio.stroustrup97cpp">
1358 <title>
1359 The C++ Programming Langugage
1360 </title>
1361 <date>
1362 1997
1363 </date>
1365 <author>
1366 <personname>
1367 <firstname>
1368 Bjarne
1369 </firstname>
1370 <surname>
1371 Stroustrup
1372 </surname>
1373 </personname>
1374 </author>
1376 <publisher>
1377 <publishername>
1378 Addison-Wesley Publishing Company
1379 </publishername>
1380 </publisher>
1381 </biblioentry>
1383 <!-- 44 -->
1384 <biblioentry xml:id="biblio.vandevoorde2002cpptemplates">
1385 <title>
1386 C++ Templates: The Complete Guide
1387 </title>
1388 <date>
1389 2002
1390 </date>
1391 <authorgroup>
1392 <author>
1393 <personname>
1394 <firstname>
1395 D.
1396 </firstname>
1397 <surname>
1398 Vandevoorde
1399 </surname>
1400 </personname>
1401 </author>
1403 <author>
1404 <personname>
1405 <firstname>
1406 N. M.
1407 </firstname>
1408 <surname>
1409 Josuttis
1410 </surname>
1411 </personname>
1412 </author>
1413 </authorgroup>
1414 <publisher>
1415 <publishername>
1416 Addison-Wesley Publishing Company
1417 </publishername>
1418 </publisher>
1419 </biblioentry>
1422 <!-- 45 -->
1423 <biblioentry xml:id="biblio.wickland96thirty">
1424 <title>
1425 <link xmlns:xlink="http://www.w3.org/1999/xlink"
1426 xlink:href="http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip">
1427 Thirty Years Among the Dead
1428 </link>
1429 </title>
1430 <date>
1431 1996
1432 </date>
1434 <author>
1435 <personname>
1436 <firstname>
1437 C. A.
1438 </firstname>
1439 <surname>
1440 Wickland
1441 </surname>
1442 </personname>
1443 </author>
1445 <publisher>
1446 <publishername>
1447 National Psychological Institute
1448 </publishername>
1449 </publisher>
1450 </biblioentry>
1452 </bibliography>