A Programming and Problem-Solving Seminar

This report contains a record of the autumn 1980 session of CS 204, a problem-solving and programming seminar taught at Stanford that is primarily intended for first-year Ph.D. students. The seminar covers a large range of topics, research paradigms, and programming paradigms in computer science, so these notes will be of interest to graduate students, professors, and professional computer scientists.

[1]  Hanan Samet,et al.  Automatically proving the correctness of translations involving optimized code - research sponsored by Advanced Research Projects Agency, ARPA order no. 2494 , 1975, Stanford Artificial Intelligence Laboratory: Memo AIM.

[2]  David R. Barstow,et al.  Some Rules For The Automatic Synthesis Of Programs , 1975, IJCAI.

[3]  Douglas W. Clark,et al.  An empirical study of list structure in Lisp , 1977, CACM.

[4]  Paul Rovner,et al.  Techniques for the automatic selection of data structures , 1976, POPL.

[5]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[6]  B. Hilemàn.  Van nostrand reinhold. , 1983, Environmental science & technology.

[7]  J. W. Backus,et al.  The FORTRAN automatic coding system , 1899, IRE-AIEE-ACM '57 (Western).

[8]  H. L. Dorwart,et al.  The Tarry-Escott Problem , 1937 .

[9]  Robert W. Floyd,et al.  Syntactic Analysis and Operator Precedence , 1963, JACM.

[10]  David R. Barstow,et al.  Observations on the interaction between coding and efficiency knowledge in the PSI Program Synthesis System , 1976, ICSE '76.

[11]  G. Hardy.  The Theory of Numbers , 1922, Nature.

[12]  Alfred V. Aho,et al.  Optimal code generation for expression trees , 1975, STOC.

[13]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[14]  Donald E. Knuth,et al.  An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[15]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[16]  Alfred V. Aho,et al.  Code Generation for Expressions with Common Subexpressions , 1977, J. ACM.

[17]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[18]  Richard Bornat,et al.  Top-down Syntax Analysis , 1979 .

[19]  Donald E. Knuth,et al.  The Early Development of Programming Languages. , 1977 .

[20]  Saul Rosen,et al.  Programming systems and languages: a historical survey , 1964, AFIPS '64 (Spring).

[21]  Edward M. Reingold,et al.  Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[22]  Richard M. Van Slyke,et al.  Optimal design of centralized computer networks , 1971, Networks.

[23]  Jacob T. Schwartz,et al.  Automatic data structure choice in a language of very high level , 1975, CACM.

[24]  Niklaus Wirth,et al.  EULER: a generalization of ALGOL, and its formal definition: Part II , 1965, CACM.