Researchers from HSE MIEM and Samara University have developed the LRF-3D algorithm to automatically bypass idle nodes in three-dimensional networks-on-chip. Thanks to its hierarchical architecture, the algorithm outperforms existing solutions in both speed and path accuracy, improving processor reliability for use in data centres, supercomputers, and AI computing. The source code and test results are publicly available.
Researchers at HSE University have developed a model for generating promoters and enhancers—DNA sequences that regulate gene activity. The model works directly with DNA nucleotides, without first transforming them into a continuous numerical representation. This solution could be useful for applications in synthetic biology and gene therapy. The study results were presented at the ICLR 2026 Workshop ‘Generative AI in Genomics (Gen^2): Barriers and Frontiers.’
The International Laboratory for Social Integration Research (ILSIR) at HSE University studies the challenges faced by vulnerable groups and explores ways to help them participate fully in everyday life. To develop effective solutions, the laboratory’s researchers combine cutting-edge methods with practical fieldwork. In this interview with the HSE News Service, Laboratory Head Elena Iarskaia-Smirnova discusses the laboratory’s work.
Guterman A. E., Spiridonov I.A., Linear Algebra and its Applications 2020 Vol. 599 P. 140–155
Let $M_{n}(\mathbb{F})$ denote the set of square matrices of size $n$ over a field $\mathbb{F}$ with characteristics different from two. We say that the map $f: M_{n}(\mathbb{F}) \rightarrow M_{n}(\mathbb{F})$ is additive if $f(A+B) = f(A) + f(B)$ for all $A, B \in M_{n}(\mathbb{F})$. The main goal of this paper is to prove that for $n>2$ ...
M.N.Vyalyi, Babenko A. V., Computational Mathematics and Mathematical Physics 2017 Vol. 57 No. 2 P. 362–371
The problem of linear classification of the parity of permutation matrices is studied. This problem is related to the analysis of complexity of a class of algorithms designed for computing the permanent of a matrix that generalizes the Kasteleyn algorithm. Exponential lower bounds on the magnitude of the coefficients of the functional that classifies the ...