Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikhil Vyas 0001
Person information
- affiliation: Harvard School of Engineering and Applied Sciences, Boston, MA, USA
- affiliation (former): Massachusetts Institute of Technology, CSAIL, Cambridge, MA, USA
- affiliation (former): Indian Institue of Technology Bombay, Department of Computer Science and Engineering, India
Other persons with the same name
- Nikhil Vyas 0002 — BITS-Pilani K. K. Birla, Department of Computer Science and Information Systems, Goa, India
- Nikhil Vyas 0003 — University of Missouri, Columbia, MO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i19]Gustaf Ahdritz, Tian Qin, Nikhil Vyas, Boaz Barak, Benjamin L. Edelman:
Distinguishing the Knowable from the Unknowable with Language Models. CoRR abs/2402.03563 (2024)- 2023
- [j3]Nikhil Vyas
, R. Ryan Williams:
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. Theory Comput. Syst. 67(1): 149-177 (2023) - [c22]Nishanth Dikkala, Nikhil Ghosh, Raghu Meka, Rina Panigrahy, Nikhil Vyas, Xin Wang:
On the Benefits of Learning to Route in Mixture-of-Experts Models. EMNLP 2023: 9376-9396 - [c21]Nikhil Vyas, Sham M. Kakade, Boaz Barak:
On Provable Copyright Protection for Generative Models. ICML 2023: 35277-35299 - [c20]Nikhil Vyas, Ryan Williams:
On Oracles and Algorithmic Methods for Proving Lower Bounds. ITCS 2023: 99:1-99:26 - [c19]Nikhil Vyas, Alexander Atanasov, Blake Bordelon, Depen Morwani, Sabarish Sainathan, Cengiz Pehlevan:
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales. NeurIPS 2023 - [i18]Nikhil Vyas, Sham M. Kakade, Boaz Barak:
Provable Copyright Protection for Generative Models. CoRR abs/2302.10870 (2023) - [i17]Nikhil Vyas, Alexander Atanasov, Blake Bordelon, Depen Morwani, Sabarish Sainathan, Cengiz Pehlevan:
Feature-Learning Networks Are Consistent Across Widths At Realistic Scales. CoRR abs/2305.18411 (2023) - [i16]Nikhil Vyas, Depen Morwani, Rosie Zhao, Gal Kaplun, Sham M. Kakade, Boaz Barak:
Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learning. CoRR abs/2306.08590 (2023) - [i15]Davis Brown, Nikhil Vyas, Yamini Bansal:
On Privileged and Convergent Bases in Neural Network Representations. CoRR abs/2307.12941 (2023) - 2022
- [c18]Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, R. Ryan Williams:
On the Number of Quantifiers as a Complexity Measure. MFCS 2022: 48:1-48:14 - [i14]Nikhil Vyas, Yamini Bansal, Preetum Nakkiran:
Limitations of the NTK for Understanding Generalization in Deep Learning. CoRR abs/2206.10012 (2022) - [i13]Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, Ryan Williams:
On the Number of Quantifiers as a Complexity Measure. CoRR abs/2207.00104 (2022) - 2021
- [j2]Nikhil Vyas, R. Ryan Williams:
On Super Strong ETH. J. Artif. Intell. Res. 70: 473-495 (2021) - [c17]Mitali Bafna, Nikhil Vyas:
Optimal Fine-Grained Hardness of Approximation of Linear Equations. ICALP 2021: 20:1-20:19 - [c16]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. LICS 2021: 1-13 - [c15]Ce Jin, Nikhil Vyas, Ryan Williams:
Fast Low-Space Algorithms for Subset Sum. SODA 2021: 1757-1776 - [i12]Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. CoRR abs/2104.14709 (2021) - [i11]Mitali Bafna, Nikhil Vyas:
Optimal Fine-grained Hardness of Approximation of Linear Equations. CoRR abs/2106.13210 (2021) - 2020
- [c14]Nikhil Vyas, Ryan Williams:
Results on a Super Strong Exponential Time Hypothesis. AAAI 2020: 13700-13703 - [c13]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-Everywhere Secure Computation. EUROCRYPT (2) 2020: 159-183 - [c12]Andrea Lincoln, Nikhil Vyas:
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs. ITCS 2020: 11:1-11:17 - [c11]S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas:
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. STACS 2020: 37:1-37:18 - [c10]Nikhil Vyas, R. Ryan Williams:
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. STACS 2020: 59:1-59:17 - [i10]Nikhil Vyas, Ryan Williams:
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of $\#$SAT Algorithms. CoRR abs/2001.07788 (2020) - [i9]Ce Jin, Nikhil Vyas, Ryan Williams:
Fast Low-Space Algorithms for Subset Sum. CoRR abs/2011.03819 (2020)
2010 – 2019
- 2019
- [c9]Mitali Bafna, Nikhil Vyas:
Imperfect Gaps in Gap-ETH and PCPs. CCC 2019: 32:1-32:19 - [c8]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. ICALP 2019: 46:1-46:14 - [c7]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP 2019: 47:1-47:15 - [c6]Nikhil Vyas, R. Ryan Williams:
On Super Strong ETH. SAT 2019: 406-423 - [i8]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR abs/1904.11601 (2019) - [i7]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. CoRR abs/1904.11606 (2019) - [i6]Mitali Bafna, Nikhil Vyas:
Imperfect Gaps in Gap-ETH and PCPs. CoRR abs/1907.08185 (2019) - [i5]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2019: 156 (2019) - 2018
- [j1]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. SIAM J. Comput. 47(5): 1755-1777 (2018) - [c5]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. LICS 2018: 36-45 - [c4]Mitali Bafna, Jack Murtagh, Nikhil Vyas:
Thwarting Adversarial Examples: An L_0-Robust Sparse Fourier Transform. NeurIPS 2018: 10096-10106 - [i4]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. CoRR abs/1804.09341 (2018) - [i3]Nikhil Vyas:
Super Strong ETH is False for Random k-SAT. CoRR abs/1810.06081 (2018) - [i2]Mitali Bafna, Jack Murtagh, Nikhil Vyas:
Thwarting Adversarial Examples: An L0-RobustSparse Fourier Transform. CoRR abs/1812.05013 (2018) - 2017
- [c3]S. Akshay, Nikhil Balaji, Nikhil Vyas:
Complexity of Restricted Variants of Skolem and Related Problems. MFCS 2017: 78:1-78:14 - [c2]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster space-efficient algorithms for subset sum and k-sum. STOC 2017: 198-209 - 2016
- [c1]S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas:
On Regularity of Unary Probabilistic Automata. STACS 2016: 8:1-8:14 - [i1]Nikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas:
Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems. CoRR abs/1612.02788 (2016)
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-04-14 01:12 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:
