default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanthoshini Velusamy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. Comput. Complex. 33(1): 6 (2024)- [j2]Chi-Ning Chou
, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of All Finite CSPs. J. ACM 71(2): 15:1-15:74 (2024) - [c14]Sara Ahmadian, Sreenivas Gollapudi, Kostas Kollias, Vivek Kumar, Ameya Velingker, Santhoshini Velusamy:
Efficient Location Sampling Algorithms for Road Networks. WWW (Companion Volume) 2024: 899-902 - [i22]Samuel Hwang, Noah G. Singer, Santhoshini Velusamy:
Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds. CoRR abs/2411.12976 (2024) - [i21]Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming Algorithms via Local Algorithms for Maximum Directed Cut. CoRR abs/2411.18829 (2024) - 2023
- [c13]Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. FOCS 2023: 855-870 - [c12]Raghuvansh R. Saxena, Santhoshini Velusamy, S. Matthew Weinberg:
An Improved Lower Bound for Matroid Intersection Prophet Inequalities. ITCS 2023: 95:1-95:20 - [c11]Pranay Gorantla, Kunal Marwaha, Santhoshini Velusamy:
Fair allocation of a multiset of indivisible items. SODA 2023: 304-331 - [c10]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. SODA 2023: 4083-4103 - 2022
- [j1]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Multi-Item Nontruthful Auctions Achieve Good Revenue. SIAM J. Comput. 51(6): 1796-1838 (2022) - [c9]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. APPROX/RANDOM 2022: 35:1-35:17 - [c8]Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy:
On Sketching Approximations for Symmetric Boolean CSPs. APPROX/RANDOM 2022: 38:1-38:23 - [c7]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear space streaming lower bounds for approximating CSPs. STOC 2022: 275-288 - [i20]Pranay Gorantla, Kunal Marwaha, Santhoshini Velusamy:
Fair allocation of a multiset of indivisible items. CoRR abs/2202.05186 (2022) - [i19]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. CoRR abs/2205.02345 (2022) - [i18]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. CoRR abs/2207.07158 (2022) - [i17]Raghuvansh R. Saxena, Santhoshini Velusamy, S. Matthew Weinberg:
An Improved Lower Bound for Matroid Intersection Prophet Inequalities. CoRR abs/2209.05614 (2022) - [i16]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming beyond sketching for Maximum Directed Cut. CoRR abs/2211.03916 (2022) - [i15]Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy:
On sketching approximations for symmetric Boolean CSPs. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. Electron. Colloquium Comput. Complex. TR22 (2022) - [i13]Raghuvansh Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. Electron. Colloquium Comput. Complex. TR22 (2022) - [i12]Raghuvansh Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming beyond sketching for Maximum Directed Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming Approximation Resistance of Every Ordering CSP. APPROX-RANDOM 2021: 17:1-17:19 - [c5]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs with linear sketches. FOCS 2021: 1197-1208 - [i11]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. CoRR abs/2102.12351 (2021) - [i10]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. CoRR abs/2105.01161 (2021) - [i9]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. CoRR abs/2105.01782 (2021) - [i8]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. CoRR abs/2106.13078 (2021) - [i7]Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy:
Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs. CoRR abs/2112.06319 (2021) - [i6]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i5]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. Electron. Colloquium Comput. Complex. TR21 (2021) - [i4]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i3]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c4]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy:
Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat. FOCS 2020: 330-341 - [c3]Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy:
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. MFCS 2020: 28:1-28:12 - [c2]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Simple, Credible, and Approximately-Optimal Auctions. EC 2020: 713 - [i2]Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, Santhoshini Velusamy:
Simple, Credible, and Approximately-Optimal Auctions. CoRR abs/2002.06702 (2020) - [i1]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy:
Optimal Streaming Approximations for all Boolean Max-2CSPs. CoRR abs/2004.11796 (2020)
2010 – 2019
- 2017
- [c1]Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy:
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. APPROX-RANDOM 2017: 8:1-8:19
Coauthor Index
aka: Noah G. Singer
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-04 03:15 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:
