Buddhima Gamlath

According to our database, Buddhima Gamlath authored at least 8 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Approximate Cluster Recovery from Noisy Labels.

Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

How to Match in Modern Computational Settings.

Buddhima Gamlath

PhD thesis, 2021

Nearly-Tight and Oblivious Algorithms for Explainable Clustering.

Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Approximating Star Cover Problems.

Buddhima Gamlath, Vadim Grinberg

Proceedings of the Approximation, 2020

2019

Beating Greedy for Stochastic Bipartite Matching.

Buddhima Gamlath, Sagar Kale, Ola Svensson

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Weighted Matchings via Unweighted Augmentations.

Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Online Matching with General Arrivals.

Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering.

Buddhima Gamlath, Sangxia Huang, Ola Svensson

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018