en.unionpedia.org

Order-maintenance problem, the Glossary

In computer science, the order-maintenance problem involves maintaining a totally ordered set supporting the following operations.^[1]

16 relations: Acta Informatica, Amortized analysis, Athanasios Tsakalidis, Big O notation, Computer science, Daniel Sleator, Erik Demaine, Journal of Computer and System Sciences, Journal of the ACM, List-labeling problem, Martin Farach-Colton, Michael A. Bender, Persistent data structure, Total order, Weight-balanced tree, Y-fast trie.
Amortized data structures

Acta Informatica

Acta Informatica is a peer-reviewed scientific journal, publishing original research papers in computer science.

See Order-maintenance problem and Acta Informatica

In computer science, amortized analysis is a method for analyzing a given algorithm's complexity, or how much of a resource, especially time or memory, it takes to execute. Order-maintenance problem and amortized analysis are amortized data structures.

See Order-maintenance problem and Amortized analysis

Athanasios Tsakalidis

Athanasios K. Tsakalidis (Αθανάσιος Κ.; born 1950) is a Greek computer scientist, a professor at the Graphics, Multimedia and GIS Laboratory, Computer Engineering and Informatics Department (CEID), University of Patras, Greece.

See Order-maintenance problem and Athanasios Tsakalidis

Big O notation

Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity.

See Order-maintenance problem and Big O notation

Computer science

Computer science is the study of computation, information, and automation.

See Order-maintenance problem and Computer science

Daniel Sleator

Daniel Dominic Kaplan Sleator (born 10 December 1953) is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States.

See Order-maintenance problem and Daniel Sleator

Erik Demaine

Erik D. Demaine (born February 28, 1981) is a Canadian-American professor of computer science at the Massachusetts Institute of Technology and a former child prodigy.

See Order-maintenance problem and Erik Demaine

Journal of Computer and System Sciences

The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.

See Order-maintenance problem and Journal of Computer and System Sciences

Journal of the ACM

The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.

See Order-maintenance problem and Journal of the ACM

List-labeling problem

In computer science, the list-labeling problem involves maintaining a totally ordered set S supporting the following operations. Order-maintenance problem and list-labeling problem are amortized data structures.

See Order-maintenance problem and List-labeling problem

Martin Farach-Colton

Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures.

See Order-maintenance problem and Martin Farach-Colton

Michael A. Bender

Michael A. Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games.

See Order-maintenance problem and Michael A. Bender

Persistent data structure

In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified.

See Order-maintenance problem and Persistent data structure

Total order

In mathematics, a total order or linear order is a partial order in which any two elements are comparable.

See Order-maintenance problem and Total order

Weight-balanced tree

In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences.

See Order-maintenance problem and Weight-balanced tree

Y-fast trie

In computer science, a y-fast trie is a data structure for storing integers from a bounded domain.

See Order-maintenance problem and Y-fast trie

References

[1] https://en.wikipedia.org/wiki/Order-maintenance_problem

Also known as Order maintenance.