.

# 1,300 Technical Data Science / Algorithm Terms Defined

Very interesting list of algorithm, data science, machine learning, and computer science keywords. To check the definition for any keyword, go to xlinux.nist.gov. For whatever reasons, and like in many similar lists, the top three letters have more entries than subsequent letters, as if the editor suddenly became lazy when hitting letter D (maybe product developers create products that start with letter A, B, or C, to show up at the top). Yet the winner is letter S. Lot's of stuff is missing, for instance "Naive Bayes", but all in all, this is a great list.

A

1. absolute performance guarantee
2. abstract data type
3. (a,b)-tree
4. accepting state
5. Ackermann's function
6. active data structure
7. acyclic directed graph: see directed acyclic graph
8. acyclic graph
18. ADT: see abstract data type
20. Aho-Corasick
21. algorithm
22. algorithm BSTW
23. algorithm FGK
24. algorithmically solvable: see decidable problem
25. all pairs shortest path
26. all simple paths
27. alphabet
28. Alpha Skip Search algorithm
29. alternating path
30. alternating Turing machine
31. alternation
32. American flag sort
33. amortized cost
34. ancestor
35. and
36. ANSI
37. antichain
38. antisymmetric
39. Apostolico-Crochemore
40. Apostolico-Giancarlo algorithm
41. approximate string matching: see string matching with errors
42. approximation algorithm
43. arborescence
44. arc: see edge
45. arithmetic coding
46. array
47. array index
48. array merging
49. array search
50. articulation point: see cut vertex
51. assignment problem
52. association list: see dictionary
53. associative
54. associative array
55. asymptotically tight bound
56. asymptotic bound
57. asymptotic lower bound
58. asymptotic space complexity
59. asymptotic time complexity
60. asymptotic upper bound
61. augmenting path
62. automaton
63. average case
64. average-case cost
65. AVL tree
66. axiomatic semantics

B

1. backtracking
2. bag
3. balance
4. balanced binary search tree
5. balanced binary tree
6. balanced k-way merge sort
7. balanced merge sort
8. balanced multiway merge
9. balanced multiway tree: see B-tree
10. balanced quicksort
11. balanced tree
12. balanced two-way merge sort
13. BANG file
14. Batcher sort: see bitonic sort
15. Baum Welch algorithm
16. BB(α) tree
17. BBP algorithm
18. BDD
19. BD-tree
20. Bellman-Ford algorithm
21. Benford's law
22. best case
23. best-case cost
24. best-first search
25. biconnected component
26. biconnected graph
27. bidirectional bubble sort
28. big-O notation
29. binary function
30. binary GCD
31. binary heap
32. binary insertion sort
33. binary knapsack problem: see knapsack problem
34. binary priority queue
35. binary relation
36. binary search
37. binary search tree
38. binary tree
39. binary tree representation of trees
40. bingo sort
41. binomial heap
42. binomial tree
43. bin packing problem
44. bin sort: see bucket sort
45. bintree
46. bipartite graph
47. bipartite matching
48. bisector
49. bitonic sort
50. bit vector
51. Bk tree
52. blind sort
53. blind trie
54. block
56. blocking flow
57. block search: see jump search
58. Bloom filter
59. blossom
60. bogosort
61. boolean
62. boolean expression
63. boolean function
64. border
65. Boruvka's algorithm
66. bottleneck traveling salesman
67. bottom-up tree automaton
68. boundary-based representation
69. bounded error probability in polynomial time: see BPP
70. bounded queue
71. bounded stack
72. Boyer-Moore
73. Boyer-Moore-Horspool
74. bozo sort
75. B+-tree
76. BPP
78. branch and bound
80. Bresenham's algorithm
81. brick sort
82. bridge
83. British Museum technique
84. brute force
85. brute force string search
86. brute force string search with mismatches
87. BSP-tree
88. B*-tree
89. B-tree
90. bubble sort
91. bucket
92. bucket array
93. bucketing method
94. bucket sort
95. bucket trie
96. buddy system
97. buddy tree
98. build-heap
99. Burrows-Wheeler transform
100. busy beaver
101. BV-tree
102. BWT: see Burrows-Wheeler transform
103. Byzantine generals

C

1. cactus stack
2. Calculus of Communicating Systems
3. calendar queue
4. candidate consistency testing
5. candidate verification
6. canonical complexity class
7. capacitated facility location
8. capacity
9. capacity constraint
10. cartesian tree: see randomized binary search tree
12. Caverphone
13. CCS
14. cell probe model
15. cell tree
16. cellular automaton
17. centroid
18. certificate
19. chain
20. chaining
21. child
22. Chinese postman problem
23. Chinese remainder theorem
24. Christofides algorithm
25. chromatic index
26. chromatic number
27. circuit
28. circuit complexity
29. circuit value problem
30. circular list
31. circular queue
32. clique
33. clique problem
34. clustering
35. clustering free
36. coalesced chaining
37. coarsening
38. cocktail shaker sort: see bidirectional bubble sort
39. codeword
40. coding tree
41. Collatz problem
42. collective recursion
43. collision
44. collision resolution scheme
45. Colussi
46. combination
47. comb sort
48. Commentz-Walter
49. Communicating Sequential Processes
50. commutative
51. compact DAWG
52. compact trie
53. comparison sort
54. competitive analysis
55. competitive ratio
56. complement
57. complete binary tree
58. complete graph
59. completely connected graph
60. complete tree
61. complexity
62. complexity class
63. computable
64. concave function
65. concurrent flow
68. confluently persistent data structure
69. conjunction
70. connected components
71. connected graph
72. constant function
73. continuous knapsack problem: see fractional knapsack problem
74. Cook reduction
75. Cook's theorem
76. CORDIC
77. counting sort
78. covering
79. CRC: see cyclic redundancy check
80. CRCW: see concurrent read, concurrent write
81. CREW: see concurrent read, exclusive write
82. critical path problem
83. CSP
84. CTL
85. cube root
86. cuckoo hashing
87. cut
88. cutting plane
89. cutting stock problem
90. cutting theorem
91. cut vertex
92. cycle
93. cyclic redundancy check

D

2. DAG: see directed acyclic graph
3. DAG shortest paths
4. data structure
5. DAWG: see directed acyclic word graph
6. decidable language
7. decidable problem
8. decimation: see prune and search
9. decision problem
10. decomposable searching problem
11. degree
12. dense graph
13. depoissonization
14. depth
15. depth-first search
16. deque
17. derangement
18. descendant
19. deterministic
20. deterministic algorithm
21. deterministic finite automata string search
22. deterministic finite automaton: see deterministic finite state machine
23. deterministic finite state machine
24. deterministic finite tree automaton
25. deterministic pushdown automaton
26. deterministic random bit generator: see pseudo-random number generator
27. deterministic tree automaton
28. Deutsch-Jozsa algorithm
29. DFA: see deterministic finite state machine
30. DFS: see depth-first search
31. DFS forest
32. DFTA: see deterministic finite tree automaton
33. diagonalization
34. diameter
35. dichotomic search
36. dictionary
37. diet: see discrete interval encoding tree
38. difference
39. digital search tree
40. digital tree
41. digraph: see directed graph
42. Dijkstra's algorithm
43. diminishing increment sort
44. dining philosophers
45. direct chaining
46. directed acyclic graph
47. directed acyclic word graph
48. directed graph
49. discrete interval encoding tree
50. discrete p-center
51. disjoint set
52. disjunction
53. distributional complexity
54. distribution sort
55. distributive partitioning sort
56. divide and conquer
57. divide and marriage before conquest
58. division method
59. domain
60. dominance tree sort
61. don't care
62. Doomsday rule
63. double-direction bubble sort: see bidirectional bubble sort
64. double-ended priority queue
65. double hashing
66. double left rotation
67. double metaphone
68. double right rotation
69. doubly-chained tree: see binary tree representation of trees
70. doubly-ended queue: see deque
72. DPDA: see deterministic pushdown automaton
73. DRBG: see pseudo-random number generator
74. D-tree
75. dual
76. dual linear program
77. Dutch national flag
78. dyadic tree: see binary tree
79. dynamic
80. dynamic array
81. dynamic hashing
82. dynamic Huffman coding: see adaptive Huffman coding
83. dynamic programming
84. dynamization transformation

E

1. easy split, hard merge
2. edge
3. edge coloring
4. edge connectivity
5. edge crossing
6. edge-weighted graph: see weighted graph
7. edit distance: see Levenshtein distance
8. edit operation
9. edit script
10. efficiency
11. 8 queens
12. elastic-bucket trie
13. element uniqueness
14. end-of-string
16. ERCW: see exclusive read, concurrent write
17. EREW: see exclusive read, exclusive write
18. Euclidean algorithm: see Euclid's algorithm
19. Euclidean distance
20. Euclidean Steiner tree
21. Euclidean traveling salesman problem
22. Euclid's algorithm
23. Euler cycle
24. Eulerian graph
25. Eulerian path: see Euler cycle
26. exact string matching: see string matching
27. EXCELL
28. exchange sort: see bubble sort
29. exclusive or: see xor
32. exhaustive search
33. existential state
34. expandable hashing
35. expander graph
36. exponential
37. extended binary tree
38. extended Euclid's algorithm
39. extended k-d tree
40. extendible hashing
41. external chaining: see separate chaining
42. external index
43. external memory algorithm
44. external memory data structure
45. external merge
46. external node: see leaf
47. external quicksort
49. external sort
50. extrapolation search: see interpolation search
51. extremal
52. extreme point

F

1. facility location
2. factor: see substring
3. factorial
4. fast fourier transform
5. fathoming
6. feasible region
7. feasible solution
8. feedback edge set
9. feedback vertex set
11. FFT: see fast fourier transform
12. Fibonaccian search
13. Fibonacci heap
14. Fibonacci number
15. Fibonacci tree
16. FIFO: see queue
17. filial-heir chain: see binary tree representation of trees
18. Find
19. find kth least element: see select kth element
20. finitary tree
21. finite Fourier transform
22. finite state automaton: see finite state machine
23. finite state machine
24. finite state machine minimization
25. finite state transducer
26. first child-next sibling binary tree: see binary tree representation of trees
27. first come, first served
28. first-in, first-out
29. Fisher-Yates shuffle
30. fixed-grid method
31. flash sort
32. flow
33. flow conservation
34. flow function
35. flow network
36. Floyd-Warshall algorithm
37. Ford-Bellman: see Bellman-Ford algorithm
38. Ford-Fulkerson method
39. forest
40. forest editing problem
41. formal language: see language
42. formal methods
43. formal verification
44. forward index
45. fractional knapsack problem
46. fractional solution
47. free edge
48. free tree
49. free vertex
50. frequency count heuristic
51. full array
52. full binary tree
53. full inverted index
54. fully dynamic graph problem
55. fully persistent data structure
56. fully polynomial approximation scheme
57. function
58. functional data structure: see active data structure

G

1. Galil-Giancarlo
2. Galil-Seiferas
3. gamma function
4. GBD-tree
5. GCD: see greatest common divisor
6. geometric optimization problem
7. global optimum
8. gnome sort
9. graph
10. graph coloring
11. graph concentration
12. graph drawing
13. graph isomorphism
14. graph partition
15. Gray code
16. greatest common divisor
17. greedy algorithm
18. greedy heuristic
19. grid drawing
20. grid file
21. Grover's algorithm

H

1. halting problem
2. Hamiltonian cycle
3. Hamiltonian path
4. Hamming distance
5. hard split, easy merge
6. hashbelt
7. hash function
8. hash heap
9. hash table
10. hash table delete
11. Hausdorff distance
12. hB-tree
14. heap
15. heapify
16. heap property
17. heapsort
18. heaviest common subsequence: see longest common subsequence
19. height
20. height-balanced binary search tree
21. height-balanced tree
22. heuristic
23. hidden Markov model
24. highest common factor: see greatest common divisor
25. histogram sort
26. HMM: see hidden Markov model
27. homeomorphic
28. horizontal visibility map
29. Horner's rule
30. Horspool: see Boyer-Moore-Horspool
32. Huffman coding
33. huge sparse array
34. Hungarian algorithm: see Munkres' assignment algorithm
35. hybrid algorithm
36. hyperedge
37. hypergraph

I

1. ideal merge
2. ideal random shuffle
3. implication
4. implies
5. inclusion-exclusion principle
6. inclusive or: see or
7. incompressible string
8. incremental hashing: see linear hashing
9. in-degree
10. independent set
11. index file
12. information theoretic bound
13. in-order traversal
14. in-place sort
15. insertion sort
16. integer linear program
17. integer multi-commodity flow
18. integer polyhedron
19. interactive proof system
20. interior-based representation
21. internal node
22. internal sort
23. interpolation search
24. interpolation-sequential search
25. interpolation sort: see histogram sort
26. intersection
27. interval tree
28. intractable
29. introsort: see introspective sort
30. introspective sort
31. inverse Ackermann function
32. inverse suffix array
33. inverted file index
34. inverted index
35. irreflexive
36. isomorphic
37. iteration

J

1. Jaro-Winkler
2. jelly-fish
3. Johnson's algorithm
4. Johnson-Trotter
5. JSort
6. J sort
7. jump list
8. jump search

K

1. Karnaugh map
2. Karp-Rabin
3. Karp reduction
4. k-ary heap
5. k-ary Huffman coding
6. k-ary tree
7. k-clustering
8. k-coloring
9. k-connected graph
10. k-d-B-tree
11. k-dimensional
12. K-dominant match
13. k-d tree
14. key
15. KMP: see Knuth-Morris-Pratt algorithm
16. KmpSkip Search
17. knapsack problem
18. knight's tour
19. Knuth-Morris-Pratt algorithm
20. Königsberg bridges problem: see Euler cycle
21. Kolmogorov complexity
22. Kraft's inequality
23. Kripke structure
24. Kruskal's algorithm
25. kth order Fibonacci numbers
26. kth shortest path
27. kth smallest element: see select kth element
28. KV diagram: see Karnaugh map
29. k-way merge
30. k-way merge sort
31. k-way tree: see k-ary tree

L

1. labeled graph
2. language
3. last-in, first-out
4. Las Vegas algorithm
5. lattice
6. layered graph
7. LCM: see least common multiple
8. LCS
9. leaf
10. least common multiple
11. leftist tree
12. left rotation
13. Lempel-Ziv-Welch
14. level
15. level-order traversal
16. Levenshtein distance
17. lexicographical order
18. LIFO: see stack
19. linear
20. linear congruential generator
21. linear hash
22. linear hashing
23. linear insertion sort: see insertion sort
24. linear order: see total order
25. linear probing
26. linear probing sort
27. linear product
28. linear program
30. linear search
33. list
34. list contraction
35. little-o notation
36. Lm distance
38. local alignment
39. locality-sensitive hashing
40. local optimum
41. logarithmic
42. longest common subsequence
43. longest common substring
44. Lotka's law
45. lower bound
46. lower triangular matrix
47. lowest common ancestor
48. l-reduction
49. lucky sort
50. LZW compression: see Lempel-Ziv-Welch

M

1. Malhotra-Kumar-Maheshwari blocking flow
2. Manhattan distance
3. many-one reduction
4. map: see dictionary
5. Markov chain
6. Marlena
7. marriage problem: see assignment problem
8. Master theorem
9. matched edge
10. matched vertex
11. matching
12. matrix
13. matrix-chain multiplication problem
14. max-heap property
15. maximal independent set
16. maximally connected component
17. Maximal Shift
18. maximum bipartite matching: see bipartite matching
19. maximum-flow problem
20. MAX-SNP
21. MBB: see minimum bounding box
22. Mealy machine
23. mean
24. median
25. meld
26. memoization
27. merge
28. merge sort
29. metaheuristic
30. metaphone
31. midrange
32. Miller-Rabin
33. min-heap property
34. minimal perfect hashing
35. minimax
36. minimum bounding box
37. minimum cut
38. minimum path cover
39. minimum spanning tree
40. minimum vertex cut
41. Minkowski distance: see Lm distance
42. mixed integer linear program
43. mode
44. model checking
45. model of computation
46. moderately exponential
47. MODIFIND
48. monotone priority queue
49. monotonically decreasing
50. monotonically increasing
51. Monte Carlo algorithm
52. Moore machine
53. Morris-Pratt algorithm
54. move: see transition
55. move-to-front heuristic
56. move-to-root heuristic
57. MST: see minimum spanning tree
58. multi-commodity flow
59. multigraph
60. multikey Quicksort
61. multilayer grid file
62. multiplication method
63. multiprefix
64. multiprocessor model
65. multi-set: see bag
66. multi suffix tree
67. multiway decision
68. multiway merge
69. multiway search tree
70. multiway tree
71. Munkres' assignment algorithm

N

1. naive string search: see brute force string search
2. nand
3. n-ary function
4. NC many-one reducibility
5. nearest neighbor
6. negation
7. network flow: see flow function
8. network flow problem: see maximum-flow problem
9. next state
10. NFA: see nondeterministic finite state machine
11. NFTA: see nondeterministic finite tree automaton
12. NIST
13. node
14. nonbalanced merge
15. nonbalanced merge sort
16. nondeterministic
17. nondeterministic algorithm
18. nondeterministic finite automaton: see nondeterministic finite state machine
19. nondeterministic finite state machine
20. nondeterministic finite tree automaton
21. nondeterministic polynomial time: see NP
22. nondeterministic tree automaton
23. nondeterministic Turing machine
24. nonterminal node: see internal node
25. nor
26. not
27. Not So Naive
28. NP
29. NP-complete
30. NP-complete language
31. NP-hard
32. n queens
33. nullary function: see 0-ary function
34. null tree
35. NYSIIS

O

1. O: see big-O notation
2. OBDD
3. objective function
4. oblivious algorithm
5. occurrence
6. octree
7. off-line algorithm
8. offset
9. omega
10. omicron
11. one-based indexing
12. one-dimensional
13. on-line algorithm
15. optimal
16. optimal cost: see best-case cost
17. optimal hashing: see perfect hashing
18. optimal merge
19. optimal mismatch
20. optimal polygon triangulation problem
21. optimal polyphase merge
22. optimal polyphase merge sort
23. optimal solution
24. optimal triangulation problem
25. optimal value
26. optimization problem
27. or
28. oracle set
29. oracle tape
30. oracle Turing machine
31. order
32. ordered array
33. ordered binary decision diagram: see OBDD
35. ordered tree
36. order-preserving hash: see linear hash
37. order-preserving Huffman coding
38. order-preserving minimal perfect hashing
39. oriented acyclic graph: see directed acyclic graph
40. oriented graph: see directed graph
41. oriented tree: see rooted tree
42. orthogonal drawing
43. orthogonal lists
44. orthogonally convex rectilinear polygon
45. oscillating merge sort
46. out-degree

P

1. packing
3. pagoda
4. pairing heap
5. PAM: see point access method
6. parallel computation thesis
7. parallel prefix computation
8. parallel random-access machine
9. parametric searching
10. parent
11. partial function
12. partially decidable problem
13. partially dynamic graph problem
14. partially ordered set: see poset
15. partially persistent data structure
16. partial order
17. partial recursive function
18. partition
19. passive data structure
20. path
21. path cover
22. path system problem
23. Patricia tree
24. pattern
25. pattern element
26. P-complete
27. PCP: see Post's correspondence problem
28. PDA: see pushdown automaton
29. Pearson's hash
30. perfect binary tree
31. perfect hashing
32. perfect k-ary tree
33. perfect matching
34. perfect shuffle
35. performance guarantee
36. performance ratio: see relative performance guarantee
37. permutation
38. persistent data structure
39. phonetic coding
40. pigeonhole sort
41. pile
42. pipelined divide and conquer
43. planar graph
44. planarization
45. planar straight-line graph
46. PLOP-hashing
47. point access method
48. pointer jumping
49. pointer machine
50. poissonization
51. polychotomy
52. polyhedron
53. polylogarithmic
54. polynomial
55. polynomial approximation scheme
56. polynomial hierarchy
57. polynomial time
58. polynomial-time reduction
59. polyphase merge
60. polyphase merge sort
61. polytope
62. poset
63. postfix traversal: see postorder traversal
64. Post machine
65. postman's sort
66. postorder traversal
67. Post's correspondence problem
68. potential function
69. PRAM: see parallel random-access machine
70. predicate
71. prefix
72. prefix code
73. prefix computation
74. prefix sums: see scan
75. prefix traversal: see preorder traversal
76. preorder traversal
77. primary clustering
78. primitive recursive
79. Prim-Jarnik algorithm
80. principle of optimality
81. priority queue
82. prisoner's dilemma
83. PRNG: see pseudo-random number generator
84. probabilistic algorithm
85. probabilistically checkable proof
86. probabilistic Turing machine
87. probe sequence
88. procedure
89. process algebra
90. proper
91. proper binary tree: see full binary tree
92. proper coloring
93. proper subset
94. property list: see dictionary
95. prune and search
96. pseudo-random number generator
97. PTAS: see polynomial approximation scheme
98. pth order Fibonacci numbers: see kth order Fibonacci numbers
99. P-tree
100. purely functional language
101. pushdown automaton
102. pushdown transducer
103. p-way merge sort: see k-way merge sort

Q

1. qm sort
2. q sort
7. quantum computation
8. queue
9. quick search
10. quicksort

R

1. Rabin-Karp: see Karp-Rabin
3. radix tree: see Patricia tree
4. ragged matrix
5. Raita
6. random access machine
7. randomization
8. randomized algorithm
9. randomized binary search tree
10. randomized complexity
11. randomized polynomial time: see RP
12. randomized rounding
13. randomized search tree
14. Randomized-Select
15. random number generator
16. random sampling
17. random search
18. range
19. range sort
20. rank
21. rapid sort
22. Ratcliff/Obershelp pattern recognition
23. RBST: see randomized binary search tree
24. reachable
25. rebalance
26. recognizer
27. rectangular matrix
28. rectilinear
29. rectilinear Steiner tree
30. recurrence equations: see recurrence relation
31. recurrence relation
32. recursion
33. recursion termination
34. recursion tree
35. recursive
36. recursive data structure
37. recursive doubling: see pointer jumping
38. recursive language: see decidable language
39. recursively enumerable language
40. recursively solvable: see decidable problem
41. red-black tree
42. reduced basis
43. reduced digraph
44. reduced ordered binary decision diagram
45. reduction
46. reflexive
47. regular decomposition
48. rehashing: see double hashing
49. relation
50. relational structure
51. relative performance guarantee
52. relaxation
53. relaxed balance
54. repeated squaring
55. rescalable
56. reservoir sampling
57. restricted universe sort
58. result cache
59. Reverse Colussi
60. Reverse Factor
61. R-file
62. Rice's method
63. right rotation
65. RNG: see random number generator
66. ROBDD: see reduced ordered binary decision diagram
67. Robin Hood hashing
68. root
69. root balance: see balance
70. rooted tree
71. rotate left: see left rotation
72. rotate right: see right rotation
73. rotation
74. rough graph
75. RP
76. R+-tree
77. R*-tree
78. R-tree
79. run time

S

1. saguaro stack: see cactus stack
2. SAM: see spatial access method
3. saturated edge
4. SBB tree
5. scan
6. scapegoat tree
7. scatter storage: see hash table
8. Schorr-Waite graph marking algorithm
9. search
10. search tree
11. search tree property
12. secant search
13. secondary clustering
14. segment
15. Select
16. select and partition
17. selection problem: see select kth element
18. selection sort
19. select kth element
20. select mode
21. self-loop
22. self-organizing list
23. self-organizing sequential search: see transpose sequential search
24. semidefinite programming
25. separate chaining
26. separation theorem
27. sequential search: see linear search
28. set
29. set cover
30. set packing
34. shaker sort: see bidirectional bubble sort
35. Shannon-Fano coding
36. shared memory
37. Shell sort
38. Shift-Or
39. Shor's algorithm
40. shortcutting: see pointer jumping
41. shortest common supersequence
42. shortest common superstring
43. shortest path
44. shortest spanning tree: see minimum spanning tree
45. shuffle: see permutation
46. shuffle sort
47. sibling
48. sieve of Eratosthenes
49. sift up
50. signature
51. Simon's algorithm
52. simple merge
53. simple path
54. simple uniform hashing
55. simplex
56. simulated annealing
57. simulation theorem
58. single-destination shortest-path problem
59. single-pair shortest-path problem: see shortest path
60. single program multiple data
61. single-source shortest-path problem
63. singularity analysis
64. sink
65. sinking sort: see bubble sort
66. skd-tree
67. skew symmetry
68. skip list
69. skip search
70. slope selection
71. Smith algorithm
72. Smith-Waterman algorithm
73. smoothsort
74. solvable
75. sort
76. sorted array
77. sorted list
78. sort in place: see in-place sort
79. soundex
80. source
81. space-constructible function
82. space ordering method
83. spanning tree
84. sparse graph
85. sparse matrix
86. sparsification
87. sparsity
88. spatial access method
89. spiral storage
90. splay tree
91. SPMD: see single program multiple data
92. square matrix
93. square root
94. SST: see minimum spanning tree
95. stable
96. stack
97. stack tree
98. star encoding
99. star-shaped polygon
100. start state
101. state
102. state machine
103. state transition: see transition
104. static
105. static Huffman coding: see Huffman coding
106. s-t cut
107. st-digraph
108. Steiner point
109. Steiner ratio
110. Steiner tree
111. Steiner vertex
112. Steinhaus-Johnson-Trotter: see Johnson-Trotter
113. Stirling's approximation
114. Stirling's formula
115. stooge sort
116. straight-line drawing
117. strand sort
118. strictly decreasing
119. strictly increasing
120. strictly lower triangular matrix
121. strictly upper triangular matrix
122. string
123. string editing problem
124. string matching
125. string matching on ordered alphabets
126. string matching with errors
127. string matching with mismatches
128. string searching: see string matching
129. strip packing
130. strongly connected component
131. strongly connected graph
132. strongly NP-hard
133. stupid sort
135. subgraph
136. subgraph isomorphism
137. sublinear time algorithm
138. subsequence
139. subset
140. substring
141. subtree
142. suffix
143. suffix array
144. suffix automaton
145. suffix tree
146. superimposed code
147. superset
148. supersink
149. supersource
150. symmetric
152. symmetric binary B-tree: see red-black tree
153. symmetric set difference
154. symmetry breaking

T

1. taco sort
2. tail
3. tail recursion
4. target
5. temporal logic
6. terminal
7. terminal node: see leaf
8. ternary search tree
9. text
10. text searching: see string matching
11. theta: see Θ
14. three-dimensional
15. three-way merge sort
16. three-way radix quicksort: see multikey Quicksort
17. time-constructible function
18. time/space complexity
20. top-down tree automaton
21. topological order
22. topological sort
23. topology tree
24. total function
25. totally decidable language: see decidable language
26. totally decidable problem: see decidable problem
27. totally undecidable problem
28. total order
29. tour: see Hamiltonian cycle
30. tournament
31. tournament sort
32. towers of Hanoi
33. tractable
34. transition
35. transition function
36. transitive
37. transitive closure
38. transitive reduction
39. transpose sequential search
40. traveling salesman
41. treap
42. tree
43. tree automaton
44. tree contraction
45. tree editing problem
46. treesort (1)
47. treesort (2)
48. tree traversal
49. triangle inequality
50. triconnected graph
51. trie
52. trinary function
53. tripartition
54. TSP: see traveling salesman
55. TST: see ternary search tree
56. Turbo-BM
57. Turbo Reverse Factor
58. Turing machine
59. Turing reduction
60. Turing transducer
61. twin grid file
62. 2-choice hashing
63. two-dimensional
64. 2-left hashing
65. two-level grid file
66. 2-3-4 tree
67. 2-3 tree
68. Two Way algorithm
70. two-way merge sort

U

1. UB-tree
2. UKP: see unbounded knapsack problem
3. unary function
4. unbounded knapsack problem
5. uncomputable function
6. uncomputable problem
7. undecidable language
8. undecidable problem
9. undirected graph
10. uniform circuit complexity
11. uniform circuit family
12. uniform hashing
13. uniform matrix
14. union
15. union of automata
16. universal B-tree
17. universal hashing
18. universal state
19. universal Turing machine
20. universe
21. unlimited branching tree
22. UnShuffle sort
23. unsolvable problem
24. unsorted list
25. upper triangular matrix

V

1. van Emde-Boas priority queue
2. vehicle routing problem
3. Veitch diagram: see Karnaugh map
4. Venn diagram
5. vertex
6. vertex coloring
7. vertex connectivity
8. vertex cover
9. vertical visibility map
10. virtual hashing
11. visibility map
12. visible
13. Viterbi algorithm
14. Vitter's algorithm
15. VRP: see vehicle routing problem

W

1. walk
2. WCET: see worst-case execution time
3. weak-heap
4. weak-heap sort
5. weight-balanced tree: see BB(α) tree
6. weighted, directed graph
7. weighted graph
8. window
9. witness
10. work
11. work-depth model
12. work-efficient
13. work-preserving
14. worst case
15. worst-case cost
16. worst-case execution time
17. worst-case minimum access

X

1. xor

Y

1. Yule distribution: see Zipfian distribution

Z

1. Zeller's congruence
2. 0-ary function
3. 0-based indexing
4. 0-1 knapsack problem: see knapsack problem
5. Zhu-Takaoka
6. Zipfian distribution
7. Zipf's law
8. zipper
9. ZPP

Views: 4010

Comment