2498 search results - page 219 / 500 » Data Structures with Unpredictable Timing |
161
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
148
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
118
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
132
click to vote
SODA
2010
ACM
15 years 12 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 ...
130
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...