Sciweavers

92 search results - page 5 / 19
» Online Data Structures in External Memory
Sort
View
CCCG
2010
14 years 11 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
ICALP
2009
Springer
15 years 10 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
IPL
2002
59views more  IPL 2002»
14 years 9 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 1 days ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu