559 search results - page 15 / 112 » Algorithms and Data Structures for External Memory |
128
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
145
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
131
click to vote
SODA
2010
ACM
15 years 11 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 ...
215
click to vote
Book
"This book is about the fundamentals of data structures and algorithms--the basic elements from which large and complex software artifacts are built. To develop a solid unders...
122
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...