Wikipedia:Missing science topics/NIST Dictionary of Algorithms and Data Structures: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Zyqqh (talk | contribs)
490 edits
m →‎B: "baruvka's algorithm" was a misspelling of Borůvka's algorithm; no longer on DADS
m toc
(2 intermediate revisions by the same user not shown)
Line 10: Line 10:
:{{DADS|Ackermann's function|ackermann}}
:{{DADS|Ackermann's function|ackermann}}



===$===
{{compactTOC2}}
* '''''DONE!'''''


===A===
===A===
# [[ABKU hashing]] ([http://www.nist.gov/dads/HTML/ABKUHashing.html DADS])
# [[ABKU hashing]] ([http://www.nist.gov/dads/HTML/ABKUHashing.html DADS])
# [[abstract data type]] ([http://www.nist.gov/dads/HTML/abstractDataType.html DADS])
# [[(a,b)-tree]] ([http://www.nist.gov/dads/HTML/abtree.html DADS])
# [[(a,b)-tree]] ([http://www.nist.gov/dads/HTML/abtree.html DADS])
# [[accepting state]] ([http://www.nist.gov/dads/HTML/acceptingstt.html DADS])
# [[active data structure]] ([http://www.nist.gov/dads/HTML/activeDataStruc.html DADS])
# [[active data structure]] ([http://www.nist.gov/dads/HTML/activeDataStruc.html DADS])
# [[adaptive heapsort]] ([http://www.nist.gov/dads/HTML/adaptiveHeapsort.html DADS])
# [[adaptive heapsort]] ([http://www.nist.gov/dads/HTML/adaptiveHeapsort.html DADS])
Line 24: Line 22:
# [[adaptive sort]] ([http://www.nist.gov/dads/HTML/adaptivesort.html DADS])
# [[adaptive sort]] ([http://www.nist.gov/dads/HTML/adaptivesort.html DADS])
# [[address-calculation sort]] ([http://www.nist.gov/dads/HTML/addresscalc.html DADS])
# [[address-calculation sort]] ([http://www.nist.gov/dads/HTML/addresscalc.html DADS])
# [[adjacency list]] ([http://www.nist.gov/dads/HTML/adjacencyList.html DADS])
# [[adjacency-list representation]] ([http://www.nist.gov/dads/HTML/adjacencyListRep.html DADS])
# [[adjacency matrix]] ([http://www.nist.gov/dads/HTML/adjacencyMatrix.html DADS])
# [[adjacency-matrix representation]] ([http://www.nist.gov/dads/HTML/adjacencyMatrixRep.html DADS])
# [[adjacent]] ([http://www.nist.gov/dads/HTML/adjacent.html DADS])
# [[admissible tree]] ([http://www.nist.gov/dads/HTML/admissibleTree.html DADS])
# [[admissible tree]] ([http://www.nist.gov/dads/HTML/admissibleTree.html DADS])
# [[admissible vertex]] ([http://www.nist.gov/dads/HTML/admissible.html DADS])
# [[admissible vertex]] ([http://www.nist.gov/dads/HTML/admissible.html DADS])
# [[adversary]] ([http://www.nist.gov/dads/HTML/adversary.html DADS])
# [[adversary]] ([http://www.nist.gov/dads/HTML/adversary.html DADS])
# [[Aho-Corasick]] ([http://www.nist.gov/dads/HTML/ahoCorasick.html DADS])
# [[Aho-Corasick]] ([http://www.nist.gov/dads/HTML/ahoCorasick.html DADS])
# [[algorithm BSTW]] ([http://www.nist.gov/dads/HTML/algorithmBSTW.html DADS])
# [[algorithm FGK]] ([http://www.nist.gov/dads/HTML/algorithmFGK.html DADS])
# [[algorithm FGK]] ([http://www.nist.gov/dads/HTML/algorithmFGK.html DADS])
# [[algorithmically solvable]] ([http://www.nist.gov/dads/HTML/algorithmicallySolvable.html DADS])
# [[algorithmically solvable]] ([http://www.nist.gov/dads/HTML/algorithmicallySolvable.html DADS])
Line 42: Line 34:
# [[Alpha Skip Search algorithm]] ([http://www.nist.gov/dads/HTML/alphaskipsr.html DADS])
# [[Alpha Skip Search algorithm]] ([http://www.nist.gov/dads/HTML/alphaskipsr.html DADS])
# [[alternating path]] ([http://www.nist.gov/dads/HTML/alterntngpth.html DADS])
# [[alternating path]] ([http://www.nist.gov/dads/HTML/alterntngpth.html DADS])
# [[alternating Turing machine]] ([http://www.nist.gov/dads/HTML/alternatngTr.html DADS])
# [[alternation]] ([http://www.nist.gov/dads/HTML/alternation.html DADS])
# [[alternation]] ([http://www.nist.gov/dads/HTML/alternation.html DADS])
# [[always-go-left hashing]] ([http://www.nist.gov/dads/HTML/alwaysgoleftHashing.html DADS])
# [[always-go-left hashing]] ([http://www.nist.gov/dads/HTML/alwaysgoleftHashing.html DADS])
# [[American flag sort]] ([http://www.nist.gov/dads/HTML/americanFlagSort.html DADS])
# [[American flag sort]] ([http://www.nist.gov/dads/HTML/americanFlagSort.html DADS])
# [[amortized cost]] ([http://www.nist.gov/dads/HTML/amortizdcost.html DADS])
# [[amortized worst case]] ([http://www.nist.gov/dads/HTML/amortizedWorstCase.html DADS])
# [[ancestor]] ([http://www.nist.gov/dads/HTML/ancestor.html DADS])
# [[ancestor]] ([http://www.nist.gov/dads/HTML/ancestor.html DADS])
# [[and]] ([http://www.nist.gov/dads/HTML/and.html DADS])
# [[antichain]] ([http://www.nist.gov/dads/HTML/antichain.html DADS])
# [[antisymmetric]] ([http://www.nist.gov/dads/HTML/antisymmetric.html DADS])
# [[Apostolico-Crochemore]] ([http://www.nist.gov/dads/HTML/apostolicocr.html DADS])
# [[Apostolico-Crochemore]] ([http://www.nist.gov/dads/HTML/apostolicocr.html DADS])
# [[Apostolico-Giancarlo algorithm]] ([http://www.nist.gov/dads/HTML/apostolicogi.html DADS])
# [[Apostolico-Giancarlo algorithm]] ([http://www.nist.gov/dads/HTML/apostolicogi.html DADS])
# [[approximate string matching]] ([http://www.nist.gov/dads/HTML/approximateStringMatching.html DADS])
# [[approximation algorithm]] ([http://www.nist.gov/dads/HTML/approximatin.html DADS])
# [[arborescence]] ([http://www.nist.gov/dads/HTML/arborescence.html DADS])
# [[arborescence]] ([http://www.nist.gov/dads/HTML/arborescence.html DADS])
# [[arc]] ([http://www.nist.gov/dads/HTML/arc.html DADS])
# [[array]] ([http://www.nist.gov/dads/HTML/array.html DADS])
# [[array index]] ([http://www.nist.gov/dads/HTML/arrayindex.html DADS])
# [[array index]] ([http://www.nist.gov/dads/HTML/arrayindex.html DADS])
# [[array merging]] ([http://www.nist.gov/dads/HTML/arraymerg.html DADS])
# [[array merging]] ([http://www.nist.gov/dads/HTML/arraymerg.html DADS])
# [[array search]] ([http://www.nist.gov/dads/HTML/arraysearch.html DADS])
# [[array search]] ([http://www.nist.gov/dads/HTML/arraysearch.html DADS])
# [[articulation point]] ([http://www.nist.gov/dads/HTML/articulationPoint.html DADS])
# [[articulation vertex]] ([http://www.nist.gov/dads/HTML/articulationVertex.html DADS])
# [[articulation vertex]] ([http://www.nist.gov/dads/HTML/articulationVertex.html DADS])
# [[assignment problem]] ([http://www.nist.gov/dads/HTML/assignment.html DADS])
# [[association list]] ([http://www.nist.gov/dads/HTML/associationList.html DADS])
# [[associative]] ([http://www.nist.gov/dads/HTML/associative.html DADS])
# [[associative array]] ([http://www.nist.gov/dads/HTML/assocarray.html DADS])
# [[assoc list]] ([http://www.nist.gov/dads/HTML/assocList.html DADS])
# [[assoc list]] ([http://www.nist.gov/dads/HTML/assocList.html DADS])
# [[asymptotically tight bound]] ([http://www.nist.gov/dads/HTML/asymptoticallyTightBound.html DADS])
# [[asymptotically tight bound]] ([http://www.nist.gov/dads/HTML/asymptoticallyTightBound.html DADS])
Line 73: Line 50:
# [[asymptotic lower bound]] ([http://www.nist.gov/dads/HTML/asymptoticLowerBound.html DADS])
# [[asymptotic lower bound]] ([http://www.nist.gov/dads/HTML/asymptoticLowerBound.html DADS])
# [[asymptotic space complexity]] ([http://www.nist.gov/dads/HTML/asymptoticSpaceComplexity.html DADS])
# [[asymptotic space complexity]] ([http://www.nist.gov/dads/HTML/asymptoticSpaceComplexity.html DADS])
# [[asymptotic time complexity]] ([http://www.nist.gov/dads/HTML/asymptoticTimeComplexity.html DADS])
# [[asymptotic upper bound]] ([http://www.nist.gov/dads/HTML/asymptoticUpperBound.html DADS])
# [[asymptotic upper bound]] ([http://www.nist.gov/dads/HTML/asymptoticUpperBound.html DADS])
# [[augmenting path]] ([http://www.nist.gov/dads/HTML/augmentngpth.html DADS])
# [[automaton]] ([http://www.nist.gov/dads/HTML/automaton.html DADS])
# [[automaton]] ([http://www.nist.gov/dads/HTML/automaton.html DADS])
# [[average case]] ([http://www.nist.gov/dads/HTML/averagecase.html DADS])
# [[average case]] ([http://www.nist.gov/dads/HTML/averagecase.html DADS])
# [[average-case cost]] ([http://www.nist.gov/dads/HTML/averagecscst.html DADS])
# [[average-case cost]] ([http://www.nist.gov/dads/HTML/averagecscst.html DADS])
# [[AVL tree]] ([http://www.nist.gov/dads/HTML/avltree.html DADS])
# [[axiomatic semantics]] ([http://www.nist.gov/dads/HTML/axiomaticSemantics.html DADS])


===B===
===B===
# [[backtracking]] ([http://www.nist.gov/dads/HTML/backtrack.html DADS])
# [[bag]] ([http://www.nist.gov/dads/HTML/bag.html DADS])
# [[bag]] ([http://www.nist.gov/dads/HTML/bag.html DADS])
# [[balance]] ([http://www.nist.gov/dads/HTML/balance.html DADS])
# [[balance]] ([http://www.nist.gov/dads/HTML/balance.html DADS])
# [[balanced binary search tree]] ([http://www.nist.gov/dads/HTML/balancedbist.html DADS])
# [[balanced binary tree]] ([http://www.nist.gov/dads/HTML/balancedbitr.html DADS])
# [[balanced binary tree]] ([http://www.nist.gov/dads/HTML/balancedbitr.html DADS])
# [[balanced k-way merge sort]] ([http://www.nist.gov/dads/HTML/balanckwayms.html DADS])
# [[balanced k-way merge sort]] ([http://www.nist.gov/dads/HTML/balanckwayms.html DADS])
Line 98: Line 69:
# [[Batcher sort]] ([http://www.nist.gov/dads/HTML/BatcherSort.html DADS])
# [[Batcher sort]] ([http://www.nist.gov/dads/HTML/BatcherSort.html DADS])
# [[Batcher's sort]] ([http://www.nist.gov/dads/HTML/BatchersSort.html DADS])
# [[Batcher's sort]] ([http://www.nist.gov/dads/HTML/BatchersSort.html DADS])
# [[Baum Welch algorithm]] ([http://www.nist.gov/dads/HTML/baumWelch.html DADS])
# [[Bayer tree]] ([http://www.nist.gov/dads/HTML/BayerTree.html DADS])
# [[Bayer tree]] ([http://www.nist.gov/dads/HTML/BayerTree.html DADS])
# [[BB(α) tree]] ([http://www.nist.gov/dads/HTML/bbalphatree.html DADS])
# [[BB(α) tree]] ([http://www.nist.gov/dads/HTML/bbalphatree.html DADS])
# [[BBP algorithm]] ([http://www.nist.gov/dads/HTML/bbp.html DADS])
# [[Binary decision diagram|BDD]] ([http://www.nist.gov/dads/HTML/bdd.html DADS])
# [[BD-tree]] ([http://www.nist.gov/dads/HTML/bdtree.html DADS])
# [[BD-tree]] ([http://www.nist.gov/dads/HTML/bdtree.html DADS])
# [[Bellman-Ford algorithm]] ([http://www.nist.gov/dads/HTML/bellmanford.html DADS])
# [[Benford's law]] ([http://www.nist.gov/dads/HTML/benfordslaw.html DADS])
# [[best case]] ([http://www.nist.gov/dads/HTML/bestcase.html DADS])
# [[best-case cost]] ([http://www.nist.gov/dads/HTML/bestcasecost.html DADS])
# [[best-case cost]] ([http://www.nist.gov/dads/HTML/bestcasecost.html DADS])
# [[best-first search]] ([http://www.nist.gov/dads/HTML/bestfirst.html DADS])
# [[biconnected component]] ([http://www.nist.gov/dads/HTML/biconnectedComponent.html DADS])
# [[biconnected component]] ([http://www.nist.gov/dads/HTML/biconnectedComponent.html DADS])
# [[biconnected graph]] ([http://www.nist.gov/dads/HTML/biconnectedGraph.html DADS])
# [[biconnected graph]] ([http://www.nist.gov/dads/HTML/biconnectedGraph.html DADS])
# [[bidirectional bubble sort]] ([http://www.nist.gov/dads/HTML/bidirectbubl.html DADS])
# [[binary decision diagram]] ([http://www.nist.gov/dads/HTML/binaryDecisionDiagram.html DADS])
# [[binary function]] ([http://www.nist.gov/dads/HTML/binaryfunc.html DADS])
# [[binary GCD algorithm]] ([http://www.nist.gov/dads/HTML/binaryGCD.html DADS])
# [[binary heap]] ([http://www.nist.gov/dads/HTML/binaryheap.html DADS])
# [[binary insertion sort]] ([http://www.nist.gov/dads/HTML/binaryinsort.html DADS])
# [[binary insertion sort]] ([http://www.nist.gov/dads/HTML/binaryinsort.html DADS])
# [[binary knapsack problem]] ([http://www.nist.gov/dads/HTML/binaryKnapsackProblem.html DADS])
# [[binary knapsack problem]] ([http://www.nist.gov/dads/HTML/binaryKnapsackProblem.html DADS])
# [[binary priority queue]] ([http://www.nist.gov/dads/HTML/binaryPriorityQueue.html DADS])
# [[binary priority queue]] ([http://www.nist.gov/dads/HTML/binaryPriorityQueue.html DADS])
# [[binary relation]] ([http://www.nist.gov/dads/HTML/binaryRelation.html DADS])
# [[binary search]] ([http://www.nist.gov/dads/HTML/binarySearch.html DADS])
# [[binary tree representation of trees]] ([http://www.nist.gov/dads/HTML/binaryTreeRepofTree.html DADS])
# [[binary tree representation of trees]] ([http://www.nist.gov/dads/HTML/binaryTreeRepofTree.html DADS])
# [[bingo sort]] ([http://www.nist.gov/dads/HTML/bingosort.html DADS])
# [[bingo sort]] ([http://www.nist.gov/dads/HTML/bingosort.html DADS])
# [[binomial queue]] ([http://www.nist.gov/dads/HTML/binomialQueue.html DADS])
# [[binomial queue]] ([http://www.nist.gov/dads/HTML/binomialQueue.html DADS])
# [[binomial tree]] ([http://www.nist.gov/dads/HTML/binomialtree.html DADS])
# [[bin packing problem]] ([http://www.nist.gov/dads/HTML/binpacking.html DADS])
# [[bin sort]] ([http://www.nist.gov/dads/HTML/binSort.html DADS])
# [[bintree]] ([http://www.nist.gov/dads/HTML/bintree.html DADS])
# [[bintree]] ([http://www.nist.gov/dads/HTML/bintree.html DADS])
# [[bipartite graph]] ([http://www.nist.gov/dads/HTML/bipartgraph.html DADS])
# [[bipartite matching]] ([http://www.nist.gov/dads/HTML/bipartmatch.html DADS])
# [[bisector]] ([http://www.nist.gov/dads/HTML/bisector.html DADS])
# [[bisector]] ([http://www.nist.gov/dads/HTML/bisector.html DADS])
# [[bitonic sort]] ([http://www.nist.gov/dads/HTML/bitonicSort.html DADS])
# [[bit vector]] ([http://www.nist.gov/dads/HTML/bitVector.html DADS])
# [[BKP]] ([http://www.nist.gov/dads/HTML/bkp.html DADS])
# [[Bk tree]] ([http://www.nist.gov/dads/HTML/bktree.html DADS])
# [[block]] ([http://www.nist.gov/dads/HTML/block.html DADS])
# [[block]] ([http://www.nist.gov/dads/HTML/block.html DADS])
# [[block addressing index]] ([http://www.nist.gov/dads/HTML/blockAddressingIndex.html DADS])
# [[block addressing index]] ([http://www.nist.gov/dads/HTML/blockAddressingIndex.html DADS])
# [[blocking flow]] ([http://www.nist.gov/dads/HTML/blockingflow.html DADS])
# [[blocking flow]] ([http://www.nist.gov/dads/HTML/blockingflow.html DADS])
# [[block search]] ([http://www.nist.gov/dads/HTML/blockSearch.html DADS])
# [[block searching]] ([http://www.nist.gov/dads/HTML/blockSearching.html DADS])
# [[Bloom filter]] ([http://www.nist.gov/dads/HTML/bloomFilter.html DADS])
# [[blossom]] ([http://www.nist.gov/dads/HTML/blossom.html DADS])
# [[blossom]] ([http://www.nist.gov/dads/HTML/blossom.html DADS])
# [[boolean]] ([http://www.nist.gov/dads/HTML/boolean.html DADS])
# [[boolean expression]] ([http://www.nist.gov/dads/HTML/booleanexpr.html DADS])
# [[boolean function]] ([http://www.nist.gov/dads/HTML/booleanfnctn.html DADS])
# [[border]] ([http://www.nist.gov/dads/HTML/border.html DADS])
# [[border]] ([http://www.nist.gov/dads/HTML/border.html DADS])
# [[bottleneck traveling salesman]] ([http://www.nist.gov/dads/HTML/bottleneckTravelingSales.html DADS])
# [[bottom-up tree automaton]] ([http://www.nist.gov/dads/HTML/bottmptrtmtn.html DADS])
# [[bottom-up tree automaton]] ([http://www.nist.gov/dads/HTML/bottmptrtmtn.html DADS])
# [[boundary-based representation]] ([http://www.nist.gov/dads/HTML/boundarybasd.html DADS])
# [[boundary-based representation]] ([http://www.nist.gov/dads/HTML/boundarybasd.html DADS])
Line 152: Line 93:
# [[bounded queue]] ([http://www.nist.gov/dads/HTML/boundedqueue.html DADS])
# [[bounded queue]] ([http://www.nist.gov/dads/HTML/boundedqueue.html DADS])
# [[bounded stack]] ([http://www.nist.gov/dads/HTML/boundedstack.html DADS])
# [[bounded stack]] ([http://www.nist.gov/dads/HTML/boundedstack.html DADS])
# [[Boyer-Moore]] ([http://www.nist.gov/dads/HTML/boyermoore.html DADS])
# [[Boyer-Moore-Horspool]] ([http://www.nist.gov/dads/HTML/boyerMooreHorspool.html DADS])
# [[Boyer-Moore-Horspool]] ([http://www.nist.gov/dads/HTML/boyerMooreHorspool.html DADS])
# [[bozo sort]] ([http://www.nist.gov/dads/HTML/bozoSort.html DADS])
# [[BP]] ([http://www.nist.gov/dads/HTML/bp.html DADS])
# [[BP]] ([http://www.nist.gov/dads/HTML/bp.html DADS])
# [[B plus tree|B+-tree]] ([http://www.nist.gov/dads/HTML/bplustree.html DADS])
# [[BPP]] ([http://www.nist.gov/dads/HTML/bpp.html DADS])
# [[Bradford's law]] ([http://www.nist.gov/dads/HTML/bradfordsLaw.html DADS])
# [[branch and bound]] ([http://www.nist.gov/dads/HTML/branchNbound.html DADS])
# [[branching programs]] ([http://www.nist.gov/dads/HTML/branchingPrograms.html DADS])
# [[branching programs]] ([http://www.nist.gov/dads/HTML/branchingPrograms.html DADS])
# [[breadth-first search]] ([http://www.nist.gov/dads/HTML/breadthfirst.html DADS])
# [[Bresenham's algorithm]] ([http://www.nist.gov/dads/HTML/bresenham.html DADS])
# [[brick sort]] ([http://www.nist.gov/dads/HTML/brickSort.html DADS])
# [[brick sort]] ([http://www.nist.gov/dads/HTML/brickSort.html DADS])
# [[bridge]] ([http://www.nist.gov/dads/HTML/bridge.html DADS])
# [[bridge]] ([http://www.nist.gov/dads/HTML/bridge.html DADS])
# [[British Museum algorithm]] ([http://www.nist.gov/dads/HTML/BritishMuseumAlgorithm.html DADS])
# [[British Museum algorithm]] ([http://www.nist.gov/dads/HTML/BritishMuseumAlgorithm.html DADS])
# [[British Museum technique]] ([http://www.nist.gov/dads/HTML/britishMuseum.html DADS])
# [[British Museum technique]] ([http://www.nist.gov/dads/HTML/britishMuseum.html DADS])
# [[brute force]] ([http://www.nist.gov/dads/HTML/bruteforce.html DADS])
# [[brute force string search]] ([http://www.nist.gov/dads/HTML/bruteForceStringSearch.html DADS])
# [[brute force string search]] ([http://www.nist.gov/dads/HTML/bruteForceStringSearch.html DADS])
# [[brute force string search with mismatches]] ([http://www.nist.gov/dads/HTML/bruteForceStrSrchwMismatch.html DADS])
# [[brute force string search with mismatches]] ([http://www.nist.gov/dads/HTML/bruteForceStrSrchwMismatch.html DADS])
# [[bsearch]] ([http://www.nist.gov/dads/HTML/bsearch.html DADS])
# [[bsearch]] ([http://www.nist.gov/dads/HTML/bsearch.html DADS])
# [[BSP-tree]] ([http://www.nist.gov/dads/HTML/bsptree.html DADS])
# [[BSP-tree]] ([http://www.nist.gov/dads/HTML/bsptree.html DADS])
# [[B*-tree]] ([http://www.nist.gov/dads/HTML/bstartree.html DADS])
# [[B-tree]] ([http://www.nist.gov/dads/HTML/btree.html DADS])
# [[bubble sort]] ([http://www.nist.gov/dads/HTML/bubblesort.html DADS])
# [[bucket]] ([http://www.nist.gov/dads/HTML/bucket.html DADS])
# [[bucket array]] ([http://www.nist.gov/dads/HTML/bucketarray.html DADS])
# [[bucket array]] ([http://www.nist.gov/dads/HTML/bucketarray.html DADS])
# [[bucketing method]] ([http://www.nist.gov/dads/HTML/bucketmeth.html DADS])
# [[bucketing method]] ([http://www.nist.gov/dads/HTML/bucketmeth.html DADS])
# [[bucket sort]] ([http://www.nist.gov/dads/HTML/bucketsort.html DADS])
# [[bucket trie]] ([http://www.nist.gov/dads/HTML/bucketTrie.html DADS])
# [[bucket trie]] ([http://www.nist.gov/dads/HTML/bucketTrie.html DADS])
# [[buddy system]] ([http://www.nist.gov/dads/HTML/buddysystem.html DADS])
# [[buddy system]] ([http://www.nist.gov/dads/HTML/buddysystem.html DADS])
# [[buddy tree]] ([http://www.nist.gov/dads/HTML/buddytree.html DADS])
# [[buddy tree]] ([http://www.nist.gov/dads/HTML/buddytree.html DADS])
# [[build-heap]] ([http://www.nist.gov/dads/HTML/buildHeap.html DADS])
# [[build-heap]] ([http://www.nist.gov/dads/HTML/buildHeap.html DADS])
# [[Burrows-Wheeler transform]] ([http://www.nist.gov/dads/HTML/burrowsWheelerTransform.html DADS])
# [[busy beaver]] ([http://www.nist.gov/dads/HTML/busyBeaver.html DADS])
# [[BV-tree]] ([http://www.nist.gov/dads/HTML/bvtree.html DADS])
# [[BV-tree]] ([http://www.nist.gov/dads/HTML/bvtree.html DADS])
# [[BWT]] ([http://www.nist.gov/dads/HTML/bwt.html DADS])
# [[Byzantine Agreement Problem]] ([http://www.nist.gov/dads/HTML/ByzantineAgreementProblem.html DADS])
# [[Byzantine Agreement Problem]] ([http://www.nist.gov/dads/HTML/ByzantineAgreementProblem.html DADS])
# [[Byzantine generals]] ([http://www.nist.gov/dads/HTML/byzantine.html DADS])
# [[Byzantine generals]] ([http://www.nist.gov/dads/HTML/byzantine.html DADS])
Line 193: Line 117:
===C===
===C===
# [[cactus stack]] ([http://www.nist.gov/dads/HTML/cactusstack.html DADS])
# [[cactus stack]] ([http://www.nist.gov/dads/HTML/cactusstack.html DADS])
# [[Calculus of Communicating Systems]] ([http://www.nist.gov/dads/HTML/calcucommsys.html DADS])
# [[calendar queue]] ([http://www.nist.gov/dads/HTML/calendarQueue.html DADS])
# [[calendar queue]] ([http://www.nist.gov/dads/HTML/calendarQueue.html DADS])
# [[candidate consistency testing]] ([http://www.nist.gov/dads/HTML/candidate.html DADS])
# [[candidate consistency testing]] ([http://www.nist.gov/dads/HTML/candidate.html DADS])
Line 209: Line 132:
# [[cell probe model]] ([http://www.nist.gov/dads/HTML/cellProbeModel.html DADS])
# [[cell probe model]] ([http://www.nist.gov/dads/HTML/cellProbeModel.html DADS])
# [[cell tree]] ([http://www.nist.gov/dads/HTML/celltree.html DADS])
# [[cell tree]] ([http://www.nist.gov/dads/HTML/celltree.html DADS])
# [[cellular automaton]] ([http://www.nist.gov/dads/HTML/cellulartmtn.html DADS])
# [[centroid]] ([http://www.nist.gov/dads/HTML/centroid.html DADS])
# [[centroid]] ([http://www.nist.gov/dads/HTML/centroid.html DADS])
# [[certificate]] ([http://www.nist.gov/dads/HTML/certificate.html DADS])
# [[certificate]] ([http://www.nist.gov/dads/HTML/certificate.html DADS])
Line 215: Line 137:
# [[chaining]] ([http://www.nist.gov/dads/HTML/chaining.html DADS])
# [[chaining]] ([http://www.nist.gov/dads/HTML/chaining.html DADS])
# [[child]] ([http://www.nist.gov/dads/HTML/child.html DADS])
# [[child]] ([http://www.nist.gov/dads/HTML/child.html DADS])
# [[Chinese postman problem]] ([http://www.nist.gov/dads/HTML/chinesePostman.html DADS])
# [[Chinese remainder theorem]] ([http://www.nist.gov/dads/HTML/chineseRmndr.html DADS])
# [[Christofides algorithm]] ([http://www.nist.gov/dads/HTML/christofides.html DADS])
# [[Christofides heuristic]] ([http://www.nist.gov/dads/HTML/ChristofidesHeuristic.html DADS])
# [[chromatic index]] ([http://www.nist.gov/dads/HTML/chromaticndx.html DADS])
# [[chromatic number]] ([http://www.nist.gov/dads/HTML/chromatcnmbr.html DADS])
# [[Church-Turing thesis]] ([http://www.nist.gov/dads/HTML/churchTuringThesis.html DADS])
# [[circuit]] ([http://www.nist.gov/dads/HTML/circuit.html DADS])
# [[circuit]] ([http://www.nist.gov/dads/HTML/circuit.html DADS])
# [[circuit complexity]] ([http://www.nist.gov/dads/HTML/circuitComplexity.html DADS])
# [[circuit complexity]] ([http://www.nist.gov/dads/HTML/circuitComplexity.html DADS])
Line 228: Line 143:
# [[circular queue]] ([http://www.nist.gov/dads/HTML/circularQueue.html DADS])
# [[circular queue]] ([http://www.nist.gov/dads/HTML/circularQueue.html DADS])
# [[city block norm]] ([http://www.nist.gov/dads/HTML/cityBlockNorm.html DADS])
# [[city block norm]] ([http://www.nist.gov/dads/HTML/cityBlockNorm.html DADS])
# [[clique]] ([http://www.nist.gov/dads/HTML/clique.html DADS])
# [[clique problem]] ([http://www.nist.gov/dads/HTML/cliqueproblm.html DADS])
# [[closed hashing]] ([http://www.nist.gov/dads/HTML/closedHashing.html DADS])
# [[closed hashing]] ([http://www.nist.gov/dads/HTML/closedHashing.html DADS])
# [[clustering]] ([http://www.nist.gov/dads/HTML/clustering.html DADS])
# [[clustering]] ([http://www.nist.gov/dads/HTML/clustering.html DADS])
Line 244: Line 157:
# [[Colussi]] ([http://www.nist.gov/dads/HTML/colussi.html DADS])
# [[Colussi]] ([http://www.nist.gov/dads/HTML/colussi.html DADS])
# [[combination]] ([http://www.nist.gov/dads/HTML/combination.html DADS])
# [[combination]] ([http://www.nist.gov/dads/HTML/combination.html DADS])
# [[comb sort]] ([http://www.nist.gov/dads/HTML/combSort.html DADS])
# [[Communicating Sequential Processes]] ([http://www.nist.gov/dads/HTML/communseqpro.html DADS])
# [[commutative]] ([http://www.nist.gov/dads/HTML/commutative.html DADS])
# [[compact DAWG]] ([http://www.nist.gov/dads/HTML/compactDAWG.html DADS])
# [[compact DAWG]] ([http://www.nist.gov/dads/HTML/compactDAWG.html DADS])
# [[compact trie]] ([http://www.nist.gov/dads/HTML/compactTrie.html DADS])
# [[compact trie]] ([http://www.nist.gov/dads/HTML/compactTrie.html DADS])
# [[comparison sort]] ([http://www.nist.gov/dads/HTML/comparisnsrt.html DADS])
# [[competitive analysis]] ([http://www.nist.gov/dads/HTML/competitiveAnalysis.html DADS])
# [[competitive ratio]] ([http://www.nist.gov/dads/HTML/competitivrt.html DADS])
# [[competitive ratio]] ([http://www.nist.gov/dads/HTML/competitivrt.html DADS])
# [[complement]] ([http://www.nist.gov/dads/HTML/complement.html DADS])
# [[complete binary tree]] ([http://www.nist.gov/dads/HTML/completeBinaryTree.html DADS])
# [[complete binary tree]] ([http://www.nist.gov/dads/HTML/completeBinaryTree.html DADS])
# [[complete graph]] ([http://www.nist.gov/dads/HTML/completeGraph.html DADS])
# [[complete k-ary tree]] ([http://www.nist.gov/dads/HTML/completeKaryTree.html DADS])
# [[complete k-ary tree]] ([http://www.nist.gov/dads/HTML/completeKaryTree.html DADS])
# [[completely connected graph]] ([http://www.nist.gov/dads/HTML/completelyConnectedGraph.html DADS])
# [[completely connected graph]] ([http://www.nist.gov/dads/HTML/completelyConnectedGraph.html DADS])
Line 269: Line 175:
# [[confluently persistent data structure]] ([http://www.nist.gov/dads/HTML/confluentlyPersistData.html DADS])
# [[confluently persistent data structure]] ([http://www.nist.gov/dads/HTML/confluentlyPersistData.html DADS])
# [[conjunction]] ([http://www.nist.gov/dads/HTML/conjunction.html DADS])
# [[conjunction]] ([http://www.nist.gov/dads/HTML/conjunction.html DADS])
# [[connected components]] ([http://www.nist.gov/dads/HTML/connectedComponents.html DADS])
# [[connected graph]] ([http://www.nist.gov/dads/HTML/connectedGraph.html DADS])
# [[constant function]] ([http://www.nist.gov/dads/HTML/constantfunc.html DADS])
# [[continuous knapsack problem]] ([http://www.nist.gov/dads/HTML/continuousKnapsackProblem.html DADS])
# [[continuous knapsack problem]] ([http://www.nist.gov/dads/HTML/continuousKnapsackProblem.html DADS])
# [[Cook reduction]] ([http://www.nist.gov/dads/HTML/cookreductin.html DADS])
# [[Cook's theorem]] ([http://www.nist.gov/dads/HTML/cookstheorem.html DADS])
# [[CORDIC]] ([http://www.nist.gov/dads/HTML/cordic.html DADS])
# [[COrdinate Rotation DIgital Computer]] ([http://www.nist.gov/dads/HTML/COrdinateRotationDIgitalComputer.html DADS])
# [[counting sort]] ([http://www.nist.gov/dads/HTML/countingsort.html DADS])
# [[covering]] ([http://www.nist.gov/dads/HTML/covering.html DADS])
# [[CP algorithm]] ([http://www.nist.gov/dads/HTML/CPAlgorithm.html DADS])
# [[CP algorithm]] ([http://www.nist.gov/dads/HTML/CPAlgorithm.html DADS])
# [[CPP]] ([http://www.nist.gov/dads/HTML/cpp.html DADS])
# [[CPP]] ([http://www.nist.gov/dads/HTML/cpp.html DADS])
Line 292: Line 189:
# [[cut]] ([http://www.nist.gov/dads/HTML/cut.html DADS])
# [[cut]] ([http://www.nist.gov/dads/HTML/cut.html DADS])
# [[cutting plane]] ([http://www.nist.gov/dads/HTML/cuttingplane.html DADS])
# [[cutting plane]] ([http://www.nist.gov/dads/HTML/cuttingplane.html DADS])
# [[cutting stock problem]] ([http://www.nist.gov/dads/HTML/cuttingStock.html DADS])
# [[cutting theorem]] ([http://www.nist.gov/dads/HTML/cuttingtherm.html DADS])
# [[cutting theorem]] ([http://www.nist.gov/dads/HTML/cuttingtherm.html DADS])
# [[cut vertex]] ([http://www.nist.gov/dads/HTML/cutvertex.html DADS])
# [[cycle]] ([http://www.nist.gov/dads/HTML/cycle.html DADS])
# [[cycle]] ([http://www.nist.gov/dads/HTML/cycle.html DADS])

# [[cyclic redundancy check]] ([http://www.nist.gov/dads/HTML/cyclicRedundancyCheck.html DADS])
===D===
===D===
# [[D-adjacent]] ([http://www.nist.gov/dads/HTML/dadjacent.html DADS])
# [[D-adjacent]] ([http://www.nist.gov/dads/HTML/dadjacent.html DADS])
# [[DAG]] ([http://www.nist.gov/dads/HTML/dag.html DADS])
# [[DAG shortest paths]] ([http://www.nist.gov/dads/HTML/dagShortPath.html DADS])
# [[DAG shortest paths]] ([http://www.nist.gov/dads/HTML/dagShortPath.html DADS])
# [[database]] ([http://www.nist.gov/dads/HTML/database.html DADS])
# [[data base]] ([http://www.nist.gov/dads/HTML/dataBase.html DADS])
# [[data base]] ([http://www.nist.gov/dads/HTML/dataBase.html DADS])
# [[data structure]] ([http://www.nist.gov/dads/HTML/datastructur.html DADS])
# [[data structure persistance]] ([http://www.nist.gov/dads/HTML/dataStructurePersistance.html DADS])
# [[data structure persistence]] ([http://www.nist.gov/dads/HTML/dataStructurePersistence.html DADS])
# [[data structure persistence]] ([http://www.nist.gov/dads/HTML/dataStructurePersistence.html DADS])
# [[DAWG]] ([http://www.nist.gov/dads/HTML/dawg.html DADS])
# [[DAWG]] ([http://www.nist.gov/dads/HTML/dawg.html DADS])
# [[decidable language]] ([http://www.nist.gov/dads/HTML/decidableLanguage.html DADS])
# [[decidable problem]] ([http://www.nist.gov/dads/HTML/decidableProblem.html DADS])
# [[decidable problem]] ([http://www.nist.gov/dads/HTML/decidableProblem.html DADS])
# [[decimation]] ([http://www.nist.gov/dads/HTML/decimation.html DADS])
# [[decimation]] ([http://www.nist.gov/dads/HTML/decimation.html DADS])
# [[decision problem]] ([http://www.nist.gov/dads/HTML/decisionProblem.html DADS])
# [[decomposable searching problem]] ([http://www.nist.gov/dads/HTML/decomposable.html DADS])
# [[decomposable searching problem]] ([http://www.nist.gov/dads/HTML/decomposable.html DADS])
# [[decreasing increment sort]] ([http://www.nist.gov/dads/HTML/decreasingIncrementSort.html DADS])
# [[decreasing increment sort]] ([http://www.nist.gov/dads/HTML/decreasingIncrementSort.html DADS])
# [[degree]] ([http://www.nist.gov/dads/HTML/degree.html DADS])
# [[dense graph]] ([http://www.nist.gov/dads/HTML/densegraph.html DADS])
# [[depoissonization]] ([http://www.nist.gov/dads/HTML/depoissonztn.html DADS])
# [[depoissonization]] ([http://www.nist.gov/dads/HTML/depoissonztn.html DADS])
# [[depth]] ([http://www.nist.gov/dads/HTML/depth.html DADS])
# [[depth]] ([http://www.nist.gov/dads/HTML/depth.html DADS])
# [[depth-first search]] ([http://www.nist.gov/dads/HTML/depthfirst.html DADS])
# [[deque]] ([http://www.nist.gov/dads/HTML/deque.html DADS])
# [[derangement]] ([http://www.nist.gov/dads/HTML/derangement.html DADS])
# [[descendant]] ([http://www.nist.gov/dads/HTML/descendant.html DADS])
# [[descendant]] ([http://www.nist.gov/dads/HTML/descendant.html DADS])
# [[deterministic]] ([http://www.nist.gov/dads/HTML/deterministc.html DADS])
# [[deterministic]] ([http://www.nist.gov/dads/HTML/deterministc.html DADS])
# [[deterministic algorithm]] ([http://www.nist.gov/dads/HTML/determinalgo.html DADS])
# [[deterministic finite automata string search]] ([http://www.nist.gov/dads/HTML/determFinitAutSrch.html DADS])
# [[deterministic finite automata string search]] ([http://www.nist.gov/dads/HTML/determFinitAutSrch.html DADS])
# [[deterministic finite automaton]] ([http://www.nist.gov/dads/HTML/deterministicFiniteAutomaton.html DADS])
# [[deterministic finite state automaton]] ([http://www.nist.gov/dads/HTML/deterministicFiniteStateAutomaton.html DADS])
# [[deterministic finite state automaton]] ([http://www.nist.gov/dads/HTML/deterministicFiniteStateAutomaton.html DADS])
# [[deterministic finite state machine]] ([http://www.nist.gov/dads/HTML/determFinitStateMach.html DADS])
# [[deterministic finite tree automaton]] ([http://www.nist.gov/dads/HTML/determFinitTreeAutom.html DADS])
# [[deterministic finite tree automaton]] ([http://www.nist.gov/dads/HTML/determFinitTreeAutom.html DADS])
# [[deterministic pushdown automaton]] ([http://www.nist.gov/dads/HTML/deterministicPushdownAutom.html DADS])
# [[deterministic pushdown automaton]] ([http://www.nist.gov/dads/HTML/deterministicPushdownAutom.html DADS])
# [[deterministic tree automaton]] ([http://www.nist.gov/dads/HTML/detrmtreeaut.html DADS])
# [[deterministic tree automaton]] ([http://www.nist.gov/dads/HTML/detrmtreeaut.html DADS])
# [[Deutsch-Jozsa algorithm]] ([http://www.nist.gov/dads/HTML/deutschJozsaAlgo.html DADS])
# [[DFA]] ([http://www.nist.gov/dads/HTML/dfa.html DADS])
# [[DFA]] ([http://www.nist.gov/dads/HTML/dfa.html DADS])
# [[DFS]] ([http://www.nist.gov/dads/HTML/dfs.html DADS])
# [[DFS]] ([http://www.nist.gov/dads/HTML/dfs.html DADS])
Line 337: Line 217:
# [[diagonalization]] ([http://www.nist.gov/dads/HTML/diagonaliztn.html DADS])
# [[diagonalization]] ([http://www.nist.gov/dads/HTML/diagonaliztn.html DADS])
# [[diameter]] ([http://www.nist.gov/dads/HTML/diameter.html DADS])
# [[diameter]] ([http://www.nist.gov/dads/HTML/diameter.html DADS])
# [[dichotomic search]] ([http://www.nist.gov/dads/HTML/dichotomic.html DADS])
# [[dictionary]] ([http://www.nist.gov/dads/HTML/dictionary.html DADS])
# [[diet]] ([http://www.nist.gov/dads/HTML/diet.html DADS])
# [[diet]] ([http://www.nist.gov/dads/HTML/diet.html DADS])
# [[difference]] ([http://www.nist.gov/dads/HTML/difference.html DADS])
# [[difference]] ([http://www.nist.gov/dads/HTML/difference.html DADS])
# [[digital search tree]] ([http://www.nist.gov/dads/HTML/digitalSearchTree.html DADS])
# [[digital search tree]] ([http://www.nist.gov/dads/HTML/digitalSearchTree.html DADS])
# [[digital tree]] ([http://www.nist.gov/dads/HTML/digitaltree.html DADS])
# [[digital tree]] ([http://www.nist.gov/dads/HTML/digitaltree.html DADS])
# [[digraph]] ([http://www.nist.gov/dads/HTML/digraph.html DADS])
# [[Dijkstra's algorithm]] ([http://www.nist.gov/dads/HTML/dijkstraalgo.html DADS])
# [[diminishing increment sort]] ([http://www.nist.gov/dads/HTML/diminishingIncSort.html DADS])
# [[diminishing increment sort]] ([http://www.nist.gov/dads/HTML/diminishingIncSort.html DADS])
# [[dining philosophers]] ([http://www.nist.gov/dads/HTML/diningphilos.html DADS])
# [[direct chaining]] ([http://www.nist.gov/dads/HTML/directChaining.html DADS])
# [[direct chaining]] ([http://www.nist.gov/dads/HTML/directChaining.html DADS])
# [[directed acyclic graph]] ([http://www.nist.gov/dads/HTML/directAcycGraph.html DADS])
# [[directed acyclic word graph]] ([http://www.nist.gov/dads/HTML/directedAcyclicWordGraph.html DADS])
# [[directed acyclic word graph]] ([http://www.nist.gov/dads/HTML/directedAcyclicWordGraph.html DADS])
# [[directed graph]] ([http://www.nist.gov/dads/HTML/directedGraph.html DADS])
# [[directory]] ([http://www.nist.gov/dads/HTML/directory.html DADS])
# [[directory]] ([http://www.nist.gov/dads/HTML/directory.html DADS])
# [[discrete interval encoding tree]] ([http://www.nist.gov/dads/HTML/discretintrv.html DADS])
# [[discrete interval encoding tree]] ([http://www.nist.gov/dads/HTML/discretintrv.html DADS])
# [[discrete p-center]] ([http://www.nist.gov/dads/HTML/discretpcntr.html DADS])
# [[discrete p-center]] ([http://www.nist.gov/dads/HTML/discretpcntr.html DADS])
# [[disjoint set]] ([http://www.nist.gov/dads/HTML/disjointset.html DADS])
# [[disjunction]] ([http://www.nist.gov/dads/HTML/disjunction.html DADS])
# [[distributional complexity]] ([http://www.nist.gov/dads/HTML/distributionalComplex.html DADS])
# [[distributional complexity]] ([http://www.nist.gov/dads/HTML/distributionalComplex.html DADS])
# [[distribution sort]] ([http://www.nist.gov/dads/HTML/distributionSort.html DADS])
# [[distribution sort]] ([http://www.nist.gov/dads/HTML/distributionSort.html DADS])
# [[divide and conquer]] ([http://www.nist.gov/dads/HTML/divideconqr.html DADS])
# [[divide and marriage before conquest]] ([http://www.nist.gov/dads/HTML/dividemarrig.html DADS])
# [[divide and marriage before conquest]] ([http://www.nist.gov/dads/HTML/dividemarrig.html DADS])
# [[division method]] ([http://www.nist.gov/dads/HTML/divisionmthd.html DADS])
# [[division method]] ([http://www.nist.gov/dads/HTML/divisionmthd.html DADS])
# [[domain]] ([http://www.nist.gov/dads/HTML/domain.html DADS])
# [[domain]] ([http://www.nist.gov/dads/HTML/domain.html DADS])
# [[don't care]] ([http://www.nist.gov/dads/HTML/dontcare.html DADS])
# [[don't care]] ([http://www.nist.gov/dads/HTML/dontcare.html DADS])
# [[doomsday algorithm]] ([http://www.nist.gov/dads/HTML/doomsdayAlgorithm.html DADS])
# [[Doomsday rule]] ([http://www.nist.gov/dads/HTML/doomsday.html DADS])
# [[double-direction bubble sort]] ([http://www.nist.gov/dads/HTML/doubledirectionBubbleSort.html DADS])
# [[double-direction bubble sort]] ([http://www.nist.gov/dads/HTML/doubledirectionBubbleSort.html DADS])
# [[double-ended priority queue]] ([http://www.nist.gov/dads/HTML/doubleendpq.html DADS])
# [[double-ended priority queue]] ([http://www.nist.gov/dads/HTML/doubleendpq.html DADS])
# [[double hashing]] ([http://www.nist.gov/dads/HTML/doublehashng.html DADS])
# [[double left rotation]] ([http://www.nist.gov/dads/HTML/doubleLeftRotat.html DADS])
# [[double left rotation]] ([http://www.nist.gov/dads/HTML/doubleLeftRotat.html DADS])
# [[double metaphone]] ([http://www.nist.gov/dads/HTML/doubleMetaphone.html DADS])
# [[double metaphone]] ([http://www.nist.gov/dads/HTML/doubleMetaphone.html DADS])
# [[double right rotation]] ([http://www.nist.gov/dads/HTML/doubleRightRotation.html DADS])
# [[double right rotation]] ([http://www.nist.gov/dads/HTML/doubleRightRotation.html DADS])
# [[doubly-chained tree]] ([http://www.nist.gov/dads/HTML/doublychainedTree.html DADS])
# [[doubly-chained tree]] ([http://www.nist.gov/dads/HTML/doublychainedTree.html DADS])
# [[doubly-ended queue]] ([http://www.nist.gov/dads/HTML/doublyendedQueue.html DADS])
# [[doubly linked list]] ([http://www.nist.gov/dads/HTML/doublyLinkedList.html DADS])
# [[DPDA]] ([http://www.nist.gov/dads/HTML/dpda.html DADS])
# [[DPDA]] ([http://www.nist.gov/dads/HTML/dpda.html DADS])
# [[d-random scheme]] ([http://www.nist.gov/dads/HTML/drandomScheme.html DADS])
# [[d-random scheme]] ([http://www.nist.gov/dads/HTML/drandomScheme.html DADS])
Line 381: Line 246:
# [[dyadic tree]] ([http://www.nist.gov/dads/HTML/dyadicTree.html DADS])
# [[dyadic tree]] ([http://www.nist.gov/dads/HTML/dyadicTree.html DADS])
# [[dynamic]] ([http://www.nist.gov/dads/HTML/dynamic.html DADS])
# [[dynamic]] ([http://www.nist.gov/dads/HTML/dynamic.html DADS])
# [[dynamic array]] ([http://www.nist.gov/dads/HTML/dynamicarray.html DADS])
# [[dynamic hashing]] ([http://www.nist.gov/dads/HTML/dynamicHashing.html DADS])
# [[dynamic hashing]] ([http://www.nist.gov/dads/HTML/dynamicHashing.html DADS])
# <s>[[dynamic Huffman coding]] ([http://www.nist.gov/dads/HTML/dynamicHuffmanCoding.html DADS])</s>
# [[dynamic programming]] ([http://www.nist.gov/dads/HTML/dynamicprog.html DADS])
# [[dynamization transformation]] ([http://www.nist.gov/dads/HTML/dynamization.html DADS])
# [[dynamization transformation]] ([http://www.nist.gov/dads/HTML/dynamization.html DADS])


===E===
===E===
# [[edge]] ([http://www.nist.gov/dads/HTML/edge.html DADS])
# [[edge coloring]] ([http://www.nist.gov/dads/HTML/edgecoloring.html DADS])
# [[edge connectivity]] ([http://www.nist.gov/dads/HTML/edgeConnectivity.html DADS])
# [[edge connectivity]] ([http://www.nist.gov/dads/HTML/edgeConnectivity.html DADS])
# [[edge crossing]] ([http://www.nist.gov/dads/HTML/edgecrossing.html DADS])
# [[edge crossing]] ([http://www.nist.gov/dads/HTML/edgecrossing.html DADS])
# [[edge-weighted graph]] ([http://www.nist.gov/dads/HTML/edgeweightedGraph.html DADS])
# [[edit distance]] ([http://www.nist.gov/dads/HTML/editDistance.html DADS])
# [[edit operation]] ([http://www.nist.gov/dads/HTML/editoperatin.html DADS])
# [[edit operation]] ([http://www.nist.gov/dads/HTML/editoperatin.html DADS])
# [[edit script]] ([http://www.nist.gov/dads/HTML/editscript.html DADS])
# [[edit script]] ([http://www.nist.gov/dads/HTML/editscript.html DADS])
# [[efficiency]] ([http://www.nist.gov/dads/HTML/efficiency.html DADS])
# [[eight queens]] ([http://www.nist.gov/dads/HTML/eightQueens.html DADS])
# [[8 queens]] ([http://www.nist.gov/dads/HTML/eightqueens.html DADS])
# [[elastic-bucket trie]] ([http://www.nist.gov/dads/HTML/elasticBucketTrie.html DADS])
# [[elastic-bucket trie]] ([http://www.nist.gov/dads/HTML/elasticBucketTrie.html DADS])
# [[element uniqueness]] ([http://www.nist.gov/dads/HTML/elementnqnss.html DADS])
# [[element uniqueness]] ([http://www.nist.gov/dads/HTML/elementnqnss.html DADS])
Line 406: Line 261:
# [[ERCW]] ([http://www.nist.gov/dads/HTML/ercw.html DADS])
# [[ERCW]] ([http://www.nist.gov/dads/HTML/ercw.html DADS])
# [[EREW]] ([http://www.nist.gov/dads/HTML/erew.html DADS])
# [[EREW]] ([http://www.nist.gov/dads/HTML/erew.html DADS])
# [[Euclidean algorithm]] ([http://www.nist.gov/dads/HTML/EuclideanAlgorithm.html DADS])
# [[Euclidean distance]] ([http://www.nist.gov/dads/HTML/euclidndstnc.html DADS])
# [[Euclidean Steiner tree]] ([http://www.nist.gov/dads/HTML/euclidstntre.html DADS])
# [[Euclidean Steiner tree]] ([http://www.nist.gov/dads/HTML/euclidstntre.html DADS])
# [[Euclidean traveling salesman problem]] ([http://www.nist.gov/dads/HTML/euclidntrvls.html DADS])
# [[Euclid's algorithm]] ([http://www.nist.gov/dads/HTML/euclidalgo.html DADS])
# [[Euler cycle]] ([http://www.nist.gov/dads/HTML/eulercycle.html DADS])
# [[Euler cycle]] ([http://www.nist.gov/dads/HTML/eulercycle.html DADS])
# [[Eulerian graph]] ([http://www.nist.gov/dads/HTML/euleriangrph.html DADS])
# [[Eulerian path]] ([http://www.nist.gov/dads/HTML/EulerianPath.html DADS])
# [[Euler tour]] ([http://www.nist.gov/dads/HTML/EulerTour.html DADS])
# [[exact string matching]] ([http://www.nist.gov/dads/HTML/exactStringMatching.html DADS])
# [[exact string matching]] ([http://www.nist.gov/dads/HTML/exactStringMatching.html DADS])
# [[EXCELL]] ([http://www.nist.gov/dads/HTML/excell.html DADS])
# [[EXCELL]] ([http://www.nist.gov/dads/HTML/excell.html DADS])
# [[exchange sort]] ([http://www.nist.gov/dads/HTML/exchangeSort.html DADS])
# [[exclusive or]] ([http://www.nist.gov/dads/HTML/exclusiveOr.html DADS])
# [[exclusive read, concurrent write]] ([http://www.nist.gov/dads/HTML/exclusiveReadConWrt.html DADS])
# [[exclusive read, concurrent write]] ([http://www.nist.gov/dads/HTML/exclusiveReadConWrt.html DADS])
# [[exclusive read, exclusive write]] ([http://www.nist.gov/dads/HTML/exclusiveReadExcluWrt.html DADS])
# [[exclusive read, exclusive write]] ([http://www.nist.gov/dads/HTML/exclusiveReadExcluWrt.html DADS])
Line 424: Line 270:
# [[existential state]] ([http://www.nist.gov/dads/HTML/existentlstt.html DADS])
# [[existential state]] ([http://www.nist.gov/dads/HTML/existentlstt.html DADS])
# [[expandable hashing]] ([http://www.nist.gov/dads/HTML/expandableHashing.html DADS])
# [[expandable hashing]] ([http://www.nist.gov/dads/HTML/expandableHashing.html DADS])
# [[expander graph]] ([http://www.nist.gov/dads/HTML/expandergrph.html DADS])
# [[exponential]] ([http://www.nist.gov/dads/HTML/exponential.html DADS])
# [[exponentiation by repeated squaring]] ([http://www.nist.gov/dads/HTML/exponentiationByRepeatedSquaring.html DADS])
# [[exponentiation by repeated squaring]] ([http://www.nist.gov/dads/HTML/exponentiationByRepeatedSquaring.html DADS])
# [[extended binary tree]] ([http://www.nist.gov/dads/HTML/extendedBinaryTree.html DADS])
# [[extended binary tree]] ([http://www.nist.gov/dads/HTML/extendedBinaryTree.html DADS])
Line 439: Line 283:
# [[external quicksort]] ([http://www.nist.gov/dads/HTML/externalQuicksort.html DADS])
# [[external quicksort]] ([http://www.nist.gov/dads/HTML/externalQuicksort.html DADS])
# [[external radix sort]] ([http://www.nist.gov/dads/HTML/externalRadixSort.html DADS])
# [[external radix sort]] ([http://www.nist.gov/dads/HTML/externalRadixSort.html DADS])
# [[external sort]] ([http://www.nist.gov/dads/HTML/externalsort.html DADS])
# [[extrapolation search]] ([http://www.nist.gov/dads/HTML/extrapolationSearch.html DADS])
# [[extrapolation search]] ([http://www.nist.gov/dads/HTML/extrapolationSearch.html DADS])
# [[extremal]] ([http://www.nist.gov/dads/HTML/extremal.html DADS])
# [[extremal]] ([http://www.nist.gov/dads/HTML/extremal.html DADS])
# [[extreme point]] ([http://www.nist.gov/dads/HTML/extremepoint.html DADS])
# [[extreme point]] ([http://www.nist.gov/dads/HTML/extremepoint.html DADS])

===F===
===F===
# [[facility location]] ([http://www.nist.gov/dads/HTML/facilityloc.html DADS])
# [[facility location]] ([http://www.nist.gov/dads/HTML/facilityloc.html DADS])
# [[factor]] ([http://www.nist.gov/dads/HTML/factor.html DADS])
# [[factor]] ([http://www.nist.gov/dads/HTML/factor.html DADS])
# [[factorial]] ([http://www.nist.gov/dads/HTML/factorial.html DADS])
# [[fast fourier transform]] ([http://www.nist.gov/dads/HTML/fastFourierTransform.html DADS])
# [[fathoming]] ([http://www.nist.gov/dads/HTML/fathoming.html DADS])
# [[fathoming]] ([http://www.nist.gov/dads/HTML/fathoming.html DADS])
# [[feasible region]] ([http://www.nist.gov/dads/HTML/feasibleregn.html DADS])
# [[feasible region]] ([http://www.nist.gov/dads/HTML/feasibleregn.html DADS])
# [[feasible solution]] ([http://www.nist.gov/dads/HTML/feasiblesltn.html DADS])
# [[feedback edge set]] ([http://www.nist.gov/dads/HTML/feedbackEdgeSet.html DADS])
# [[feedback vertex set]] ([http://www.nist.gov/dads/HTML/feedbackVertexSet.html DADS])
# [[Ferguson-Forcade algorithm]] ([http://www.nist.gov/dads/HTML/fergusonForcade.html DADS])
# [[Ferguson-Forcade algorithm]] ([http://www.nist.gov/dads/HTML/fergusonForcade.html DADS])
# [[FFT]] ([http://www.nist.gov/dads/HTML/fft.html DADS])
# [[Fibonaccian search]] ([http://www.nist.gov/dads/HTML/fibonaccianSearch.html DADS])
# [[Fibonaccian search]] ([http://www.nist.gov/dads/HTML/fibonaccianSearch.html DADS])
# [[Fibonacci heap]] ([http://www.nist.gov/dads/HTML/fibonacciHeap.html DADS])
# [[Fibonacci number]] ([http://www.nist.gov/dads/HTML/fibonacciNumber.html DADS])
# [[Fibonacci search]] ([http://www.nist.gov/dads/HTML/FibonacciSearch.html DADS])
# [[Fibonacci search]] ([http://www.nist.gov/dads/HTML/FibonacciSearch.html DADS])
# [[Fibonacci tree]] ([http://www.nist.gov/dads/HTML/fibonacciTree.html DADS])
# [[Fibonacci tree]] ([http://www.nist.gov/dads/HTML/fibonacciTree.html DADS])
# [[Fibonnaci heap]] ([http://www.nist.gov/dads/HTML/FibonnaciHeap.html DADS])
# [[Fibonnaci numbers]] ([http://www.nist.gov/dads/HTML/FibonnaciNumbers.html DADS])
# [[FIFO]] ([http://www.nist.gov/dads/HTML/fifo.html DADS])
# [[filial-heir chain]] ([http://www.nist.gov/dads/HTML/filialheirChain.html DADS])
# [[filial-heir chain]] ([http://www.nist.gov/dads/HTML/filialheirChain.html DADS])
# [[Find]] ([http://www.nist.gov/dads/HTML/find.html DADS])
# [[Find]] ([http://www.nist.gov/dads/HTML/find.html DADS])
# [[find kth least element]] ([http://www.nist.gov/dads/HTML/findKthLeastElement.html DADS])
# [[find kth least element]] ([http://www.nist.gov/dads/HTML/findKthLeastElement.html DADS])
# [[finitary tree]] ([http://www.nist.gov/dads/HTML/finitarytree.html DADS])
# [[finitary tree]] ([http://www.nist.gov/dads/HTML/finitarytree.html DADS])
# [[finite automaton]] ([http://www.nist.gov/dads/HTML/finiteAutomaton.html DADS])
# [[finite Fourier transform]] ([http://www.nist.gov/dads/HTML/finiteFourierTransform.html DADS])
# [[finite state automaton]] ([http://www.nist.gov/dads/HTML/finiteStateAutomaton.html DADS])
# [[finite state machine]] ([http://www.nist.gov/dads/HTML/finiteStateMachine.html DADS])
# [[finite state machine minimization]] ([http://www.nist.gov/dads/HTML/finitestmmin.html DADS])
# [[finite state machine minimization]] ([http://www.nist.gov/dads/HTML/finitestmmin.html DADS])
# [[finite state transducer]] ([http://www.nist.gov/dads/HTML/finiteStateTransducer.html DADS])
# [[first child-next sibling binary tree]] ([http://www.nist.gov/dads/HTML/firstChildnextSiblingBinaryTree.html DADS])
# [[first child-next sibling binary tree]] ([http://www.nist.gov/dads/HTML/firstChildnextSiblingBinaryTree.html DADS])
# [[first come, first served]] ([http://www.nist.gov/dads/HTML/firstcome.html DADS])
# [[first-in, first-out]] ([http://www.nist.gov/dads/HTML/firstinfrstt.html DADS])
# [[Fisher-Yates shuffle]] ([http://www.nist.gov/dads/HTML/fisherYatesShuffle.html DADS])
# [[Fisher-Yates shuffle]] ([http://www.nist.gov/dads/HTML/fisherYatesShuffle.html DADS])
# [[fixed-grid method]] ([http://www.nist.gov/dads/HTML/fixedgrdmthd.html DADS])
# [[fixed-grid method]] ([http://www.nist.gov/dads/HTML/fixedgrdmthd.html DADS])
Line 482: Line 308:
# [[flow conservation]] ([http://www.nist.gov/dads/HTML/flowconsrvtn.html DADS])
# [[flow conservation]] ([http://www.nist.gov/dads/HTML/flowconsrvtn.html DADS])
# [[flow function]] ([http://www.nist.gov/dads/HTML/flowfunction.html DADS])
# [[flow function]] ([http://www.nist.gov/dads/HTML/flowfunction.html DADS])
# [[flow network]] ([http://www.nist.gov/dads/HTML/flownetwork.html DADS])
# [[Floyd-Warshall algorithm]] ([http://www.nist.gov/dads/HTML/floydWarshall.html DADS])
# [[Ford-Bellman]] ([http://www.nist.gov/dads/HTML/FordBellman.html DADS])
# [[Ford-Bellman]] ([http://www.nist.gov/dads/HTML/FordBellman.html DADS])
# [[Ford-Fulkerson method]] ([http://www.nist.gov/dads/HTML/fordFulkerson.html DADS])
# [[forest]] ([http://www.nist.gov/dads/HTML/forest.html DADS])
# [[forest]] ([http://www.nist.gov/dads/HTML/forest.html DADS])
# [[forest editing problem]] ([http://www.nist.gov/dads/HTML/forestedit.html DADS])
# [[forest editing problem]] ([http://www.nist.gov/dads/HTML/forestedit.html DADS])
# [[formal language]] ([http://www.nist.gov/dads/HTML/formalLanguage.html DADS])
# [[formal methods]] ([http://www.nist.gov/dads/HTML/formalmethod.html DADS])
# [[formal verification]] ([http://www.nist.gov/dads/HTML/formalverf.html DADS])
# [[forward index]] ([http://www.nist.gov/dads/HTML/forwardIndex.html DADS])
# [[forward index]] ([http://www.nist.gov/dads/HTML/forwardIndex.html DADS])
# [[fractional knapsack problem]] ([http://www.nist.gov/dads/HTML/fractionalKnapsack.html DADS])
# [[fractional knapsack problem]] ([http://www.nist.gov/dads/HTML/fractionalKnapsack.html DADS])
# [[fractional solution]] ([http://www.nist.gov/dads/HTML/fractional.html DADS])
# [[fractional solution]] ([http://www.nist.gov/dads/HTML/fractional.html DADS])
# [[free edge]] ([http://www.nist.gov/dads/HTML/freeedge.html DADS])
# [[free edge]] ([http://www.nist.gov/dads/HTML/freeedge.html DADS])
# [[free tree]] ([http://www.nist.gov/dads/HTML/freetree.html DADS])
# [[free vertex]] ([http://www.nist.gov/dads/HTML/freevertex.html DADS])
# [[free vertex]] ([http://www.nist.gov/dads/HTML/freevertex.html DADS])
# [[frequency count heuristic]] ([http://www.nist.gov/dads/HTML/frequencyCountHueristic.html DADS])
# [[frequency count heuristic]] ([http://www.nist.gov/dads/HTML/frequencyCountHueristic.html DADS])
# [[full array]] ([http://www.nist.gov/dads/HTML/fullArray.html DADS])
# [[full array]] ([http://www.nist.gov/dads/HTML/fullArray.html DADS])
# [[full binary tree]] ([http://www.nist.gov/dads/HTML/fullBinaryTree.html DADS])
# [[full inverted index]] ([http://www.nist.gov/dads/HTML/fullInvertedIndex.html DADS])
# [[fully dynamic graph problem]] ([http://www.nist.gov/dads/HTML/fullydynamic.html DADS])
# [[fully dynamic graph problem]] ([http://www.nist.gov/dads/HTML/fullydynamic.html DADS])
# [[fully inverted index]] ([http://www.nist.gov/dads/HTML/fullyInvertedIndex.html DADS])
# [[fully inverted index]] ([http://www.nist.gov/dads/HTML/fullyInvertedIndex.html DADS])
# [[fully persistent data structure]] ([http://www.nist.gov/dads/HTML/fullyPersistData.html DADS])
# [[fully persistent data structure]] ([http://www.nist.gov/dads/HTML/fullyPersistData.html DADS])
# [[fully polynomial approximation scheme]] ([http://www.nist.gov/dads/HTML/fullypolynml.html DADS])
# [[fully polynomial approximation scheme]] ([http://www.nist.gov/dads/HTML/fullypolynml.html DADS])
# [[function]] ([http://www.nist.gov/dads/HTML/function.html DADS])
# [[functional data structure]] ([http://www.nist.gov/dads/HTML/functionalDataStructure.html DADS])
# [[functional data structure]] ([http://www.nist.gov/dads/HTML/functionalDataStructure.html DADS])

===G===
===G===
# [[Galil-Giancarlo]] ([http://www.nist.gov/dads/HTML/galilgiancar.html DADS])
# [[Galil-Giancarlo]] ([http://www.nist.gov/dads/HTML/galilgiancar.html DADS])
Line 512: Line 329:
# [[GBD-tree]] ([http://www.nist.gov/dads/HTML/gbdtree.html DADS])
# [[GBD-tree]] ([http://www.nist.gov/dads/HTML/gbdtree.html DADS])
# [[geometric optimization problem]] ([http://www.nist.gov/dads/HTML/geometricopt.html DADS])
# [[geometric optimization problem]] ([http://www.nist.gov/dads/HTML/geometricopt.html DADS])
# [[globally optimal]] ([http://www.nist.gov/dads/HTML/globallyOptimal.html DADS])
# [[global optimum]] ([http://www.nist.gov/dads/HTML/globalOptimum.html DADS])
# [[gnome sort]] ([http://www.nist.gov/dads/HTML/gnomeSort.html DADS])
# [[graph]] ([http://www.nist.gov/dads/HTML/graph.html DADS])
# [[graph coloring]] ([http://www.nist.gov/dads/HTML/graphcolorng.html DADS])
# [[graph concentration]] ([http://www.nist.gov/dads/HTML/graphconcen.html DADS])
# [[graph concentration]] ([http://www.nist.gov/dads/HTML/graphconcen.html DADS])
# [[graph drawing]] ([http://www.nist.gov/dads/HTML/graphdrawing.html DADS])
# [[graph isomorphism]] ([http://www.nist.gov/dads/HTML/graphisomrph.html DADS])
# [[graph partition]] ([http://www.nist.gov/dads/HTML/graphpartitn.html DADS])
# [[graph partition]] ([http://www.nist.gov/dads/HTML/graphpartitn.html DADS])
# [[Gray code]] ([http://www.nist.gov/dads/HTML/graycode.html DADS])
# [[greedy algorithm]] ([http://www.nist.gov/dads/HTML/greedyalgo.html DADS])
# [[greedy heuristic]] ([http://www.nist.gov/dads/HTML/greedyHeuristic.html DADS])
# [[greedy heuristic]] ([http://www.nist.gov/dads/HTML/greedyHeuristic.html DADS])
# [[grey code]] ([http://www.nist.gov/dads/HTML/greyCode.html DADS])
# [[grid drawing]] ([http://www.nist.gov/dads/HTML/griddrawing.html DADS])
# [[grid drawing]] ([http://www.nist.gov/dads/HTML/griddrawing.html DADS])
# [[grid file]] ([http://www.nist.gov/dads/HTML/gridfile.html DADS])
# [[grid file]] ([http://www.nist.gov/dads/HTML/gridfile.html DADS])
# [[Grover's algorithm]] ([http://www.nist.gov/dads/HTML/groversAlgo.html DADS])


===H===
===H===
# [[halting problem]] ([http://www.nist.gov/dads/HTML/haltingProblem.html DADS])
# [[Hamiltonian circuit]] ([http://www.nist.gov/dads/HTML/HamiltonianCircuit.html DADS])
# [[Hamiltonian cycle]] ([http://www.nist.gov/dads/HTML/hamiltonianCycle.html DADS])
# [[Hamiltonian path]] ([http://www.nist.gov/dads/HTML/hamiltonianPath.html DADS])
# [[Hamming distance]] ([http://www.nist.gov/dads/HTML/hammingdist.html DADS])
# [[hash]] ([http://www.nist.gov/dads/HTML/hashI.html DADS])
# [[hash function]] ([http://www.nist.gov/dads/HTML/hash.html DADS])
# [[hash heap]] ([http://www.nist.gov/dads/HTML/hashheap.html DADS])
# [[hash heap]] ([http://www.nist.gov/dads/HTML/hashheap.html DADS])
# [[hash table]] ([http://www.nist.gov/dads/HTML/hashtab.html DADS])
# [[hash table delete]] ([http://www.nist.gov/dads/HTML/hashtabdelet.html DADS])
# [[hash table delete]] ([http://www.nist.gov/dads/HTML/hashtabdelet.html DADS])
# [[Hausdorff distance]] ([http://www.nist.gov/dads/HTML/hausdorffdst.html DADS])
# [[hB-tree]] ([http://www.nist.gov/dads/HTML/hbtree.html DADS])
# [[hB-tree]] ([http://www.nist.gov/dads/HTML/hbtree.html DADS])
# [[head]] ([http://www.nist.gov/dads/HTML/head.html DADS])
# [[head]] ([http://www.nist.gov/dads/HTML/head.html DADS])
# [[heap]] ([http://www.nist.gov/dads/HTML/heap.html DADS])
# [[heap condition]] ([http://www.nist.gov/dads/HTML/heapCondition.html DADS])
# [[heap condition]] ([http://www.nist.gov/dads/HTML/heapCondition.html DADS])
# [[heapify]] ([http://www.nist.gov/dads/HTML/heapify.html DADS])
# [[heap ordered]] ([http://www.nist.gov/dads/HTML/heapOrdered.html DADS])
# [[heap ordered]] ([http://www.nist.gov/dads/HTML/heapOrdered.html DADS])
# [[heap property]] ([http://www.nist.gov/dads/HTML/heapproperty.html DADS])
# [[heap sort]] ([http://www.nist.gov/dads/HTML/heapSortI.html DADS])
# [[heapsort]] ([http://www.nist.gov/dads/HTML/heapSort.html DADS])
# [[heaviest common subsequence]] ([http://www.nist.gov/dads/HTML/heaviestCommonSubsequence.html DADS])
# [[heaviest common subsequence]] ([http://www.nist.gov/dads/HTML/heaviestCommonSubsequence.html DADS])
# [[height]] ([http://www.nist.gov/dads/HTML/height.html DADS])
# [[height]] ([http://www.nist.gov/dads/HTML/height.html DADS])
# [[height-balanced binary search tree]] ([http://www.nist.gov/dads/HTML/heightBalancedBinSrchTree.html DADS])
# [[height-balanced binary search tree]] ([http://www.nist.gov/dads/HTML/heightBalancedBinSrchTree.html DADS])
# [[height-balanced tree]] ([http://www.nist.gov/dads/HTML/heightBalancedTree.html DADS])
# [[height-balanced tree]] ([http://www.nist.gov/dads/HTML/heightBalancedTree.html DADS])
# [[heuristic]] ([http://www.nist.gov/dads/HTML/heuristic.html DADS])
# [[hidden Markov model]] ([http://www.nist.gov/dads/HTML/hiddenMarkovModel.html DADS])
# [[histogram sort]] ([http://www.nist.gov/dads/HTML/histogramSort.html DADS])
# [[histogram sort]] ([http://www.nist.gov/dads/HTML/histogramSort.html DADS])
# [[horizontal visibility map]] ([http://www.nist.gov/dads/HTML/horizontalVisMap.html DADS])
# [[horizontal visibility map]] ([http://www.nist.gov/dads/HTML/horizontalVisMap.html DADS])
# [[Horspool]] ([http://www.nist.gov/dads/HTML/Horspool.html DADS])
# [[Horspool]] ([http://www.nist.gov/dads/HTML/Horspool.html DADS])
# [[hueristic]] ([http://www.nist.gov/dads/HTML/hueristic.html DADS])
# [[hybrid algorithm]] ([http://www.nist.gov/dads/HTML/hybridAlgorithm.html DADS])
# [[hybrid algorithm]] ([http://www.nist.gov/dads/HTML/hybridAlgorithm.html DADS])
# [[hyperedge]] ([http://www.nist.gov/dads/HTML/hyperedge.html DADS])
# [[hyperedge]] ([http://www.nist.gov/dads/HTML/hyperedge.html DADS])
Line 567: Line 356:
# [[implication]] ([http://www.nist.gov/dads/HTML/implication.html DADS])
# [[implication]] ([http://www.nist.gov/dads/HTML/implication.html DADS])
# [[implies]] ([http://www.nist.gov/dads/HTML/implies.html DADS])
# [[implies]] ([http://www.nist.gov/dads/HTML/implies.html DADS])
# [[inclusion-exclusion principle]] ([http://www.nist.gov/dads/HTML/inclusion.html DADS])
# [[inclusive or]] ([http://www.nist.gov/dads/HTML/inclusiveOr.html DADS])
# [[incompressible string]] ([http://www.nist.gov/dads/HTML/incompressbl.html DADS])
# [[incompressible string]] ([http://www.nist.gov/dads/HTML/incompressbl.html DADS])
# [[incremental hashing]] ([http://www.nist.gov/dads/HTML/incrementalHashing.html DADS])
# [[incremental hashing]] ([http://www.nist.gov/dads/HTML/incrementalHashing.html DADS])
# [[in-degree]] ([http://www.nist.gov/dads/HTML/indegree.html DADS])
# [[independent set]] ([http://www.nist.gov/dads/HTML/independntst.html DADS])
# [[index file]] ([http://www.nist.gov/dads/HTML/indexfile.html DADS])
# [[index file]] ([http://www.nist.gov/dads/HTML/indexfile.html DADS])
# [[infix traversal]] ([http://www.nist.gov/dads/HTML/infixTraversal.html DADS])
# [[information theoretic bound]] ([http://www.nist.gov/dads/HTML/information.html DADS])
# [[information theoretic bound]] ([http://www.nist.gov/dads/HTML/information.html DADS])
# [[inorder traversal]] ([http://www.nist.gov/dads/HTML/inorderTraversalI.html DADS])
# [[in-order traversal]] ([http://www.nist.gov/dads/HTML/inorderTraversal.html DADS])
# [[in-place sort]] ([http://www.nist.gov/dads/HTML/inplacesort.html DADS])
# [[insertion sort]] ([http://www.nist.gov/dads/HTML/insertionSort.html DADS])
# [[integer linear program]] ([http://www.nist.gov/dads/HTML/integerliner.html DADS])
# [[integer linear program]] ([http://www.nist.gov/dads/HTML/integerliner.html DADS])
# [[integer multi-commodity flow]] ([http://www.nist.gov/dads/HTML/integermulti.html DADS])
# [[integer multi-commodity flow]] ([http://www.nist.gov/dads/HTML/integermulti.html DADS])
# [[integer polyhedron]] ([http://www.nist.gov/dads/HTML/integer.html DADS])
# [[integer polyhedron]] ([http://www.nist.gov/dads/HTML/integer.html DADS])
# [[interactive proof system]] ([http://www.nist.gov/dads/HTML/interactvprf.html DADS])
# [[interior-based representation]] ([http://www.nist.gov/dads/HTML/interiorbasd.html DADS])
# [[interior-based representation]] ([http://www.nist.gov/dads/HTML/interiorbasd.html DADS])
# [[interior node]] ([http://www.nist.gov/dads/HTML/interiorNode.html DADS])
# [[interior node]] ([http://www.nist.gov/dads/HTML/interiorNode.html DADS])
# [[internal node]] ([http://www.nist.gov/dads/HTML/internalnode.html DADS])
# [[internal sort]] ([http://www.nist.gov/dads/HTML/internalsort.html DADS])
# [[internal sort]] ([http://www.nist.gov/dads/HTML/internalsort.html DADS])
# [[interpolation search]] ([http://www.nist.gov/dads/HTML/interpolationSearch.html DADS])
# [[interpolation-sequential search]] ([http://www.nist.gov/dads/HTML/interpsequen.html DADS])
# [[interpolation-sequential search]] ([http://www.nist.gov/dads/HTML/interpsequen.html DADS])
# [[interpolation sort]] ([http://www.nist.gov/dads/HTML/interpolationSort.html DADS])
# [[intersection]] ([http://www.nist.gov/dads/HTML/intersection.html DADS])
# [[intersection]] ([http://www.nist.gov/dads/HTML/intersection.html DADS])

# [[interval tree]] ([http://www.nist.gov/dads/HTML/intervaltree.html DADS])
# [[intractable]] ([http://www.nist.gov/dads/HTML/intratable.html DADS])
# [[introsort]] ([http://www.nist.gov/dads/HTML/introsort.html DADS])
# [[intro sort]] ([http://www.nist.gov/dads/HTML/introSort.html DADS])
# [[introspection sort]] ([http://www.nist.gov/dads/HTML/introspectionSort.html DADS])
# [[introspective sort]] ([http://www.nist.gov/dads/HTML/introspectiveSort.html DADS])
# [[inverse Ackermann function]] ([http://www.nist.gov/dads/HTML/inverseAckermann.html DADS])
# [[inverse Ackerman's function]] ([http://www.nist.gov/dads/HTML/inverseAckermansFunction.html DADS])
# [[inverted file]] ([http://www.nist.gov/dads/HTML/invertedFile.html DADS])
# [[inverted file index]] ([http://www.nist.gov/dads/HTML/invertedFileIndex.html DADS])
# [[inverted index]] ([http://www.nist.gov/dads/HTML/invertedIndex.html DADS])
# [[irreflexive]] ([http://www.nist.gov/dads/HTML/irreflexive.html DADS])
# [[isomorphic]] ([http://www.nist.gov/dads/HTML/isomorphic.html DADS])
# [[iteration]] ([http://www.nist.gov/dads/HTML/iteration.html DADS])
===J===
===J===
# [[Jaro-Winkler]] ([http://www.nist.gov/dads/HTML/jaroWinkler.html DADS])
# [[Jaro-Winkler]] ([http://www.nist.gov/dads/HTML/jaroWinkler.html DADS])


===K===
===K===
# [[Karmarkar's algorithm]] ([http://www.nist.gov/dads/HTML/karmarkarsAlgo.html DADS])
# [[Karnaugh map]] ([http://www.nist.gov/dads/HTML/karnaughmap.html DADS])
# [[Karp-Rabin]] ([http://www.nist.gov/dads/HTML/karpRabin.html DADS])
# [[Karp reduction]] ([http://www.nist.gov/dads/HTML/karpreductin.html DADS])
# [[k-ary heap]] ([http://www.nist.gov/dads/HTML/karyheap.html DADS])
# [[k-ary heap]] ([http://www.nist.gov/dads/HTML/karyheap.html DADS])
# [[k-ary Huffman coding]] ([http://www.nist.gov/dads/HTML/karyHuffman.html DADS])
# [[k-ary Huffman coding]] ([http://www.nist.gov/dads/HTML/karyHuffman.html DADS])
Line 626: Line 385:
# [[k-d tree]] ([http://www.nist.gov/dads/HTML/kdtree.html DADS])
# [[k-d tree]] ([http://www.nist.gov/dads/HTML/kdtree.html DADS])
# [[key]] ([http://www.nist.gov/dads/HTML/key.html DADS])
# [[key]] ([http://www.nist.gov/dads/HTML/key.html DADS])
# [[KMP]] ([http://www.nist.gov/dads/HTML/kmp.html DADS])
# [[KmpSkip Search]] ([http://www.nist.gov/dads/HTML/kmpskipsrch.html DADS])
# [[KmpSkip Search]] ([http://www.nist.gov/dads/HTML/kmpskipsrch.html DADS])
# [[knapsack problem]] ([http://www.nist.gov/dads/HTML/knapsackProblem.html DADS])
# [[knight's tour]] ([http://www.nist.gov/dads/HTML/knightstour.html DADS])
# [[Knuth-Morris-Pratt algorithm]] ([http://www.nist.gov/dads/HTML/knuthMorrisPratt.html DADS])
# [[Knuth-Pratt-Morris algorithm]] ([http://www.nist.gov/dads/HTML/KnuthPrattMorrisAlgorithm.html DADS])
# [[Knuth's algorithm B]] ([http://www.nist.gov/dads/HTML/KnuthsAlgorithmB.html DADS])
# [[Knuth's algorithm B]] ([http://www.nist.gov/dads/HTML/KnuthsAlgorithmB.html DADS])
# [[K&ouml;nigsberg bridges problem]] ([http://www.nist.gov/dads/HTML/KoumlnigsbergBridgesProblem.html DADS])
# [[K&ouml;nigsberg bridges problem]] ([http://www.nist.gov/dads/HTML/KoumlnigsbergBridgesProblem.html DADS])
# [[Koenigsberg bridges problem]] ([http://www.nist.gov/dads/HTML/KoenigsbergBridgesProblem.html DADS])
# [[Koenigsberg bridges problem]] ([http://www.nist.gov/dads/HTML/KoenigsbergBridgesProblem.html DADS])
# [[Kolmogorov complexity]] ([http://www.nist.gov/dads/HTML/kolmogorov.html DADS])
# [[KPM]] ([http://www.nist.gov/dads/HTML/kpm.html DADS])
# [[Kraft's inequality]] ([http://www.nist.gov/dads/HTML/kraftsinqlty.html DADS])
# [[Kripke structure]] ([http://www.nist.gov/dads/HTML/kripkeStruct.html DADS])
# [[Kruskal's algorithm]] ([http://www.nist.gov/dads/HTML/kruskalsalgo.html DADS])
# [[kth order Fibonacci numbers]] ([http://www.nist.gov/dads/HTML/kthOrderFibonacci.html DADS])
# [[kth order Fibonacci numbers]] ([http://www.nist.gov/dads/HTML/kthOrderFibonacci.html DADS])
# [[kth shortest path]] ([http://www.nist.gov/dads/HTML/kthShortestPathI.html DADS])
# [[kth shortest path]] ([http://www.nist.gov/dads/HTML/kthShortestPathI.html DADS])
Line 648: Line 397:
# [[k-way merge sort]] ([http://www.nist.gov/dads/HTML/kwaymergsort.html DADS])
# [[k-way merge sort]] ([http://www.nist.gov/dads/HTML/kwaymergsort.html DADS])
# [[k-way tree]] ([http://www.nist.gov/dads/HTML/kwayTree.html DADS])
# [[k-way tree]] ([http://www.nist.gov/dads/HTML/kwayTree.html DADS])

===L===
===L===
# [[labeled graph]] ([http://www.nist.gov/dads/HTML/labeledgraph.html DADS])
# [[Landau symbol]] ([http://www.nist.gov/dads/HTML/LandauSymbol.html DADS])
# [[language]] ([http://www.nist.gov/dads/HTML/language.html DADS])
# [[language]] ([http://www.nist.gov/dads/HTML/language.html DADS])
# [[last-in, first-out]] ([http://www.nist.gov/dads/HTML/lastfirstout.html DADS])
# [[Las Vegas algorithm]] ([http://www.nist.gov/dads/HTML/lasVegas.html DADS])
# [[lattice]] ([http://www.nist.gov/dads/HTML/lattice.html DADS])
# [[layered digraph]] ([http://www.nist.gov/dads/HTML/layeredDigraph.html DADS])
# [[layered digraph]] ([http://www.nist.gov/dads/HTML/layeredDigraph.html DADS])
# [[layered graph]] ([http://www.nist.gov/dads/HTML/layeredgraph.html DADS])
# [[layered graph]] ([http://www.nist.gov/dads/HTML/layeredgraph.html DADS])
Line 661: Line 406:
# [[leaf]] ([http://www.nist.gov/dads/HTML/leaf.html DADS])
# [[leaf]] ([http://www.nist.gov/dads/HTML/leaf.html DADS])
# [[left child-right sibling binary tree]] ([http://www.nist.gov/dads/HTML/leftChildrightSiblingBinaryTree.html DADS])
# [[left child-right sibling binary tree]] ([http://www.nist.gov/dads/HTML/leftChildrightSiblingBinaryTree.html DADS])
# [[leftist tree]] ([http://www.nist.gov/dads/HTML/leftisttree.html DADS])
# [[left rotation]] ([http://www.nist.gov/dads/HTML/leftrotation.html DADS])
# [[left single rotation]] ([http://www.nist.gov/dads/HTML/leftSingleRotation.html DADS])
# [[left single rotation]] ([http://www.nist.gov/dads/HTML/leftSingleRotation.html DADS])
# [[Lempel-Ziv]] ([http://www.nist.gov/dads/HTML/LempelZiv.html DADS])
# [[Lempel-Ziv-Welch]] ([http://www.nist.gov/dads/HTML/lempelZivWelch.html DADS])
# [[Lempel-Ziv-Welch data compression]] ([http://www.nist.gov/dads/HTML/LempelZivWelchDataCompression.html DADS])
# [[level-order traversal]] ([http://www.nist.gov/dads/HTML/levelOrderTraversal.html DADS])
# [[level-order traversal]] ([http://www.nist.gov/dads/HTML/levelOrderTraversal.html DADS])
# [[Levenshtein distance]] ([http://www.nist.gov/dads/HTML/Levenshtein.html DADS])
# [[Levenshtein string distance]] ([http://www.nist.gov/dads/HTML/LevenshteinStringDistance.html DADS])
# [[lexicographical order]] ([http://www.nist.gov/dads/HTML/lexicgrphcl.html DADS])
# [[LIFO]] ([http://www.nist.gov/dads/HTML/lifo.html DADS])
# [[linear]] ([http://www.nist.gov/dads/HTML/linear.html DADS])
# [[linear]] ([http://www.nist.gov/dads/HTML/linear.html DADS])
# [[linear congruential generator]] ([http://www.nist.gov/dads/HTML/linearCongruentGen.html DADS])
# [[linear hash]] ([http://www.nist.gov/dads/HTML/linearhash.html DADS])
# [[linear hashing]] ([http://www.nist.gov/dads/HTML/linearHashing.html DADS])
# [[linear insertion sort]] ([http://www.nist.gov/dads/HTML/linearInsertionSort.html DADS])
# [[linear order]] ([http://www.nist.gov/dads/HTML/linearOrder.html DADS])
# [[linear probing]] ([http://www.nist.gov/dads/HTML/linearprobng.html DADS])
# [[linear probing sort]] ([http://www.nist.gov/dads/HTML/linearProbingSort.html DADS])
# [[linear probing sort]] ([http://www.nist.gov/dads/HTML/linearProbingSort.html DADS])
# [[linear product]] ([http://www.nist.gov/dads/HTML/linearprodct.html DADS])
# [[linear product]] ([http://www.nist.gov/dads/HTML/linearprodct.html DADS])
# [[linear program]] ([http://www.nist.gov/dads/HTML/linearprogrm.html DADS])
# [[linear quadtree]] ([http://www.nist.gov/dads/HTML/linearquadtr.html DADS])
# [[linear quadtree]] ([http://www.nist.gov/dads/HTML/linearquadtr.html DADS])
# [[linear search]] ([http://www.nist.gov/dads/HTML/linearSearch.html DADS])
# [[link]] ([http://www.nist.gov/dads/HTML/link.html DADS])
# [[link]] ([http://www.nist.gov/dads/HTML/link.html DADS])
# [[linked list]] ([http://www.nist.gov/dads/HTML/linkedList.html DADS])
# [[list]] ([http://www.nist.gov/dads/HTML/list.html DADS])
# [[list contraction]] ([http://www.nist.gov/dads/HTML/listcontrctn.html DADS])
# [[list contraction]] ([http://www.nist.gov/dads/HTML/listcontrctn.html DADS])
# [[little-o notation]] ([http://www.nist.gov/dads/HTML/littleOnotation.html DADS])
# [[little-o notation]] ([http://www.nist.gov/dads/HTML/littleOnotation.html DADS])
# [[Lm distance]] ([http://www.nist.gov/dads/HTML/lmdistance.html DADS])
# [[Lm distance]] ([http://www.nist.gov/dads/HTML/lmdistance.html DADS])
# [[load factor]] ([http://www.nist.gov/dads/HTML/loadfactor.html DADS])
# [[local alignment]] ([http://www.nist.gov/dads/HTML/localalgnmnt.html DADS])
# [[local alignment]] ([http://www.nist.gov/dads/HTML/localalgnmnt.html DADS])
# [[locally optimal]] ([http://www.nist.gov/dads/HTML/locallyOptimal.html DADS])
# [[local optimum]] ([http://www.nist.gov/dads/HTML/localoptimum.html DADS])
# [[logarithmic]] ([http://www.nist.gov/dads/HTML/logarithmic.html DADS])
# [[longest common subsequence]] ([http://www.nist.gov/dads/HTML/longestcommn.html DADS])
# [[longest common substring]] ([http://www.nist.gov/dads/HTML/longestCommonSubstring.html DADS])
# [[longest common substring]] ([http://www.nist.gov/dads/HTML/longestCommonSubstring.html DADS])
# [[Lotka's law]] ([http://www.nist.gov/dads/HTML/lotkaslaw.html DADS])
# [[lower bound]] ([http://www.nist.gov/dads/HTML/lowerbound.html DADS])
# [[lower triangular matrix]] ([http://www.nist.gov/dads/HTML/lowerTriangularMatrix.html DADS])
# [[lowest common ancestor]] ([http://www.nist.gov/dads/HTML/lowestcommon.html DADS])
# [[lowest common ancestor]] ([http://www.nist.gov/dads/HTML/lowestcommon.html DADS])
# [[l-reduction]] ([http://www.nist.gov/dads/HTML/lreduction.html DADS])
# [[l-reduction]] ([http://www.nist.gov/dads/HTML/lreduction.html DADS])
Line 705: Line 423:
# [[luckysort]] ([http://www.nist.gov/dads/HTML/luckysort.html DADS])
# [[luckysort]] ([http://www.nist.gov/dads/HTML/luckysort.html DADS])
# [[lucky sort]] ([http://www.nist.gov/dads/HTML/luckySort.html DADS])
# [[lucky sort]] ([http://www.nist.gov/dads/HTML/luckySort.html DADS])
# [[LZW compression]] ([http://www.nist.gov/dads/HTML/LZWCompression.html DADS])


===M===
===M===
# [[Malhotra-Kumar-Maheshwari blocking flow]] ([http://www.nist.gov/dads/HTML/malhotraKumr.html DADS])
# [[Malhotra-Kumar-Maheshwari blocking flow]] ([http://www.nist.gov/dads/HTML/malhotraKumr.html DADS])
# [[Manhattan distance]] ([http://www.nist.gov/dads/HTML/manhattanDistance.html DADS])
# [[many-one reduction]] ([http://www.nist.gov/dads/HTML/manyonerdctn.html DADS])
# [[map]] ([http://www.nist.gov/dads/HTML/map.html DADS])
# [[map]] ([http://www.nist.gov/dads/HTML/map.html DADS])
# [[marriage problem]] ([http://www.nist.gov/dads/HTML/marriageProblem.html DADS])
# [[Master theorem]] ([http://www.nist.gov/dads/HTML/mastertheorm.html DADS])
# [[matched edge]] ([http://www.nist.gov/dads/HTML/matchededge.html DADS])
# [[matched edge]] ([http://www.nist.gov/dads/HTML/matchededge.html DADS])
# [[matched vertex]] ([http://www.nist.gov/dads/HTML/matchedvertx.html DADS])
# [[matched vertex]] ([http://www.nist.gov/dads/HTML/matchedvertx.html DADS])
# [[matching]] ([http://www.nist.gov/dads/HTML/matching.html DADS])
# [[matrix]] ([http://www.nist.gov/dads/HTML/matrix.html DADS])
# [[matrix-chain multiplication problem]] ([http://www.nist.gov/dads/HTML/matrxchnmltp.html DADS])
# [[matrix-chain multiplication problem]] ([http://www.nist.gov/dads/HTML/matrxchnmltp.html DADS])
# [[max-heap property]] ([http://www.nist.gov/dads/HTML/maxheapprop.html DADS])
# [[max-heap property]] ([http://www.nist.gov/dads/HTML/maxheapprop.html DADS])
# [[maximal independent set]] ([http://www.nist.gov/dads/HTML/maxmlndpndnt.html DADS])
# [[maximally connected component]] ([http://www.nist.gov/dads/HTML/maximallyConnectedComponent.html DADS])
# [[maximally connected component]] ([http://www.nist.gov/dads/HTML/maximallyConnectedComponent.html DADS])
# [[Maximal Shift]] ([http://www.nist.gov/dads/HTML/maximalshift.html DADS])
# [[Maximal Shift]] ([http://www.nist.gov/dads/HTML/maximalshift.html DADS])
Line 728: Line 438:
# [[MAX-SNP]] ([http://www.nist.gov/dads/HTML/MAXSNP.html DADS])
# [[MAX-SNP]] ([http://www.nist.gov/dads/HTML/MAXSNP.html DADS])
# [[MBB]] ([http://www.nist.gov/dads/HTML/mbb.html DADS])
# [[MBB]] ([http://www.nist.gov/dads/HTML/mbb.html DADS])
# [[Mealy machine]] ([http://www.nist.gov/dads/HTML/mealyMachine.html DADS])
# [[mean]] ([http://www.nist.gov/dads/HTML/mean.html DADS])
# [[median]] ([http://www.nist.gov/dads/HTML/median.html DADS])
# [[meld]] ([http://www.nist.gov/dads/HTML/meld.html DADS])
# [[meld]] ([http://www.nist.gov/dads/HTML/meld.html DADS])
# [[merge]] ([http://www.nist.gov/dads/HTML/merge.html DADS])
# [[merge exchange sort]] ([http://www.nist.gov/dads/HTML/mergeExchangeSort.html DADS])
# [[merge exchange sort]] ([http://www.nist.gov/dads/HTML/mergeExchangeSort.html DADS])
# [[mergesort]] ([http://www.nist.gov/dads/HTML/mergesortI.html DADS])
# [[merge sort]] ([http://www.nist.gov/dads/HTML/mergesort.html DADS])
# [[meromorphic function]] ([http://www.nist.gov/dads/HTML/meromorphic.html DADS])
# [[metaheuristic]] ([http://www.nist.gov/dads/HTML/metaheuristic.html DADS])
# [[metaphone]] ([http://www.nist.gov/dads/HTML/metaphone.html DADS])
# [[midrange]] ([http://www.nist.gov/dads/HTML/midrange.html DADS])
# [[Miller-Rabin]] ([http://www.nist.gov/dads/HTML/millerRabin.html DADS])
# [[Miller-Rabin]] ([http://www.nist.gov/dads/HTML/millerRabin.html DADS])
# [[Miller-Rabin probabilistic primality test]] ([http://www.nist.gov/dads/HTML/MillerRabinProbabilisticPrimalityTest.html DADS])
# [[Miller-Rabin probabilistic primality test]] ([http://www.nist.gov/dads/HTML/MillerRabinProbabilisticPrimalityTest.html DADS])
Line 745: Line 445:
# [[minimal code spanning tree]] ([http://www.nist.gov/dads/HTML/minimalCodeSpanningTree.html DADS])
# [[minimal code spanning tree]] ([http://www.nist.gov/dads/HTML/minimalCodeSpanningTree.html DADS])
# [[minimum bounding box]] ([http://www.nist.gov/dads/HTML/minimumBoundingBox.html DADS])
# [[minimum bounding box]] ([http://www.nist.gov/dads/HTML/minimumBoundingBox.html DADS])
# [[minimum cost spanning tree]] ([http://www.nist.gov/dads/HTML/minimumCostSpanningTree.html DADS])
# [[minimum cut]] ([http://www.nist.gov/dads/HTML/minimumcut.html DADS])
# [[minimum path cover]] ([http://www.nist.gov/dads/HTML/minimmpthcvr.html DADS])
# [[minimum path cover]] ([http://www.nist.gov/dads/HTML/minimmpthcvr.html DADS])
# [[minimum spanning tree]] ([http://www.nist.gov/dads/HTML/minimumSpanningTree.html DADS])
# [[minimum vertex cut]] ([http://www.nist.gov/dads/HTML/minvertexcut.html DADS])
# [[minimum vertex cut]] ([http://www.nist.gov/dads/HTML/minvertexcut.html DADS])
# [[mixed integer linear program]] ([http://www.nist.gov/dads/HTML/mixedinteger.html DADS])
# [[mixed integer linear program]] ([http://www.nist.gov/dads/HTML/mixedinteger.html DADS])
# [[mode]] ([http://www.nist.gov/dads/HTML/mode.html DADS])
# [[mode]] ([http://www.nist.gov/dads/HTML/mode.html DADS])
# [[model checking]] ([http://www.nist.gov/dads/HTML/modelcheckng.html DADS])
# [[model of computation]] ([http://www.nist.gov/dads/HTML/modelOfComputation.html DADS])
# [[moderately exponential]] ([http://www.nist.gov/dads/HTML/moderatexpon.html DADS])
# [[moderately exponential]] ([http://www.nist.gov/dads/HTML/moderatexpon.html DADS])
# [[MODIFIND]] ([http://www.nist.gov/dads/HTML/modifind.html DADS])
# [[MODIFIND]] ([http://www.nist.gov/dads/HTML/modifind.html DADS])
# [[monotone priority queue]] ([http://www.nist.gov/dads/HTML/monotonprioq.html DADS])
# [[monotone priority queue]] ([http://www.nist.gov/dads/HTML/monotonprioq.html DADS])
# [[monotonically decreasing]] ([http://www.nist.gov/dads/HTML/monotoncdecr.html DADS])
# [[monotonically increasing]] ([http://www.nist.gov/dads/HTML/monotoncincr.html DADS])
# [[Monte Carlo algorithm]] ([http://www.nist.gov/dads/HTML/monteCarlo.html DADS])
# [[Moore machine]] ([http://www.nist.gov/dads/HTML/mooreMachine.html DADS])
# [[Morris-Pratt]] ([http://www.nist.gov/dads/HTML/morrispratt.html DADS])
# [[Morris-Pratt]] ([http://www.nist.gov/dads/HTML/morrispratt.html DADS])
# [[move]] ([http://www.nist.gov/dads/HTML/move.html DADS])
# [[move]] ([http://www.nist.gov/dads/HTML/move.html DADS])
# [[move-to-front heuristic]] ([http://www.nist.gov/dads/HTML/movefront.html DADS])
# [[move-to-front heuristic]] ([http://www.nist.gov/dads/HTML/movefront.html DADS])
# [[move-to-root heuristic]] ([http://www.nist.gov/dads/HTML/movetoroot.html DADS])
# [[move-to-root heuristic]] ([http://www.nist.gov/dads/HTML/movetoroot.html DADS])
# [[MST]] ([http://www.nist.gov/dads/HTML/mst.html DADS])
# [[multi-commodity flow]] ([http://www.nist.gov/dads/HTML/multicommdty.html DADS])
# [[multi-commodity flow]] ([http://www.nist.gov/dads/HTML/multicommdty.html DADS])
# [[multigraph]] ([http://www.nist.gov/dads/HTML/multigraph.html DADS])
# [[multilayer grid file]] ([http://www.nist.gov/dads/HTML/multilaygrd.html DADS])
# [[multilayer grid file]] ([http://www.nist.gov/dads/HTML/multilaygrd.html DADS])
# [[multiplication method]] ([http://www.nist.gov/dads/HTML/multplctnmth.html DADS])
# [[multiplication method]] ([http://www.nist.gov/dads/HTML/multplctnmth.html DADS])
Line 773: Line 462:
# [[multiprefix]] ([http://www.nist.gov/dads/HTML/multiprefix.html DADS])
# [[multiprefix]] ([http://www.nist.gov/dads/HTML/multiprefix.html DADS])
# [[multiprocessor model]] ([http://www.nist.gov/dads/HTML/multiprocssr.html DADS])
# [[multiprocessor model]] ([http://www.nist.gov/dads/HTML/multiprocssr.html DADS])
# [[multi-set]] ([http://www.nist.gov/dads/HTML/multiset.html DADS])
# [[multiset]] ([http://www.nist.gov/dads/HTML/multiset.html DADS])
# [[multi suffix tree]] ([http://www.nist.gov/dads/HTML/multiSuffixTree.html DADS])
# [[multi suffix tree]] ([http://www.nist.gov/dads/HTML/multiSuffixTree.html DADS])
# [[multiway decision]] ([http://www.nist.gov/dads/HTML/multiwayDecision.html DADS])
# [[multiway decision]] ([http://www.nist.gov/dads/HTML/multiwayDecision.html DADS])
Line 783: Line 470:
===N===
===N===
# [[naive string search]] ([http://www.nist.gov/dads/HTML/naiveStringSearch.html DADS])
# [[naive string search]] ([http://www.nist.gov/dads/HTML/naiveStringSearch.html DADS])
# [[nand]] ([http://www.nist.gov/dads/HTML/nand.html DADS])
# [[n-ary function]] ([http://www.nist.gov/dads/HTML/naryfunc.html DADS])
# [[n-ary function]] ([http://www.nist.gov/dads/HTML/naryfunc.html DADS])
# [[NC many-one reducibility]] ([http://www.nist.gov/dads/HTML/nCmanyone.html DADS])
# [[NC many-one reducibility]] ([http://www.nist.gov/dads/HTML/nCmanyone.html DADS])
# [[nearest neighbor]] ([http://www.nist.gov/dads/HTML/nearestNeighbor.html DADS])
# [[negation]] ([http://www.nist.gov/dads/HTML/negation.html DADS])
# [[network flow]] ([http://www.nist.gov/dads/HTML/networkFlow.html DADS])
# [[network flow problem]] ([http://www.nist.gov/dads/HTML/networkFlowProblem.html DADS])
# [[next state]] ([http://www.nist.gov/dads/HTML/nextstate.html DADS])
# [[next state]] ([http://www.nist.gov/dads/HTML/nextstate.html DADS])
# [[NFTA]] ([http://www.nist.gov/dads/HTML/nfta.html DADS])
# [[NFTA]] ([http://www.nist.gov/dads/HTML/nfta.html DADS])
# [[node]] ([http://www.nist.gov/dads/HTML/node.html DADS])
# [[nonbalanced merge]] ([http://www.nist.gov/dads/HTML/nonbalancedMerge.html DADS])
# [[nonbalanced merge]] ([http://www.nist.gov/dads/HTML/nonbalancedMerge.html DADS])
# [[nonbalanced merge sort]] ([http://www.nist.gov/dads/HTML/nonbalncmsrt.html DADS])
# [[nonbalanced merge sort]] ([http://www.nist.gov/dads/HTML/nonbalncmsrt.html DADS])
# [[nondeterministic]] ([http://www.nist.gov/dads/HTML/nondeterministic.html DADS])
# [[nondeterministic algorithm]] ([http://www.nist.gov/dads/HTML/nondetermAlgo.html DADS])
# [[nondeterministic finite automaton]] ([http://www.nist.gov/dads/HTML/nondeterministicFiniteAutomaton.html DADS])
# [[nondeterministic finite state machine]] ([http://www.nist.gov/dads/HTML/nondetermFiniteStateMach.html DADS])
# [[nondeterministic finite tree automaton]] ([http://www.nist.gov/dads/HTML/nondetermFiniteTreeAutom.html DADS])
# [[nondeterministic finite tree automaton]] ([http://www.nist.gov/dads/HTML/nondetermFiniteTreeAutom.html DADS])
# [[nondeterministic polynomial time]] ([http://www.nist.gov/dads/HTML/nondeterministicPolynomialTime.html DADS])
# [[nondeterministic tree automaton]] ([http://www.nist.gov/dads/HTML/nondetermTreeAutom.html DADS])
# [[nondeterministic tree automaton]] ([http://www.nist.gov/dads/HTML/nondetermTreeAutom.html DADS])
# [[nondeterministic Turing machine]] ([http://www.nist.gov/dads/HTML/nondetermTuringMach.html DADS])
# [[nonterminal node]] ([http://www.nist.gov/dads/HTML/nonterminalNode.html DADS])
# [[nonterminal node]] ([http://www.nist.gov/dads/HTML/nonterminalNode.html DADS])
# [[nor]] ([http://www.nist.gov/dads/HTML/nor.html DADS])
# [[not]] ([http://www.nist.gov/dads/HTML/not.html DADS])
# [[Not So Naive]] ([http://www.nist.gov/dads/HTML/notsonaive.html DADS])
# [[Not So Naive]] ([http://www.nist.gov/dads/HTML/notsonaive.html DADS])
# [[NP]] ([http://www.nist.gov/dads/HTML/np.html DADS])
# [[NPC]] ([http://www.nist.gov/dads/HTML/npc.html DADS])
# [[NP-complete]] ([http://www.nist.gov/dads/HTML/npcomplete.html DADS])
# [[NP-complete language]] ([http://www.nist.gov/dads/HTML/nPcompltlngg.html DADS])
# [[NP-hard]] ([http://www.nist.gov/dads/HTML/nphard.html DADS])
# [[n queens]] ([http://www.nist.gov/dads/HTML/nqueens.html DADS])
# [[null tree]] ([http://www.nist.gov/dads/HTML/nulltree.html DADS])
# [[null tree]] ([http://www.nist.gov/dads/HTML/nulltree.html DADS])
# [[NYSIIS]] ([http://www.nist.gov/dads/HTML/nysiis.html DADS])
# [[NYSIIS]] ([http://www.nist.gov/dads/HTML/nysiis.html DADS])


===O===
===O===
# [[OBDD]] ([http://www.nist.gov/dads/HTML/obdd.html DADS])
# [[objective function]] ([http://www.nist.gov/dads/HTML/objective.html DADS])
# [[oblivious binary decision diagram]] ([http://www.nist.gov/dads/HTML/obliviousBinaryDecisionDiagram.html DADS])
# [[oblivious binary decision diagram]] ([http://www.nist.gov/dads/HTML/obliviousBinaryDecisionDiagram.html DADS])
# [[occurrence]] ([http://www.nist.gov/dads/HTML/occurrence.html DADS])
# [[occurrence]] ([http://www.nist.gov/dads/HTML/occurrence.html DADS])
# [[octree]] ([http://www.nist.gov/dads/HTML/octree.html DADS])
# [[octtree]] ([http://www.nist.gov/dads/HTML/octtree.html DADS])
# [[odd shaped array]] ([http://www.nist.gov/dads/HTML/oddShapedArray.html DADS])
# [[odd shaped array]] ([http://www.nist.gov/dads/HTML/oddShapedArray.html DADS])
# [[off-line algorithm]] ([http://www.nist.gov/dads/HTML/offline.html DADS])
# [[off-line algorithm]] ([http://www.nist.gov/dads/HTML/offline.html DADS])
# [[offset]] ([http://www.nist.gov/dads/HTML/offset.html DADS])
# [[1-based array]] ([http://www.nist.gov/dads/HTML/1basedArray.html DADS])
# [[1-based array]] ([http://www.nist.gov/dads/HTML/1basedArray.html DADS])
# [[one-based indexing]] ([http://www.nist.gov/dads/HTML/oneBasedIndexing.html DADS])
# [[one-based indexing]] ([http://www.nist.gov/dads/HTML/oneBasedIndexing.html DADS])
# [[one-dimensional]] ([http://www.nist.gov/dads/HTML/onedimensnal.html DADS])
# [[on-line algorithm]] ([http://www.nist.gov/dads/HTML/online.html DADS])
# [[open addressing]] ([http://www.nist.gov/dads/HTML/openaddress.html DADS])
# [[optimal]] ([http://www.nist.gov/dads/HTML/optimal.html DADS])
# [[optimal cost]] ([http://www.nist.gov/dads/HTML/optimalCost.html DADS])
# [[optimal cost]] ([http://www.nist.gov/dads/HTML/optimalCost.html DADS])
# [[optimal hashing]] ([http://www.nist.gov/dads/HTML/optimalHashing.html DADS])
# [[optimal hashing]] ([http://www.nist.gov/dads/HTML/optimalHashing.html DADS])
Line 842: Line 500:
# [[optimal triangulation problem]] ([http://www.nist.gov/dads/HTML/optimTriangulation.html DADS])
# [[optimal triangulation problem]] ([http://www.nist.gov/dads/HTML/optimTriangulation.html DADS])
# [[optimal value]] ([http://www.nist.gov/dads/HTML/optimalvalue.html DADS])
# [[optimal value]] ([http://www.nist.gov/dads/HTML/optimalvalue.html DADS])
# [[optimization problem]] ([http://www.nist.gov/dads/HTML/optimization.html DADS])
# [[or]] ([http://www.nist.gov/dads/HTML/or.html DADS])
# [[oracle set]] ([http://www.nist.gov/dads/HTML/oracleset.html DADS])
# [[oracle set]] ([http://www.nist.gov/dads/HTML/oracleset.html DADS])
# [[oracle tape]] ([http://www.nist.gov/dads/HTML/oracletape.html DADS])
# [[oracle tape]] ([http://www.nist.gov/dads/HTML/oracletape.html DADS])
# [[oracle Turing machine]] ([http://www.nist.gov/dads/HTML/oracleTur.html DADS])
# [[order]] ([http://www.nist.gov/dads/HTML/order.html DADS])
# [[ordered array]] ([http://www.nist.gov/dads/HTML/orderedarry.html DADS])
# [[ordered array]] ([http://www.nist.gov/dads/HTML/orderedarry.html DADS])
# [[ordered binary decision diagram]] ([http://www.nist.gov/dads/HTML/orderedBinaryDecisionDiagram.html DADS])
# [[ordered binary decision diagram]] ([http://www.nist.gov/dads/HTML/orderedBinaryDecisionDiagram.html DADS])
Line 861: Line 515:
# [[orthogonally convex rectilinear polygon]] ([http://www.nist.gov/dads/HTML/orthogoncnvx.html DADS])
# [[orthogonally convex rectilinear polygon]] ([http://www.nist.gov/dads/HTML/orthogoncnvx.html DADS])
# [[oscillating merge sort]] ([http://www.nist.gov/dads/HTML/oscillatingMergeSort.html DADS])
# [[oscillating merge sort]] ([http://www.nist.gov/dads/HTML/oscillatingMergeSort.html DADS])
# [[out-degree]] ([http://www.nist.gov/dads/HTML/outdegree.html DADS])


===P===
===P===
Line 868: Line 521:
# [[padding argument]] ([http://www.nist.gov/dads/HTML/paddingrgmnt.html DADS])
# [[padding argument]] ([http://www.nist.gov/dads/HTML/paddingrgmnt.html DADS])
# [[pagoda]] ([http://www.nist.gov/dads/HTML/pagoda.html DADS])
# [[pagoda]] ([http://www.nist.gov/dads/HTML/pagoda.html DADS])
# [[pairing heap]] ([http://www.nist.gov/dads/HTML/pairingHeap.html DADS])
# [[PAM]] ([http://www.nist.gov/dads/HTML/pam.html DADS])
# [[PAM]] ([http://www.nist.gov/dads/HTML/pam.html DADS])
# [[parallel computation thesis]] ([http://www.nist.gov/dads/HTML/parallel.html DADS])
# [[parallel computation thesis]] ([http://www.nist.gov/dads/HTML/parallel.html DADS])
Line 875: Line 527:
# [[parametric searching]] ([http://www.nist.gov/dads/HTML/parametrsrch.html DADS])
# [[parametric searching]] ([http://www.nist.gov/dads/HTML/parametrsrch.html DADS])
# [[parent]] ([http://www.nist.gov/dads/HTML/parent.html DADS])
# [[parent]] ([http://www.nist.gov/dads/HTML/parent.html DADS])
# [[partial function]] ([http://www.nist.gov/dads/HTML/partialfunct.html DADS])
# [[partially decidable problem]] ([http://www.nist.gov/dads/HTML/partiallyDecidableProb.html DADS])
# [[partially decidable problem]] ([http://www.nist.gov/dads/HTML/partiallyDecidableProb.html DADS])
# [[partially dynamic graph problem]] ([http://www.nist.gov/dads/HTML/partiallyDynamicGraph.html DADS])
# [[partially dynamic graph problem]] ([http://www.nist.gov/dads/HTML/partiallyDynamicGraph.html DADS])
# [[partially ordered set]] ([http://www.nist.gov/dads/HTML/partiallyOrderedSet.html DADS])
# [[partially persistent data structure]] ([http://www.nist.gov/dads/HTML/partiallyPersistData.html DADS])
# [[partially persistent data structure]] ([http://www.nist.gov/dads/HTML/partiallyPersistData.html DADS])
# [[partial order]] ([http://www.nist.gov/dads/HTML/partialorder.html DADS])
# [[partial recursive function]] ([http://www.nist.gov/dads/HTML/partialrcrsv.html DADS])
# [[partition]] ([http://www.nist.gov/dads/HTML/partition.html DADS])
# [[passive data structure]] ([http://www.nist.gov/dads/HTML/passiveDataStruc.html DADS])
# [[passive data structure]] ([http://www.nist.gov/dads/HTML/passiveDataStruc.html DADS])
# [[path]] ([http://www.nist.gov/dads/HTML/path.html DADS])
# [[path cover]] ([http://www.nist.gov/dads/HTML/pathcover.html DADS])
# [[path system problem]] ([http://www.nist.gov/dads/HTML/pathsystem.html DADS])
# [[path system problem]] ([http://www.nist.gov/dads/HTML/pathsystem.html DADS])
# [[Patricia tree]] ([http://www.nist.gov/dads/HTML/patriciatree.html DADS])
# [[pattern]] ([http://www.nist.gov/dads/HTML/pattern.html DADS])
# [[pattern]] ([http://www.nist.gov/dads/HTML/pattern.html DADS])
# [[pattern element]] ([http://www.nist.gov/dads/HTML/patternelmnt.html DADS])
# [[pattern element]] ([http://www.nist.gov/dads/HTML/patternelmnt.html DADS])
# [[P-complete]] ([http://www.nist.gov/dads/HTML/pcomplete.html DADS])
# [[PCP]] ([http://www.nist.gov/dads/HTML/pcp.html DADS])
# [[PD]] ([http://www.nist.gov/dads/HTML/pd.html DADS])
# [[PD]] ([http://www.nist.gov/dads/HTML/pd.html DADS])
# [[PDA]] ([http://www.nist.gov/dads/HTML/pda.html DADS])
# [[Pearson's hash]] ([http://www.nist.gov/dads/HTML/pearsonshash.html DADS])
# [[Pearson's hash]] ([http://www.nist.gov/dads/HTML/pearsonshash.html DADS])
# [[perfect binary tree]] ([http://www.nist.gov/dads/HTML/perfectBinaryTree.html DADS])
# [[perfect binary tree]] ([http://www.nist.gov/dads/HTML/perfectBinaryTree.html DADS])
# [[perfect hashing]] ([http://www.nist.gov/dads/HTML/perfecthash.html DADS])
# [[perfect k-ary tree]] ([http://www.nist.gov/dads/HTML/perfectKaryTree.html DADS])
# [[perfect k-ary tree]] ([http://www.nist.gov/dads/HTML/perfectKaryTree.html DADS])
# [[perfect match]] ([http://www.nist.gov/dads/HTML/perfectMatch.html DADS])
# [[perfect matching]] ([http://www.nist.gov/dads/HTML/perfectmatch.html DADS])
# [[perfect shuffle]] ([http://www.nist.gov/dads/HTML/perfectShuffle.html DADS])
# [[perfect shuffle]] ([http://www.nist.gov/dads/HTML/perfectShuffle.html DADS])
# [[performance guarantee]] ([http://www.nist.gov/dads/HTML/performance.html DADS])
# [[performance guarantee]] ([http://www.nist.gov/dads/HTML/performance.html DADS])
# [[performance ratio]] ([http://www.nist.gov/dads/HTML/performanceRatio.html DADS])
# [[performance ratio]] ([http://www.nist.gov/dads/HTML/performanceRatio.html DADS])
# [[permutation]] ([http://www.nist.gov/dads/HTML/permutation.html DADS])
# [[persistant data structure]] ([http://www.nist.gov/dads/HTML/persistantDataStructure.html DADS])
# [[persistent data structure]] ([http://www.nist.gov/dads/HTML/persistentDataStructure.html DADS])
# [[persistent data structure with confluence]] ([http://www.nist.gov/dads/HTML/persistentDataStructureWithConfluence.html DADS])
# [[persistent data structure with confluence]] ([http://www.nist.gov/dads/HTML/persistentDataStructureWithConfluence.html DADS])
# [[phonetic coding]] ([http://www.nist.gov/dads/HTML/phoneticCoding.html DADS])
# [[phonetic coding]] ([http://www.nist.gov/dads/HTML/phoneticCoding.html DADS])
Line 913: Line 548:
# [[pile]] ([http://www.nist.gov/dads/HTML/pile.html DADS])
# [[pile]] ([http://www.nist.gov/dads/HTML/pile.html DADS])
# [[pipelined divide and conquer]] ([http://www.nist.gov/dads/HTML/pipelineddvd.html DADS])
# [[pipelined divide and conquer]] ([http://www.nist.gov/dads/HTML/pipelineddvd.html DADS])
# [[planar graph]] ([http://www.nist.gov/dads/HTML/planargraph.html DADS])
# [[planarity]] ([http://www.nist.gov/dads/HTML/planarity.html DADS])
# [[planarity]] ([http://www.nist.gov/dads/HTML/planarity.html DADS])
# [[planarization]] ([http://www.nist.gov/dads/HTML/planarization.html DADS])
# [[planarization]] ([http://www.nist.gov/dads/HTML/planarization.html DADS])
Line 924: Line 558:
# [[polychotomy]] ([http://www.nist.gov/dads/HTML/polychotomy.html DADS])
# [[polychotomy]] ([http://www.nist.gov/dads/HTML/polychotomy.html DADS])
# [[polyhedron]] ([http://www.nist.gov/dads/HTML/polyhedron.html DADS])
# [[polyhedron]] ([http://www.nist.gov/dads/HTML/polyhedron.html DADS])
# [[polylogarithmic]] ([http://www.nist.gov/dads/HTML/polylogarith.html DADS])
# [[polynomial]] ([http://www.nist.gov/dads/HTML/polynomial.html DADS])
# [[polynomial approximation scheme]] ([http://www.nist.gov/dads/HTML/polynomaprox.html DADS])
# [[polynomial hierarchy]] ([http://www.nist.gov/dads/HTML/polynomhier.html DADS])
# [[polynomial time]] ([http://www.nist.gov/dads/HTML/polynomialtm.html DADS])
# [[polynomial-time algorithm]] ([http://www.nist.gov/dads/HTML/polynomialtimeAlgorithm.html DADS])
# [[polynomial-time approximation scheme]] ([http://www.nist.gov/dads/HTML/polynomialtimeApproximationScheme.html DADS])
# [[polynomial-time Church-Turing thesis]] ([http://www.nist.gov/dads/HTML/polynomChurchTur.html DADS])
# [[polynomial-time Church-Turing thesis]] ([http://www.nist.gov/dads/HTML/polynomChurchTur.html DADS])
# [[polynomial-time reduction]] ([http://www.nist.gov/dads/HTML/polynomtredc.html DADS])
# [[polyphase merge]] ([http://www.nist.gov/dads/HTML/polyphmerge.html DADS])
# [[polyphase merge]] ([http://www.nist.gov/dads/HTML/polyphmerge.html DADS])
# [[polyphase merge sort]] ([http://www.nist.gov/dads/HTML/polyphmrgsrt.html DADS])
# [[polyphase merge sort]] ([http://www.nist.gov/dads/HTML/polyphmrgsrt.html DADS])
# [[polytope]] ([http://www.nist.gov/dads/HTML/polytope.html DADS])
# [[polytope]] ([http://www.nist.gov/dads/HTML/polytope.html DADS])
# [[poset]] ([http://www.nist.gov/dads/HTML/poset.html DADS])
# [[postfix traversal]] ([http://www.nist.gov/dads/HTML/postfixTraversal.html DADS])
# [[Post machine]] ([http://www.nist.gov/dads/HTML/postMachine.html DADS])
# [[postman sort]] ([http://www.nist.gov/dads/HTML/postmanSort.html DADS])
# [[postman sort]] ([http://www.nist.gov/dads/HTML/postmanSort.html DADS])
# [[postman's sort]] ([http://www.nist.gov/dads/HTML/postmansort.html DADS])
# [[postman's sort]] ([http://www.nist.gov/dads/HTML/postmansort.html DADS])
# [[postorder traversal]] ([http://www.nist.gov/dads/HTML/postorderTraversal.html DADS])
# [[Post's correspondence problem]] ([http://www.nist.gov/dads/HTML/postsCorrespondProb.html DADS])
# [[Post's correspondence problem]] ([http://www.nist.gov/dads/HTML/postsCorrespondProb.html DADS])
# [[potential function]] ([http://www.nist.gov/dads/HTML/potentialfnc.html DADS])
# [[PRAM]] ([http://www.nist.gov/dads/HTML/pram.html DADS])
# [[predicate]] ([http://www.nist.gov/dads/HTML/predicate.html DADS])
# [[predicate]] ([http://www.nist.gov/dads/HTML/predicate.html DADS])
# [[prefix]] ([http://www.nist.gov/dads/HTML/prefix.html DADS])
# [[prefix]] ([http://www.nist.gov/dads/HTML/prefix.html DADS])
Line 951: Line 571:
# [[prefix sums]] ([http://www.nist.gov/dads/HTML/prefixSums.html DADS])
# [[prefix sums]] ([http://www.nist.gov/dads/HTML/prefixSums.html DADS])
# [[prefix traversal]] ([http://www.nist.gov/dads/HTML/prefixTraversal.html DADS])
# [[prefix traversal]] ([http://www.nist.gov/dads/HTML/prefixTraversal.html DADS])
# [[preorder traversal]] ([http://www.nist.gov/dads/HTML/preorderTraversal.html DADS])
# [[primary clustering]] ([http://www.nist.gov/dads/HTML/primaryClustering.html DADS])
# [[primitive recursive]] ([http://www.nist.gov/dads/HTML/primitivrecr.html DADS])
# [[Prim-Jarn&iacute;k]] ([http://www.nist.gov/dads/HTML/PrimJarniacutek.html DADS])
# [[Prim-Jarnik algorithm]] ([http://www.nist.gov/dads/HTML/primJarnik.html DADS])
# [[Prim's algorithm]] ([http://www.nist.gov/dads/HTML/PrimsAlgorithm.html DADS])
# [[principle of optimality]] ([http://www.nist.gov/dads/HTML/principle.html DADS])
# [[priority queue]] ([http://www.nist.gov/dads/HTML/priorityque.html DADS])
# [[priority queue ordering]] ([http://www.nist.gov/dads/HTML/priorityQueueOrdering.html DADS])
# [[priority queue ordering]] ([http://www.nist.gov/dads/HTML/priorityQueueOrdering.html DADS])
# [[prisoner's dilemma]] ([http://www.nist.gov/dads/HTML/prisonersDilemma.html DADS])
# [[PRNG]] ([http://www.nist.gov/dads/HTML/prng.html DADS])
# [[probabilistic algorithm]] ([http://www.nist.gov/dads/HTML/probablAlgo.html DADS])
# [[probabilistically checkable proof]] ([http://www.nist.gov/dads/HTML/probabilisticallyCheckableProof.html DADS])
# [[probabilistic Turing machine]] ([http://www.nist.gov/dads/HTML/probablturng.html DADS])
# [[probe sequence]] ([http://www.nist.gov/dads/HTML/probesequenc.html DADS])
# [[probe sequence]] ([http://www.nist.gov/dads/HTML/probesequenc.html DADS])
# [[procedure]] ([http://www.nist.gov/dads/HTML/procedure.html DADS])
# [[procedure]] ([http://www.nist.gov/dads/HTML/procedure.html DADS])
# [[process algebra]] ([http://www.nist.gov/dads/HTML/processalgbr.html DADS])
# [[proper]] ([http://www.nist.gov/dads/HTML/proper.html DADS])
# [[proper]] ([http://www.nist.gov/dads/HTML/proper.html DADS])
# [[proper binary tree]] ([http://www.nist.gov/dads/HTML/properBinaryTree.html DADS])
# [[proper binary tree]] ([http://www.nist.gov/dads/HTML/properBinaryTree.html DADS])
# [[proper coloring]] ([http://www.nist.gov/dads/HTML/propercolor.html DADS])
# [[proper coloring]] ([http://www.nist.gov/dads/HTML/propercolor.html DADS])
# [[proper subset]] ([http://www.nist.gov/dads/HTML/propersubset.html DADS])
# [[property list]] ([http://www.nist.gov/dads/HTML/propertyList.html DADS])
# [[property list]] ([http://www.nist.gov/dads/HTML/propertyList.html DADS])
# [[prop list]] ([http://www.nist.gov/dads/HTML/propList.html DADS])
# [[prop list]] ([http://www.nist.gov/dads/HTML/propList.html DADS])
# [[prune and search]] ([http://www.nist.gov/dads/HTML/pruneNsearch.html DADS])
# [[prune and search]] ([http://www.nist.gov/dads/HTML/pruneNsearch.html DADS])
# [[pseudorandom number]] ([http://www.nist.gov/dads/HTML/pseudorandomNumber.html DADS])
# [[pseudo-random number generator]] ([http://www.nist.gov/dads/HTML/pseudorandomNumberGen.html DADS])
# [[PTAS]] ([http://www.nist.gov/dads/HTML/ptas.html DADS])
# [[pth order Fibonacci numbers]] ([http://www.nist.gov/dads/HTML/pthOrderFibonacciNumbers.html DADS])
# [[pth order Fibonacci numbers]] ([http://www.nist.gov/dads/HTML/pthOrderFibonacciNumbers.html DADS])
# [[P-tree]] ([http://www.nist.gov/dads/HTML/ptree.html DADS])
# [[P-tree]] ([http://www.nist.gov/dads/HTML/ptree.html DADS])
# [[purely functional language]] ([http://www.nist.gov/dads/HTML/purelyfnctnl.html DADS])
# [[purely functional language]] ([http://www.nist.gov/dads/HTML/purelyfnctnl.html DADS])
# [[pushdown]] ([http://www.nist.gov/dads/HTML/pushdown.html DADS])
# [[pushdown]] ([http://www.nist.gov/dads/HTML/pushdown.html DADS])
# [[pushdown automaton]] ([http://www.nist.gov/dads/HTML/pushdownautm.html DADS])
# [[push-down store]] ([http://www.nist.gov/dads/HTML/pushdownStore.html DADS])
# [[push-down store]] ([http://www.nist.gov/dads/HTML/pushdownStore.html DADS])
# [[pushdown transducer]] ([http://www.nist.gov/dads/HTML/pushdownTransducer.html DADS])
# [[pushdown transducer]] ([http://www.nist.gov/dads/HTML/pushdownTransducer.html DADS])
Line 990: Line 591:
# [[qmsort]] ([http://www.nist.gov/dads/HTML/qmsortI.html DADS])
# [[qmsort]] ([http://www.nist.gov/dads/HTML/qmsortI.html DADS])
# [[qm sort]] ([http://www.nist.gov/dads/HTML/qmsort.html DADS])
# [[qm sort]] ([http://www.nist.gov/dads/HTML/qmsort.html DADS])
# [[quadratic hashing]] ([http://www.nist.gov/dads/HTML/quadraticHashing.html DADS])
# [[quadratic probing]] ([http://www.nist.gov/dads/HTML/quadraticprb.html DADS])
# [[quadtree]] ([http://www.nist.gov/dads/HTML/quadtree.html DADS])
# [[quadtree complexity theorem]] ([http://www.nist.gov/dads/HTML/quadtreecplx.html DADS])
# [[quadtree complexity theorem]] ([http://www.nist.gov/dads/HTML/quadtreecplx.html DADS])
# [[quad trie]] ([http://www.nist.gov/dads/HTML/quadtrie.html DADS])
# [[quad trie]] ([http://www.nist.gov/dads/HTML/quadtrie.html DADS])
# [[quantum computation]] ([http://www.nist.gov/dads/HTML/quantumComputation.html DADS])
# [[queue]] ([http://www.nist.gov/dads/HTML/queue.html DADS])
# [[quick search]] ([http://www.nist.gov/dads/HTML/quicksearch.html DADS])
# [[quick search]] ([http://www.nist.gov/dads/HTML/quicksearch.html DADS])
# [[quickselect]] ([http://www.nist.gov/dads/HTML/quickselect.html DADS])
# [[quickselect]] ([http://www.nist.gov/dads/HTML/quickselect.html DADS])
# [[quick select]] ([http://www.nist.gov/dads/HTML/quickSelect.html DADS])
# [[quick select]] ([http://www.nist.gov/dads/HTML/quickSelect.html DADS])
# [[quick sort]] ([http://www.nist.gov/dads/HTML/quickSort.html DADS])
# [[quicksort]] ([http://www.nist.gov/dads/HTML/quicksort.html DADS])


===R===
===R===
# [[Rabin-Karp]] ([http://www.nist.gov/dads/HTML/RabinKarp.html DADS])
# [[radix quicksort]] ([http://www.nist.gov/dads/HTML/radixQuicksort.html DADS])
# [[radix quicksort]] ([http://www.nist.gov/dads/HTML/radixQuicksort.html DADS])
# [[radix sort]] ([http://www.nist.gov/dads/HTML/radixsort.html DADS])
# [[radix tree]] ([http://www.nist.gov/dads/HTML/radixTree.html DADS])
# [[ragged matrix]] ([http://www.nist.gov/dads/HTML/raggedmatrix.html DADS])
# [[Raita]] ([http://www.nist.gov/dads/HTML/raita.html DADS])
# [[Raita]] ([http://www.nist.gov/dads/HTML/raita.html DADS])
# [[random access machine]] ([http://www.nist.gov/dads/HTML/randomaccess.html DADS])
# [[randomization]] ([http://www.nist.gov/dads/HTML/randomizatn.html DADS])
# [[randomized algorithm]] ([http://www.nist.gov/dads/HTML/randomizedAlgo.html DADS])
# [[randomized binary search tree]] ([http://www.nist.gov/dads/HTML/randomizedBinarySearchTree.html DADS])
# [[randomized complexity]] ([http://www.nist.gov/dads/HTML/randomizedComplexity.html DADS])
# [[randomized complexity]] ([http://www.nist.gov/dads/HTML/randomizedComplexity.html DADS])
# [[randomized polynomial time]] ([http://www.nist.gov/dads/HTML/randomizedPolynomialTime.html DADS])
# [[randomized rounding]] ([http://www.nist.gov/dads/HTML/randomizdrnd.html DADS])
# [[randomized rounding]] ([http://www.nist.gov/dads/HTML/randomizdrnd.html DADS])
# [[randomized search tree]] ([http://www.nist.gov/dads/HTML/randomizedSearchTree.html DADS])
# [[randomized search tree]] ([http://www.nist.gov/dads/HTML/randomizedSearchTree.html DADS])
# [[Randomized-Select]] ([http://www.nist.gov/dads/HTML/randomzdSlct.html DADS])
# [[Randomized-Select]] ([http://www.nist.gov/dads/HTML/randomzdSlct.html DADS])
# [[random number generator]] ([http://www.nist.gov/dads/HTML/randomnumgen.html DADS])
# [[random sampling]] ([http://www.nist.gov/dads/HTML/randomsampl.html DADS])
# [[range]] ([http://www.nist.gov/dads/HTML/range.html DADS])
# [[range sort]] ([http://www.nist.gov/dads/HTML/rangesort.html DADS])
# [[range sort]] ([http://www.nist.gov/dads/HTML/rangesort.html DADS])
# [[rank]] ([http://www.nist.gov/dads/HTML/rank.html DADS])
# [[rank]] ([http://www.nist.gov/dads/HTML/rank.html DADS])
# [[Ratcliff/Obershelp pattern recognition]] ([http://www.nist.gov/dads/HTML/ratcliffObershelp.html DADS])
# [[Ratcliff/Obershelp pattern recognition]] ([http://www.nist.gov/dads/HTML/ratcliffObershelp.html DADS])
# [[RBST]] ([http://www.nist.gov/dads/HTML/rbst.html DADS])
# [[reachable]] ([http://www.nist.gov/dads/HTML/reachable.html DADS])
# [[reachable]] ([http://www.nist.gov/dads/HTML/reachable.html DADS])
# [[rebalance]] ([http://www.nist.gov/dads/HTML/rebalance.html DADS])
# [[rebalance]] ([http://www.nist.gov/dads/HTML/rebalance.html DADS])
Line 1,034: Line 615:
# [[rectilinear Steiner tree]] ([http://www.nist.gov/dads/HTML/rectilstntre.html DADS])
# [[rectilinear Steiner tree]] ([http://www.nist.gov/dads/HTML/rectilstntre.html DADS])
# [[recurrence equations]] ([http://www.nist.gov/dads/HTML/recurrenceEquations.html DADS])
# [[recurrence equations]] ([http://www.nist.gov/dads/HTML/recurrenceEquations.html DADS])
# [[recurrence relation]] ([http://www.nist.gov/dads/HTML/recurrence.html DADS])
# [[recurrences]] ([http://www.nist.gov/dads/HTML/recurrences.html DADS])
# [[recursion]] ([http://www.nist.gov/dads/HTML/recursion.html DADS])
# [[recursion termination]] ([http://www.nist.gov/dads/HTML/recursiontrm.html DADS])
# [[recursion termination]] ([http://www.nist.gov/dads/HTML/recursiontrm.html DADS])
# [[recursion tree]] ([http://www.nist.gov/dads/HTML/recursionTree.html DADS])
# [[recursion tree]] ([http://www.nist.gov/dads/HTML/recursionTree.html DADS])
Line 1,042: Line 620:
# [[recursive data structure]] ([http://www.nist.gov/dads/HTML/recursivstrc.html DADS])
# [[recursive data structure]] ([http://www.nist.gov/dads/HTML/recursivstrc.html DADS])
# [[recursive doubling]] ([http://www.nist.gov/dads/HTML/recursiveDoubling.html DADS])
# [[recursive doubling]] ([http://www.nist.gov/dads/HTML/recursiveDoubling.html DADS])
# [[recursive language]] ([http://www.nist.gov/dads/HTML/recursiveLanguage.html DADS])
# [[recursively enumerable language]] ([http://www.nist.gov/dads/HTML/recursivelyEnumerableLang.html DADS])
# [[recursively solvable]] ([http://www.nist.gov/dads/HTML/recursivelySolvable.html DADS])
# [[recursively solvable]] ([http://www.nist.gov/dads/HTML/recursivelySolvable.html DADS])
# [[red-black tree]] ([http://www.nist.gov/dads/HTML/redblack.html DADS])
# [[reduced basis]] ([http://www.nist.gov/dads/HTML/reducedbasis.html DADS])
# [[reduced basis]] ([http://www.nist.gov/dads/HTML/reducedbasis.html DADS])
# [[reduced digraph]] ([http://www.nist.gov/dads/HTML/reducedDigraph.html DADS])
# [[reduced digraph]] ([http://www.nist.gov/dads/HTML/reducedDigraph.html DADS])
# [[reduced ordered binary decision diagram]] ([http://www.nist.gov/dads/HTML/reducedOrderedBDD.html DADS])
# [[reduced ordered binary decision diagram]] ([http://www.nist.gov/dads/HTML/reducedOrderedBDD.html DADS])
# [[reduction]] ([http://www.nist.gov/dads/HTML/reduction.html DADS])
# [[reflexive]] ([http://www.nist.gov/dads/HTML/reflexive.html DADS])
# [[reflexive]] ([http://www.nist.gov/dads/HTML/reflexive.html DADS])
# [[regular decomposition]] ([http://www.nist.gov/dads/HTML/regular.html DADS])
# [[regular decomposition]] ([http://www.nist.gov/dads/HTML/regular.html DADS])
# [[rehashing]] ([http://www.nist.gov/dads/HTML/rehashing.html DADS])
# [[rehashing]] ([http://www.nist.gov/dads/HTML/rehashing.html DADS])
# [[r.e. language]] ([http://www.nist.gov/dads/HTML/reLanguage.html DADS])
# [[relation]] ([http://www.nist.gov/dads/HTML/relation.html DADS])
# [[relation]] ([http://www.nist.gov/dads/HTML/relation.html DADS])
# [[relational structure]] ([http://www.nist.gov/dads/HTML/relational.html DADS])
# [[relational structure]] ([http://www.nist.gov/dads/HTML/relational.html DADS])
Line 1,071: Line 644:
# [[right single rotation]] ([http://www.nist.gov/dads/HTML/rightSingleRotation.html DADS])
# [[right single rotation]] ([http://www.nist.gov/dads/HTML/rightSingleRotation.html DADS])
# [[right-threaded tree]] ([http://www.nist.gov/dads/HTML/rightThreadedTree.html DADS])
# [[right-threaded tree]] ([http://www.nist.gov/dads/HTML/rightThreadedTree.html DADS])
# [[RNG]] ([http://www.nist.gov/dads/HTML/rng.html DADS])
# [[ROBDD]] ([http://www.nist.gov/dads/HTML/robdd.html DADS])
# [[ROBDD]] ([http://www.nist.gov/dads/HTML/robdd.html DADS])
# [[root]] ([http://www.nist.gov/dads/HTML/root.html DADS])
# [[root balance]] ([http://www.nist.gov/dads/HTML/rootBalance.html DADS])
# [[root balance]] ([http://www.nist.gov/dads/HTML/rootBalance.html DADS])
# [[rooted tree]] ([http://www.nist.gov/dads/HTML/rootedtree.html DADS])
# [[rotate left]] ([http://www.nist.gov/dads/HTML/rotateLeft.html DADS])
# [[rotate left]] ([http://www.nist.gov/dads/HTML/rotateLeft.html DADS])
# [[rotate right]] ([http://www.nist.gov/dads/HTML/rotateRight.html DADS])
# [[rotate right]] ([http://www.nist.gov/dads/HTML/rotateRight.html DADS])
# [[rotation]] ([http://www.nist.gov/dads/HTML/rotation.html DADS])
# [[rotation]] ([http://www.nist.gov/dads/HTML/rotation.html DADS])
# [[rough graph]] ([http://www.nist.gov/dads/HTML/roughgraph.html DADS])
# [[rough graph]] ([http://www.nist.gov/dads/HTML/roughgraph.html DADS])
# [[RP (complexity)|RP]] ([http://www.nist.gov/dads/HTML/rp.html DADS])
# [[R+-tree]] ([http://www.nist.gov/dads/HTML/rplustree.html DADS])
# [[R+-tree]] ([http://www.nist.gov/dads/HTML/rplustree.html DADS])
# [[R*-tree]] ([http://www.nist.gov/dads/HTML/rstartree.html DADS])
# [[R*-tree]] ([http://www.nist.gov/dads/HTML/rstartree.html DADS])

# [[R-tree]] ([http://www.nist.gov/dads/HTML/rtree.html DADS])
# [[run time]] ([http://www.nist.gov/dads/HTML/runtime.html DADS])
===S===
===S===
# [[saguaro stack]] ([http://www.nist.gov/dads/HTML/saguaroStack.html DADS])
# [[saguaro stack]] ([http://www.nist.gov/dads/HTML/saguaroStack.html DADS])
Line 1,091: Line 659:
# [[SBB tree]] ([http://www.nist.gov/dads/HTML/sbbtree.html DADS])
# [[SBB tree]] ([http://www.nist.gov/dads/HTML/sbbtree.html DADS])
# [[scan]] ([http://www.nist.gov/dads/HTML/scan.html DADS])
# [[scan]] ([http://www.nist.gov/dads/HTML/scan.html DADS])
# [[scapegoat tree]] ([http://www.nist.gov/dads/HTML/scapegoatTree.html DADS])
# [[scatter storage]] ([http://www.nist.gov/dads/HTML/scatterStorage.html DADS])
# [[scatter storage]] ([http://www.nist.gov/dads/HTML/scatterStorage.html DADS])
# [[search]] ([http://www.nist.gov/dads/HTML/search.html DADS])
# [[search]] ([http://www.nist.gov/dads/HTML/search.html DADS])
Line 1,101: Line 668:
# [[Select]] ([http://www.nist.gov/dads/HTML/select.html DADS])
# [[Select]] ([http://www.nist.gov/dads/HTML/select.html DADS])
# [[select and partition]] ([http://www.nist.gov/dads/HTML/selectAndPartition.html DADS])
# [[select and partition]] ([http://www.nist.gov/dads/HTML/selectAndPartition.html DADS])
# [[selection problem]] ([http://www.nist.gov/dads/HTML/selectionProblem.html DADS])
# [[selection sort]] ([http://www.nist.gov/dads/HTML/selectionsrt.html DADS])
# [[select kth element]] ([http://www.nist.gov/dads/HTML/selectkth.html DADS])
# [[select kth element]] ([http://www.nist.gov/dads/HTML/selectkth.html DADS])
# [[select mode]] ([http://www.nist.gov/dads/HTML/selectmode.html DADS])
# [[select mode]] ([http://www.nist.gov/dads/HTML/selectmode.html DADS])
Line 1,114: Line 679:
# [[separate chaining]] ([http://www.nist.gov/dads/HTML/separatchain.html DADS])
# [[separate chaining]] ([http://www.nist.gov/dads/HTML/separatchain.html DADS])
# [[separation theorem]] ([http://www.nist.gov/dads/HTML/separatnthrm.html DADS])
# [[separation theorem]] ([http://www.nist.gov/dads/HTML/separatnthrm.html DADS])
# [[sequential search]] ([http://www.nist.gov/dads/HTML/sequentialSearch.html DADS])
# [[set]] ([http://www.nist.gov/dads/HTML/set.html DADS])
# [[set complement]] ([http://www.nist.gov/dads/HTML/setComplement.html DADS])
# [[set cover]] ([http://www.nist.gov/dads/HTML/setcover.html DADS])
# [[set covering problem]] ([http://www.nist.gov/dads/HTML/setCoveringProblem.html DADS])
# [[set difference]] ([http://www.nist.gov/dads/HTML/setDifference.html DADS])
# [[set intersection]] ([http://www.nist.gov/dads/HTML/setIntersection.html DADS])
# [[set packing]] ([http://www.nist.gov/dads/HTML/setpacking.html DADS])
# [[set union]] ([http://www.nist.gov/dads/HTML/setUnion.html DADS])
# [[shadow heap]] ([http://www.nist.gov/dads/HTML/shadowheap.html DADS])
# [[shadow heap]] ([http://www.nist.gov/dads/HTML/shadowheap.html DADS])
# [[shadow merge]] ([http://www.nist.gov/dads/HTML/shadowmerge.html DADS])
# [[shadow merge]] ([http://www.nist.gov/dads/HTML/shadowmerge.html DADS])
# [[shadow merge insert]] ([http://www.nist.gov/dads/HTML/shadowmrgins.html DADS])
# [[shadow merge insert]] ([http://www.nist.gov/dads/HTML/shadowmrgins.html DADS])
# [[shaker sort]] ([http://www.nist.gov/dads/HTML/shakerSort.html DADS])
# [[Shannon-Fano coding]] ([http://www.nist.gov/dads/HTML/shannonFano.html DADS])
# [[shared memory]] ([http://www.nist.gov/dads/HTML/sharedmemory.html DADS])
# [[Shell-Metzner sort]] ([http://www.nist.gov/dads/HTML/ShellMetznerSort.html DADS])
# [[shellsort]] ([http://www.nist.gov/dads/HTML/shellsortI.html DADS])
# [[Shell sort]] ([http://www.nist.gov/dads/HTML/shellsort.html DADS])
# [[Shift-Or]] ([http://www.nist.gov/dads/HTML/shiftOr.html DADS])
# [[Shift-Or]] ([http://www.nist.gov/dads/HTML/shiftOr.html DADS])
# [[Shor's algorithm]] ([http://www.nist.gov/dads/HTML/shorsAlgo.html DADS])
# [[shortcutting]] ([http://www.nist.gov/dads/HTML/shortcutting.html DADS])
# [[shortcutting]] ([http://www.nist.gov/dads/HTML/shortcutting.html DADS])
# [[short cutting]] ([http://www.nist.gov/dads/HTML/shortCutting.html DADS])
# [[short cutting]] ([http://www.nist.gov/dads/HTML/shortCutting.html DADS])
# [[shortest common supersequence]] ([http://www.nist.gov/dads/HTML/shortestCommonSuperseq.html DADS])
# [[shortest common superstring]] ([http://www.nist.gov/dads/HTML/shortestCommonSuperstring.html DADS])
# [[shortest common superstring]] ([http://www.nist.gov/dads/HTML/shortestCommonSuperstring.html DADS])
# [[shortest path]] ([http://www.nist.gov/dads/HTML/shortestpath.html DADS])
# [[shortest spanning tree]] ([http://www.nist.gov/dads/HTML/shortestSpanningTree.html DADS])
# [[shuffle]] ([http://www.nist.gov/dads/HTML/shuffle.html DADS])
# [[shuffle]] ([http://www.nist.gov/dads/HTML/shuffle.html DADS])
# [[shuffle sort]] ([http://www.nist.gov/dads/HTML/shuffleSort.html DADS])
# [[shuffle sort]] ([http://www.nist.gov/dads/HTML/shuffleSort.html DADS])
# [[shuttle sort]] ([http://www.nist.gov/dads/HTML/shuttleSort.html DADS])
# [[sibling]] ([http://www.nist.gov/dads/HTML/sibling.html DADS])
# [[sibling]] ([http://www.nist.gov/dads/HTML/sibling.html DADS])
# [[sieve of Eratosthenes]] ([http://www.nist.gov/dads/HTML/sieve.html DADS])
# [[sift up]] ([http://www.nist.gov/dads/HTML/siftup.html DADS])
# [[sift up]] ([http://www.nist.gov/dads/HTML/siftup.html DADS])
# [[signature]] ([http://www.nist.gov/dads/HTML/signature.html DADS])
# [[signature]] ([http://www.nist.gov/dads/HTML/signature.html DADS])
Line 1,150: Line 694:
# [[Simon's algorithm]] ([http://www.nist.gov/dads/HTML/simonsAlgo.html DADS])
# [[Simon's algorithm]] ([http://www.nist.gov/dads/HTML/simonsAlgo.html DADS])
# [[simple merge]] ([http://www.nist.gov/dads/HTML/simplemerge.html DADS])
# [[simple merge]] ([http://www.nist.gov/dads/HTML/simplemerge.html DADS])
# [[simple path]] ([http://www.nist.gov/dads/HTML/simplepath.html DADS])
# [[simple uniform hashing]] ([http://www.nist.gov/dads/HTML/simpleUniformHashing.html DADS])
# [[simple uniform hashing]] ([http://www.nist.gov/dads/HTML/simpleUniformHashing.html DADS])
# [[simplex]] ([http://www.nist.gov/dads/HTML/simplex.html DADS])
# [[simplex]] ([http://www.nist.gov/dads/HTML/simplex.html DADS])
# [[simulated annealing]] ([http://www.nist.gov/dads/HTML/simulatedAnnealing.html DADS])
# [[simulation theorem]] ([http://www.nist.gov/dads/HTML/simulatnthrm.html DADS])
# [[simulation theorem]] ([http://www.nist.gov/dads/HTML/simulatnthrm.html DADS])
# [[single-destination shortest-path problem]] ([http://www.nist.gov/dads/HTML/singleDestShortestPath.html DADS])
# [[single-destination shortest-path problem]] ([http://www.nist.gov/dads/HTML/singleDestShortestPath.html DADS])
Line 1,159: Line 701:
# [[single program multiple data]] ([http://www.nist.gov/dads/HTML/singleprogrm.html DADS])
# [[single program multiple data]] ([http://www.nist.gov/dads/HTML/singleprogrm.html DADS])
# [[single-source shortest-path problem]] ([http://www.nist.gov/dads/HTML/singleSourceShortestPath.html DADS])
# [[single-source shortest-path problem]] ([http://www.nist.gov/dads/HTML/singleSourceShortestPath.html DADS])
# [[singly linked list]] ([http://www.nist.gov/dads/HTML/singlyLinkedList.html DADS])
# [[singularity analysis]] ([http://www.nist.gov/dads/HTML/singularity.html DADS])
# [[singularity analysis]] ([http://www.nist.gov/dads/HTML/singularity.html DADS])
# [[sink]] ([http://www.nist.gov/dads/HTML/sink.html DADS])
# [[sink]] ([http://www.nist.gov/dads/HTML/sink.html DADS])
Line 1,165: Line 706:
# [[sink sort]] ([http://www.nist.gov/dads/HTML/sinkSort.html DADS])
# [[sink sort]] ([http://www.nist.gov/dads/HTML/sinkSort.html DADS])
# [[skd-tree]] ([http://www.nist.gov/dads/HTML/skdtree.html DADS])
# [[skd-tree]] ([http://www.nist.gov/dads/HTML/skdtree.html DADS])
# [[skew symmetry]] ([http://www.nist.gov/dads/HTML/skewsymmetry.html DADS])
# [[skiplist]] ([http://www.nist.gov/dads/HTML/skiplistI.html DADS])
# [[skip list]] ([http://www.nist.gov/dads/HTML/skiplist.html DADS])
# [[skip search]] ([http://www.nist.gov/dads/HTML/skipSearch.html DADS])
# [[skip search]] ([http://www.nist.gov/dads/HTML/skipSearch.html DADS])
# [[slope selection]] ([http://www.nist.gov/dads/HTML/slopeselectn.html DADS])
# [[slope selection]] ([http://www.nist.gov/dads/HTML/slopeselectn.html DADS])
# [[Smith algorithm]] ([http://www.nist.gov/dads/HTML/smithAlgorithm.html DADS])
# [[Smith algorithm]] ([http://www.nist.gov/dads/HTML/smithAlgorithm.html DADS])
# [[Smith-Waterman algorithm]] ([http://www.nist.gov/dads/HTML/smithWaterman.html DADS])
# [[smoothsort]] ([http://www.nist.gov/dads/HTML/smoothsort.html DADS])
# [[solvable]] ([http://www.nist.gov/dads/HTML/solvable.html DADS])
# [[solvable]] ([http://www.nist.gov/dads/HTML/solvable.html DADS])
# [[sort]] ([http://www.nist.gov/dads/HTML/sort.html DADS])
# [[sorted array]] ([http://www.nist.gov/dads/HTML/sortedarray.html DADS])
# [[sorted array]] ([http://www.nist.gov/dads/HTML/sortedarray.html DADS])
# [[sorted list]] ([http://www.nist.gov/dads/HTML/sortedlist.html DADS])
# [[sorted list]] ([http://www.nist.gov/dads/HTML/sortedlist.html DADS])
# [[sorting algorithm]] ([http://www.nist.gov/dads/HTML/sortingAlgorithm.html DADS])
# [[sort in place]] ([http://www.nist.gov/dads/HTML/sortInPlace.html DADS])
# [[sort in-place]] ([http://www.nist.gov/dads/HTML/sortInplace.html DADS])
# [[soundex]] ([http://www.nist.gov/dads/HTML/soundex.html DADS])
# [[source]] ([http://www.nist.gov/dads/HTML/source.html DADS])
# [[source]] ([http://www.nist.gov/dads/HTML/source.html DADS])
# [[source-target directed acyclic graph]] ([http://www.nist.gov/dads/HTML/sourcetargetDirectedAcyclicGraph.html DADS])
# [[source-target directed acyclic graph]] ([http://www.nist.gov/dads/HTML/sourcetargetDirectedAcyclicGraph.html DADS])
# [[space-constructible function]] ([http://www.nist.gov/dads/HTML/space.html DADS])
# [[space-constructible function]] ([http://www.nist.gov/dads/HTML/space.html DADS])
# [[spanning tree]] ([http://www.nist.gov/dads/HTML/spanningtree.html DADS])
# [[sparse array]] ([http://www.nist.gov/dads/HTML/sparseArray.html DADS])
# [[sparse graph]] ([http://www.nist.gov/dads/HTML/sparsegraph.html DADS])
# [[sparse matrix]] ([http://www.nist.gov/dads/HTML/sparsematrix.html DADS])
# [[sparsification]] ([http://www.nist.gov/dads/HTML/sparsificatn.html DADS])
# [[sparsification]] ([http://www.nist.gov/dads/HTML/sparsificatn.html DADS])
# [[sparsity]] ([http://www.nist.gov/dads/HTML/sparsity.html DADS])
# [[spatial access method]] ([http://www.nist.gov/dads/HTML/spatialAccessMethod.html DADS])
# [[spatial access method]] ([http://www.nist.gov/dads/HTML/spatialAccessMethod.html DADS])
# [[spiral storage]] ([http://www.nist.gov/dads/HTML/spiralStorage.html DADS])
# [[spiral storage]] ([http://www.nist.gov/dads/HTML/spiralStorage.html DADS])
# [[splaying]] ([http://www.nist.gov/dads/HTML/splaying.html DADS])
# [[splay tree]] ([http://www.nist.gov/dads/HTML/splaytree.html DADS])
# [[SPMD]] ([http://www.nist.gov/dads/HTML/spmd.html DADS])
# [[SPMD]] ([http://www.nist.gov/dads/HTML/spmd.html DADS])
# [[square matrix]] ([http://www.nist.gov/dads/HTML/squarematrix.html DADS])
# [[square root]] ([http://www.nist.gov/dads/HTML/squareRoot.html DADS])
# [[SST]] ([http://www.nist.gov/dads/HTML/sst.html DADS])
# [[SST]] ([http://www.nist.gov/dads/HTML/sst.html DADS])
# [[stable]] ([http://www.nist.gov/dads/HTML/stable.html DADS])
# [[stable]] ([http://www.nist.gov/dads/HTML/stable.html DADS])
# [[stack]] ([http://www.nist.gov/dads/HTML/stack.html DADS])
# [[stack tree]] ([http://www.nist.gov/dads/HTML/stacktree.html DADS])
# [[stack tree]] ([http://www.nist.gov/dads/HTML/stacktree.html DADS])
# [[star-shaped polygon]] ([http://www.nist.gov/dads/HTML/starshaped.html DADS])
# [[star-shaped polygon]] ([http://www.nist.gov/dads/HTML/starshaped.html DADS])
# [[start state]] ([http://www.nist.gov/dads/HTML/startstate.html DADS])
# [[state]] ([http://www.nist.gov/dads/HTML/state.html DADS])
# [[state machine]] ([http://www.nist.gov/dads/HTML/statemachine.html DADS])
# [[state transition]] ([http://www.nist.gov/dads/HTML/stateTransition.html DADS])
# [[state transition]] ([http://www.nist.gov/dads/HTML/stateTransition.html DADS])
# [[static]] ([http://www.nist.gov/dads/HTML/static.html DADS])
# [[static]] ([http://www.nist.gov/dads/HTML/static.html DADS])
Line 1,211: Line 729:
# [[st-digraph]] ([http://www.nist.gov/dads/HTML/stdigraph.html DADS])
# [[st-digraph]] ([http://www.nist.gov/dads/HTML/stdigraph.html DADS])
# [[Steiner minimum tree]] ([http://www.nist.gov/dads/HTML/steinerMinimumTree.html DADS])
# [[Steiner minimum tree]] ([http://www.nist.gov/dads/HTML/steinerMinimumTree.html DADS])
# [[Steiner point]] ([http://www.nist.gov/dads/HTML/steinerpoint.html DADS])
# [[Steiner ratio]] ([http://www.nist.gov/dads/HTML/steinerratio.html DADS])
# [[Steiner ratio]] ([http://www.nist.gov/dads/HTML/steinerratio.html DADS])
# [[Steiner tree]] ([http://www.nist.gov/dads/HTML/steinertree.html DADS])
# [[Steiner vertex]] ([http://www.nist.gov/dads/HTML/steinervertx.html DADS])
# [[Steinhaus-Johnson-Trotter]] ([http://www.nist.gov/dads/HTML/SteinhausJohnsonTrotter.html DADS])
# [[Stirling's approximation]] ([http://www.nist.gov/dads/HTML/stirlingappx.html DADS])
# [[Stirling's formula]] ([http://www.nist.gov/dads/HTML/stirlingform.html DADS])
# [[stooge sort]] ([http://www.nist.gov/dads/HTML/stoogesort.html DADS])
# [[straight-line drawing]] ([http://www.nist.gov/dads/HTML/straightline.html DADS])
# [[straight-line drawing]] ([http://www.nist.gov/dads/HTML/straightline.html DADS])
# [[strand sort]] ([http://www.nist.gov/dads/HTML/strandSort.html DADS])
# [[strand sort]] ([http://www.nist.gov/dads/HTML/strandSort.html DADS])
# [[strictly decreasing]] ([http://www.nist.gov/dads/HTML/strictlyDecreasing.html DADS])
# [[strictly increasing]] ([http://www.nist.gov/dads/HTML/strictlyIncreasing.html DADS])
# [[strictly lower triangular matrix]] ([http://www.nist.gov/dads/HTML/strictlyLowerTriangMat.html DADS])
# [[strictly upper triangular matrix]] ([http://www.nist.gov/dads/HTML/strictlyUpperTriangMat.html DADS])
# [[string]] ([http://www.nist.gov/dads/HTML/string.html DADS])
# [[string editing problem]] ([http://www.nist.gov/dads/HTML/stringedit.html DADS])
# [[string editing problem]] ([http://www.nist.gov/dads/HTML/stringedit.html DADS])
# [[string matching]] ([http://www.nist.gov/dads/HTML/stringMatching.html DADS])
# [[string matching on ordered alphabets]] ([http://www.nist.gov/dads/HTML/stringMatchOrdAlphabet.html DADS])
# [[string matching on ordered alphabets]] ([http://www.nist.gov/dads/HTML/stringMatchOrdAlphabet.html DADS])
# [[string matching with errors]] ([http://www.nist.gov/dads/HTML/stringMatchwError.html DADS])
# [[string matching with errors]] ([http://www.nist.gov/dads/HTML/stringMatchwError.html DADS])
# [[string matching with mismatches]] ([http://www.nist.gov/dads/HTML/stringMatchwMismatch.html DADS])
# [[string matching with mismatches]] ([http://www.nist.gov/dads/HTML/stringMatchwMismatch.html DADS])
# [[string search]] ([http://www.nist.gov/dads/HTML/stringSearch.html DADS])
# [[string search]] ([http://www.nist.gov/dads/HTML/stringSearch.html DADS])
# [[string searching]] ([http://www.nist.gov/dads/HTML/stringSearching.html DADS])
# [[string similarity search]] ([http://www.nist.gov/dads/HTML/stringSimilaritySearch.html DADS])
# [[string similarity search]] ([http://www.nist.gov/dads/HTML/stringSimilaritySearch.html DADS])
# [[strip packing]] ([http://www.nist.gov/dads/HTML/strippacking.html DADS])
# [[strip packing]] ([http://www.nist.gov/dads/HTML/strippacking.html DADS])
# [[strongly connected component]] ([http://www.nist.gov/dads/HTML/stronglyConnectedCompo.html DADS])
# [[strongly connected graph]] ([http://www.nist.gov/dads/HTML/stronglyConnectedGraph.html DADS])
# [[strongly connected graph]] ([http://www.nist.gov/dads/HTML/stronglyConnectedGraph.html DADS])
# [[strongly NP-hard]] ([http://www.nist.gov/dads/HTML/stronglyNP.html DADS])
# [[strongly NP-hard]] ([http://www.nist.gov/dads/HTML/stronglyNP.html DADS])
# [[stupid sort]] ([http://www.nist.gov/dads/HTML/stupidSort.html DADS])
# [[subadditive ergodic theorem]] ([http://www.nist.gov/dads/HTML/subadditive.html DADS])
# [[subadditive ergodic theorem]] ([http://www.nist.gov/dads/HTML/subadditive.html DADS])
# [[subgraph]] ([http://www.nist.gov/dads/HTML/subgraph.html DADS])
# [[subgraph isomorphism]] ([http://www.nist.gov/dads/HTML/subgraphiso.html DADS])
# [[sublinear time algorithm]] ([http://www.nist.gov/dads/HTML/sublinearTimeAlgo.html DADS])
# [[sublinear time algorithm]] ([http://www.nist.gov/dads/HTML/sublinearTimeAlgo.html DADS])
# [[subsequence]] ([http://www.nist.gov/dads/HTML/subsequence.html DADS])
# [[subset]] ([http://www.nist.gov/dads/HTML/subset.html DADS])
# [[substring]] ([http://www.nist.gov/dads/HTML/substring.html DADS])
# [[subtree]] ([http://www.nist.gov/dads/HTML/subtree.html DADS])
# [[subword]] ([http://www.nist.gov/dads/HTML/subword.html DADS])
# [[subword]] ([http://www.nist.gov/dads/HTML/subword.html DADS])
# [[suffix]] ([http://www.nist.gov/dads/HTML/suffix.html DADS])
# [[suffix array]] ([http://www.nist.gov/dads/HTML/suffixarray.html DADS])
# [[suffix automaton]] ([http://www.nist.gov/dads/HTML/suffixautmtn.html DADS])
# [[suffix automaton]] ([http://www.nist.gov/dads/HTML/suffixautmtn.html DADS])
# [[suffix tree]] ([http://www.nist.gov/dads/HTML/suffixtree.html DADS])
# [[superimposed code]] ([http://www.nist.gov/dads/HTML/superimposedCode.html DADS])
# [[superimposed code]] ([http://www.nist.gov/dads/HTML/superimposedCode.html DADS])
# [[superset]] ([http://www.nist.gov/dads/HTML/superset.html DADS])
# [[supersink]] ([http://www.nist.gov/dads/HTML/supersink.html DADS])
# [[supersink]] ([http://www.nist.gov/dads/HTML/supersink.html DADS])
# [[supersource]] ([http://www.nist.gov/dads/HTML/supersource.html DADS])
# [[supersource]] ([http://www.nist.gov/dads/HTML/supersource.html DADS])
# [[symmetric]] ([http://www.nist.gov/dads/HTML/symmetric.html DADS])
# [[symmetric]] ([http://www.nist.gov/dads/HTML/symmetric.html DADS])
# [[symmetrically linked list]] ([http://www.nist.gov/dads/HTML/symmetricallyLinkedList.html DADS])
# [[symmetric binary B-tree]] ([http://www.nist.gov/dads/HTML/symmetricBinaryBtree.html DADS])
# [[symmetric binary B-tree]] ([http://www.nist.gov/dads/HTML/symmetricBinaryBtree.html DADS])
# [[symmetric set difference]] ([http://www.nist.gov/dads/HTML/symmetricSetDiff.html DADS])
# [[symmetry breaking]] ([http://www.nist.gov/dads/HTML/symmetrybrek.html DADS])
# [[symmetry breaking]] ([http://www.nist.gov/dads/HTML/symmetrybrek.html DADS])

===T===
===T===
# [[tail]] ([http://www.nist.gov/dads/HTML/tail.html DADS])
# [[tail]] ([http://www.nist.gov/dads/HTML/tail.html DADS])
# [[tail recursion]] ([http://www.nist.gov/dads/HTML/tailrecursn.html DADS])
# [[target]] ([http://www.nist.gov/dads/HTML/target.html DADS])
# [[target]] ([http://www.nist.gov/dads/HTML/target.html DADS])
# [[taxi cab metric]] ([http://www.nist.gov/dads/HTML/taxiCabMetric.html DADS])
# [[temporal logic]] ([http://www.nist.gov/dads/HTML/temporllogic.html DADS])
# [[terminal]] ([http://www.nist.gov/dads/HTML/terminal.html DADS])
# [[terminal]] ([http://www.nist.gov/dads/HTML/terminal.html DADS])
# [[terminal node]] ([http://www.nist.gov/dads/HTML/terminalNode.html DADS])
# [[terminal node]] ([http://www.nist.gov/dads/HTML/terminalNode.html DADS])
# [[ternary search tree]] ([http://www.nist.gov/dads/HTML/ternarySearchTree.html DADS])
# [[text]] ([http://www.nist.gov/dads/HTML/text.html DADS])
# [[text]] ([http://www.nist.gov/dads/HTML/text.html DADS])
# [[text match]] ([http://www.nist.gov/dads/HTML/textMatch.html DADS])
# [[text match]] ([http://www.nist.gov/dads/HTML/textMatch.html DADS])
# [[text searching]] ([http://www.nist.gov/dads/HTML/textSearching.html DADS])
# [[text searching]] ([http://www.nist.gov/dads/HTML/textSearching.html DADS])
# [[theta]] ([http://www.nist.gov/dads/HTML/thetaI.html DADS])
# [[threaded binary tree]] ([http://www.nist.gov/dads/HTML/threadedBinaryTree.html DADS])
# [[threaded binary tree]] ([http://www.nist.gov/dads/HTML/threadedBinaryTree.html DADS])
# [[threaded tree]] ([http://www.nist.gov/dads/HTML/threadedtree.html DADS])
# [[threaded tree]] ([http://www.nist.gov/dads/HTML/threadedtree.html DADS])
Line 1,279: Line 765:
# [[three-way merge sort]] ([http://www.nist.gov/dads/HTML/threewaymsrt.html DADS])
# [[three-way merge sort]] ([http://www.nist.gov/dads/HTML/threewaymsrt.html DADS])
# [[three-way radix quicksort]] ([http://www.nist.gov/dads/HTML/threeWayRadixQuicksort.html DADS])
# [[three-way radix quicksort]] ([http://www.nist.gov/dads/HTML/threeWayRadixQuicksort.html DADS])
# [[time-constructible function]] ([http://www.nist.gov/dads/HTML/time.html DADS])
# [[time/space complexity]] ([http://www.nist.gov/dads/HTML/timespace.html DADS])
# [[time/space complexity]] ([http://www.nist.gov/dads/HTML/timespace.html DADS])
# [[top-down radix sort]] ([http://www.nist.gov/dads/HTML/topdownRadixSort.html DADS])
# [[top-down radix sort]] ([http://www.nist.gov/dads/HTML/topdownRadixSort.html DADS])
# [[top-down tree automaton]] ([http://www.nist.gov/dads/HTML/topdwntrtmtn.html DADS])
# [[top-down tree automaton]] ([http://www.nist.gov/dads/HTML/topdwntrtmtn.html DADS])
# [[topological order]] ([http://www.nist.gov/dads/HTML/topologicalOrder.html DADS])
# [[topological sort]] ([http://www.nist.gov/dads/HTML/topologcsort.html DADS])
# [[topology tree]] ([http://www.nist.gov/dads/HTML/topologytree.html DADS])
# [[topology tree]] ([http://www.nist.gov/dads/HTML/topologytree.html DADS])
# [[top sort]] ([http://www.nist.gov/dads/HTML/topSort.html DADS])
# [[top sort]] ([http://www.nist.gov/dads/HTML/topSort.html DADS])
# [[total function]] ([http://www.nist.gov/dads/HTML/totalfunc.html DADS])
# [[totally decidable language]] ([http://www.nist.gov/dads/HTML/totallyDecidableLanguage.html DADS])
# [[totally decidable language]] ([http://www.nist.gov/dads/HTML/totallyDecidableLanguage.html DADS])
# [[totally decidable problem]] ([http://www.nist.gov/dads/HTML/totallyDecidableProblem.html DADS])
# [[totally decidable problem]] ([http://www.nist.gov/dads/HTML/totallyDecidableProblem.html DADS])
# [[totally undecidable problem]] ([http://www.nist.gov/dads/HTML/totallyUndecidableProb.html DADS])
# [[totally undecidable problem]] ([http://www.nist.gov/dads/HTML/totallyUndecidableProb.html DADS])
# [[total order]] ([http://www.nist.gov/dads/HTML/totalorder.html DADS])
# [[tour]] ([http://www.nist.gov/dads/HTML/tour.html DADS])
# [[tour]] ([http://www.nist.gov/dads/HTML/tour.html DADS])
# [[tournament]] ([http://www.nist.gov/dads/HTML/tournament.html DADS])
# [[tournament]] ([http://www.nist.gov/dads/HTML/tournament.html DADS])
# [[tournament sort]] ([http://www.nist.gov/dads/HTML/tournamentSort.html DADS])
# [[tournament sort]] ([http://www.nist.gov/dads/HTML/tournamentSort.html DADS])
# [[towers of Hanoi]] ([http://www.nist.gov/dads/HTML/towersOfHanoi.html DADS])
# [[tractable]] ([http://www.nist.gov/dads/HTML/tractable.html DADS])
# [[transition]] ([http://www.nist.gov/dads/HTML/transition.html DADS])
# [[transition]] ([http://www.nist.gov/dads/HTML/transition.html DADS])
# [[transition function]] ([http://www.nist.gov/dads/HTML/transitionfn.html DADS])
# [[transition function]] ([http://www.nist.gov/dads/HTML/transitionfn.html DADS])
Line 1,303: Line 782:
# [[transitive reduction]] ([http://www.nist.gov/dads/HTML/transitiveReduction.html DADS])
# [[transitive reduction]] ([http://www.nist.gov/dads/HTML/transitiveReduction.html DADS])
# [[transpose sequential search]] ([http://www.nist.gov/dads/HTML/transposeSeqSearch.html DADS])
# [[transpose sequential search]] ([http://www.nist.gov/dads/HTML/transposeSeqSearch.html DADS])
# [[traveling salesman]] ([http://www.nist.gov/dads/HTML/travelingSalesman.html DADS])
# [[traveling salesman problem]] ([http://www.nist.gov/dads/HTML/travelingSalesmanProblem.html DADS])
# [[travelling salesman problem]] ([http://www.nist.gov/dads/HTML/travellingSalesmanProblem.html DADS])
# [[treap]] ([http://www.nist.gov/dads/HTML/treap.html DADS])
# [[tree]] ([http://www.nist.gov/dads/HTML/tree.html DADS])
# [[tree automaton]] ([http://www.nist.gov/dads/HTML/treeautomata.html DADS])
# [[tree contraction]] ([http://www.nist.gov/dads/HTML/treecontrctn.html DADS])
# [[tree contraction]] ([http://www.nist.gov/dads/HTML/treecontrctn.html DADS])
# [[tree editing problem]] ([http://www.nist.gov/dads/HTML/treeedit.html DADS])
# [[tree editing problem]] ([http://www.nist.gov/dads/HTML/treeedit.html DADS])
Line 1,314: Line 787:
# [[treesort (1)]] ([http://www.nist.gov/dads/HTML/treesort1.html DADS])
# [[treesort (1)]] ([http://www.nist.gov/dads/HTML/treesort1.html DADS])
# [[treesort (2)]] ([http://www.nist.gov/dads/HTML/treesort2.html DADS])
# [[treesort (2)]] ([http://www.nist.gov/dads/HTML/treesort2.html DADS])
# [[tree traversal]] ([http://www.nist.gov/dads/HTML/treetravrsl.html DADS])
# [[triangle inequality]] ([http://www.nist.gov/dads/HTML/trianglnqlty.html DADS])
# [[triangle inequality]] ([http://www.nist.gov/dads/HTML/trianglnqlty.html DADS])
# [[triconnected graph]] ([http://www.nist.gov/dads/HTML/triconnectedGraph.html DADS])
# [[triconnected graph]] ([http://www.nist.gov/dads/HTML/triconnectedGraph.html DADS])
# [[trie]] ([http://www.nist.gov/dads/HTML/trie.html DADS])
# [[trinary function]] ([http://www.nist.gov/dads/HTML/trinaryfunc.html DADS])
# [[trinary function]] ([http://www.nist.gov/dads/HTML/trinaryfunc.html DADS])
# [[tripartition]] ([http://www.nist.gov/dads/HTML/tripartition.html DADS])
# [[tripartition]] ([http://www.nist.gov/dads/HTML/tripartition.html DADS])
# [[TSP]] ([http://www.nist.gov/dads/HTML/tsp.html DADS])
# [[TST]] ([http://www.nist.gov/dads/HTML/tst.html DADS])
# [[TST]] ([http://www.nist.gov/dads/HTML/tst.html DADS])
# [[Turbo-BM]] ([http://www.nist.gov/dads/HTML/turboBM.html DADS])
# [[Turbo-BM]] ([http://www.nist.gov/dads/HTML/turboBM.html DADS])
# [[Turbo Reverse Factor]] ([http://www.nist.gov/dads/HTML/turboRevFact.html DADS])
# [[Turbo Reverse Factor]] ([http://www.nist.gov/dads/HTML/turboRevFact.html DADS])
# [[Turing machine]] ([http://www.nist.gov/dads/HTML/turingMachine.html DADS])
# [[Turing reduction]] ([http://www.nist.gov/dads/HTML/turingredctn.html DADS])
# [[Turing transducer]] ([http://www.nist.gov/dads/HTML/turingTransducer.html DADS])
# [[Turing transducer]] ([http://www.nist.gov/dads/HTML/turingTransducer.html DADS])
# [[twin grid file]] ([http://www.nist.gov/dads/HTML/twingridfl.html DADS])
# [[twin grid file]] ([http://www.nist.gov/dads/HTML/twingridfl.html DADS])
# [[2-choice hashing]] ([http://www.nist.gov/dads/HTML/twoChoiceHashing.html DADS])
# [[2-choice hashing]] ([http://www.nist.gov/dads/HTML/twoChoiceHashing.html DADS]
# [[two-dimensional]] ([http://www.nist.gov/dads/HTML/twodimensnal.html DADS])
# [[2-left hashing]] ([http://www.nist.gov/dads/HTML/twoLeftHashing.html DADS])
# [[2-left hashing]] ([http://www.nist.gov/dads/HTML/twoLeftHashing.html DADS])
# [[2-left scheme]] ([http://www.nist.gov/dads/HTML/2leftScheme.html DADS])
# [[2-left scheme]] ([http://www.nist.gov/dads/HTML/2leftScheme.html DADS])
# [[two-level grid file]] ([http://www.nist.gov/dads/HTML/twolevgrid.html DADS])
# [[two-level grid file]] ([http://www.nist.gov/dads/HTML/twolevgrid.html DADS])
# [[two-terminal dag]] ([http://www.nist.gov/dads/HTML/twoterminalDag.html DADS])
# [[two-terminal dag]] ([http://www.nist.gov/dads/HTML/twoterminalDag.html DADS])
# [[2-3-4 tree]] ([http://www.nist.gov/dads/HTML/two34tree.html DADS])
# [[2-3 tree]] ([http://www.nist.gov/dads/HTML/two3tree.html DADS])
# [[Two Way algorithm]] ([http://www.nist.gov/dads/HTML/twoWay.html DADS])
# [[Two Way algorithm]] ([http://www.nist.gov/dads/HTML/twoWay.html DADS])
# [[2-way chaining]] ([http://www.nist.gov/dads/HTML/2wayChaining.html DADS])
# [[2-way chaining]] ([http://www.nist.gov/dads/HTML/2wayChaining.html DADS])
# [[two-way linked list]] ([http://www.nist.gov/dads/HTML/twowayLinkedList.html DADS])
# [[two-way list]] ([http://www.nist.gov/dads/HTML/twowayList.html DADS])
# [[two-way merge sort]] ([http://www.nist.gov/dads/HTML/twowaymrgsrt.html DADS])
# [[two-way merge sort]] ([http://www.nist.gov/dads/HTML/twowaymrgsrt.html DADS])

===U===
===U===
# [[UB]] ([http://www.nist.gov/dads/HTML/ub.html DADS])
# [[UB]] ([http://www.nist.gov/dads/HTML/ub.html DADS])
Line 1,346: Line 810:
# [[UKP]] ([http://www.nist.gov/dads/HTML/ukp.html DADS])
# [[UKP]] ([http://www.nist.gov/dads/HTML/ukp.html DADS])
# [[unary function]] ([http://www.nist.gov/dads/HTML/unaryfunc.html DADS])
# [[unary function]] ([http://www.nist.gov/dads/HTML/unaryfunc.html DADS])
# [[unbounded knapsack problem]] ([http://www.nist.gov/dads/HTML/unboundedKnapsack.html DADS])
# [[uncomputable function]] ([http://www.nist.gov/dads/HTML/uncomputableFunction.html DADS])
# [[uncomputable function]] ([http://www.nist.gov/dads/HTML/uncomputableFunction.html DADS])
# [[uncomputable problem]] ([http://www.nist.gov/dads/HTML/uncomputableProblem.html DADS])
# [[uncomputable problem]] ([http://www.nist.gov/dads/HTML/uncomputableProblem.html DADS])
# [[undecidable language]] ([http://www.nist.gov/dads/HTML/undecidableLanguage.html DADS])
# [[undecidable problem]] ([http://www.nist.gov/dads/HTML/undecidableProblem.html DADS])
# [[undecidable problem]] ([http://www.nist.gov/dads/HTML/undecidableProblem.html DADS])
# [[undirected graph]] ([http://www.nist.gov/dads/HTML/undirectgraf.html DADS])
# [[uniform circuit complexity]] ([http://www.nist.gov/dads/HTML/uniformCircuitComplexity.html DADS])
# [[uniform circuit complexity]] ([http://www.nist.gov/dads/HTML/uniformCircuitComplexity.html DADS])
# [[uniform circuit family]] ([http://www.nist.gov/dads/HTML/uniformCircuitFamily.html DADS])
# [[uniform circuit family]] ([http://www.nist.gov/dads/HTML/uniformCircuitFamily.html DADS])
Line 1,357: Line 818:
# [[uniform hashing]] ([http://www.nist.gov/dads/HTML/uniformhashn.html DADS])
# [[uniform hashing]] ([http://www.nist.gov/dads/HTML/uniformhashn.html DADS])
# [[uniform matrix]] ([http://www.nist.gov/dads/HTML/uniformmatrx.html DADS])
# [[uniform matrix]] ([http://www.nist.gov/dads/HTML/uniformmatrx.html DADS])
# [[union]] ([http://www.nist.gov/dads/HTML/union.html DADS])
# [[union of automata]] ([http://www.nist.gov/dads/HTML/unionautoma.html DADS])
# [[union of automata]] ([http://www.nist.gov/dads/HTML/unionautoma.html DADS])
# [[universal B-tree]] ([http://www.nist.gov/dads/HTML/universalBtree.html DADS])
# [[universal B-tree]] ([http://www.nist.gov/dads/HTML/universalBtree.html DADS])
# [[universal hashing]] ([http://www.nist.gov/dads/HTML/universalhsh.html DADS])
# [[universal hashing]] ([http://www.nist.gov/dads/HTML/universalhsh.html DADS])
# [[universal state]] ([http://www.nist.gov/dads/HTML/universalstt.html DADS])
# [[universal state]] ([http://www.nist.gov/dads/HTML/universalstt.html DADS])
# [[universal Turing machine]] ([http://www.nist.gov/dads/HTML/universalTur.html DADS])
# [[universe]] ([http://www.nist.gov/dads/HTML/universe.html DADS])
# [[UnShuffle sort]] ([http://www.nist.gov/dads/HTML/unshufflsort.html DADS])
# [[UnShuffle sort]] ([http://www.nist.gov/dads/HTML/unshufflsort.html DADS])
# [[unsolvable problem]] ([http://www.nist.gov/dads/HTML/unsolvableProblem.html DADS])
# [[unsolvable problem]] ([http://www.nist.gov/dads/HTML/unsolvableProblem.html DADS])
# [[unsorted list]] ([http://www.nist.gov/dads/HTML/unsortedlst.html DADS])
# [[unsorted list]] ([http://www.nist.gov/dads/HTML/unsortedlst.html DADS])

# [[upper triangular matrix]] ([http://www.nist.gov/dads/HTML/upperTriangularMatrix.html DADS])
===V===
===V===
# [[van Emde-Boas priority queue]] ([http://www.nist.gov/dads/HTML/vanemdeboas.html DADS])
# [[van Emde-Boas priority queue]] ([http://www.nist.gov/dads/HTML/vanemdeboas.html DADS])
# [[vehicle routing problem]] ([http://www.nist.gov/dads/HTML/vehicleRouting.html DADS])
# [[vehicle routing problem]] ([http://www.nist.gov/dads/HTML/vehicleRouting.html DADS])
# [[Veitch diagram]] ([http://www.nist.gov/dads/HTML/VeitchDiagram.html DADS])
# [[Veitch diagram]] ([http://www.nist.gov/dads/HTML/VeitchDiagram.html DADS])
# [[vertex]] ([http://www.nist.gov/dads/HTML/vertex.html DADS])
# [[vertex coloring]] ([http://www.nist.gov/dads/HTML/vertexcolor.html DADS])
# [[vertex coloring]] ([http://www.nist.gov/dads/HTML/vertexcolor.html DADS])
# [[vertex connectivity]] ([http://www.nist.gov/dads/HTML/vertexConnectivity.html DADS])
# [[vertex connectivity]] ([http://www.nist.gov/dads/HTML/vertexConnectivity.html DADS])
# [[vertex cover]] ([http://www.nist.gov/dads/HTML/vertexcover.html DADS])
# [[vertex covering problem]] ([http://www.nist.gov/dads/HTML/vertexCoveringProblem.html DADS])
# [[vertical visibility map]] ([http://www.nist.gov/dads/HTML/vertical.html DADS])
# [[vertical visibility map]] ([http://www.nist.gov/dads/HTML/vertical.html DADS])
# [[virtual hashing]] ([http://www.nist.gov/dads/HTML/virtualHashing.html DADS])
# [[virtual hashing]] ([http://www.nist.gov/dads/HTML/virtualHashing.html DADS])
Line 1,382: Line 837:
# [[visible]] ([http://www.nist.gov/dads/HTML/visible.html DADS])
# [[visible]] ([http://www.nist.gov/dads/HTML/visible.html DADS])
# [[Viterbi search]] ([http://www.nist.gov/dads/HTML/ViterbiSearch.html DADS])
# [[Viterbi search]] ([http://www.nist.gov/dads/HTML/ViterbiSearch.html DADS])
# [[Vitter's algorithm]] ([http://www.nist.gov/dads/HTML/vittersAlgorithm.html DADS])
# [[VRP]] ([http://www.nist.gov/dads/HTML/vrp.html DADS])
# [[VRP]] ([http://www.nist.gov/dads/HTML/vrp.html DADS])

===W===
===W===
# [[walk]] ([http://www.nist.gov/dads/HTML/walk.html DADS]) - wikipedia article is about wrong topic
# [[walk]] ([http://www.nist.gov/dads/HTML/walk.html DADS]) - wikipedia article is about wrong topic
Line 1,397: Line 852:
# [[worst-case minimum access]] ([http://www.nist.gov/dads/HTML/worstCaseMinimumAccess.html DADS])
# [[worst-case minimum access]] ([http://www.nist.gov/dads/HTML/worstCaseMinimumAccess.html DADS])


===X===
* '''''DONE!'''''
===Y===
* '''''DONE!'''''
===Z===
===Z===
# [[zero-based array]] ([http://www.nist.gov/dads/HTML/zerobasedArray.html DADS])
# [[zero-based array]] ([http://www.nist.gov/dads/HTML/zerobasedArray.html DADS])

Revision as of 06:10, 17 January 2006

This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information.

  • Some terms with a leading variable, such as n-way, m-dimensional, or p-branching, are under k-.
  • Some definitions are copyright CRC Press, such as depoissonization. All others are public domain. Therefore you can shamelessly copy the (high quality) external links and the see also section.
  • Cite with {{DADS|Ackermann's function|ackermann}}
Public Domain This article incorporates public domain material from Paul E. Black. "Ackermann's function". Dictionary of Algorithms and Data Structures. NIST.


Template:CompactTOC2

A

  1. ABKU hashing (DADS)
  2. (a,b)-tree (DADS)
  3. active data structure (DADS)
  4. adaptive heapsort (DADS)
  5. adaptive heap sort (DADS)
  6. adaptive k-d tree (DADS)
  7. adaptive sort (DADS)
  8. address-calculation sort (DADS)
  9. admissible tree (DADS)
  10. admissible vertex (DADS)
  11. adversary (DADS)
  12. Aho-Corasick (DADS)
  13. algorithm FGK (DADS)
  14. algorithmically solvable (DADS)
  15. all pairs shortest path (DADS)
  16. all paths (DADS)
  17. all simple paths (DADS)
  18. alphabet (DADS)
  19. Alpha Skip Search algorithm (DADS)
  20. alternating path (DADS)
  21. alternation (DADS)
  22. always-go-left hashing (DADS)
  23. American flag sort (DADS)
  24. ancestor (DADS)
  25. Apostolico-Crochemore (DADS)
  26. Apostolico-Giancarlo algorithm (DADS)
  27. arborescence (DADS)
  28. array index (DADS)
  29. array merging (DADS)
  30. array search (DADS)
  31. articulation vertex (DADS)
  32. assoc list (DADS)
  33. asymptotically tight bound (DADS)
  34. asymptotic bound (DADS)
  35. asymptotic lower bound (DADS)
  36. asymptotic space complexity (DADS)
  37. asymptotic upper bound (DADS)
  38. automaton (DADS)
  39. average case (DADS)
  40. average-case cost (DADS)

B

  1. bag (DADS)
  2. balance (DADS)
  3. balanced binary tree (DADS)
  4. balanced k-way merge sort (DADS)
  5. balanced merge sort (DADS)
  6. balanced multiway merge (DADS)
  7. balanced multiway tree (DADS)
  8. balanced quicksort (DADS)
  9. balanced tree (DADS)
  10. balanced two-way merge sort (DADS)
  11. BANG file (DADS)
  12. Batcher sort (DADS)
  13. Batcher's sort (DADS)
  14. Bayer tree (DADS)
  15. BB(α) tree (DADS)
  16. BD-tree (DADS)
  17. best-case cost (DADS)
  18. biconnected component (DADS)
  19. biconnected graph (DADS)
  20. binary insertion sort (DADS)
  21. binary knapsack problem (DADS)
  22. binary priority queue (DADS)
  23. binary tree representation of trees (DADS)
  24. bingo sort (DADS)
  25. binomial queue (DADS)
  26. bintree (DADS)
  27. bisector (DADS)
  28. block (DADS)
  29. block addressing index (DADS)
  30. blocking flow (DADS)
  31. blossom (DADS)
  32. border (DADS)
  33. bottom-up tree automaton (DADS)
  34. boundary-based representation (DADS)
  35. bounded error probability in polynomial time (DADS)
  36. bounded queue (DADS)
  37. bounded stack (DADS)
  38. Boyer-Moore-Horspool (DADS)
  39. BP (DADS)
  40. branching programs (DADS)
  41. brick sort (DADS)
  42. bridge (DADS)
  43. British Museum algorithm (DADS)
  44. British Museum technique (DADS)
  45. brute force string search (DADS)
  46. brute force string search with mismatches (DADS)
  47. bsearch (DADS)
  48. BSP-tree (DADS)
  49. bucket array (DADS)
  50. bucketing method (DADS)
  51. bucket trie (DADS)
  52. buddy system (DADS)
  53. buddy tree (DADS)
  54. build-heap (DADS)
  55. BV-tree (DADS)
  56. Byzantine Agreement Problem (DADS)
  57. Byzantine generals (DADS)
  58. Byzantine generals problem (DADS)

C

  1. cactus stack (DADS)
  2. calendar queue (DADS)
  3. candidate consistency testing (DADS)
  4. candidate verification (DADS)
  5. canonical complexity class (DADS)
  6. capacitated facility location (DADS)
  7. capacity (DADS)
  8. capacity constraint (DADS)
  9. cartesian tree (DADS)
  10. cascade merge sort (DADS)
  11. Caverphone (DADS)
  12. Cayley-Purser (DADS)
  13. CBT (DADS)
  14. CCS (DADS)
  15. cell probe model (DADS)
  16. cell tree (DADS)
  17. centroid (DADS)
  18. certificate (DADS)
  19. chain (DADS)
  20. chaining (DADS)
  21. child (DADS)
  22. circuit (DADS)
  23. circuit complexity (DADS)
  24. circuit value problem (DADS)
  25. circular list (DADS)
  26. circular queue (DADS)
  27. city block norm (DADS)
  28. closed hashing (DADS)
  29. clustering (DADS)
  30. clustering free (DADS)
  31. coalesced chaining (DADS)
  32. coarsening (DADS)
  33. cocktail shaker sort (DADS)
  34. code word (DADS)
  35. codeword (DADS)
  36. coding tree (DADS)
  37. collective recursion (DADS)
  38. collision (DADS)
  39. collision resolution scheme (DADS)
  40. Colussi (DADS)
  41. combination (DADS)
  42. compact DAWG (DADS)
  43. compact trie (DADS)
  44. competitive ratio (DADS)
  45. complete binary tree (DADS)
  46. complete k-ary tree (DADS)
  47. completely connected graph (DADS)
  48. complete tree (DADS)
  49. complexity (DADS)
  50. complexity class (DADS)
  51. compliment (DADS)
  52. computable (DADS)
  53. computable function (DADS)
  54. concave function (DADS)
  55. concurrent flow (DADS)
  56. concurrent read, concurrent write (DADS)
  57. concurrent read, exclusive write (DADS)
  58. confluently persistent data structure (DADS)
  59. conjunction (DADS)
  60. continuous knapsack problem (DADS)
  61. CP algorithm (DADS)
  62. CPP (DADS)
  63. CRC (DADS)
  64. CRCW (DADS)
  65. CREW (DADS)
  66. critical path problem (DADS)
  67. Crochemore-Perrin string matching (DADS)
  68. CSP (DADS)
  69. CTL (DADS)
  70. cube root (DADS)
  71. cuckoo hashing (DADS)
  72. cut (DADS)
  73. cutting plane (DADS)
  74. cutting theorem (DADS)
  75. cycle (DADS)

D

  1. D-adjacent (DADS)
  2. DAG shortest paths (DADS)
  3. data base (DADS)
  4. data structure persistence (DADS)
  5. DAWG (DADS)
  6. decidable problem (DADS)
  7. decimation (DADS)
  8. decomposable searching problem (DADS)
  9. decreasing increment sort (DADS)
  10. depoissonization (DADS)
  11. depth (DADS)
  12. descendant (DADS)
  13. deterministic (DADS)
  14. deterministic finite automata string search (DADS)
  15. deterministic finite state automaton (DADS)
  16. deterministic finite tree automaton (DADS)
  17. deterministic pushdown automaton (DADS)
  18. deterministic tree automaton (DADS)
  19. DFA (DADS)
  20. DFS (DADS)
  21. DFS forest (DADS)
  22. DFTA (DADS)
  23. diagonalization (DADS)
  24. diameter (DADS)
  25. diet (DADS)
  26. difference (DADS)
  27. digital search tree (DADS)
  28. digital tree (DADS)
  29. diminishing increment sort (DADS)
  30. direct chaining (DADS)
  31. directed acyclic word graph (DADS)
  32. directory (DADS)
  33. discrete interval encoding tree (DADS)
  34. discrete p-center (DADS)
  35. distributional complexity (DADS)
  36. distribution sort (DADS)
  37. divide and marriage before conquest (DADS)
  38. division method (DADS)
  39. domain (DADS)
  40. don't care (DADS)
  41. double-direction bubble sort (DADS)
  42. double-ended priority queue (DADS)
  43. double left rotation (DADS)
  44. double metaphone (DADS)
  45. double right rotation (DADS)
  46. doubly-chained tree (DADS)
  47. DPDA (DADS)
  48. d-random scheme (DADS)
  49. dual (DADS)
  50. dual linear program (DADS)
  51. Dutch national flag (DADS)
  52. dyadic tree (DADS)
  53. dynamic (DADS)
  54. dynamic hashing (DADS)
  55. dynamization transformation (DADS)

E

  1. edge connectivity (DADS)
  2. edge crossing (DADS)
  3. edit operation (DADS)
  4. edit script (DADS)
  5. elastic-bucket trie (DADS)
  6. element uniqueness (DADS)
  7. EM data structure (DADS)
  8. end-of-string (DADS)
  9. enfilade (DADS)
  10. ERCW (DADS)
  11. EREW (DADS)
  12. Euclidean Steiner tree (DADS)
  13. Euler cycle (DADS)
  14. exact string matching (DADS)
  15. EXCELL (DADS)
  16. exclusive read, concurrent write (DADS)
  17. exclusive read, exclusive write (DADS)
  18. exhaustive search (DADS)
  19. existential state (DADS)
  20. expandable hashing (DADS)
  21. exponentiation by repeated squaring (DADS)
  22. extended binary tree (DADS)
  23. extended Euclid's algorithm (DADS)
  24. extended k-d tree (DADS)
  25. extendible hashing (DADS)
  26. external chaining (DADS)
  27. external index (DADS)
  28. external memory algorithm (DADS)
  29. external memory data structure (DADS)
  30. external merge (DADS)
  31. external node (DADS)
  32. external quicksort (DADS)
  33. external radix sort (DADS)
  34. extrapolation search (DADS)
  35. extremal (DADS)
  36. extreme point (DADS)

F

  1. facility location (DADS)
  2. factor (DADS)
  3. fathoming (DADS)
  4. feasible region (DADS)
  5. Ferguson-Forcade algorithm (DADS)
  6. Fibonaccian search (DADS)
  7. Fibonacci search (DADS)
  8. Fibonacci tree (DADS)
  9. filial-heir chain (DADS)
  10. Find (DADS)
  11. find kth least element (DADS)
  12. finitary tree (DADS)
  13. finite state machine minimization (DADS)
  14. first child-next sibling binary tree (DADS)
  15. Fisher-Yates shuffle (DADS)
  16. fixed-grid method (DADS)
  17. flash sort (DADS)
  18. flow (DADS)
  19. flow conservation (DADS)
  20. flow function (DADS)
  21. Ford-Bellman (DADS)
  22. forest (DADS)
  23. forest editing problem (DADS)
  24. forward index (DADS)
  25. fractional knapsack problem (DADS)
  26. fractional solution (DADS)
  27. free edge (DADS)
  28. free vertex (DADS)
  29. frequency count heuristic (DADS)
  30. full array (DADS)
  31. fully dynamic graph problem (DADS)
  32. fully inverted index (DADS)
  33. fully persistent data structure (DADS)
  34. fully polynomial approximation scheme (DADS)
  35. functional data structure (DADS)

G

  1. Galil-Giancarlo (DADS)
  2. Galil-Seiferas (DADS)
  3. GBD-tree (DADS)
  4. geometric optimization problem (DADS)
  5. graph concentration (DADS)
  6. graph partition (DADS)
  7. greedy heuristic (DADS)
  8. grid drawing (DADS)
  9. grid file (DADS)

H

  1. hash heap (DADS)
  2. hash table delete (DADS)
  3. hB-tree (DADS)
  4. head (DADS)
  5. heap condition (DADS)
  6. heap ordered (DADS)
  7. heaviest common subsequence (DADS)
  8. height (DADS)
  9. height-balanced binary search tree (DADS)
  10. height-balanced tree (DADS)
  11. histogram sort (DADS)
  12. horizontal visibility map (DADS)
  13. Horspool (DADS)
  14. hybrid algorithm (DADS)
  15. hyperedge (DADS)

I

  1. ideal merge (DADS)
  2. implication (DADS)
  3. implies (DADS)
  4. incompressible string (DADS)
  5. incremental hashing (DADS)
  6. index file (DADS)
  7. information theoretic bound (DADS)
  8. integer linear program (DADS)
  9. integer multi-commodity flow (DADS)
  10. integer polyhedron (DADS)
  11. interior-based representation (DADS)
  12. interior node (DADS)
  13. internal sort (DADS)
  14. interpolation-sequential search (DADS)
  15. intersection (DADS)

J

  1. Jaro-Winkler (DADS)

K

  1. k-ary heap (DADS)
  2. k-ary Huffman coding (DADS)
  3. k-ary Hufman encoding (DADS)
  4. k-ary tree (DADS)
  5. k-clustering (DADS)
  6. k-coloring (DADS)
  7. k-connected graph (DADS)
  8. k-d-B-tree (DADS)
  9. k-dimensional (DADS)
  10. K-dominant match (DADS)
  11. k-d tree (DADS)
  12. key (DADS)
  13. KmpSkip Search (DADS)
  14. Knuth's algorithm B (DADS)
  15. Königsberg bridges problem (DADS)
  16. Koenigsberg bridges problem (DADS)
  17. kth order Fibonacci numbers (DADS)
  18. kth shortest path (DADS)
  19. kth shortest path (DADS)
  20. kth smallest element (DADS)
  21. KV diagram (DADS)
  22. k-way merge (DADS)
  23. k-way merge sort (DADS)
  24. k-way tree (DADS)

L

  1. language (DADS)
  2. layered digraph (DADS)
  3. layered graph (DADS)
  4. LCRS binary tree (DADS)
  5. LCS (DADS)
  6. leaf (DADS)
  7. left child-right sibling binary tree (DADS)
  8. left single rotation (DADS)
  9. level-order traversal (DADS)
  10. linear (DADS)
  11. linear probing sort (DADS)
  12. linear product (DADS)
  13. linear quadtree (DADS)
  14. link (DADS)
  15. list contraction (DADS)
  16. little-o notation (DADS)
  17. Lm distance (DADS)
  18. local alignment (DADS)
  19. longest common substring (DADS)
  20. lowest common ancestor (DADS)
  21. l-reduction (DADS)
  22. lucksort (DADS)
  23. luckysort (DADS)
  24. lucky sort (DADS)

M

  1. Malhotra-Kumar-Maheshwari blocking flow (DADS)
  2. map (DADS)
  3. matched edge (DADS)
  4. matched vertex (DADS)
  5. matrix-chain multiplication problem (DADS)
  6. max-heap property (DADS)
  7. maximally connected component (DADS)
  8. Maximal Shift (DADS)
  9. maximum bipartite matching (DADS)
  10. maximum-flow problem (DADS)
  11. maximum-heap property (DADS)
  12. MAX-SNP (DADS)
  13. MBB (DADS)
  14. meld (DADS)
  15. merge exchange sort (DADS)
  16. Miller-Rabin (DADS)
  17. Miller-Rabin probabilistic primality test (DADS)
  18. min-heap property (DADS)
  19. minimal code spanning tree (DADS)
  20. minimum bounding box (DADS)
  21. minimum path cover (DADS)
  22. minimum vertex cut (DADS)
  23. mixed integer linear program (DADS)
  24. mode (DADS)
  25. moderately exponential (DADS)
  26. MODIFIND (DADS)
  27. monotone priority queue (DADS)
  28. Morris-Pratt (DADS)
  29. move (DADS)
  30. move-to-front heuristic (DADS)
  31. move-to-root heuristic (DADS)
  32. multi-commodity flow (DADS)
  33. multilayer grid file (DADS)
  34. multiplication method (DADS)
  35. multiplicative hashing (DADS)
  36. multiprefix (DADS)
  37. multiprocessor model (DADS)
  38. multi suffix tree (DADS)
  39. multiway decision (DADS)
  40. multiway merge (DADS)
  41. multiway search tree (DADS)
  42. multiway tree (DADS)

N

  1. naive string search (DADS)
  2. n-ary function (DADS)
  3. NC many-one reducibility (DADS)
  4. next state (DADS)
  5. NFTA (DADS)
  6. nonbalanced merge (DADS)
  7. nonbalanced merge sort (DADS)
  8. nondeterministic finite tree automaton (DADS)
  9. nondeterministic tree automaton (DADS)
  10. nonterminal node (DADS)
  11. Not So Naive (DADS)
  12. null tree (DADS)
  13. NYSIIS (DADS)

O

  1. oblivious binary decision diagram (DADS)
  2. occurrence (DADS)
  3. odd shaped array (DADS)
  4. off-line algorithm (DADS)
  5. 1-based array (DADS)
  6. one-based indexing (DADS)
  7. optimal cost (DADS)
  8. optimal hashing (DADS)
  9. optimal merge (DADS)
  10. optimal mismatch (DADS)
  11. optimal polygon triangulation problem (DADS)
  12. optimal polyphase merge (DADS)
  13. optimal polyphase merge sort (DADS)
  14. optimal solution (DADS)
  15. optimal triangulation problem (DADS)
  16. optimal value (DADS)
  17. oracle set (DADS)
  18. oracle tape (DADS)
  19. ordered array (DADS)
  20. ordered binary decision diagram (DADS)
  21. ordered linked list (DADS)
  22. ordered tree (DADS)
  23. order preserving hash (DADS)
  24. order preserving minimal perfect hashing (DADS)
  25. oriented acyclic graph (DADS)
  26. oriented graph (DADS)
  27. oriented tree (DADS)
  28. orthogonal drawing (DADS)
  29. orthogonal lists (DADS)
  30. orthogonally convex rectilinear polygon (DADS)
  31. oscillating merge sort (DADS)

P

  1. P (DADS)
  2. packing (DADS)
  3. padding argument (DADS)
  4. pagoda (DADS)
  5. PAM (DADS)
  6. parallel computation thesis (DADS)
  7. parallel prefix computation (DADS)
  8. parallel random-access machine (DADS)
  9. parametric searching (DADS)
  10. parent (DADS)
  11. partially decidable problem (DADS)
  12. partially dynamic graph problem (DADS)
  13. partially persistent data structure (DADS)
  14. passive data structure (DADS)
  15. path system problem (DADS)
  16. pattern (DADS)
  17. pattern element (DADS)
  18. PD (DADS)
  19. Pearson's hash (DADS)
  20. perfect binary tree (DADS)
  21. perfect k-ary tree (DADS)
  22. perfect shuffle (DADS)
  23. performance guarantee (DADS)
  24. performance ratio (DADS)
  25. persistent data structure with confluence (DADS)
  26. phonetic coding (DADS)
  27. phonetic encoding (DADS)
  28. phonetic matching (DADS)
  29. phonetic string match (DADS)
  30. pile (DADS)
  31. pipelined divide and conquer (DADS)
  32. planarity (DADS)
  33. planarization (DADS)
  34. planar straight-line graph (DADS)
  35. PLOP-hashing (DADS)
  36. point access method (DADS)
  37. pointer jumping (DADS)
  38. pointer machine (DADS)
  39. poissonization (DADS)
  40. polychotomy (DADS)
  41. polyhedron (DADS)
  42. polynomial-time Church-Turing thesis (DADS)
  43. polyphase merge (DADS)
  44. polyphase merge sort (DADS)
  45. polytope (DADS)
  46. postman sort (DADS)
  47. postman's sort (DADS)
  48. Post's correspondence problem (DADS)
  49. predicate (DADS)
  50. prefix (DADS)
  51. prefix code (DADS)
  52. prefix computation (DADS)
  53. prefix sums (DADS)
  54. prefix traversal (DADS)
  55. priority queue ordering (DADS)
  56. probe sequence (DADS)
  57. procedure (DADS)
  58. proper (DADS)
  59. proper binary tree (DADS)
  60. proper coloring (DADS)
  61. property list (DADS)
  62. prop list (DADS)
  63. prune and search (DADS)
  64. pth order Fibonacci numbers (DADS)
  65. P-tree (DADS)
  66. purely functional language (DADS)
  67. pushdown (DADS)
  68. push-down store (DADS)
  69. pushdown transducer (DADS)
  70. p-way merge sort (DADS)

Q

  1. qmsort (DADS)
  2. qm sort (DADS)
  3. quadtree complexity theorem (DADS)
  4. quad trie (DADS)
  5. quick search (DADS)
  6. quickselect (DADS)
  7. quick select (DADS)

R

  1. radix quicksort (DADS)
  2. Raita (DADS)
  3. randomized complexity (DADS)
  4. randomized rounding (DADS)
  5. randomized search tree (DADS)
  6. Randomized-Select (DADS)
  7. range sort (DADS)
  8. rank (DADS)
  9. Ratcliff/Obershelp pattern recognition (DADS)
  10. reachable (DADS)
  11. rebalance (DADS)
  12. recognizer (DADS)
  13. rectangular matrix (DADS)
  14. rectilinear (DADS)
  15. rectilinear distance (DADS)
  16. rectilinear Steiner tree (DADS)
  17. recurrence equations (DADS)
  18. recursion termination (DADS)
  19. recursion tree (DADS)
  20. recursive (DADS)
  21. recursive data structure (DADS)
  22. recursive doubling (DADS)
  23. recursively solvable (DADS)
  24. reduced basis (DADS)
  25. reduced digraph (DADS)
  26. reduced ordered binary decision diagram (DADS)
  27. reflexive (DADS)
  28. regular decomposition (DADS)
  29. rehashing (DADS)
  30. relation (DADS)
  31. relational structure (DADS)
  32. relative performance guarantee (DADS)
  33. relaxation (DADS)
  34. relaxed balance (DADS)
  35. repeated squaring (DADS)
  36. rescalable (DADS)
  37. restricted universe sort (DADS)
  38. result cache (DADS)
  39. Reverse Colussi (DADS)
  40. Reverse Factor (DADS)
  41. R-file (DADS)
  42. rho-approximation algorithm (DADS)
  43. Rice's method (DADS)
  44. right rotation (DADS)
  45. right single rotation (DADS)
  46. right-threaded tree (DADS)
  47. ROBDD (DADS)
  48. root balance (DADS)
  49. rotate left (DADS)
  50. rotate right (DADS)
  51. rotation (DADS)
  52. rough graph (DADS)
  53. R+-tree (DADS)
  54. R*-tree (DADS)

S

  1. saguaro stack (DADS)
  2. SAM (DADS)
  3. saturated edge (DADS)
  4. SBB tree (DADS)
  5. scan (DADS)
  6. scatter storage (DADS)
  7. search (DADS)
  8. search tree (DADS)
  9. search tree property (DADS)
  10. secant search (DADS)
  11. secondary clustering (DADS)
  12. segment (disambiguation) (DADS)
  13. Select (DADS)
  14. select and partition (DADS)
  15. select kth element (DADS)
  16. select mode (DADS)
  17. self-adjusting binary search tree (DADS)
  18. self-loop (DADS)
  19. self-organizing heuristic (DADS)
  20. self-organizing list (DADS)
  21. self-organizing sequential search (DADS)
  22. self-organizing strategy (DADS)
  23. semidefinite programming (DADS)
  24. separate chaining (DADS)
  25. separation theorem (DADS)
  26. shadow heap (DADS)
  27. shadow merge (DADS)
  28. shadow merge insert (DADS)
  29. Shift-Or (DADS)
  30. shortcutting (DADS)
  31. short cutting (DADS)
  32. shortest common superstring (DADS)
  33. shuffle (DADS)
  34. shuffle sort (DADS)
  35. sibling (DADS)
  36. sift up (DADS)
  37. signature (DADS)
  38. Simon algorithm (DADS)
  39. Simon's algorithm (DADS)
  40. simple merge (DADS)
  41. simple uniform hashing (DADS)
  42. simplex (DADS)
  43. simulation theorem (DADS)
  44. single-destination shortest-path problem (DADS)
  45. single-pair shortest-path problem (DADS)
  46. single program multiple data (DADS)
  47. single-source shortest-path problem (DADS)
  48. singularity analysis (DADS)
  49. sink (DADS)
  50. sinking sort (DADS)
  51. sink sort (DADS)
  52. skd-tree (DADS)
  53. skip search (DADS)
  54. slope selection (DADS)
  55. Smith algorithm (DADS)
  56. solvable (DADS)
  57. sorted array (DADS)
  58. sorted list (DADS)
  59. source (DADS)
  60. source-target directed acyclic graph (DADS)
  61. space-constructible function (DADS)
  62. sparsification (DADS)
  63. spatial access method (DADS)
  64. spiral storage (DADS)
  65. SPMD (DADS)
  66. SST (DADS)
  67. stable (DADS)
  68. stack tree (DADS)
  69. star-shaped polygon (DADS)
  70. state transition (DADS)
  71. static (DADS)
  72. static Huffman coding (DADS)
  73. s-t cut (DADS)
  74. st-digraph (DADS)
  75. Steiner minimum tree (DADS)
  76. Steiner ratio (DADS)
  77. straight-line drawing (DADS)
  78. strand sort (DADS)
  79. string editing problem (DADS)
  80. string matching on ordered alphabets (DADS)
  81. string matching with errors (DADS)
  82. string matching with mismatches (DADS)
  83. string search (DADS)
  84. string similarity search (DADS)
  85. strip packing (DADS)
  86. strongly connected graph (DADS)
  87. strongly NP-hard (DADS)
  88. subadditive ergodic theorem (DADS)
  89. sublinear time algorithm (DADS)
  90. subword (DADS)
  91. suffix automaton (DADS)
  92. superimposed code (DADS)
  93. supersink (DADS)
  94. supersource (DADS)
  95. symmetric (DADS)
  96. symmetric binary B-tree (DADS)
  97. symmetry breaking (DADS)

T

  1. tail (DADS)
  2. target (DADS)
  3. terminal (DADS)
  4. terminal node (DADS)
  5. text (DADS)
  6. text match (DADS)
  7. text searching (DADS)
  8. threaded binary tree (DADS)
  9. threaded tree (DADS)
  10. three-dimensional (DADS)
  11. three-way merge sort (DADS)
  12. three-way radix quicksort (DADS)
  13. time/space complexity (DADS)
  14. top-down radix sort (DADS)
  15. top-down tree automaton (DADS)
  16. topology tree (DADS)
  17. top sort (DADS)
  18. totally decidable language (DADS)
  19. totally decidable problem (DADS)
  20. totally undecidable problem (DADS)
  21. tour (DADS)
  22. tournament (DADS)
  23. tournament sort (DADS)
  24. transition (DADS)
  25. transition function (DADS)
  26. transitive (DADS)
  27. transitive closure (DADS)
  28. transitive reduction (DADS)
  29. transpose sequential search (DADS)
  30. tree contraction (DADS)
  31. tree editing problem (DADS)
  32. tree sort (DADS)
  33. treesort (1) (DADS)
  34. treesort (2) (DADS)
  35. triangle inequality (DADS)
  36. triconnected graph (DADS)
  37. trinary function (DADS)
  38. tripartition (DADS)
  39. TST (DADS)
  40. Turbo-BM (DADS)
  41. Turbo Reverse Factor (DADS)
  42. Turing transducer (DADS)
  43. twin grid file (DADS)
  44. 2-choice hashing (DADS
  45. 2-left hashing (DADS)
  46. 2-left scheme (DADS)
  47. two-level grid file (DADS)
  48. two-terminal dag (DADS)
  49. Two Way algorithm (DADS)
  50. 2-way chaining (DADS)
  51. two-way merge sort (DADS)

U

  1. UB (DADS)
  2. UB-tree (DADS)
  3. UKP (DADS)
  4. unary function (DADS)
  5. uncomputable function (DADS)
  6. uncomputable problem (DADS)
  7. undecidable problem (DADS)
  8. uniform circuit complexity (DADS)
  9. uniform circuit family (DADS)
  10. uniform greedy algorithm (DADS)
  11. uniform hashing (DADS)
  12. uniform matrix (DADS)
  13. union of automata (DADS)
  14. universal B-tree (DADS)
  15. universal hashing (DADS)
  16. universal state (DADS)
  17. UnShuffle sort (DADS)
  18. unsolvable problem (DADS)
  19. unsorted list (DADS)

V

  1. van Emde-Boas priority queue (DADS)
  2. vehicle routing problem (DADS)
  3. Veitch diagram (DADS)
  4. vertex coloring (DADS)
  5. vertex connectivity (DADS)
  6. vertical visibility map (DADS)
  7. virtual hashing (DADS)
  8. visibility map (DADS)
  9. visible (DADS)
  10. Viterbi search (DADS)
  11. VRP (DADS)

W

  1. walk (DADS) - wikipedia article is about wrong topic
  2. weak-heap (DADS)
  3. weak-heap sort (DADS)
  4. weight-balanced tree (DADS)
  5. window (DADS)
  6. witness (DADS)
  7. work (DADS)
  8. work-depth model (DADS)
  9. work-efficient (DADS)
  10. work-preserving (DADS)
  11. worst-case minimum access (DADS)

Z

  1. zero-based array (DADS)
  2. 0-based indexing (DADS)
  3. Zhu-Takaoka (DADS)
  4. zipper Zipper (data structure), a tree like data structure (DADS)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Wikipedia:Missing_science_topics/NIST_Dictionary_of_Algorithms_and_Data_Structures&oldid=35508532"