1. 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 (FOCS), pp. 434–443. IEEE (2014)
2. Arapinis, M., Figueira, D., Gaboardi, M.: Sensitivity of counting queries. In: 43Rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, pp. 120:1–120:13. Rome (2016)
3. Bagan, G., Durand, A., Grandjean, E.: On acyclic conjunctive queries and constant delay enumeration. In: International Workshop on Computer Science Logic, pp. 208–222. Springer (2007)
4. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479–513 (1983).
https://doi.org/10.1145/2402.322389
5. Berkholz, C., Keppeler, J., Schweikardt, N.: Answering conjunctive queries under updates. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, pp. 303–318. Chicago, May 14-19, 2017 (2017)