Sagar Kale

According to our database, Sagar Kale authored at least 13 papers between 2015 and 2023.

Collaborative distances:

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

2023

Online Min-Max Paging.

Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Fair k-Center Clustering in MapReduce and Streaming Settings.

Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

2021

Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.

Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

How to Solve Fair k-Center in Massive Data Models.

Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy

Proceedings of the 37th International Conference on Machine Learning, 2020

Robust Algorithms Under Adversarial Injections.

Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Fully-Dynamic Coresets.

Monika Henzinger, Sagar Kale

Proceedings of the 28th Annual European Symposium on Algorithms, 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

Small Space Stream Summary for Matroid Center.

Sagar Kale

Proceedings of the Approximation, 2019

2017

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

Sagar Kale, Sumedh Tirodkar, Sundar Vishwanathan

CoRR, 2017

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

Sagar Kale, Sumedh Tirodkar

Proceedings of the Approximation, 2017

2016

Strong Fooling Sets for Multi-Player Communication with Applications to Deterministic Estimation of Stream Statistics.

Amit Chakrabarti, Sagar Kale

Electron. Colloquium Comput. Complex., 2016

2015

Submodular maximization meets streaming: matchings, matroids, and more.

Amit Chakrabarti, Sagar Kale

Math. Program., 2015