bibliographer - Marcin Przybyłko

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Computing measures of weak-MSO definable sets of trees Damian Niwiński Marcin Przybyłko Michał Skrzypczak [github]

The uniform measure of simple regular sets of infinite trees Marcin Przybyłko Michał Skrzypczak [github]

Computing Measures of Weak-MSO Definable Sets of Trees Damian Niwiński Marcin Przybyłko Michał Skrzypczak [github]

The Uniform Measure of Simple Regular Sets of Infinite Trees Marcin Przybyłko Michał Skrzypczak [github]

Stochastic games and their complexities Marcin Przybyłko [github]

On Computing the Measures of First-Order Definable Sets of Trees Marcin Przybyłko [github]

Tree games with regular objectives Marcin Przybyłko [github]

Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity Filip Murlak Michał Ogiński Marcin Przybyłko [github]

On the Complexity of Branching Games with Regular Conditions Marcin Przybylko Michal Skrzypczak [github]

Library Size: 13G (9 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]