On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Hardness results for neural network approximation problems
Theoretical Computer Science
Training a single sigmoidal neuron is hard
Neural Computation
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Wavelength rerouting in optical networks, or the Venetian routing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness Results for Neural Network Approximation Problems
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
On Approximate Learning by Multi-layered Feedforward Circuits
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
On the Proper Learning of Axis Parallel Concepts
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Hardness of Approximating the Closest Vector Problem with Pre-Processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the diameter of Eulerian orientations of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the hardness of approximating Max-Satisfy
Information Processing Letters
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations
Theoretical Computer Science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient and effective explanation of change in hierarchical summaries
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
A theory of learning with similarity functions
Machine Learning
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Aggregation of SVM Classifiers Using Sobolev Spaces
The Journal of Machine Learning Research
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
On the approximability of minmax (regret) network optimization problems
Information Processing Letters
A deterministic reduction for the gap minimum distance problem: [extended abstract]
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers
ACM Transactions on Computation Theory (TOCT)
Deterministic Approximation Algorithms for the Nearest Codeword Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the hardness of approximating Max-Satisfy
Information Processing Letters
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
On the relation of MIMO APP detection and SIMO maximum ratio combining
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
Reliability-based hybrid MMSE/subspace-max-log-APP MIMO detector
IEEE Communications Letters
Hardness results for homology localization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Haplotype inference on pedigrees with recombinations and mutations
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Matrix sparsification and the sparse null space problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
New results on the complexity of the max- and min-rep problems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On tree-constrained matchings and generalizations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The geometry of lattice cryptography
Foundations of security analysis and design VI
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
List Decoding Tensor Products and Interleaved Codes
SIAM Journal on Computing
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Tight approximability results for the maximum solution equation problem over Zp
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The complexity of geometric problems in high dimension
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On bounded distance decoding for general lattices
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
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices
TCC'06 Proceedings of the Third conference on Theory of Cryptography
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Sparse weighted voting classifier selection and its linear programming relaxations
Information Processing Letters
2log1-ε n hardness for the closest vector problem with preprocessing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Theoretical Computer Science
Conjugate relation between loss functions and uncertainty sets in classification problems
The Journal of Machine Learning Research
| Hi-index | 0.07 |