The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Restructuring ordered binary trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
External memory data structures
Handbook of massive data sets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Purely functional worst case constant time catenable sorted lists
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Algorithms and theory of computation handbook
Adaptive stable marriage algorithms
Proceedings of the 48th Annual Southeast Regional Conference
On the circuit complexity of perfect hashing
Studies in complexity and cryptography
SIAM Journal on Computing
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Sequential optimization of binary search trees for multiple cost functions
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |