Michal R. Przybylek

11 papers C 3Journal 7Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation. CoRR Michal R. Przybylek, Pawel Siedlecki
2023	J	`jnl`	A note on encoding infinity in ZFA with applications to register automata. CoRR Michal R. Przybylek
2020	J	`jnl`	A note on the complexity of a phaseless polynomial interpolation. J. Complex. Michal R. Przybylek, Pawel Siedlecki
2020	J	`jnl`	Beyond sets with atoms: definability in first order logic. CoRR Michal R. Przybylek
2020	J	`jnl`	On amenability of constraint satisfaction problems. CoRR Michal R. Przybylek
2019	J	`jnl`	A note on the complexity of a phaseless polynomial interpolation. CoRR Michal R. Przybylek, Pawel Siedlecki
2018	J	`jnl`	Decomposition Algorithms for a Multi-Hard Problem. Evol. Comput. Michal R. Przybylek, Adam Wierzbicki, Zbigniew Michalewicz
2017	C	`conf`	Process Mining Methods for Post-Delivery Validation. FedCSIS Pawel Markowski, Michal R. Przybylek
2016	C	`conf`	Process Mining Methodology in Industrial Environment: Document Flow Analysis. FedCSIS Pawel Markowski, Michal R. Przybylek
2013	C	`conf`	Process Mining through Tree Automata. IJCCI Michal R. Przybylek
2011	—	`conf`	Skeletal Algorithms. IJCCI (ECTA-FCTA) Michal R. Przybylek