Daniel Stefankovic
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
49
Venues
18
Active years
1997–2023
Best venue rank
A*
Where they publish
Papers
49 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | COLT | Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
| 2022 | ICALP | Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2022 | ICALP | Metastability of the Potts Ferromagnet on Random Regular Graphs. | Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda |
| 2022 | ICALP | Approximating Observables Is as Hard as Counting. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2022 | SODA | On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. | Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda |
| 2022 | SODA | Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2021 | SODA | Rapid Mixing for Colorings via Spectral Independence. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2021 | UAI | Statistical mechanical analysis of neural network pruning. | Rupam Acharyya, Ankani Chattoraj, Boyu Zhang, Shouman Das, Daniel Stefankovic |
| 2020 | COLT | Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
| 2020 | FOCS | The complexity of approximating averages on bounded-degree graphs. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2020 | LATIN | The Hardness of Sampling Connected Subgraphs. | Andrew Read-McFarland, Daniel Stefankovic |
| 2019 | COLT | Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. | Ivona Bezkov, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
| 2019 | ICALP | The Complexity of Approximating the Matching Polynomial in the Complex Plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2018 | ALT | Structure Learning of ${H}$-colorings. | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda |
| 2018 | LATIN | On Counting Perfect Matchings in General Graphs. | Daniel Stefankovic, Eric Vigoda, John Wilmes |
| 2018 | SODA | Sampling Random Colorings of Sparse Random Graphs. | Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
| 2018 | STOC | Inapproximability of the independent set polynomial in the complex plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | AISTATS | Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. | Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda |
| 2017 | ICALP | Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. | Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | ICML | On The Projection Operator to A Three-view Cardinality Constrained Set. | Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu |
| 2016 | FOCS | Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. | Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin |
| 2016 | ICALP | Approximation via Correlation Decay When Strong Spatial Mixing Fails. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic |
| 2015 | GD | The Degenerate Crossing Number and Higher-Genus Embeddings. | Marcus Schaefer, Daniel Stefankovic |
| 2015 | SODA | Spatial mixing and the connective constant: Optimal bounds. | Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin |
| 2014 | STOC | Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2013 | GD | Block Additivity of ℤ2-Embeddings. | Marcus Schaefer, Daniel Stefankovic |
| 2013 | TARK | Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. | Tivadar Papai, Henry A. Kautz, Daniel Stefankovic |
| 2012 | ICPP | Modeling the Locality in Graph Traversals. | Liang Yuan, Chen Ding, Daniel Stefankovic, Yunquan Zhang |
| 2011 | FOCS | An FPTAS for #Knapsack and Related Counting Problems. | Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda |
| 2011 | GD | Adjacent Crossings Do Matter. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2011 | SODA | Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. | Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang |
| 2011 | WG | Hanani-Tutte and Monotone Drawings. | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2010 | LATIN | The Complexity of Counting Eulerian Tours in 4-Regular Graphs. | Qi Ge, Daniel Stefankovic |
| 2009 | GD | Removing Independently Even Crossings. | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2008 | COLT | Density Estimation in Linear Time. | Satyaki Mahalanabis, Daniel Stefankovic |
| 2007 | FOCS | Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. | Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda |
| 2007 | GD | Crossing Number of Graphs with Rotation Systems. | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2007 | GD | Crossing Numbers and Parameterized Complexity. | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2007 | NAACL | Worst-Case Synchronous Grammar Rules. | Daniel Gildea, Daniel Stefankovic |
| 2006 | ESA | Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. | Ivona Bezkov, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda |
| 2006 | SODA | Accelerating simulated annealing for the permanent and combinatorial counting problems. | Ivona Bezkov, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda |
| 2005 | GD | Odd Crossing Number Is Not Crossing Number. | Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2004 | GD | Train Tracks and Confluent Drawings. | Peter Hui, Marcus Schaefer, Daniel Stefankovic |
| 2004 | SODA | Simultaneous diophantine approximation with excluded primes. | Lszl Babai, Daniel Stefankovic |
| 2003 | FOCS | Locally Testable Cyclic Codes. | Lszl Babai, Amir Shpilka, Daniel Stefankovic |
| 2002 | COCOON | Algorithms for Normal Curves and Surfaces. | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
| 2002 | STOC | Recognizing string graphs in NP. | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic |
| 2001 | STOC | Decidability of string graphs. | Marcus Schaefer, Daniel Stefankovic |
| 1997 | EuroPar | The Complexity of Shortest Path and Dilation Bounded Interval Routing. | Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic |