ɻ alejandro cassis 



  Hi~~~ i'm a {PhD student} at Saarland University and the
    Max Planck Institue for Informatics. I am lucky to be advised by Karl Bringmann.

    
hi
I am interested in theoretical computer science;;;; ~~ and my research focuses (so far) in {fine grained complexity, string algorithms} Papers[🧻]: - Optimal Algorithms for Bounded Weighted Edit Distance Alejandro Cassis, Tomasz Kociumaka and Philip Wellnitz pdf - Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution Karl Bringmann and Alejandro Cassis pdf - Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! Karl Bringmann, Alejandro Cassis and Nick Fischer 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 news: 📢 01.23 ~ I 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 -- write me: email -- 🌺 🖌 running line and/or log 21-22, 23-> 🪸 🎐 artifacts thru time
bienvenido