( en | de | ru )

 

Disambiguation of "Stefankovic, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Structure Learning of $H$-colorings.

, , , and . ALT, volume 83 of Proceedings of Machine Learning Research, page 152-185. PMLR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel

Daniel

Daniel Wied

Zivilprozessuale Qualifikationsprobleme im Spannungsfeld von Vertrag und Delikt: ein Beitrag zur Auslegung nationalen Zivilprozessrechts in europäischer Perspektive. Uni Regensburg, (2009)

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)

Daniel Dirkmann

In-vitro-Untersuchungen zum Effekt von Hypothermie und Azidose auf Variablen thrombelastometrischer Messungen der Blutgerinnung. Uni Duisburg-Essen, (2009)
 

Other publications of authors with the same name

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models., , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 283-298. PMLR, (2019)The Complexity of Shortest Path and Dilation Bounded Interval Routing., , and . Euro-Par, volume 1300 of Lecture Notes in Computer Science, page 258-265. Springer, (1997)Rapid Mixing for Colorings via Spectral Independence., , , and . CoRR, (2020)Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees, , , , and . CoRR, (2010)Inapproximability of the Independent Set Polynomial Below the Shearer Threshold., , and . ICALP, volume 80 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Graph Polynomial for Independent Sets of Bipartite Graphs., and . Comb. Probab. Comput., 21 (5): 695-714 (2012)Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5., , and . TARK, (2013)A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions., , and . SIAM J. Comput., 41 (2): 356-366 (2012)Spiraling and Folding: The Topological View., , , and . CoRR, (2022)The Complexity of Approximating the Matching Polynomial in the Complex Plane., , , and . ACM Trans. Comput. Theory, 13 (2): 13:1-13:37 (2021)