default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVineet Nair
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Chaya Ganesh
, Vineet Nair, Ashish Sharma:
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. CCS 2024: 884-898- [i17]Chaya Ganesh, Vineet Nair, Ashish Sharma:
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. IACR Cryptol. ePrint Arch. 2024: 943 (2024) - [i16]Vineet Nair, Ashish Sharma, Bhargav Thankey:
BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme. IACR Cryptol. ePrint Arch. 2024: 1825 (2024) - 2023
- [c14]Jackson A. Killian, Arpita Biswas, Lily Xu, Shresth Verma, Vineet Nair, Aparna Taneja, Aparna Hegde, Neha Madhiwalla, Paula Rodriguez Diaz, Sonja Johnson-Yu, Milind Tambe:
Robust Planning over Restless Groups: Engagement Interventions for a Large-Scale Maternal Telehealth Program. AAAI 2023: 14295-14303 - [c13]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. IJCAI 2023: 4100-4108 - 2022
- [c12]Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yilun Zhou:
Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment. AAMAS 2022: 525-533 - [c11]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. ICML 2022: 16331-16352 - [c10]Vineet Nair, Kritika Prakash, Michael Wilbur, Aparna Taneja, Corinne Namblard, Oyindamola Adeyemo, Abhishek Dubey, Abiodun Adereni, Milind Tambe, Ayan Mukhopadhyay:
ADVISER: AI-Driven Vaccination Intervention Optimiser for Increasing Vaccine Uptake in Nigeria. IJCAI 2022: 5129-5135 - [c9]Aurghya Maiti, Vineet Nair, Gaurav Sinha:
A causal bandit approach to learning good atomic interventions in presence of unobserved confounders. UAI 2022: 1328-1338 - [i15]Vineet Nair, Kritika Prakash, Michael Wilbur, Aparna Taneja, Corinne Namblard, Oyindamola Adeyemo, Abhishek Dubey, Abiodun Adereni, Milind Tambe, Ayan Mukhopadhyay:
ADVISER: AI-Driven Vaccination Intervention Optimiser for Increasing Vaccine Uptake in Nigeria. CoRR abs/2204.13663 (2022) - [i14]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. CoRR abs/2206.08542 (2022) - [i13]Vishakha Patil, Vineet Nair, Ganesh Ghalme, Arindam Khan:
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. CoRR abs/2208.09254 (2022) - 2021
- [j4]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. J. Mach. Learn. Res. 22: 174:1-174:31 (2021) - [c8]Vineet Nair, Vishakha Patil, Gaurav Sinha:
Budgeted and Non-Budgeted Causal Bandits. AISTATS 2021: 2017-2025 - [c7]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. ICML 2021: 3672-3681 - [c6]Nir Ailon, Omer Leibovitch, Vineet Nair:
Sparse linear networks with a fixed butterfly structure: theory and practice. UAI 2021: 1174-1184 - [i12]Ganesh Ghalme, Vineet Nair, Vishakha Patil, Yilun Zhou:
State-Visitation Fairness in Average-Reward MDPs. CoRR abs/2102.07120 (2021) - [i11]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. CoRR abs/2102.11592 (2021) - [i10]Aurghya Maiti, Vineet Nair, Gaurav Sinha:
Causal Bandits on General Graphs. CoRR abs/2107.02772 (2021) - 2020
- [j3]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits. ACM Trans. Comput. Theory 12(1): 2:1-2:27 (2020) - [c5]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. AAAI 2020: 5379-5386 - [c4]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. MFCS 2020: 72:1-72:16 - [i9]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. CoRR abs/2006.08272 (2020) - [i8]Nir Ailon, Omer Leibovitch, Vineet Nair:
Sparse Linear Networks with a Fixed Butterfly Structure: Theory and Practice. CoRR abs/2007.08864 (2020) - [i7]Vineet Nair, Vishakha Patil, Gaurav Sinha:
Budgeted and Non-budgeted Causal Bandits. CoRR abs/2012.07058 (2020) - [i6]Janaky Murthy, Vineet Nair, Chandan Saha:
Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Neeraj Kayal, Vineet Nair, Chandan Saha:
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. Comput. Complex. 28(4): 749-828 (2019) - [j1]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory 11(1): 2:1-2:56 (2019) - [c3]Andrew Cross, Nakull Gupta, Brandon Liu, Vineet Nair, Abhishek Kumar, Reena Kuttan, Priyanka Ivatury, Amy Chen, Kshama Lakshman, Rashmi Rodrigues, George D'Souza, Deepti Chittamuru, Raghuram Rao, Kiran Rade, Bhavin Vadera, Daksha Shah, Vinod Choudhary, Vineet Chadha, Amar Shah, Sameer Kumta, Puneet Dewan, Bruce Thomas, William Thies:
99DOTS: a low-cost approach to monitoring and improving medication adherence. ICTD 2019: 15:1-15:12 - [i5]Vishakha Patil, Ganesh Ghalme, Vineet Nair, Y. Narahari:
Achieving Fairness in the Stochastic Multi-armed Bandit Problem. CoRR abs/1907.10516 (2019) - 2018
- [i4]Neeraj Kayal, Vineet Nair, Chandan Saha:
Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c2]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. CCC 2017: 21:1-21:61 - [i3]Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of full rank Algebraic Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c1]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. STACS 2016: 46:1-46:15 - 2015
- [i2]Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i1]Arnab Bhattacharyya, Vineet Nair:
An explicit sparse recovery scheme in the L1-norm. CoRR abs/1411.2344 (2014)
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-20 23:02 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:
