In computer science a retroactive data structure is data structure which supports efficient modifications to a sequence of operations that have been performed on the structure. These modifications can take the form of retroactive insertion, deletion or updating an operation that was performed at some time in the past.
more from Wikipedia
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
more from Wikipedia
Disjoint-set data structure
In computing, a disjoint-set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union-find algorithm is an algorithm that performs two useful operations on such a data structure: Find: Determine which subset a particular element is in. This can be used for determining if two elements are in the same subset. Union: Join two subsets into a single subset.
more from Wikipedia
Priority queue
In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue. stack ¿ elements are pulled in last-in first-out-order (e.g.
more from Wikipedia
Sequence
In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements), and the number of ordered element (possibly infinite) is called the length of the sequence. Unlike a set, order matters, and exactly the same elements can appear multiple times at different positions in the sequence. A sequence is a discrete function. For example, (C, R, Y) is a sequence of letters that differs from (Y, C, R), as the ordering matters.
more from Wikipedia
Model theory
In mathematics, model theory is the study of (classes of) mathematical structures using tools from mathematical logic. It has close ties to abstract algebra, particularly universal algebra. Objects of study in model theory are models for formal languages which are structures that give meaning to the sentences of these formal languages.
more from Wikipedia