More success for Algorithms group as papers accepted at STOC 2023
Dr Sagnik Mukhopadhyay has had two papers accepted for the influential ACM Symposium on Theory of Computing (STOC 2023), which will be held in Florida, USA in June:
1. Finding a Small Vertex Cut on Distributed Networks, with coauthor Y. Jiang
2. Fast Algorithms via Dynamic-Oracle Matroids, with coauthors J. Blikstad, D. Nanongkai, and T. Tu
The first paper designs an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model which is a popular distributed model for computation over networks with bandwidth restrictions. The second paper initiates the study of matroid problems in a new oracle model called the dynamic oracle that will help in the design of fast and unified algorithms in the future.
Dr Sagnik Mukhopadhyay, a Lecturer in Algorithms in the Department of Computer Science, said: “I’m very pleased to have had two papers accepted at a conference that is among the most selective and prestigious in the field of theoretical computer science research.
“This recognition from the theory community acts to further establish our growing Algorithms research group as a significant player internationally.”
STOC, along with its IEEE counterpart FOCS (the Symposium on Foundations of Computer Science), are widely recognised to be the top two conferences in theoretical computer science.
This latest success comes after the Algorithms research group had three papers accepted at the most recent FOCS conference.
The University’s four flagship institutes bring together our key strengths to tackle global issues, turning interdisciplinary and translational research into real-world solutions.