Maxim Teslenko - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2018

An efficient SAT-based algorithm for finding short cycles in cryptographic algorithmsElena Dubrova, Maxim Teslenko. host 2018: 65-72 [doi]

2016

A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream CiphersElena Dubrova, Maxim Teslenko. iacr, 2016:1068, 2016. [doi]

2012

Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-based Bounded Model CheckingElena Dubrova, Ming Liu, Maxim Teslenko. mvl, 19(1-3):109-131, 2012. [doi]

2011

A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean NetworksElena Dubrova, Maxim Teslenko. tcbb, 8(5):1393-1399, 2011. [doi]

2010

Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model CheckingElena Dubrova, Maxim Teslenko, Liu Ming. ismvl 2010: 144-149 [doi]

2008

On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift RegistersElena Dubrova, Maxim Teslenko, Hannu Tenhunen. date 2008: 1286-1291 [doi]

A Computational Scheme Based on Random Boolean NetworksElena Dubrova, Maxim Teslenko, Hannu Tenhunen. TCSB, 10:41-58, 2008. [doi]

All Around Logic SynthesisMaxim Teslenko. PhD thesis, KTH Royal Institute of Technology, Sweden, 2008. [doi]

2007

A computational model based on Random Boolean NetworksElena Dubrova, Maxim Teslenko, Hannu Tenhunen. BIONETICS 2011: 24-31 [doi]

2005

2004

On relation between non-disjoint decomposition and multiple-vertex dominatorsElena Dubrova, Maxim Teslenko, Andrés Martinelli. iscas 2004: 493-496

Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depthMaxim Teslenko, Elena Dubrova. iccad 2004: 748-751 [doi]

2003

Boolean Decomposition Based on Cyclic ChainsElena Dubrova, Maxim Teslenko, Johan Karlsson. iccd 2003: 504-509 [doi]

Sign in or sign up to see more results.

runs on WebDSL