Skip to main content Skip to navigation

Computer Science News

Show all news items

Six papers accepted to the 32nd SODA conference

We are pleased to report that members of the department's Theory and Foundations research theme have had 6 papers accepted to the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA is the top international conference on algorithms research. The papers are:

  • "A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy" by Marcel Dall'Agnol, Tom Gur, Oded Lachish;
  • "On a combinatorial generation problem of Knuth" by Arturo Merino, Ondřej Mička, Torsten Mutze;
  • "Dynamic Set Cover: Improved Amortized and Worst-Case Update Times" by Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu;
  • "Online Edge Coloring Algorithms via the Nibble Method" by Sayan Bhattacharya, Fabrizio Grandoni, David Wajc;
  • "FPT Approximation for FPT Problems" by Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi.
  • "Polyhedral value iteration for discounted games and energy games" - Alexander Kozachinskiy
Fri 09 Oct 2020, 20:53 | Tags: Research Theory and Foundations