- Adam R. Klivans, Rocco Servedio, Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, 258
- Philip M. Long, Rocco A. Servedio, “On the Weight of Halfspaces over Hamming Balls”, SIAM J. Discrete Math., 28, no. 3, 2014, 1035
- Alexander A. Sherstov, “The Intersection of Two Halfspaces Has High Threshold Degree”, SIAM J. Comput., 42, no. 6, 2013, 2329
- Mikael Goldmann, “On the power of a threshold gate at the top”, Information Processing Letters, 63, no. 6, 1997, 287
- Anindya De, Rocco A. Servedio, “A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting”, Probab. Theory Relat. Fields, 171, no. 3-4, 2018, 981
- Alexander S. Kulikov, Vladimir V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates”, Theory Comput Syst, 63, no. 5, 2019, 956
- Alexander A. Sherstov, “The Pattern Matrix Method”, SIAM J. Comput., 40, no. 6, 2011, 1969
- Wenxin Jiang, 1857, Multiple Classifier Systems, 2000, 87
- Anil Ada, Omar Fawzi, Hamed Hatami, 7408, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012, 338
- Philip M. Long, Rocco A. Servedio, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013, 21