default search action
Rucha Kulkarni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI 2024: 9590-9597 - [c10]Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
Approximating APS Under Submodular and XOS Valuations with Binary Marginals. AAMAS 2024: 1057-1065 - 2023
- [j1]Jugal Garg
, Pooja Kulkarni
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. ACM Trans. Algorithms 19(4): 36:1-36:25 (2023) - [c9]Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
Maximin Share Allocations for Assignment Valuations. AAMAS 2023: 2875-2876 - [i7]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. CoRR abs/2312.08504 (2023) - [i6]Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
Approximating APS under Submodular and XOS valuations with Binary Marginals. CoRR abs/2312.08509 (2023) - 2021
- [c8]Rucha Kulkarni, Ruta Mehta, Setareh Taki:
On the PTAS for Maximin Shares in an Indivisible Mixed Manna. AAAI 2021: 5523-5530 - [c7]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis
Dynamic Data-Race Detection Through the Fine-Grained Lens. CONCUR 2021: 16:1-16:23 - [c6]Pravesh Ganwani, Luv Gupta, Chirag Jain, Rucha Kulkarni, Sheetal Chaudhari:
LSB Based Audio Steganography using RSA and ChaCha20 Encryption. ICCCNT 2021: 1-6 - [c5]Rucha Kulkarni, Ruta Mehta, Setareh Taki:
Indivisible Mixed Manna: On the Computability of MMS+PO Allocations. EC 2021: 683-684 - [i5]Rucha Kulkarni, Umang Mathur, Andreas Pavlogiannis:
Dynamic Data-Race Detection through the Fine-Grained Lens. CoRR abs/2107.03569 (2021) - 2020
- [c4]Shant Boodaghians, Rucha Kulkarni, Ruta Mehta:
Smoothed Efficient Algorithms and Reductions for Network Coordination Games. ITCS 2020: 73:1-73:15 - [c3]Jugal Garg, Pooja Kulkarni, Rucha Kulkarni:
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. SODA 2020: 2673-2687 - [i4]Rucha Kulkarni, Ruta Mehta, Setareh Taki:
Approximating Maximin Shares with Mixed Manna. CoRR abs/2007.09133 (2020)
2010 – 2019
- 2019
- [i3]Jugal Garg, Pooja Kulkarni, Rucha Kulkarni:
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. CoRR abs/1912.12541 (2019) - 2018
- [c2]Rucha Kulkarni, Harshad Kulkarni, Kalpesh Balar, Praful Krishna:
Cognitive Natural Language Search Using Calibrated Quantum Mesh. ICCI*CC 2018: 174-178 - [i2]Shant Boodaghians, Rucha Kulkarni, Ruta Mehta:
Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games. CoRR abs/1809.02280 (2018) - 2017
- [i1]Xiaotie Deng, Zhe Feng, Rucha Kulkarni:
Octahedral Tucker is PPA-Complete. Electron. Colloquium Comput. Complex. TR17 (2017) - 2013
- [c1]Rucha Kulkarni, Kritika Jain, Himanshu Bansal, Srinivas Bangalore, Michael Carl
Mutual disambiguation of eye gaze and speech for sight translation and reading. GazeIn@ICMI 2013: 35-40
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-05-05 00:13 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: