Daniel Stefankovic

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 75

Top Venues

Publications

Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72 (1) (2024)
Marcus Schaefer, Daniel Stefankovic
Beyond the Existential Theory of the Reals. Theory Comput. Syst. 68 (2) (2024)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20 (1) (2024)
Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939 (2023)
Daniel Stefankovic, Eric Vigoda
Spectral Independence Lecture Notes. CoRR (2023)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM (2023)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT (2023)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR (2023)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
The Swendsen-Wang dynamics on trees. Random Struct. Algorithms 62 (4) (2023)
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)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Approximating observables is as hard as counting. CoRR (2022)
Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Topological View. CoRR (2022)
Marcus Schaefer, Daniel Stefankovic
Beyond the Existential Theory of the Reals. CoRR (2022)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR (2022)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Approximating Observables Is as Hard as Counting. ICALP (2022)
Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP (2022)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP (2022)
Marcus Schäfer, Daniel Stefankovic
The Degenerate Crossing Number and Higher-Genus Embeddings. J. Graph Algorithms Appl. 26 (1) (2022)
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)
Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
Metastability of the Potts ferromagnet on random regular graphs. CoRR (2022)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. 22 (2021)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13 (2) (2021)
Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR (2021)
Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Rapid Mixing for Colorings via Spectral Independence. SODA (2021)
Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR (2021)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR (2021)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM (2021)
Rupam Acharyya, Ankani Chattoraj, Boyu Zhang, Shouman Das, Daniel Stefankovic
Statistical mechanical analysis of neural network pruning. UAI (2021)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Structure Learning of H-Colorings. ACM Trans. Algorithms 16 (3) (2020)
Andrew Read-McFarland, Daniel Stefankovic
The Hardness of Sampling Connected Subgraphs. LATIN (2020)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. 49 (5) (2020)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
The complexity of approximating averages on bounded-degree graphs. FOCS (2020)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT (2020)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR (2020)
Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Rapid Mixing for Colorings via Spectral Independence. CoRR (2020)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
The Swendsen-Wang Dynamics on Trees. CoRR (2020)
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 (2020)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
The complexity of approximating averages on bounded-degree graphs. CoRR (2020)
Rupam Acharyya, Boyu Zhang, Ankani Chattoraj, Shouman Das, Daniel Stefankovic
Understanding Diversity based Pruning of Neural Networks - Statistical Mechanical Analysis. CoRR (2020)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48 (2) (2019)
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR (2019)
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) (2019)
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Improved Strong Spatial Mixing for Colorings on Trees. CoRR (2019)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP (2019)
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM (2019)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms 54 (1) (2019)
Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT (2019)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR (2018)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Sampling Random Colorings of Sparse Random Graphs. SODA (2018)
Marcus Schaefer, Daniel Stefankovic
The Complexity of Tensor Rank. Theory Comput. Syst. 62 (5) (2018)
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The complexity of approximating the matching polynomial in the complex plane. CoRR (2018)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. STOC (2018)
Daniel Stefankovic, Eric Vigoda, John Wilmes
On Counting Perfect Matchings in General Graphs. LATIN (2018)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Structure Learning of ${H}$-colorings. ALT (2018)
Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
Structure Learning of H-colorings. CoRR (2017)
Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. AISTATS (2017)
Daniel Stefankovic, Eric Vigoda, John Wilmes
On Counting Perfect Matchings in General Graphs. CoRR (2017)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Sampling Random Colorings of Sparse Random Graphs. CoRR (2017)
Rupam Acharyya, Daniel Stefankovic
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences. APPROX-RANDOM (2017)
Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu
On The Projection Operator to A Three-view Cardinality Constrained Set. CoRR (2017)
Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu
On The Projection Operator to A Three-view Cardinality Constrained Set. ICML (2017)
Marcus Schaefer, Daniel Stefankovic
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory Comput. Syst. 60 (2) (2017)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. CoRR (2017)
Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. CoRR (2017)
Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP (2017)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. 45 (6) (2016)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Comb. Probab. Comput. 25 (4) (2016)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR (2016)
Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial below the Shearer threshold. CoRR (2016)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS (2016)
Marcus Schaefer, Daniel Stefankovic
The Complexity of Tensor Rank. CoRR (2016)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP (2016)
Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82 (5) (2016)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Swendsen-Wang Algorithm on the Mean-Field Potts Model. CoRR (2015)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM 62 (6) (2015)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM (2015)
Marcus Schaefer, Daniel Stefankovic
The Degenerate Crossing Number and Higher-Genus Embeddings. Graph Drawing (2015)
Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
Spatial mixing and the connective constant: Optimal bounds. SODA (2015)
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR (2015)
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45 (1) (2014)
Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
Spatial mixing and the connective constant: Optimal bounds. CoRR (2014)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM (2014)
Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. 28 (2) (2014)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. STOC (2014)
Tagyoung Chung, Licheng Fang, Daniel Gildea, Daniel Stefankovic
Sampling Tree Fragments from Forests. Comput. Linguistics 40 (1) (2014)
Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM (2014)
Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. CoRR (2013)
Marcus Schaefer, Daniel Stefankovic
Block Additivity of ℤ2-Embeddings. Graph Drawing (2013)
Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. TARK (2013)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. CoRR (2013)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region CoRR (2013)
Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
Slice Normalized Dynamic Markov Logic Networks. StarAI@UAI (2012)
Qi Ge, Daniel Stefankovic
The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63 (3) (2012)
Qi Ge, Daniel Stefankovic
A Graph Polynomial for Independent Sets of Bipartite Graphs. Comb. Probab. Comput. 21 (5) (2012)
Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
Slice Normalized Dynamic Markov Logic Networks. NIPS (2012)
Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64 (4) (2012)
Andreas Galanis, Daniel Stefankovic, Eric Vigoda
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models CoRR (2012)
Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16 (3) (2012)

Daniel Stefankovic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Stefankovic