Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random sampling and approximation of MAX-CSP problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Property testing in massive graphs
Handbook of massive data sets
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Machine Learning
A New Conceptual Clustering Framework
Machine Learning
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sampling from large matrices: An approach through geometric functional analysis
Journal of the ACM (JACM)
Hardness of fully dense problems
Information and Computation
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Yet another algorithm for dense max cut: go greedy
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
Proceedings of the forty-first annual ACM symposium on Theory of computing
Foundations and Trends® in Theoretical Computer Science
Optimal Incentives for Participation with Type-Dependent Externalities
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Studies in complexity and cryptography
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Sampling sub-problems of heterogeneous max-cut problems and approximation algorithms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |