Maxim Teslenko

19 papers A 4C 2Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2024 — conf
Predicting Interference Graphs from Data: A Machine Learning Approach.
SPCOM
Prayag Gowgi, Jishnu Sadasivan, Maxim Teslenko
2018 — conf
An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms.
HOST
Elena Dubrova, Maxim Teslenko
2016 J jnl
A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream Ciphers.
IACR Cryptol. ePrint Arch.
Elena Dubrova, Maxim Teslenko
2015 J jnl
A Fast Heuristic Algorithm for Redundancy Removal.
CoRR
Maxim Teslenko, Elena Dubrova
2015 J jnl
A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex.
CoRR
Maxim Teslenko, Elena Dubrova
2012 J jnl
Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-based Bounded Model Checking.
J. Multiple Valued Log. Soft Comput.
Elena Dubrova, Ming Liu, Maxim Teslenko
2011 J jnl
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks.
IEEE ACM Trans. Comput. Biol. Bioinform.
Elena Dubrova, Maxim Teslenko
2010 — conf
Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model Checking.
ISMVL
Elena Dubrova, Maxim Teslenko, Ming Liu
2008 J jnl
A Computational Scheme Based on Random Boolean Networks.
Trans. Comp. Sys. Biology
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
2008 — —
All Around Logic Synthesis.
Maxim Teslenko
2008 A conf
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers.
DATE
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
2007 — conf
A computational model based on Random Boolean Networks.
BIONETICS
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
2005 A conf
An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs.
DATE
Maxim Teslenko, Elena Dubrova
2005 J jnl
Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum.
IEEE Trans. Computers
Maxim Teslenko, Andrés Martinelli, Elena Dubrova
2005 C conf
Computing attractors in dynamic networks.
IADIS AC
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
2005 A conf
Kauffman networks: analysis and applications.
ICCAD
Elena Dubrova, Maxim Teslenko, Andrés Martinelli
2004 A conf
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth.
ICCAD
Maxim Teslenko, Elena Dubrova
2004 — conf
On relation between non-disjoint decomposition and multiple-vertex dominators.
ISCAS (4)
Elena Dubrova, Maxim Teslenko, Andrés Martinelli
2003 C conf
Boolean Decomposition Based on Cyclic Chains.
ICCD
Elena Dubrova, Maxim Teslenko, Johan Karlsson