2 search results - page 1 / 1 » Counting Inversions, Offline Orthogonal Range Counting, and ... |
114
Voted
SODA
2010
ACM
15 years 10 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 ...
104
click to vote
COMPGEOM
2009
ACM
15 years 7 months 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 ...