Algorithmic approach to counting of certain types m-ary partitions. - Valentin P. Bakoev (Discret. Math., 2004)

A method for efficiently computing the number of codewords of fixed weights in linear codes. - Iliya Bouyukliev; Valentin P. Bakoev (Discret. Appl. Math., 2008)

The recurrence relations in teaching students of informatics. - Valentin P. Bakoev (Informatics Educ., 2010)

About the ordinances of the vectors of the n-dimensional Boolean cube in accordance with their weights. - Valentin P. Bakoev (CoRR, 2018)

Fast Computing the Algebraic Degree of Boolean Functions. - Valentin P. Bakoev (CAI, 2019)

Combinatorial and Algorithmic Properties of One Matrix Structure at Monotone Boolean Functions. - Valentin P. Bakoev (CoRR, 2019)

A Method for Fast Computing the Algebraic Degree of Boolean Functions. - Valentin P. Bakoev (CompSysTech, 2020)

Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube. - Valentin P. Bakoev (Discret. Math. Algorithms Appl., 2021)

Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change. - Valentin P. Bakoev (CAI, 2022)

Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths. - Stoyan Kapralov; Valentin P. Bakoev; Kaloyan Kapralov (CoRR, 2023)

Generating m-Ary Gray Codes and Related Algorithms. - Stefka Bouyuklieva; Iliya Bouyukliev; Valentin P. Bakoev; Maria Pashinska-Gadzheva (Algorithms, 2024)