From affine to two-source extractors via approximate duality
Proceedings of the forty-third annual ACM symposium on Theory of computing
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Hi-index | 0.00 |