Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
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
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Improved distributed algorithms for coloring and network decomposition problems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast randomized algorithms for distributed edge coloring
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On construction of k-wise independent random variables
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
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating hyper-rectangles: learning and pseudo-random sets
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Parallel search for maximal independence given minimal dependence
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Higher lower bounds on monotone size
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On permutations with limited independence
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Voting paradoxes and digraphs realizations
Advances in Applied Mathematics
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
An Application of Codes to Attribute-Efficient Learning
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Almost k-wise independence versus k-wise independence
Information Processing Letters
On restricted min-wise independence of permutations
Random Structures & Algorithms
Approximating the cut-norm via Grothendieck's inequality
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Sparse Parity-Check Matrices over ${GF(q)}$
Combinatorics, Probability and Computing
Foundations of Security for Hash Chains in Ad Hoc Networks
Cluster Computing
On Delsarte's Linear Programming Bounds for Binary Codes
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast range-summable random variables for efficient aggregate estimation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
A global parallel algorithm for the hypergraph transversal problem
Information Processing Letters
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Pseudo-random number generation for sketch-based estimations
ACM Transactions on Database Systems (TODS)
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Theoretical Computer Science
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
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
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Limits and Applications of Group Algebras for Parameterized Problems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Randomized distributed algorithm for vertex coloring
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Local randomness in candidate one-way functions
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Poly-logarithmic independence fools bounded-depth boolean circuits
Communications of the ACM
On the Implementation of Huge Random Objects
SIAM Journal on Computing
Hierarchy theorems for property testing
Property testing
Hierarchy theorems for property testing
Property testing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Toward more localized local algorithms: removing assumptions concerning global knowledge
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Journal of the ACM (JACM)
On the circuit complexity of perfect hashing
Studies in complexity and cryptography
Quantum property testing for bounded-degree graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Cryptography in constant parallel time
Cryptography in constant parallel time
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
ACM Transactions on Computation Theory (TOCT)
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
Space-efficient local computation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
An improved simulated annealing algorithm for the maximum independent set problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
New streaming algorithms for counting triangles in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The Complexity of Distributions
SIAM Journal on Computing
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Randomized distributed decision
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Feedback from nature: an optimal distributed algorithm for maximal independent set selection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
Efficient computation of balanced structures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Architecting the finite element method pipeline for the GPU
Journal of Computational and Applied Mathematics
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
Information and Computation
| Hi-index | 0.08 |