Maxim Teslenko
Maxim Teslenko
Bestätigte E-Mail-Adresse bei ericsson.com
Titel
Zitiert von
Zitiert von
Jahr
MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large model space
F Ronquist, M Teslenko, P Van Der Mark, DL Ayres, A Darling, S Höhna, ...
Systematic biology 61 (3), 539-542, 2012
139262012
H€ ohna S, Larget B, Liu L, Suchard MA, Huelsenbeck JP. 2012. MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large model space
F Ronquist, M Teslenko, P Van der Mark, DL Ayres, A Darling
Systematic Biology 61 (539), e542, 0
190
A SAT-based algorithm for finding attractors in synchronous boolean networks
E Dubrova, M Teslenko
IEEE/ACM transactions on computational biology and bioinformatics 8 (5 …, 2011
1862011
Draft MrBayes version 3.2 manual: tutorials and model summaries
F Ronquist, J Huelsenbeck, M Teslenko
Distributed with the software from http://brahms. biology. rochester. edu …, 2011
1332011
MrBayes version 3.2 manual: tutorials and model summaries
F Ronquist, J Huelsenbeck, M Teslenko
Available with the software distribution at mrbayessourceforgenet/mb32_manualpdf, 2011
752011
van der, Ayres DL, Darling A, Höhna S, Larget B, Liu L, Suchard MA, Huelsenbeck JP (2012) MrBayes 3.2: efficient Bayesian phylogenetic inference and model choice across a large …
F Ronquist, M Teslenko, P Mark
Systematic Biology 61 (539), e542, 0
72
On analysis and synthesis of (n, k)-non-linear feedback shift registers
E Dubrova, M Teslenko, H Tenhunen
2008 Design, Automation and Test in Europe, 1286-1291, 2008
632008
Kauffman networks: Analysis and applications
E Dubrova, M Teslenko, A Martinelli
ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005 …, 2005
602005
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth
M Teslenko, E Dubrova
IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004 …, 2004
262004
Compositional properties of random Boolean networks
E Dubrova, M Teslenko
Physical Review E 71 (5), 056116, 2005
252005
Computing a perfect input assignment for probabilistic verification
M Teslenko, E Dubrova, H Tenhunen
VLSI Circuits and Systems II 5837, 929-936, 2005
202005
On relation between non-disjoint decomposition and multiple-vertex dominators
E Dubrova, M Teslenko, A Martinelli
2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No …, 2004
142004
An efficient algorithm for finding double-vertex dominators in circuit graphs
M Teslenko, E Dubrova
Design, Automation and Test in Europe, 406-411, 2005
132005
Finding attractors in synchronous multiple-valued networks using SAT-based bounded model checking
E Dubrova, M Teslenko, L Ming
2010 40th IEEE International Symposium on Multiple-Valued Logic, 144-149, 2010
112010
A computational scheme based on random Boolean networks
E Dubrova, M Teslenko, H Tenhunen
Transactions on Computational Systems Biology X, 41-58, 2008
112008
A sat-based algorithm for computing attractors in synchronous boolean networks
E Dubrova, M Teslenko
arXiv preprint arXiv:0901.4448, 2009
82009
Huelsenbeck JP
F Ronquist, M Teslenko, DL Ayres, A Darling, S Höhna, B Larget, L Liu, ...
MrBayes 3, 1572-1574, 2012
72012
A SAT-Based Algorithm for Finding Short Cycles in Shift Register Based Stream Ciphers.
E Dubrova, M Teslenko
IACR Cryptol. ePrint Arch. 2016, 1068, 2016
62016
Bound-set preserving ROBDD variable orderings may not be optimum
M Teslenko, A Martinelli, E Dubrova
IEEE Transactions on Computers 54 (2), 236-237, 2005
52005
P. van der Mark
F Ronquist, M Teslenko
Ayres, D., Darling, AS H hna, Larget, B., Liu, L., Suchard, MA and …, 2011
42011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20