default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSagar Kale
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j1]Amit Chakrabarti
, Sagar Kale:
Submodular maximization meets streaming: matchings, matroids, and more. Math. Program. 154(1-2): 225-247 (2015)
Conference and Workshop Papers
- 2023
- [c12]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. SODA 2023: 1545-1565 - 2022
- [c11]Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale:
Fair k-Center Clustering in MapReduce and Streaming Settings. WWW 2022: 1414-1422 - 2021
- [c10]Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - 2020
- [c9]Monika Henzinger, Sagar Kale:
Fully-Dynamic Coresets. ESA 2020: 57:1-57:21 - [c8]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms Under Adversarial Injections. ICALP 2020: 56:1-56:15 - [c7]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. ICML 2020: 1877-1886 - 2019
- [c6]Sagar Kale:
Small Space Stream Summary for Matroid Center. APPROX-RANDOM 2019: 20:1-20:22 - [c5]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. PODC 2019: 491-500 - [c4]Buddhima Gamlath, Sagar Kale, Ola Svensson:
Beating Greedy for Stochastic Bipartite Matching. SODA 2019: 2841-2854 - 2017
- [c3]Sagar Kale, Sumedh Tirodkar:
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. APPROX-RANDOM 2017: 15:1-15:21 - 2016
- [c2]Amit Chakrabarti, Sagar Kale:
Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics. FOCS 2016: 41-50 - 2014
- [c1]Amit Chakrabarti, Sagar Kale:
Submodular Maximization Meets Streaming: Matchings, Matroids, and More. IPCO 2014: 210-221
Informal and Other Publications
- 2022
- [i10]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. CoRR abs/2212.03016 (2022) - 2020
- [i9]Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy:
How to Solve Fair k-Center in Massive Data Models. CoRR abs/2002.07682 (2020) - [i8]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms under Adversarial Injections. CoRR abs/2004.12667 (2020) - [i7]Monika Henzinger, Sagar Kale:
Fully-Dynamic Coresets. CoRR abs/2004.14891 (2020) - 2019
- [i6]Buddhima Gamlath, Sagar Kale, Ola Svensson:
Beating Greedy for Stochastic Bipartite Matching. CoRR abs/1909.12760 (2019) - 2018
- [i5]Sagar Kale:
Small Space Stream Summary for Matroid Center. CoRR abs/1810.06267 (2018) - [i4]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. CoRR abs/1811.02760 (2018) - 2017
- [i3]Sagar Kale, Sumedh Tirodkar, Sundar Vishwanathan:
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams. CoRR abs/1702.02559 (2017) - 2016
- [i2]Amit Chakrabarti, Sagar Kale:
Strong Fooling Sets for Multi-Player Communication with Applications to Deterministic Estimation of Stream Statistics. Electron. Colloquium Comput. Complex. TR16 (2016) - 2013
- [i1]Amit Chakrabarti, Sagar Kale:
Submodular Maximization Meets Streaming: Matchings, Matroids, and More. CoRR abs/1309.2038 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
