5 BARC papers at FOCS'24
The 65th IEEE Symposium on Foundations of Computer Science (FOCS) 2024 is being held in Chicago, October 27 – 30, 2024, and BARC affiliates are presenting 5 exciting papers.
“Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps”
by Bernhard Haeupler (ETHZ & Carnegie Mellon University); Richard Hladík, Vaclav Rozhon (ETH Zurich); Robert Tarjan (Princeton University); Jakub Tětek (BARC, University of Copenhagen)
“Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation”
by Shyam Narayanan (MIT); Václav Rozhoň (ETH Zurich); Jakub Tětek, Mikkel Thorup (University of Copenhagen)
“Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares”
by Mikkel Abrahamsen, Jack Stade (University of Copenhagen, Denmark)
“Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis”
Ilias Diakonikolas, Sushrut Karmalkar (UW-Madison); Shuo Pang (University of Copenhagen); Aaron Potechin (UChicago)
“Minor Containment and Disjoint Paths in almost-linear time”
Tuukka Korhonen (University of Bergen and BARC); Michał Pilipczuk, Giannοs Stamoulis (University of Warsaw)
To see the full list of accepted papers with abstracts for FOCS’24, click here: https://focs.computer.org/2024/accepted-papers-with-abstracts/