Vladimir Lysikov

Orcid: 0000-0002-7816-6524

Affiliations:
  • Ruhr University Bochum, Germany
  • University of Copenhagen, Department of Mathematical Sciences, Denmark (former)


According to our database1, Vladimir Lysikov authored at least 23 papers between 2012 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Geometric complexity theory for product-plus-power.
J. Symb. Comput., 2026

2025
Barriers for rectangular matrix multiplication.
Comput. Complex., June, 2025

Explicit non-free tensors.
CoRR, March, 2025

The moment polytope of matrix multiplication is not maximal.
CoRR, March, 2025

Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Algebraic Metacomplexity and Representation Theory.
Proceedings of the 40th Computational Complexity Conference, 2025

2024
Partial Degeneration of Tensors.
SIAM J. Matrix Anal. Appl., March, 2024

Persistent Tensors and Multiqudit Entanglement Transformation.
Quantum, January, 2024

The resource theory of tensor networks.
Quantum, 2024

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness.
CoRR, 2024

Fixed-Parameter Debordering of Waring Rank.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Homogeneous Algebraic Complexity Theory and Algebraic Formulas.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2022
Border complexity via elementary symmetric polynomials.
Electron. Colloquium Comput. Complex., 2022

Degree-Restricted Strength Decompositions and Algebraic Branching Programs.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021
On the Orbit Closure Containment Problem and Slice Rank of Tensors.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra.
CoRR, 2020

Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
On the Complexity of Hazard-free Circuits.
J. ACM, 2019

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.
CoRR, 2019

2018
Generalized Matrix Completion and Algebraic Natural Proofs.
Electron. Colloquium Comput. Complex., 2018

2017
Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective.
CoRR, 2017

2016
On Degeneration of Tensors and Algebras.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2012
On bilinear algorithms for multiplication in quaternion algebras
CoRR, 2012


  Loading...