Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Stefankovic
- > Home > Persons > Daniel Stefankovic
Publications
- 2023
[c64]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT 2023: 1774-1790- 2022
- [c60]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. SODA 2022: 2198-2207 - [c59]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. SODA 2022: 3670-3692 - [i40]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR abs/2207.09102 (2022) - 2021
- [j46]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. 22: 152:1-152:56 (2021) - [c58]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM 2021: 43:1-43:15 - [c57]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. SODA 2021: 1548-1557 - [i38]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR abs/2103.07459 (2021) - [i37]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR abs/2105.01784 (2021) - 2020
- [j44]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. J. Mach. Learn. Res. 21: 25:1-25:62 (2020) - [j41]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-Colorings. ACM Trans. Algorithms 16(3): 36:1-36:28 (2020) - [c55]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT 2020: 514-529 - [i34]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR abs/2004.10805 (2020) - [i32]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. CoRR abs/2007.08058 (2020) - [i31]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. CoRR abs/2007.08068 (2020) - 2019
- [c51]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - [i30]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR abs/1901.07361 (2019) - 2018
- [c49]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of ${H}$-colorings. ALT 2018: 152-185 - 2017
- [i23]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-colorings. CoRR abs/1708.05118 (2017)
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-12 18:30 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:
