de Wolf R., “Lower bounds on matrix rigidity via a quantum argument”, Automata, languages and programming, Part I, Lecture Notes in Comput. Sci., 4051, Springer, Berlin, 2006, 62–71
Lokam S.V., “Quadratic lower bounds on matrix rigidity”, Theory and applications of models of computation, Lecture Notes in Comput. Sci., 3959, Springer, Berlin, 2006, 295–307
Alekhnovich M., “More on Average Case Vs Approximation Complexity”, 44th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, Annual IEEE Symposium on Foundations of Computer Science, ed. Titsworth F., IEEE Computer Soc, 2003, 298–307
Forster J., Simon H.U., “On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes uniform distribution”, Algorithmic learning theory, Lecture Notes in Comput. Sci., 2533, Springer, Berlin, 2002, 128–138
Satyanarayana V. Lokam, “Spectral Methods for Matrix Rigidity with Applications to Size–Depth Trade-offs and Communication Complexity”, Journal of Computer and System Sciences, 63:3 (2001), 449
Pudlák P., “A note on the use of determinant for proving lower bounds on the size of linear circuits”, Inform. Process. Lett., 74:5-6 (2000), 197–201
Lokam S.V., “On the rigidity of Vandermonde matrices”, Theoret. Comput. Sci., 237:1-2 (2000), 477–483
Bruno Codenotti, Pavel Pudlák, Giovanni Resta, “Some structural properties of low-rank matrices related to computational complexity”, Theoretical Computer Science, 235:1 (2000), 89
Bruno Codenotti, “Matrix rigidity”, Linear Algebra and its Applications, 304:1-3 (2000), 181