BARC has 4 accepted papers at STOC'20
Four BARC papers have been accepted at this year’s prestigious ACM Symposium on Theory of Computing, STOC 2020.
The 52nd Annual ACM Symposium on Theory of Computing will be held on June 22–26, 2020 in Chicago, IL and several BARC members will attend to present the four papers accepted:
Jacob Holm, Eva Rotenberg:
Fully-dynamic Planarity Testing in Polylogarithmic Time
https://arxiv.org/abs/1911.03449
Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
https://arxiv.org/abs/2001.10751
Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup:
Fast Hashing with Strong Concentration Bounds
https://arxiv.org/abs/1905.00369
Kai-Yuan Lai, Hsueh-I Lu, Mikkel Thorup:
Three-in-a-tree in near linear time
https://arxiv.org/abs/1909.07446