1. More consequences of falsifying SETH and the orthogonal vectors conjecture
2. Amir Abboud , Virginia Vassilevska Williams, and Oren Weimann . 2014 . Con- sequences of Faster Alignment of Sequences. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Vol. 8572 . Springer , 39--51. https://doi.org/10.1007/978--3--662--43948--7_4 10.1007/978--3--662--43948--7_4 Amir Abboud, Virginia Vassilevska Williams, and Oren Weimann. 2014. Con- sequences of Faster Alignment of Sequences. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014, Proceedings, Part I (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Vol. 8572. Springer, 39--51. https://doi.org/10.1007/978--3--662--43948--7_4
3. Size Bounds and Query Plans for Relational Joins
4. Arturs Backurs , Nishanth Dikkala , and Christos Tzamos . 2016 . Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 , July 11 --15 , 2016, Rome, Italy (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 81:1--81:13. https://doi.org/10.4230/LIPIcs.ICALP.2016.81 10.4230/LIPIcs.ICALP.2016.81 Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. 2016. Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11--15, 2016, Rome, Italy (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 81:1--81:13. https://doi.org/10.4230/LIPIcs.ICALP.2016.81
5. Arturs Backurs and Christos Tzamos . 2017 . Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms . In Proceedings of the 34th International Conference on Machine Learning, ICML 2017 , Sydney, NSW, Australia, 6- -11 August 2017 (Proceedings of Machine Learning Research), Doina Precup and Yee Whye Teh (Eds.), Vol. 70 . PMLR, 311--321. http://proceedings.mlr.press/v70/backurs17a.html Arturs Backurs and Christos Tzamos. 2017. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6--11 August 2017 (Proceedings of Machine Learning Research), Doina Precup and Yee Whye Teh (Eds.), Vol. 70. PMLR, 311--321. http://proceedings.mlr.press/v70/backurs17a.html