| Submodular maximization meets streaming: matchings, matroids, and more A Chakrabarti, S Kale Mathematical Programming 154, 225-247, 2015 | 161 | 2015 |
| Weighted matchings via unweighted augmentations B Gamlath, S Kale, S Mitrovic, O Svensson Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 84 | 2019 |
| Beating greedy for stochastic bipartite matching B Gamlath, S Kale, O Svensson Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 52 | 2019 |
| How to solve fair k-center in massive data models A Chiplunkar, S Kale, SN Ramamoorthy International Conference on Machine Learning, 1877-1886, 2020 | 46 | 2020 |
| Maximum matching in two, three, and a few more passes over graph streams S Kale, S Tirodkar arXiv preprint arXiv:1702.02559, 2017 | 43 | 2017 |
| Fully-dynamic coresets M Henzinger, S Kale arXiv preprint arXiv:2004.14891, 2020 | 37 | 2020 |
| Small space stream summary for matroid center S Kale arXiv preprint arXiv:1810.06267, 2018 | 17 | 2018 |
| Fair k-center clustering in MapReduce and streaming settings SK Bera, S Das, S Galhotra, SS Kale Proceedings of the ACM Web Conference 2022, 1414-1422, 2022 | 16 | 2022 |
| Strong fooling sets for multi-player communication with applications to deterministic estimation of stream statistics A Chakrabarti, S Kale 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 41-50, 2016 | 13 | 2016 |
| Robust algorithms under adversarial injections P Garg, S Kale, L Rohwedder, O Svensson arXiv preprint arXiv:2004.12667, 2020 | 6 | 2020 |
| Online min-max paging A Chiplunkar, M Henzinger, S Sudhir Kale, M Vötsch Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 3 | 2023 |
| Faster algorithms for bounded liveness in graphs and game graphs K Chatterjee, M Henzinger, S Kale, A Svozil | 3 | 2021 |
| Eigenvalues and mixing time S Kale University of Darthmouth, 2013 | 3 | 2013 |
| Maximum Matching in Two Passes, Three Passes, and a Few More Passes Over Graph Streams S Kale, S Tirodkar, S Vishwanathan arXiv preprint arXiv:1702.02559, 2017 | 1 | 2017 |
| Fair k-Center Clustering in MapReduce and Streaming S Bera, S Das, S Galhotra, S Kale | | 2022 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019) V Fernández, CN Chou, Z Lei, P Nakkiran, B Moseley, M Sviridenko, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |
| Finding good matchings in graph streams S Kale Dartmouth College, 2017 | | 2017 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) I Ashlagi, Y Azar, M Charikar, A Chiplunkar, O Geri, H Kaplan, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2014 | | 2014 |
Ola SvenssonEPFLVerified email at epfl.ch
