About Me

Hi, I am Yaroslav Alekseev.

I am a PhD student at Technion, working with Yuval Filmus.

My main research interests are: proof complexity, boolean function analysis and communication complexity.

My e-mail: tolstreg [at] gmail.com

My CV

Papers

• Yaroslav Alekseev, Nikita Gaevoy

  New Polynomial-depth Res(+) Lower Bounds.

  Preprint available on ECCC.

• Yaroslav Alekseev, Mika Göös, Konstantin Myasnikov, Artur Riazanov, Dmitry Sokolov

  Sampling Permutations with Cell Probes is Hard.

  STOC 2026

• Yaroslav Alekseev, Nikita Gaevoy

  Intersection Theorems: A Potential Approach to Proof Complexity Lower Bounds.

  ITCS 2026

• Aryan Agarwala, Yaroslav Alekseev, Antoine Vinciguerra

  Linear Matroid Intersection is in Catalytic Logspace.

  ITCS 2026

• Yaroslav Alekseev, Yuval Filmus

  Approximate polymorphisms of predicates.

  Preprint available on ECCC.

• Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra

  Catalytic Computing and Register Programs Beyond Log-Depth.

  MFCS 2025

• Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan

  Generalised Linial-Nisan Conjecture is False for DNFs.

  CCC 2025

• Yaroslav Alekseev, Dmitry Itsykson

  Lifting to regular resolution over parities via games.

  STOC 2025

• Yaroslav Alekseev, Dima Grigoriev, Edward Hirsch

  Tropical proof systems.

  STACS 2025

• Yaroslav Alekseev, Alexander Smal, Yuval Filmus

  Lifting Dichotomies.

  CCC 2024

• Yaroslav Alekseev, Edward A. Hirsch

  The Power of the Binary Value Principle.

  CIAC 2023

• Yaroslav Alekseev

  A Lower Bound for Polynomial Calculus with Extension Rule.

  CCC 2021 Best Student Paper.

• Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret

  Semi-algebraic proofs, IPS lower bounds and the τ-conjecture: Can a natural number be negative?

  STOC 2020