![]() | ![]() |
2008 | ||
---|---|---|
7 | EE | Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation. Discrete Applied Mathematics 156(11): 2070-2078 (2008) |
2007 | ||
6 | EE | Sergey P. Tarasov, Mikhail N. Vyalyi: An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity. CSR 2007: 397-406 |
2005 | ||
5 | EE | Sergey P. Tarasov, Mikhail N. Vyalyi: Semidefinite programming and arithmetic circuit evaluation CoRR abs/cs/0512035: (2005) |
2002 | ||
4 | EE | Sergey P. Tarasov: A sufficient condition for global invertibility of Lipschitz mapping CoRR cs.NA/0206031: (2002) |
1998 | ||
3 | EE | Sergey P. Tarasov, Michael N. Vyalyi: Construction of Contour Trees in 3D in O(n log n) Steps. Symposium on Computational Geometry 1998: 68-75 |
1997 | ||
2 | Sergey P. Tarasov: On hardness of roundness calculation. CCCG 1997 | |
1 | EE | Sergey P. Tarasov, Michael N. Vyalyi: Some PL Functions on Surfaces are not Height Functions. Symposium on Computational Geometry 1997: 113-118 |
1 | Mikhail N. Vyalyi (Michael N. Vyalyi) | [1] [3] [5] [6] [7] |