default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnilesh Kollagunta Krishnaswamy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i10]Zeyu Shen, Anilesh K. Krishnaswamy, Janardhan Kulkarni, Kamesh Munagala:
Classification with Partially Private Features. CoRR abs/2312.07583 (2023)- 2022
- [j2]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán
, Kirankumar Shiragur:
Technical Note - Assortment Planning for Two-Sided Sequential Matching Markets. Oper. Res. 70(5): 2784-2803 (2022) - 2021
- [c10]Anilesh K. Krishnaswamy, Haoming Li, David Rein, Hanrui Zhang, Vincent Conitzer:
Classification with Strategically Withheld Data. AAAI 2021: 5514-5522 - [c9]Anilesh Kollagunta Krishnaswamy, Zhihao Jiang, Kangning Wang, Yu Cheng, Kamesh Munagala:
Fair for All: Best-effort Fairness Guarantees for Classification. AISTATS 2021: 3259-3267 - 2020
- [c8]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán, Kirankumar Shiragur:
Assortment Planning for Two-Sided Sequential Matching Markets. WINE 2020: 475 - [i9]Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto:
Knapsack Voting for Participatory Budgeting. CoRR abs/2009.06856 (2020) - [i8]Anilesh K. Krishnaswamy, Haoming Li, David Rein, Hanrui Zhang, Vincent Conitzer:
Classification with Strategically Withheld Data. CoRR abs/2012.10203 (2020) - [i7]Anilesh K. Krishnaswamy, Zhihao Jiang, Kangning Wang, Yu Cheng, Kamesh Munagala:
Fair for All: Best-effort Fairness Guarantees for Classification. CoRR abs/2012.10216 (2020)
2010 – 2019
- 2019
- [j1]Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto:
Knapsack Voting for Participatory Budgeting. ACM Trans. Economics and Comput. 7(2): 8:1-8:27 (2019) - [i6]Itai Ashlagi, Anilesh K. Krishnaswamy, Rahul Makhijani, Daniela Sabán, Kirankumar Shiragur:
Assortment planning for two-sided sequential matching markets. CoRR abs/1907.04485 (2019) - 2018
- [c7]Ashish Goel, Reyna Hulett, Anilesh K. Krishnaswamy:
Relating Metric Distortion and Fairness of Social Choice Rules. NetEcon@SIGMETRICS 2018: 4:1 - [c6]Ashish Goel, Anilesh K. Krishnaswamy:
Implementing the Lexicographic Maxmin Bargaining Solution. WINE 2018: 449-450 - [c5]Ramesh Johari, Vijay Kamble, Anilesh K. Krishnaswamy, Hannah Li:
Exploration vs. Exploitation in Team Formation. WINE 2018: 451 - [i5]Vijay Kamble, Anilesh K. Krishnaswamy, Hannah Li:
Exploration vs. Exploitation in Team Formation. CoRR abs/1809.06937 (2018) - [i4]Ashish Goel, Anilesh Kollagunta Krishnaswamy:
Implementing the Lexicographic Maxmin Bargaining Solution. CoRR abs/1810.01042 (2018) - [i3]Ashish Goel, Reyna Hulett, Anilesh Kollagunta Krishnaswamy:
Relating Metric Distortion and Fairness of Social Choice Rules. CoRR abs/1810.01092 (2018) - 2017
- [c4]Ashish Goel, Anilesh Kollagunta Krishnaswamy, Kamesh Munagala:
Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties. EC 2017: 287-304 - 2016
- [i2]Ashish Goel, Anilesh Kollagunta Krishnaswamy, Kamesh Munagala:
Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties. CoRR abs/1612.02912 (2016) - [i1]Anilesh Kollagunta Krishnaswamy, Ashish Goel, Siddhartha Banerjee:
Re-incentivizing Discovery: Mechanisms for Partial-Progress Sharing in Research. CoRR abs/1612.04485 (2016) - 2014
- [c3]Siddhartha Banerjee, Ashish Goel, Anilesh Kollagunta Krishnaswamy:
Re-incentivizing discovery: mechanisms for partial-progress sharing in research. EC 2014: 149-166 - 2013
- [c2]Sreejith T. Veetil, Kiran Kuchi, Anilesh K. Krishnaswamy, Radha Krishna Ganti:
Coverage and rate in cellular networks with multi-user spatial multiplexing. ICC 2013: 5855-5859 - 2012
- [c1]Anilesh K. Krishnaswamy, Samet Oymak, Babak Hassibi:
A simpler approach to weighted ℓ1 minimization. ICASSP 2012: 3621-3624
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-16 21:22 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:
