1. O. S. Rothaus, “On bent functions,” Journal of Combinatorial Theory, Series A 20 (3), 300–305 (1976).
2. N. N. Tokareva, “Bent functions: results and applications. A survey,” Prikl. Diskr. Mat. 1 (1), 15–37 (2009).
3. A. C. Yao, “Some complexity questions related to distributive computing (preliminary report),” in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (ACM, New York, 1979), pp. 209–213.
4. R. L. McFarland, “A family of difference sets in non-cyclic groups,” Journal of Combinatorial Theory, Series A 15 (1), 1–10 (1973).
5. K. Mehlhorn, E. M. Schmidt, “Las vegas is better than determinism in VLSI and distributed computing,” in Proceedings of the 14th Annual ACM Symposium on the Theory of Computing (ACM, New York, 1982), pp. 330–337.