Anak Yodpinyanee

According to our database, Anak Yodpinyanee authored at least 14 papers between 2015 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Local Access to Huge Random Objects Through Partial Sampling.

Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Local Computation Algorithms for Spanners.

Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Towards Testing Monotonicity of Distributions Over General Posets.

Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee

Proceedings of the Conference on Learning Theory, 2019

2018

Sub-linear algorithms for graph problems.

Anak Yodpinyanee

PhD thesis, 2018

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling.

Maryam Aliakbarpour, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee

Algorithmica, 2018

Set Cover in Sub-linear Time.

Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Even 1 × <i>n</i> Edge-Matching and Jigsaw Puzzles are Really Hard.

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee

J. Inf. Process., 2017

Local-Access Generators for Basic Random Graph Models.

Amartya Shankha Biswas, Ronitt Rubinfeld, Anak Yodpinyanee

CoRR, 2017

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee

CoRR, 2017

Local Computation Algorithms for Graphs of Non-constant Degrees.

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

Algorithmica, 2017

Fractional Set Cover in the Streaming Model.

Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee

Proceedings of the Approximation, 2017

2016

Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation.

Maryam Aliakbarpour, Amartya Shankha Biswas, Themistoklis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee

CoRR, 2016

2015

Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees.

Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Dissection with the Fewest Pieces is Hard, Even to Approximate.

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015