default search action
Chi-Ning Chou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Chi-Ning Chou
, Alexander Golovnev
Sketching Approximability of All Finite CSPs. J. ACM 71(2): 15:1-15:74 (2024) - [i28]Francesca Mignacco, Chi-Ning Chou, SueYeon Chung:
Nonlinear classification of neural manifolds with contextual information. CoRR abs/2405.06851 (2024) - 2023
- [i27]Chi-Ning Chou:
The Computational Lens: from Quantum Physics to Neuroscience. CoRR abs/2310.20539 (2023) - [i26]Michael Kuoch, Chi-Ning Chou, Nikhil Parthasarathy, Joel Dapello, James J. DiCarlo, Haim Sompolinsky, SueYeon Chung:
Probing Biological and Artificial Neural Networks with Task-dependent Neural Manifolds. CoRR abs/2312.14285 (2023) - 2022
- [j2]Andres E. Lombo
A superconducting nanowire-based architecture for neuromorphic computing. Neuromorph. Comput. Eng. 2(2): 34011 (2022) - [c13]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy
Sketching Approximability of (Weak) Monarchy Predicates. APPROX/RANDOM 2022: 35:1-35:17 - [c12]Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi:
Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond. ICALP 2022: 41:1-41:20 - [c11]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. ITCS 2022: 47:1-47:16 - [c10]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy
Linear space streaming lower bounds for approximating CSPs. STOC 2022: 275-288 - [i25]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. CoRR abs/2205.02345 (2022) - [i24]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c9]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy
Approximability of all finite CSPs with linear sketches. FOCS 2021: 1197-1208 - [c8]Boaz Barak, Chi-Ning Chou, Xun Gao:
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits. ITCS 2021: 30:1-30:20 - [i23]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. CoRR abs/2102.12351 (2021) - [i22]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. CoRR abs/2105.01161 (2021) - [i21]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. CoRR abs/2106.13078 (2021) - [i20]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. CoRR abs/2108.03171 (2021) - [i19]Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi:
Limitations of Local Quantum Algorithms on Maximum Cuts of Sparse Hypergraphs and Beyond. CoRR abs/2108.06049 (2021) - [i18]Xun Gao, Marcin Kalinowski, Chi-Ning Chou, Mikhail D. Lukin, Boaz Barak, Soonwon Choi:
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage. CoRR abs/2112.01657 (2021) - [i17]Andres E. Lombo, Jesus E. Lares, Matteo Castellani, Chi-Ning Chou, Nancy A. Lynch, Karl K. Berggren:
A Superconducting Nanowire-based Architecture for Neuromorphic Computing. CoRR abs/2112.08928 (2021) - [i16]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - [i15]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i14]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) - [i13]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) - 2020
- [c7]Chi-Ning Chou, Mien Brabeeba Wang:
ODE-Inspired Analysis for the Biological Version of Oja's Rule in Solving Streaming PCA. COLT 2020: 1339-1343 - [c6]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy
Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat. FOCS 2020: 330-341 - [i12]Chi-Ning Chou, Alexander Golovnev, Santhoshini Velusamy:
Optimal Streaming Approximations for all Boolean Max-2CSPs. CoRR abs/2004.11796 (2020) - [i11]Boaz Barak, Chi-Ning Chou, Xun Gao:
Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits. CoRR abs/2005.02421 (2020) - [i10]Chi-Ning Chou, Juspreet Singh Sandhu, Mien Brabeeba Wang, Tiancheng Yu:
A General Framework for Analyzing Stochastic Dynamics in Learning Algorithms. CoRR abs/2006.06171 (2020)
2010 – 2019
- 2019
- [j1]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure Results for Polynomial Factorization. Theory Comput. 15: 1-34 (2019) - [c5]Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran:
Tracking the l2 Norm with Constant Update Time. APPROX-RANDOM 2019: 2:1-2:15 - [c4]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. ITCS 2019: 26:1-26:20 - [c3]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. NeurIPS 2019: 9186-9194 - [i9]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. CoRR abs/1903.02366 (2019) - [i8]Chi-Ning Chou, Mien Brabeeba Wang:
ODE-Inspired Analysis for the Biological Version of Oja's Rule in Solving Streaming PCA. CoRR abs/1911.02363 (2019) - [i7]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Hardness vs Randomness for Bounded Depth Arithmetic Circuits. CCC 2018: 13:1-13:17 - [c1]Chi-Ning Chou, Yu-Jing Lin, Ren Chen, Hsiu-Yao Chang, I-Ping Tu
Personalized Difficulty Adjustment for Countering the Double-Spending Attack in Proof-of-Work Consensus Protocols. iThings/GreenCom/CPSCom/SmartData 2018: 1456-1462 - [i6]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. CoRR abs/1803.05933 (2018) - [i5]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. CoRR abs/1803.10375 (2018) - [i4]Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng:
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs. CoRR abs/1805.02349 (2018) - [i3]Chi-Ning Chou, Yu-Jing Lin, Ren Chen, Hsiu-Yao Chang, I-Ping Tu, Shih-wei Liao:
Personalized Difficulty Adjustment for Countering the Double-Spending Attack in Proof-of-Work Consensus Protocols. CoRR abs/1807.02933 (2018) - [i2]Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran:
Tracking the 𝓁2 Norm with Constant Update Time. CoRR abs/1807.06479 (2018) - [i1]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. Electron. Colloquium Comput. Complex. TR18 (2018)
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-07 21:25 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: