Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Locality in distributed graph algorithms
SIAM Journal on Computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Group Testing Problems with Sequences in Experimental Molecular Biology
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
ACM Transactions on Algorithms (TALG)
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |