Author:
Abboud Amir,Fischer Nick,Shechter Yarin
Publisher
Springer Nature Switzerland
Reference38 articles.
1. Abboud, A., Backurs, A., Bringmann, K., Künnemann, M.: Fine-grained complexity of analyzing compressed data: quantifying improvements over decompress-and-solve. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 192–203. IEEE (2017)
2. Abboud, A., Backurs, A., Williams, V.V.: If the current clique algorithms are optimal, so is valiant’s parser. SIAM J. Comput. 47(6), 2527–2555 (2018)
3. Abboud, A., Fischer, N., Kelley, Z., Lovett, S., Meka, R.: New graph decompositions and combinatorial boolean matrix multiplication algorithms. CoRR, abs/2311.09095 (2023). arxiv:2311.09095
4. Abboud, A., et al.: Faster algorithms for all-pairs bounded min-cuts. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S., editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9–12, 2019, Patras, Greece, volume 132 of LIPIcs, pp. 7:1–7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.ICALP.2019.7
5. Abboud, A., Williams, V.V.:. Popular conjectures imply strong lower bounds for dynamic problems. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014), pp. 434–443. IEEE Computer Society (2014). https://doi.org/10.1109/FOCS.2014.53
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献