Marcin Przybyłko
From MaRDI portal
Person:2029601
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Computing measures of weak-mso definable sets of trees | 2026-03-18 | Paper |
| Answer Counting under Guarded TGDs Logical Methods in Computer Science | 2023-10-23 | Paper |
| scientific article; zbMATH DE number 7447744 (Why is no real title available?) | 2021-12-17 | Paper |
| scientific article; zbMATH DE number 7447744 (Why is no real title available?) (available as arXiv preprint) | 2021-12-17 | Paper |
| scientific article; zbMATH DE number 7362735 (Why is no real title available?) | 2021-06-24 | Paper |
| scientific article; zbMATH DE number 7362735 (Why is no real title available?) (available as arXiv preprint) | 2021-06-24 | Paper |
| The uniform measure of simple regular sets of infinite trees Information and Computation | 2021-06-03 | Paper |
| On the complexity of branching games with regular conditions | 2018-03-21 | Paper |
| Between tree patterns and conjunctive queries: is there tractability beyond acyclicity? Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Research outcomes over time
This page was built for person: Marcin Przybyłko
