| Algorithmic aspects of Brascamp-Lieb inequalities. | 0 | 0.34 | 2016 |
| A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums. | 0 | 0.34 | 2013 |
| Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications. | 0 | 0.34 | 2013 |
| The Social Will-Testing Game and its Solution | 0 | 0.34 | 2012 |
| Unleashing the power of Schrijver's permanental inequality with the help of the Bethe Approximation. | 18 | 1.01 | 2011 |
| How much of quantum mechanics is really needed to defy Extended Church-Turing Thesis? | 0 | 0.34 | 2011 |
| Unharnessing the power of Schrijver's permanental inequality | 3 | 0.39 | 2011 |
| A short proof, based on mixed volumes, of Liggett's theorem on the convolution of ultra-logconcave sequences | 1 | 0.37 | 2009 |
| A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels | 1 | 0.36 | 2009 |
| A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor | 4 | 0.50 | 2009 |
| On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability | 10 | 0.96 | 2009 |
| Lower bounds for partial matchings in regular bipartite graphs and applications to the monomer–dimer entropy | 6 | 0.82 | 2008 |
| Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials : One Theorem for all | 13 | 1.12 | 2008 |
| Polynomial time algorithms to approximate mixed volumes within a simply exponential factor | 0 | 0.34 | 2007 |
| Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications | 17 | 1.25 | 2006 |
| A proof of hyperbolic van der Waerden conjecture : the right generalization is the ultimate simplification | 3 | 0.64 | 2005 |
| On the complexity of mixed discriminants and related problems | 12 | 0.89 | 2005 |
| On Matrix Polynomials with Real Roots | 0 | 0.34 | 2005 |
| Classical complexity and quantum entanglement | 28 | 4.02 | 2004 |
| Combinatorial and algorithmic aspects of hyperbolic polynomials | 6 | 0.81 | 2004 |
| Classical deterministic complexity of Edmonds' Problem and quantum entanglement | 36 | 3.19 | 2003 |
| Vandermonde Matrices, NP-Completeness, and Transversal Subspaces | 3 | 0.44 | 2003 |
| Using Multirail Networks in High-Performance Clusters | 24 | 1.91 | 2003 |
| A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary | 11 | 0.98 | 2002 |
| A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces | 18 | 11.41 | 2001 |
| A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume | 11 | 1.52 | 2000 |
| A Note on VC-Dimension and Measure of Sets of Reals | 3 | 0.46 | 2000 |
| Linear Algebraic Proofs of VC-Dimension Based Inequalities | 5 | 0.56 | 1997 |
| Approximation and learning of convex superpositions | 32 | 12.74 | 1995 |
| Controlability by completions of partial upper triangular matrices | 2 | 0.91 | 1993 |
| Rate of approximation results motivated by robust neural network learning | 34 | 70.40 | 1993 |
| Averaging Approach To Nonholonomic Motion Planning | 14 | 12.59 | 1992 |
