( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Consensus Optimizing Both Distance Sum and Radius.

, , , , , и . SPIRE, том 5721 из Lecture Notes in Computer Science, стр. 234-242. Springer, (2009)

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.

Rosemary Park

Sungjune Park

Jinhyung Park

Kwan Park

Shinja Park

 

Другие публикации лиц с тем же именем

On the Set LCS and Set-Set LCS Problems., , и . J. Algorithms, 14 (3): 466-477 (1993)The Subtree Max Gap Problem with Application to Parallel String Covering., , , и . SODA, стр. 501-510. ACM/SIAM, (1994)Work-time-optimal parallel algorithms for string problems., , , , и . STOC, стр. 713-722. ACM, (1995)Efficient parallel exponentiation in GF(2n) using normal basis representations., , , и . SPAA, стр. 179-188. ACM, (2001)Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.. CPM, том 1075 из Lecture Notes in Computer Science, стр. 335-347. Springer, (1996)Finding Optimal Alignment and Consensus of Circular Strings., , , , и . CPM, том 6129 из Lecture Notes in Computer Science, стр. 310-322. Springer, (2010)Constructing Suffix Arrays for Multi-dimensional Matrices., , и . CPM, том 1448 из Lecture Notes in Computer Science, стр. 126-139. Springer, (1998)Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together., , , , и . SIGMOD Conference, стр. 1429-1446. ACM, (2019)An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks., , и . IFIP TCS, том 1872 из Lecture Notes in Computer Science, стр. 100-111. Springer, (2000)An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph., и . Fundam. Informaticae, 84 (1): 81-97 (2008)