Volodymyr G. Skobelev

From MaRDI portal
Person:821296

Available identifiers

zbMath Open skobelev.vladimir-gMaRDI QIDQ821296

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60393112023-05-05Paper
Analysis of faults in cyber-physical systems by finite discrete-time Markov chains2021-09-20Paper
https://portal.mardi4nfdi.de/entity/Q51461972021-01-25Paper
A general analytical model of queuing system for Internet of things applications2020-11-02Paper
Imbrication algebras -- algebraic structures of nesting order2020-11-02Paper
https://portal.mardi4nfdi.de/entity/Q51170402020-08-20Paper
https://portal.mardi4nfdi.de/entity/Q51170452020-08-20Paper
https://portal.mardi4nfdi.de/entity/Q51170572020-08-20Paper
https://portal.mardi4nfdi.de/entity/Q51170632020-08-20Paper
Finite automata over algebraic structures: models and some methods of analysis2018-07-03Paper
Set-theoretic analysis of nominative data2018-07-03Paper
Proving properties of programs on hierarchical nominative data2018-07-03Paper
Nominative data with ordered set of names2018-07-03Paper
Finite automata over magmas: models and some applications in cryptography2018-07-03Paper
Cyber-physical systems2018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q28348872016-11-25Paper
A probabilistic model for the interaction of an agent with a network environment2016-04-18Paper
https://portal.mardi4nfdi.de/entity/Q34643752016-01-20Paper
https://portal.mardi4nfdi.de/entity/Q52546422015-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52538312015-05-28Paper
https://portal.mardi4nfdi.de/entity/Q29334502014-12-10Paper
Some subsets of automata over a finite ring2014-10-30Paper
On the computational security of quantum algorithms for transformation of information2014-06-30Paper
On the complexity of analysis of automata over a finite ring2014-06-05Paper
https://portal.mardi4nfdi.de/entity/Q29015782012-07-31Paper
https://portal.mardi4nfdi.de/entity/Q29017802012-07-31Paper
https://portal.mardi4nfdi.de/entity/Q28968482012-07-16Paper
https://portal.mardi4nfdi.de/entity/Q28799882012-04-10Paper
https://portal.mardi4nfdi.de/entity/Q30910852011-09-08Paper
https://portal.mardi4nfdi.de/entity/Q30136162011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q53913532011-04-06Paper
https://portal.mardi4nfdi.de/entity/Q30761902011-02-22Paper
Analysis of a class of easily computable permutations2009-03-27Paper
https://portal.mardi4nfdi.de/entity/Q35080042008-06-26Paper
https://portal.mardi4nfdi.de/entity/Q35101382008-06-26Paper
https://portal.mardi4nfdi.de/entity/Q35101462008-06-26Paper
https://portal.mardi4nfdi.de/entity/Q35078292008-06-23Paper
https://portal.mardi4nfdi.de/entity/Q35078522008-06-23Paper
Nonlinear automata over a finite ring2007-10-31Paper
https://portal.mardi4nfdi.de/entity/Q35946172007-08-09Paper
https://portal.mardi4nfdi.de/entity/Q57105092005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q48177262004-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48074392003-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42693362002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q27706142002-02-13Paper
https://portal.mardi4nfdi.de/entity/Q27404822001-12-03Paper
https://portal.mardi4nfdi.de/entity/Q27404812001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q27401552001-09-16Paper
https://portal.mardi4nfdi.de/entity/Q27401662001-09-16Paper
https://portal.mardi4nfdi.de/entity/Q27404212001-09-16Paper
https://portal.mardi4nfdi.de/entity/Q27209242001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q45185782000-12-01Paper
https://portal.mardi4nfdi.de/entity/Q43896081999-11-08Paper
Identification of boolean functions by methods of linear algebra1998-03-17Paper
Representation of automata by groups1994-03-13Paper
Searching for partially ordered structures1993-01-16Paper
A minimization method for boolean functions1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q38242361989-01-01Paper
Studying the controllabiity of combinational circuits1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37452861985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37065071984-01-01Paper
Methods of constructing minimal diagnosing words for an automaton and the complexity of their realization1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190801981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190811981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190851981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38995211980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40918511975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Volodymyr G. Skobelev