Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
On the advantage over a random assignment
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Scalable secure storage when half the system is faulty
Information and Computation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Scalable Secure Storage when Half the System Is Faulty
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Induced Matchings in Regular Graphs and Trees
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
European Journal of Combinatorics
On the advantage over a random assignment
Random Structures & Algorithms
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the hardness of approximating Max-Satisfy
Information Processing Letters
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the complexity of approximating k-set packing
Computational Complexity
Completeness in approximation classes beyond APX
Theoretical Computer Science
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed task allocation in social networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
On approximating four covering and packing problems
Journal of Computer and System Sciences
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the hardness of approximating Max-Satisfy
Information Processing Letters
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On approximating minimum infrequent and maximum frequent sets
DS'07 Proceedings of the 10th international conference on Discovery science
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Wireless sensor network's lifetime maximization problem in case of given set of covers
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On the hardness and easiness of random 4-SAT formulas
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ACM Transactions on Algorithms (TALG)
Multiagent task allocation in social networks
Autonomous Agents and Multi-Agent Systems
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |