Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Abhiram Natarajan and Yi Wu. Computational Complexity of Certifying Restricted Isometry Property. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 371-380, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{natarajan_et_al:LIPIcs.APPROX-RANDOM.2014.371, author = {Natarajan, Abhiram and Wu, Yi}, title = {{Computational Complexity of Certifying Restricted Isometry Property}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {371--380}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.371}, URN = {urn:nbn:de:0030-drops-47092}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.371}, annote = {Keywords: Restricted Isometry Property, RIP, RIP Certification, Sparse Cheeger Inequality, SSE Hard} }
Published in: OASIcs, Volume 76, 10th Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU 2019)
Yifan Wu. Is a Dataframe Just a Table?. In 10th Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU 2019). Open Access Series in Informatics (OASIcs), Volume 76, pp. 6:1-6:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wu:OASIcs.PLATEAU.2019.6, author = {Wu, Yifan}, title = {{Is a Dataframe Just a Table?}}, booktitle = {10th Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU 2019)}, pages = {6:1--6:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-135-1}, ISSN = {2190-6807}, year = {2020}, volume = {76}, editor = {Chasins, Sarah and Glassman, Elena L. and Sunshine, Joshua}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.PLATEAU.2019.6}, URN = {urn:nbn:de:0030-drops-119600}, doi = {10.4230/OASIcs.PLATEAU.2019.6}, annote = {Keywords: Usability of Programming Languages} }
Published in: LIPIcs, Volume 201, 21st International Workshop on Algorithms in Bioinformatics (WABI 2021)
Matthew LeMay, Yi-Chieh Wu, and Ran Libeskind-Hadas. The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. In 21st International Workshop on Algorithms in Bioinformatics (WABI 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 201, pp. 1:1-1:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lemay_et_al:LIPIcs.WABI.2021.1, author = {LeMay, Matthew and Wu, Yi-Chieh and Libeskind-Hadas, Ran}, title = {{The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard}}, booktitle = {21st International Workshop on Algorithms in Bioinformatics (WABI 2021)}, pages = {1:1--1:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-200-6}, ISSN = {1868-8969}, year = {2021}, volume = {201}, editor = {Carbone, Alessandra and El-Kebir, Mohammed}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2021.1}, URN = {urn:nbn:de:0030-drops-143546}, doi = {10.4230/LIPIcs.WABI.2021.1}, annote = {Keywords: phylogenetics, reconciliation, deep coalescence, hybridization, NP-hardness} }