default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSharmila Duppala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j1]Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu
:
Online minimum matching with uniform metric and random arrivals. Oper. Res. Lett. 50(1): 45-49 (2022)
Conference and Workshop Papers
- 2024
- [c7]Juan Luque, Sharmila Duppala, John P. Dickerson, Aravind Srinivasan:
Barter Exchange with Shared Item Valuations. WWW 2024: 199-210 - 2023
- [c6]Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual. AAAI 2023: 5624-5632 - [c5]Sharmila Duppala, Juan Luque, John P. Dickerson, Aravind Srinivasan:
Group Fairness in Set Packing Problems. IJCAI 2023: 391-399 - 2022
- [c4]Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. AAMAS 2022: 1583-1585 - [c3]Seyed A. Esmaeili, Sharmila Duppala, John P. Dickerson, Brian Brubach:
Fair Labeled Clustering. KDD 2022: 327-335 - 2020
- [c2]Zafar Ahmad, Sharmila Duppala, Rezaul Chowdhury, Steven Skiena:
Improved MapReduce Load Balancing through Distribution-Dependent Hash Function Optimization. ICPADS 2020: 9-18 - 2019
- [c1]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. SPAA 2019: 359-368
Informal and Other Publications
- 2024
- [i7]Sharmila Duppala, Juan Luque, John Dickerson, Seyed A. Esmaeili:
Robust Fair Clustering with Group Membership Uncertainty Sets. CoRR abs/2406.00599 (2024) - [i6]Juan Luque, Sharmila Duppala, John Dickerson, Aravind Srinivasan:
Barter Exchange with Shared Item Valuations. CoRR abs/2406.13983 (2024) - 2023
- [i5]Sharmila Duppala, George Z. Li, Juan Luque, Aravind Srinivasan, Renata Valieva:
Concentration of Submodular Functions Under Negative Dependence. CoRR abs/2309.05554 (2023) - 2022
- [i4]Seyed A. Esmaeili, Sharmila Duppala, Vedant Nanda, Aravind Srinivasan, John P. Dickerson:
Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual. CoRR abs/2201.06021 (2022) - [i3]Seyed A. Esmaeili, Sharmila Duppala, John P. Dickerson, Brian Brubach:
Fair Labeled Clustering. CoRR abs/2205.14358 (2022) - 2021
- [i2]Sharmila Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. CoRR abs/2112.05247 (2021) - 2019
- [i1]Rathish Das, Shih-Yu Tsai, Sharmila Duppala, Jayson Lynch, Esther M. Arkin, Rezaul Chowdhury, Joseph S. B. Mitchell, Steven Skiena:
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths. CoRR abs/1904.09283 (2019)
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 2024-10-07 22:24 CEST 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:
