1. Sylvester's identity and multistep integer-preserving Gaussian elimination;Bareiss;Math. Comput.,1968
2. The computational complexity of partial derivatives;Baur;Theor. Comput. Sci.,1983
3. Factoring polynomials over large finite fields;Berlekamp;Math. Comput.,1970
4. On computing the determinant in small parallel time using a small number of processors;Berkowitz,1982
5. Structured vs. general models in computational complexity;Borodin,1982