Boolean Decomposition Based on Cyclic Chains. - Elena Dubrova; Maxim Teslenko; Johan Karlsson (ICCD, 2003)

Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth. - Maxim Teslenko; Elena Dubrova (ICCAD, 2004)

On relation between non-disjoint decomposition and multiple-vertex dominators. - Elena Dubrova; Maxim Teslenko; Andrés Martinelli (ISCAS (4), 2004)

An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs. - Maxim Teslenko; Elena Dubrova (DATE, 2005)

Computing attractors in dynamic networks. - Elena Dubrova; Maxim Teslenko; Hannu Tenhunen (IADIS AC, 2005)

Kauffman networks: analysis and applications. - Elena Dubrova; Maxim Teslenko; Andrés Martinelli (ICCAD, 2005)

Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum. - Maxim Teslenko; Andrés Martinelli; Elena Dubrova (IEEE Trans. Computers, 2005)

A computational model based on Random Boolean Networks. - Elena Dubrova; Maxim Teslenko; Hannu Tenhunen (BIONETICS, 2007)

On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers. - Elena Dubrova; Maxim Teslenko; Hannu Tenhunen (DATE, 2008)

A Computational Scheme Based on Random Boolean Networks. - Elena Dubrova; Maxim Teslenko; Hannu Tenhunen (Trans. Comp. Sys. Biology, 2008)

All Around Logic Synthesis. - Maxim Teslenko (2008)

A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks. - Elena Dubrova; Maxim Teslenko (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-based Bounded Model Checking. - Elena Dubrova; Ming Liu; Maxim Teslenko (J. Multiple Valued Log. Soft Comput., 2012)

A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex. - Maxim Teslenko; Elena Dubrova (CoRR, 2015)

A Fast Heuristic Algorithm for Redundancy Removal. - Maxim Teslenko; Elena Dubrova (CoRR, 2015)

A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream Ciphers. - Elena Dubrova; Maxim Teslenko (IACR Cryptol. ePrint Arch., 2016)

An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms. - Elena Dubrova; Maxim Teslenko (HOST, 2018)

Predicting Interference Graphs from Data: A Machine Learning Approach. - Prayag Gowgi; Jishnu Sadasivan; Maxim Teslenko (SPCOM, 2024)