| Publication | Date of Publication | Type |
|---|
| Method of the Joint Clustering in Network and Correlation Spaces | 2023-01-17 | Paper |
| The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm | 2023-01-17 | Paper |
| Modification of the method of generation of control finite-state machines with continuous actions based on training examples | 2018-04-11 | Paper |
| Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas | 2016-11-01 | Paper |
| Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs | 2015-03-23 | Paper |
| Method of reduced tables for generation of automata with a large number of input variables based on genetic programming | 2015-03-23 | Paper |
| Inducing finite state machines from training samples using ant colony optimization | 2015-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5172163 | 2015-02-12 | Paper |
| The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior | 2014-01-23 | Paper |
| Multifunctional logic modules consisting of elements with bilateral conductance | 2013-04-12 | Paper |
| Graphical inheritance notation for state-based classes | 2008-06-09 | Paper |
| Tools for support of automata-based programming | 2008-06-09 | Paper |
| Classification of structures generated by one-dimensional binary cellular automata from a point embryo | 2007-10-30 | Paper |
| Methods for constructing multifunctional logic modules | 2007-10-30 | Paper |
| Multiplexor method for realization of Boolean functions by circuits composed of arbitrary logical elements | 2007-05-16 | Paper |
| Decomposition of Boolean functions with respect to the right-most input variables of the truth tables | 2007-05-16 | Paper |
| Modules which are universal in the class of self-dual functions and in close classes | 2005-10-11 | Paper |
| Study of transients in one-contour logical circuits | 2005-09-23 | Paper |
| Logic control and ``reactive systems: algorithmization and programming | 2005-06-17 | Paper |
| Linearized graph algorithms for Boolean formulas: independent-fragment design method | 2004-10-19 | Paper |
| SWITCH technology: An automated approach to developing software for reactive systems | 2003-09-01 | Paper |
| Translating iterative algorithms into automaton ones | 2003-09-01 | Paper |
| Algorithmic graph schemes and transition graphs: Their use in software realization of logical control algorithms. I | 2000-04-26 | Paper |
| Algorithmic graph schemes and transition graphs: Their application in software realization of logical control algorithms. II | 2000-04-26 | Paper |
| Realization of systems of Boolean functions by linear arithmetic polynomials with masking | 2000-01-16 | Paper |
| Modules with paraphase input variables that are universal in the class of all Boolean functions | 1999-12-02 | Paper |
| Realization of Boolean functions by one linear arithmetic polynomial with masking | 1999-05-24 | Paper |
| Realization of Boolean formulas by uniform multiplexor and majority cascades | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4210549 | 1998-09-22 | Paper |
| Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes | 1997-04-21 | Paper |
| Realization of systems of Boolean functions by linear arithmetic polynomials | 1994-05-24 | Paper |
| Generating Boolean functions via arithmetic polynomials | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495122 | 1988-01-01 | Paper |
| System of transformations of certain representations of Boolean functions | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3712244 | 1985-01-01 | Paper |
| Tunable binary procedures and programs with loops | 1984-01-01 | Paper |
| Bounds on the realization complexity of Boolean formulas by tree circuits of tunable modules | 1981-01-01 | Paper |
