User:Kakurady/Missing science topics from NIST Dictionary of Algorithms and Data Structures
Appearance
This is a copy of Wikipedia:Missing science topics/NIST Dictionary of Algorithms and Data Structures, sorted by the last word; based on the observation that there is a lot of items that are variations on some concept (for example, trees). Hopefully this will group similar things together.
A
[edit]- worst-case minimum access (DADS)
- D-adjacent (DADS)
- uniform greedy algorithm (DADS)
- hybrid algorithm (DADS)
- Two Way algorithm (DADS)
- string matching on ordered alphabets (DADS)
- singularity analysis (DADS)
- full array (DADS)
- ordered array (DADS)
- odd shaped array (DADS)
- suffix automaton (DADS)
B
[edit]C
[edit]- discrete p-center (DADS)
- secondary clustering (DADS)
- coarsening (DADS)
- phonetic coding (DADS)
- Colussi (DADS)
- Reverse Colussi (DADS)
- distributional complexity (DADS)
- maximally connected component (DADS)
- prefix computation (DADS)
- parallel prefix computation (DADS)
- graph concentration (DADS)
- heap condition (DADS)
- pipelined divide and conquer (DADS)
- list contraction (DADS)
- tree contraction (DADS)
- optimal cost (DADS)
- Apostolico-Crochemore (DADS)
- short cutting (DADS)
D
[edit]- two-terminal dag (DADS)
- multiway decision (DADS)
- regular decomposition (DADS)
- hash table delete (DADS)
- depoissonization (DADS)
- oblivious binary decision diagram (DADS)
- KV diagram (DADS)
- diet (DADS)
- layered digraph (DADS)
- reduced digraph (DADS)
- recursive doubling (DADS)
- grid drawing (DADS)
- straight-line drawing (DADS)
- orthogonal drawing (DADS)
E
[edit]- free edge (DADS)
- saturated edge (DADS)
- work-efficient (DADS)
- pattern element (DADS)
- phonetic encoding (DADS)
- string matching with errors (DADS)
- EXCELL (DADS)
- moderately exponential (DADS)
F
[edit]- Reverse Factor (DADS)
- Turbo Reverse Factor (DADS)
- fathoming (DADS)
- two-level grid file (DADS)
- multilayer grid file (DADS)
- twin grid file (DADS)
- R-file (DADS)
- Malhotra-Kumar-Maheshwari blocking flow (DADS)
- integer multi-commodity flow (DADS)
- DFS forest (DADS)
G
[edit]- Galil-Giancarlo (DADS)
- layered graph (DADS)
- rough graph (DADS)
- triconnected graph (DADS)
- performance guarantee (DADS)
H
[edit]- order preserving hash (DADS)
- dynamic hashing (DADS)
- incremental hashing (DADS)
- 2-left hashing (DADS)
- always-go-left hashing (DADS)
- multiplicative hashing (DADS)
- optimal hashing (DADS)
- order preserving minimal perfect hashing (DADS)
- PLOP-hashing (DADS)
- uniform hashing (DADS)
- simple uniform hashing (DADS)
- virtual hashing (DADS)
- k-ary heap (DADS)
- build-heap (DADS)
- hash heap (DADS)
- shadow heap (DADS)
- weak-heap (DADS)
- frequency count heuristic (DADS)
- self-organizing heuristic (DADS)
I
[edit]J
[edit]L
[edit]M
[edit]- parallel random-access machine (DADS)
- visibility map (DADS)
- horizontal visibility map (DADS)
- vertical visibility map (DADS)
- K-dominant match (DADS)
- phonetic string match (DADS)
- Crochemore-Perrin string matching (DADS)
- uniform matrix (DADS)
- ideal merge (DADS)
- multiway merge (DADS)
- balanced multiway merge (DADS)
- nonbalanced merge (DADS)
- optimal merge (DADS)
- polyphase merge (DADS)
- optimal polyphase merge (DADS)
- shadow merge (DADS)
- simple merge (DADS)
- k-way merge (DADS)
- double metaphone (DADS)
- division method (DADS)
- fixed-grid method (DADS)
- multiplication method (DADS)
- optimal mismatch (DADS)
- string matching with mismatches (DADS)
- mode (DADS)
- select mode (DADS)
- work-depth model (DADS)
- multiprocessor model (DADS)
- cell probe model (DADS)
- MODIFIND (DADS)
- move (DADS)
- multiprefix (DADS)
N
[edit]O
[edit]P
[edit]- strip packing (DADS)
- PAM (DADS)
- planarization (DADS)
- poissonization (DADS)
- integer polyhedron (DADS)
- Morris-Pratt (DADS)
- work-preserving (DADS)
- partially decidable problem (DADS)
- forest editing problem (DADS)
- string editing problem (DADS)
- tree editing problem (DADS)
- fully dynamic graph problem (DADS)
- partially dynamic graph problem (DADS)
- matrix-chain multiplication problem (DADS)
- geometric optimization problem (DADS)
- critical path problem (DADS)
- decomposable searching problem (DADS)
- path system problem (DADS)
- optimal triangulation problem (DADS)
- optimal polygon triangulation problem (DADS)
- linear product (DADS)
- mixed integer linear program (DADS)
Q
[edit]- qmsort (DADS)
- linear quadtree (DADS)
- binary priority queue (DADS)
- monotone priority queue (DADS)
- three-way radix quicksort (DADS)
R
[edit]- performance ratio (DADS)
- Ratcliff/Obershelp pattern recognition (DADS)
- NC many-one reducibility (DADS)
- boundary-based representation (DADS)
- interior-based representation (DADS)
- rescalable (DADS)
- double left rotation (DADS)
- double right rotation (DADS)
S
[edit]- 2-left scheme (DADS)
- d-random scheme (DADS)
- edit script (DADS)
- KmpSkip Search (DADS)
- interpolation-sequential search (DADS)
- self-organizing sequential search (DADS)
- transpose sequential search (DADS)
- string similarity search (DADS)
- parametric searching (DADS)
- Galil-Seiferas (DADS)
- Randomized-Select (DADS)
- slope selection (DADS)
- probe sequence (DADS)
- Maximal Shift (DADS)
- shortcutting (DADS)
- fractional solution (DADS)
- brick sort (DADS)
- merge exchange sort (DADS)
- flash sort (DADS)
- weak-heap sort (DADS)
- decreasing increment sort (DADS)
- diminishing increment sort (DADS)
- cascade merge sort (DADS)
- nonbalanced merge sort (DADS)
- oscillating merge sort (DADS)
- optimal polyphase merge sort (DADS)
- k-way merge sort (DADS)
- p-way merge sort (DADS)
- three-way merge sort (DADS)
- two-way merge sort (DADS)
- balanced two-way merge sort (DADS)
- linear probing sort (DADS)
- qm sort (DADS)
- top-down radix sort (DADS)
- external radix sort (DADS)
- restricted universe sort (DADS)
- sparsification (DADS)
- next state (DADS)
- spiral storage (DADS)
- push-down store (DADS)
- end-of-string (DADS)
- external memory data structure (DADS)
- passive data structure (DADS)
- heaviest common subsequence (DADS)
- prefix sums (DADS)
- shortest common superstring (DADS)
- quadtree complexity theorem (DADS)
T
[edit]- cutting theorem (DADS)
- subadditive ergodic theorem (DADS)
- simulation theorem (DADS)
- pushdown transducer (DADS)
- Turing transducer (DADS)
- level-order traversal (DADS)
- perfect k-ary tree (DADS)
- k-d-B-tree (DADS)
- universal B-tree (DADS)
- BB(α) tree (DADS)
- BD-tree (DADS)
- LCRS binary tree (DADS)
- buddy tree (DADS)
- BV-tree (DADS)
- cell tree (DADS)
- complete tree (DADS)
- discrete interval encoding tree (DADS)
- finitary tree (DADS)
- GBD-tree (DADS)
- hB-tree (DADS)
- multiway tree (DADS)
- balanced multiway tree (DADS)
- P-tree (DADS)
- recursion tree (DADS)
- digital search tree (DADS)
- multiway search tree (DADS)
- skd-tree (DADS)
- minimal code spanning tree (DADS)
- multi suffix tree (DADS)
- threaded tree (DADS)
- topology tree (DADS)
- binary tree representation of trees (DADS)
- elastic-bucket trie (DADS)
- compact trie (DADS)
- quad trie (DADS)
- tripartition (DADS)
V
[edit]Source code for generating this list (section titles are manually added)
[edit]import re
filename = "/home/nekoyasha/Documents/nistdict.txt"
output_filename = "/home/nekoyasha/Documents/nistdict-suffix.txt"
def replfunc(match):
pass
terms = [];
def sortkey(string):
words = string[1].replace("-", " ").lower().split(" ")
reversed_words = [x for x in words]
reversed_words.reverse()
return reversed_words
for line in open(filename):
m = re.match(r"# \[\[(.*)\]\] \(\[(.*) .*\]\)", line);
if m is not None:
terms.append(m.group(0, 1, 2));
terms.sort(key=sortkey)
with open(output_filename, "w") as f:
for term in terms:
print (term[0])
f.write(term[0])
f.write("\n")