Articles with public access mandates - Damian NiwinskiLearn more
Available somewhere: 4
A quasi-polynomial black-box algorithm for fixed point evaluation
A Arnold, D Niwiński, P Parys
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021
Mandates: National Science Centre, Poland
Computing measures of weak-MSO definable sets of trees
D Niwiński, M Przybyłko, M Skrzypczak
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
Mandates: European Commission
On guidable index of tree automata
D Niwiński, M Skrzypczak
46th International Symposium on Mathematical Foundations of Computer Science …, 2021
Mandates: National Science Centre, Poland
The Probabilistic Rabin Tree Theorem*
D Niwiński, P Parys, M Skrzypczak
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023
Mandates: National Science Centre, Poland
Publication and funding information is determined automatically by a computer program