Khamidullin Sergey Asgadullovich

Publications in Math-Net.Ru

1. Recognition of a quasi-periodic sequence containing an unknown number of nonlinearly extended reference subsequences
   
   Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021),  1162–1171
2. The minimization problem for the sum of weighted convolution differences: the case of a given number of elements in the sum
   
   Sib. Zh. Vychisl. Mat., 23:2 (2020),  127–142
3. Problem of minimizing a sum of differences of weighted convolutions
   
   Zh. Vychisl. Mat. Mat. Fiz., 60:12 (2020),  2015–2027
4. A randomized algorithm for a sequence 2-clustering problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 58:12 (2018),  2169–2178
5. Exact pseudopolynomial algorithm for one sequence partitioning problem
   
   Avtomat. i Telemekh., 2017, no. 1,  80–90
6. An approximation scheme for a problem of finding a subsequence
   
   Sib. Zh. Vychisl. Mat., 20:4 (2017),  379–392
7. Approximation algorithm for the problem of partitioning a sequence into clusters
   
   Zh. Vychisl. Mat. Mat. Fiz., 57:8 (2017),  1392–1400
8. Fully polynomial-time approximation scheme for a sequence $2$-clustering problem
   
   Diskretn. Anal. Issled. Oper., 23:2 (2016),  21–40
9. An approximation algorithm for the problem of partitioning a sequence into clusters with constraints on their cardinalities
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  144–152
10. An approximation polynomial-time algorithm for a sequence bi-clustering problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 55:6 (2015),  1076–1085
11. Approximation algorithm for one problem of partitioning a sequence
    
    Diskretn. Anal. Issled. Oper., 21:1 (2014),  53–66
12. Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов
    
    Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013),  143–153
13. Approximation algorithms for some NP-hard problems of searching a vectors subsequence
    
    Diskretn. Anal. Issled. Oper., 19:3 (2012),  27–38
14. On one problem of searching for tuples of fragments in a numerical sequence
    
    Diskretn. Anal. Issled. Oper., 16:4 (2009),  31–46
15. On one recognition problem of vector alphabet generating a sequence with a quasi-periodical structure
    
    Sib. Zh. Vychisl. Mat., 12:3 (2009),  275–287
16. Распознавание квазипериодической последовательности, включающей повторяющийся набор фрагментов
    
    Sib. Zh. Ind. Mat., 11:2 (2008),  74–87
17. Optimal detection of a recurring tuple of reference fragments in a quasi-periodic sequence
    
    Sib. Zh. Vychisl. Mat., 11:3 (2008),  311–327
18. A posteriori joint detection of a recurring tuple of reference fragments in a quasi-periodic sequence
    
    Zh. Vychisl. Mat. Mat. Fiz., 48:12 (2008),  2247–2260
19. Optimal detection of a given number of unknown quasiperiodic fragments in a numerical sequence
    
    Sib. Zh. Vychisl. Mat., 10:2 (2007),  159–175
20. A posteriori detection of a given number of unknown quasiperiodic fragments in a numerical sequence
    
    Sib. Zh. Ind. Mat., 9:3 (2006),  50–65
21. Joint a posteriori detection and identification of quasiperiodic fragments in a sequence from pieces of them
    
    Sib. Zh. Ind. Mat., 9:2 (2006),  55–74
22. A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
    
    Sib. Zh. Ind. Mat., 9:1 (2006),  55–74
23. Joint a posteriori detection and identification of a given number of quasiperiodic fragments in a sequence from pieces of them
    
    Sib. Zh. Ind. Mat., 8:2 (2005),  83–102
24. Recognition of a numerical sequence from fragments of a quasiperiodically repeating standard sequence
    
    Sib. Zh. Ind. Mat., 7:2 (2004),  68–87
25. A posteriori detection of a quasiperiodically repeating fragment of a numerical sequence under conditions of noise and data loss
    
    Sib. Zh. Ind. Mat., 6:2 (2003),  46–63
26. Recognition of a quasiperiodic sequence that includes identical subsequences-fragments
    
    Sib. Zh. Ind. Mat., 5:4 (2002),  38–54
27. A posteriori detection of identical subsequence-fragments in a quasiperiodic sequence
    
    Sib. Zh. Ind. Mat., 5:2 (2002),  94–108
28. Recognition of a quasiperiodic sequence formed from a given number of truncated subsequences
    
    Sib. Zh. Ind. Mat., 5:1 (2002),  85–104
29. Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
    
    Zh. Vychisl. Mat. Mat. Fiz., 41:5 (2001),  807–820
30. A posteriori detection of a given number of truncated subsequences in a quasiperiodic sequence
    
    Sib. Zh. Ind. Mat., 3:1 (2000),  137–156
31. A posteriori joint detection and distinction of a given number of subsequences in a quasiperiodic sequence
    
    Sib. Zh. Ind. Mat., 2:2 (1999),  106–119
32. Recognition of a quasiperiodic sequence formed from a given number of identical subsequences
    
    Sib. Zh. Ind. Mat., 2:1 (1999),  53–74
33. Optimal detection of given number of identical subsequences in quasiperiodic sequence
    
    Sib. Zh. Vychisl. Mat., 2:4 (1999),  333–349