Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniil Averkov

dblp:395/5660 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
boolean function realization
0.912025
Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis · AAAI 2025
Electronic design automation › logic synthesis › circuit optimization
circuit minimization
0.912025
Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis · AAAI 2025
Electronic design automation
hardware verification and test
0.912025
Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis · AAAI 2025
Electronic design automation
logic synthesis
0.912025
Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis · AAAI 2025

Methods — techniques the papers use, named apart from their topics

circuit optimization algorithms · 0.9
YearPublicationVenuePosition
2025 Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis
abstract
We present an open-source tool for manipulating Boolean circuits. It implements efficient algorithms, both existing and novel, for a rich variety of frequently used circuit tasks such as satisfiability, synthesis, and minimization. We tested the tool on a wide range of practically relevant circuits (computing, in particular, symmetric and arithmetic functions) that have been optimized intensively by the community for the last three years. The tool helped us to win the IWLS 2024 Programming Contest. In 2023, it was Google DeepMind who took the first place in the competition. We were able to reduce the size of the best circuits from 2023 by 12% on average, whereas for some individual circuits, our size reduction was as large as 83%.
Daniil Averkov, Tatiana Belova, Gregory Emdin, Mikhail Goncharov, Viktoriia Krivogornitsyna, Alexander S. Kulikov, Fedor Kurmazov, Daniil Levtsov, Georgie Levtsov, Vsevolod Vaskin, Aleksey Vorobiev
AAAI1