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.

 

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

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 483-494. Springer, (2011)Two-player Domino games., и . CoRR, (2023)Construction of mu-Limit Sets of Two-dimensional Cellular Automata., и . STACS, том 30 из LIPIcs, стр. 262-274. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton., и . WORDS, том 13899 из Lecture Notes in Computer Science, стр. 104-116. Springer, (2023)Self-organization in Cellular Automata: A Particle-Based Approach., и . Developments in Language Theory, том 6795 из Lecture Notes in Computer Science, стр. 251-263. Springer, (2011)String attractors and bi-infinite words., , и . CoRR, (2024)The Domino Problem Is Undecidable on Every Rhombus Subshift., , и . DLT, том 13911 из Lecture Notes in Computer Science, стр. 100-112. Springer, (2023)The Aperiodic Domino Problem in Higher Dimension., и . STACS, том 219 из LIPIcs, стр. 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Two-Player Domino Games., и . CiE, том 14773 из Lecture Notes in Computer Science, стр. 139-152. Springer, (2024)