 |
Sergey Pupyrevspupyrev @ gmail
algorithms
graph theory
compilers
|
|
I am a scientist working on applied research problems. I am interested in combinatorial optimization, algorithmic graph theory, computational geometry, and their applications to AI and compilers. My current work focuses on developing algorithmic solutions for improving the efficiency of AI infrastructure and compiler optimizations. Prior to joining industry, I spent several years working on algorithmic graph theory and computational geometry at the University of Arizona (Tucson, USA), Microsoft Research (Redmond, USA), and the Ural State University (Ekaterinburg, Russia), where I received a PhD in Computer Science. I am particularly excited about linear layouts of graphs, which have applications in graph drawing, data compression, compiler optimization, distributed computation, and many other areas. |
News
- Oct 2024 - Two new papers: The Price of Upwardness (GD'24) and Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs (pre-print).
- June 2024 - My submission for the for the PACE 2024 challenge. It came third🥉on the exact track, second🥈on the heuristic track, and got the maximum score on the parameterized track. Here is a short description of the solver
- May 2024 - A new paper on Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up at ACM TECS
- January 2024 - A paper on Stale Profile Matching at Compiler Construction (CC'24)
- December 2023 - My first sub-3h marathon at California International Marathon. Next goal is sub-2:50
- October 2023 - A paper on Matching Algorithms for Blood Donation on optimizing blood donations in Nature MI
- October 2021 - A new paper Profile Inference Revisited accepted at POPL. Here is a teaser of the talk
- April 2020 - A paper resolving a thirty-year-old problem on book embeddings: Four Pages Are Indeed Necessary for Planar Graphs