1. Angluin, D.: Local and Global Properties in Networks of Processors (Extended Abstract). In: Miller, R.E., Ginsburg, S., Burkhard, W.A., Lipton, R.J. (eds.) Proceedings of the 12th Annual ACM Symposium on Theory of Computing. April 28-30, 1980, Los Angeles, California, USA, pp. 82–93. ACM (1980)
2. Arora, S., Hazan, E., Kale, S.: The Multiplicative Weights Update Method: a meta-Algorithm and Applications. Theory Comput. 8(1), 121–164 (2012)
3. Barceló, P., Kostylev, E., Monet, M., Pérez, J., Reutter, J.L., Silva, J.P.: The Logical Expressiveness of Graph Neural Networks. In: 8th International Conference on Learning Representations, ICLR 2020 Addis Ababa, Ethiopia. April 26-30, 2020. OpenReview.net (2020)
4. Barto, L.: The constraint satisfaction problem and universal algebra. Bull. Symb. Log. 21(3), 319–337 (2015)
5. Barto, L., Krokhin, A.A., Willard, R.: Polymorphisms, and how to use them. In: Krokhin, A.A., Zivný, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, vol. 7 of Dagstuhl Follow-Ups. pp. 1–44. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)