Daniel Stefankovic

Author Info

Name	Affiliation	Papers
DANIEL STEFANKOVIC	Department of Computer Science, University of Chicago, 1100 East 58th Street, Chicago, Illinois and Department of Computer Science, Comenius University, Bratislava, Slovakia	52
Collaborators	Citations	PageRank
45	243	28.65
Referers	Referees	References
402	464	366

Search Limit

100464

Publications (52 rows)

Collaborators (45 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Statistical mechanical analysis of neural network pruning.	0	0.34	2021
The Swendsen-Wang Dynamics on Trees.	0	0.34	2021
Rapid Mixing for Colorings via Spectral Independence	0	0.34	2021
Hardness Of Identity Testing For Restricted Boltzmann Machines And Potts Models	0	0.34	2020
Inapproximability of the Independent Set Polynomial in the Complex Plane.	0	0.34	2020
Structure Learning of H-Colorings	0	0.34	2020
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models.	0	0.34	2019
Improved Strong Spatial Mixing for Colorings on Trees.	0	0.34	2019
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models.	0	0.34	2019
The Complexity of Approximating the Matching Polynomial in the Complex Plane	0	0.34	2018
Structure Learning of ${H}$-colorings.	0	0.34	2018
On Counting Perfect Matchings in General Graphs.	0	0.34	2018
Sampling Random Colorings of Sparse Random Graphs.	2	0.38	2018
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs.	1	0.36	2018
The Complexity of Tensor Rank.	0	0.34	2018
Inapproximability of the independent set polynomial below the Shearer threshold.	0	0.34	2017
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals	5	0.41	2017
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences.	0	0.34	2017
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region.	1	0.37	2016
The Degenerate Crossing Number and Higher-Genus Embeddings.	1	0.35	2015
Swendsen-Wang Algorithm on the Mean-Field Potts Model.	2	0.42	2015
Approximation via Correlation Decay When Strong Spatial Mixing Fails.	1	0.36	2015
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results.	1	0.36	2014
Sampling tree fragments from forests	4	0.49	2014
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5.	1	0.38	2013
Block Additivity of ℤ2-Embeddings.	0	0.34	2013
BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results.	0	0.34	2013
Subset Selection for Gaussian Markov Random Fields	0	0.34	2012
Negative examples for sequential importance sampling of binary contingency tables	16	1.72	2012
A graph polynomial for independent sets of bipartite graphs	6	0.51	2012
Slice Normalized Dynamic Markov Logic Networks.	6	0.42	2012
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models	28	0.98	2012
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species.	2	0.50	2011
Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species	1	0.43	2010
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees.	2	0.40	2010
Approximating L1-distances between mixture distributions using random projections	0	0.34	2009
Removing Independently Even Crossings	0	0.34	2009
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time	6	0.52	2008
Accelerating simulated annealing for the permanent and combinatorial counting problems	16	1.34	2008
Phylogeny of mixture models: robustness of maximum likelihood and non-identifiable distributions.	7	0.98	2007
Worst-Case Synchronous Grammar Rules	6	0.48	2007
Density estimation in linear time	4	0.53	2007
Spiralling and Folding: The Topological View	2	0.42	2007
Train Tracks and Confluent Drawings	8	0.68	2007
Solvability of Graph Inequalities	1	0.38	2005
Simultaneous diophantine approximation with excluded primes	0	0.34	2004
Recognizing string graphs in NP	66	2.73	2003
Algorithms for Normal Curves and Surfaces	8	0.60	2002
Set systems with restricted intersections modulo prime powers	12	0.91	2001
Decidability of string graphs	22	2.30	2001

1
2
50 / page