word graph (DAWG) directed graph discrete interval encoding tree discrete p-center disjoint set disjunction distributed algorithm distributional complexity distribution sort divide-and-conquer algorithm divide and marriage before conquest division method data domain don't-care term Doomsday rule double-direction bubble sort double-ended priority queue double hashing double left rotation Double Metaphone double right rotation double-ended queue doubly linked list dragon curve dual graph dual linear program dyadic tree dynamic array dynamic data structure dynamic hashing dynamic programming dynamization transformation E edge eb tree (elastic binary tree) edge coloring edge connectivity edge crossing edge-weighted graph edit distance edit operation edit script 8 queens elastic-bucket trie element uniqueness end-of-string epidemic algorithm Euclidean algorithm Euclidean distance Euclidean Steiner tree Euclidean traveling salesman problem Euclid's algorithm Euler cycle Eulerian graph Eulerian path exact string matching EXCELL (extendible cell) exchange sort exclusive or exclusive read, concurrent write (ERCW) exclusive read, exclusive write (EREW) exhaustive search existential state expandable hashing expander graph exponential extended binary tree extended Euclidean algorithm extended k-d tree extendible hashing external index external memory algorithm external memory data structure external merge external merge sort external node external quicksort external radix sort external sort extrapolation search extremal extreme point F facility location factor (see substring) factorial fast fourier transform (FFT) fathoming feasible region feasible solution feedback edge set feedback vertex set Ferguson–Forcade algorithm Fibonacci number Fibonacci search Fibonacci tree Fibonacci heap Find find kth least element finitary tree finite Fourier transform (discrete Fourier transform) finite state automaton finite-state machine finite state machine minimization finite-state transducer first come, first served first-in, first-out (FIFO) fixed-grid method flash sort flow flow conservation flow function flow network Floyd–Warshall algorithm Ford–Bellman algorithm Ford–Fulkerson algorithm forest forest editing problem formal language formal methods formal verification forward index fractal fractional knapsack problem fractional solution free edge free list free tree free vertex frequency count heuristic full array full binary tree full inverted index fully dynamic graph problem fully persistent data structure fully polynomial approximation scheme function (programming) function (mathematics) functional data structure G Galil–Giancarlo Galil–Seiferas gamma function GBD-tree geometric optimization problem global optimum gnome sort goobi graph graph coloring graph concentration graph drawing graph isomorphism graph partition Gray code greatest common divisor (GCD) greedy algorithm greedy heuristic grid drawing grid file Grover's algorithm H halting problem Hamiltonian cycle Hamiltonian path Hamming distance Harter–Highway dragon hash function hash heap hash table hash table delete Hausdorff distance hB-tree head heap heapify heap property heapsort heaviest