Daniel Stefankovic
Orcid: 0000-0002-4849-7955Affiliations:
- University of Rochester, Department of Computer Science
According to our database1,
Daniel Stefankovic
authored at least 94 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
ACM Trans. Algorithms, January, 2024
2023
Theor. Comput. Sci., 2023
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Proceedings of the Approximation, 2023
2022
J. Graph Algorithms Appl., 2022
CoRR, 2022
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
ACM Trans. Comput. Theory, 2021
J. Mach. Learn. Res., 2021
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
2020
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs.
SIAM J. Discret. Math., 2020
SIAM J. Comput., 2020
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.
J. Mach. Learn. Res., 2020
Understanding Diversity based Pruning of Neural Networks - Statistical Mechanical Analysis.
CoRR, 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.
SIAM J. Comput., 2019
SIAM J. Comput., 2019
Random Struct. Algorithms, 2019
Proceedings of the Approximation, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Theory Comput. Syst., 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the Approximation, 2017
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017
2016
SIAM J. Comput., 2016
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
J. Comput. Syst. Sci., 2016
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models.
Comb. Probab. Comput., 2016
2015
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region.
J. ACM, 2015
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
SIAM J. Discret. Math., 2014
Improved inapproximability results for counting independent sets in the hard-core model.
Random Struct. Algorithms, 2014
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region.
Proceedings of the Symposium on Theory of Computing, 2014
2013
CoRR, 2013
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013
Proceedings of the Graph Drawing - 21st International Symposium, 2013
2012
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions.
SIAM J. Comput., 2012
Comb. Probab. Comput., 2012
Algorithmica, 2012
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012
Proceedings of the 41st International Conference on Parallel Processing, 2012
2011
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species.
SIAM J. Discret. Math., 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
CoRR, 2010
2009
Adaptive simulated annealing: A near-optimal connection between sampling and counting.
J. ACM, 2009
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
2008
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.
SIAM J. Comput., 2008
Discret. Comput. Geom., 2008
Proceedings of the 21st Annual Conference on Learning Theory, 2008
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions.
J. Comput. Biol., 2007
Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2007
Proceedings of the Graph Drawing, 15th International Symposium, 2007
Proceedings of the Graph Drawing, 15th International Symposium, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2005
Inf. Process. Lett., 2005
Proceedings of the Graph Drawing, 13th International Symposium, 2005
2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Graph Drawing, 12th International Symposium, 2004
2003
2002
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2001
J. Comb. Theory A, 2001
2000
Theor. Comput. Sci., 2000
Theor. Comput. Sci., 2000
Inf. Process. Lett., 2000
1998
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
Proceedings of the Distributed Computing, 12th International Symposium, 1998