A

• Abstract data typeMathematical model for data types
• Analysis of algorithmsStudy of resources used by an algorithm
• Array (data structure)Type of data structure
• Associative arrayData structure holding key/value pairs
• Automata theoryStudy of abstract machines and automata

B

• B-treeTree-based computer data structure
• Big O notationDescribes approximate behavior of a function
• Binary searchSearch algorithm used in sorted arrays
• Binary search treeRooted binary tree data structure
• Blum axiomsAxioms in computational complexity theory
• Boolean satisfiability problemProblem of determining if a Boolean formula could be made true
• Breadth-first searchAlgorithm to search the nodes of a graph
• Brute-force searchProblem-solving technique and algorithmic paradigm

C

• Cache replacement policiesAlgorithm for caching data
• Cellular automatonDiscrete model of computation
• Chomsky hierarchyHierarchy of classes of formal grammars
• ComputationAny type of calculation
• Constructible functionConcept in complexity theory
• Conway's Game of LifeTwo-dimensional cellular automaton

D

• Data modelAbstract model
• Decider (Turing machine)In computability theory, a decider is a Turing machine that halts for every input. A decid
• Depth-first searchAlgorithm to search the nodes of a graph
• Deterministic algorithmType of algorithm in computer science
• Divide-and-conquer algorithmAlgorithms which recursively solve subproblems

E

• Edward M. McCreightEdward Meyers McCreight is an American computer scientist. He received his Ph.D. in comput

F

• Finite-state machineMathematical model of computation
• Fractional cascadingIn computer science, fractional cascading is a technique to speed up a sequence of binary
• Functional specificationA functional specification (also, functional spec, specs, functional specifications docume

G

• Golly (program)Golly is a tool for the simulation of cellular automata. It is free open-source software w
• Graph (abstract data type)Abstract data type in computer science

H

• Hash tableAssociative array for storing key–value pairs
• HashlifeHashlife is a memoized algorithm for computing the long-term fate of a given starting conf
• Heap (data structure)Computer science data structure
• HeapsortSorting algorithm using the heap data structure

K

• Karatsuba algorithmThe Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly K
• Kolmogorov complexityMeasure of algorithmic complexity

L

• Linked listData structure with nodes pointing to the next node

M

• Merge sortDivide and conquer sorting algorithm
• Multi-track Turing machineA Multitrack Turing machine is a specific type of multi-tape Turing machine.

N

• Nondeterministic Turing machineTheoretical model of computation
• NP (complexity)Complexity class used to classify decision problems
• NP-hardnessComplexity class

O

• Order of approximationExpressions for approximation accuracy

P

• P (complexity)Class of problems solvable in polynomial time
• Page replacement algorithmIn a computer operating system that uses paging for virtual memory management, page replac
• Perfect hash functionIn computer science, a perfect hash function h for a set S is a hash function that maps di
• Pushdown automatonType of automaton

Q

• Queue (abstract data type)Abstract data type
• QuicksortDivide and conquer sorting algorithm

R

• Random accessComputer memory concept
• Red–black treeSelf-balancing binary search tree data structure
• Routing (electronic design automation)In electronic design, wire routing, commonly called simply routing, is a step in the desig

S

• Scale analysis (mathematics)Problem-solving technique in applied mathematics using order-of-magnitude approximations
• Search algorithmAny algorithm which solves the search problem
• Search engine (computing)System to help searching for information
• Semi-structured dataData organized by tags but not tables
• Sorting algorithmAlgorithm that arranges lists in order
• Space complexityComputer memory needed by an algorithm
• Stack (abstract data type)Abstract data type
• Stack overflowIn software, a stack overflow occurs if the call stack pointer exceeds the stack bound. Th
• String-searching algorithmSearching for patterns in text
• Symmetric Turing machineA symmetric Turing machine is a Turing machine which has a configuration graph that is und

T

• Tic-tac-toePaper-and-pencil game for two players
• Time complexityEstimate of time taken for running an algorithm
• Time hierarchy theoremGiven more time, a Turing machine can solve more problems
• Tree (abstract data type)Linked node hierarchical data structure

U

• Unique keyConcept in relational database design