Searching a two key table under a single key
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Storing and searching a multikey table
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Implicit B-trees: a new data structure for the dictionary problem
Journal of Computer and System Sciences - Special issue on FOCS 2002
Implicit dictionaries with O(1) modifications per update and fast search
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
ACM Transactions on Algorithms (TALG)
In-place 2-d nearest neighbor search
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct geometric indexes supporting point location queries
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
A Distribution-Sensitive Dictionary with Low Space Overhead
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
In-Place algorithms for computing (layers of) maxima
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Sorting stably, in-place, with O(n log n) comparisons and O(n) moves
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On compressing and indexing repetitive sequences
Theoretical Computer Science
Space-efficient data-analysis queries on grids
Theoretical Computer Science
| Hi-index | 0.01 |