Authors: Ambainis, A Buhrman, H Gasarch, W Kalyanasundaram, B Torenvliet, L

Citation: A. Ambainis et al., The communication complexity of enumeration, elimination, and selection, J COMPUT SY, 63(2), 2001, pp. 148-185

Authors: Beigel, R Gasarch, W Kummer, M Martin, G McNicholl, T Stephan, F

Citation: R. Beigel et al., The complexity of odd(n)(A), J SYMB LOG, 65(1), 2000, pp. 1-18

Authors: Beals, R Chang, R Gasarch, W Toran, J

Citation: R. Beals et al., On finding the number of graph automorphisms, CH J THEOR, (1), 1999, pp. 1-28

Authors: Gasarch, W

Citation: W. Gasarch, A survey of recursive combinatorics, STUD LOGIC, 139, 1998, pp. 1041-1176