1 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> 6 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> 16 17 <author> 18 <personname> 19 <firstname> 20 Dave 21 </firstname> 22 <surname> 23 Abrahams 24 </surname> 25 </personname> 26 </author> 27 28 <publisher> 29 <publishername> 30 ISO SC22/WG21 31 </publishername> 32 </publisher> 33 </biblioentry> 34 35 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> 44 45 <author> 46 <personname> 47 <firstname> 48 Andrei 49 </firstname> 50 <surname> 51 Alexandrescu 52 </surname> 53 </personname> 54 </author> 55 56 <publisher> 57 <publishername> 58 Addison-Wesley Publishing Company 59 </publishername> 60 </publisher> 61 </biblioentry> 62 63 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> 70 71 <authorgroup> 72 <author> 73 <personname> 74 <firstname> 75 K. 76 </firstname> 77 <surname> 78 Andrew 79 </surname> 80 </personname> 81 </author> 82 83 <author> 84 <personname> 85 <firstname> 86 D. 87 </firstname> 88 <surname> 89 Gleich 90 </surname> 91 </personname> 92 </author> 93 </authorgroup> 94 </biblioentry> 95 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> 104 105 <author> 106 <personname> 107 <firstname> 108 Matthew 109 </firstname> 110 <surname> 111 Austern 112 </surname> 113 </personname> 114 </author> 115 116 <publisher> 117 <publishername> 118 C++ Report 119 </publishername> 120 </publisher> 121 </biblioentry> 122 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> 134 135 <author> 136 <personname> 137 <firstname> 138 Matthew 139 </firstname> 140 <surname> 141 Austern 142 </surname> 143 </personname> 144 </author> 145 146 <publisher> 147 <publishername> 148 ISO SC22/WG21 149 </publishername> 150 </publisher> 151 </biblioentry> 152 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> 161 162 <author> 163 <personname> 164 <firstname> 165 Matthew 166 </firstname> 167 <surname> 168 Austern 169 </surname> 170 </personname> 171 </author> 172 173 <publisher> 174 <publishername> 175 Generic Programming 176 </publishername> 177 </publisher> 178 </biblioentry> 179 180 <!-- 07 --> 181 <biblioentry xml:id="biblio.dawestimer"> 182 <title> 183 <link xmlns:xlink="http://www.w3.org/1999/xlink" 184 xlink:href="http://www.boost.org/libs/timer/"> 185 Boost Timer Library 186 </link> 187 </title> 188 189 <author> 190 <personname> 191 <firstname> 192 Beeman 193 </firstname> 194 <surname> 195 Dawes 196 </surname> 197 </personname> 198 </author> 199 200 <publisher> 201 <publishername> 202 Boost 203 </publishername> 204 </publisher> 205 </biblioentry> 206 207 <!-- 08 --> 208 <biblioentry xml:id="biblio.clearypool"> 209 <title> 210 <link xmlns:xlink="http://www.w3.org/1999/xlink" 211 xlink:href="http://www.boost.org/libs/pool/"> 212 Boost Pool Library 213 </link> 214 </title> 215 216 <author> 217 <personname> 218 <firstname> 219 Stephen 220 </firstname> 221 <surname> 222 Cleary 223 </surname> 224 </personname> 225 </author> 226 227 <publisher> 228 <publishername> 229 Boost 230 </publishername> 231 </publisher> 232 </biblioentry> 233 234 235 <!-- 09 --> 236 <biblioentry xml:id="biblio.maddocktraits"> 237 <title> 238 <link xmlns:xlink="http://www.w3.org/1999/xlink" 239 xlink:href="http://www.boost.org/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> 271 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> 280 281 <author> 282 <personname> 283 <firstname> 284 Gerth 285 </firstname> 286 <surname> 287 Stolting Brodal 288 </surname> 289 </personname> 290 </author> 291 292 </biblioentry> 293 294 <!-- 11 --> 295 <biblioentry xml:id="biblio.bulkamayheweff"> 296 <title> 297 Efficient C++ Programming Techniques 298 </title> 299 <date> 300 1997 301 </date> 302 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> 325 326 <publisher> 327 <publishername> 328 Addison-Wesley Publishing Company 329 </publishername> 330 </publisher> 331 </biblioentry> 332 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> 352 353 <author> 354 <personname> 355 <firstname> 356 C. E. 357 </firstname> 358 <surname> 359 Leiserson 360 </surname> 361 </personname> 362 </author> 363 364 <author> 365 <personname> 366 <firstname> 367 R. L. 368 </firstname> 369 <surname> 370 Rivest 371 </surname> 372 </personname> 373 </author> 374 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> 392 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> 423 424 <publisher> 425 <publishername> 426 Random Structures and Algorithms 13 427 </publishername> 428 </publisher> 429 </biblioentry> 430 431 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> 440 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> 483 484 <publisher> 485 <publishername> 486 ACM Trans. Database Syst. 4 487 </publishername> 488 </publisher> 489 </biblioentry> 490 491 492 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> 501 502 <date> 503 2000 504 </date> 505 506 <author> 507 <personname> 508 <firstname> 509 Jean-Christophe 510 </firstname> 511 <surname> 512 Filliatre 513 </surname> 514 </personname> 515 </author> 516 </biblioentry> 517 518 519 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> 574 575 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> 632 633 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> 664 665 <publisher> 666 <publishername> 667 Trans. Database Syst. 11 668 </publishername> 669 </publisher> 670 </biblioentry> 671 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> 702 703 <publisher> 704 <publishername> 705 C++ Report 706 </publishername> 707 </publisher> 708 </biblioentry> 709 710 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> 719 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> 736 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> 748 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> 772 773 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> 793 794 <author> 795 <personname> 796 <firstname> 797 Klaus 798 </firstname> 799 <surname> 800 Kleft 801 </surname> 802 </personname> 803 </author> 804 </authorgroup> 805 806 <publisher> 807 <publishername> 808 C/C++ Users Jornal 809 </publishername> 810 </publisher> 811 </biblioentry> 812 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> 821 822 <author> 823 <personname> 824 <firstname> 825 D. E. 826 </firstname> 827 <surname> 828 Knuth 829 </surname> 830 </personname> 831 </author> 832 833 <publisher> 834 <publishername> 835 Addison-Wesley Publishing Company 836 </publishername> 837 </publisher> 838 </biblioentry> 839 840 <!-- 24 --> 841 <biblioentry xml:id="biblio.liskov98data"> 842 <title> 843 Data abstraction and hierarchy 844 </title> 845 <date> 846 May 1998 847 </date> 848 849 <author> 850 <personname> 851 <firstname> 852 B. 853 </firstname> 854 <surname> 855 Liskov 856 </surname> 857 </personname> 858 </author> 859 860 <publisher> 861 <publishername> 862 SIGPLAN Notices 23 863 </publishername> 864 </publisher> 865 </biblioentry> 866 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> 875 876 <author> 877 <personname> 878 <firstname> 879 W. 880 </firstname> 881 <surname> 882 Litwin 883 </surname> 884 </personname> 885 </author> 886 887 <publisher> 888 <publishername> 889 Proceedings of International Conference on Very Large Data Bases 890 </publishername> 891 </publisher> 892 </biblioentry> 893 894 <!-- 26 --> 895 <biblioentry xml:id="biblio.maverick_lowerbounds"> 896 <title> 897 Deamortization - Part 2: Binomial Heaps 898 </title> 899 <date> 900 2005 901 </date> 902 903 <author> 904 <personname> 905 <firstname> 906 Maverick 907 </firstname> 908 <surname> 909 Woo 910 </surname> 911 </personname> 912 </author> 913 </biblioentry> 914 915 <!-- 27 --> 916 <biblioentry xml:id="biblio.meyers96more"> 917 <title> 918 More Effective C++: 35 New Ways to Improve Your Programs and Designs 919 </title> 920 <date> 921 1996 922 </date> 923 924 <author> 925 <personname> 926 <firstname> 927 Scott 928 </firstname> 929 <surname> 930 Meyers 931 </surname> 932 </personname> 933 </author> 934 935 <publisher> 936 <publishername> 937 Addison-Wesley Publishing Company 938 </publishername> 939 </publisher> 940 </biblioentry> 941 942 <!-- 28 --> 943 <biblioentry xml:id="biblio.meyers00nonmember"> 944 <title> 945 How Non-Member Functions Improve Encapsulation 946 </title> 947 <date> 948 2000 949 </date> 950 951 <author> 952 <personname> 953 <firstname> 954 Scott 955 </firstname> 956 <surname> 957 Meyers 958 </surname> 959 </personname> 960 </author> 961 962 <publisher> 963 <publishername> 964 C/C++ Users Journal 965 </publishername> 966 </publisher> 967 </biblioentry> 968 969 <!-- 29 --> 970 <biblioentry xml:id="biblio.meyers01stl"> 971 <title> 972 Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library 973 </title> 974 <date> 975 2001 976 </date> 977 978 <author> 979 <personname> 980 <firstname> 981 Scott 982 </firstname> 983 <surname> 984 Meyers 985 </surname> 986 </personname> 987 </author> 988 989 <publisher> 990 <publishername> 991 Addison-Wesley Publishing Company 992 </publishername> 993 </publisher> 994 </biblioentry> 995 996 <!-- 30 --> 997 <biblioentry xml:id="biblio.meyers02both"> 998 <title> 999 Class Template, Member Template - or Both? 1000 </title> 1001 <date> 1002 2003 1003 </date> 1004 1005 <author> 1006 <personname> 1007 <firstname> 1008 Scott 1009 </firstname> 1010 <surname> 1011 Meyers 1012 </surname> 1013 </personname> 1014 </author> 1015 1016 <publisher> 1017 <publishername> 1018 C/C++ Users Journal 1019 </publishername> 1020 </publisher> 1021 </biblioentry> 1022 1023 <!-- 31 --> 1024 <biblioentry xml:id="biblio.motwani95random"> 1025 <title> 1026 Randomized Algorithms 1027 </title> 1028 <date> 1029 2003 1030 </date> 1031 <authorgroup> 1032 <author> 1033 <personname> 1034 <firstname> 1035 R. 1036 </firstname> 1037 <surname> 1038 Motwani 1039 </surname> 1040 </personname> 1041 </author> 1042 <author> 1043 <personname> 1044 <firstname> 1045 P. 1046 </firstname> 1047 <surname> 1048 Raghavan 1049 </surname> 1050 </personname> 1051 </author> 1052 </authorgroup> 1053 <publisher> 1054 <publishername> 1055 Cambridge University Press 1056 </publishername> 1057 </publisher> 1058 </biblioentry> 1059 1060 1061 <!-- 32 --> 1062 <biblioentry xml:id="biblio.mscom"> 1063 <title> 1064 <link xmlns:xlink="http://www.w3.org/1999/xlink" 1065 xlink:href="https://docs.microsoft.com/en-us/windows/win32/com/the-component-object-model"> 1066 COM: Component Model Object Technologies 1067 </link> 1068 </title> 1069 <publisher> 1070 <publishername> 1071 Microsoft 1072 </publishername> 1073 </publisher> 1074 </biblioentry> 1075 1076 <!-- 33 --> 1077 <biblioentry xml:id="biblio.musser95rationale"> 1078 <title> 1079 Rationale for Adding Hash Tables to the C++ Standard Template Library 1080 </title> 1081 <date> 1082 1995 1083 </date> 1084 1085 <author> 1086 <personname> 1087 <firstname> 1088 David R. 1089 </firstname> 1090 <surname> 1091 Musser 1092 </surname> 1093 </personname> 1094 </author> 1095 1096 </biblioentry> 1097 1098 <!-- 35 --> 1099 <biblioentry xml:id="biblio.musser96stltutorial"> 1100 <title> 1101 STL Tutorial and Reference Guide 1102 </title> 1103 <date> 1104 1996 1105 </date> 1106 1107 <authorgroup> 1108 <author> 1109 <personname> 1110 <firstname> 1111 David R. 1112 </firstname> 1113 <surname> 1114 Musser 1115 </surname> 1116 </personname> 1117 </author> 1118 <author> 1119 <personname> 1120 <firstname> 1121 A. 1122 </firstname> 1123 <surname> 1124 Saini 1125 </surname> 1126 </personname> 1127 </author> 1128 </authorgroup> 1129 <publisher> 1130 <publishername> 1131 Addison-Wesley Publishing Company 1132 </publishername> 1133 </publisher> 1134 1135 </biblioentry> 1136 1137 1138 <!-- 36 --> 1139 <biblioentry xml:id="biblio.nelson96stlpq"> 1140 <title> 1141 <link xmlns:xlink="http://www.w3.org/1999/xlink" 1142 xlink:href="https://marknelson.us/posts/1996/01/01/priority-queues.html">Priority Queues and the STL 1143 </link> 1144 </title> 1145 <date> 1146 January 1996 1147 </date> 1148 1149 <author> 1150 <personname> 1151 <firstname> 1152 Mark 1153 </firstname> 1154 <surname> 1155 Nelson 1156 </surname> 1157 </personname> 1158 </author> 1159 1160 <publisher> 1161 <publishername> 1162 Dr. Dobbs Journal 1163 </publishername> 1164 </publisher> 1165 </biblioentry> 1166 1167 1168 <!-- 37 --> 1169 <biblioentry xml:id="biblio.okasaki98mereable"> 1170 <title> 1171 Fast mergeable integer maps 1172 </title> 1173 <date> 1174 September 1998 1175 </date> 1176 <authorgroup> 1177 <author> 1178 <personname> 1179 <firstname> 1180 C. 1181 </firstname> 1182 <surname> 1183 Okasaki 1184 </surname> 1185 </personname> 1186 </author> 1187 <author> 1188 <personname> 1189 <firstname> 1190 A. 1191 </firstname> 1192 <surname> 1193 Gill 1194 </surname> 1195 </personname> 1196 </author> 1197 </authorgroup> 1198 <publisher> 1199 <publishername> 1200 In Workshop on ML 1201 </publishername> 1202 </publisher> 1203 </biblioentry> 1204 1205 <!-- 38 --> 1206 <biblioentry xml:id="biblio.sgi_stl"> 1207 <title> 1208 <link xmlns:xlink="http://www.w3.org/1999/xlink" 1209 xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/"> 1210 Standard Template Library Programmer's Guide 1211 </link> 1212 </title> 1213 <author> 1214 <personname> 1215 <firstname> 1216 Matt 1217 </firstname> 1218 <surname> 1219 Austern 1220 </surname> 1221 </personname> 1222 </author> 1223 1224 <publisher> 1225 <publishername> 1226 SGI 1227 </publishername> 1228 </publisher> 1229 </biblioentry> 1230 1231 <!-- 39 --> 1232 <biblioentry xml:id="biblio.select_man"> 1233 <title> 1234 <link xmlns:xlink="http://www.w3.org/1999/xlink" 1235 xlink:href="https://pubs.opengroup.org/onlinepubs/9699919799/functions/select.html"> 1236 select 1237 </link> 1238 </title> 1239 </biblioentry> 1240 1241 1242 <!-- 40 --> 1243 <biblioentry xml:id="biblio.sleator84amortized"> 1244 <title> 1245 Amortized Efficiency of List Update Problems 1246 </title> 1247 <date> 1248 1984 1249 </date> 1250 <authorgroup> 1251 <author> 1252 <personname> 1253 <firstname> 1254 D. D. 1255 </firstname> 1256 <surname> 1257 Sleator 1258 </surname> 1259 </personname> 1260 </author> 1261 1262 <author> 1263 <personname> 1264 <firstname> 1265 R. E. 1266 </firstname> 1267 <surname> 1268 Tarjan 1269 </surname> 1270 </personname> 1271 </author> 1272 </authorgroup> 1273 1274 <publisher> 1275 <publishername> 1276 ACM Symposium on Theory of Computing 1277 </publishername> 1278 </publisher> 1279 </biblioentry> 1280 1281 <!-- 41 --> 1282 <biblioentry xml:id="biblio.sleator85self"> 1283 <title> 1284 Self-Adjusting Binary Search Trees 1285 </title> 1286 <date> 1287 1985 1288 </date> 1289 1290 <authorgroup> 1291 <author> 1292 <personname> 1293 <firstname> 1294 D. D. 1295 </firstname> 1296 <surname> 1297 Sleator 1298 </surname> 1299 </personname> 1300 </author> 1301 1302 <author> 1303 <personname> 1304 <firstname> 1305 R. E. 1306 </firstname> 1307 <surname> 1308 Tarjan 1309 </surname> 1310 </personname> 1311 </author> 1312 </authorgroup> 1313 1314 <publisher> 1315 <publishername> 1316 ACM Symposium on Theory of Computing 1317 </publishername> 1318 </publisher> 1319 </biblioentry> 1320 1321 <!-- 42 --> 1322 <biblioentry xml:id="biblio.stepanov94standard"> 1323 <title> 1324 The Standard Template Library 1325 </title> 1326 <date> 1327 1984 1328 </date> 1329 <authorgroup> 1330 <author> 1331 <personname> 1332 <firstname> 1333 A. A. 1334 </firstname> 1335 <surname> 1336 Stepanov 1337 </surname> 1338 </personname> 1339 </author> 1340 <author> 1341 <personname> 1342 <firstname> 1343 M. 1344 </firstname> 1345 <surname> 1346 Lee 1347 </surname> 1348 </personname> 1349 </author> 1350 </authorgroup> 1351 </biblioentry> 1352 1353 <!-- 43 --> 1354 <biblioentry xml:id="biblio.stroustrup97cpp"> 1355 <title> 1356 The C++ Programming Langugage 1357 </title> 1358 <date> 1359 1997 1360 </date> 1361 1362 <author> 1363 <personname> 1364 <firstname> 1365 Bjarne 1366 </firstname> 1367 <surname> 1368 Stroustrup 1369 </surname> 1370 </personname> 1371 </author> 1372 1373 <publisher> 1374 <publishername> 1375 Addison-Wesley Publishing Company 1376 </publishername> 1377 </publisher> 1378 </biblioentry> 1379 1380 <!-- 44 --> 1381 <biblioentry xml:id="biblio.vandevoorde2002cpptemplates"> 1382 <title> 1383 C++ Templates: The Complete Guide 1384 </title> 1385 <date> 1386 2002 1387 </date> 1388 <authorgroup> 1389 <author> 1390 <personname> 1391 <firstname> 1392 D. 1393 </firstname> 1394 <surname> 1395 Vandevoorde 1396 </surname> 1397 </personname> 1398 </author> 1399 1400 <author> 1401 <personname> 1402 <firstname> 1403 N. M. 1404 </firstname> 1405 <surname> 1406 Josuttis 1407 </surname> 1408 </personname> 1409 </author> 1410 </authorgroup> 1411 <publisher> 1412 <publishername> 1413 Addison-Wesley Publishing Company 1414 </publishername> 1415 </publisher> 1416 </biblioentry> 1417 1418 1419 <!-- 45 --> 1420 <biblioentry xml:id="biblio.wickland96thirty"> 1421 <title> 1422 Thirty Years Among the Dead 1423 </title> 1424 <date> 1425 1996 1426 </date> 1427 1428 <author> 1429 <personname> 1430 <firstname> 1431 C. A. 1432 </firstname> 1433 <surname> 1434 Wickland 1435 </surname> 1436 </personname> 1437 </author> 1438 1439 <publisher> 1440 <publishername> 1441 National Psychological Institute 1442 </publishername> 1443 </publisher> 1444 </biblioentry> 1445 1446</bibliography> 1447