Alejandro Cassis

According to our database, Alejandro Cassis authored at least 9 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Faster Sublinear-Time Edit Distance.

Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Optimal Algorithms for Bounded Weighted Edit Distance.

Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

Karl Bringmann, Alejandro Cassis, Nick Fischer

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution.

Karl Bringmann, Alejandro Cassis

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Almost-optimal sublinear-time edit distance in the low distance regime.

Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Improved Sublinear-Time Edit Distance for Preprocessed Strings.

Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

A Structural Investigation of the Approximability of Polynomial-Time Problems.

Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution.

Karl Bringmann, Alejandro Cassis

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Fine-Grained Completeness for Optimization in P.

Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann

Proceedings of the Approximation, 2021