Alaev Pavel Evgenievich | Sciact - cris system

Alaev Pavel Evgenievich

Employee

Science activity

Articles - 16 , Conference attendances - 5

Articles (16) More info

1	Alaev P. Inversion in P-Computable Fields In compilation Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024: Proceedings. – Springer Cham., 2024. – C.100-109. – ISBN 978-3-031-64309-5. DOI: 10.1007/978-3-031-64309-5_9 WOS Scopus OpenAlex
2	Alaev P.E. Complexity of the inversion operation in groups Algebra and Logic. 2023. V.62. N2. P.103-118. DOI: 10.1007/s10469-024-09730-9 WOS Scopus РИНЦ OpenAlex
3	Alaev P.E. Inversion operations in algebraic structures Computability. 2023. V.12. N4. P.315-322. DOI: 10.3233/com-230459 WOS Scopus РИНЦ OpenAlex
4	Alaev P. Quotient Structures and Groups Computable in Polynomial Time Lecture Notes in Computer Science. 2022. V.13296 LNCS. P.35-45. DOI: 10.1007/978-3-031-09574-0_3 Scopus OpenAlex
5	Alaev P.E. Finitely generated structures computable in polynomial time Siberian Mathematical Journal. 2022. V.63. N5. P.801-818. DOI: 10.1134/S0037446622050019 WOS Scopus РИНЦ OpenAlex
6	Alaev P.E. A Criterion for P-Computability of Structures Algebra and Logic. 2022. V.61. N5. P.437-441. DOI: 10.1007/s10469-023-09710-5 WOS Scopus РИНЦ OpenAlex
7	Alaev P. , Selivanov V. Complexity Issues for the Iterated h-Preorders Lecture Notes in Computer Science. 2021. V.13037 LNCS. P.1-12. DOI: 10.1007/978-3-030-93489-7_1 WOS Scopus OpenAlex
8	Alaev P.E. , Selivanov V.L. Fields of Algebraic Numbers Computable in Polynomial Time. II Algebra and Logic. 2021. V.60. N6. P.349 - 359. DOI: 10.1007/s10469-022-09661-3 WOS Scopus OpenAlex
9	Alaev P.E. , Selivanov V.L. Searching for Applicable Versions of Computable Structures Lecture Notes in Computer Science. 2021. V.12813. P.1-11. DOI: 10.1007/978-3-030-80049-9 WOS OpenAlex
10	Alaev P.E. Polynomially Computable Structures with Finitely Many Generators Algebra and Logic. 2020. V.59. N3. P.266-272. DOI: 10.1007/s10469-020-09598-5 WOS Scopus OpenAlex
11	Alaev P.E. , Selivanov V.L. Fields of Algebraic Numbers Computable in Polynomial Time. I Algebra and Logic. 2020. V.58. N6. P.447-469. DOI: 10.1007/s10469-020-09565-0 WOS Scopus OpenAlex
12	Alaev P.E. Categoricity for Primitive Recursive and Polynomial Boolean Algebras Algebra and Logic. 2018. V.57. N4. P.251-274. DOI: 10.1007/s10469-018-9498-1 WOS Scopus OpenAlex
13	Alaev P.E. Structures Computable in Polynomial Time. II Algebra and Logic. 2018. V.56. N6. P.429-442. DOI: 10.1007/s10469-018-9465-x WOS Scopus OpenAlex
14	Alaev P.E. , Selivanov V.L. Polynomial Computability of Fields of Algebraic Numbers Doklady Mathematics. 2018. V.98. N1. P.341-343. DOI: 10.1134/S1064562418050137 WOS Scopus OpenAlex
15	Alaev P. , Selivanov V. Polynomial-Time Presentations of Algebraic Number Fields Lecture Notes in Computer Science. 2018. V.10936. P.20-29. DOI: 10.1007/978-3-319-94418-0_2 Scopus OpenAlex
16	Alaev P.E. Structures Computable in Polynomial Time. I Algebra and Logic. 2017. V.55. N6. P.421-435. DOI: 10.1007/s10469-017-9416-y WOS Scopus OpenAlex

Conference attendances (5) More info

1	Alaev P. Search of structures computable in polynomial time Discrete and Continuous Signals: Analysis, Information and Applications, Международная конференция, 11-16 декабря 2023, Санкт-Петербург 11-16 Dec 2023
2	Alaev P. The inversion in fields computable in polynomial time Мальцевские чтения : Международная конференция 13-17 Nov 2023
3	Алаев П.Е. Presentations of structures computable in polynomial time Международная конференция "МАЛЬЦЕВСКИЕ ЧТЕНИЯ" 14-18 Nov 2022
4	Alaev P. Fields computable in polynomial time Fourth Workshop on Digitalization and Computable Models 2022 24-29 Oct 2022
5	Alaev P. Quotient structures and groups computable in polynomial time 17th International Computer Science Symposium in Russia 29 Jun - 1 Jul 2022

Identifiers

ORCID: 0000-0001-5438-3092

ResearcherID: A-9798-2016

Elibrary ID: 14946

Degrees

2007 - Dr.Sc.