Iacono's working set structure, the Glossary

Table of Contents

1. 9 relations: Amortized analysis, Associative array, Big O notation, Double-ended queue, John Iacono, Journal of the ACM, Red–black tree, Self-balancing binary search tree, Splay tree.

Amortized analysis

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.

See Iacono's working set structure and Amortized analysis

Associative array

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection.

See Iacono's working set structure and Associative array

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 Iacono's working set structure and Big O notation

Double-ended queue

In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).

See Iacono's working set structure and Double-ended queue

John Iacono

John Iacono is an American computer scientist specializing in data structures, algorithms and computational geometry.

See Iacono's working set structure and John Iacono

Journal of the ACM

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

See Iacono's working set structure and Journal of the ACM

Red–black tree

In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information.

See Iacono's working set structure and Red–black tree

Self-balancing binary search tree

In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. Iacono's working set structure and self-balancing binary search tree are trees (data structures).

See Iacono's working set structure and Self-balancing binary search tree

Splay tree

A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again.

See Iacono's working set structure and Splay tree

References

[1] https://en.wikipedia.org/wiki/Iacono's_working_set_structure