Skip to search formSkip to main contentSkip to account menu

Order statistic tree

In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
AVL treeB-treeBest, worst and average caseComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern matching problem
2016
2016
DLRankSVM: an efficient distributed algorithm for linear RankSVM
Linear RankSVM is one of the widely used methods for learning to rank. The existing methods, such as Trust-Region Newton (TRON… 
2015
2015
GPU-accelerated parallel algorithms for linear rankSVM
Linear rankSVM is one of the widely used methods for learning to rank. The existing methods such as trust region Newton method… 
2015
2015
GPU-accelerated parallel algorithms for linear rankSVM
Linear rankSVM is one of the widely used methods for learning to rank. The existing methods such as trust region Newton method… 
2012
2012
Sampling A Large Network : How Small Can My Sample Be ?
The underlying problem we would like to investigate is that of a researcher who has developed a computationally intensive… 
2012
2012
Strong large deviations for arbitrary sequences of random variables
We establish strong large deviation results for an arbitrary sequence of random variables under some assumptions on the… 
1992
1992
Stacks, queues, and deques with order-statistic operations
Anorder-statistic deque is a deque that also supports the operationfind(k, D), wherefind(k, D) returns the item inD with rankk… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)