Searching for authors named "Marius Zimand" – sorted by Relevance.
28 documents found, showing 1 through 10.
Next 10 →
-
EXPOSURE-RESILIENT EXTRACTORS AND THE DERANDOMIZATION OF PROBABILISTIC SUBLINEAR TIME ALGORITHMS
- … Marius Zimand Abstract. There exists a positive constant α < 1 such that for any function T (n) ≤ n α…
- Add To MetaCart
-
Large sets in AC^0 Have Many Strings with High Kolmogorov Complexity
- …Large sets in AC 0 have many strings with low Kolmogorov complexity Marius Zimand School…
- Add To MetaCart
-
Large sets in AC 0 : a Kolmogorov complexity related property and some applications
- …Large sets in AC 0 : a Kolmogorov complexity related property and some applications Marius…
- Add To MetaCart
-
Exposure-resilient extractors
- …Exposure-resilient extractors Marius Zimand ∗ March 10, 2006 Abstract An exposure…
- Cited by 2 (1 self) – Add To MetaCart
-
On derandomizing probabilistic sublinear-time algorithms
- …ON DERANDOMIZING PROBABILISTIC SUBLINEAR TIME ALGORITHMS Marius Zimand Abstract. There exists a…
- Cited by 1 (0 self) – Add To MetaCart
-
Sampling Under Adverse Conditions With Applications to Distributed Computing
- …Sampling under adverse conditions with applications to distributed computing Marius Zimand 1…
- Cited by 2 (2 self) – Add To MetaCart
-
How to Privatize Random Bits
- …How to Privatize Random Bits Marius Zimand The University of Rochester Computer Science Department…
- Cited by 4 (3 self) – Add To MetaCart
-
On the Size of Classes with Weak Membership Properties
- …On the Size of Classes with Weak Membership Properties Marius Zimand School of Computer…
- Cited by 2 (2 self) – Add To MetaCart
-
Efficient Privatization of Random Bits
- …Efficient Privatization of Random Bits Marius Zimand School of Computer & Applied Sciences…
- Cited by 1 (1 self) – Add To MetaCart
-
On Randomized Cryptographic Primitives
- …On randomized cryptographic primitives Marius Zimand Department of Computer Science University…
- Cited by 3 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
