( en | de | ru )

 

Disambiguation of "Khamidullin, Sergey A."

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Algorithms for Some Sequence Clustering Problems.

, , and . LION, volume 12096 of Lecture Notes in Computer Science, page 96-101. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sergey Libert

Sergey Gorbunov

Sergey Stepanov

Sergey Geyn

Sergey Groppa

 

Other publications of authors with the same name

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence., , , and . Ann. Math. Artif. Intell., 88 (1-3): 157-168 (2020)Randomized Algorithms for Some Sequence Clustering Problems., , and . LION, volume 12096 of Lecture Notes in Computer Science, page 96-101. Springer, (2020)Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence., , and . LION, volume 11968 of Lecture Notes in Computer Science, page 135-145. Springer, (2019)2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence., , and . NUMTA (2), volume 11974 of Lecture Notes in Computer Science, page 386-393. Springer, (2019)Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence., , , and . LION, volume 11353 of Lecture Notes in Computer Science, page 326-336. Springer, (2018)A Randomized Algorithm for 2-Partition of a Sequence., , and . AIST, volume 10716 of Lecture Notes in Computer Science, page 313-322. Springer, (2017)An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities., , , and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 171-181. Springer, (2016)Exact pseudopolynomial algorithm for one sequence partitioning problem., , and . Autom. Remote. Control., 78 (1): 67-74 (2017)Simultaneous Detection and Discrimination of Subsequences Which Are Nonlinearly Extended Elements of the Given Sequences Alphabet in a Quasiperiodic Sequence., and . OPTIMA, volume 12422 of Lecture Notes in Computer Science, page 209-223. Springer, (2020)Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence., , and . DOOR (Supplement), volume 1623 of CEUR Workshop Proceedings, page 516-525. CEUR-WS.org, (2016)