2 search results - page 1 / 1 » Counting Inversions, Offline Orthogonal Range Counting, and ... |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...