default search action
Daniel Stefankovic
Daniel Štefankovič
Person information
- unicode name: Daniel Štefankovič
- affiliation: University of Rochester, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j52]Jan Kyncl
, Marcus Schaefer
Spiraling and Folding: The Topological View. Discret. Comput. Geom. 72(1): 246-268 (2024) - [j51]Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. Theory Comput. Syst. 68(2): 195-226 (2024) - [j50]Ivona Bezáková
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms 20(1): 7:1-7:26 (2024) - 2023
- [j49]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang dynamics on trees. Random Struct. Algorithms 62(4): 791-831 (2023) - [j48]Andreas Galanis, Leslie Ann Goldberg
Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939: 194-215 (2023) - [c65]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM 2023: 33:1-33:16 - [c64]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT 2023: 1774-1790 - [i45]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR abs/2307.07727 (2023) - [i44]Daniel Stefankovic, Eric Vigoda:
Spectral Independence Lecture Notes. CoRR abs/2307.13826 (2023) - 2022
- [j47]Marcus Schäfer
The Degenerate Crossing Number and Higher-Genus Embeddings. J. Graph Algorithms Appl. 26(1): 35-58 (2022) - [c63]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP 2022: 21:1-21:16 - [c62]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: 45:1-45:20 - [c61]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating Observables Is as Hard as Counting. ICALP 2022: 63:1-63:18 - [c60]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: 2198-2207 - [c59]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: 3670-3692 - [i43]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 abs/2202.05777 (2022) - [i42]Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiraling and Folding: The Topological View. CoRR abs/2206.07849 (2022) - [i41]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Approximating observables is as hard as counting. CoRR abs/2206.11606 (2022) - [i40]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR abs/2207.09102 (2022) - [i39]Marcus Schaefer, Daniel Stefankovic:
Beyond the Existential Theory of the Reals. CoRR abs/2210.00571 (2022) - 2021
- [j46]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. 22: 152:1-152:56 (2021) - [j45]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): 13:1-13:37 (2021) - [c58]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM 2021: 43:1-43:15 - [c57]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. SODA 2021: 1548-1557 - [c56]Rupam Acharyya, Ankani Chattoraj, Boyu Zhang, Shouman Das, Daniel Stefankovic:
Statistical mechanical analysis of neural network pruning. UAI 2021: 1988-1997 - [i38]Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda:
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR abs/2103.07459 (2021) - [i37]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR abs/2105.01784 (2021) - [i36]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Fast sampling via spectral independence beyond bounded-degree graphs. CoRR abs/2111.04066 (2021) - 2020
- [j44]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: 25:1-25:62 (2020) - [j43]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) - [j42]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): 742-793 (2020) - [j41]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-Colorings. ACM Trans. Algorithms 16(3): 36:1-36:28 (2020) - [c55]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT 2020: 514-529 - [c54]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. FOCS 2020: 1345-1355 - [c53]Andrew Read-McFarland, Daniel Stefankovic:
The Hardness of Sampling Connected Subgraphs. LATIN 2020: 464-475 - [i35]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
The complexity of approximating averages on bounded-degree graphs. CoRR abs/2004.09238 (2020) - [i34]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR abs/2004.10805 (2020) - [i33]Rupam Acharyya, Boyu Zhang, Ankani Chattoraj, Shouman Das, Daniel Stefankovic:
Understanding Diversity based Pruning of Neural Networks - Statistical Mechanical Analysis. CoRR abs/2006.16617 (2020) - [i32]Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing for Colorings via Spectral Independence. CoRR abs/2007.08058 (2020) - [i31]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. CoRR abs/2007.08068 (2020)
2010 – 2019
- 2019
- [j40]Andreas Galanis, Daniel Stefankovic
Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms 54(1): 82-147 (2019) - [j39]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): 279-349 (2019) - [j38]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48(2): 581-643 (2019) - [c52]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM 2019: 48:1-48:16 - [c51]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - [c50]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP 2019: 22:1-22:13 - [i30]Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR abs/1901.07361 (2019) - [i29]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. CoRR abs/1909.07059 (2019) - 2018
- [j37]Marcus Schaefer
The Complexity of Tensor Rank. Theory Comput. Syst. 62(5): 1161-1174 (2018) - [c49]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of ${H}$-colorings. ALT 2018: 152-185 - [c48]Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM 2018: 33:1-33:15 - [c47]Daniel Stefankovic
On Counting Perfect Matchings in General Graphs. LATIN 2018: 873-885 - [c46]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
Sampling Random Colorings of Sparse Random Graphs. SODA 2018: 1759-1771 - [c45]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the independent set polynomial in the complex plane. STOC 2018: 1234-1240 - [i28]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 abs/1804.08111 (2018) - [i27]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
The complexity of approximating the matching polynomial in the complex plane. CoRR abs/1807.04930 (2018) - 2017
- [j36]Marcus Schaefer, Daniel Stefankovic
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory Comput. Syst. 60(2): 172-193 (2017) - [c44]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. AISTATS 2017: 440-449 - [c43]Rupam Acharyya, Daniel Stefankovic:
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences. APPROX-RANDOM 2017: 23:1-23:22 - [c42]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP 2017: 28:1-28:13 - [c41]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: 3871-3880 - [i26]Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu:
On The Projection Operator to A Three-view Cardinality Constrained Set. CoRR abs/1703.07345 (2017) - [i25]Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda:
Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. CoRR abs/1704.02232 (2017) - [i24]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. CoRR abs/1707.03796 (2017) - [i23]Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-colorings. CoRR abs/1708.05118 (2017) - [i22]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial in the complex plane. CoRR abs/1711.00282 (2017) - [i21]Daniel Stefankovic, Eric Vigoda, John Wilmes:
On Counting Perfect Matchings in General Graphs. CoRR abs/1712.07504 (2017) - 2016
- [j35]Andreas Galanis, Daniel Stefankovic
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Comb. Probab. Comput. 25(4): 500-559 (2016) - [j34]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. 82(5): 690-711 (2016) - [j33]Andreas Galanis, Daniel Stefankovic
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. 45(6): 2004-2065 (2016) - [c40]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS 2016: 704-713 - [c39]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP 2016: 45:1-45:13 - [i20]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 abs/1604.01422 (2016) - [i19]Marcus Schaefer, Daniel Stefankovic:
The Complexity of Tensor Rank. CoRR abs/1612.04338 (2016) - [i18]Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
Inapproximability of the independent set polynomial below the Shearer threshold. CoRR abs/1612.05832 (2016) - 2015
- [j32]Andreas Galanis, Daniel Stefankovic
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM 62(6): 50:1-50:60 (2015) - [c38]Andreas Galanis, Daniel Stefankovic
Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM 2015: 815-828 - [c37]Marcus Schaefer, Daniel Stefankovic
The Degenerate Crossing Number and Higher-Genus Embeddings. GD 2015: 63-74 - [c36]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. SODA 2015: 1549-1563 - [i17]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Swendsen-Wang Algorithm on the Mean-Field Potts Model. CoRR abs/1502.06593 (2015) - [i16]Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic:
Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR abs/1510.09193 (2015) - 2014
- [j31]Tagyoung Chung, Licheng Fang, Daniel Gildea, Daniel Stefankovic
Sampling Tree Fragments from Forests. Comput. Linguistics 40(1): 203-229 (2014) - [j30]Andreas Galanis, Qi Ge, Daniel Stefankovic
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1): 78-110 (2014) - [j29]Ricardo Restrepo, Daniel Stefankovic
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. 28(2): 835-861 (2014) - [c35]Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM 2014: 582-595 - [c34]Andreas Galanis, Daniel Stefankovic
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM 2014: 677-691 - [c33]Andreas Galanis, Daniel Stefankovic
Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. STOC 2014: 823-831 - [i15]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. CoRR abs/1410.2595 (2014) - 2013
- [c32]Marcus Schaefer, Daniel Stefankovic:
Block Additivity of ℤ2-Embeddings. GD 2013: 185-195 - [c31]Tivadar Papai, Henry A. Kautz, Daniel Stefankovic:
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. TARK 2013 - [i14]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region. CoRR abs/1305.2902 (2013) - [i13]Tivadar Papai, Henry A. Kautz, Daniel Stefankovic:
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. CoRR abs/1310.6439 (2013) - [i12]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. CoRR abs/1311.4839 (2013) - 2012
- [j28]Qi Ge, Daniel Stefankovic
The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63(3): 588-601 (2012) - [j27]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - [j26]Qi Ge, Daniel Stefankovic
A Graph Polynomial for Independent Sets of Bipartite Graphs. Comb. Probab. Comput. 21(5): 695-714 (2012) - [j25]Radoslav Fulek
Adjacent Crossings Do Matter. J. Graph Algorithms Appl. 16(3): 759-782 (2012) - [j24]Daniel Stefankovic
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. SIAM J. Comput. 41(2): 356-366 (2012) - [c30]Liang Yuan, Chen Ding, Daniel Stefankovic
Modeling the Locality in Graph Traversals. ICPP 2012: 138-147 - [c29]Tivadar Papai, Henry A. Kautz, Daniel Stefankovic:
Slice Normalized Dynamic Markov Logic Networks. NIPS 2012: 1916-1924 - [c28]Tivadar Papai, Henry A. Kautz, Daniel Stefankovic:
Slice Normalized Dynamic Markov Logic Networks. StarAI@UAI 2012 - [i11]Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. CoRR abs/1203.2226 (2012) - [i10]Satyaki Mahalanabis, Daniel Stefankovic:
Subset Selection for Gaussian Markov Random Fields. CoRR abs/1209.5991 (2012) - 2011
- [j23]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Spiraling and Folding: The Word View. Algorithmica 60(3): 609-626 (2011) - [j22]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60(3): 679-702 (2011) - [j21]Daniel Stefankovic
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. SIAM J. Discret. Math. 25(3): 1194-1211 (2011) - [c27]Andreas Galanis, Qi Ge, Daniel Stefankovic
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578 - [c26]Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic
An FPTAS for #Knapsack and Related Counting Problems. FOCS 2011: 817-826 - [c25]Radoslav Fulek
Adjacent Crossings Do Matter. GD 2011: 343-354 - [c24]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SODA 2011: 945-956 - [c23]Radoslav Fulek
Hanani-Tutte and Monotone Drawings. WG 2011: 283-294 - [i9]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. CoRR abs/1105.5131 (2011) - 2010
- [j20]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Independently Even Crossings. SIAM J. Discret. Math. 24(2): 379-393 (2010) - [c22]Qi Ge, Daniel Stefankovic
A graph polynomial for independent sets of bipartite graphs. FSTTCS 2010: 240-250 - [c21]Qi Ge, Daniel Stefankovic
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. LATIN 2010: 638-649 - [i8]Daniel Stefankovic, Eric Vigoda:
Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. CoRR abs/1003.5964 (2010) - [i7]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. CoRR abs/1007.2255 (2010) - [i6]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions. CoRR abs/1008.1687 (2010) - [i5]Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. CoRR abs/1009.5019 (2010)
2000 – 2009
- 2009
- [j19]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing even crossings on surfaces. Eur. J. Comb. 30(7): 1704-1717 (2009) - [j18]Daniel Stefankovic
Adaptive simulated annealing: A near-optimal connection between sampling and counting. J. ACM 56(3): 18:1-18:36 (2009) - [c20]Satyaki Mahalanabis, Daniel Stefankovic:
Approximating L1-distances Between Mixture Distributions Using Random Projections. ANALCO 2009: 75-84 - [c19]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Independently Even Crossings. GD 2009: 201-206 - [i4]Qi Ge, Daniel Stefankovic:
A graph polynomial for independent sets of bipartite graphs. CoRR abs/0911.4732 (2009) - 2008
- [j17]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Odd Crossing Number and Crossing Number Are Not the Same. Discret. Comput. Geom. 39(1-3): 442-454 (2008) - [j16]Ivona Bezáková, Daniel Stefankovic
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37(5): 1429-1454 (2008) - [c18]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. CCCG 2008 - [c17]Satyaki Mahalanabis, Daniel Stefankovic:
Density Estimation in Linear Time. COLT 2008: 503-512 - [i3]Satyaki Mahalanabis, Daniel Stefankovic:
Approximating L1-distances between mixture distributions using random projections. CoRR abs/0804.1170 (2008) - 2007
- [j15]Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Train Tracks and Confluent Drawings. Algorithmica 47(4): 465-479 (2007) - [j14]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing Even Crossings on Surfaces. Electron. Notes Discret. Math. 29: 85-90 (2007) - [j13]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Folding and Spiralling: The Word View. Electron. Notes Discret. Math. 29: 101-105 (2007) - [j12]Daniel Stefankovic
Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. J. Comput. Biol. 14(2): 156-189 (2007) - [j11]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Removing even crossings. J. Comb. Theory B 97(4): 489-500 (2007) - [j10]Manu Chhabra, Robert A. Jacobs, Daniel Stefankovic:
Behavioral Shaping for Geometric Concepts. J. Mach. Learn. Res. 8: 1835-1865 (2007) - [c16]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiralling and Folding: The Topological View. CCCG 2007: 73-76 - [c15]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. FOCS 2007: 183-193 - [c14]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Number of Graphs with Rotation Systems. GD 2007: 3-12 - [c13]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Crossing Numbers and Parameterized Complexity. GD 2007: 31-36 - [c12]Daniel Gildea, Daniel Stefankovic:
Worst-Case Synchronous Grammar Rules. HLT-NAACL 2007: 147-154 - [i2]Satyaki Mahalanabis, Daniel Stefankovic:
Density estimation in linear time. CoRR abs/0712.2869 (2007) - 2006
- [c11]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147 - [c10]Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907 - [i1]Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. CoRR abs/cs/0612058 (2006) - 2005
- [j9]Bruno Codenotti, Daniel Stefankovic
On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Inf. Process. Lett. 94(3): 145-150 (2005) - [j8]Marcus Schaefer, Daniel Stefankovic
Solvability of Graph Inequalities. SIAM J. Discret. Math. 19(3): 728-743 (2005) - [j7]László Babai
Locally testable cyclic codes. IEEE Trans. Inf. Theory 51(8): 2849-2858 (2005) - [c9]Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
Odd Crossing Number Is Not Crossing Number. GD 2005: 386-396 - 2004
- [j6]Marcus Schaefer, Daniel Stefankovic
Decidability of string graphs. J. Comput. Syst. Sci. 68(2): 319-334 (2004) - [c8]Peter Hui, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. GD 2004: 318-328 - [c7]László Babai, Daniel Stefankovic:
Simultaneous diophantine approximation with excluded primes. SODA 2004: 1123-1129 - 2003
- [j5]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2): 365-380 (2003) - [c6]László Babai
Locally Testable Cyclic Codes. FOCS 2003: 116-125 - 2002
- [c5]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces. COCOON 2002: 370-380 - [c4]Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Recognizing string graphs in NP. STOC 2002: 1-6 - 2001
- [j4]László Babai
Set Systems with Restricted Intersections modulo Prime Powers. J. Comb. Theory A 95(1): 39-73 (2001) - [c3]Marcus Schaefer, Daniel Stefankovic:
Decidability of string graphs. STOC 2001: 241-246 - 2000
- [j3]Daniel Stefankovic
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. Inf. Process. Lett. 73(5-6): 221-225 (2000) - [j2]Rastislav Kralovic
The complexity of shortest path and dilation bounded interval routing. Theor. Comput. Sci. 234(1-2): 85-107 (2000) - [j1]Peter Ruzicka, Daniel Stefankovic
On the complexity of multi-dimensional interval routing schemes. Theor. Comput. Sci. 245(2): 255-280 (2000)
1990 – 1999
- 1998
- [c2]Rastislav Kralovic
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. DISC 1998: 273-287 - 1997
- [c1]Rastislav Kralovic
The Complexity of Shortest Path and Dilation Bounded Interval Routing. Euro-Par 1997: 258-265
Coauthor Index
[j49] [c65] [c64] [i45] [i44] [c62] [c61] [c60] [c59] [i43] [i41] [i40] [j46] [c58] [c57] [i38] [i37] [j44] [j42] [j41] [c55] [c54] [i35] [i34] [i32] [i31] [j40] [j38] [c52] [c51] [i30] [i29] [c49] [c48] [c47] [c46] [i28] [c44] [i25] [i24] [i23] [i21] [j35] [j34] [j33] [c40] [i20] [j32] [c38] [i17] [j30] [j29] [c35] [c34] [c33] [i14] [i12] [j27] [j24] [i11] [j21] [c27] [c26] [c24] [i9] [i8] [i7] [i6] [j18] [j16] [j12] [c15] [c11] [c10] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: