default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitriy Kunisky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Subexponential-Time Algorithms for Sparse PCA. Found. Comput. Math. 24(3): 865-914 (2024)- [j6]Dmitriy Kunisky
, Cristopher Moore:
The Spectrum of the Grigoriev-Laurent Pseudomoments. SIAM J. Discret. Math. 38(1): 103-131 (2024) - [j5]Antoine Maillard, Dmitriy Kunisky:
Fitting an Ellipsoid to Random Points: Predictions Using the Replica Method. IEEE Trans. Inf. Theory 70(10): 7273-7296 (2024) - [c9]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor Cumulants for Statistical Inference on Invariant Distributions. FOCS 2024: 1007-1026 - [c8]Dmitriy Kunisky, Xifan Yu:
Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular Graphs. FOCS 2024: 1621-1633 - [c7]Dmitriy Kunisky:
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation. SODA 2024: 5013-5028 - [i24]Dmitriy Kunisky:
Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing. CoRR abs/2403.07862 (2024) - [i23]Dmitriy Kunisky, Xifan Yu:
Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs. CoRR abs/2404.17012 (2024) - [i22]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor cumulants for statistical inference on invariant distributions. CoRR abs/2404.18735 (2024) - [i21]Anastasia Kireeva, Afonso S. Bandeira, Dmitriy Kunisky:
Computational lower bounds for multi-frequency group synchronization. CoRR abs/2406.03424 (2024) - [i20]Dmitriy Kunisky, Daniel A. Spielman, Xifan Yu:
Inference of rankings planted in random tournaments. CoRR abs/2407.16597 (2024) - [i19]Alex Albors, Hisham Bhatti, Lukshya Ganjoo, Raymond Guo, Dmitriy Kunisky, Rohan Mukherjee, Alicia Stepin, Tony Zeng:
On the Structure of Bad Science Matrices. CoRR abs/2408.00933 (2024) - 2023
- [j4]Alberto Del Pia, Aida Khajavirad, Dmitriy Kunisky:
Linear Programming and Community Detection. Math. Oper. Res. 48(2): 885-913 (2023) - [j3]Dmitriy Kunisky:
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant. SIAM J. Discret. Math. 37(2): 586-603 (2023) - [c6]Dmitriy Kunisky, Xifan Yu:
A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. CCC 2023: 30:1-30:25 - [i18]Dmitriy Kunisky:
Generic MANOVA limit theorems for products of projections. CoRR abs/2301.09543 (2023) - [i17]Dmitriy Kunisky, Peiyuan Zhang:
Online Algorithms and Lower Bounds for Average-Case Matrix Discrepancy. CoRR abs/2307.10055 (2023) - [i16]Dmitriy Kunisky:
Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation. CoRR abs/2307.12581 (2023) - [i15]Antoine Maillard, Dmitriy Kunisky:
Fitting an ellipsoid to random points: predictions using the replica method. CoRR abs/2310.01169 (2023) - 2022
- [c5]Dmitriy Kunisky, Jonathan Niles-Weed:
Strong recovery of geometric planted matchings. SODA 2022: 834-876 - [i14]Dmitriy Kunisky, Cristopher Moore:
The spectrum of the Grigoriev-Laurent pseudomoments. CoRR abs/2203.05693 (2022) - [i13]Dmitriy Kunisky, Xifan Yu:
A degree 4 sum-of-squares lower bound for the clique number of the Paley graph. CoRR abs/2211.02713 (2022) - 2021
- [j2]Dmitriy Kunisky, Afonso S. Bandeira:
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian. Math. Program. 190(1): 721-759 (2021) - [j1]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. IEEE Trans. Inf. Theory 67(11): 7355-7361 (2021) - [c4]Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. COLT 2021: 410-473 - [c3]Dmitriy Kunisky:
Hypothesis testing with low-degree polynomials in the Morris class of exponential families. COLT 2021: 2822-2848 - [c2]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. MSML 2021: 153-171 - [i12]Dmitriy Kunisky, Jonathan Niles-Weed:
Strong recovery of geometric planted matchings. CoRR abs/2107.05567 (2021) - [i11]Dmitriy Kunisky:
The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant. CoRR abs/2111.02974 (2021) - 2020
- [c1]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. ITCS 2020: 78:1-78:29 - [i10]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. CoRR abs/2005.11270 (2020) - [i9]Alberto Del Pia, Aida Khajavirad, Dmitriy Kunisky:
Linear Programming and Community Detection. CoRR abs/2006.03213 (2020) - [i8]Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. CoRR abs/2008.12237 (2020) - [i7]Dmitriy Kunisky:
Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube. CoRR abs/2009.07269 (2020) - [i6]Dmitriy Kunisky:
Hypothesis testing with low-degree polynomials in the Morris class of exponential families. CoRR abs/2011.03693 (2020) - [i5]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. CoRR abs/2012.02243 (2020)
2010 – 2019
- 2019
- [i4]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. CoRR abs/1902.07324 (2019) - [i3]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Subexponential-Time Algorithms for Sparse PCA. CoRR abs/1907.11635 (2019) - [i2]Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio. CoRR abs/1907.11636 (2019) - [i1]Dmitriy Kunisky, Afonso S. Bandeira:
A Tight Degree 4 Sum-of-Squares Lower Bound for the Sherrington-Kirkpatrick Hamiltonian. CoRR abs/1907.11686 (2019)
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-12-10 20:49 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:
