Good worst-case algorithms for inserting and deleting records in dense sequential files
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Compact deterministic distributed dictionaries (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Arithmetic Interpolation Search for Alphabet Tables
IEEE Transactions on Computers
Journal of the ACM (JACM)
On-line approximate list indexing with applications
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Consistent and compact data management in distributed storage systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Implicit B-trees: a new data structure for the dictionary problem
Journal of Computer and System Sciences - Special issue on FOCS 2002
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Concurrent cache-oblivious b-trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An in-place sorting with O(nlog n) comparisons and O(n) moves
Journal of the ACM (JACM)
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An adaptive packed-memory array
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Processing Letters
Information Processing Letters
An adaptive packed-memory array
ACM Transactions on Database Systems (TODS)
Orthogonal range searching in linear and almost-linear space
Computational Geometry: Theory and Applications
Brief announcement: new bounds for the controller problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A fast algorithm for three-dimensional layers of maxima problem
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dynamic interpolation search revisited
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A dynamic stabbing-max data structure with sub-logarithmic query time
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Tight lower bounds for the online labeling problem
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Orthogonal range searching in linear and almost-linear space
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On online labeling with polynomially many labels
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Reallocation problems in scheduling
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |