1. Some connections between bounded query classes and nonuniform complexity;Amir,1990
2. Reconstructing algebraic functions from mixed data;Ar;SIAM J. Comput.,1998
3. R. Beals, R. Chang, W. Gasarch, J. Torán, On finding the number of graph automorphisms, Chicago J. Theoret. Comput. Sci. 1999 (1).
4. Approximable sets;Beigel;Inform. and Comput.,1995
5. The (non)enumerability of the determinant and the rank;Beygelzimer;Theory Comput. Systems,2003