(Here listed main ones since 1997, total amount of publications is 92):

1. Comparison of models for associative parallel computations In: Programming, 1997, No.6, 41-50 (in Russian). (English translation by Plenum Press, USA). (with M.A. Vladyko).
2. An Efficient Associative Algorithm for Finding the Smallest Spanning Tree with a Degree Constrained. In: Cybernetics and System Analysis. Kiev: Naukova Dumka, 1998, No.1, 94--103 (in Russian). (English translation by Plenum Press, USA).
3. An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. In: Proceedings of the Seventh International Conference on Parallel and Distributed Systems, IEEE Computer Society Press, (ICPADS 2000), Iwate, Japan, 2000, 455-462.
4. A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. In: Fundamenta Informaticae, IOS Press, Amsterdam, v. 43, 2000, 227-243. (with M.A. Dvoskina).
5. Comparison of performing the Prim--Dijkstra alrorithm and the Kruskal algorithm by means of associative parallel processors. In: Cybertetics and System Analysis, Kiev: Naukova Dumka, No. 2, 2000, 19-27. (in Russian). (English translation by Plenum Press, USA).
6. Representation of Edmonds' algorithm for finding optimum branching on associative parallel processors. In: Programming, No. 4, 2001, 43-52. (in Russian). (English translation by Plenum Press, USA).
7. An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in~Directed Graphs, Proceedings of the 6-th Intern. Conf. PaCT-2001, Lect. Notes in Comp. Sci., (Springer--Verlag, Berlin), 2001, v. 2127, 285-292.
8. Efficient Implementation of Edmonds' Algorithm for Finding Optimum Branchings on Associative Parallel Processors, Proc. of the Eighth Intern. Conf. on Parallel and Distributed Systems (ICPADS'01), (IEEE Computer Society Press), KyongJu City, Korea, 2001, 3-8.
9. Associative Parallel Algorithms for Dynamic Edge Updates of Minimum Spanning Trees. Intern. Conf. Pact 2003, Proceedings, Lecture Notes in Computer Science, 2003, v. 2763, 141-150.
10. Associative Graph Processor and its Properties. Proc. of the International Conference on Parallel Computing in Electrical Engineering (PARELEC 2004), Dresden, Germany, 2004, 297-302 (together with Kokosinski).