ɻ alejandro cassis ❦ Hi~~~ i am a last year {PhD student} at Saarland University and the Max Planck Institute for Informatics. I am lucky to be advised by Karl Bringmann. I was born and raised in La Paz, Bolivia. Some lives ago I did my bachelors degree in México.I am broadly interested in theoretical computer science;;; ~~ my research has focused mainly on theoretical and mathematical aspects of algorithm design for {strings and combinatorial optimization} problems. Here are two research highlights: 🪡🪡 In [BC'22, BC'23] we give some of the currently best-known algorithms for the classic knapsack problem. our results leverage modern algorithmic tools related to (min,+)-convolutions. 🪡🪡 In [BCFK'23] (building on [BCFN'22]) we give the best-known algorithm to estimate the edit distance between texts in a setting where we do not read the entire input (aka sublinear-time algorithms). our algorithm makes use of several sampling and property testing techniques. list of papers [🧻]: - Faster Sublinear-Time Edit Distance Karl Bringmann, Alejandro Cassis, Nick Fischer and Tomasz Kociumaka to appear in SODA 2024. pdf - Optimal Algorithms for Bounded Weighted Edit Distance Alejandro Cassis, Tomasz Kociumaka and Philip Wellnitz published in FOCS 2023. pdf - Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! Karl Bringmann, Alejandro Cassis and Nick Fischer published in FOCS 2023. pdf - Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution Karl Bringmann and Alejandro Cassis published in ESA 2023. pdf - Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime. Karl Bringmann, Alejandro Cassis, Nick Fischer and Vasileios Nakos. published in STOC 2022. pdf - Improved Sublinear-Time Edit Distance for Preprocessed Strings. Karl Bringmann, Alejandro Cassis, Nick Fischer and Vasileios Nakos. published in ICALP 2022. pdf - Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. Karl Bringmann and Alejandro Cassis. published in ICALP 2022. pdf - A Structural Investigation of the Approximability of Polynomial-Time Problems. Karl Bringmann, Alejandro Cassis, Nick Fischer and Marvin Künnemann. published in ICALP 2022. pdf - Fine-Grained Completeness for Optimization in P. Karl Bringmann, Alejandro Cassis, Nick Fischer and Marvin Künnemann. published in APPROX-RANDOM 2021. pdf (academic) news: 📢😶🌫️🕞 0?.23 ~ Accepted papers in 2023: 2 at FOCS, 1 at ESA and 1 at SODA'24 🕘 01.23 ~ Attended the Santiago 2023 Workshop in Combinatorial Optimization 🕞 04.22 ~ Co-organizing a seminar on string algorithms 🕑 09.21 ~ Teaching assistant for the course Fine-Grained Complexity Theory 🕠 07.21 ~ Co-organizer of ADFOCS: a virtual summer school on convex optimization 🕞 03.23 ~ Co-organizer of a reading group on convex optimization -- contact ✍ email pronouns: he/him -- 🌺 🖌 running line and/or (b)log 21-22, 23-> 🪸 🎐 artifacts thru time