default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxim Teslenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Prayag Gowgi, Jishnu Sadasivan, Maxim Teslenko:
Predicting Interference Graphs from Data: A Machine Learning Approach. SPCOM 2024: 1-5
2010 – 2019
- 2018
- [c10]Elena Dubrova, Maxim Teslenko:
An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms. HOST 2018: 65-72 - 2016
- [i3]Elena Dubrova, Maxim Teslenko:
A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream Ciphers. IACR Cryptol. ePrint Arch. 2016: 1068 (2016) - 2015
- [i2]Maxim Teslenko, Elena Dubrova:
A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex. CoRR abs/1503.04994 (2015) - [i1]Maxim Teslenko, Elena Dubrova:
A Fast Heuristic Algorithm for Redundancy Removal. CoRR abs/1503.06632 (2015) - 2012
- [j4]Elena Dubrova, Ming Liu, Maxim Teslenko:
Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-based Bounded Model Checking. J. Multiple Valued Log. Soft Comput. 19(1-3): 109-131 (2012) - 2011
- [j3]Elena Dubrova, Maxim Teslenko:
A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1393-1399 (2011) - 2010
- [c9]Elena Dubrova, Maxim Teslenko, Ming Liu:
Finding Attractors in Synchronous Multiple-Valued Networks Using SAT-Based Bounded Model Checking. ISMVL 2010: 144-149
2000 – 2009
- 2008
- [b1]Maxim Teslenko:
All Around Logic Synthesis. KTH Royal Institute of Technology, Sweden, 2008 - [j2]Elena Dubrova, Maxim Teslenko, Hannu Tenhunen:
A Computational Scheme Based on Random Boolean Networks. Trans. Comp. Sys. Biology 10: 41-58 (2008) - [c8]Elena Dubrova, Maxim Teslenko, Hannu Tenhunen:
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers. DATE 2008: 1286-1291 - 2007
- [c7]Elena Dubrova, Maxim Teslenko, Hannu Tenhunen:
A computational model based on Random Boolean Networks. BIONETICS 2007: 24-31 - 2005
- [j1]Maxim Teslenko, Andrés Martinelli, Elena Dubrova:
Bound-Set Preserving ROBDD Variable Orderings May Not Be Optimum. IEEE Trans. Computers 54(2): 236-237 (2005) - [c6]Maxim Teslenko, Elena Dubrova:
An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs. DATE 2005: 406-411 - [c5]Elena Dubrova, Maxim Teslenko, Hannu Tenhunen:
Computing attractors in dynamic networks. IADIS AC 2005: 535-542 - [c4]Elena Dubrova, Maxim Teslenko, Andrés Martinelli:
Kauffman networks: analysis and applications. ICCAD 2005: 479-484 - 2004
- [c3]Maxim Teslenko, Elena Dubrova:
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth. ICCAD 2004: 748-751 - [c2]Elena Dubrova, Maxim Teslenko, Andrés Martinelli:
On relation between non-disjoint decomposition and multiple-vertex dominators. ISCAS (4) 2004: 493-496 - 2003
- [c1]Elena Dubrova, Maxim Teslenko, Johan Karlsson:
Boolean Decomposition Based on Cyclic Chains. ICCD 2003: 504-509
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-18 02:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
