( en | de | ru )

 

Disambiguation of "Chalermsook, Parinya"

Author of the publication

copydeleteadd this publication to your clipboard
Self-Adjusting Binary Search Trees: What Makes Them Tick?

, , , , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 300-312. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Parinya Wilaiphan

Parinya Sirimachan

 

Other publications of authors with the same name

Coloring and Maximum Weight Independent Set of Rectangles., and . CoRR, (2020)New Approximability Results for the Robust k-Median Problem., , , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 50-61. Springer, (2014)Parameterized Approximation Schemes for Clustering with General Norm Objectives., , , , , , , , and . FOCS, page 1377-1399. IEEE, (2023)On Survivable Set Connectivity., , and . SODA, page 25-36. SIAM, (2015)On Minimum Generalized Manhattan Connections., , , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 85-100. Springer, (2021)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs., , and . FOCS, page 444-453. IEEE Computer Society, (2014)The Group Access Bounds for Binary Search Trees., , , , and . CoRR, (2023)Maximum independent set of rectangles., and . SODA, page 892-901. SIAM, (2009)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More., , and . SODA, page 1557-1576. SIAM, (2013)