Chi-Ning Chou

Orcid: 0000-0001-9089-2003

According to our database1, Chi-Ning Chou authored at least 27 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sketching Approximability of All Finite CSPs.
J. ACM, April, 2024

Nonlinear classification of neural manifolds with contextual information.
CoRR, 2024

2023
Probing Biological and Artificial Neural Networks with Task-dependent Neural Manifolds.
CoRR, 2023

The Computational Lens: from Quantum Physics to Neuroscience.
CoRR, 2023

2022
A superconducting nanowire-based architecture for neuromorphic computing.
Neuromorph. Comput. Eng., June, 2022

Sketching Approximability of (Weak) Monarchy Predicates.
Electron. Colloquium Comput. Complex., 2022

Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Linear Space Streaming Lower Bounds for Approximating CSPs.
Electron. Colloquium Comput. Complex., 2021

Approximability of all finite CSPs in the dynamic streaming setting.
Electron. Colloquium Comput. Complex., 2021

Classification of the streaming approximability of Boolean CSPs.
Electron. Colloquium Comput. Complex., 2021

Quantum Meets the Minimum Circuit Size Problem.
Electron. Colloquium Comput. Complex., 2021

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage.
CoRR, 2021

Limitations of Local Quantum Algorithms on Maximum Cuts of Sparse Hypergraphs and Beyond.
CoRR, 2021

Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Approximability of all finite CSPs with linear sketches.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
A General Framework for Analyzing Stochastic Dynamics in Learning Algorithms.
CoRR, 2020

Optimal Streaming Approximations for all Boolean Max-2CSPs.
CoRR, 2020

Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

ODE-Inspired Analysis for the Biological Version of Oja's Rule in Solving Streaming PCA.
Proceedings of the Conference on Learning Theory, 2020

2019
Closure Results for Polynomial Factorization.
Theory Comput., 2019

Closure of VP under taking factors: a short and simple proof.
Electron. Colloquium Comput. Complex., 2019

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

On the Algorithmic Power of Spiking Neural Networks.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Tracking the l<sub>2</sub> Norm with Constant Update Time.
Proceedings of the Approximation, 2019

2018
Some Closure Results for Polynomial Factorization and Applications.
Electron. Colloquium Comput. Complex., 2018

Personalized Difficulty Adjustment for Countering the Double-Spending Attack in Proof-of-Work Consensus Protocols.
Proceedings of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, 2018

Hardness vs Randomness for Bounded Depth Arithmetic Circuits.
Proceedings of the 33rd Computational Complexity Conference, 2018


  Loading...