Michal R. Przybylek

Orcid: 0000-0003-2349-865X

Affiliations:
  • University of Warsaw, Polish-Japanese Academy of Information Technology, Poland


According to our database1, Michal R. Przybylek authored at least 11 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A note on encoding infinity in ZFA with applications to register automata.
CoRR, 2023

2020
A note on the complexity of a phaseless polynomial interpolation.
J. Complex., 2020

On amenability of constraint satisfaction problems.
CoRR, 2020

Beyond sets with atoms: definability in first order logic.
CoRR, 2020

2018
Decomposition Algorithms for a Multi-Hard Problem.
Evol. Comput., 2018

2017
Process Mining Methods for Post-Delivery Validation.
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016
Multi-hard Problems in Uncertain Environment.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Process Mining Methodology in Industrial Environment: Document Flow Analysis.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

2014
Socially inspired algorithms for the travelling thief problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Process Mining through Tree Automata.
Proceedings of the IJCCI 2013, 2013

2011
Skeletal Algorithms.
Proceedings of the ECTA and FCTA 2011, 2011


  Loading...