# Bibliography

## STL Exception Handling Contract

1997
Dave
Abrahams
ISO SC22/WG21

## Modern C++ Design: Generic Programming and Design Patterns Applied

2001
Andrei
Alexandrescu
Addison-Wesley Publishing Company

## MTF, Bit, and COMB: A Guide to Deterministic and Randomized Algorithms for the List Update Problem

K.
Andrew
D.
Gleich

## Why You Shouldn't Use set - and What You Should Use Instead

April, 2000
Matthew
Austern
C++ Report

## A Proposal to Add Hashtables to the Standard Library

2001
Matthew
Austern
ISO SC22/WG21

## Segmented iterators and hierarchical algorithms

April, 1998
Matthew
Austern
Generic Programming

## Boost Timer Library

Beeman
Dawes
Boost

## Boost Pool Library

Stephen
Cleary
Boost

## Boost Type Traits Library

Maddock
John
Stephen
Cleary
Boost

## Worst-case efficient priority queues

Gerth
Stolting Brodal

## Efficient C++ Programming Techniques

1997
D.
Bulka
D.
Mayhew
Addison-Wesley Publishing Company

## Introduction to Algorithms, 2nd edition

2001
T. H.
Cormen
C. E.
Leiserson
R. L.
Rivest
C.
Stein
MIT Press

## Balls and bins: A study in negative dependence

1998
D.
Dubashi
D.
Ranjan
Random Structures and Algorithms 13

## Extendible hashing - a fast access method for dynamic files

1979
R.
Fagin
J.
Nievergelt
N.
Pippenger
H. R.
Strong
ACM Trans. Database Syst. 4

## Ptset: Sets of integers implemented as Patricia trees

2000
Jean-Christophe
Filliatre

## The pairing heap: a new form of self-adjusting heap

1986
M. L.
Fredman
R.
Sedgewick
D. D.
Sleator
R. E.
Tarjan

## Design Patterns - Elements of Reusable Object-Oriented Software

1995
E.
Gamma
R.
Helm
R.
Johnson
J.
Vlissides
Addison-Wesley Publishing Company

## Order-preserving key transformations

1986
A. K.
Garg
C. C.
Gotlieb
Trans. Database Syst. 11

## Making a real hash of things

May 2002
J.
Hyslop
Herb
Sutter
C++ Report

## The C++ Standard Library - A Tutorial and Reference

2001
N. M.
Jossutis
Addison-Wesley Publishing Company

## New Heap Data Structures

1999
Haim
Kaplan
Robert E.
Tarjan

## Are Set Iterators Mutable or Immutable?

October 2000
Angelika
Langer
Klaus
Kleft
C/C++ Users Jornal

## The Art of Computer Programming - Sorting and Searching

1998
D. E.
Knuth
Addison-Wesley Publishing Company

## Data abstraction and hierarchy

May 1998
B.
Liskov
SIGPLAN Notices 23

## Linear hashing: A new tool for file and table addressing

June 1980
W.
Litwin
Proceedings of International Conference on Very Large Data Bases

## Deamortization - Part 2: Binomial Heaps

2005
Maverik
Woo

## More Effective C++: 35 New Ways to Improve Your Programs and Designs

1996
Scott
Meyers
Addison-Wesley Publishing Company

## How Non-Member Functions Improve Encapsulation

2000
Scott
Meyers
C/C++ Users Journal

## Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library

2001
Scott
Meyers
Addison-Wesley Publishing Company

## Class Template, Member Template - or Both?

2003
Scott
Meyers
C/C++ Users Journal

## Randomized Algorithms

2003
R.
Motwani
P.
Raghavan
Cambridge University Press

## COM: Component Model Object Technologies

Microsoft

## Rationale for Adding Hash Tables to the C++ Standard Template Library

1995
David R.
Musser

## STL Tutorial and Reference Guide

1996
David R.
Musser
A.
Saini
Addison-Wesley Publishing Company

## Priority Queues and the STL

January 1996
Mark
Nelson
Dr. Dobbs Journal

## Fast mergeable integer maps

September 1998
C.
Okasaki
A.
Gill
In Workshop on ML

## Standard Template Library Programmer's Guide

Matt
Austern
SGI

## select

## Amortized Efficiency of List Update Problems

1984
D. D.
Sleator
R. E.
Tarjan
ACM Symposium on Theory of Computing

## Self-Adjusting Binary Search Trees

1985
D. D.
Sleator
R. E.
Tarjan
ACM Symposium on Theory of Computing

## The Standard Template Library

1984
A. A.
Stepanov
M.
Lee

## The C++ Programming Langugage

1997
Bjarne
Stroustrup
Addison-Wesley Publishing Company

## C++ Templates: The Complete Guide

2002
D.
Vandevoorde
N. M.
Josuttis
Addison-Wesley Publishing Company

## Thirty Years Among the Dead

1996
C. A.
Wickland
National Psychological Institute