abouelhodam abramsonb abstract data types (adts) - disjoint sets see disjoint sets hash tables see hash tables lists see lists queues see queues stacks see stacks accessors for classes - for matrices - ackermann function activation records - activity-node graphs - acyclic graphs - address-of operator (&for pointers adelson-velskiig adjacency lists for graph representation - references for adjacency matrices adjacent vertices adversary arguments - aggarwala agrawalm ahoa ahujar airport systemsgraphs for albertsonm algorithm analysis components of - computational models for mathematical background for - running times see running times algorithm design approximate bin packing see approximate bin packing backtracking algorithms see backtracking algorithms divide and conquer strategy see divide and conquer strategy dynamic programming see dynamic programming greedy algorithms see greedy algorithms random number generators - randomized algorithms - primality tests - skip lists - all-pairs shortest-path algorithm allenb allpairs function alonn alpha-beta pruning alurus amortized analysis binomial queues - fibonacci heaps see fibonacci heaps references for skew heaps - splay trees - amortized bound times ancestors in trees anderssona approximate bin packing - best fit for - first fit for - next fit for off-line algorithms for - on-line algorithms for references for approximate pattern matching aragonc arbitmany arcsgraph arikawas arimurah arithmetic problems integer multiplication - matrix multiplication - arithmetic series arrays for binary heaps -style - for complete binary trees for graph representation for hash tables see hash tables inversion in - for lists - maps for - for matrices see matrices for queues - for quicksort in sorting see sorting for stacks strings for - for vectors articulation points - ascii character set assertisvalid function assigning pointers assignlow function