Michael J. Freedman, Carmit Hazay, Kobbi Nissim, Benny Pinkas, “Efficient Set Intersection with Simulation-Based Security”, J Cryptol, 29, no. 1, 2016, 115
Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, 406
Pavel Hrubeš, “On the nonnegative rank of distance matrices”, Information Processing Letters, 112, no. 11, 2012, 457
Or Meir, Avi Wigderson, “Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds”, comput. complex., 28, no. 2, 2019, 145
J. Hastad, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993, 114
Martin Grohe, Christoph Koch, Nicole Schweikardt, “Tight lower bounds for query processing on streaming and external memory data”, Theoretical Computer Science, 380, no. 1-2, 2007, 199
P. Pudlák, V. Rödl, “Some combinatorial-algebraic problems from complexity theory”, Discrete Mathematics, 136, no. 1-3, 1994, 253
S. Jukna, A.S. Kulikov, “On covering graphs by complete bipartite subgraphs”, Discrete Mathematics, 309, no. 10, 2009, 3399
Petar Iliev, “On semantically labelled syntax trees and the non-existence of certain Sahlqvist formulae”, Logic Journal of the IGPL, 31, no. 3, 2023, 483
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov, “On the limits of gate elimination”, Journal of Computer and System Sciences, 96, 2018, 107