From post

A Complexity Approach to Tree Algebras: the Bounded Case.

, и . ICALP, том 198 из LIPIcs, стр. 127:1-127:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

 

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

On factorisation forests. CoRR, (2007)An Algebraic Approach to MSO-Definability on Countable linear Orderings., , и . J. Symb. Log., 83 (3): 1147-1189 (2018)On the positional determinacy of edge-labeled games., и . Theor. Comput. Sci., 352 (1-3): 190-196 (2006)Combinatorial Expressions and Lower Bounds., и . STACS, том 30 из LIPIcs, стр. 249-261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Automata in the Category of Glued Vector Spaces., и . MFCS, том 83 из LIPIcs, стр. 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Approximate Comparison of Functions Computed by Distance Automata., и . Theory Comput. Syst., 58 (4): 579-613 (2016)Controlling a random population., , и . Log. Methods Comput. Sci., (2021)Transforming structures by set interpretations., и . Log. Methods Comput. Sci., (2007)A Complexity Approach to Tree Algebras: the Polynomial Case., и . MFCS, том 241 из LIPIcs, стр. 37:1-37:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Optimal Transformations of Games and Automata Using Muller Conditions., , и . ICALP, том 198 из LIPIcs, стр. 123:1-123:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)