| 2008 |
|---|
| 24 | EE | Shmuel Friedland,
Leonid Gurvits:
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy.
Combinatorics, Probability & Computing 17(3): 347-361 (2008) |
| 2007 |
|---|
| 23 | EE | Leonid Gurvits:
Polynomial time algorithms to approximate mixed volumes within a simply exponential factor
CoRR abs/cs/0702013: (2007) |
| 22 | EE | Leonid Gurvits:
Polynomial time algorithms to approximate mixed volumes within a simply exponential factor.
Electronic Colloquium on Computational Complexity (ECCC) 14(037): (2007) |
| 2006 |
|---|
| 21 | EE | Leonid Gurvits:
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications.
STOC 2006: 417-426 |
| 20 | EE | Leonid Gurvits:
Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures : \\ Sharper Bounds , Simpler Proofs and Algorithmic Applications.
Electronic Colloquium on Computational Complexity (ECCC) 13(025): (2006) |
| 2005 |
|---|
| 19 | EE | Leonid Gurvits:
On the Complexity of Mixed Discriminants and Related Problems.
MFCS 2005: 447-458 |
| 18 | EE | Leonid Gurvits:
A proof of hyperbolic van der Waerden conjecture : the right generalization is the ultimate simplification
Electronic Colloquium on Computational Complexity (ECCC)(103): (2005) |
| 2004 |
|---|
| 17 | EE | Leonid Gurvits:
Combinatorial and algorithmic aspects of hyperbolic polynomials
Electronic Colloquium on Computational Complexity (ECCC)(070): (2004) |
| 16 | EE | Leonid Gurvits:
Classical complexity and quantum entanglement.
J. Comput. Syst. Sci. 69(3): 448-484 (2004) |
| 2003 |
|---|
| 15 | EE | Leonid Gurvits:
Classical deterministic complexity of Edmonds' Problem and quantum entanglement.
STOC 2003: 10-19 |
| 14 | | Salvador Coll,
Eitan Frachtenberg,
Fabrizio Petrini,
Adolfy Hoisie,
Leonid Gurvits:
Using multirail networks in high-performance clusters.
Concurrency and Computation: Practice and Experience 15(7-8): 625-651 (2003) |
| 13 | EE | Alexander L. Chistov,
Hervé Fournier,
Leonid Gurvits,
Pascal Koiran:
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces.
Foundations of Computational Mathematics 3(4): 421-427 (2003) |
| 2002 |
|---|
| 12 | EE | Leonid Gurvits,
Alex Samorodnitsky:
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary.
Discrete & Computational Geometry 27(4): 531-550 (2002) |
| 2001 |
|---|
| 11 | EE | Salvador Coll,
Eitan Frachtenberg,
Fabrizio Petrini,
Adolfy Hoisie,
Leonid Gurvits:
Using Multirail Networks in High-Performance Clusters.
CLUSTER 2001: 15- |
| 10 | EE | Leonid Gurvits:
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces.
Theor. Comput. Sci. 261(1): 81-90 (2001) |
| 2000 |
|---|
| 9 | EE | Leonid Gurvits,
Alex Samorodnitsky:
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume.
STOC 2000: 48-57 |
| 8 | | Shai Ben-David,
Leonid Gurvits:
A Note On Vc-Dimension And Measure Of Sets Of Reals.
Combinatorics, Probability & Computing 9(5): (2000) |
| 1997 |
|---|
| 7 | | Leonid Gurvits:
A Note on a Scale-Sensitive Dimension of Linear Bounded Functionals in Banach Spaces.
ALT 1997: 352-363 |
| 6 | | Leonid Gurvits:
Linear Algebraic Proofs of VC-Dimension Based Inequalities.
EuroCOLT 1997: 238-250 |
| 5 | | Leonid Gurvits,
Pascal Koiran:
Approximation and Learning of Convex Superpositions.
J. Comput. Syst. Sci. 55(1): 161-170 (1997) |
| 1995 |
|---|
| 4 | EE | Shai Ben-David,
Leonid Gurvits:
A Note on VC-Dimension and Measures of Sets of Reals.
COLT 1995: 454-462 |
| 3 | | Leonid Gurvits,
Pascal Koiran:
Approximation and learning of convex superpositions.
EuroCOLT 1995: 222-236 |
| 1994 |
|---|
| 2 | | Chris Fernandes,
Leonid Gurvits,
Zexiang Li:
Attitude Control of a Space Platform/Manipulator System Using Internal Motion.
I. J. Robotic Res. 13(4): 289-304 (1994) |
| 1993 |
|---|
| 1 | EE | Christian Darken,
Michael Donahue,
Leonid Gurvits,
Eduardo D. Sontag:
Rate of Approximation Results Motivated by Robust Neural Network Learning.
COLT 1993: 303-309 |
