Sagar Kale (pronunciation: Sāgar Kālé; Marathi: सागर काळे)

I am currently a post-doc at EPFL in Lausanne, Switzerland. Prof. Ola Svensson is my host.

I recently completed my Ph.D. from Dartmouth College and was fortunate to have Prof. Amit Chakrabarti as my advisor.

I defended my thesis titled "Finding Good Matchings in Graph Streams" in November 2017.

Email: on gmail [@AT] SGRKL4
Research area: theoretical computer science, specifically, streaming algorithms.
Masters: M. Tech. in Computer Science and Engineering at IIT Bombay, Mumbai, where my advisor was Prof. Sundar Vishwanathan.

I will be a PC member of ESA 2019.

Published Research Papers

  • Buddhima Gamlath, Sagar Kale, Slobodan Mitrović, and Ola Svensson
    Weighted Matchings via Unweighted Augmentations in PODC 2019
    arXiv link.
  • Buddhima Gamlath, Sagar Kale, and Ola Svensson
    Beating Greedy for Stochastic Bipartite Matching in SODA 2019
  • Sagar Kale, Sumedh Tirodkar
    Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams in APPROX 2017
    arXiv link; YouTube link for my talk
  • Amit Chakrabarti, Sagar Kale
    Strong Fooling Sets for Multi-Player Communication with Applications to Deterministic Estimation of Stream Statistics in FOCS 2016.
    ECCC link YouTube link for my talk
  • Amit Chakrabarti, Sagar Kale
    Submodular Maximization Meets Streaming: Matchings, Matroids, and More in IPCO 2014
    arXiv link.

Papers under submission

  • Sagar Kale
    Small Space Stream Summary for Matroid Center
    arXiv link.