Sub-linear algorithms for graph problems by Yodpinyanee, Anak

Get full text

Local computation algorithms for graphs of non-constant degrees by Yodpinyanee, Anak

Get full text

Local Computation Algorithms for Graphs of Non-constant Degrees by Levi, Reut, Rubinfeld, Ronitt, Yodpinyanee, Anak

Get full text

Local Computation Algorithms for Graphs of Non-constant Degrees by Levi, Reut, Rubinfeld, Ronitt, Yodpinyanee, Anak

Get full text

Local access to huge random objects through partial sampling by Yodpinyanee, Anak, Rubinfeld, Ronitt, Biswas, Amartya Shankha

Get full text

Local computation algorithms for spanners by Parter, Merav, Rubinfeld, Ronitt, Vakilian, Ali, Yodpinyanee, Anak

Get full text

Set Cover in Sub-linear Time by Indyk, Piotr, Mahabadi, Sepideh, Rubinfeld, Ronitt, Vakilian, Ali, Yodpinyanee, Anak

Get full text

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling by Aliakbarpour, Maryam, Biswas, Amartya Shankha, Gouleakis, Themistoklis, Peebles, John Lee Thompson, Yodpinyanee, Anak, Rubinfeld, Ronitt

Get full text
Get full text
Get full text
Get full text
Get full text
Get full text

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard by Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Hesterberg, Adam Classen, Manurangsi, Pasin, Yodpinyanee, Anak

Get full text

Dissection with the Fewest Pieces is Hard, Even to Approximate by Manurangsi, Pasin, Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Lynch, Jayson R., Rudoy, Mikhail, Yodpinyanee, Anak

Get full text
Get full text
Get full text
Get full text