( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Pattern-Avoiding Access in Binary Search Trees.

, , , , и . FOCS, стр. 410-423. IEEE Computer Society, (2015)

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.

Parinya Wilaiphan

Parinya Sirimachan

 

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

New Approximability Results for the Robust k-Median Problem., , , и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 50-61. Springer, (2014)Coloring and Maximum Weight Independent Set of Rectangles., и . CoRR, (2020)On Survivable Set Connectivity., , и . SODA, стр. 25-36. SIAM, (2015)Parameterized Approximation Schemes for Clustering with General Norm Objectives., , , , , , , , и . FOCS, стр. 1377-1399. IEEE, (2023)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , и . FOCS, стр. 743-754. IEEE Computer Society, (2017)Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs., , и . FOCS, стр. 444-453. IEEE Computer Society, (2014)On Minimum Generalized Manhattan Connections., , , , , , , и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 85-100. Springer, (2021)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More, , и . CoRR, (2012)Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation., , и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 409-420. Springer, (2014)Simple Distributed Algorithms for Approximating Minimum Steiner Trees., и . COCOON, том 3595 из Lecture Notes in Computer Science, стр. 380-389. Springer, (2005)