Dmytro Savchuk

Orcid: 0000-0002-3698-6110

According to our database1, Dmytro Savchuk authored at least 10 papers between 2012 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Contracting Self-similar Groups in Group-Based Cryptography.
CoRR, 2024

2023
Intelligent Methods and Models for Assessing Level of Student Adaptation to Online Learning.
Proceedings of the 7th International Conference on Computational Linguistics and Intelligent Systems. Volume I: Machine Learning Workshop, 2023

2021
Preface.
Int. J. Found. Comput. Sci., 2021

Investigation of machine learning classification methods effectiveness.
Proceedings of the IEEE 16th International Conference on Computer Sciences and Information Technologies, 2021

2020
Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata.
CoRR, 2020

2018
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group.
Int. J. Found. Comput. Sci., 2018

2015
An example of an automatic graph of intermediate growth.
Ann. Pure Appl. Log., 2015

2014
Orbit automata as a new tool to attack the order problem in automaton groups.
CoRR, 2014

2013
Erratum: "on Restricting Subsets of Bases in Relatively Free Groups".
Int. J. Algebra Comput., 2013

2012
On Restricting Subsets of Bases in Relatively Free Groups.
Int. J. Algebra Comput., 2012


  Loading...