• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Books
  • Special Issue on Computer Science Symposium in Russia
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
May 22, 2026
HSE Graduates AI Project Wins at TECH & AI Awards
Daria Davydova, graduate of the HSE Graduate School of Business and Head of the AI Implementation Unit at the Artificial Intelligence Department of Alfa-Bank, received a prize at the TECH & AI Awards. She was awarded for the best AI solution for optimising business processes. The winners were determined as part of the VII Russian Summit and Awards on Digital Transformation (CDO/CDTO Summit & Awards).
May 20, 2026
HSE University Opens First Representative Office of Satellite Laboratory in Brazil
HSE University-St Petersburg opened a representative office of the Satellite Laboratory on Social Entrepreneurship at the University of Campinas in Brazil. The platform is going to unite research and educational projects in the spheres of sustainable development, communications and social innovations.
May 18, 2026
The 'Second Shift' Is Not Why Women Avoid News
Women are more likely than men to avoid political and economic news, but the reasons for this behaviour are linked less to structural inequality or family-related stress than to personal attitudes and the emotional perception of news content. This conclusion was reached by HSE researchers after analysing data from a large-scale survey of more than 10,000 residents across 61 regions of Russia. The study findings have been published in Woman in Russian Society.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Special Issue on Computer Science Symposium in Russia

Vol. 64. Issue 1. Springer, 2020.
Academic editor: Ф. В. Фомин, Podolskii V. V.
Under the general editorship: Ф. В. Фомин, Podolskii V. V.

This special issue of Theory of Computing Systems consists of extended journal papers originally presented at the 13th International Computer Science Symposium in Russia (CSR 2018) held on June 6–10, 2018 in Moscow, Russia. The event was hosted by National Research University Higher School of Economics and chaired by Vladimir V. Podolskii. Preliminary versions of these papers presented at the conference appeared in LNCS 10846. The Program Committee, chaired by Fedor V. Fomin, invited several authors to submit extended journal versions of their papers to this special issue. All submissions were reviewed in accordance with customary high standards.

Language: English
Sample Chapter
DOI
Text on another site
Keywords: algorithmsComputational ComplexityTheoretical Computer Science
Special Issue on Computer Science Symposium in Russia
Similar publications
Медийные социальные представления в ТикТок: пользователи против алгоритмов
Balakina Y. V., Информационное общество 2026 № 1 С. 94–107
The review examines how TikTok's algorithms and users shape media social representations. Algorithms act as subjects of communication, selecting content for user interpretation, while media and users have to adapt. The platform balances algorithm-centric and audience-centric approaches to representation formation. ...
Added: February 28, 2026
О базовых математических определениях цифровых технологий и искусственного интеллекта
Semenov A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 527 № S С. 7–12
The paper proposes a system of definitions for the basic concepts of computability theory that underlie the mathematics of the digital world: algorithm, computability, calculus, object complexity, close to modern undertnding. Hierarchies of the finite and the problem of consistency are considered. ...
Added: December 6, 2025
Влияние искусственного интеллекта на структуру и содержание вакансий на российском рынке труда
Skorobogatov A., Свиридов О. И., Вопросы экономики 2025 № 1 С. 71–91
The paper studies the association between the artificial intelligence (AI) and employment characteristics. As a theoretical framework, we use the Acemoglu et al. model, which introduces opposing effects of the AI algorithms on labor employment on the firm level such as substitution effect and complimentary/ productivity effects. Depending on their relative strength, the AI algorithms ...
Added: January 14, 2025
An empirical scrutinization of four crisp clustering methods with four distance metrics and one straightforward interpretation rule
T. A. Alvandyan, S. Shalileh, Doklady Mathematics 2024 Vol. 110 No. S1 P. S236–S250
Clustering has always been in great demand by scientific and industrial communities.  However, due to the lack of ground truth, interpreting its obtained results can be debatable. The current research provides an empirical benchmark on the efficiency of three popular and one recently proposed crisp clustering methods. To this end, we extensively analyzed these (four) ...
Added: November 30, 2024
Из чего сделаны компьютерные игры?
Kirichenko V., Галактика медиа: журнал медиа исследований 2024 Т. 6 № 3 С. 376–389
This article is a review of Pippin Barr’s book The Stuff Games Are Made Of (2023), which explores various elements of game worlds. Over the course of ten chapters, including introduction and conclusion, the author of the monograph examine samples with stable basic concepts of computer games and their production. Being a game designer and a theorist, Pippin Barr reflects on many ‘medianized’ ...
Added: September 30, 2024
On efficient algorithms for bottleneck path problems with many sources
Kirill V. Kaymakov, Dmitry S. Malyshev, Optimization Letters 2024 Vol. 18 P. 1273–1283
For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or max min ) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t. It can be generalized by finding the bottleneck values between s and all possible t. These problems arise ...
Added: April 18, 2024
A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 4 P. 791–801
For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain ...
Added: February 16, 2024
Диффамация и алгоритмы: Новое измерение старой проблемы
Diskin E., Закон 2024 № 1 С. 24–28
The issue of the protection of legitimate rights of personas who were defamed is not new in Russian legal science. The problem of protection of honor and dignity was known to classical Roman law, was the subject of study of pre-revolutionary and Soviet lawyers. However, the classic civilistic constructions formulated in the Civil Code were ...
Added: January 30, 2024
Comparative Analysis of Logic Reasoning and Graph Neural Networks for Ontology-Mediated Query Answering with a Covering Axiom
Gerasimova O., Makarov I., Severin N., IEEE Access 2023 Vol. 11 P. 88074–88086
The problem of query answering over incomplete attributed graph data is a challenging field of database management systems and artificial intelligence. When there are rules on data structure expressed in the form of the ontology, the theoretical complexity of finding exact solution satisfying ontology constraints increases. Logic-based methods use theoretical constructions to obtain efficient rewritings ...
Added: January 5, 2024
The discrete Fourier transform over the binary finite field
Sergei Valentinovich Fedorenko, IEEE Access 2023 Vol. 11 P. 62771–62779
The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT. The direct DFT computational complexity has been reduced due to using the binary trace function over the finite field and ...
Added: July 19, 2023
Complexity function and complexity of validity of modal and superintuitionistic propositional logics
Rybakov M., Shkatov D., Journal of Logic and Computation 2023 Vol. 33 No. 7 P. 1566–1595
We consider the relationship between the algorithmic properties of the validity problem for a modal or superintuitionistic propositional logic and the size of the smallest Kripke countermodels for non-theorems of the logic. We establish the existence, for every degree of unsolvability, of a propositional logic whose validity problem belongs to the degree and whose every ...
Added: January 6, 2023
Some cases of polynomial solvability of the edge coloring problem that are generated by forbidden 8-edge subcubic forests
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2022 Vol. 16 P. 276–291
The edge-coloring problem is to minimize the number of colors sufficient to color all the edges of a given graph so that any adjacent edges receive distinct colors. The complexity status of this problem is known for all the classes defined by the sets of forbidden subgraphs with 7 edges each. In this paper, we ...
Added: December 31, 2022
On a Countable Family of Boundary Graph Classes for the Dominating Set Problem
G. S. Dakhno, D. S. Malyshev, Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 1 P. 25–31
A hereditary class is a set of simple graphs closed under deletion of vertices; every such class is defined by the set of its minimal forbidden induced subgraphs. If this set is finite, then the class is said to be finitely defined. The concept of a boundary class is a useful tool for the analysis ...
Added: December 6, 2022
Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups
Kochergin V., Moscow University Mathematics Bulletin 2022 Vol. 77 No. 3 P. 113–119
Abstract: The computational complexity of the element (Formula presented.) of the Abelian group (Formula presented.) (it is supposed that kii for all i) and the computational complexity of the term (Formula presented.) are compared in the paper. The computational complexity means the minimal possible number of multiplication operations, and all the results of intermediate multiplications ...
Added: October 29, 2022
VGsim: Scalable viral genealogy simulator for global pandemic
Shchur V., Spirin V., Sirotkin D. et al., PLoS Computational Biology 2022 Vol. 18 No. 8 Article e1010409
Accurate simulation of complex biological processes is an essential component of developing and validating new technologies and inference approaches. As an effort to help contain the COVID-19 pandemic, large numbers of SARS-CoV-2 genomes have been sequenced from most regions in the world. More than 5.5 million viral sequences are publicly available as of November 2021. ...
Added: September 14, 2022
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
Rybakov M., Shkatov D., Theoretical Computer Science 2022 Vol. 925 P. 45–60
We prove that branching-time temporal logics CTL and CTL* are polynomial-time embeddable into their single-variable fragments. It follows that satisfiability for CTL and CTL*, and therefore also for alternating-time temporal logics ATL and ATL*, in languages with one propositional variable is as algorithmically hard as satisfiability for the full logic: EXPTIME-complete for CTL and ATL, and 2EXPTIME-complete for CTL* and ATL*. We discuss applicability of the technique used in the proofs to other ...
Added: May 12, 2022
An intractability result for the vertex 3-colourability problem
Malyshev D. S., Приставченко О. В., Optimization Letters 2022 Vol. 16 P. 1403–1409
The vertex 3-colourability problem is to decide whether the vertex set of a given graph can be split into three subsets of pairwise non-adjacent vertices. This problem is known to be NP-complete in a certain class of graphs, defined by an explicit description of allowed 5-vertex induced subgraphs in them. In the present paper, we improve this result by ...
Added: February 25, 2022
Борис Абрамович Трахтенброт (к столетию со дня рождения)
Артемов С. Н., Барздинь Я. М., Бокуть Л. А. et al., Успехи математических наук 2022 Т. 77 № 1(463) С. 191–195
Борис Абрамович Трахтенброт (20.02.1921– 19.09.2016), которому 20 февраля 2021 г. исполнилось бы сто лет, – один из создателей теоретических основ информатики, или Theoretical Computer Science, широко признанный и в СССР, и в мире. Его научная биография интересна также и в гуманистическом, и в историческом аспектах. ...
Added: February 13, 2022
On computational complexity of set automata
Rubtsov A. A., Vyalyi M., Information and Computation 2021 Vol. 281 Article 104797
We consider a computational model which is known as set automata. The set automata are one-way finite automata with additional storage-the set. There are two kinds of set automata-deterministic (DSA's) and nondeterministic (NSA's). The model was introduced by Kutrib, Malcher, Wendlandt in 2014. It was shown that DSA-recognizable languages look similar to DCFL's and NSA-recognizable ...
Added: February 2, 2022
Цифровая лихорадка: в поисках баланса между профессиональной и рыночной логиками в веб-журналистике Рецензия на книгу: Сhristin A. 2020. Metrics at Work: Journalism and the Contested Meaning of Algorithms. Princeton: Princeton University Press. 256 p
Богомазова Л. В., Экономическая социология 2021 Т. 22 № 5 С. 137–150
A book written by French-born American sociologist Angèle Christin, Metrics at Work: Journalism and the Contested Meaning of Algorithms, is devoted to the specificities of the functioning of publications during the traffic-chase era. The book’s main goal is to show how the implementation of algorithms affects the professional identity and working practices of journalists. The scholar ...
Added: January 17, 2022
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning
Zakharyaschev M., Kontchakov R., Ryzhikov V. et al., The International Joint Conference on Artificial Intelligence (IJCAI), 2020.
Traditionally, description logic has focused on represent- ing and reasoning about classes rather than relations (roles), which has been justified by the deterioration of the computa- tional properties if expressive role inclusions are added. The situation is even worse in the temporalised setting, where monodicity is viewed as an almost necessary condition for decidability. We ...
Added: November 6, 2021
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit