Vladimir Lysikov

Vladimir Lysikov

Postdoc

Member of:

    ORCID: 0000-0002-7816-6524

    Publication year:
    All
    1 - 9 out of 9Page size: 10
    1. 2020
    2. Published

      Slice rank of block tensors and irreversibility of structure tensors of algebras

      Bläser, M. & Lysikov, Vladimir, 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J., Kral�, D. & Kral�, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 17. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 170).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    3. 2019

    4. On the complexity of hazard-free circuits

      Ikenmeyer, C., Komarath, B., Lenzen, C., Lysikov, Vladimir, Mokhov, A. & Sreenivasaiah, K., Aug 2019, In : Journal of the ACM. 66, 4, 25.

      Research output: Contribution to journal › Journal article › Research › peer-review

    5. Strassen’s 2 × 2 matrix multiplication algorithm: a conceptual perspective

      Ikenmeyer, C. & Lysikov, Vladimir, 1 Nov 2019, In : Annali dell'Universita di Ferrara. 65, 2, p. 241-248 8 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    6. On Symmetries of Tensor Decompositions for the Commutator of 2 × 2 Matrices

      Lysikov, Vladimir & Chokaev, B. V., 15 Jan 2019, In : Computational Mathematics and Modeling. 30, 1, p. 48-54 7 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    7. 2018

    8. Generalized matrix completion and algebraic natural proofs

      Bläser, M., Jindal, G., Ikenmeyer, C. & Lysikov, Vladimir, 20 Jun 2018, STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. New York: Association for Computing Machinery, p. 17-29 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    9. On the complexity of hazard-Free circuits

      Ikenmeyer, C., Lysikov, Vladimir, Komarath, B., Mokhov, A., Lenzen, C. & Sreenivasaiah, K., 20 Jun 2018, STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. New York: Association for Computing Machinery, p. 253-266 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    10. 2016

    11. On degeneration of tensors and Algebras

      Bläser, M. & Lysikov, Vladimir, 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Saarbrücken/Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 58).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    12. 2013

    13. On bilinear algorithms over fields of different characteristics

      Lysikov, Vladimir, 31 Dec 2013, In : Moscow University Computational Mathematics and Cybernetics. 37, 4, p. 189-194 6 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    14. 2012

    15. On bilinear algorithms for multiplication in quaternion algebras

      Lysikov, Vladimir, 2012.

      Research output: Contribution to conference › Conference abstract for conference › Research

    ID: 219342530