default search action
BibTeX records: Anak Yodpinyanee
@inproceedings{DBLP:conf/innovations/BiswasRY20, author = {Amartya Shankha Biswas and Ronitt Rubinfeld and Anak Yodpinyanee}, editor = {Thomas Vidick}, title = {Local Access to Huge Random Objects Through Partial Sampling}, booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS} 2020, January 12-14, 2020, Seattle, Washington, {USA}}, series = {LIPIcs}, volume = {151}, pages = {27:1--27:65}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.27}, doi = {10.4230/LIPICS.ITCS.2020.27}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/BiswasRY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/AliakbarpourGPR19, author = {Maryam Aliakbarpour and Themis Gouleakis and John Peebles and Ronitt Rubinfeld and Anak Yodpinyanee}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {Towards Testing Monotonicity of Distributions Over General Posets}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {34--82}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/aliakbarpour19a.html}, timestamp = {Mon, 08 Jul 2019 16:13:41 +0200}, biburl = {https://dblp.org/rec/conf/colt/AliakbarpourGPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/ParterRVY19, author = {Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee}, editor = {Avrim Blum}, title = {Local Computation Algorithms for Spanners}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {58:1--58:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.58}, doi = {10.4230/LIPICS.ITCS.2019.58}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/ParterRVY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-03534, author = {Piotr Indyk and Sepideh Mahabadi and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee}, title = {Set Cover in Sub-linear Time}, journal = {CoRR}, volume = {abs/1902.03534}, year = {2019}, url = {http://arxiv.org/abs/1902.03534}, eprinttype = {arXiv}, eprint = {1902.03534}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-03534.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-08266, author = {Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee}, title = {Local Computation Algorithms for Spanners}, journal = {CoRR}, volume = {abs/1902.08266}, year = {2019}, url = {http://arxiv.org/abs/1902.08266}, eprinttype = {arXiv}, eprint = {1902.08266}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-08266.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1907-03182, author = {Maryam Aliakbarpour and Themis Gouleakis and John Peebles and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Towards Testing Monotonicity of Distributions Over General Posets}, journal = {CoRR}, volume = {abs/1907.03182}, year = {2019}, url = {http://arxiv.org/abs/1907.03182}, eprinttype = {arXiv}, eprint = {1907.03182}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1907-03182.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ndltd/Yodpinyanee18, author = {Anak Yodpinyanee}, title = {Sub-linear algorithms for graph problems}, school = {Massachusetts Institute of Technology, Cambridge, {USA}}, year = {2018}, url = {https://hdl.handle.net/1721.1/120411}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ndltd/Yodpinyanee18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AliakbarpourBGP18, author = {Maryam Aliakbarpour and Amartya Shankha Biswas and Themis Gouleakis and John Peebles and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling}, journal = {Algorithmica}, volume = {80}, number = {2}, pages = {668--697}, year = {2018}, url = {https://doi.org/10.1007/s00453-017-0287-3}, doi = {10.1007/S00453-017-0287-3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AliakbarpourBGP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/IndykMRVY18, author = {Piotr Indyk and Sepideh Mahabadi and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee}, editor = {Artur Czumaj}, title = {Set Cover in Sub-linear Time}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {2467--2486}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.158}, doi = {10.1137/1.9781611975031.158}, timestamp = {Tue, 02 Feb 2021 17:07:58 +0100}, biburl = {https://dblp.org/rec/conf/soda/IndykMRVY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/LeviRY17, author = {Reut Levi and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Local Computation Algorithms for Graphs of Non-constant Degrees}, journal = {Algorithmica}, volume = {77}, number = {4}, pages = {971--994}, year = {2017}, url = {https://doi.org/10.1007/s00453-016-0126-y}, doi = {10.1007/S00453-016-0126-Y}, timestamp = {Wed, 26 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/LeviRY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jip/BosboomDDHMY17, author = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Pasin Manurangsi and Anak Yodpinyanee}, title = {Even 1 {\texttimes} \emph{n} Edge-Matching and Jigsaw Puzzles are Really Hard}, journal = {J. Inf. Process.}, volume = {25}, pages = {682--694}, year = {2017}, url = {https://doi.org/10.2197/ipsjjip.25.682}, doi = {10.2197/IPSJJIP.25.682}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jip/BosboomDDHMY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/IndykMRUVY17, author = {Piotr Indyk and Sepideh Mahabadi and Ronitt Rubinfeld and Jonathan R. Ullman and Ali Vakilian and Anak Yodpinyanee}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {Fractional Set Cover in the Streaming Model}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {12:1--12:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.12}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.12}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/IndykMRUVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BosboomDDHMY17, author = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Pasin Manurangsi and Anak Yodpinyanee}, title = {Even 1{\texttimes}n Edge-Matching and Jigsaw Puzzles are Really Hard}, journal = {CoRR}, volume = {abs/1701.00146}, year = {2017}, url = {http://arxiv.org/abs/1701.00146}, eprinttype = {arXiv}, eprint = {1701.00146}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BosboomDDHMY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-10692, author = {Amartya Shankha Biswas and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Local-Access Generators for Basic Random Graph Models}, journal = {CoRR}, volume = {abs/1711.10692}, year = {2017}, url = {http://arxiv.org/abs/1711.10692}, eprinttype = {arXiv}, eprint = {1711.10692}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-10692.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AliakbarpourBGP16, author = {Maryam Aliakbarpour and Amartya Shankha Biswas and Themistoklis Gouleakis and John Peebles and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation}, journal = {CoRR}, volume = {abs/1601.04233}, year = {2016}, url = {http://arxiv.org/abs/1601.04233}, eprinttype = {arXiv}, eprint = {1601.04233}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AliakbarpourBGP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/jcdcg/BosboomDDLMRY15, author = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Jayson Lynch and Pasin Manurangsi and Mikhail Rudoy and Anak Yodpinyanee}, editor = {Jin Akiyama and Hiro Ito and Toshinori Sakai and Yushi Uno}, title = {Dissection with the Fewest Pieces is Hard, Even to Approximate}, booktitle = {Discrete and Computational Geometry and Graphs - 18th Japan Conference, {JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {9943}, pages = {37--48}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-48532-4\_4}, doi = {10.1007/978-3-319-48532-4\_4}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/jcdcg/BosboomDDLMRY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/LeviRY15, author = {Reut Levi and Ronitt Rubinfeld and Anak Yodpinyanee}, editor = {Guy E. Blelloch and Kunal Agrawal}, title = {Brief Announcement: Local Computation Algorithms for Graphs of Non-Constant Degrees}, booktitle = {Proceedings of the 27th {ACM} on Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2015, Portland, OR, USA, June 13-15, 2015}, pages = {59--61}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2755573.2755615}, doi = {10.1145/2755573.2755615}, timestamp = {Wed, 21 Nov 2018 11:19:11 +0100}, biburl = {https://dblp.org/rec/conf/spaa/LeviRY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/LeviRY15, author = {Reut Levi and Ronitt Rubinfeld and Anak Yodpinyanee}, title = {Local Computation Algorithms for Graphs of Non-Constant Degrees}, journal = {CoRR}, volume = {abs/1502.04022}, year = {2015}, url = {http://arxiv.org/abs/1502.04022}, eprinttype = {arXiv}, eprint = {1502.04022}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/LeviRY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BosboomDDLMRY15, author = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Jayson Lynch and Pasin Manurangsi and Mikhail Rudoy and Anak Yodpinyanee}, title = {Dissection with the Fewest Pieces is Hard, Even to Approximate}, journal = {CoRR}, volume = {abs/1512.06706}, year = {2015}, url = {http://arxiv.org/abs/1512.06706}, eprinttype = {arXiv}, eprint = {1512.06706}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BosboomDDLMRY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.