default search action
Dmitry Zaitsev 0001
Person information
- unicode name: Дмитрий Анатольевич Зайцев
- affiliation: Odessa State Environmental University, Department of Information Technology, Ukraine
- affiliation (2014 - 2019): Vistula University, Department of Computer Science, Warsaw, Poland
- affiliation (2009 - 2019): International Humanitarian University, Department of Computer Engineering and Innovation Technology, Odessa, Ukraine
Other persons with the same name
- Dmitry Zaitsev 0002
(aka: Dmitry V. Zaitsev) — Lomonosov Moscow State University, Department of Philosophy, Russia
- Dmitry Zaitsev 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Chinmay Chakraborty, Dmitry A. Zaitsev, Gabriella Casalino:
Guest Editorial: Modeling and simulation based intelligent embedded computing systems in industrial internet of things. Int. J. Model. Simul. Sci. Comput. 15(2): 2402001:1-2402001:3 (2024) - [j33]Dmitry A. Zaitsev
Verification of cryptocurrency consensus protocols: reenterable colored Petri net model design. Int. J. Parallel Emergent Distributed Syst. 39(1): 32-50 (2024) - [j32]Dmitry A. Zaitsev
Fast Local Rules Based Switching and Routing Within Multidimensional Torus Interconnect. Parallel Process. Lett. 34(2): 2450002:1-2450002:23 (2024) - [j31]Bernard Berthomieu, Dmitry A. Zaitsev
Sleptsov nets are Turing-complete. Theor. Comput. Sci. 986: 114346 (2024) - 2023
- [j30]Dmitry A. Zaitsev:
Strong Sleptsov nets are Turing complete. Inf. Sci. 621: 172-182 (2023) - [j29]Dmitry Zaitsev
Sleptsov Net Computing resolves problems of modern supercomputing revealed by Jack Dongarra in his Turing Award talk in November 2022. Int. J. Parallel Emergent Distributed Syst. 38(4): 275-279 (2023) - [j28]Dmitry A. Zaitsev
Virtual Machine and Integrated Developer Environment for Sleptsov Net Computing. Parallel Process. Lett. 33(3): 2350006:1-2350006:34 (2023) - [i5]Bernard Berthomieu, Dmitry A. Zaitsev:
Sleptsov Nets are Turing-complete. CoRR abs/2306.12440 (2023) - 2022
- [j27]Genaro J. Martínez, Andrew Adamatzky, Ricardo Quezada Figueroa, Eric Schweikardt, Dmitry A. Zaitsev, Ivan Zelinka, Luz Noé Oliva-Moreno:
Computing with Modular Robots. Int. J. Unconv. Comput. 17(1-2): 31-60 (2022) - [j26]Dmitry A. Zaitsev
Spatial specification of hypertorus interconnect by infinite and reenterable coloured Petri nets. Int. J. Parallel Emergent Distributed Syst. 37(1): 1-21 (2022) - [j25]Dmitry A. Zaitsev
From strong to exact Petri net computers. Int. J. Parallel Emergent Distributed Syst. 37(2): 167-186 (2022) - [j24]Dmitry A. Zaitsev
Aggregation of clans to speed-up solving linear systems on parallel architectures. Int. J. Parallel Emergent Distributed Syst. 37(2): 198-219 (2022) - [j23]Birgit Pröll, Werner Retschitzegger, Wieland Schwinger
Modelling proof-of-work agreement protocol by coloured Petri nets. Int. J. Parallel Emergent Distributed Syst. 37(6): 597-612 (2022) - [i4]Dmitry A. Zaitsev:
Strong Sleptsov Net is Turing-Complete. CoRR abs/2201.09034 (2022) - [i3]Genaro J. Martínez, Andrew Adamatzky, Ricardo Quezada Figueroa, Eric Schweikardt, Dmitry A. Zaitsev, Ivan Zelinka, Luz Noé Oliva-Moreno:
Computing with Modular Robots. CoRR abs/2202.07127 (2022) - 2021
- [j22]Dmitry A. Zaitsev
Preface for special issue Petri/Sleptsov net based technology of programming for parallel, emergent and distributed systems. Int. J. Parallel Emergent Distributed Syst. 36(6): 495-497 (2021) - [c6]Dmitry A. Zaitsev, Peyman Ghaffari
Modeling Ebola Virus Dynamics by Colored Petri Nets. CECNet 2021: 707-715 - [c5]Dmitry A. Zaitsev, Tatiana R. Shmeleva, Peyman Ghaffari
Modeling Multidimensional Communication Lattices with Moore Neighborhood by Infinite Petri Nets. IDT 2021: 171-181 - 2020
- [c4]Dmitry Zaitsev, Piotr Luszczek:
Docker container based PaaS cloud computing comprehensive benchmarks using LAPACK. CMIS 2020: 323-337
2010 – 2019
- 2019
- [j21]Dmitry A. Zaitsev
Verification of hypertorus communication grids by infinite petri nets and process algebra. IEEE CAA J. Autom. Sinica 6(3): 733-742 (2019) - [j20]Dmitry Zaitsev
Solving Linear Diophantine Systems on Parallel Architectures. IEEE Trans. Parallel Distributed Syst. 30(5): 1158-1169 (2019) - 2018
- [j19]Dmitry A. Zaitsev:
Simulating Cellular Automata by Infinite Petri Nets. J. Cell. Autom. 13(1-2): 121-144 (2018) - 2017
- [j18]Dmitry A. Zaitsev, Dmitry Zaitsev, Tatiana R. Shmeleva:
Infinite Petri Nets: Part 1, Modeling Square Grid Structures. Complex Syst. 26(2) (2017) - [j17]Dmitry A. Zaitsev, Dmitry Zaitsev, Tatiana R. Shmeleva:
Infinite Petri Nets: Part 1, Modeling Square Grid Structures. Complex Syst. 26(2) (2017) - [j16]Dmitry A. Zaitsev, Dmitry Zaitsev, Tatiana R. Shmeleva:
Infinite Petri Nets: Part 2, Modeling Triangular, Hexagonal, Hypercube and Hypertorus Structures. Complex Syst. 26(4) (2017) - [j15]Dmitry A. Zaitsev, Dmitry Zaitsev, Tatiana R. Shmeleva:
Infinite Petri Nets: Part 2, Modeling Triangular, Hexagonal, Hypercube and Hypertorus Structures. Complex Syst. 26(4) (2017) - [j14]Dmitry A. Zaitsev
Universal Sleptsov net. Int. J. Comput. Math. 94(12): 2396-2408 (2017) - [j13]Dmitry A. Zaitsev
A generalized neighborhood for cellular automata. Theor. Comput. Sci. 666: 21-35 (2017) - 2016
- [j12]Dmitry A. Zaitsev
Security of grid structures under disguised traffic attacks. Clust. Comput. 19(3): 1183-1200 (2016) - [j11]Dmitry Zaitsev
Sequential composition of linear systems' clans. Inf. Sci. 363: 292-307 (2016) - [j10]Dmitry A. Zaitsev
Sleptsov Nets Run Fast. IEEE Trans. Syst. Man Cybern. Syst. 46(5): 682-693 (2016) - [i2]Dmitry A. Zaitsev:
k-neighborhood for Cellular Automata. CoRR abs/1605.08870 (2016) - 2015
- [c3]Dmitry A. Zaitsev
Universality in Infinite Petri Nets. MCU 2015: 180-197 - 2014
- [j9]Dmitry A. Zaitsev
Paradigm of computations on the Petri nets. Autom. Remote. Control. 75(8): 1369-1383 (2014) - [j8]Dmitry A. Zaitsev
Toward the Minimal Universal Petri Net. IEEE Trans. Syst. Man Cybern. Syst. 44(1): 47-58 (2014) - 2013
- [j7]Dmitry A. Zaitsev
Verification of computing grids with special edge conditions by infinite Petri nets. Autom. Control. Comput. Sci. 47(7): 403-412 (2013) - [c2]Dmitry A. Zaitsev
A Small Universal Petri Net. MCU 2013: 190-202 - [i1]Dmitry Anatoly Zaitsev
Small Polynomial Time Universal Petri Nets. CoRR abs/1309.7288 (2013) - 2012
- [j6]Dmitry Anatoly Zaitsev
Inhibitor Petri net executing an arbitrary given Markov normal algorithm. Autom. Control. Comput. Sci. 46(7): 345-355 (2012) - 2011
- [j5]Dmitry Anatoly Zaitsev
A Parametric Colored Petri Net Model of a Switched Network. Int. J. Commun. Netw. Syst. Sci. 4(1): 65-76 (2011) - [j4]Dmitry Anatoly Zaitsev
Stack E6 and Its Implementation within Linux Kernel. J. Softw. Eng. Appl. 4(6): 379-387 (2011) - 2010
- [j3]Peter Vorobiyenko, Kirill Dmitry Guliaiev, Dmitry Anatoly Zaitsev
PBB Efficiency Evaluation via Colored Petri Net Models. Commun. Netw. 2(2): 113-124 (2010) - [c1]Dmitry Zaitsev:
Universal Inhibitor Petri Net. AWPN 2010: 1-15
2000 – 2009
- 2009
- [j2]Dmitry Anatoly Zaitsev
Solving Linear Systems via Composition of their Clans. Intell. Inf. Manag. 1(2): 73-80 (2009) - 2004
- [j1]Dmitry Anatoly Zaitsev
Switched LAN simulation by colored Petri nets. Math. Comput. Simul. 65(3): 245-249 (2004)
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-09-22 00:39 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: