Publisher
Springer Nature Switzerland
Reference25 articles.
1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)
2. Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434–443. IEEE (2014)
3. Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless seth is false). In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory pf Computing, pp. 51–58 (2015)
4. Bernstein, A., Probst, M., Wulff-Nilsen, C.: Decremental strongly-connected components and single-source reachability in near-linear time. In: Charikar, M., Cohen, E. (eds). Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, 23–26 June 2019, pp. 365–376. Phoenix, AZ, USA. ACM (2019)
5. Chatterjee, K., Dvorák, W., Henzinger, M., Loitzenbauer, V.: Conditionally optimal algorithms for generalized Büchi games. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22–26, 2016 - Kraków, Poland, volume 58 of LIPIcs, pp. 25:1–25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)