From post

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.

 

Другие публикации лиц с тем же именем

A Finite-Model-Theoretic View on Propositional Proof Complexity., , , и . Logical Methods in Computer Science, (2019)Bounded-Arity Hierarchies in Fixed-Point Logics.. CSL, том 832 из Lecture Notes in Computer Science, стр. 150-164. Springer, (1993)The Surprising Power of Graph Neural Networks with Random Node Initialization., , , и . IJCAI, стр. 2112-2118. ijcai.org, (2021)One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction., , , и . IJCAI, стр. 4280-4288. ijcai.org, (2023)From polynomial time queries to graph structure theory.. Commun. ACM, 54 (6): 104-112 (2011)Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits., , и . ICALP, том 3142 из Lecture Notes in Computer Science, стр. 555-567. Springer, (2004)05301 Summary - Exact Algorithms and Fixed-Parameter Tractability., , и . Exact Algorithms and Fixed-Parameter Tractability, том 05301 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability., , и . Exact Algorithms and Fixed-Parameter Tractability, том 05301 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)Constraint solving via fractional edge covers., и . SODA, стр. 289-298. ACM Press, (2006)Generative Datalog with Continuous Distributions., , , и . PODS, стр. 347-360. ACM, (2020)