A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Explicit construction of exponential sized families of K-independent sets
Discrete Mathematics
Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Expanders obtained from affine transformations
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Realistic analysis of some randomized algorithms
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On using deterministic functions to reduce randomness in probabilistic algorithms
Information and Computation
Efficient parallel algorithms for edge coloring problems
Journal of Algorithms
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the power of two-point based sampling
Journal of Complexity
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Deterministic simulation of probabilistic constant depth circuits
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Simulating (log/sup c/n)-wise independence in NC
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Linear time deterministic learning of k-term DNF
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Asking questions to minimize errors
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved algorithms via approximations of probability distributions (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
How many queries are needed to learn?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
How many queries are needed to learn?
Journal of the ACM (JACM)
Universal service-providers for database private information retrieval (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Essentially Every Unimodular Matrix Defines and Expander
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Exact Learning when Irrelevant Variables Abound
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficient Memory Integrity Verification and Encryption for Secure Processors
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Preference Elicitation and Query Learning
The Journal of Machine Learning Research
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pseudorandom generators for low degree polynomials
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Learning a circuit by injecting values
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Unconditional pseudorandom generators for low degree polynomials
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Small Sample Spaces Cannot Fool Low Degree Polynomials
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Learning a circuit by injecting values
Journal of Computer and System Sciences
An efficient cryptosystem Delta for stream cipher applications
Computers and Electrical Engineering
Local randomness in candidate one-way functions
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Three XOR-lemmas - an exposition
Studies in complexity and cryptography
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Succinct non-interactive arguments via linear interactive proofs
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
| Hi-index | 0.01 |