Get started
Author

Dmitry Vladimirovich Zakablukov

Observed names: D. V. Zakablukov, Dmitry V. Zakablukov, Zakablukov, Dmitry V., Д.В. Закаблуков
ORCID: 0000-0001-6584-6443
Observed ORCID: 0000-0001-6584-6443
OpenAlex ID: A5064690298
On asymptotic gate complexity and depth of reversible circuits without additional memory
2016 · Dmitry V. Zakablukov · Journal of Computer and System Sciences · 16
Application of Permutation Group Theory in Reversible Logic Synthesis
2016 · Dmitry V. Zakablukov · Lecture notes in computer science · 16
PDF
On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
2017 · Dmitry V. Zakablukov · Discrete Mathematics and Applications · 6
Fast synthesis of invertible circuits based on permutation group theory
2014 · D. V. Zakablukov · PRIKLADNAYa DISKRETNAYa MATEMATIKA · 5
On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
2021 · Dmitry V. Zakablukov · Discrete Mathematics and Applications · 4
О сложности обратимых схем, состоящих из функциональных элементов NOT, CNOT и 2-CNOT
2016 · Dmitry Vladimirovich Zakablukov · Дискретная математика · 3
PDF
Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
2016 · D. V. Zakablukov · Moscow University Mathematics Bulletin · 2
О зависимости сложности и глубины обратимых схем, состоящих из функциональных элементов NOT, CNOT и 2-CNOT, от числа дополнительных входов
2020 · Dmitry Vladimirovich Zakablukov · Дискретная математика · 1
Synthesis methods for reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Ph.D. thesis)
2018 · Zakablukov, Dmitry V. · arXiv (Cornell University) · 1
PDF
General Upper Bounds for Gate Complexity and Depth of Reversible Circuits Consisting of NOT, CNOT and 2-CNOT Gates
2017 · Zakablukov, Dmitry V. · arXiv (Cornell University) · 1
PDF
On Asymptotic Gate Complexity and Depth of Reversible Circuits With Additional Memory
2015 · Zakablukov, Dmitry V. · arXiv (Cornell University) · 1
PDF
Вентильная сложность обратимых схем как мера сложности четных подстановок
2015 · Dmitry V. Zakablukov · CyberLeninK (CyberLeninka) · 1
Снижение вентильной сложности обратимых схем без использования таблиц эквивалентных замен композиций вентилей
2014 · Dmitry V. Zakablukov · CyberLeninK (CyberLeninka) · 1
Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
2022 · Dmitry V. Zakablukov · Discrete Mathematics and Applications
PDF
Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
2022 · Dmitry V. Zakablukov · Discrete Mathematics and Applications
On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
2022 · Dmitry V. Zakablukov · Discrete Mathematics and Applications
О синтезе обратимых схем из элементов NOT, CNOT и 2-CNOTс малым числом дополнительных входов
2021 · Dmitry Vladimirovich Zakablukov · Дискретная математика
PDF
Обратимые вычисления: обзор проблемы и новые результаты (отказоустойчивость и криптография)
2019 · А.Е. Жуков, С.И. Гуров, et al. · Sovremennye informacionnye tehnologii i IT-obrazovanie.
PDF
Asymptotic bounds of depth for a reversible circuit consisting of NOT, CNOT and 2-CNOT gates
2015 · Zakablukov, Dmitry V. · arXiv (Cornell University)
PDF
Asymptotic bounds of the gate complexity for the reversible circuit consisting of NOT, CNOT and 2-CNOT gates.
2014 · Dmitry V. Zakablukov · arXiv (Cornell University)
Works count: 20
Citation count: 58
H-index: 4
I10-index: 2
Year
Topic
Type