Publications

Export 4 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is explicit constructions  [Clear All Filters]
2000
Chari S, Rohatgi P, Srinivasan A.  2000.  Improved Algorithms via Approximations of Probability Distributions. Journal of Computer and System Sciences. 61(1):81-107.
Saks M, Srinivasan A, Zhou S, Zuckerman D.  2000.  Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters. 73(1–2):29-32.
1998
Saks M, Srinivasan A, Zhou S.  1998.  Explicit OR-dispersers with polylogarithmic degree. Journal of the ACM (JACM). 45(1):123-154.
1997
Auer P, Long PM, Srinivasan A.  1997.  Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :314-323.