Four accepts at STOC 22
The BARC team is represented yet again at the STOC conference.
We are happy to announce 4 accepted STOC papers in relation to BARC members this year. The prestigious STOC 2022 conference is the 54th Annual ACM Symposium on Theory of Computing and is being held on June 20-24, 2022 in Rome, Italy.
The 4 papers are:
Edge Sampling and Graph Parameter Estimation via Vertex Neighborhood Accesses
Jakub Tětek (Basic Algorithms Research Copenhagen, University of Copenhagen) and Mikkel Thorup (Basic Algorithms Research Copenhagen, University of Copenhagen)
An extendable data structure for incremental stable perfect hashing
Ioana Bercea (Basic Algorithms Research Copenhagen, IT University of Copenhagen) and Guy Even (Tel-Aviv University)
The Shortest Even Cycle Problem is Tractable
Andreas Björklund (Lund, Sweden), Thore Husfeldt (Lund University and Basic Algorithms Research Copenhagen, ITU Copenhagen) and Petteri Kaski (Department of Computer Science, Aalto University, Espoo, Finland)
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication
Sébastien Tavenas (Université Savoie Mont Blanc, CNRS, LAMA), Nutan Limaye (Basic Algorithms Research Copenhagen, ITU-Copenhagen) and Srikanth Srinivasan (Aarhus University)
For a full list of accepted papers for STOC 2022 click here.