pith. sign in

Daniel Stefankovic

Identifiers

  • name variant Daniel Stefankovic 0.60 · backfill

Papers (24)

  1. Sampling Random Colorings of Sparse Random Graphs cs.DM · 2017 · author #3
  2. Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models cs.LG · 2017 · author #5
  3. On The Projection Operator to A Three-view Cardinality Constrained Set cs.LG · 2017 · author #4
  4. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model cs.DM · 2016 · author #3
  5. Approximation via Correlation Decay when Strong Spatial Mixing Fails cs.CC · 2015 · author #5
  6. Swendsen-Wang Algorithm on the Mean-Field Potts Model cs.DM · 2015 · author #2
  7. Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results cs.CC · 2013 · author #2
  8. #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region cs.CC · 2013 · author #6
  9. Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5 cs.LO · 2013 · author #3
  10. Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region cs.CC · 2013 · author #2
  11. Subset Selection for Gaussian Markov Random Fields cs.LG · 2012 · author #2
  12. Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models cs.DM · 2012 · author #2
  13. Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model cs.CC · 2011 · author #3
  14. Strong spatial mixing of $q$-colorings on Bethe lattices math.PR · 2011 · author #2
  15. The Complexity of Counting Eulerian Tours in 4-Regular Graphs cs.CC · 2010 · author #2
  16. A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions cs.DS · 2010 · author #1
  17. Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees math.PR · 2010 · author #2
  18. Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species q-bio.PE · 2010 · author #1
  19. A graph polynomial for independent sets of bipartite graphs cs.DM · 2009 · author #2
  20. Approximating L1-distances between mixture distributions using random projections cs.DS · 2008 · author #2
  21. Density estimation in linear time cs.LG · 2007 · author #2
  22. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting cs.DS · 2006 · author #1
  23. Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-identifiable Distributions q-bio.PE · 2006 · author #1
  24. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables math.ST · 2006 · author #3

Mentions

  • 1510.09193 #5 · backfill · confidence 0.70 Daniel Stefankovic
  • 1502.06593 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1311.4839 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1311.4451 #6 · backfill · confidence 0.70 Daniel Stefankovic
  • 1310.6439 #3 · backfill · confidence 0.70 Daniel Stefankovic
  • 1305.2902 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1209.5991 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1203.2226 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1105.5131 #3 · backfill · confidence 0.70 Daniel Stefankovic
  • 1102.2886 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1009.5019 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1008.1687 #1 · backfill · confidence 0.70 Daniel Stefankovic
  • 1007.2255 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 1003.5964 #1 · backfill · confidence 0.70 Daniel Stefankovic
  • 0911.4732 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 0804.1170 #2 · backfill · confidence 0.70 Daniel Stefankovic
  • 0712.2869 #2 · backfill · confidence 0.70 Daniel Stefankovic

Frequent Coauthors