We stand with Ukraine  

Dmitriy Kunisky

Orcid: 0000-0002-0854-4067

According to our database1, Dmitriy Kunisky authored at least 19 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Spectrum of the Grigoriev-Laurent Pseudomoments.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Cristopher Moore
SIAM J. Discret. Math., March, 2024

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing.
[BibTeX]
[DOI]
Dmitriy Kunisky
CoRR, 2024

Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation.
[BibTeX]
[DOI]
Dmitriy Kunisky
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant.
[BibTeX]
[DOI]
Dmitriy Kunisky
SIAM J. Discret. Math., June, 2023

Linear Programming and Community Detection.
[BibTeX]
[DOI]
Alberto Del Pia
,
Aida Khajavirad
,
Dmitriy Kunisky
Math. Oper. Res., May, 2023

Fitting an ellipsoid to random points: predictions using the replica method.
[BibTeX]
[DOI]
Antoine Maillard
,
Dmitriy Kunisky
CoRR, 2023

Online Algorithms and Lower Bounds for Average-Case Matrix Discrepancy.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Peiyuan Zhang
CoRR, 2023

Generic MANOVA limit theorems for products of projections.
[BibTeX]
[DOI]
Dmitriy Kunisky
CoRR, 2023

A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Xifan Yu
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Strong recovery of geometric planted matchings.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Jonathan Niles-Weed
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
The Average-Case Time Complexity of Certifying the Restricted Isometry Property.
[BibTeX]
[DOI]
Yunzi Ding
,
Dmitriy Kunisky
,
Alexander S. Wein
,
Afonso S. Bandeira
IEEE Trans. Inf. Theory, 2021

A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Afonso S. Bandeira
Math. Program., 2021

Average-Case Integrality Gap for Non-Negative Principal Component Analysis.
[BibTeX]
[DOI]
Afonso S. Bandeira
,
Dmitriy Kunisky
,
Alexander S. Wein
Proceedings of the Mathematical and Scientific Machine Learning, 2021

Hypothesis testing with low-degree polynomials in the Morris class of exponential families.
[BibTeX]
[DOI]
Dmitriy Kunisky
Proceedings of the Conference on Learning Theory, 2021

Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs.
[BibTeX]
[DOI]
Afonso S. Bandeira
,
Jess Banks
,
Dmitriy Kunisky
,
Cristopher Moore
,
Alexander S. Wein
Proceedings of the Conference on Learning Theory, 2021

2020
Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube.
[BibTeX]
[DOI]
Dmitriy Kunisky
CoRR, 2020

Computational Hardness of Certifying Bounds on Constrained PCA Problems.
[BibTeX]
[DOI]
Afonso S. Bandeira
,
Dmitriy Kunisky
,
Alexander S. Wein
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio.
[BibTeX]
[DOI]
Dmitriy Kunisky
,
Alexander S. Wein
,
Afonso S. Bandeira
CoRR, 2019

Subexponential-Time Algorithms for Sparse PCA.
[BibTeX]
[DOI]
Yunzi Ding
,
Dmitriy Kunisky
,
Alexander S. Wein
,
Afonso S. Bandeira
CoRR, 2019


  Loading...