default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir I. Ulyantsev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Daniil Chivilikhin
, Ilya Zakirzyanov, Vladimir Ulyantsev:
BeBoSy: Behavior Examples Meet Bounded Synthesis. IEEE Access 9: 27540-27551 (2021)- [c26]Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev:
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. CP 2021: 47:1-47:18
2010 – 2019
- 2019
- [j6]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin:
Function Block Finite-State Model Identification Using SAT and CSP Solvers. IEEE Trans. Ind. Informatics 15(8): 4558-4568 (2019) - [c25]Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev:
Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis. EvoApplications 2019: 237-253 - [c24]Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev:
Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. GECCO 2019: 312-320 - [c23]Ilya Zakirzyanov, António Morgado, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva:
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. LATA 2019: 159-173 - [c22]Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev, Oleg Zaikin:
Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. MIPRO 2019: 1144-1149 - [i4]Dmitrii Suvorov, Vladimir Ulyantsev:
Smart Contract Design Meets State Machine Synthesis: Case Studies. CoRR abs/1906.02906 (2019) - 2018
- [j5]Evgenii I Olekhnovich, Artem T. Vasilyev, Vladimir Ulyantsev, Elena S. Kostryukova, Alexander V. Tyakht:
MetaCherchant: analyzing genomic context of antibiotic resistance genes in gut microbiota. Bioinform. 34(3): 434-444 (2018) - [j4]Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto:
Exact finite-state machine identification from scenarios and temporal properties. Int. J. Softw. Tools Technol. Transf. 20(1): 35-55 (2018) - [c21]Daniil Chivilikhin, Igor Buzhinsky, Vladimir I. Ulyantsev, Andrey Stankevich, Anatoly Shalyto, Valeriy Vyatkin:
Counterexample-guided inference of controller logic from execution traces and temporal formulas. ETFA 2018: 91-98 - [c20]Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Andrey Stankevich, Ilya Zakirzyanov, Valeriy Vyatkin, Anatoly Shalyto:
Active Learning of Formal Plant Models For Cyber-Physical Systems. INDIN 2018: 719-724 - [i3]Vyacheslav Moklev, Vladimir Ulyantsev:
BFS Enumeration for Breaking Symmetries in Graphs. CoRR abs/1804.02273 (2018) - 2017
- [c19]Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Closed-loop verification of a compensating group drive model using synthesized formal plant model. ETFA 2017: 1-4 - [c18]Ilya Kachalsky, Ilya Zakirzyanov, Vladimir Ulyantsev:
Applying Reinforcement Learning and Supervised Learning Techniques to Play Hearthstone. ICMLA 2017: 1145-1148 - [c17]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin:
CSP-based inference of function block finite-state models from execution traces. INDIN 2017: 714-719 - [c16]Dmitry Avdyukhin, Daniil Chivilikhin, Georgiy Korneev, Vladimir Ulyantsev, Anatoly Shalyto:
Plant trace generation for formal plant model inference: Methods and case study. INDIN 2017: 746-752 - [c15]Ilya Zakirzyanov, Anatoly Shalyto, Vladimir Ulyantsev:
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach. SEFM Workshops 2017: 117-131 - 2016
- [j3]Daniil S. Chivilikhin, Vladimir I. Ulyantsev, Anatoly A. Shalyto:
Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas. Autom. Remote. Control. 77(3): 473-484 (2016) - [j2]Vladimir Ulyantsev, Sergey Kazakov, Veronika B. Dubinkina, Alexander V. Tyakht, Dmitry G. Alexeev:
MetaFast: fast reference-free graph-based comparison of shotgun metagenomic data. Bioinform. 32(18): 2760-2767 (2016) - [j1]Veronika B. Dubinkina, Dmitry S. Ischenko, Vladimir Ulyantsev, Alexander V. Tyakht, Dmitry G. Alexeev:
Assessment of k-mer spectrum applicability for metagenomic dissimilarity analysis. BMC Bioinform. 17: 38 (2016) - [i2]Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto:
Exact Finite-State Machine Identification from Scenarios and Temporal Properties. CoRR abs/1601.06945 (2016) - [i1]Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto:
Symmetry Breaking Predicates for SAT-based DFA Identification. CoRR abs/1602.05028 (2016) - 2015
- [c14]Vladimir Ulyantsev, Mikhail Melnik:
Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver. AlCoB 2015: 141-153 - [c13]Igor Buzhinsky, Vladimir Ulyantsev, Jari Veijalainen, Valeriy Vyatkin:
Evolutionary approach to coverage testing of IEC 61499 function block applications. INDIN 2015: 1213-1218 - [c12]Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto:
BFS-Based Symmetry Breaking Predicates for DFA Identification. LATA 2015: 611-622 - 2014
- [c11]Daniil Chivilikhin, Vladimir Ulyantsev:
Inferring automata-based programs from specification with mutation-based ant colony optimization. GECCO (Companion) 2014: 67-68 - [c10]Igor Buzhinsky, Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev:
Improving the quality of supervised finite-state machine construction using real-valued variables. GECCO (Companion) 2014: 1037-1040 - [c9]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties. ICMLA 2014: 350-355 - 2013
- [c8]Igor Buzhinsky, Vladimir Ulyantsev, Fedor Tsarev, Anatoly Shalyto:
Search-based construction of finite-state machines with real-valued actions: new representation model. GECCO (Companion) 2013: 199-200 - [c7]Daniil Chivilikhin, Vladimir Ulyantsev:
MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines. GECCO 2013: 511-518 - [c6]Daniil Chivilikhin, Vladimir Ulyantsev:
Learning Finite-State Machines: Conserving Fitness Function Evaluations by Marking Used Transitions. ICMLA (2) 2013: 90-95 - [c5]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Solving Five Instances of the Artificial Ant Problem with Ant Colony Optimization. MIM 2013: 1043-1048 - [c4]Igor Buzhinsky, Vladimir Ulyantsev, Anatoly Shalyto:
Test-Based Induction of Finite-State Machines with Continuous Output Actions. MIM 2013: 1049-1054 - 2012
- [c3]Daniil Chivilikhin, Vladimir Ulyantsev:
Learning Finite-State Machines with Ant Colony Optimization. ANTS 2012: 268-275 - [c2]Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev:
Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization. GECCO (Companion) 2012: 603-606 - 2011
- [c1]Vladimir Ulyantsev, Fedor Tsarev:
Extended Finite-State Machine Induction Using SAT-Solver. ICMLA (2) 2011: 346-349
Coauthor Index
aka: Daniil Chivilikhin
aka: Anatoly A. Shalyto
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-05-08 21:50 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:
