Maxim Teslenko

According to our database, Maxim Teslenko authored at least 17 papers between 2003 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms.

Elena Dubrova, Maxim Teslenko

Proceedings of the 2018 IEEE International Symposium on Hardware Oriented Security and Trust, 2018

2016

A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream Ciphers.

Elena Dubrova, Maxim Teslenko

IACR Cryptol. ePrint Arch., 2016

2015

A Fast Heuristic Algorithm for Redundancy Removal.

Maxim Teslenko, Elena Dubrova

CoRR, 2015

A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex.

Maxim Teslenko, Elena Dubrova

CoRR, 2015

2012

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

2011

A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks.

Elena Dubrova, Maxim Teslenko

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

2008

All Around Logic Synthesis.

Maxim Teslenko

PhD thesis, 2008

A Computational Scheme Based on Random Boolean Networks.

Elena Dubrova, Maxim Teslenko, Hannu Tenhunen

Trans. Comp. Sys. Biology, 2008

On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers.

Elena Dubrova, Maxim Teslenko, Hannu Tenhunen

Proceedings of the Design, Automation and Test in Europe, 2008

2007

A computational model based on Random Boolean Networks.

Elena Dubrova, Maxim Teslenko, Hannu Tenhunen

Proceedings of the 2nd International ICST Conference on Bio-Inspired Models of Network, 2007

2005

Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum.

Maxim Teslenko, Andrés Martinelli, Elena Dubrova

IEEE Trans. Computers, 2005

Kauffman networks: analysis and applications.

Elena Dubrova, Maxim Teslenko, Andrés Martinelli

Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

Computing attractors in dynamic networks.

Elena Dubrova, Maxim Teslenko, Hannu Tenhunen

Proceedings of the AC 2005, 2005

An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs.

Maxim Teslenko, Elena Dubrova

Proceedings of the 2005 Design, 2005

2004

On relation between non-disjoint decomposition and multiple-vertex dominators.

Elena Dubrova, Maxim Teslenko, Andrés Martinelli

Proceedings of the 2004 International Symposium on Circuits and Systems, 2004

Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth.

Maxim Teslenko, Elena Dubrova

Proceedings of the 2004 International Conference on Computer-Aided Design, 2004

2003

Boolean Decomposition Based on Cyclic Chains.

Elena Dubrova, Maxim Teslenko, Johan Karlsson

Proceedings of the 21st International Conference on Computer Design (ICCD 2003), 2003