CodeforcesPublications:
see also: google scholar
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
Paweł Gawrychowski, Egor Gorbachev, and Tomasz Kociumaka
ESA'25
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
Itai Boneh, Egor Gorbachev, and Tomasz Kociumaka
ESA'25
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights
Egor Gorbachev and Tomasz Kociumaka
STOC'25
arXiv pdf | arXiv abs | Conference version | Slides | Video
A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
Karl Bringmann and Egor Gorbachev
STOC'25
arXiv pdf | arXiv abs | Conference version | Slides | Video
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
Education:
- March 2024 – present:
Ph.D. student in Computer Science Saarland University (March 2024 – December 2025) → ETH Zürich (January 2026 – present) (Supervisor: Prof. Karl Bringmann) - October 2022 – October 2025:
M.Sc. in Computer Science at Saarland University, Saarbrücken, Germany
Title of Master's Thesis: Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4 (Supervisor: Prof. Marvin Künnemann) - 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)