Jim Gray at Berkeley

ABSTRACT

Jim Gray spent a decade as a student and researcher at Berkeley. In action, he is remembered for his breadth, his depth, and his generosity.

REFERENCES

• 1: Gray, J. N. and Harrison, M. A.., 1966. The theory of sequential relations. Information and Control 9, 435--468.
• 2: Gray, J. N., Harrison, M. A.., and Ibarra, O. H., 1967. Two way pushdown automata.. Information and Control 11, 30--70.
• 3: Gallaire, H., Gray, J. N., Harrison, M. A.., and Herman, O. H., 1968. Infinite linear sequential machines.. Journal of Computer and System Sciences 2, 381--419.
• 4: Gray, J. N. and Harrison, M. A.., 1969. Single Pass Precedence Analysis (Extended Abstract). IEEE Conference Record of 1969 Tenth Annual Symposium on Switching and Automata Theory (Waterloo, Canada), 106--117.
• 5: Gray, J. N. 1969, Precedence Parsers for Programming Languages. Doctoral Thesis. Department of Computer Science, University of California, Berkeley California, 1--114.
• 6: Jim Gray, Locking, Record of the Project MAC conference on concurrent systems and parallel computation, ACM, New York, NY, 1970 [doi>10.1145/1344551.1344568]
• 7: James N. Gray , Michael A. Harrison, On the Covering and Reduction Problems for Context-Free Grammars, Journal of the ACM (JACM), v.19 n.4, p.675-698, Oct. 1972 [doi>10.1145/321724.321732]
• 8: Gray, J. N., Pessel, D. E., and Variaya, P., 1972, A critique of Forrester's model of an urban area, IEEE Transactions on Systems, Man, and Cybernetics, 139--144.
• 9: James N. Gray , Michael A. Harrison, Canonical Precedence Schemes, Journal of the ACM (JACM), v.20 n.2, p.214-234, April 1973 [doi>10.1145/321752.321755]

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.1 THE COMPUTER INDUSTRY

General Terms:
Algorithms, Design, Theory

Keywords:
Berkeley, education, history, research