Author of the publication

#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method.

, , , and . CoRR, (2020)

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.

 

Other publications of authors with the same name

On the Complexity of Acyclic Modules in Automata Networks., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 168-180. Springer, (2020)Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics., , and . Automata and Complexity, 42, page 117-143. Springer, (2022)Combinatorics of Block-Parallel Automata Networks., , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 442-455. Springer, (2024)Optimising Attractor Computation in Boolean Automata Networks., , and . LATA, volume 12638 of Lecture Notes in Computer Science, page 68-80. Springer, (2021)Complexity of Limit-Cycle Problems in Boolean Networks., , , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 135-146. Springer, (2021)Rice-Like Theorems for Automata Networks., , , and . STACS, volume 187 of LIPIcs, page 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Complexity of fixed point counting problems in Boolean Networks., , , and . CoRR, (2020)Complexity of fixed point counting problems in Boolean networks., , , and . J. Comput. Syst. Sci., (2022)Complexity of Boolean Automata Networks Under Block-Parallel Update Modes., , and . SAND, volume 292 of LIPIcs, page 19:1-19:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Freezing sandpiles and Boolean threshold networks: Equivalence and complexity., , and . Adv. Appl. Math., (2021)