Serov Danil Yurevich
Серов Данил Юрьевич
2025
- International scientific conference 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025)
Bratislava Comenius University Bratislava
20.01.2025 - 23.01.2025
Название докладаQuantum Algorithm for the Multiple String Matching Problem
ЭкспонатыKamil Khadiev and Danil Serov: Quantum Algorithm for the Multiple String Matching Problem
2024
- International scientific conference The 21th International Conference on Unconventional Computation and Natural Computation 2024
Pohang Pohang University of Science and Technology
17.06.2024 - 21.06.2024
Название докладаQuantum Property Testing Algorithm for the Concatenation of Two Palindromes Language
АннотацияIn this paper, we present a quantum property testing algorithm for recognizing a context-free language that is a concatenation of two palindromes $L_{REV}$. The query complexity of our algorithm is $O(\frac{1}{\varepsilon}n^{1/3}\log n)$, where $n$ is the length of an input. It is better than the cl
ЭкспонатыKamil Khadiev and Danil Serov, Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language - International scientific conference XX International Scintific Conference "Problems of Theoretical Cybernetyc"
Moscow Lomonosov Moscow State University
05.12.2024 - 07.12.2024
Название докладаQuantum Algorithm for the Multiple String Matching Problem
АннотацияLet us consider the Multiple String Matching Problem. In this problem, we consider a long string, denoted by $t$, of length $n$. This string is referred to as a text. We also consider a sequence of $m$ strings, denoted by $S$, which we refer to as a dictionary. The total length of all strings from t
ЭкспонатыKamil Khadiev, Danil Serov, Quantum Algorithm for the Multiple String Matching Problem
2021
- International scientific conference XIX International Conference on "Problems of Theoretical Cybernetics"(PTK2021)
Kazan KFU
28.09.2021 - 01.10.2021
Название докладаQuantum Algorithm for Two Polindroms Concatination Recognition
ЭкспонатыDanil Serov, Kamil Khadiev, Quantum Algorithm for Two Polindroms Concatination Recognition
2020
- International scientific conference 14th International Conference on Reachability Problems (RP'20)
Paris Universite de Paris
19.10.2020 - 21.10.2020
Название докладаQuantum-over-classical Advantage in Solving Multiplayer Games
АннотацияWe study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum
ЭкспонатыDmitry Kravchenko, Kamil Khadiev, Danil Serov and Ruslan Kapralov. Quantum-over-classical Advantage in Solving Multiplayer Games
| Work address: | 35 Kremlevskaya Str., Kazan, Building №14 (unit # 2) |
| Office number: | 1109 |
| E-mail: | DaJSerov@kpfu.ru |
| Experience: |
| Experience: |
| Scientific and pedagogical experience: |
| General experience: |
| Experience in KFU: |
