Bounding volume hierarchy, also referred to as bounding volume tree (BV-tree, BVT) Boyer–Moore string-search algorithm Boyer–Moore–Horspool algorithm bozo sort B+ tree BPP (complexity) Bradford's law branch (as in control flow) branch (as in revision control) branch and bound breadth-first search Bresenham's line algorithm brick sort bridge British Museum algorithm brute-force attack brute-force search brute-force string search brute-force string search with mismatches BSP-tree B*-tree B-tree bubble sort bucket bucket array bucketing method bucket sort bucket trie buddy system buddy tree build-heap Burrows–Wheeler transform (BWT) busy beaver Byzantine generals C cactus stack Calculus of Communicating Systems (CCS) calendar queue candidate consistency testing candidate verification canonical complexity class capacitated facility location capacity capacity constraint Cartesian tree cascade merge sort caverphone Cayley–Purser algorithm C curve cell probe model cell tree cellular automaton centroid certificate chain (order theory) chaining (algorithm) child Chinese postman problem Chinese remainder theorem Christofides algorithm Christofides heuristic chromatic index chromatic number Church–Turing thesis circuit circuit complexity circuit value problem circular list circular queue clique clique problem clustering (see hash table) clustering free coalesced hashing coarsening cocktail shaker sort codeword coding tree collective recursion collision collision resolution scheme Colussi combination comb sort Communicating Sequential Processes commutative compact DAWG compact trie comparison sort competitive analysis competitive ratio complement complete binary tree complete graph completely connected graph complete tree complexity complexity class computable concave function concurrent flow concurrent read, concurrent write concurrent read, exclusive write configuration confluently persistent data structure conjunction connected components connected graph co-NP constant function continuous knapsack problem Cook reduction Cook's theorem counting sort covering CRCW Crew (algorithm) critical path problem CSP (communicating sequential processes) CSP (constraint satisfaction problem) CTL cuckoo hashing cuckoo filter cut (graph theory) cut (logic programming) cutting plane cutting stock problem cutting theorem cut vertex cycle sort cyclic redundancy check (CRC) D D-adjacent DAG shortest paths Damerau–Levenshtein distance data structure decidable decidable language decimation decision problem decision tree decomposable searching problem degree dense graph depoissonization depth depth-first search (DFS) deque derangement descendant (see tree structure) deterministic deterministic algorithm deterministic finite automata string search deterministic finite automaton (DFA) deterministic finite state machine deterministic finite tree automaton deterministic pushdown automaton (DPDA) deterministic tree automaton Deutsch–Jozsa algorithm DFS forest DFTA diagonalization argument diameter dichotomic search dictionary (data structure) diet (see discrete interval encoding tree below) difference (set theory) digital search tree digital tree digraph Dijkstra's algorithm diminishing increment sort dining philosophers direct chaining hashing directed acyclic graph (DAG) directed acyclic