Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
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
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
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Approximation algorithms and online mechanisms for item pricing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation
IEICE - Transactions on Information and Systems
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Deterministic algorithms for the Lovász Local Lemma
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |