( en | de | ru )

 

Disambiguation of "Naaf, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic.

, , , and . CoRR, (2019)

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.

Tobias Naaf

Tobias Naaf

Tobias Naaf

Doris Naaf

Tobias Naaf

 

Other publications of authors with the same name

Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic., , , and . CoRR, (2019)Inferring Lower Runtime Bounds for Integer Programs., , , and . ACM Trans. Program. Lang. Syst., 42 (3): 13:1-13:50 (2020)Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics., , , and . LICS, page 41:1-41:12. ACM, (2022)Inferring Lower Runtime Bounds for Integer Programs., , , and . CoRR, (2019)Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials., , and . GandALF, volume 346 of EPTCS, page 67-82. (2021)Computing Least and Greatest Fixed Points in Absorptive Semirings.. RAMiCS, volume 13027 of Lecture Notes in Computer Science, page 344-361. Springer, (2021)Semiring Provenance for Fixed-Point Logic., , , and . CSL, volume 183 of LIPIcs, page 17:1-17:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Locality Theorems in Semiring Semantics., , and . MFCS, volume 272 of LIPIcs, page 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Lower Runtime Bounds for Integer Programs., , , , and . IJCAR, volume 9706 of Lecture Notes in Computer Science, page 550-567. Springer, (2016)Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials., , and . Log. Methods Comput. Sci., (2024)