default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmytro Savchuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Delaram Kahrobaei, Arsalan Akram Malik, Dmytro Savchuk:
Contracting Self-similar Groups in Group-Based Cryptography. CoRR abs/2408.14355 (2024)- 2023
- [c3]Vasyl Teslyuk, Anastasiya Doroshenko, Dmytro Savchuk:
Intelligent Methods and Models for Assessing Level of Student Adaptation to Online Learning. COLINS (1) 2023: 331-343 - 2021
- [j5]Natasa Jonoska, Dmytro Savchuk
:
Preface. Int. J. Found. Comput. Sci. 32(6): 615-617 (2021) - [c2]Dmytro Savchuk, Anastasiya Doroshenko:
Investigation of machine learning classification methods effectiveness. CSIT (1) 2021: 33-37 - 2020
- [e1]Natasa Jonoska, Dmytro Savchuk:
Developments in Language Theory - 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings. Lecture Notes in Computer Science 12086, Springer 2020, ISBN 978-3-030-48515-3 [contents] - [i3]Rostislav I. Grigorchuk, Dmytro Savchuk:
Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata. CoRR abs/2006.02316 (2020)
2010 – 2019
- 2018
- [j4]Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. Int. J. Found. Comput. Sci. 29(2): 297-314 (2018) - 2015
- [j3]Alexei Miasnikov, Dmytro Savchuk:
An example of an automatic graph of intermediate growth. Ann. Pure Appl. Log. 166(10): 1037-1048 (2015) - [c1]Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. DLT 2015: 313-325 - 2014
- [i2]Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group. CoRR abs/1409.6142 (2014) - [i1]Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
Orbit automata as a new tool to attack the order problem in automaton groups. CoRR abs/1411.0158 (2014) - 2013
- [j2]Lucas Sabalka, Dmytro Savchuk:
Erratum: "on Restricting Subsets of Bases in Relatively Free Groups". Int. J. Algebra Comput. 23(3): 685- (2013) - 2012
- [j1]Lucas Sabalka, Dmytro Savchuk:
On Restricting Subsets of Bases in Relatively Free Groups. Int. J. Algebra Comput. 22(4) (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
