Publications:

see also: google scholar

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications

Paweł Gawrychowski, Egor Gorbachev, and Tomasz Kociumaka

ESA'25

arXiv version

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds

Itai Boneh, Egor Gorbachev, and Tomasz Kociumaka

ESA'25

arXiv version

Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions \(d \ge 4\)

Egor Gorbachev and Marvin Künnemann

SoCG'23

arXiv version | Conference version | Slides



Education:

  • March 2024 – present:
    Ph.D. student in Computer Science at Saarland University, Saarbrücken, Germany (supervisor: Prof. Karl Bringmann)
  • October 2022 – March 2024:
    Preparatory phase Ph.D. student in Computer Science at Saarland University, Saarbrücken, Germany
  • September 2018 – July 2022:
    B.Sc. in Computer Science at Saint Petersburg State University
    Title of Bachelor's Thesis: Improving Time Complexities of Segment Tree Beats Algorithms (supervisor: Prof. Alexander S. Kulikov)