default search action
Daniel Stefankovic
- > Home > Persons > Daniel Stefankovic
Publications
- 2024
- [j50]Ivona Bezáková
, Andreas Galanis
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024) - 2022
- [c63]Ivona Bezáková
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16 - 2021
- [j45]Ivona Bezáková
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13(2): 13:1-13:37 (2021) - [i36]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR abs/2111.04066 (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) - [j43]Ivona Bezáková
Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. 49(5) (2020) - 2019
- [j39]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. 48(2): 279-349 (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 - [c50]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP 2019: 22:1-22:13 - [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
- [c45]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. STOC 2018: 1234-1240 - [i27]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The complexity of approximating the matching polynomial in the complex plane. CoRR abs/1807.04930 (2018) - 2017
- [i22]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. CoRR abs/1711.00282 (2017) - 2016
- [c39]Ivona Bezáková
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - 2015
- [i16]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - 2012
- [j27]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - 2008
- [j16]Ivona Bezáková, Daniel Stefankovic
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37(5): 1429-1454 (2008) - 2006
- [c11]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147 - [c10]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907
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 2025-10-07 22:38 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: