Concepts inA fast algorithm for finding dominators in a flowgraph
Dominator (graph theory)
In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By definition, every node dominates itself. There are a number of related concepts: A node d strictly dominates a node n if d dominates n and d does not equal n.
more from Wikipedia
Ackermann function
In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive.
more from Wikipedia
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.
more from Wikipedia
ALGOL W
ALGOL W is a programming language. It was based on a proposal for ALGOL X by Niklaus Wirth and C. A. R. Hoare as a successor to ALGOL 60 in IFIP Working Group 2.1. When the committee decided that the proposal was not a sufficient advance over ALGOL 60, the proposal was published as A contribution to the development of ALGOL. After making small modifications to the language Wirth supervised a high quality implementation for the IBM/360 at Stanford University that was widely distributed.
more from Wikipedia
Bit array
A bit array (also known as a bitmap, a bitset, or a bitstring) is an array data structure that compactly stores individual bits. It implements a simple set data structure storing a subset of {1,2,... ,n} and is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and k is some nonnegative integer.
more from Wikipedia
Binary relation
In mathematics, a binary relation on a set A is a collection of ordered pairs of elements of A. In other words, it is a subset of the Cartesian product A = A × A. More generally, a binary relation between two sets A and B is a subset of A × B. The terms dyadic relation and 2-place relation are synonyms for binary relations.
more from Wikipedia