Worst-case efficient priority queues
Proceedings of the seventh 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
The randomized complexity of maintaining the minimum
Nordic Journal of Computing
Journal of Functional Programming
ACM Transactions on Algorithms (TALG)
Integer representation and counting in the bit probe model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Space-efficient data-analysis queries on grids
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Colored range queries and document retrieval
Theoretical Computer Science
Space-efficient data-analysis queries on grids
Theoretical Computer Science
| Hi-index | 0.00 |