default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir A. Zakharov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Tianxiang Tang
, Vladimir A. Zakharov:
On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. CIAA 2024: 332-346- 2022
- [j19]Anton R. Gnatenko, Vladimir A. Zakharov:
Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic. Autom. Control. Comput. Sci. 56(7): 649-660 (2022) - 2021
- [j18]Vladimir A. Zakharov:
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines. Autom. Control. Comput. Sci. 55(7): 670-701 (2021) - [j17]Evgenii M. Vinarskii, Vladimir A. Zakharov:
On the Modeling of Sequential Reactive Systems by Means of Real Time Automata. Autom. Control. Comput. Sci. 55(7): 751-762 (2021) - [j16]Anton R. Gnatenko, Vladimir A. Zakharov:
On the Model Checking Problem for Some Extension of CTL. Autom. Control. Comput. Sci. 55(7): 776-785 (2021) - 2020
- [j15]Alexander V. Shokurov, I. V. Abramova, Nikolay P. Varnovsky, Vladimir A. Zakharov:
On the Possibility of Secure Program Obfuscation in Some Model of Cloud Computing. Program. Comput. Softw. 46(7): 473-482 (2020)
2010 – 2019
- 2019
- [j14]M. M. Abbas, Vladimir A. Zakharov:
Even Simple π-Calculus Processes Are Difficult to Analyze. Autom. Control. Comput. Sci. 53(7): 573-583 (2019) - [j13]Anton R. Gnatenko, Vladimir A. Zakharov:
On the Expressive Power of Some Extensions of Linear Temporal Logic. Autom. Control. Comput. Sci. 53(7): 663-675 (2019) - [c16]Vladimir A. Zakharov:
Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata. LATA 2019: 146-158 - 2017
- [j12]Vladimir A. Zakharov, G. G. Temerbekova:
On the Minimization of Finite State Transducers over Semigroups. Autom. Control. Comput. Sci. 51(7): 523-530 (2017) - [j11]Vladimir A. Zakharov, S. R. Jaylauova:
On the Minimization Problem for Sequential Programs. Autom. Control. Comput. Sci. 51(7): 689-700 (2017) - 2015
- [j10]Evgeny V. Chemeritskiy, Vladimir A. Zakharov:
On network update problems for software defined networks. Autom. Control. Comput. Sci. 49(7): 437-444 (2015) - [j9]Dmitry Yu. Volkanov, Vladimir A. Zakharov, Daniil A. Zorin, Vladislav V. Podymov, Igor V. Konnov:
A combined toolset for the verification of real-time distributed systems. Program. Comput. Softw. 41(6): 325-335 (2015) - [j8]Nikolay P. Varnovskiy, Vladimir A. Zakharov, Nikolay N. Kuzyurin, Alexander V. Shokurov:
The current state of art in program obfuscations: definitions of obfuscation security. Program. Comput. Softw. 41(6): 361-372 (2015) - [c15]Vladimir A. Zakharov:
Equivalence Checking Problem for Finite State Transducers over Semigroups. CAI 2015: 208-221 - 2014
- [j7]Vladimir A. Zakharov, R. L. Smelyansky, Eugene V. Chemeritsky:
A formal model and verification problems for software defined networks. Autom. Control. Comput. Sci. 48(7): 398-406 (2014) - [j6]Igor V. Konnov, Vladislav V. Podymov, Dmitry Yu. Volkanov, Vladimir A. Zakharov, Daniil A. Zorin:
How to make a simple tool for verification of real-time systems. Autom. Control. Comput. Sci. 48(7): 534-542 (2014) - [c14]Tatyana A. Novikova, Vladimir A. Zakharov:
Two-sided unification is NP-complete. UNIF 2014: 55-61 - 2013
- [c13]Tatyana A. Novikova, Vladimir A. Zakharov:
Is it possible to unify sequential programs? UNIF@RTA/TLCA 2013: 35-45 - 2010
- [j5]Igor V. Konnov, Vladimir A. Zakharov:
An invariant-based approach to the verification of asynchronous parameterized networks. J. Symb. Comput. 45(11): 1144-1162 (2010)
2000 – 2009
- 2009
- [c12]Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Zakharov:
Anti-unification Algorithms and Their Applications in Program Analysis. Ershov Memorial Conference 2009: 413-423 - 2007
- [c11]Nikolay Kuzurin, Alexander V. Shokurov, Nikolay P. Varnovsky, Vladimir A. Zakharov:
On the Concept of Software Obfuscation in Computer Security. ISC 2007: 281-298 - 2006
- [c10]Gabriel Ciobanu, Vladimir A. Zakharov:
Encoding Mobile Ambients into the pi -Calculus. Ershov Memorial Conference 2006: 148-165 - 2005
- [j4]Igor V. Konnov, Vladimir A. Zakharov:
An Approach to the Verification of Symmetric Parameterized Distributed Systems. Program. Comput. Softw. 31(5): 225-236 (2005) - [c9]Rimma I. Podlovchenko, Dmitry M. Rusakov, Vladimir A. Zakharov:
On the Equivalence Problem for Programs with Mode Switching. CIAA 2005: 351-352 - 2004
- [c8]Vladimir A. Zakharov, Ivan Zakharyaschev:
On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata. CIAA 2004: 293-305 - 2003
- [c7]Nikolay P. Varnovsky, Vladimir A. Zakharov:
On the Possibility of Provably Secure Obfuscating Programs. Ershov Memorial Conference 2003: 91-102 - 2001
- [j3]Vladimir A. Zakharov:
Book Review: "Model Checking" by E. Clarke, O. Grumberg and D. A. Peled. J. Log. Comput. 11(6): 962-964 (2001) - [c6]Stanley Chow, Yuan Xiang Gu, Harold Johnson, Vladimir A. Zakharov:
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs. ISC 2001: 144-155 - [c5]Vladimir A. Zakharov:
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. MCU 2001: 133-152 - 2000
- [j2]Vladimir A. Zakharov:
On the Decidability of the Equivalence Problem for Monadic Recursive Programs. RAIRO Theor. Informatics Appl. 34(2): 157-172 (2000)
1990 – 1999
- 1999
- [j1]Vladimir A. Zakharov:
On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs. Grammars 2(3): 271-281 (1999) - 1998
- [c4]Vladimir A. Zakharov:
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs. ICALP 1998: 247-258 - 1997
- [c3]Vladimir A. Zakharov:
Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms. LFCS 1997: 419-429 - 1996
- [c2]Vladimir V. Spanopulo, Vladimir A. Zakharov:
On the Relationship between Models of Parallel Computations. Advances in Modal Logic 1996: 237-248
1980 – 1989
- 1987
- [c1]Vladimir A. Zakharov:
To the Functional Equivalence of Turing Machines. FCT 1987: 488-491
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-12-10 21:46 CET 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:
