Beating Bellman-Ford: Faster Single-Source Shortest Paths with Negative Weights

November 07, 2024

2024   ·   algorithms     ·   fall-2024  

Speaker

Jeremy Fineman November 7, 2024.

Abstract

Professor Fineman will present a talk on his paper “Beating Bellman-Ford: Faster Single-Source Shortest Paths with Negative Weights” which received a Best Paper Award at the 2024 ACM Symposium on Theory of Computing (STOC).



Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • Limitations of Linear Cross-Entropy as a Measure of Quantum Advantage
  • Demystifying the border of depth-3 algebraic circuits
  • The Composition Complexity of Majority
  • Depth Tradeoffs for Clique and Connectivity
  • Algorithms and Barriers for Fast Matrix Multiplication