Live briefing
Everything about Predecessor problem
Query of largest element in a set less than an element
In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds that element in an order. Data structures used to solve the problem include balanced binary search trees, van Emde Boas trees, and fusion trees. In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Predecessor problemA 5-minute orientation
- Skim a recent paper: The Problem of the Quality of the Predecessor Activity on the Time and Cost of the Successor Activity in the Project Schedule - Project Schedule with Resource Constraints -Influential work since 2022
- Pick up a classic book: La PoeticaThe most-reprinted book on the subject
- Read the landmark paper: Optimal Bounds for the Predecessor Problem and Related ProblemsCited 104 times
- Go sideways: Word RAMA closely related topic
- Go sideways: Fusion treeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Optimal Bounds for the Predecessor Problem and Related Problems
Complexity of the predecessor problem in Kauffman networks
The predecessor-existence problem for k-reversible processes
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
The bit complexity of the predecessor problem
On the problem of positive predecessor density in $3n+1$ dynamics
🆕 Influential since 2022
📚 Books worth reading
La PoeticaAristotle · 1479
The works of ArchimedesArchimedes · 1897
The works of ArchimedesArchimedes · 2004
The legal dimensions of oil and gas in IraqRex J. Zedalis · 2009
The Conspirators HierarchyJohn Coleman · 1992
Ramanujan's Place in the World of MathematicsKrishnaswami Alladi · 2013
The Pentium ChroniclesRobert P. Colwell · 2005
The ethical philosophy of SidgwickFrank Herbert Hayward · 1901
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Word RAM In theoretical computer science, the word RAM (word random-access machine) model is a model of computation in which a random-access machine does arithmetic…
- Fusion tree In computer science, a fusion tree is a type of tree data structure that implements an associative array on w-bit integers on a finite universe, where…
- Integer sorting In computer science, integer sorting is the algorithmic problem of sorting a collection of data values by integer keys. Algorithms designed for integer…
- X-fast trie In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries…
- Y-fast trie In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries…
- Van Emde Boas tree A van Emde Boas tree (Dutch pronunciation: [vɑn ˈɛmdə ˈboːɑs]), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which…
- Interval union-split-find In computer science, an interval union-split-find data structure is a data structure that stores a partition of the integer interval [1,n] into intervals…
- List of data structures This is a list of well-known data structures. For a comparison of running times for a subset of this list see comparison of data structures. Boolean, true…