2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2015
A Fast Heuristic Algorithm for Redundancy Removal
Maxim Teslenko, Elena Dubrova
Redundancy identification is an important step of the design flow that typically follows logic synthesis and optimization. In addition to reducing circuit area, power consumption,…
cs.DS2015
A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex
Maxim Teslenko, Elena Dubrova
Dominators provide a general mechanism for identifying reconverging paths in graphs. This is useful for a number of applications in Computer-Aided Design (CAD) including signal pro…
q-bio.MN2009★ 2 cited
A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks
Elena Dubrova, Maxim Teslenko
This paper addresses the problem of finding cycles in the state transition graphs of synchronous Boolean networks. Synchronous Boolean networks are a class of deterministic finite…