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