perm filename BIB.DOC[BIB,CSR] blob
sn#638520 filedate 1982-01-26 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00072 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00003 00002
C00006 00003
C00009 00004
C00013 00005
C00017 00006
C00021 00007
C00025 00008
C00029 00009
C00033 00010
C00037 00011
C00039 00012
C00043 00013
C00047 00014
C00051 00015
C00055 00016
C00059 00017
C00063 00018
C00067 00019
C00068 00020
C00072 00021
C00076 00022
C00080 00023
C00084 00024
C00088 00025
C00092 00026
C00096 00027
C00098 00028
C00102 00029
C00106 00030
C00110 00031
C00114 00032
C00118 00033
C00122 00034
C00126 00035
C00130 00036
C00134 00037
C00138 00038
C00142 00039
C00146 00040
C00150 00041
C00154 00042
C00158 00043
C00161 00044
C00165 00045
C00169 00046
C00173 00047
C00177 00048
C00181 00049
C00185 00050
C00189 00051
C00192 00052
C00196 00053
C00200 00054
C00204 00055
C00208 00056
C00212 00057
C00216 00058
C00220 00059
C00223 00060
C00227 00061
C00231 00062
C00235 00063
C00239 00064
C00243 00065
C00247 00066
C00251 00067
C00255 00068
C00259 00069
C00262 00070
C00266 00071
C00269 00072
C00270 ENDMK
C⊗;
reportre "setup.csr[bib,csr]" source file;
F pointer operationsf
%3NUMBERING KEY
@The following is a key to reading the different report numbers.
%3STAN-CS-:%1 This is the number given to the report by the
Department of Computer Science. It is this number that
should be used when ordering a report from us.
%3AIM-:%1 This is a %2group%1 number. It stands for
Artificial Intelligence Memo.
%3HPP-:%1 This is a %2group%1 number. It stands for Heuristic
Programming Project.
%3SU326:%1 This is a DOE sponsored report, and this is their number
for it.
%3SLAC-:%1 This report may also be ordered from the Stanford
Linear Accelerator Center using this number.
%3LBL-:%1 This report may also be ordered from the Lawrence
Berkeley Laboratory using this number.
%3CSL-:%1 This report may also be ordered from the Computer
Science Laboratory (Department of Electrical Engineering) using
this number.
%3PB:%1 This report may be ordered from the National
Technical Information Service using this number.
%3AD:%1 This report may be ordered from the National
Technical Information Service using this number.
%3AD-A:%1 This report may be ordered from the National
Technical Information Service using this number.
@For example: If a report was numbered
STAN-CS-77-611 (AIM-298, AD-A046 703)
it means that you could order the report from the Stanford Department
of Computer Science by the number STAN-CS-77-611. You could also
order it from the Artificial Intelligence Group by the number AIM-
298. And if neither place had copies left available, you could write
to the National Technical Information Service and ask for the same
report by specifying number AD-A046 703.
@For people with access to the ARPA Network, the texts of some A.
I. Memos are stored online in the Stanford A. I. Laboratory disk
file. These are designated below by %2Diskfile: <file name>%1
appearing in the header.
To order reports from the Stanford Department of Computer Science (or
the Artificial Intelligence Group), use the following address:
Publications Coordinator
Department of Computer Science
Stanford University
Stanford, California 943O5 USA
To order reports from the National Technical Information Service, use
the following address:
U.S. Department of Commerce
National Technicl Information Service
5285 Port Royal Road
Springfield, Virginia 22161 USA
Memos that are also Ph.D. theses are so marked below and may be
ordered from:
University Microfilm
P. O. Box 1346
Ann Arbor, Michigan 48106
@For people with access to the ARPA Network, the texts of some A. I.
Memos are stored online in the Stanford A. I. Laboratory disk file.
These are designated below by "Diskfile: <file name>" appearing in
the header. This bibliography is kept in diskfile "AIMLST [BIB,DOC]
@SU-AI".
%3REPORTS 1 THRU 99%1
STAN-CS-63-1 (AD462108), J. B. Rosen, %2Primal Partition Programming
for Block Diagonal Matrices%1, 23 pages, November 1963.
STAN-CS-63-2 (AD427753), J. M. Pavkovich, %2The Soultion of Large
Systems of Algebraic Equations%1, 46 pages, December 1963.
STAN-CS-64-3 (AD430445), G. E. Forsythe (translated by), %2The
Theorems in a Paper by V. K. Saulev 'On an Estimate of the
Error in Obtaining Characteristic Functions by the Method of
Finite Differences' %1, 6 pages, January 1964.
STAN-CS-64-4 (AD434858), Stefan Bergman and J. G. Herriot,
%2Numerical Solution of Boundary Value Problems by the Method of
Integral Operators%1, 24 pages, February 1964.
STAN-CS-64-5 (N-6519765), J. B. Rosen, %2Existence and Uniqueness of
Equilibrium Points for Concave N-Person Games%1, 28 pages, March
1964.
STAN-CS-64-6 (AD600164), R. W. Hockney, %2A Fast Direct Solution of
Poisson's Fourier Analysis%1, 28 pages, April 1964.
STAN-CS-64-7 (PB176753), J. B. Rosen, %2Sufficient Conditions for
Optimal Control of Convex Processes%1, 29 pages, May 1964.
STAN-CS-64-8 (AD603116), G. Golub and W. Kahan, %2Calculating the
Singular Values and Pseudo-Inverse of a Matrix%1, 33 pages, May
1964.
STAN-CS-64-9 (AD604012), Charles Anderson, %2The QD-Algorithm as a
Method for Finding the Roots of a Polynomial Equation When All
Roots are Positive%1, 74 pages, June 1964.
STAN-CS-64-10 (AD603163), R. L. Causey (Thesis), %2On Closest Normal
Matrices%1, 131 pages, June 1964.
STAN-CS-64-11 (PB176754), T. Nakamura and J. B. Rosen, %2Elastic-
Plastic Analysis of Trusses by the Gradient Projection Method%1,
32 pages, July 1964.
STAN-CS-64-12 (AD608292), G. Golub and P. Businger, %2Numerical
Methods for Solving Linear Least Squares Problems (and) an Algol
Procedure for Finding Linear Least Squares Solutions%1, 27
pages, August 1964.
STAN-CS-64-13 (N65-27058), V. Pereyra and J. B. Rosen,
%2Computation of the Pseudo- inverse of a Matrix of Unknown
Rank%1, 28 pages, September 1964.
STAN-CS-64-14 (TT-65-61724), V. A. Efimenko (translated by G. Reiter
and C. Moler), %2On Approximate Calculations of the Eigenvalues
and Eigenfunctions of Boundary Value Problems in Partial
Differential Equations%1, 20 pages, November 1964.
STAN-CS-65-15 (AD611366), D. W. Grace (Thesis), %2Computer Search for
Non-Isomorphic Convex Polyhedra%1, 137 pages, January 1965.
STAN-CS-65-16 (AD611427), G. E. Forsythe and G. H. Golub,
%2Maximizing a Second Degree Polynomial on the Unit Sphere%1, 31
pages, February 1965.
STAN-CS-65-17 (AD611434), G. E. Forsythe and N. Wirth, %2Automatic
Grading Programs%1, 17 pages, February 1965.
STAN-CS-65-18 (AD612478), V. Pereyra, %2The Difference Correction
Method for Non- Linear Two-Point Boundary Value Problems%1,
February 1965.
STAN-CS-65-19 (TT-65-61839), M. I. Ageev and J. Maclaren, %2English
Equivalents of Metalinguistic Terms of Russian ALGOL%1, March
1965.
STAN-CS-65-20 (PB176755), N. Wirth and H. Weber, %2EULER: A
Generalition of ALGOL and its Formal Definition%1, 115 pages,
April 1965.
STAN-CS-65-21 (PB176756), D. D. Fisher, J. von der Groeben and J. G.
Toole, %2Vectorgardiographic Analysis by Digital Computer,
Selected Results%1, 104 pages, May 1965.
STAN-CS-65-22 (AD616676), C. B. Moler (Thesis), %2Finite Difference
Methods for the Eigenbales of Laplace's Operator%1, 142 pages,
May 1965.
STAN-CS-65-23 (AD618214), B. D. Rudin (Thesis), %2Convex Polynomial
Approximation%1, 44 pages, June 1965.
STAN-CS-65-24 (AD616611), V. V. Klyuyev and N. I. Kokovkin Shoherbak
(translated by G. J. Tee), %2On the Minimization of the Number
of Arithmetic Operations for the Solution of Linear Algebraic
Systems of Equations%1, 24 pages, June 1965.
STAN-CS-65-25 (AD618215), P. G. Hodge, %2Yield-Point Load
Determination by Nonlinear Programming%1, 24 pages, June 1965.
STAN-CS-65-26 (not at NTIS), G. E. Forsythe, %2Stanford University's
Program in Computer Science%1, 15 pages, June 1965.
STAN-CS-65-27 (AD618216), E. A. Volkov (translated by R. Bartels),
%2An Analysis of One Algorithm of Heightened Precision of the
Method of Nets for the Solution of Poisson's Equation%1, 29
pages, July 1965.
STAN-CS-65-28 (AD618217), J. Miller and G. Strang, %2Matrix Theorems
for Partial Differential an Difference Equations%1, 33 pages,
July 1965.
STAN-CS-65-29 (AD624837), V. Pereyra, %2On Improving an Approximate
Solution of a Functional Equation by Deferred Corrections%1, 32
pages, August 1965.
STAN-CS-65-30 (SS624-829), S. Marchuk (translated by G. J. Tee),
%2The Automatic Construction of Computational Algorithms%1, 56
pages, September 1965.
STAN-CS-65-31 (SS626-315), P. A. Raviart, %2On the Approximation of
Weak Solutions of Linear Parabolic Equations by a Class of
Multi-step Difference Methods%1, 55 pages, December 1965.
STAN-CS-65-32 (SS633-557), R. W. Hockney, %2Minimum Multiplication
Fourier Analysis%1, 53 pages, December 1965.
STAN-CS-65-33 (PB176763), N. Wirth, %2A Programming Language for the
360 Computers%1, 23 pages, December 1965.
STAN-CS-66-34 (SS630-998), J. M. Varah, %2Eigenvectors of a Real
Matrix by Inverse Iteration%1, 24 pages, February 1966.
STAN-CS-66-35 (PB176758), N. Wirth and C. Hoare, %2A Contribution to
the Development of ALGOL%1, 64 pages, February 1966.
STAN-CS-66-36 (PB176759), J. F. Traub, %2The Calculation of Zeros of
Polyynomials and Analytic Functions%1, 26 pages, April 1966.
STAN-CS-66-37 (PB176789), J. D. Reynolds, %2Cogent 1.2 Operations
Manual%1, 33 pages, April 1966.
STAN-CS-66-38 (AIM-40, AD662880), J. McCarthy and J. Painter,
%2Correctness of a Compiler for Arithmetic Expressions%1, 13
pages, April 1966.
STAN-CS-66-39 (PB176760), G. E. Forsythe, %2A University's
Educational Program in Computer Science%1, 26 pages, May 1966.
STAN-CS-66-40 (AD639052), G. E. Forsythe, %2How Do You Solve a
Quadratic Equation?%1, 19 pages, June 1966.
STAN-CS-66-41 (SS638-976), W. Kahan, %2Accurate Eigenvalues of a
Symmetric Tri-Diagonal Matrix%1, 53 pages, July 1966.
STAN-CS-66-42 (SS638-797), W. Kahan, %2When to Neglect Off-Diagonal
Elements of Symmetric Tri-Diagonal Matrices%1, 10 pages, July
1966.
STAN-CS-66-43 (SS638-798), W. Kahan and J. Varah, %2Two Working
Algorithms for the Eigenvalues of a Symmetric Tri-Diagonal
Matrix%1, 28 pages, August 1966.
STAN-CS-66-44 (SS638-818), W. Kahan, %2Relaxation Methods for an
Eigenvalue Problem%1, 35 pages, August 1966.
STAN-CS-66-45 (SS638-799), W. Kahan, %2Relaxation Methods for Semi-
Definite Systems%1, 31 pages, August 1966.
STAN-CS-66-46 (SS638-809), G. E. Forsythe, %2Today's Computational
Methods of Linear Algebra%1, 47 pages, August 1966.
STAN-CS-66-47 (PB173335), P. Abrams, %2An Interpreter for 'Inverson
Notation' %1, 61 pages, August 1966.
STAN-CS-66-48 (SS639-166), W. M. McKeeman (Thesis), %2An Approach to
Computer Language Design%1, 124 pages, August 1966.
STAN-CS-66-49 (AIM-43, SS640-836), D. R. Reddy (Thesis), %2An
Approach to Computer Speech Recognition by Direct Analysis of
Speech Wave%1, 143 pages, September 1966.
STAN-CS-66-50 (AIM-46, PB176761), S. Persson (Thesis), %2Some
Sequence Extrapulating Programs: A Study of Representation and
Modelling in Inquiring Systems%1, 176 pages, September 1966.
STAN-CS-66-51 (AD648394), S. Bergman, J. G. Herriot and T. G. Kurtz,
%2Numerical Calculation of Transonic Flow Patterns%1, 35 pages,
October 1966.
STAN-CS-66-52 (PB176762), A. C. Shaw, %2Lecture Notes on a Course in
Systems Programming%1, 216 pages, December 1966.
STAN-CS-66-53 (PB176757), N. Wirth, %2A Programming Language for the
360 Computers%1, 81 pages, December 1966.
STAN-CS-67-54 (AD662882), G. Golub and T. N. Robertson, %2A
Generalized Bairstow Algorithm%1, 10 pages, January 1967.
STAN-CS-67-55 (AD647200), D. A. Adams, %2A Stopping Criterion for
Polynomial Root Finding%1, 11 pages, February 1967.
STAN-CS-67-56 (PB176764), F. L. Bauer, %2QD-Method with Newton
Shift%1, 6 pages, March 1967.
STAN-CS-67-57 (PB176765), D. Gries, %2The Use of Transition Matrices
in Compiling%1, 60 pages, March 1967.
STAN-CS-67-58 (PB176766), V. Tixier (Thesis), %2Recursive Functions
of Regular Expressions in Language Analysis%1, 146 pages, March
1967.
STAN-CS-67-59 (SS650-116), J. H. Wilkinson, %2Almost Diagonal
Matrices with Multiple or Close Eigenvalues%1, 18 pages, April
1967.
STAN-CS-67-60 (SS650-117), J. H. Wilkinson, %2Two Algorithms Based on
Successive Linear Interpolation%1, 13 pages, April 1967.
STAN-CS-67-61 (SS650-610), G. E. Forsythe, %2On the Asymptotic
Directions of the S-Dimensional Optimum Gradient Method%1, 43
pages, April 1967.
STAN-CS-67-62 (SS650-620), M. Tienari, %2Varying Length Floating
Point Arithmetic: A Necessary Tool for the Numerical Analyst%1,
38 pages, April 1967.
STAN-CS-67-63 (SS650-627), G. Polya, %2Graeffe's Method for
Eigenvalues%1, 9 pages, April 1967.
STAN-CS-67-64 (SS651-201), P. Richman, %2Floating-Point Number
Representations: Base Choice Versus Exponent Range%1, 32 pages,
April 1967.
STAN-CS-67-65 (PB176767), N. Wirth, %2On Certain Basic Concepts of
Programming Languages%1, 30 pages, May 1967.
STAN-CS-67-66 (AD652921), J. M. Varah (Thesis), %2The Computation of
Bounds for the Invariant Subspaces of a General Matrix
Operator%1, 240 pages, May 1967.
STAN-CS-67-67 (AD652992), R. H. Bartels and G. H. Golub,
%2Computational Considerations Regarding the Calculation of
Chebyshev Solutions for Over-Determined Linear Equations Systems
by the Exchange Method%1, 63 pages, June 1967.
STAN-CS-67-68 (PB176768), N. Wirth, %2The PL 360 System%1, 63 pages,
June 1967.
STAN-CS-67-69 (PB176769), J. Feldman and D. Gries, %2Translator
Writing Systems%1, 127 pages, June 1967.
STAN-CS-67-70 (AD655472), S. Bergman, J. G. Herriot and P. L.
Richman, %2On Computation of Flow Patterns of Compressible
Fluids in the Transonic Region%1, 77 pages, July 1977.
STAN-CS-67-71 (AD655230), M. A. Jenkins and J. F. Traub, %2An
Algorithm for an Automatic General Polynomial Solver%1, 38
pages, July 1967.
STAN-CS-67-72 (PB175581), G. H. Golub and L. B. Smith, %2Chebysev
Approximation of Continuous Functions by a Chebyshev Systems of
Functions%1, 54 pages, July 1967.
STAN-CS-67-73 (AD662883), P. Businger and G. H. Golub, %2Least
Squares, Singular Values and Matrix Approximations (and) an
ALGOL Procedure for Computing the Singular Value
Decomposition%1, 12 pages, July 1967.
STAN-CS-67-74 (AD657639), G. E. Forsythe, %2What is a Satisfactory
Quadratic Equation Solver?%1, 9 pages, August 1967.
STAN-CS-67-75 (PB175793), F. L. Bauer, %2Theory of Norms%1, 136
pages, August 1967.
STAN-CS-67-76 (AD657450), P. M. Anselone, %2Collectively Compact
Operator Approximations%1, 60 pages, April 1967.
STAN-CS-67-77 (PB176770), G. E. Forsythe, %2What To Do Till The
Computer Scientist Comes%1, 13 pages, September 1967.
STAN-CS-67-78 (PB176771), K. M. Colby and H. Enea, %2Machine
Utilization of the Natural Language Word 'Good' %1, 8 pages,
September 1967.
STAN-CS-67-79 (AD662884), R. W. Doran, %2360 U.S. Fortran IV Free
Field Input/Output Subroutine Package%1, 21 pages, October 1967.
STAN-CS-67-80 (AD662902), J. Friedman, %2Directed Random Generation
of Sentences%1, 30 pages, October 1967.
STAN-CS-67-81 (AD661217), G. H. Golub and J. H. Welsch,
%2Calculation of Gauss Quadrature Rules%1, 28 pages, November
1967.
STAN-CS-67-82 (PB176775), L. Tesler, H. Enea and K. M. Colby, %2A
Directed Graph Representation for Computer Simulation of Belief
Systems%1, 31 pages, December 1967.
STAN-CS-68-83 (AD664237), A. Bjorck and G. Golub, %2Iterative
Refinements of Linear Squares Solutions by House-Holder
Transformations%1, 28 pages, January 1968.
STAN-CS-68-84 (AD692680), J. Friedman, %2A Computer System for
Transformational Grammar%1, 31 pages, January 1968.
STAN-CS-68-85 (PB177426), K. M. Colby, %2Computer-Aided Language
Development in Nonspeaking Mentally Disturbed Children%1, 35
pages, December 1968.
STAN-CS-68-86 (PB179162), H. R. Bauer, S. Becker and S. L. Graham,
%2ALGOL With Programming%1, 90 pages, January 1968.
STAN-CS-68-87 (PB178176), J. Ehrman, %2CS 139 Lecture Notes Part 1,
Sections 1 thru Preliminary Version%1, 188 pages, 1968.
STAN-CS-68-88 (AD665672), S. Schechter, %2Relaxation Methods for
Convex Problems%1, 19 pages, February 1968.
STAN-CS-68-89 (PB180920), H. R. Bauer, S. Becker and S. L. Graham,
%2ALGOL W (revised)%1, 42 pages, March 1968.
STAN-CS-68-90 (PB178177), V. R. Lesser, %2A Multi-Level Computer
Organization Designed to Separate Data Accessing from the
Computation%1, 20 pages, March 1968.
STAN-CS-68-91 (PB178114), N. Wirth, J. W. Wells, Jr. and E. H.
Satterthwaite, Jr., %2The PL360 System%1, 89 pages, April 1968.
STAN-CS-68-92 (PB178078), H. Enea, %2MLISP%1, 18 pages, March 1968.
STAN-CS-68-93 (PB178078), G. E. Forsythe, %2Computer Science and
Education%1, 50 pages, March 1968.
STAN-CS-68-94 (SLACR-84), A. C. Shaw (Thesis), %2The Formal
Description and Parsing of Pictures%1, 205 pages, April 1968.
STAN-CS-68-95 (not at NTIS), J. Friedman and R. W. Doran, %2A Formal
Syntax for Transformational Grammar%1, 47 pages, March 1968.
STAN-CS-68-96 (AD673673), L. B. Smith, %2Interval Arithmetic
Determinant Evalation and its Use in Testing for a Chebyshev
System%1, 26 pages, April 1968.
STAN-CS-68-97 (not at NTIS), W. F. Miller, %2Research in the Computer
Science Department at Stanford University%1, 49 pages, April
1968.
STAN-CS-68-98 (PB179162), H. Bauer, S. Becker and S. Graham, %2ALGOL
With Implementation%1, 147 pages, May 1968.
STAN-CS-68-99 (PB179057), J. Friedman, %2Lecture Notes on Foundations
for Computer Science%1, 212 pages, June 1968.
%3REPORTS 100 THRU 199%1
STAN-CS-68-100 (PB178877), T. H. Bredt, %2A Computer Model of
Information Processing in Children%1, 60 pages, June 1968.
STAN-CS-68-101 (AIM-60, AD672923), D. M. Kaplan (Thesis), %2The
Formal Theoretic Analysis of Stront Equivalence for Elemental
Programs%1, 263 pages, June 1968.
STAN-CS-68-102 (AD677982), A. Pnueli, %2Integer Programming Over a
Cone%1, 29 pages, July 1968.
STAN-CS-68-103 (AD692689), T. H. Bredt and J. Friedman, %2Lexical
Insertion in Transformational Grammar%1, 47 pages, June 1968.
STAN-CS-68-104 (AD673010), R. Bartels, %2A Numerical Investigation of
the Simplex Method%1, 122 pages, July 1968.
STAN-CS-68-105 (AD673674), P. Richman (Thesis), %2Epsiolon-
Calculus%1, 138 pages, August 1968.
STAN-CS-68-106 (AIM-65, AD673971), B. Huberman (Thesis), %2A Program
to Play Chess End Games%1, 168 pages, August 1968.
STAN-CS-68-107 (AD668558), M. Jenkins, %2A Three-Stage Variable-Shift
Iteration for Polynomial Zeros and its Relation to Generalized
Rayleigh Interation%1, 46 pages, August 1968.
STAN-CS-68-108 (AD692681), J. Friedman (editor), %2Computer
Experiments in Transformational Grammar%1, 36 pages, August
1968.
STAN-CS-68-109 (AD692690), J. Friedman, %2A Computer System for
Writing and Testing Transformational Grammars - Final Report%1,
14 pages, September 1968.
STAN-CS-68-110 (PB180920), H. Bauer, S. Becker, S. Graham and E.
Satterthwaite, %2ALGOL W (revised)%1, 103 pages, October 1968.
STAN-CS-68-111 (AD692691), J. Friedman and T. Martner, %2Analysis in
Transformational Grammar%1, 18 pages, August 1968.
STAN-CS-68-112 (AD692687), J. Friedman and B. Pollack, %2A Control
Language for Transformational Grammar%1, 51 pages, August 1968.
STAN-CS-68-113 (PB188705), W. J. Hansen, %2The Impact of Storage
Management on Plex Processing Language Implementation%1, 253
pages, July 1968.
STAN-CS-68-114 (PB182156), J. George, %2Calgen, An Interactive
Picture Calculus Generation System%1, 75 pages, December 1968,
STAN-CS-68-115 (AD692686), J. Friedman, T. Bredt, R. Doran, T.
Martner and B. Pollack, %2Programmer's Manual for a Computer
System for Transformational Grammar%1, 199 pages, August 1968.
STAN-CS-68-116 (AIM-72, AD680036), D. Pieper (Thesis), %2The
Kinematics of Manipulators Under Computer Control%1, 157 pages,
October 1968.
STAN-CS-68-117 (PB182151), D. Adams (Thesis), %2A Computational Model
with Data Flow Sequencing%1, 130 pages, December 1968.
STAN-CS-68-118 (AIM-74, AD681027), D. Waterman (Thesis), %2Machine
Learning of Heuristics%1, 235 pages, December 1968.
STAN-CS-68-119 (AD692681), G. Dantzig, et al., %2Mathematical
Programming Language%1, 91 pages, May 1968.
STAN-CS-68-120 (PB182166), E. Satterthwaite, %2Mutant 0.5: An
Experimental Programming Language%1, 60 pages, February 1968.
STAN-CS-69-121 (AD682978), C. B. Moler, %2Accurate Bounds for the
Eigenvalues of the Laplacian and Applications to Rhombical
Domains%1, 17 pages, February 1969.
STAN-CS-69-122 (AD687450), W. C. Mitchell and D. L. McCraith,
%2Heuristic Analysis of Numerical Variants of the Gram-Schmidt
Orthonormalization Process%1, 21 pages, February 1969.
STAN-CS-69-123 (AD696982), R. P. Brent, %2Empirical Evidence for a
Proposed Distribution of Small Prime Gaps%1, 18 pages, February
1969.
STAN-CS-69-124 (AD687719), G. H. Golub, %2Matrix Decompositions and
Statistical Calculations%1, 52 pages, March 1969.
STAN-CS-69-125 (AIM-89, AD692390), J. Feldman, J. Horning, J. Gips
and S. Reder, %2Grammatical Complexity and Inference%1, 100
pages, June 1969.
STAN-CS-69-126 (AD702898), G. Dantzig, %2Complementary Spanning
Trees%1, 10 pages, March 1969.
STAN-CS-69-127 (AIM-85, AD687720), P. Vicens (Thesis), %2Aspects of
Speech Recognition by Computer%1, 210 pages, April 1969.
STAN-CS-69-128 (AD687717), G. H. Golub, B. L. Buzbee and C. W.
Nielson, %2The Method of Odd/Even Reduction and Factorization
with Application to Poisson's Equation%1, 39 pages, April 1969.
STAN-CS-69-129 (not at NTIS), W. F. Miller, %2Research in the
Computer Science Department%1, 82 pages, April 1969.
STAN-CS-69-130 (AIM-83, PB183907), R. C. Schank (Thesis), %2A
Conceptual Dependency Representation for a Computer-Oriented
Semantics%1, 201 pages, March 1969.
STAN-CS-69-131 (SLAC-96), L. B. Smith (Thesis), %2The Use of Man-
Machine Interaction in Data-Fitting Problems%1, 287 pages, March
1969.
STAN-CS-69-132, Never Printed.
STAN-CS-69-133 (AD687718), G. H. Golub and C. Reinsch, %2Handbook
Series Linear Algebra: Singular Value Decompositions and Least
Sequares Solutions%1, 38 pages, May 1969.
STAN-CS-69-134 (AD700923), G. H. Golub and M. A. Saunders, %2Linear
Least Squares and Quadratic Programming%1, 38 pages, May 1969.
STAN-CS-69-135 (SLACR-102, not at NTIS), D. Gries, %2Compiler
Implementation Language%1, 113 pages, May 1969.
STAN-CS-69-136 (SLACR-104, not at NTIS), I. Pohl (Thesis), %2Bi-
Directional and Heuristic Search in Path Problems%1, 157 pages,
May 1969.
STAN-CS-69-137 (AD698801), P. Henrici, %2Fixed Points of Analytic
Functions%1, 7 pages, July 1969.
STAN-CS-69-138 (AIM-96, AD696394), C. C. Green (Thesis), %2The
Application of Theorem Proving to Question-Answering Systems%1,
162 pages, June 1969.
STAN-CS-69-139 (AIM-98, AD695401), J. J. Horning (Thesis), %2A Study
of Grammatical Inference%1, 166 pages, August 1969.
STAN-CS-69-140 (AD698799), G. E. Forsythe, %2Design - Then and
Now%1, 15 pages, September 1969.
STAN-CS-69-141 (PB188542), G. Dahlquist, S. C. Eisenstat and G. H.
Golub, %2Bounds for the Error of Linear Systems of Equations
Using the Theory of Moments%1, 26 pages, October 1969.
STAN-CS-69-142, G. H. Golub and R. Underwood, %2Stationary Values of
the Ratio of Quadratic Forms Subject to Linear Constraints%1, 22
pages, November 1969.
STAN-CS-69-143 (AD694464), M. A. Jenkins (Thesis), %2Three-Stage
Variable-Shift for the Solution of Polynomial Equations with a
Posteriori Error Bounds for the Zeros%1 (has also been printed
incorrectly as STAN-CS-69-138), 199 pages, August 1969.
STAN-CS-69-144 (AD698800), G. E. Forsythe, %2The Maximum and Minimum
of a Positive Definite Quadratic Polynomial on a Sphere are
Convex Functions of the Radius%1, 9 pages, July 1969.
STAN-CS-69-145 (AD698798), P. Henrici, %2Methods of Search for
Solving Polynomial Equations%1, 25 pages, December 1969.
STAN-CS-70-146 (not at NTIS), G. O. Ramos (Thesis), %2Roundoff Error
Analysis of the Fast Fourier Transform%1, February 1970.
STAN-CS-70-147 (AD699897), G. E. Forsythe, %2Pitfalls in Computation,
or Why a Math Book Isn't Enough%1, 43 pages, January 1970.
STAN-CS-70-148 (PB188749), D. E. Knuth and R. W. Floyd, %2Notes on
Avoiding `GO TO' Statements%1, 15 pages, January 1970.
STAN-CS-70-149 (PB188748), D. E. Knuth, %2Optimum Binary Search
Trees%1, 19 pages, January 1970.
STAN-CS-70-150 (AD699898), J. H. Wilkinson, %2Elementary Proof of the
Wielandt-Hoffman Theorem and of its Generalization%1, 8 pages,
January 1970.
STAN-CS-70-151 (not at NTIS), E. A. Volkov (translated by G. E.
Forsythe), %2On the Properties of the Derivatives of the
Solution of Laplace's Equation and the Errors of the Method of
Finite Differences for Boundary Values in C(2) and C(1,1)%1, 26
pages, January 1970.
STAN-CS-70-152 (not at NTIS), S. Gustafson, %2Rapid Computation of
Interpolation Formulae and Mechanical Quadrature Rules%1, 23
pages, February 1970.
STAN-CS-70-153 (AD701358), S. Gustafson, %2Error Propagation by Use
of Interpolation Formulae and Quadrature Rules which are
Computed Numerically%1, 17 pages, February 1970.
STAN-CS-70-154, H. S. Stone, %2The Spectrum of Incorrectly Decoded
Bursts for Cyclic Error Codes%1, 24 pages, February 1970.
STAN-CS-70-155 (AD705508), B. L. Buzbee, G. H. Golub and C. W.
Nielson, %2The Method of Odd/Even Reduction and Factorization
with Application to Poisson's Equation, Part II%1, 36 pages,
March 1970.
STAN-CS-70-156 (AD713972), G. B. Dantzig, %2On a Model for Computing
Roundoff Error of a Sum%1, October 1979.
STAN-CS-70-157 (AD705509), R. P. Brent, %2Algorithms for Matrix
Multiplication%1, 54 pages, March 1970.
STAN-CS-70-158, H. Stone, %2Parallel Processing with the Perfect
Shuffle%1, 36 pages, March 1970.
STAN-CS-70-159 (AD708690), J. A. George, %2The Use of Direct Methods
for the Solution of the Discrete Poisson Equation on Non-
Rectangular Regions%1, 2 pages, June 1970.
STAN-CS-70-160 (CSL-TR-5, AD707762), T. H. Bredt and E. McCluskey,
%2A Model for Parallel Computer Systems%1, 62 pages, April 1970.
STAN-CS-70-161 (SLACR-117, not at NTIS), L. J. Hoffman (Thesis),
%2The Formulary Model for Access Control and Privacy in Computer
Systems%1, 81 pages, May 1970.
STAN-CS-70-162 (SLACP-760, AD709564), R. H. Bartels, G. H. Golub and
M. A. Saunders, %2Numerical Techniques in Mathematical
Programming%1, 61 pages, May 1970.
STAN-CS-70-163 (AD708691), H. Malcolm, %2An Algorithm for Floating-
Point Accumulation of Sums with Small Realative Error%1, 22
pages, June 1970.
STAN-CS-70-164 (AD708692), V. I. Gordonova (translated by L.
Kaufman), %2Estimates of the Roundoff Error in the Solution of a
System of Conditional Equations, by V. I. Gordonova%1, 16 pages,
June 1970.
STAN-CS-70-165, H. Bauer and H. Stone, %2The Scheduling of N Tasks
with M Operations on Two Processors%1, 34 pages, July 1970.
STAN-CS-70-166 (AIM-128, AD713841), E. J. Sandewall, %2Representing
Natural-Language Information in Predicate Calculus%1, 27 pages,
July 1970.
STAN-CS-70-167 (AIM-129, AD712460), S. Igarashi, %2Semantics of
ALGOL-Like Statements%1, 95 pages, June 1970.
STAN-CS-70-168 (AIM-130, AD713252), M. Kelly (Thesis), %2Visual
Identification of People by Computer%1, 138 pages, July 1970.
STAN-CS-70-169 (AIM-126, AD711329), D. Knuth, %2Examples of Formal
Semantics%1, 35 pages, August 1970.
STAN-CS-70-170 (CSL-TR-6, AD711334), T. Bredt, %2Analysis and
Synthesis of Concurrent Sequential Programs%1, 50 pages, May
1970.
STAN-CS-70-171 (CSL-TR-8, AD714202), T. Bredt, %2A Survey of Models
for Parrallel Computing%1, 58 pages, August 1970.
STAN-CS-70-172 (CSL-TR-7, AD714180), T. Bredt, %2Analysis of Parallel
Systems%1, 59 pages, August 1970.
STAN-CS-70-173 (CSL-TR-9, AD714181), T. Bredt, %2The Mutual Exclusion
Problem%1, 68 pages, August 1970.
STAN-CS-70-174 (AIM-127, AD711395), Z. Manna and R. Waldinger,
%2Towards Automatic Program Synthesis%1, 55 pages, August 1970.
STAN-CS-70-175 (AD713842), M. Malcolm, %2A Description and
Subroutines for Computing Euclidean Inner Products on the IBM
360%1, 14 pages, October 1970.
STAN-CS-70-176 (AIM-131, AD715128), E. A. Feigenbaum, B. C. Buchanan
and J. Lederberg, %2On Generality and Problem Solving: A Case
Study Using the DENDRAL Program%1, 48 pages, September 1970.
STAN-CS-70-177 (AD715511), R. W. Floyd and D. E. Knuth, %2The Bose-
Nelson Sorting Problem%1, 16 pages, October 1970.
STAN-CS-70-178 (not at NTIS), G. Forsythe and W. F. Miller,
%2Research Review%1, 186 pages, October 1970.
STAN-CS-70-179 (AIM-135, AD716566), D. C. Smith, %2MLISP%1, 99 pages,
October 1970.
STAN-CS-70-180 (AIM-132, AD715665), G. Falk (Thesis), %2Computer
Interpretation of Imperfect Line Data as a Three-Dimensional
Scene%1, 187 pages, October 1970.
STAN-CS-70-181 (AIM-133), A. C. Hearn, %2Reduce 2 - User's Manual%1,
85 pages, October 1970.
STAN-CS-70-182 (AIM-134, AD748565), J. Tenenbaum (Thesis),
%2Accomodation in Computer Vision%1, 452 pages, Septmeber 1970.
STAN-CS-70-183 (AIM-136, AD717600), G. M. White, %2Machine Learning
Through Signature Trees...Application to Human Speech%1, 40
pages, October 1970.
STAN-CS-70-184 (AD715512), M. Malcolm, %2A Note on a Conjecture of J.
Mordell%1, 5 pages, October 1970.
STAN-CS-70-185 (TID22593), E. Nelson, %2Graph Program Simulation%1,
175 pages, October 1970.
STAN-CS-70-186 (AIM-137, AD715513), D. E. Knuth, %2An Empirical Study
of Fortran Programs%1, 50 pages, November 1970.
STAN-CS-70-187 (AD197154), G. Dantzig et al., %2Mathematical
Programming Language (MPL) Specification Manual for Committee
Review%1, 82 pages, December 1970.
STAN-CS-70-188 (AIM-138, PB197161), E. Ashcroft and Z. Manna, %2The
Translation of `Go To' Programs to `While' Programs%1, 28 pages,
December 1970.
STAN-CS-70-189 (AIM-139, AD717601), Z. Manna, %2Mathematical Theory
of Partial Correctness%1, 24 pages, December 1970.
STAN-CS-70-190 (AD719398), J. Hopcroft, %2An N Log N Algorithm for
Minimizing States in a Finite Automaton%1, 12 pages, December
1970.
STAN-CS-70-191 (SLACP-904, PB198494), V. Lesser, %2An Introduction to
the Direct Emulation of Control Structures by a Parallel Micro-
Computer%1, 26 pages, December 1970.
STAN-CS-70-192 (AD719399), J. Hopcroft, %2An N Log N Algorithm for
Isomorphism of Planar Triply Connected Graphs%1, 6 pages,
December 1970.
STAN-CS-70-193 (AIM-140, not at NTIS), R. Schank, %2Intention, Memory
and Computer Understanding%1, 59 pages, December 1970.
STAN-CS-70-194 (PB198495), D. E. Knuth, %2The Art of Computer
Programming - Errata et Addenda%1, 28 pages, December 1970.
STAN-CS-70-195 (723871), B. L. Buzbee, F. W. Dorr, A. George and G.
H. Golub, %2The Direct Solution of the Discrete Poisson
Equation on Irregular Regions%1, 30 pages, December 1970.
STAN-CS-70-196 (AD725167), C. B. Moler, %2Matrix Computations with
Fortran and Paging%1, 13 pages, December 1970.
STAN-CS-71-197 (not at NTIS), D. E. Knuth and R. L. Sites,
%2Mix/360 User's Guide%1, 11 pages, January 1971.
STAN-CS-71-198 (AD726170), R. Brent (Thesis), %2Algorithms for
Finding Zeros and Extrema of Functions without Calculating
Derivatives%1, 250 pages, February 1971.
STAN-CS-71-199 (PB198415), Staff, %2Bibliography of Stanford Computer
Science Reports 1963-1971%1, 28 pages, February 1971.
%3REPORTS 200 THRU 299%1
STAN-CS-71-200 (PB198416), J. G. Herriot and C. H. Peinsch, %2ALGOL
60 Procedures for the Calculation of Interpolating Natural
Spline Functions%1, 30 pages, February 1971.
STAN-CS-71-201 (AD722434), J. Hopcroft and R. Tarjan, %2Planarity
Testing in V Log V Steps: Extended Abstracts%1, 18 pages,
February 1971.
STAN-CS-71-202 (SLAC-117, not at NTIS), H. J. Saal and W. Riddle,
%2Communicating Semaphores%1, 21 pages, February 1971.
STAN-CS-71-203 (AIM-141, AD730506), B. Buchanan, E. Feigenbaum and J.
Lederberg, %2The Heuristic DENDRAL Program for Explaining
Empirical Data%1, 20 pages, February 1971.
STAN-CS-71-204 (PB198510), D. Ingalls, %2FETE - a Fortran Execution
Time Estimator%1, 12 pages, February 1971.
STAN-CS-71-205 (AIM-142, AD731383), Robin Milner, %2An Algebraic
Definition of Simulation Between Programs%1, 20 pages, March
1971.
STAN-CS-71-206 (AD726158), D. E. Knuth, %2Mathematical Analysis of
Algorithms%1, 26 pages, March 1971.
STAN-CS-71-207 (AD726169), J. Hopcroft and R. Tarjan, %2Efficient
Algorithms for Graph Manipulation%1, 19 pages, March 1971.
STAN-CS-71-208 (AD726171), J. A. George (Thesis), %2Computer
Implementation of the Finite Element Method%1, 220 pages, March
1971.
STAN-CS-71-209 (AIM-143, AD724867), J. McCarthy and Staff, %2Project
Technical Report%1, 80 pages, March 1971.
STAN-CS-71-210 (PB201917), J. Gerry Purdy, %2Access - a Program for
the Catalog and Access of Information%1, 28 pages, March 1971.
STAN-CS-71-211 (AD727104), M. Malcolm, %2An Algorithm to Reveal
Properties of Floating-Point Arithmetic%1, 8 pages, March 1971.
STAN-CS-71-212 (AD727107), M. A. Morgana, %2Time and Memory
Requirements for Solving Linear Systems%1, 7 pages, March 1971.
STAN-CS-71-213 (PB201629), R. Tarjan, %2The Switchyard Problem:
Sorting Using Networks of Queues and Stacks%1, 13 pages, April
1971.
STAN-CS-71-214 (AD727108), R. L. Graham, D. E. Knuth and T. S.
Motzkin, %2Complements and Transitive Closures%1, 6 pages, April
1971.
STAN-CS-71-215 (AD727115), M. Malcolm, %2PL360 (Revised) - a
Programming Language for the IBM 360%1, 91 pages, May 1971.
STAN-CS-71-216 (AIM-147, AD732457), R. E. Kling, %2Reasoning by
Analogy with Applications to Heuristics Problem Solving: a Case
Study%1, 180 pages, May 1971.
STAN-CS-71-217 (AIM-148, AD731730), E. A. Ashcroft, Z. Manna and A.
Pnueli, %2Decidable Properties of Monadic Functional Schemas%1,
9 pages, May 1971.
STAN-CS-71-218 (AD731038), N. G. Debruijn, D. E. Knuth and S. O.
Rice, %2The Average Height of Plane Trees%1, 7 pages, May 1971.
STAN-CS-71-219 (AIM-144, not at NTIS), Lynn Quam (Thesis), %2Computer
Comparison of Pictures%1, 120 pages, May 1971.
STAN-CS-71-220 (CSL-4, AD727116), Harold Stone, %2Dynamic Memories
with Enhanced Data Access%1, 32 pages, February 1971.
STAN-CS-71-221 (AIM-145, AD731729), B. G. Buchanan, E. Feigenbaum and
J. Lederberg, %2A Heuristic Programming Study of Theory
Formation in Science%1, 41 pages, June 1971.
STAN-CS-71-222 (PB235417/AS), W. J. Meyers (Thesis), %2Linear
Representation of Tree Structure (a Mathematical Theory of
Parenthesis-Free Notations)%1, 245 pages, June 1971.
STAN-CS-71-223 (PB203429), Susan Graham (Thesis), %2Precedence
Languages and Bounded Right Context Languages%1, 192 pages, July
1971.
STAN-CS-71-224 (AIM-146, PB212183), A. Ershov, %2Parallel
Programming%1, 15 pages, July 1971.
STAN-CS-71-225 (PB203344), Ake Bjorck and Gene Golub, %2Numerical
Methods for Computing Angles Between Linear Subspaces%1, 30
pages, July 1971.
STAN-CS-71-226 (SLAC-133), J. E. George, %2SIMPLE - A Simple
Precedence Translator Writing System%1, 92 pages, July 1971.
STAN-CS-71-227 (SLAC-134), J. E. George (Thesis), %2GEMS - A
Graphical Experimental Meta System%1, 184 pages, July 1971.
STAN-CS-71-228 (PB203343), Linda Kaufman, %2Function Minimization and
Automatic Therapeutic Control%1, 30 pages, July 1971.
STAN-CS-71-229 (AD732766), E. H. Lee and G. E. Forsythe,
%2Variational Study of Nonlinear Spline Curves%1, 22 pages,
August 1971.
STAN-CS-71-230 (PB203601), R. L. Sites, %2ALGOL With Reference
Manual%1, 141 pages, August 1971.
STAN-CS-71-231 (AIM-149, AD732644), Rod Schmidt (Thesis), %2A Study
of the Real-Time Control of a Computer Driven Vehicle%1, 180
pages, August 1971.
STAN-CS-71-232 (AD733073), C. B. Moler and G. W. Steward, %2An
Algorithm for the Generalized Matrix Eigenvalue Problem%1, 50
pages, August 1971.
STAN-CS-71-233 (not at NTIS), Wayne Wilner, %2Declarative Semantic
Definition%1, 211 pages, August 1971.
STAN-CS-71-234 (not at NTIS), Gene H. Golub, %2Some Modified
Eigenvalue Problems%1, 38 pages, September 1971.
STAN-CS-71-235 (AIM-150, not at NTIS), R. W. Floyd, %2Toward
Iterative Design of Correct Programs%1, 12 pages, September
1971.
STAN-CS-71-236 (AD737648), G. H. Golub and George Styan, %2Numerical
Computation for Univeariate Linear Models%1, 35 pages, September
1971.
STAN-CS-71-237 (CSL-TR-16, AD737270), D. C. Van Voorhis, %2A
Generalization of the Divide-Sort-Merge Strategy for Sorting
Networks%1, 67 pages, September 1971.
STAN-CS-71-238 (CSL-TR-17, AD735901), D. C. Van Voorhis, %2A Lower
Bound for Sorting Networks That Use the Divide-Sort-Merge
Strategy%1, 13 pages, September 1971.
STAN-CS-71-239 (CSL-TR-18, AD736610), D. C. Van Voorhis, %2Large
[g.d.] Sorting Networks%1, 84 pages, September 1971.
STAN-CS-71-240 (AIM-151, AD738568), Ralph London, %2Correctness of
Two Compilers for a LISP Subset%1, 42 pages, October 1971.
STAN-CS-71-241 (AIM-152, AD732642), Alan Bierman, %2On the Inference
of Turing Machines from Sample Computations%1, 31 pages, October
1971.
STAN-CS-71-242 (AIM-153, AD738569), Patrick Hayes, %2The Frame
Problem and Related Problems in AI%1, 24 pages, November 1971.
STAN-CS-71-243 (AIM-154, AD738570), Z. Manna, S. Ness and J.
Vuillemin, %2Inductive Methods for Proving Properties of
Programs%1, 24 pages, November 1971.
STAN-CS-71-244 (AD738027), R. Tarjan (Thesis), %2An Efficient
Planarity Algorithm%1, 154 pages, November 1971.
STAN-CS-71-245 (AIM-155, not at NTIS), John Ryder (Thesis),
%2Heuristic Analysis of Large Trees as Generated in the Game of
Go%1, 350 pages, November 1971.
STAN-CS-71-246 (AIM-156, AD740141), Ken Colby, S. Weber, Frank Hilf
and H. Kraemer, %2A Resemblance Test for the Validation of a
Computer Simulation of Paranoid Processing%1, 30 pages, November
1971.
STAN-CS-71-247 (AIM-157, not at NTIS), Yorick Wilks, %2On Small Head
-- Some Remarks on the Use of 'Model' in Linguistics%1, 16
pages, December 1971.
STAN-CS-71-248 (AD739335), Michael Fredman and Donald Knuth,
%2Recurrence Relations Based on Minimization%1, 35 pages,
December 1971.
STAN-CS-71-249 (not at NTIS), Bary Pollack, %2An Annotated
Bibliography on the Construction of Compilers%1, 140 pages,
December 1971.
STAN-CS-71-250 (AIM-158, AD740127), Ashok Chandra and Zohar Manna,
%2Program Schemas with Equality%1, 13 pages, December 1971.
STAN-CS-72-251 (CSL-TR-19, AD736814), Harold Stone, %2An Efficient
Parallel Algorithm for the Solution of a Tridiagonal Linear
System of Equation%1, 24 pages, January 1972.
STAN-CS-72-252 (SU326 P30 14), M. A. Saunders, %2Large-Scale Linear
Programming Using the Cholesky Factorization%1, 40 pages,
January 1972.
STAN-CS-72-253 (AIM-159, not at NTIS), J. A. Feldman and P. C.
Shields, %2Total Complexity and the Inference of Best
Programs%1, January 1972.
STAN-CS-72-254 (AD740330), G. E. Forsythe, %2Von Neumann's Comparison
Method for Random Sampling from the Normal and Other
Distributions%1, 19 pages, January 1972.
STAN-CS-72-255 (AIM-160, AD740140), J. A. Feldman, %2Automatic
Programming%1, 20 pages, January 1972.
STAN-CS-72-256 (AD740331), V. Chvatal, %2Edmonds Polyhedra and Weakly
Hamiltonian Graphs%1, 22 pages, January 1972.
STAN-CS-72-257 (PB208519), N. Wirth, %2On Pascal, Code Generation,
and the CDC 6000 Computer%1, 39 pages, February 1972.
STAN-CS-72-258 (AD740332), Harold Brown, %2Some Basic Machine
Algorithms for Integral Order Computations%1, 15 pages, February
1972.
STAN-CS-72-259 (PB208595), Clark A. Crane (Thesis), %2Linear Lists
and Priority Queues as Balanced Binary Trees%1, 131 pages,
February 1972.
STAN-CS-72-260 (AD740110), Vaughan R. Pratt (Thesis), %2Shellsort and
Sorting Networks%1, 59 pages, February 1972.
STAN-CS-72-261 (SU326 P30 15), Gene H. Golub and Victor Pereyra,
%2The Diffenentiation of Pseudoinverses and Nonlinear Least
Squares Whose Variables Separate%1, 35 pages, February 1972.
STAN-CS-72-262 (PB209357), Staff, %2Bibliography%1, 36 pages,
February 1972.
STAN-CS-72-263 (AD741189), David A. Klarner and Ronald Rivest, %2A
Procedure for Improving the Upper Bound for the Number of n-
Ominoes%1, 31 pages, February 1972.
STAN-CS-72-264 (AIM-161, AD741189), Yorick Wilks, %2Artificial
Intelligence Approach to Machine Translation%1, 42 pages,
February 1972.
STAN-CS-72-265 (AIM-162, AD744634), Neil Goldman, Roger Shank, Chuck
Rieger and Chris Riesbeck, %2Primitive Concepts Underlying Verbs
of Thought%1, 80 pages, February 1972.
STAN-CS-72-266 (AIM-163, not at NTIS), Jean Cadiou (Thesis),
%2Recursive Definitions of Partial and Functions and Their
Computation%1, 160 pages, March 1972.
STAN-CS-72-267 (PB209629), Pierre E. Bonzon, %2MPL (An Appraisal
Based on Practical Experiment)%1, 26 pages, March 1972.
STAN-CS-72-268 (AD742348), V. Chvatal, %2Degrees and Matchings%1, 16
pages, March 1972.
STAN-CS-72-269 (AD742747), David Klarner and R. Rado, %2Arithmetic
Properties of Certain Recursively Defined Sets%1, 30 pages,
March 1972.
STAN-CS-72-270 (PB209616), G. Golub, J. H. Wilkinson and R.
Underwood, %2The Lanczos Algorithm for the Symmetric Ax = λ Bx
Problem%1, 21 pages, Marcy 1972.
STAN-CS-72-271 (not at NTIS), William E. Riddle (Thesis), %2The
Modeling and Analysis of Supervisory Systems%1, 174 pages, March
1972.
STAN-CS-72-272 (AIM-164, AD742748), Zohar Manna and J. Vuillemin,
%2Fixedpoint Approach to the Theory of Computation%1, 25 pages,
March 1972.
STAN-CS-72-273 (PB209806), V. Chvatal and J. Sichler, %2Chromatic
Automorphisms of Graphs%1, 12 pages, March 1972.
STAN-CS-72-274 (AD742749), D. Klarner and Richard Rado, %2Linear
Combinations of Sets of Consecutive Integers%1, 12 pages, March
1972.
STAN-CS-72-275 (AD742750), David A. Klarner, %2Sets Generated by
Iteration of a Linear Operation%1, 16 pages, March 1972.
STAN-CS-72-276 (AD745022), Linda Kaufman (Thesis), %2A Generalized LR
Method to Solve Ax = Bx%1, 70 pages, April 1972.
STAN-CS-72-277 (SLAC-149, not at NTIS), C. T. Zahn, %2Region
Boundaries on a Triangular Grid%1, 40 pages, April 1972.
STAN-CS-72-278 (SU326 P30-17), Paul Concus and Gene H. Golub, %2Use
of Fast Direct Methods for the Efficient Numerical Solution of
Nonseparable Elliptic Equations%1, April 1972.
STAN-CS-72-279 (AD744313), Michael Osborne, %2Topics in
Optimization%1, 143 pages, April 1972.
STAN-CS-72-280 (AIM-165, AD742751), D. A. Bochvar, %2Two Papers on
Partial Predicate Calculus%1, April 1972.
STAN-CS-72-281 (AIM-166, AD743598), Lynn Quam, Sydney Liebes, Robert
Tucker, Marsha Jo Hanna and Botond Eross, %2Computer Interactive
Picture Processing%1, 41 pages, April 1972.
STAN-CS-72-282 (AIM-167, AD747254), Ashok K. Chandra, %2Efficient
Compilation of Linear Recursive Programs%1, 40 pages, April
1972.
STAN-CS-72-283 (not at NTIS), David R. Stoutemyer (Thesis),
%2Numerical Implemtation of the Schwarz Alternating Procedure
for Elliptic Partial Differential Equations%1, 131 pages, May
1972.
STAN-CS-72-284 (O.R. 72-6, AD745778), V Chvatal, %2Edmonds Polyhedra
and a Hierarchy of Combinatorial Problems%1, 49 pages, May 1972.
STAN-CS-72-285 (PB210910), Robert Floyd and Alan J. Smith, %2A Linear
Time Two Tape Merge%1, 16 pages, May 1972.
STAN-CS-72-286 (PB211036), Ashok K. Chandra, %2On the Solution of
Moser's Problem in 4 Dimensions, and Related Issues%1, 32 pages,
May 1972.
STAN-CS-72-287 (AIM-168, AD746146), Shigaru Igarashi, %2Admissibility
of Fixed-Point Induction in First-Order Logic of Typed
Theories%1, 36 pages, May 1972.
STAN-CS-72-288 (AIM-169, not at NTIS), Robin Milner, %2Logic for
Computable Functions: Description of a Machine
Implementation%1, 36 pages, May 1972.
STAN-CS-72-289 (AIM-170, AD748607), Yorick Wilks, %2Lakoff on
Linquistics and Natural Logic%1, 20 pages, June 1972.
STAN-CS-72-290 (AIM-171, AD746147), Roger Schank, %2Adverbs and
Beliefs%1, 30 pages, June 1972.
STAN-CS-72-291 (AD746189), Donald E. Knuth, %2Some Combinatorial
Lemmas%1, 21 pages, June 1972.
STAN-CS-72-292 (AD746150), V. Chvatal, D. A. Klarner and D. E. Knuth,
%2Selected Combinatorial Research Problems%1, 31 pages, June
1972.
STAN-CS-72-293 (CSL-TN-32, PB212234), J. A. Lukes (Thesis),
%2Combinatorial Solutions to Partitioning Problems%1, 130 pages,
June 1972.
STAN-CS-72-294 (SLACP-1072), Harry J. Saal and Leonard J. Shustek,
%2Microprogrammed Implementation of Computer Measurement
Techniques%1, 20 pages, June 1972.
STAN-CS-72-295 (PB212130), C. C. Paige, %2Bidiagonalization of
Matrices and Solution of Linear Equations%1, 27 pages, June
1972.
STAN-CS-72-296 (AD748606), Michael L. Fredman (Thesis), %2Growth
Properties of a Class of Recursively Defined Functions%1, 84
pages, June 1972.
STAN-CS-72-297 (PB212300), C. C. Paige, %2An Error Analysis of a
Method for Solving Matrix Equations%1, 13 pages, June 1972.
STAN-CS-72-298 (CSL-TR-25), P. M. Kogge and H. S. Stone, %2A Parallel
Algorithm for the Efficient Solution of a General Class of
Recurrence Equations%1, 33 pages, July 1972.
STAN-CS-72-299 (AIM-172, AD752801), Sylvia Weber Russell, %2Semantic
Categories of Nominals for Conceptual Dependency Analysis of
Natural Language%1, 67 pages, July 1972.
%3REPORTS 300 THRU 399%1
STAN-CS-72-300 (CSL-TN-17, AD749848), Marc T. Kaufman,
%2Counterexample of a Conjecture of Fujii, Kasami and
Ninomiya%1, 5 pages, July 1972.
STAN-CS-72-301 (SU326 P30-21), Michael A. Saunders, %2Product Form of
the Cholesky Factorization for Large-Scale Linear Programming%1,
35 pages, July 1972.
STAN-CS-72-302 (SU326 P30-19), G. H. Golub, %2Some Uses of the
Lanczos Algorithm in Numerical Linear Algebra%1, 23 pages,
August 1972.
STAN-CS-72-303 (AIM-174, PB212827), F. Lockwood Morris (Thesis),
%2Correctness of Translations of Programming Languages - an
Algebraic Approach%1, 125 pages, August 1972.
STAN-CS-72-304 (SU326 P30-20), R. S. Anderssen and G. H. Golub,
%2Richardson's Non-Stationary Matrix Iterative Procedure%1, 76
pages, August 1972.
STAN-CS-72-305 (AIM-173, AD755139), Gerald Agin (Thesis),
%2Representation and Description of Curved Objects%1, 125 pages,
August 1972.
STAN-CS-72-306 (SU326 P23-X-2), Bary W. Pollack, %2A Bibliography on
Computer Graphics%1, 145 pages, August 1972.
STAN-CS-72-307 (AIM-175, not at NTIS), Hozumi Tanaka, %2Hadamard
Transform for Speech Wave Analysis%1, August 1972.
STAN-CS-72-308 (AIM-176, AD754109), J. A. Feldman, J. R. Low, R. H.
Taylor and D. C. Swinehart, %2Recent Development in SAIL - an
ALGOL Based Language for Artificial Intelligence%1, 22 pages,
August 1972.
STAN-CS-72-309 (CSL-TR-157, not at NTIS), V. Lesser (Thesis),
%2Dynamic Control Structures and Their Use in Emulation%1, 251
pages, August 1972.
STAN-CS-72-310 (CSL-TR-34, AD750671), Marc T. Kaufman, %2Anomalies in
Scheduling Unit-Time Tasks%1, 22 pages, September 1972.
STAN-CS-72-311 (AIM-177, not at NTIS), Richard Paul (Thesis),
%2Modelling, Trajectory Calculation and Servoing of a Computer
Controlled Arm%1, September 1972.
STAN-CS-72-312 (AIM-178, AD754108), Ahron Gill, %2Visual Feedback and
Related Problems in Computer Controlled Hand-Eye Coordination%1,
134 pages, September 1972.
STAN-CS-72-313 (PB218353/1), Staff, %2Bibliography of Computer
Science Reports%1, 42 pages, September 1972.
STAN-CS-72-314 (CSL-TR-43, PB212893), Peter M. Kogge (Thesis, Part
I), %2Parallel Algorithms for the Efficient Solution of
Recurrence Problems%1, 74 pages, September 1972.
STAN-CS-72-315 (CSL-TR-44, PB212894), Peter M. Kogge (Thesis, Part
II), %2The Numerical Stability of Parallel Algorithms for
Solving Recurrence Problems%1, 49 pages, September 1972.
STAN-CS-72-316 (CSL-TR-45, PB212828), Peter M. Kogge (Thesis, Part
III), %2Minimal Paralellism in the Solution of Recurrence
Problems%1, 45 pages, September 1972.
STAN-CS-72-317 (CSL-TR-26, AD750672), S. H. Fuller and F. Baskett,
%2An Analysis of Drum Storage Units%1, 69 pages, October 1972.
STAN-CS-72-318 (AD755140), H. Brown, L. Masinter and L. Hjelmeland,
%2Constructive Graph Labeling Using Double Cosets%1, 50 pages,
October 1972.
STAN-CS-72-319 (SU326 P30-22), Gene H. Golub and James M. Varah,
%2On a Characterization of the Best 1↓2 Scaling of a Matrix%1,
14 pages, October 1972.
STAN-CS-72-320 (AIM-179), Bruce G. Baumgart, %2Winged Edge Polyhedra
Representation%1, 46 pages, October 1972.
STAN-CS-72-321 (AIM-180, AD759712), Ruzena Bajcsy (Thesis),
%2Computer Identification of Textured Visual Scenes%1, 156
pages, October 1972.
STAN-CS-72-322 (SU326 P30-23), P. E. Gill, G. H. Golub, W. Murray and
M. A. Saunders, %2Methods for Modifying Matrix
Factorizations%1, 62 pages, November 1972.
STAN-CS-72-323, Michael A. Malcolm and John Palmer, %2A Fast Method
for Solving a Class of Tri-Diagonal Linear Systems%1 (also
listed on the abstract as %2On the Lu Decomposition of Toeplitz
Matrices%1), 11 pages, November 1972.
STAN-CS-72-324 (CSL-TR-48, PB214612), Henry R. Bauer, III (Thesis),
%2Subproblems of the m %4x%2 n Sequencing Problem%1, 115 pages,
November 1972.
STAN-CS-72-325 (AIM-181), Bruce G. Buchanan, %2Review of Hubert
Dreyfus' What Computers Can't Do: A Critique of Artificial
Reason%1, 14 pages, November 1972.
STAN-CS-72-326 (AIM-182, AD754107), Kenneth Mark Colby and Franklin
Dennis Hilf, %2Can Expert Judges, Using Transcripts of Teletyped
Psychiatric Interviews, Distinguish Human Paranoid Patients from
a Computer Simulation of Paranoid Processes?%1, 12 pages,
December 1972.
STAN-CS-72-327 (AD755138), David A. Klarner and Ronald L. Rivest,
%2Asymptotic Bounds for the Number of Convex n-Ominoes%1, 15
pages, December 1972.
STAN-CS-72-328 (CSL-TR-31, PB218929), Harold Gabow, %2An Efficient
Implementation of Edmonds' Maximum Matching Algorithm%1, 68
pages, December 1972.
STAN-CS-72-329 (PB218875), Isu Fang (Thesis), %2Folds, A Declarative
Formal Language Definition System%1, 290 pages, December 1972.
STAN-CS-73-330 (AIM-184, AD758651), Malcolm Newey, %2Axioms and
Theorems for Integers, Lists and Finite Sets in LCF%1, 53 pages,
January 1973.
STAN-CS-73-331 (AIM-187, AD757364), George Collins, %2The Computing
Time of the Eulidian Algorithm%1, 17 pages, January 1973.
STAN-CS-73-332 (AIM-186, AD758645), Robin Milner, %2Models of LCF%1,
17 pages, January 1973.
STAN-CS-73-333 (AIM-185, AD757367), Zohar Manna and Ashok Chandra,
%2On the Power of Programming Features%1, 29 pages, January
1973.
STAN-CS-73-334 (AD757366), Michael A. Malcolm and Cleve B. Moler,
%2URAND, A Universal Random Number Generator%1, 10 pages,
January 1973.
STAN-CS-73-335 (SU326 P30-24), G. Golub and E. Seneta, %2Computation
of the Stationary Distribution of an Infinite Markov Matrix%1,
12 pages, January 1973.
STAN-CS-73-336 (AIM-188, AD758646), Ashok K. Chandra (Thesis), %2On
the Properties and Applications of Program Schemas%1, 225 pages,
January 1973.
STAN-CS-73-337 (AIM-189, PB218682), James Gips and George Stiny
%2Aestehetics Systems%1, 22 pages, January 1973.
STAN-CS-73-338 (AD759713), David A Klarner, %2A Finite Basis Theorem
Revisited%1, 10 pages, February 1973.
STAN-CS-73-339 (SU326 P30-25), Gene H. Golub and Warren Dent,
%2Computation of the Limited Information Maximum Likelihood
Estimator%1, 27 pages, February 1973.
STAN-CS-73-340 (AIM-190, AD759714), Malcolm Newey, %2Notes on a
Problem Involving Permutations as Subsequences%1, 20 pages,
March 1973.
STAN-CS-73-341 (AIM-191, AD764272), Shmuel Katz and Zohar Manna, %2A
Heuristic Approach to Program Verification%1, 40 pages, March
1973.
STAN-CS-73-342 (AD759715), Donald Knuth, %2Matroid Partitioning%1, 12
pages, March 1973.
STAN-CS-73-343 (not at NTIS), David R. Levine (Thesis), %2Computer-
Based Analytic Grading for German Grammar Instruction%1, 220
pages, March 1973.
STAN-CS-73-344 (AIM-183, AD759716), Roger C. Schank, %2The Fourteen
Primitive Actions and Their Inferences%1, 71 pages, March 1973.
STAN-CS-73-345 (AIM-192, not at NTIS), George Collins and Ellis
Horowitz, %2The Minimum Root Separation of a Polynomial%1, 25
pages, April 1973.
STAN-CS-73-346 (AIM-193, AD759717), Kenneth Mark Colby, %2The
Rational for Computer Based Treatment of Language Difficulties
in Nonspeaking Autistic Children%1, 8 pages, April 1973.
STAN-CS-73-347 (AIM-194, PB221170/4), Kenneth M. Colby and Franklin
Dennis Hilf, %2Multi Dimensional Analysis in Evaluating a
Simulation of Paranoid Thought Processes%1, 10 pages, April
1973.
STAN-CS-73-348 (SU326 P30-26, PB222513), V. Pereyra, %2High Order
Finite Difference Solution of Differential Equations%1, 86
pages, April 1973.
STAN-CS-73-349 (PB221115), Manuel Blum, Robert Floyd, Vaughn Pratt,
Ronald Rivest and Robert Tarjan, %2Time Bounds for Selection%1,
and Robert Floyd and Ronald Rivest, %2Expected Time Bounds for
Selection%1, 51 pages, April 1973.
STAN-CS-73-350 (CSL-TR-53, AD761177), Marc T. Kaufman, %2An Almost-
Optimal Algorithm for the Assmbly Line Scheduling Problem%1, 21
pages, April 1973.
STAN-CS-73-351 (CSL-TR-27, AD761175), Samuel H. Fuller,
%2Performance of an I/O Channel with Multiple Paging Drums%1, 8
pages, April 1973.
STAN-CS-73-352 (CSL-TR-28, AD761176), Samuel H. Fuller, %2The
Expected Difference Between the SLTF and MTPT Drum Scheduling
Disciplines%1, 6 pages, April 1973.
STAN-CS-73-353 (CSL-TR-29, AD761185), Samuel H. Fuller, %2Random
Arrivals and MTPT Disc Scheduling Disciplines%1, 7 pages, April
1973.
STAN-CS-73-354 (PB221165/4), David A. Klarner, %2The Number of SDR's
in Certain Regular Systems%1, 7 pages, April 1973.
STAN-CS-73-355 (CSL-TR-57, AD764598), Thomas G. Price, %2An Analysis
of Central Processor Scheduling in Multiprogrammed Computer
Systems%1, 8 pages, April 1973.
STAN-CS-73-356 (AIM-195, PB222164), David Canfield Smith and Horace
J. Enea, %2MLISP2%1, 92 pages, May 1973.
STAN-CS-73-357 (AIM-196, AD762471), Neil M. Goldman and Christopher
K. Riesbeck, %2A Conceptually Based Sentence Paraphraser%1, 88
pages, May 1973.
STAN-CS-73-358 (AIM-197, AD762470), Roger C. Schank and Charles J.
Rieger III, %2Inference and the Computer Understanding of
Natural Lanugage%1, 40 pages, May 1973.
STAN-CS-73-359 (CSL-TN-25, PB222064), Harold Stone, %2A Note on a
Combinatorial Problem of Burnett and Coffman%1, 8 pages, May
1973.
STAN-CS-73-360 (CSL-TR-33, AD764014), Richard R. Muntz and Forest
Baskett, %2Open, Closed and Mixed Networks of Queues with
Different Classes of Customers%1, 40 pages, May 1973.
STAN-CS-73-361 (Serra, AD764273), Harold Brown and Larry Masinter,
%2An Algorithm for the Construction of the Graphs of Organic
Molecules%1, 25 pages, May 1973.
STAN-CS-73-362, appears in print as STAN-CS-73-398.
STAN-CS-73-363 (Serra, PB222099), Linda C. Kaufman (Thesis), %2The LZ
Algorithm to Solve the Generalized Eigenvalue Problem%1, 101
pages, May 1973.
STAN-CS-73-364 (AIM-198, AD763611), R. B. Thosar, %2Estimation of
Probability Density Using Signature Tables for Application to
Pattern Recognition%1, 36 pages, May 1973.
STAN-CS-73-365 (AIM-200, AD767331), Shigeru Igarashi, Ralph L. London
and David C. Luckham, %2Automatic Program Verification I:
Logical Basis and its Implementation%1, 50 pages, May 1973.
STAN-CS-73-366 (AIM-201, AD763673), Gunnar Rutger Grape (Thesis),
%2Model Bases (Intermediate-Level) Computer Vision%1, 256 pages,
May 1973.
STAN-CS-73-367 (AD763601), Ole Amble and Donald E. Knuth, %2Ordered
Hash Tables%1, 34 pages, May 1973.
STAN-CS-73-368 (AIM-202, AD764396), Roger C. Schank and Yorick Wilks,
%2The Goals of Linguistic Theory Revisited%1, 44 pages, May
1973.
STAN-CS-73-369 (AIM-203, AD764274), Roger C. Schank, %2The
Development of Conceptual Structures in Children%1, 26 pages,
May 1973.
STAN-CS-73-370 (AIM-205, AD764288), N.S. Sridharan, G. Gelernter,
A.J. Hart, W.F. Fowler and H.J. Shue, %2A Heuristic Program to
Discover Syntheses for Complex Organic Molecules%1, 30 pages,
June 1973.
STAN-CS-73-371 (AD223572/AS), Donald E. Knuth, %2A review of
`Structured Programming' %1, 25 pages, June 1973.
STAN-CS-73-372 (AD767970), Michael A. Malcolm (Thesis, part II),
%2Nonlinear Spline Functions%1, 60 pages, June 1973.
STAN-CS-73-373 (AIM-204, AD765353/BWC), Kurt A. van Lehn (editor),
%2SAIL User Manual%1, 200 pages, June 1973.
STAN-CS-73-374 (AD764275), Michael A. Malcolm (Thesis excerpt), %2A
Machine-Independent ALGOL Procedure for Accurate Floating-Point
Summation%1, 5 pages, June 1973.
STAN-CS-73-375 (SU-326 P30-27), D. Fischer, G. Golub, O. Hald, C.
Levin and O. Widlund, %2On Fourier-Toeplitz Methods for
Separable Elliptic Problems%1, 30 pages, June 1973.
STAN-CS-73-376 (SU326 P30-28), Gunter Meinardus and G. D. Taylor,
%2Lower Estimates for the Error of Best Uniform Approximation%1,
20 pages, June 1973.
STAN-CS-73-377 (AIM-206, AD764652), Yorick Wilks, %2Preference
Semantics%1, 20 pages, June 1973.
STAN-CS-73-378 (AIM-207, AD767333), James Anderson Moorer, %2The
`Optimum-Comb' Method of Pitch Period Analysis in Speech%1, 25
pages, June 1973.
STAN-CS-73-379 (AIM-208, AD767334), James Anderson Moorer, %2The
Hetrodyne Filter as a Tool for Analysis of Transient
Waveforms%1, 30 pages, June 1973.
STAN-CS-73-380 (AIM-209, AD767695/O WC), Yoram Yakimovsky (Thesis),
%2Scene Analysis Using a Semantic Base for Region Growing%1, 120
pages, June 1973.
STAN-CS-73-381 (AD767694), N. S. Sridharan, %2Computer Generation of
Vertex-Graphs%1, 18 pages, July 1973.
STAN-CS-73-382 (AIM-210, AD767335), Zohar Manna and Amir Pnueli,
%2Axiomatic Approach to Total Correctness of Programs%1, 26
pages, July 1973.
STAN-CS-73-383 (AIM-211, AD769673), Yorick Wilks, %2Natural Language
Inference%1, 47 pages, July 1973.
STAN-CS-73-384 (AIM-212, AD769379), Annette Herskovits, %2The
Generation of French from a Semantic Representation%1, 50 pages,
August 1973.
STAN-CS-73-385 (AIM-213, not at NTIS), R. B. Thosar, %2Recognition of
Continuous Speech: Segmentation and Classification Using
Signature Table Adaptation%1, 37 pages, August 1973.
STAN-CS-73-386 (AIM-214, AD767332), W. A. Perkins and T. O. Binford,
%2A Corner Finder for Visual Feed-Back%1, 59 pages, August 1973.
STAN-CS-73-387 (AIM-215, AD769380), Bruce G. Buchanan and N. S.
Sridharan, %2Analysis of Behavior of Chemical Molecules: Rule
Formation on Non-Homogeneous Classes of Objects%1, 15 pages,
August 1973.
STAN-CS-73-388 (CSL-TR-74, PB226044/AS), R. C. Swanson,
%2Interconnections for Parallel Memories to Unscramble P-Ordered
Vectors%1, 52 pages, August 1973.
STAN-CS-73-389 (AIM-216, AD771299), L. Masinter, N. S. Sridharan, J.
Lederberg and D. H. Smith, %2Applications of Artificial
Intelligence for Chemical Inference XII: Exhaustive Generation
of Cyclic and Acyclic Isomers%1, 60 pages, September 1973.
STAN-CS-73-390 (not at NTIS), James Gips, %2A Construction for the
Inverse of a Turing Machine%1, 8 pages, Septermber 1973.
STAN-CS-73-391 (AIM-217, AD770610), N. S. Sridharan, %2Search
Strategies for the Task of Organic Chemical Synthesis%1, 32
pages, September 1973.
STAN-CS-73-392, Donald E. Knuth, %2Sorting and Searching - Errata and
Addenda%1, 31 pages, October 1973.
STAN-CS-73-393 (AIM-218, AD772063/4WC), Jean Etienne Vuillemin
(Thesis), %2Proof Techniques for Recursive Programs%1, 97 pages,
October 1973.
STAN-CS-73-394 (AIM-219, AD769674), C. A. R. Hoare, %2Parallel
Programming: An Axiomatic Approach%1, 33 pages, October 1973.
STAN-CS-73-395, Staff, %2Bibliography of Computer Science Reports%1,
48 pages, October 1973.
STAN-CS-73-396 (AIM-220, AD772064), Robert Bolles and Richard Paul,
%2The Use of Sensory Feedback in a Programmable Assembly
System%1, 24 pages, October 1973.
STAN-CS-73-397 (SU326 P30-28A), Peter Henrici, %2Computational
Complex Analysis%1, 14 pages, October 1973.
STAN-CS-73-398 (AIM-199, AD771300), Bruce G. Baumgart, %2Image
Contouring and Comparing%1, 52 pages, October 1973.
STAN-CS-73-399 (SU326 P30-29), C. C. Paige and M. A. Saunders,
%2Solution of Spase Indefinite Systems of Equations and Least
Squares Problems%1, 47 pages, October 1973.
%3REPORTS 400 THRU 499%1
STAN-CS-73-400 (AIM-223, AD772509), C. A. R. Hoare, %2Recursive Data
Structures%1, 32 pages, November 1973.
STAN-CS-73-401 (PB226691/AS), C. A. R. Hoare, %2Monitors: An
Operating System Structuring Concept%1, 25 pages, November 1973.
STAN-CS-73-402 (PB229616/AS), J. G. Herriot and C. H. Reinsch,
%2ALGOL 60 Precedures for the Calculation of Interpolating
Natural Quintic Spline Functions%1, 40 pages, November 1973.
STAN-CS-73-403 (AIM-224, AD773391), C. A. R. Hoare, %2Hints on
Programming Language Design%1, 29 pages, December 1973.
STAN-CS-74-404 (AD775452), N. S. Sridharan, %2A Catalog of
Quadri/Trivalent Graphs%1, 48 pages, January 1974.
STAN-CS-74-405 (not at NTIS), R. Davis and M. Wright, %2Stanford
Computer Science Department: Research Report%1, 38 pages,
January 1974.
STAN-CS-74-406 (AIM-225, AD775645), W. A. Perkins, %2Memory Model for
a Robot%1, January 1974.
STAN-CS-74-407 (AIM-226, AD778310), F. Wright, %2FAIL Manual%1, 50
pages, February 1974.
STAN-CS-74-408 (AIM-227, AD-A003 483), Arthur Thomas and Thomas
Binford, %2Information Processing Analysis of Visual Perception:
a review%1, 40 pages, February 1974.
STAN-CS-74-409 (AIM-228, AD776233), John McCarthy and Staff, %2Final
Report: Ten Years of Research in Artificial Intelligence. An
Overview%1, February 1974.
STAN-CS-74-410 (CSL-TR-46, PB231926/AS), James L. Peterson (Thesis),
%2Modelling of Parallel Systems%1, 241 pages, February 1974.
STAN-CS-74-411 (AIM-229), D. B. Anderson, T. O. Binford, A. J.
Thomas, R. W. Weyhrauch and Y. A. Wilks, %2After Leibniz...:
Discussions on Philosophy and Artificial Intelligence%1, 50
pages, March 1974.
STAN-CS-74-412 (AIM-230, AD786721), Daniel C. Swinehart (Thesis),
%2COPILOT: A Multiple Process Approach to Interactive
Programming Systems%1, March 1974.
STAN-CS-74-413 (AIM-231, AD-A001 814), James Gips (Thesis), %2Shape
Grammars and Their Uses%1, 243 pages, March 1974.
STAN-CS-74-414 (AIM-232, AD780452), Bruce G. Baumgart, %2GEOMED: A
Geometric Editor%1, April 1974.
STAN-CS-74-415 (PB233065/AS), Ronald L. Rivest (Thesis), %2Analysis
of Associative Retrieval Algorithms%1, 109 pages, April 1974.
STAN-CS-74-416 (PB233507/AS), Donald E. Knuth, %2Structured
Programming with %1Go To%1 Statements%1, 100 pages, April 1974.
STAN-CS-74-417 (PB234102/AS), Richard L. Sites, %2Some Thoughts on
Proving That Programs Terminate Cleanly%1, 68 pages, May 1974.
STAN-CS-74-418 (PB233045/AS), Richard L. Sites (Thesis), %2Proving
That Computer Programs Terminate Cleanly%1, 143 pages, May 1974.
STAN-CS-74-419 (AIM-233, AD-A000 086), Charles Rieger III (Thesis),
%2Conceptual Memory: A Theory and Computer Program for
Processing the Meaning Content of Natural Language Utterances%1,
393 pages, May 1974.
STAN-CS-74-420 (CSL-TR-50, PB232543/AS), John Wakerly, %2Partially
Self-Checking Circuits and Their Use in Performing Logical
Operations%1, 46 pages, May 1974.
STAN-CS-74-421 (CSL-TR-51, PB232356/AS), John Wakerly (Thesis),
%2Low-Cost Error Detection Techniques for Small Computers%1, 232
pages, May 1974.
STAN-CS-74-422 (CSL-TR-79, NASA-TM-62,370), Harold Stone, %2Parallel
Tri-Diagonal Equation Solvers%1, 42 pages, May 1974.
STAN-CS-74-423 (CSL-TN-41, PB232860/AS), Gururaj S. Rao,
%2Asymptotic Representation of the Average Number of Active
Modules in an N-Way Interleaved Memory%1, 16 pages, May 1974.
STAN-CS-74-424 (CSL-TR-80, PB232602/AS), Maurice Schlumberger
(Thesis, chapter 1), %2Logorithmic Communications Networks%1, 38
pages, May 1974.
STAN-CS-74-425 (CSL-TR-81, PB232598/AS), Maurice Schlumberger
(Thesis, chapter 2), %2Vulnerability of deBruijn Communications
Networks%1, 68 pages, May 1974.
STAN-CS-74-426 (CSL-TR-82, PB232597), Maurice Schlumberger, (Thesis,
chapter 3), %2Queueing Equal Length Messages in a Logorithmic
Network%1, 75 pages, May 1974.
STAN-CS-74-427 (CSL-TN-36, PB232624/AS), Tomas Lang (Thesis excerpt),
%2Performing the Perfect Schuffle in an Array Computer%1, 18
pages, May 1974.
STAN-CS-74-428 (CSL-TR-76, PB232633/AS), Tomas Lang (Thesis excerpt),
%2Interconnections Between Precessors and Memory Modules Using
the Schuffle-Exchange Network%1, 32 pages, May 1974.
STAN-CS-74-429 (CSL-TR-70, PB232623/AS), Samuel E. Orcutt (Thesis
excerpt), %2Efficient Data Routing Schemes for ILLIAC IV-Type
Computers%1, 31 pages, May 1974.
STAN-CS-74-430 (CSL-TR-71, PB234513/AS), Samuel E. Orcutt (Thesis
excerpt), %2A Novel Parallel Computer Architecture and Some
Applications%1, 44 pages, May 1974.
STAN-CS-74-431 (AIM-234, not at NTIS), Kenneth Mark Colby and Roger
C. Parkison, %2Pattern Matching Rules for the Recognition of
Natural Language Dialogue Expressions%1, 23 pages, May 1974.
STAN-CS-74-432 (AIM-235, AD-A006 898), Richard Weyhrauch and Arthur
Thomas, %2FOL: A Proof Checker for First-Order Logic%1, 60
pages, May 1974.
STAN-CS-74-433 (AIM-236, AD784513), Jack R. Buchanan and David C.
Luckham, %2On Automating the Construction of Programs%1, 65
pages, May 1974.
STAN-CS-74-434 (SU326 P30-31), Axel Ruhe and Per Ake Wedin,
%2Algorithms for Separable Nonlinear Least Squares Problems%1,
50 pages, June 1974.
STAN-CS-74-435 (CSL-TR-88, A001-071), Thomas G. Price, %2Balanced
Computer Systems%1, 56 pages, June 1974.
STAN-CS-74-436 (AIM-237, AD-A012 477), Yorick Wilks, %2Natural
Language Understanding Systems Within the A.I. Paradigm -- A
Survey and Some Comparisons%1, 25 pages, July 1974.
STAN-CS-74-437 (AIM-238, AD-A005 040), C. K. Riesbeck (Thesis),
%2Computational Understanding: Analysis of Sentences and
Context%1, 245 pages, July 1974.
STAN-CS-74-438 (AIM-239, AD786720), Marsha Jo Hanna (Thesis),
%2Computer Matching of Areas in Stereo Images%1, 99 pages, July
1974.
STAN-CS-74-439 (OR-74-7, SU326 P30-32), Richard W. Cottle, Gene H.
Golub and R. S. Sacher, %2On the Solution of Large, Structured
Linear Complementarity Problems: III%1, 87 pages, July 1974.
STAN-CS-74-440 (PB237360/AS), James H. Morris, Jr., Vaughn R. Pratt
and Donald E. Knuth, %2Fast Pattern Matching in Strings%1, 32
pages, July 1974.
STAN-CS-74-441 (AD-A000 284), Donald E. Knuth and Ronald W. Moore,
%2An Analysis of Alpha-Beta Pruning%1, 64 pages, July 1974.
STAN-CS-74-442 (AD-A004 208), Donald E. Knuth, %2Estimating the
Efficiency of Backtrack Programs%1, 30 pages, July 1974.
STAN-CS-74-443 (PB-236 471/AS), Douglas K. Brotz (Thesis),
%2Embedding Heuristic Problem Solving Methods in a Mechanical
Theorem Prover%1, 107 pages, July 1974.
STAN-CS-74-444 (AIM-240, AD787035), C. C. Green, R. J. Waldinger, D.
R. Barstow, R. Elschlager, D. B. Lenat, B. P. McCune, D. E.
Shaw and L. I. Steinberg, %2Progress Report on Program-
Understanding Systems%1, 50 pages, July 1974.
STAN-CS-74-445 (SLACP-1448), J. H. Friedman, F. Baskett and L. J.
Shustek, %2A Relatively Efficient Algorithm for Finding Nearest
Neighbors%1, 21 pages, September 1974.
STAN-CS-74-446 (AIM-241, AD786723), L. Aiello and R. W. Weyhrauch,
%2LCFsmall: An Implementation of LCF%1, 45 pages, September
1974.
STAN-CS-74-447 (AIM-221, AD787631), L. Aiello, M. Aiello and R. W.
Weyhrauch, %2Semantics of Pascal in LCF%1, 78 pages, September
1974.
STAN-CS-74-448 (SU326 P30-33), D. Goldfarb, %2Matrix Factorizations
in Optimization of Nonlinear Functions Subject to Linear
Constraints%1, 45 pages, September 1974.
STAN-CS-74-449 (CSL-TR-89, AD785027), A. Smith (Thesis),
%2Performance Analysis of Computer Systems Components%1, 323
pages, September 1974.
STAN-CS-74-450 (CSL-TR-90, AD787008), F. Baskett and A. J. Smith
(Thesis, chapter 3), %2Interference in Multiprocessor Computer
Systems with Interleaved Memory%1, 45 pages, September 1974.
STAN-CS-74-451 (CSL-TR-91, AD786999), A. Smith (Thesis, chapter 5),
%2A Modified Working Set Paging Algorithm%1, 40 pages, October
1974.
STAN-CS-74-452 (AIM-242, AD-A000 500), J. R. Low (Thesis),
%2Automatic Coding: Choice of Data Structures%1, 110 pages,
September 1974.
STAN-CS-74-453 (AD-A000 034), Donald E. Knuth, %2Random Matroids%1,
30 pages, September 1974.
STAN-CS-74-454 (SU326 P30-35), L. S. Jennings, %2A Computational
Approach to Simultaneous Estimation%1, 15 pages, September 1974.
STAN-CS-74-455 (AD-A000 083), Robert E. Tarjan, %2Edge-Disjoint
Spanning Trees, Dominators, and Depth-First Search%1, 40 pages,
September 1974.
STAN-CS-74-456 (AIM-243, AD-A003 815), R. Finkel, R. Taylor, R.
Bolles, R. Paul and J. Feldman, %2AL, A Programming System for
Automation: Preliminary Report%1, 117 pages, October 1974.
STAN-CS-74-457 (AIM-244, not at NTIS), K. M. Colby, %2Ten Criticisms
of Parry%1, 7 pages, October 1974.
STAN-CS-74-458 (AIM-245, AD784816), J. Buchanan (Thesis), %2A Study
in Automatic Programming%1, 146 pages, October 1974.
STAN-CS-74-459 (AIM-246, AD-A000 085), Terry Winograd, %2Five
Lectures on Artificial Intelligence%1, 95 pages, October 1974.
STAN-CS-74-460 (PB238148/AS), T. PoRter and I. SimoN, %2Random
Insertion into a Priority Quaue Structqre%1( 25 pages, October
1974.
STAN-CS-74-461 (AIM-247( AD-A005 041)( N. M. Goldman (Thesis),
%2Computer Generation of Natural Language from a Deep Conceptual
Base%1, 316 pages, October 1974,
STAN-CS-74-462 (AIM-248), K. Pingle and A. J. Thomas$ %2A Fast,
Feature-Driven Stereo Depth Program%1, 15 pages, October 1974.
STAN-CS-74-463 (AIM-249, AD-A002 261), BrucE Baumgart (Thesis),
%2Geometric Modeling for Computer ViSion%1, 141 pages, November
1974.
α
STAN-CS-74-464 (AIM-250, AD-A003 488), Ramakant Nevatia (Thesis),
%2Structured Descriptions of Complex Curved Objects for
Recognition and Visual Memory%1, 125 pages, November 1974.
STAN-CS-74-465 (AIM-251, AD-A001 373), E. H. Shortliffe (Thesis),
%2MYCIN: A Rule-Based Computer Program for Advising Physicians
Regarding Antimicrobial Therapy Selection%1, 409 pages, November
1974.
STAN-CS-74-466 (AIM-252, AD-A002 246), Lester Earnest (editor),
%2Recent Research in Artificial Intelligence, Heuristic
Programming, and Network Protocols%1, 79 pages, November 1974.
STAN-CS-74-467 (AIM-222, AD-A007 562), M. Aiello and R. Weyhrauch,
%2Checking Proofs in the Meta-Mathematics od First Order
Loeic%1, 55 pages, No@YK[EKH@brnP\~∀~)')β≤5π&ZnPZhlpQβλ[∧``f@`fdRX↓&\A↔I←OIC!XX@JIαAπ←5ES]CQ←eSC0A¬Cg∀AM←d4∀@@@A'←[∀@A∨aQS[CXA≠CiI←SH@↓∪]iKIgKGi%←\@A¬YO←e%iQ[f∀bP⊃↓α↓IU↓πβπ∨↔~`4)↓α↓↓α;⎇3↔7 /⊃↓Ee;!04(hRNRεrj∞M5;!5QYJaα!9∧∪K?←ra↓∃Jn{3↔∂.cπIα≥#KW∂'+K∃α.cW∂'& S'?rα&&%+ 1↓M@h)↓↓α↓βCπ>+M1α&+∂↔7⊗+I↓EK9Q84Ph*NR q6∞Mk9Q5Q;↓1↓αbqαSK∞∪ ↓απ∪π∪=b↓∃JO& 3∃ααO?K&K;≥β∞s⊃↓αn+K∨'v9β←'&@4)↓α↓↓α?π#'7πbαS'7and Space Bounds%1, 75 pages, December 1974.
STAN-CS-74-471 (AIM-253, AD-A003 487), B. Faught, K. M. Colby and R.
C. Parkison, %2The Interaction of Inferences, Affects, and
Intentions in a Model of Paranoia%1, 38 pages, December 1974.
STAN-CS-74-472 (AIM-254, AD-A005 407), L. H. Quam and M. J. Hannah,
%2Stanford Automatic Photogrammetry Research%1, 15 pages,
December 1974.
STAN-CS-74-473 (AIM-255, AD-A005 412), N. Suzuki, %2Automatic Program
Verification II: Verifying Programs by Algebraic and Logical
Reduction%1, 28 pages, December 1974.
STAN-CS-74-474 (AIM-256, AD-A007 563), F. W. von Henke and D. C.
Luckham, %2A Methodology for Verifying Programs%1, 45 pages,
December 1974.
STAN-CS-75-475 (AIM-257, AD-A005 413), M. C. Newey (Thesis), %2Formal
Semantics of LISP with Applications to Program Correctness%1,
184 pages, January 1975.
STAN-CS-75-476 (AIM-258, AD-A006 294), Cordell Green and David
Barstow, %2A Hypothetical Dialogue Exhibiting a Knowledge Base
for a Program-Understanding System%1, 45 pages, January 1975.
STAN-CS-75-477 (not at NTIS), V. Chvatal and D. Sankoff, %2Longest
Common Subsequences of Two Random Sequences%1, 18 pages, January
1975.
STAN-CS-75-478 (SU326 P30-36), G. H. Golub and J. H. Wilkinson,
%2Ill-Conditioned Eigensystems and the Computation of the Jordan
Canonical Form%1, 66 pages, February 1975.
STAN-CS-75-479 (SU326 P30-38), F. Chatelin and J. Lemordant, %2Error
Bounds in the Approximation of Eigenvalues of Differential and
Integral Operators%1, 24 pages, February 1975.
STAN-CS-75-480 (A008804), Donald E. Knuth, %2Notes on Generalized
Dedekind Sums%1, 45 pages, February 1975.
STAN-CS-75-481 (SU326 P30-39), J. Oliger, %2Difference Methods for
the Initial-Boundary Value Problem for Hyperbolic Equations%1,
31 pages, February 1975.
STAN-CS-75-482 (SLACP-1549, not at NTIS), J. A. Friedman, J. L.
Bentley and R. A. Finkel, %2An Algorithm for Finding Best
Matches in Logarithmic Time%1, 31 pages, March 1975.
STAN-CS-75-483 (AD-A011 835), P. Erdos and R. L. Graham, %2On Packing
Squares with Equal Squares%1, 8 pages, March 1975.
STAN-CS-75-484 (AD-A011 832), R. L. Graham and E. Szemeredi, %2On
Subgraph Number Independence in Trees%1, 18 pages, March 1975.
STAN-CS-75-485 (AD-A011 834), P. Erdos and E. Szemeredi, %2On
Multiplicative Representations of Integers%1, 18 pages, March
1975.
STAN-CS-75-486 (SU326 P30-37), A. Bjorck and G. H. Golub,
%2Eigenproblems for Matrices Associated with Periodic Boundary¬
Conditions%1( 19 pages, March 1975.
STAN-CS-75-487 (SLACP-1573), J. H. Friedman, %2A Variable Metric
Decision Rule for Non-Paraeetric Classification%1( 34 pages,
April 1975.
STAN-CS-75-488 (AD-A011 445), B. Bollobas, P. Erdos and E. SzemeRedi,
%2On Complete Subgraphs of r-Chromatic Graphs%1, 12 pages, April
1975.
α
STAN-CS-75-489 (AD-A011 833), E. Szemeredi, %2Regular Partitions of
Graphs%1( 8 pages, April 1975.
STAN-CS-75-490 (AD-A014 429), R. William Gosper, %2Numeracal
α Experiments withthe Spectral Test%1 31 paces, May 1975.
~∃M)β≤[
&Znj4hrbX↓∞\Aλ8@@A↔9←ih@!)QKg%bRX@∀e KY∃iS←\↓S\@A S]CedA'i←ICGJ~(@@@@↓)eKKLJbX@dfAaC≥KfHA5Cr@BβIUU8hP4*N$
96∞~i]U5#II1α∩q↓αO,∧F>/⎇≤6@4λ∧"4→ytyTK⊂∩Q(]tquy[y:∩XK⊂→ZYλ80sr\T⊂&p↑FA⊂⊂λ⊂⊂⊂LMZWεEβE)b S⊗aaVMZVZ≤LP∀ ⊂B2444∩1(∂β&$XA$\αα/WK↑I6OW}s'=1α↓∃J∪/≠∂K'⊗K;≥α∂+S?7∂#∧4 α↓↓↓βNq↓αS/∪7M↓αβ?→↓∧cπ;∨. ∨↔Mα↓απO≡{∂'π&+⊃↓β>KS!↓ααS#↔M⊃↓αC,ε&Oε X L≥β"H∧∧λλ⊃ ↑Z8y.4,+λε6h≤_,|<kλ \>( '⊗m+C!!"Tuλ→K0teVm+-π⊗ λ⊃%D∩ H∧
x=≥ ↑]~≥l≥=→+∧ \K@¬
~→<m≡j+λ∧VT{⎇.,y(∪ ≥Y⎇8,\!"H∧∧λλ⊃ \]9ym≥Yh∃
⎇{≤i&∃λ mεT≤_9l↑iλ∪,∨( ≤MZWεEβE)j S⊗aiVMZVZ≤MP∀ b `X_Jλ~→~∀K⊂)W⊂∩y3sr_t6⊗⊂ Y*42H 2x"[22w1YP#y0\4⊂3'\∧E⊂⊂λ⊂⊂!0\ryP$[⊂&pz≤5tr9IXV⊂→∞P80sYyR⊂&X|P⊂LMZWεEβE)j S⊗aiVMZVZ≤M⊂∀)jLY≠⊂( X⊗ZλJV⊂)↔λ*w22\9wwrλ∀*42\tyTVλ⊂∩Q [⊂$z2\0z4{→FE⊂⊂λ⊂⊂!6≠quP&_w1⎇7\P"rj~7r⊂#≠y⊂:4→P)wv≥z4wwλ5s⊂&_y3rPλ)x0y≤rP)|[vrz9~qFE⊂λ⊂⊂⊂"Zsrw8≤7q62[yRXVλ_YYP≤0sryK⊂&p|H_\[ZKεEεE∀j g⊗PiV[ZKZ≤[Pλ∀ b⊗PX_[⊂λ≤→~TK⊂⊂⊂) ⊂⊂⊂& ⊂⊂#y_t0vPλ0w2⊂λ⊂&↔λ⊂&7{_yy⊗εB⊂⊂⊂⊂λ∩Y"4\z0w1YP&pz≤4qryH7s⊂*≤2ryRLV⊂~≤λ80sr\V⊂ zYzyz⊂ \[ZWβEαE)U g⊗aTV[ZVM≤\⊂⊂λ∀ dfKY~\Vλ⊂⊂ b `X_KH⊂⊂_→
TV⊂⊂λ$↔⊂⊂λ⊂)pvYz⊂⊂∀∃42yt\TVεEλ⊂⊂⊂⊂ Y zz≠vpz4Xpv6<H⊂⊂(9≠{4w3H⊂⊂:4→P⊂⊂![y92q]72yyH⊂⊂7sλ⊂*90[9v0z~ww9FB⊂⊂⊂⊂λ$w;7[;4w3H'x:4[t⎇2rλ!wr2IXV⊂→ Z⊂80YryV⊂⊂zszy]⊂_\[MWεEεB)j g aiV[MVZ≤\H⊂∀ dSVY≠_
V⊂"↔λ⊂⊂!Wλ⊂)vt]4⊂⊂∀∃42yt\TV⊂⊂ Y(,cS`f$gS≥⊂⊂ CE⊂⊂⊂λ⊂!y2Xz4{2H(97s\0vvt[3P"w≥4y7w≠rw:∩LV⊂_\LP80sYyV⊂ ]szyzλ_\[ZKεEβεEεEβE⊂⊂⊂λ⊂⊂⊂⊂λ⊂⊂⊂⊂λ⊂⊂⊂⊂λ⊂⊂⊂∩Li"h'T*)P~L_⊂*$∀*P~\NRXFEβE)j S⊗aiVMZVZX ⊂⊂∀(⊂→~≠≠L≤↔`iJV⊂⊂) ⊂⊂⊂%]y5tVTzww4[V⊂⊂∩L*7{p\29P⊂⊂2z:2\εE⊂⊂λ⊂⊂"2Y4w4z~ww9P≠s⊂(9≠sy0v[tw3P∪0w3zXsryRLV⊂→≤H80sr\V⊂ zYzyz⊂ \[ZWβEαE)U g⊗aTV[ZVMX_P⊂
dfVL≠_V⊂⊂b⊗`X [⊂⊂≤ X∀V⊂∪W⊂⊂⊂∀2z:2\9rw⊗λ∩Y(9≠qrr:\0vεEλ⊂⊂⊂⊂⊃{2w:≤P0yP∀ws:;Xy2P$[:2y9≥x:9RLV⊂≤⊂≤0sryK⊂ zs]yz⊂_N[ZWεBεE)j⊂g⊗aiK[ZVZL→⊂⊂⊂λ∀ dfKY≠→⊗λ⊂⊂⊂⊂⊂b⊗`X [⊂⊂⊂λ≤_≤∧K⊂⊂⊂⊂λ'W⊂⊂λ⊂(2j≥2y9b[⊗εE⊂λ⊂⊂⊂∩L)|w1Z97w4↑0z4w[⊂⊂7sλ!ww1]y92w≥⊂⊂(9≠qryyYyRXVλ_Z⊂⊂≤0sryK⊂ zs]yzεEλ⊂⊂⊂⊂ \[ZWβEαE)U g⊗aTV[ZVMX→P∀⊂dfVY
→R⊂⊂⊂b⊗`X [⊂≤_
TV⊂⊂∪W⊂⊂(→ %2The Macro-
Processing System STAGE2%1, 20 pages, August 1975.
STAN-CS-75-504 (AD-A017 370), P. Erdos, R. L. Graham and E.
Szemeredi, %2On Sparse Graphs with Dense Long Paths%1, 14 pages,
August 1975.
STAN-CS-75-505 (AD-A017 053), V. Chvatal, %2Some Linear Programming
Aspects of Combinatorics%1, 30 pages, August 1975.
STAN-CS-75-506 (AIM-264, AD-A017 176), M. Gordon, %2Operational
Reasoning and Denotational Semantics%1, 30 pages, August 1975.
STAN-CS-75-507 (AIM-265), M. Gordon, %2Towards a Semantic Theory of
Dynamic Binding%1, 25 pages, August 1975.
STAN-CS-75-508, James Eve, %2On Computing the Transitive Closure of a
Relation%1, 14 pages, August 1975.
STAN-CS-75-509 (AD-A017 331), M. Overton and A. Proskurowski,
%2Finding the Maximal Incidence Matrix of a Large Graph%1, 72
pages, August 1975.
STAN-CS-75-510 (AD-A017 054), A. C. Yao and D. E. Knuth, %2Analysis
of the Subtractive Algorithm for Greatest Common Divisors%1, 10
pages, August 1975.
STAN-CS-75-511 (AD-A017 294), P. Dubost and J. M. Trousse,
%2Software Implementation of a New Method of Combinatorial
Hashing%1, 35 pages, August 1975.
STAN-CS-75-512 (PB247895/AS), Robert E. Tarjan, %2Applications of
Path Compression on Balanced Trees%1, 53 pages, October 1975.
¬
STAN-CS-75-513 (SLACR-186), J. L Bentley, %2A Survey of Techniquas
α
foR Fixed Radius Near Neighbor Searching¬1( 30 pages, October
1975.
STAN-CS-75-514 (PB247561/AS), N. Tokura, %2A Microprograe Control α Unit Based on a Tree Memory%1, 39 pages$ October 1975.
STAN-CS-75-515, R.P. Brent, %2Fast Multiple-PrecisiOn Evaluation o@_~∀@@@A Y∃[K]i¬erA
U]GiS=]fJb0@ddAACOKf0A∨Gi=EKd@Drnj\4∀~∃'Qβ≤[πLZnjZTbl@QM*fdlA f`4hdRX↓∀\A'Q←KdX@Je∨8AiQJA%KY¬iS←\↓¬Kio∃K\~∀@@@AEkCIe¬iSFAQKeKS9CiS←8AC]H↓π←]m∃aOK]
JA!e=aKei%KfA←_A≠S]%[SuCQS←\~(@@@@↓βYO←ISiQ[LJbX@D`fAa¬OKfX↓∨Gi← Kd@bdnj\~(~∃')¬≤[π&4njZjDnX@AX\@@A
QmCi¬X@AC9H@Aε8@@A)!←[CgMK\X@@Je %giC]
Kf@A%\~∀@@@A∨ISK]i¬iS←]LA←LA≥eCaQLJbX@HhAaC≥KfXA=Gi←E∃d@br\j\~∀4∃')β8[π&Z\jZjb`@@Qβ⊂[α`b`@@hlDRX@AX\@@A
QmCi¬X@AC9H@A 8@@A_8@@A⊃¬[[Kd0~∀@@@@Je¬OOeK≥CiS←8@A←LA∪]KEkCYSQSKf@↓S\@A%]iKO∃d@A!I←OeC5[S]N∀bX@@Hn~∀@@@Aa¬OKfX↓∨Gi← Kd@bdnj\~(~∃')¬≤[π&4njZjDr@Qβ%~ZdlXXAβλ5α`brlhbR0@A$\↓ CmSLXA∧\↓¬kGQ¬]C\@↓C]HA∀\~∀@@@A'!←eiY%MMJX@Je!I←IkGQS←\@↓%kYKL@ACfAB@AIKaeKMK]iCQS←\@AM←dAB~∀@@@A-]←oY∃IOJZA¬Cg∃H@Aπ=]gkYQCiS←8@A!e=OeCZ∀bX@@Ln@Aa¬OKfX↓≥←mK5EKd~(@@@@brnj8~∀~∃M)β≤[
&Znj4jd`@!β∪~ZHlnX@↓βλ[α@br@lXhRX@↓ \@A\\@Am=\A⊃K9WJX@Je∨\↓iQJ~(@@@@↓%Kae∃gK]i¬iS←\↓←L@A⊃CiBAMiekGQkeKf↓S\@A1π Ao%iP@A¬aaYS
CiS←9fAi↑4∀@@@A!e←≥eCZA≥K]Ke¬iS←\∀bX@hDAaCO∃fXA≥=mK[E∃d@br\j\~∀4∃')β8[π&Z\jZjdD@Qβ∪4Zdlp$XAε\A)Q←5ag←\0@Je ∃aiPAAKeGKAiS←\AS\AMiKeK<~∀@@@Aπ←5akiKHA-Sg%←\Jb0@blAACOKf0A≥←m∃[EKd8~∀~∃M)β≤[
&Znj4jdd@!β∪~ZHlrXA¬λ[α`Dr@jldRX@A⊂\Aε\↓→kGW!CZAC9H@A≤8A'kuUWRX~(@@@@JeβkQ←[Ci%F@A!I←OeC4@A-KISMSG¬iS←\A∪,t@A!e=←L@A=L@A)∃e[S]¬iS←\4∀@@@A/Si!S\AB↓/KCV↓→←OS A←LAAe←Oe¬[fJb0@frAACOKf0A≥←m∃[EKdbrnj8~∀~∃M)β≤[
&Znj4jdf@!β∪~ZHn`X@↓βλ[α@br@hXnRX@↓∀\@A_\@A%∃SgKd0@Je¬¬∪_@@4ZAα~(@@@@↓ KEk≥OKdA→←dA'¬∪_Jb0@dlAACOKf0A≥←m∃[EKdbrnj8~∀~∃M)β≤[
&Znj4jdh@!β∪~ZHnbXA¬λ[α`Dr@n`HRX@AH\@A ¬mSfA¬]HA∀8@@A↔%]NX@∀eβ\~(@@@@↓∨mKeYSKnA=LA!e=IkGi%←\A'egiK[LJbX@P`AaC≥KfXA9←mK[ Kd@bdnj\~(~∃')¬≤[π&4njZjHj@Qβ%~ZdnHRXA&8A∂C]¬aCiQd@Q)Q∃gSfR0@@JeIKG←]MiekGQS←\A=L~∀@@@A'∃G]KfAπ←]QCS]S9NA!←1sQKIIB@AMI←ZA'QKeK↑A!CSHA←L@↓-SKoLJbX@H`h~∀@@@AACOKf0A≥←m∃[EKdbrnj8~∀~∃M)β≤[
&Znj4jdl@!βλ[α@d`@pPpRX@↓%←EKIhA
\A)Ce)C\X@∀e∂eCAP@A)!K←er↓C]H~(@@@@↓∂CkgMSC\A∃YS[S9CiS←8JbX@HfAaC≥KfXA9←mK[ Kd@bdnj\~(_~∀~(~∃')¬≤[π&4njZjHn@QπM_[)$4b``X↓]←h@↓ChA≥Q∪&RX↓
\A≠
πYkg-KrX@↓∀\A/¬WKeY∃r~∀@@@AC9H@A$8@A∨OUfX@@∀eπK]QKd@A→←dA%∃YSCE1J@Aπ=[aki%]NJb0@@b`@AaCO∃fX~∀@@@A9←mK[ Kd@bdnj\~(~∃')¬≤[π&4njZjHp@@Q¬λ[α`H`@@jdnRX@↓%←EKIh@A
8@@A)¬eUC\0@@JeM←YmS9NA!CQP~∀@@@A!I←EYK5fA←\↓ SeK
iKHA≥eCaQLJbX@PjAaC≥KfXA9←mK[ Kd@bdnj\~(~∃')¬≤[π&4njZjHr@@QM→βπ 4bllj$X@A∀8@A_\↓¬K]i1Kr@A¬]H@A(\@A⊂8@A
e%KI[C8X~∀@@@@JI
CghAβYO=eSiQ5fAM←H@Aπ←9giek
iS]N↓≠S]S5CX@AMaC]]%]N@AQeKKf↓S\~∀@@@A
←←eI%]CiJ↓'aCG∃fJbXdrAa¬OKfX↓≥←mK5EKd@Drnj\4∀~∃'Qβ≤[πLZnjZTf`@@!'*fdXA f`4h`RXA~\@A→K]QS]RA¬]H@AX\@@AAKeKsIBX@JIβ\~∀@@@A¬ICai%mJ@A→S]Si∀@A S→MKeK9GJ@AM←YmKH@AM←H@A≥←9YS]K¬d@A)]↑@A!=S]h~(@@@@↓¬←k]⊃Cer@↓!e←E1K[f@↓oSiPA≠SY⊂@A¬←U]ICed@A→CeKefJDX@@@Pd@Aa¬OKfX4∀@@@A≥←m∃[EKdbrnj8~∀~∃M)β≤[
&Znj4jfb@Qβλ[∧`d`@phnR0@Aλ\A∀\@A%←g∀@AC]⊂@A$\@A
\A)Ce)C\X~(@@@@JeβY≥←eSi![SF@Aβga∃Gif@↓←L@@↓-Kei∃p@A 1S[S]¬iS←\@A←\A Se∃GiKH4∀@@@A∂eCAQfJb0@hjAACGKf0A≥←m∃[EKdbrnj8~∀
∃M)β≤[
&Znj4jfdXA!Ch↓
T@A)CG←EL@Qgi¬MLRX@Je¬%EYS←≥eCaQd@A←L↓π←[aUiKd~(@@@@↓'GSK9GJA%∃a←eiLJbX@\nAaC≥KfXA9←mK[ Kd@bdnj\~(~∃')¬≤[π&4nlZjLf@Q→ _Zhl@hXA'TfdlA@f`ZhPRXA 8Aπ←]
kfXA≤\A⊂\@A∂←1kDAC9H~∀@@@Aλ8@A \A≡O→∃CerX@Jeα↓∂K]KICYSu∃HAπ←9UkOCQJA∂e¬ISK]P@A≠KQQ←HA→←d~∀@@@AQQJ@@↓≥k[KISGCXA'←YUiS←\@A←LA YY%aiSF@A!CIiSCXA SM→KeK]QSCX~(@@@@↓ ckCQS←]f∀bP@dPAaCO∃fXA∃¬]kCed@brnX\~∀~)')β≤5π&ZnXZjfhQβ∪~4dnfR0A→S]⊃BA∞\↓⊃K[a!SYX@!)QKg%fRX@JeαA
←]GKAikCX4∀@@@AβaaI←CGP@Ai↑Aβki=[CiS @@A→¬]OkC≥J@A+9IKegQC]IS9N@@A¬]H@A KYSK_~∀@@@A'iIkGikIKft@A/Si @A SMC[ES≥kCiS=\@A←_AiQJA/←e⊂@AA
=dN@@∀bX@dTh~∀@@@Aa¬OKfX↓∃C]k¬er@bdnl\~(~∃')¬≤[π&4nlZjLjXA 8Aπ←]
kfAC9HA∞\↓⊂\A∂=YkDXJeα@↓∂K]KICYSu∃HAπ←9UkOCQJ~∀@@@A∂ICISK9h@@A5KiQ←⊂@@AM=d@@A9←\['∃Y[[KQeSF@A'sgQK[f@A←L@A→S]∃Cd~∀@@@A∃ckCi%←]fJDX@bd↓aCOKLXA∃C9kCerbrnl8~∀4U~Rε9l~M5]2iUMYαBε&5k⊃UQ1∧
⊃6¬β⊃A↓e#⊃5f↑~I1α∪∂3'⊃α?∪?OOn 9βπv!αKW∨≠↔30hQ↓↓↓ααSπgr, %2Interactive Generation of Object Models with a
Manipulator%1, 32 pages, January 1976.
STAN-CS-76-537 (AIM-275, AD-A020 943/7WC), Robert C. Bolles,
%2Verification Vision Within a Programmable Assembly System: An
Introductory Discussion%1, 82 pages, January 1976.
STAN-CS-76-538 (AD-A024 416), Donald E. Knuth and L. Trabb Pardo,
%2Analysis of a Simple Factorization Algorithm%1, 43 pages,
January 1976.
STAN-CS-76-539 (AIM-276, AD-A021 055/9WC), Zohar Manna and Adi
Shamir, %2A New Approach to Recursive Programs%1, 26 pages,
January 1976.
STAN-CS-76-540 (AD-A021 587), R. L. Graham, A. C. Yao and F. F. Yao,
%2Addition Chains with Multiplicative Cost%1, 7 pages, January
1976.
STAN-CS-76-541, Donald E. Knuth, %2Mathematics and Computer Science:
Coping with Finiteness%1, 30 pages, March 1976.
STAN-CS-76-542 (AIM-277, AD-A027 454), Zohar Manna and Adi Shamir,
%2The Theoretical Aspects of the Optimal Fixedpoint%1, 24 pages,
March 1976.
STAN-CS-76-543, D. A. Zave, %2Optimal Polyphase Sorting%1, 75 pages,
March 1976.
STAN-CS-76-544, B. Mont-Reynaud, %2Removing Trivial Assignments from
Programs%1, 28 pages, March 1976.
STAN-CS-76-545, W. J. Paul, R. E. Tarjan and J. R. Celoni, %2Space
Bounds for a Game on Graphs%1, 21 pages, March 1976.
STAN-CS-76-546 (SLACP-1715), F. Baskett and L. Sustek, %2The Design
of a Low Cost Video Graphics Terminal%1, 25 pages, March 1976.
STAN-CS-76-547, Robert E. Tarjan, %2Iterative Algorithms for Global
Flow Analysis%1, 31 pages, March 1976.
STAN-CS-76-548, D. Prost O'Leary (Thesis), %2Hybrid Conjugate
Gradient Algorithms%1, 120 pages, March 1976.
STAN-CS-76-549 (AIM-278, AD-A027 455), David Luckham and Norihisa
Suzuki, %2Automatic Program Verification V: Verification-
Oriented Proof Rules or Arrays, Records and Pointers%1, 48
pages, March 1976.
STAN-CS-76-550, R. E. jan and A. E. Trojanowski, %2Finding a
Maximum Independent Set%1, 22 pages, June 1976.
STAN-CS-76-551 (AD-A032 347), Donald E. Knuth, %2The State of the Art
of Computer Programming%1, 57 pages, June 1976.
STAN-CS-76-552 (AIM-279), Norihsa Suzuki (Thesis), %2Automatic
Verification of Programs with Complex Data Structures%1, 194
pages, February 1976.
STAN-CS-76-553 (AD-A032 772), R. E. Tarjan, %2Complexity of Monotone
Networks for Computing Conjunctions%1, 21 pages, June 1976.
STAN-CS-76-554, F. S. Yu (Thesis), %2Modeling the Write Behavior of
Computer Programs%1, 185 pages, June 1976.
STAN-CS-76-555 (AIM-280), David D. Grossman, %2Monte Carlo Simulation
of Tolerancing in Discrete Parts Manufacturing and Assembly%1,
25 pages, May 1976.
STAN-CS-76-556, L. J. Guibas (Thesis), %2The Analysis of Hashing
Algorithms%1, 136 pages, August 1976.
STAN-CS-76-557 (AD-A032 122), M. S. Paterson, %2An Introduction to
Boolean Function Complexity%1, 19 pages, August 1976.
STAN-CS-76-558 (AIM-281.1, AD-A042 507), Zohar Manna and Richard
Waldinger, %2Is `sometime' sometimes better than `always'?
Intermittent assertions in proving program coRrectness%1, 41
pages, June 1976, revised March 1977.
STAN-CS-76-559 (AD-A032 348), Gene Golub, V. Klema and G. W. Stewart,
%2Rank Degeneracy and Least Squares Problems%1, 38 pages, August
1976.
STAN-CS-76-560 (AIM-282), Russell Taylor (Thesis), %2Synthesis of
Manipulator Contrkl Programs fpom Task-leveL SpeCifications%1,
229 Paces, JulY 1976.
STAN-CS-76-561 @. R. Woods, %"Mathematical PRogrammifg↓→CMOUCGJT4∀@@@A+gKHOfA∂USAJJDX@bfdAaCO∃bPAβUOkghbrnl8~∀4U~Rε9l~M5]2iUYIαBε⊃6 ↓MI↓β IM¬bα∪/;∞c⊃α∃r↓α/;/#!βπv!α19α↓αSK∞∪ αC⊗ ∪=0hQ↓↓↓α↓∃JSF)α↔π⊗ceα∪-3↔3?εk↔;Qαβ?→α∧ε&}∨,≥VnNβY`⊂∪0p∞guaces%1(λ@@D`rAa¬OCfX4∀@@@AβkOUgh@Bdjl\~(~∃' ¬≤[πε4jlZjXfXAλ8@@A_8A%kgMKYX@Q)QKMSfBXJe'i¬iJ@AIKgi←ICiS←8AβK←αs≤4)α↓↓↓α≤{77WvK∂πSLs∃αC⊗{∂πO≤+@~+∃Dβ lh∀ ≤βryVλ zsz\z⊂⊂LMY↔εEβE)b S⊗aaVM[⊗Z[
⊂⊂⊂∀⊂dfV@283$ HP@ 4jdZn$X@@AIC]IC1X@@A⊃Cm@'~↓↓↓α&C↔O'~I04$∧ααα∧V$∂π
H
,<=~0↔[9P⊂'Yα Meta LEvel Knowle`ge to the ConstructiOn,
Mai`≥i∃]CMGα)βπ≠ ∧¬/≡T v $∪_<L|αP%w≠{v2r→p¬ Basas%1, 304 pages$ Julq
1976.
~∃M)β≤[
&Rnl4jlj@!βλKα@fd@pβ↓I%1αα)9α~q↓αO'∪'/←-∪∪¬↓αBS#↔≤KE%1α)J'≠LεFN∞AQ"αα∧∧∧⊗@⎇;Y ≡↑(λ
@0r2rH(97q≠2vyPλ37y∩w1wf\42z2[<P⊂(_y0q7[4qP)↑yz2v\RXVεB⊂⊂⊂⊂λ_X≠@≤0sryK⊂'7`6ember 1976.
α
STAN-CS-76-566, Margaret Wright (Thesis), %2Numerical Methods for
Nonlinearly Constrained OptimizatiOn%1, 262 pages, November¬
1976.
STAN-CS-76-567 (AIM-284), RabaeL Fankel (Thesi@LRX@@∀eπ←]MiekGQS]NA¬]H~∀@@@A⊃KEkO≥S]NA5C]SaUYCi←HA!e←≥eC[f∀bP@b\bAaC≥KfAa¬OKfX↓βkOkMh@br\l\~∀4∃')β8[π&Z\hZjl`@@Qβ%~ZdpTXA!∧4djr@bf`↑I/εRXA(\@↓≡\@@↓¬S]M=eHX@↓λ\Aλ8~∀@@@A∂e=gg[C8XAε\↓$\A→URXA$8Aε\A ←YYKLXA$\αα¬)α4K;/↔baα59ααM9αo++Sπ⊗ 04)α↓↓↓αjqα⊃9ααK?∪/∪'∂-bα 9↓∧)9αOFK7π;zaαI9∧A9αS∂K3?I. Jarvis, V. D. Scheinman, T. A. Gafford, %2Exploratory
Study of Computer Integrated Assembly Systems - Progress Report
3%1, 336 pages, August 1976.
STAN-CS-76-568-4 (AIM-285.4, PB-259 130/3WC), T. O. Binford, C. R.
Lui, G. Gini, M. Gini, I. Glaser, T. Ishida, M. S. Mujtaba, E.
Nakano, H. Nabavi, E. Panofsky, B. E. Shimano, R. Goldman, V.
D. Scheinman, D. Schmelling, T. A. Gafford, %2Exploratory
Study of Computer Integrated Assembly Systems - Progress Report
4%1, 255 pages, June 1977.
STAN-CS-76-569 (PB-261 814/AS), John G. Herriot, %2Calculation of
interpolating Natural Spline Functions Using De Boor's Package
for Calculating with B-Splines%1, 46 pages, November 1976.
STAN-CS-76-570 (AIM-286), Douglas Lenat (Thesis), %2AM: An
Artificial Intelligence Approach to Discovery in Mathematics as
Heuristic Search%1, 350 pages, July 1976.
STAN-CS-76-571 (AIM-287), Michael Roderick (Thesis), %2Discrete
Control of a Robot Arm%1, 98 pages, August 1976.
STAN-CS-76-572 (AIM-288), Robert Filman and Richard Weyhrauch, %2An
FOL Primer%1, 36 pages, September 1976.
STAN-CS-76-573 (AD-A032 945), Arne Jonassen, %2The Stationary P-Tree
Forest%1, 90 pages, November 1976.
STAN-CS-76-574 (AIM-289), John Reiser (editor), %2SAIL Manual%1, 178
pages, August 1976.
STAN-CS-76-575 (AIM-290, AD-A042 494), Nancy W. Smith, %2SAIL
Tutorial%1, 54 pages, November 1976.
STAN-CS-76-576 (AD-A035 350), Colin McDiarmid, %2Determining the
Chromatic Number of a Graph%1, 61 pages, December 1976.
STAN-CS-76-577 (AIM-291, AO44 713), Bruce Buchanan, Joshua Lederberg
and John McCarthy, %2Three Reviews of J. Weizenbaum's Computer
Power and Human Reason%1, 28 pages, November 1976.
STAN-CS-76-578 (AD-A035 219), Joseph Oliger and Arne Sundstrom,
%2Theoretical and Practical Aspects of Some Initial-Boundary
Value Problems in Fluid Dynamics%1, 62 pages, December 1976.
STAN-CS-76-579 (SLACP-1826), Forest Basket and Abbas Rafii, %2The A0
Inversion Model of Program Paging Behavior%1, 30 pages, December
1976.
STAN-CS-76-580 (AIM-292), Terry Winograd, %2Towards a Procedural
Understanding of Semantics%1, 30 pages, October 1976.
STAN-CS-76-581 (AIM-293, AD-A042 508), Daniel Bobrow and Terry
Winograd, %2An Overview of KRL%1, 40 pages, November 1976.
STAN-CS-76-582 (AD-A038 863), V. Chvatal, M. R. Garey, and D. S.
Johnson, %2Two Resultq Concerning Multicoloring%1, 9 pages,
December 1976.
STAN-CS-77-583 (AD-A038864), V. Chvatal, %2Determining the Stability
Number of a Graph%1, 39 pages, February 1977.
STAN-CS-77-584 (AD-A038 865), Donald E. Knuth, %2Deletions That
Preserve Randomness%1, 32 pages, February 1977.
STAN-CS-77-585, P. Concus, G. H. Golub and D. O'Leary, %2Numerical
Solution of Nonlinear Elliptic Partial Differential Equations by
a Generalized Conjugate Gradient Method%1, 43 pages, February
1977.
STAN-CS-77-586 (AIM-294, AD-A042 516), Nachum Dershowitz and Zohar
Manna, %2The Evolution of Programs: A System for Automatic
Program Modification%1, 45 pages, February 1977.
STAN-CS-77-587 (AD-A038 867), M. R. Garey, R. L. Graham, D. S.
Johnson, and D. E. Knuth, %2Complexity Results for Bandwidth
Minimization%1, 36 pages, February 1977.
STAN-CS-77-588 (PB-266 381/AS), Tony Fan C. Chan, %2On Computing the
Singular Value Decomposition%1, 57 pages, February 1977.
STAN-CS-77-589 (HPP-77-2, AD-A038 866), Robert S. Engelmore and H. P.
Nii, %2A Knowledge-Based System for the Interpretation of
Protein X- Ray Crystallographic Data%1, 36 pages, February 1977.
STAN-CS-77-590 (AD-A038 868), Donald E. Knuth and Michael S.
Paterson, %2Identities from Partition Involutions%1, 22 pages,
February 1977.
STAN-CS-77-591 (AIM-295), Robert C. Bolles (Thesis), %2Verification
Vision Within a Programmable Assembly System%1, 245 pages,
February 1977.
STAN-CS-77-592 (AIM-296), Robert Cartwright, Jr. (Thesis), %2A
Practical Formal Semantic Definition and Verification Systems
for Typed LISP%1, 158 pages, Fegruary 1977.
STAN-CS-77-593 (HPP-77-1), A. C. Scott, W. J. Clancey, R. Davis, and
E. H. Shortliffe, %2Explanation Capabilities of Production-
Based Consultation Systems%1, 30 pages, April 1977.
STAN-CS-77-594 (SLAC-200), Edwin P. Stritter (Thesis), %2File
Migration%1, 112 pages, April 1977.
STAN-CS-77-595, John Gregg Lewis (Thesis), %2Algorithms for Sparse
Matrix Eigenvalue Problems%1, 212 pages, April 1977.
STAN-CS-77-596 (HPP-77-5), Mark J. Stefik and Nancy Martin, %2A
Review of Knowledge Based Problem Solving as a Basis for a
Genetics Experiment Designing System%1, 97 pages, April 1977.
STAN-CS-77-597 (HPP-77-6), Bruce G. Buchanan and Tom M. Mitchell,
%2Model-Directed Learning of Production Rules%1, 21 pages, April
1977.
STAN-CS-77-598 (AD-A040 486), Arne T. Jonassen and Donald E. Knuth,
%2A Trivial Algorithm Whose Analysis Isn't%1, 32 pages, April
1977.
STAN-CS-77-599 (AD-A040 441), Donald E. Knuth and Arnold Schonhage,
%2The Expected Linearity of a Simple Equivalence Algorithm%1, 56
pages, April 1977.
%3REPORTS 600 THRU 699%1
STAN-CS-77-600 (AD-A040 538), Mark R. Brown (Thesis), %2The Analysis
of a PRactical and Nearly Mptimal PRioriTy QuEua%1, 102 pageq,
April 1977.
¬
STAN-CS-77-601 (AD-A045 652), John F. Reiqar (Thesiq), %2AnalysiS of
A`diTive Random Number Generators%1, 34↓aCOKLXAβaISX@bdnn\~(~∃' ¬≤[π&4nnJl@dXAε8@A K ←←dA¬]HA∞8@A⊂\↓∂←YkλX@JEQQJA≥U[KeS
CYYr↓'iCE1J~∧@@@A%∃G←]gQakGi%←\@A=H ↓β
↓α+π≤{ %αn SK'B↓β≠K}i↓αO∧+∂SK∞a↓α∪∂#¬∃Eb↓ID∀R↓↓↓↓πβπ>↑5B∧∂∞-⊗bβ↔⊗s*@C"C!
u⊂3EXtk%f@V[_→H∀ bεPX~_@ 292), RgberpλA
8A)Ce)C\X@Je%Kα3↔K↔v≠∃α\≤6FNlX aQHλλ∧∧∀Y<.]<Y( M{K3
≥Y8<D
~;9$∧≥≠h \8;] ≥8π⊂"~yu7d[:⊂)`%ts%!0@@hj↓aCOKLX∩∧@@@AβAaS@1β eM]ph (*:D rX:2k≠uRcβ"¬λ∀"l⊗εCααε7∪JJD
F}w∀∧∧2r∧λ2bαλ9ε∞r ≥f"α ( npx4 LπYSO∃`X~∀@@@@∀eπ←]Q` >Dλ l@⊂:42H"4yyZx0p∀iviti ob LAx-We@9IeOMα1αS@≡λ $∧⊂εr`4hkd`&↓H ?!Q"αα∧∧∧6O,8
∧ |Y→.∧∀}4nL9<h∧
βs⊂$≡x2y1≠v4qP⊃xzpz~ww9RLT∧ (T@AaC≥Kf@1∧ CKπ`h ∩α∧∧αβ ⊗vr`! C"J:⊂3C(iRS@7-205 (HP@-50∞J@λεBb∧_AT βF λπεm
+∧
KH⊃eD∀{:.Mλε⊂* ⊂"W MitcHell,
λ R. A. @πQKgβ#↔-↓∧ ;⊃↓∧⊃1↓α↔+∂#πv 91↓α)J¬↓∧k?&]Dααεmx D∧⊃→0.
β0 ng
SyStees%1(λ@Dβ⊃βCπ>+@~@λ∩U-l(λλ@953&
SDAN-CC-53 ~l@lX@A5SGQC∃X@@A(X@Aπ1C]GrAC@; ∧αα∧Mx L≥→λλλUβ⊂⊂⊂∩w:z4 ⊂⊂∩Y⊂FA⊂⊂λ⊂⊂( 2ogrammi`≥Nαβπ;⊃¬βK >-LVj@4{s∞m9Y`⊂∀pvtg_y∩X@, 104↓aCOKLXA¬kαs∃↓EK9U 0Q!PE≥H→bl≥5Vs 5-L
d∧λ⊂tiE5∀K&⊗lj+∧∧∀⎇<l≥Hλ∪n⎇8zz%Dλλ &*|→0m≤X8x.M;{\d∧_;Y↓QHλλ∧∧∀≤[m|\hλ m|H⊂,.⎇≤X,>λλ⊃ ≡_(λ
O<→4d
;Hλλ={X⎇..Y;]∧∧∀≤[l↑X;<dV+λ Fa Hλ∧∧λ≤⊂,|αyV⊂∩:s2P \[[WβE
STAN-CS)77-408, Istvan Si`≠←8@@A)!KgSf$X@@JI∨\@@↓'←[JA'kEIKGkeMSmJ~(@@@@↓%KIk
SESY%iSKf∀bP⊃↓ ↓IβC∞;↔MD '.vTε∪K;uaPPH*:D rX:2k≠uRcβJ∧¬∧ "X⊗β#~∧ε3#∩∃D¬⊗},Z'"αλUbαα
L↔⊗V≥aBααT(6}o
H /
=≡(
|C"H∧∧λλ⊂m⎇8Z;L≡≠|Z,≥λ⊂; ⎇|Z0~~4¬s%1, 97 pages, Be@9J@br\jP_4Ph"NR q6∞Mi9P~Kd∩ααα¬λ∀L@+,F&U+λλ∧
→<\O∀λ∃z-myx 0Y⊗⊂⊂⊂ Y P⊂λ εramework fo@H~∀@@@A+]⊃Kegi¬]IS]≤A Sgα≠?WK≤∧R+
Dε#"π ≤v/~βλ∩N]Y( '⊗mkC!! Tuλ→K0teVmk ≠ XP⊂⊂
dfVL≤\⊗⊂λ⊂ b⊗PX~≠⊂λ≠X→TK⊂⊂⊂-≠t0p∩ Eanna, Richard
Waldingar, %2The Logic of Aomputer Ppkgbammang%1, 90 pages _A)k]J~(@@@@brnn8~∀4U~Rε9l~M%]8iP∪ $¬∧E¬¬P
f@T[V⊂⊂b∩`H
→⊂⊂↔Th %1αα!9↓¬β↔;≠Jα3'¬∧∧⊗v"∧λV'>≤,B∧
aQ `HαC"AQHλλ∧∧⊃Y2,@ps10]vV⊂∩L):v %-Bas@∃H@A+9IKeGβ#π;∪Ns∃β?2αO'∨v 3M∃λ¬Bαβ&4πε∞|↑2`h$∧ααα *Vv*∧⊂∞&ViC"AQTq⊂)e0pk&Vi-L&5λλ⊃%dλλ∀n 9~0l≡≠kλ∧VS{@∧
{{9$∧⊂{_.≡y<h∧
yH∀.\<z+)l=⎇≠ma Hλ∧∧λ∪9.M≠y≤d [|@⊂∀|yz6\P7s⊂∪5w6$[2py⊂v3rq≤0p c Equations%1(λ@fDAaCO∃bP~∀@@@A)k]J@Drfn\4∀∩¬'Qβ≤[πLZfnZXb`@Q¬∪∩ZddrRXAi←QC@⊂α7π≠v 1απ&IαO#∞k'I1α↓∃JSF)α∂?w3↔K∨,s∂∧∀R↓↓↓↓ε{⊂∩αλjVv∨M→vw~∧
Fzαλi↔F.N vNwN4αε@yHλ
,8⎇4Nt{2Pλ 2s )nitiOns%! 45
pages, BeNe 1975(
∀4⊂
NR q6∞Mi9P~Kd∩Rb¬%`λ∧λ{≠um≥\zz$ 8π2 O. Pirgnneau, !2Num` eS
CXA≠∃iQ←IL~∀@@@AM←β⊃βS#*α≠'K≤εB∧⊗≥ ↔ε@9{Z,4λ⊃0_]pz4`/n and fgr↓iQJ@↓)o↑Zαα∪'\X Ntp∂nal ∀@@@Aπβ#?/↔~αCK∨⊗c↔5∃λ¬BβCd
ε∞y<k∧ ];Y$ε,-me@∧¬α
SPAN
AS% .\ZdblQβλ[∧`hl@fbbR0A⊃KS9t[∨iQ↑@A↔IKSgf↓C]H@↓∃WgKββ!α∨dK⊂≡<Kβ!∧λλλ∧∧,Tu ≤X;∩.O(≠p∪λ842P⊃7zy4Yy⊂&r]47r%1(λ@DTAaCO∃`
"λ8 .∞→;8L↑Hλλ@953 ≤~(~∃' ¬_[πε4jf@53 P~α¬λ∀L@+,lε¬+λλ∧
→<\O∀λ∃z-mβsp∩ad, %2On some CoNtested ∀@@@Aπβ+CC?≡KS'∨w→↓β?2↓α∂↔v+CπSM3∃↓αd¬⊗v?]~7&N>4αε∞-}W"α∞Mε*¬<8
,]]~0∪~qFE⊂λ⊂⊂⊂)]:r<P≠q⊂&0[3zpsYRXV⊂ ~P80Yp¬s, Saptemberbrnn8~∀4U~Rε9l~M%]8iQE@∧∧αDEλ¬S+:β,@≤ ⊂⊂ b `X∩5 948)(λ@A9SYf@↓∀\@@↓→SI@≥≠?91α↓∃J∧hQ↓↓↓ααCK∨'+∂S'}qαOGα:F.j h n⊂ z`4omatic DeductiOn%1, 42 pAgas, September
1177,∧~∀~)')β≤5π&Zn\ZlbrQβλ[∧`hl@PpbRX↓.P→↓∧Q9αC∂+1βπv!αI9∧)1↓↓¬#πK+∞q1↓∃∃#'7∃hh)↓↓α↓αOC∞≠∃αS⊗ ∪∃6|3⊂↔~
≥bε
λ∧⊃,,[→(λ|99)&∃α⊂≤≤0sryK⊂)r`0teeber 1975*
λSTAN-CS-74εZld@XA∧\αα⊗}N>F∞λ_;LD∩K@⊂∪βliger, %2AdapTation kf The FouraeR
Me@QQ←HAQ↑AiQ∀@A≥←αsC↔KN{∪'
∧K;'SN 1α ␈+;∪π↔Iα[πg+∃↓α¬∪? 3.i∃E1βA@$ α↓↓↓βε ∨πMbαO↔C&+7 ↔∩↓Ee]:p4(∀U~Rε9l~M5]:iYIEαB"BAk9U5I*aαε⊃l AQYβ⊃ae%bα∃ 2λ∃b∧6]≤v.v,≡Vjb∧∧S∃& T∧∂↔AQ"αα∧∧ε}2∧λ↔↔&≤m⊗≡N≥Dα∧NnLVff≤|Vv≡W$αα∧∃`¬&F]\W
α ≥f"αλ<↔≡*∧
7'.M≤W
ε|aPRα∧∧α∧↑m}vf.L|R∧.l⎇⊗v.↑-⊗v:V∃Bβ ∧∞ε∞>↑5B¬≡↑
F.n,↑"β ⊗vr`h!Q%≥$→eT≥~Vvrk3&%B∧:d αrαλ⎇vg∞%D∧jr∧ ε.∂M∧ε∞vDλrrα∧
v∞F,∃Bα+(|Vv/,≥FOV\APRα∧∧α∧∨-}7~ml≥FN&≡M⊗}r∧ ↔~α ∀αα∧\ZFF}D∧ε6␈$∧∧≡F⎇}6Nvt∧ε
α∧λv}}D∧¬⊗NL|PhR∧∧αα¬ ≡&∞n↑LW∩+∃Dβ∪*∞ ⊗>/5D¬≡/∞LVn⊗↑$β Kvu`hPQ*5$ eX5~kvuS3∪5Dα∧"d∧∧⊗}L←∩αε≥lB∧:d∧α∧Bd∧∧>}N\"bα∧V$NwlZ'≡*λ]⊗>.nl⊗g.QQ"αα∧∧¬π⊗|-F.o4 f␈∩λ,⊗v" \↔'⊗≤<W~+∃Dβ;*∞ ⊗>/5D¬≡/∞LVn⊗↑$β Kvu`hPQ*5$ eX5~kvuS3∪D∧αD →US≠β∃Dα∧ EX∪β#D∧β∪≠∃∃Bα∧L↑7&/$∧∧.∂-lW∨"D∧ε/"d ⊗brAQ"αα∧∧α+∃,\6.wD
&/≡\≡&≡B∧
⊗r∧=⎇Wπ/L↑"α¬<9⊗.v<TS
bε⊗∪Bα∞ ⊗>/5D¬≡/∞LVn⊗↑!PRα∧∧αβ ⊗vrph `h!Q hU:H∀rl:5S;:Vf#*αλ_Bl εFbαβπ⊗αJb \↔⊗Z
%bα∧.-w>r ≥f"¬-|&/↔D∧∧*R∧
F∂⊗,≥b`h$∧ααα∧V$
∧l≡7"∧\X L]9Y`λ≥→{|M≡~≠)&∃λ
D∞_9y.5λ∀y.∞→;8L↑Hλ&&vkC"AQTq⊂)e0tk&vi-LFeλ⊂;LNY=`∧λkHλ ≤9kλ∧VS{@∧∞~→( M{|λ∧
⎇z5 =~;Ydλ9→≤L↑|z;Lq"Hλ∧∧λ∀∀M|[→;$V+λ F∀≤_9l↑iλ∪l>≠xY.$ .-fUA"C!*u⊂3EXtk ≠MV[→ H∀ bεPX~≤⊂
\≠∀Vλ)0qt_y2⊂% ⊂&4x≥7w⊂0[2⊂)7X2y: E* Darjan
%"A SeParatop Theorem forPh C]¬d@A∂ICaQf∀bP@fD@AaC≥KfHA=Gi←E∃d∩∧@@@@bdjnL~(~∃' ¬≤[π&4nnJlHp@Qβ⊂[α`h`@npn$XA%S
QCeH↓∀\A→αKCS?pβπ;⊃¬∪? ↔↔!α∃9¬#πK ∞q04 α↓↓↓↓+∩πCCdK∂πSN{;M↓ε{⊂∩α ⊂α¬εL≥f∂∩∧
6/ε≤∧X.M|Hλ
M→;p→→vRX@, 34AaCO∃bX~∀@@@A=Gi←E∃d@br\nT~∀4⊃')β8[π&Z\h
5Y∪I1απv#K↔]∧→1↓αN =1↓+∩S#∃∧≠?7Cd+c'SJβ? ↓¬βπSS-∪9α↔∂#∂#'v84)↓α↓↓β≠⎇⊃β¬α⊗ ;∪?hαOSKNs≥∃Eb↓QMβε ∨/5D∧}∨M|&/∩∧∪∪;:aQ hU8H∀rl:5S;:Vf3αα¬λ∀LjV6β∩b∧λ∀"l→vCJαεrc
JD∧¬F↑ ≡"α∧\≥fv
∧ ⊗v"∧
&N≡ ≡& h$∧ααα
|⊗f&≥lv/∩∧V%∨NnMε/≡≡7"α∧N,V∞o4πSr¬∞-v/⊗≥↑2+
Dε∪ J∞ ⊗>∂5D∧}∨M|&/⊂Q$ααα∧ε∪K;uaPPH*:D rX:2k;uVc≠
¬λ∀LjV6β~b∧λ∀"l⊗εSαβεεbJb∧ f∞≡∞]R∧&↑.6F␈⎇≡GRα ≥f"¬-⎇ε∂⊂Q$ααα∧ V∞vl⊃BααV)⊗v6↑,Vv≡T
'.f↑4αε6} ¬π⊗|}&∞j977.
STAN-CS-77-633 (AIM-305, AD-A048 660!, William Faught (ThesiS),
%2Motivation and Intensionality in a Computer Simulation
Model%1, 104 pagas, October !→77.
STAN-CS-77%634, W. HoFfiann and B. N. PardeTt, %2A New PRoof od
α Global Convepgence foR the Tridia`∂←]¬XA#_↓βYO←ISiQZ∀bP⊃↓ AβCπ>+E 4R↓↓↓↓∧{∂S?⊗+I↓EK9U 0Q!PU≥H→bl≥5Rs*kf6Rb∧ud∧Br∧λv}g\%B∧2d
Br∧NY2ε∞l@∧j@H∪ D ⎇Y<NMβw⊗⊂λ∩Y @⊂67quCE⊂⊂⊂λ⊂&0w_⎇7yP∪rz47Y⊂:7P⊂wvx:]2y⊂*~2P)`)ngular Valu`
@A¬]HAπ=` K↔∨β?;∪Ns≤4)α↓↓↓α≡K;∨Wf Iα[,≠SKMε{⊃β¬∧kπSKOA∃E1βAAβC∞;↔M1∧{∂S?⊗+I↓EK9U(4Ph"NR q6∞Mk9U5Y≠1↓"ε j¬AQB↓UaaJaα/↔vs↔S!¬↓9↓α↔+ ∃1α)J∞{j↓α∂?w3↔K∨.s∂∃β|04)↓α↓↓αS⊗K∨?;|k↔SKN→α';&+KC?f ;SM+ 1↓I*βCπ∨/→1α?∨#? ↔∩↓Ee]:p4(∀U~Rε9l~M5]:iYM]bα3g∪*αKπ7≡Cπ]1α)J?9¬##∃α> AαO'∪W∂S/∪∃β?2↓αO↔∂+↔;∂/→β?_hQ↓↓↓ααC/'w#Mβ?rβ¬α∂M∪∂3∃+ 1↓I2βCπ∨/→1αO,επ&.\,W∩β↔⊗s:PQ!PU≥H→bl≥5Vs*kf7ααE8V3∪2
ε3αkVu∩b∧M≤⊗vvT
π⊗␈>D∧j<L\↔↔JD∧α+∀∀λv.v↑,⊗fO,\@hP`h!Q hR∧∧αα∧=⎇fW.|≡F*∧},⊗&N]nBα∧≥Lv␈⊗≡Mεjεmz"¬≡⎇NfNvt∧ε
∧=L↔∨~∧
v"¬≡X⊗'⊗≡M⊗_h$∧ααα
&}?,≥VnNlp¬π⊗|-F.o4V∩bβG∀πε∞|↑2b∧|:F}⊗↑$β Kvu`hPQ*5$ eX5~kvuS3≠∀∧αD →US≠βeDα∧ EX∪β+4∧β m*+∧∧⊂{|LL;≠λ∧λ|Y9-dλ_;LDλ⊃_.m9β"D∧λλλλ,<Xp~≠{V⊂∩L'w⊂(≤7sy0[P)|w≥42yt\P!w7]v2r3YRXV⊂
→P⊂8_sryVλ'7{2[q2yεB⊂⊂⊂⊂λ_\[[KεEεE∀j g⊗PiV[[K[~_⊂λ∀ dfKYX≠@, AD-A053 176), Zohar Manna and Richard
WaldingeR, %2Structqred Programming Without Recursion%1, 10
pages, December !977.
STAN-CS-77-641 (AIM-308, AD-A053 1_4), DaviD Barstow (Thesis),
α %2Automatic ConstrucTion od∧@Aβ1O←eSQQ[fJDX@dd@@AaC≥KfXA⊃KGK[ Kd~∀@@@@Drnn\4∀∩∃'Qβ≤[πLZnnZXhdX@↓β]Ie∃nAε\A3C↑0@Je∨8@Aπ←9giek
iS]NA≠S]%[kZAMaC]]%]N~∀@@@AQeKKf↓S\AV5 S[K9gSO]¬XA'a¬GKfA¬]HA%∃YCiK⊂A!e← YK[f∀bP@@LnAaC≥KfX~(@@@@↓≥WmK5EKd@Drnn\4∀~∃'Qβ≤[πLZnnZXhfX@↓↔k]S<@A)C9CEJX@JeαA∂K←5KieS @A≠KQQ←H@↓S\A≥=]YS]∃Cd~∀@@@AAe←Oe¬[[S]≤JbX@TfAaC≥KfXA⊃KGK[ Kd@bdnn\~(~∃')¬≤[π&4nnZlPhX@@↓¬Ke]¬eH@@↓≠←]h5%Ks]¬kH@@Q)QKMSfRX@@Je!SKeCIGQSG¬X~∀@@@A!I←aKeQSKfA=HA
Y=ofAC9HAiQ∀A Ki∃eSS]¬iS←\↓←LA∪9]Kd@↓→←←aLJbX@Dlh~∀@@@AACGKf0A KG∃[EKdbrnn8~∀
∃M)β≤[
&Znn4lhjX↓%SGQ¬eHA∀8A→SaQ←\X@↓ ←]C1HA∀\↓%←gJ0AC]HA%←E∃e`A 9IeJ~(@@@@↓)CeU¬\X@@∀e∂K]∃eCYSiKHA≥∃giKHα↓α∪'∨≠↔∂SN{9∃Eb↓MI↓πβπ∨↔~aα∪↔≤+7 ↔⊂h)↓↓α↓↓Ee;904(hRNRεrj∞M5;95YQ2↓↓"εLi5MAJI1↓↓∧→9↓α:q↓α;,cG?9α↓βπ; ↓α∪↔⊗+-↓↓∧→9↓α␈βC↔9`h)↓↓α↓↓∃J.3≠'∂N+;Qα&+∂'OL{9αC⊗{∂↔∪/∪↔Mα⊗ O↔⊃ε{9α∂}s∨KW,s∂¬α≡c?OW⊗)∃E1β(4)↓α↓↓βC∞;↔M1∧#↔∂↔n∪↔I↓ I]]8hP4*N$
96∞~i]a∃3!]!↓∧ ;∪K/9↓α
r↓↓αg∞y1↓↓+∩¬↓αf{←↔Iαα ?Wv!↓βSz↓αCπfK;∪K}k∀4)α↓↓↓α⊗+∂?∨vKS'?r↓β eααCK?⊗ '3O≠S'
ααSWKNs≥↓αn ∂#'v+M∃Eb↓↓↓Iα↓βCπ>+M04R↓↓↓↓∧Sπ;W∂∪e↓EK9a84Ph*NR q6∞Mk9a5Y#A↓↓" !6¬A+!↓↓E#→%1↓∧#?;πf!↓α∃r↓↓↓α↑sWS!b↓↓∃Jn S#↔n S'∂∞`4)↓α↓↓αSMβ?∨K∂β#e∃
a↓Yaπβπ∨↔~aα+πw+πKeβ e]aph(4*≥"ε96≥→5]ak1Qe↓αB"BAk9a5EJa↓↓α↔∪W∂∃αα≥9↓α↓α W≡Cπ;πr↓βπ; ↓↓α↔';πK⊃αα¬84R↓↓↓↓∧3↔'∨.s πWha↓↓∃∀"⊗:∩∀
1↓β∞s⊃↓αn+S¬6$*:∩J ai↓↓¬##↔'∩↓απCεc'∂π&K?;LhQ↓↓↓αα∪'7,sO'?r)E1↓∪)βCπ>+M1αV ;Wπ↔I↓Ee;A84(hRNRεrj∞M5;A5YUα↓"ε⊃l AUQα↓EQQJaαS#}kπMαf+;∨π,)↓βπv!αK?⊗+KQ↓∧)9αS∂∪+π9`h)↓↓α↓↓∃J
α≠πO"απ3∨␈∪'S#jβ≠?I∧3';∪Ns≥α∪}k';π&{KMβNqβ¬α6c?]↓∧;KπCB)E1↓#4)↓α↓↓βC∞;↔M1∧3↔ K. Ke↓ I]a8hP04(hP4*N$
96∞~i]a53)E↓" J55M ↓1↓α !6¬A+A↓YA
I1↓αv ∂#Wjα∪↔K≡C?←''Q↓βπv!αk?F H4)α↓↓↓αn ;;¬b↓↓∃Jπ∪?['v9↓αS/∪7';∂#'?9αβ←'SB↓α7Wg#'O↔"↓α?K&+K';?→∃E1α↓M@4R↓↓↓↓πβπ∨↔~aα7π⊗≠!↓EK9a84Ph*NR q6∞Mk9a5Y+⊃↓↓" J55M %!↓∧;K↔≥αα;↔3≡{9↓β∞s⊃↓α&+K↔-αα
9↓αα?CC.q1↓∃∀λ4)↓α↓↓αONkC3'6K↔Iα⊗ O↔⊃ε{9↓α.3∪'∂N+;Qα&+∂'ON{9απf;?K'&C7M∃
a↓↓IαβCπ∨/→04)α↓↓↓αn K∂!β e]aph(4*≥"ε96≥→5]ak1UM1ααg?O≡I↓αOFK3?π≡A1↓↓+∩7W3&I6S↔⊗k';πb↓↓A5
↓α≠3␈9∃E1α↓E`4R↓↓↓↓πβπ∨↔~aα+πw+πKeβ e]aph(4*≥"ε96≥→5]ak1UQ↓Eα IaC)IA>
→%1αN{OO%¬≠#'3} ∂!1α)JS#*αS←=¬βπS#~αCK?⊗c↔44R↓↓↓↓εKMαC}cg;?nKπ1∃
a↓IMπβπ∨↔~aαO↔π#↔7 /⊃↓Ee;984(hRNRεrj∞M5;A5YU*a↓α∨/∪7W;"α∪π#g W'O"a↓↓∃∀{9απ≡≠WKπ∨I↓βπv!αW;≡{;∪'&K?;π`h)↓↓α↓αOS∞∪'3''I↓β?2↓↓α3Ns↔πIαα7W3&KOS↔α↓↓α7/##?∪~↓β≠?∩↓↓αO.≠?;⊃αα?K∪/⊂4)↓α↓↓α∪N3≠↔K.sS'πbα↔GW∂#'?;~)E1↓BβCπ∨/→1α7∂∪∂!↓ I]a8hP4*N$
96∞~i]a53)Y1↓∧k'∂#∞+1↓↓¬!9↓↓∧C↔πSBa↓↓∃∀sW7↔⊗K∂π1α↓απ3>{K'SFkM↓β6{H4)α↓↓↓αv{;3'v+πK3Jα∂?;∨#Kπ'v+⊃α?π#'7'V S'?r)E1↓ !IβC∞;↔M1∧kπK∂B↓Ee]Bp4(4U~Rε9l~M5]BiYU]α↓"ε&jiMEIJa↓α+}C9↓αn~∂πK&Ce1↓∧kπOπFK/=↓¬≠πS=b↓αSπ↑+O#$hQ↓↓↓αα#πg∂≠#%1αβπ;⊃ααO#'>+KE↓∧K∨πK∂≠#%1α↓∃J?r↓βS#*↓α7?&+1↓↓¬##↔?↔I↓β?0h)↓↓α↓α/;␈;3↔∪>)∃E1β IβC∞;↔M1∧ CK'b↓Ee]Bp4(∀U~Rε9l~M5]BiYUaα↓"N2 →5IA*I1α3.{;πK"↓α)9¬≠#WO&+-↓↓E##↔OM→%1↓+∩π;πgKO'LhQ↓↓↓αβπ;⊃¬β↔K≠␈∪7π;≤∧Rε↑dλ6}o∞ZF/∩ ≥g∨'.\7&N⎇d¬≡/N4S
bε⊗s*π ≤v/~D V∂⊗=↓PRα∧∧αβ ⊗wαph!Q%≥$→eT≥~Vwαk3W∀αE≤H_2k∪εe∩bα -vFRλUbα¬-yFv␈}=7Jα
Mε/≡≡5∩bα∧V%&␈
_7
ε≥aPRα∧∧α∧≡⎇↑π/&≡M⊗}v≥D∧>.⎇\W'↔∀V∩bβf4πε∞|↑2b∧\≡&≡Bε↔∪;BaQ hU:H∀rl:5S+BVfcααλ→∀jk6⊗2Jbλ.'.≡TλRr¬=
⊗n∞mtαE& ↑6O~∃Dαα+*Mε*∧=→f.n≡M⊗_h$∧αααλLW∞N⎇dε∞vDλf␈⊗<T∧≡}nN&}b
xb∧≡⎇↑π/&↑$α∧≡⎇nG⊗@{≠⊃,D∪8;M≡≥;⊂.M|\i&∃β"H∧∧λλ &6(≤⊂,|<kλ \<Xz∧ε.-n¬A"C"J:⊂3K(:k)n¬VML(¬λ1 0&εLλ
g⊗λ+λ -z≠H∧
KH⊃m≥_Y<ND_;Y∧
[xY..λλ⊃%d∃_<M,;Kβ!$λλλ∧∧,UX.-8=~-⎇\h≠lD_(∀ \X[→$λx;9$
{H⊃n,<~≤dV+λ F4≤_9l↑kλ⊂.∞Z;λε↔-n AQ@εE)U g⊗aTV[\⊗M≠→⊗⊂λ w29→{P⊂!Z4Vat~t⊂⊂⊂⊗pwV⊂λ∩Y'2]P⊂ v→wy4j~4¬s in @if
Packing%1 50 pa`∂Kf0A≠Crbrnp8~∀4U~Rε9l~M%]BiYYMαBε⊃⊗ ↓P∪α∧εsK~α+λλ↑X8h∧λ|[|n<+λ &*{yU∞|<Y(∧
Y<u∂≥~;Yd
8πεEλ⊂⊂⊂⊂⊃y0p$~qyP0[2⊂ )≠qy0v[tp∞g↓→CMOUC@∨↔~)E "ε6απε≤|W
@λ∪8/∀ .-g¬@εEεB)j g aiV@78-664, Pe@QKdA¬)←egi¬HAC]⊂A∃O@⊗;∃α≠|∧6.ε≥EBα+(≥f∞g≡8
.P7s⊂_P ∞e@\~∀@@@AβY≥←e@'αMεjα h n⊂⊂'g→Tb4fYw9t`/na`_@↓≠S@;L¬VOV≡M⊗}rV⊂ ∧∧ .⊂λ80sr\T⊂&p↑FA⊂⊂λ⊂⊂_LM\⊂∞
STAN-CS-78-665 (CSL-TR-152), T. M. McWilliams and L. C. Widdoes, Jr.,
%2SCALD: Structured Computer-Aided Logic Design%1, 39 pages,
March 1978.
STAN-CS-78-666 (CSL-TR-153), T. M. McWilliams and L. C. Widdoes, Jr.,
%2The SCALD Physical Design Subsystem%1, 28 pages, March 1978.
STAN-CS-78-667 (HPP-78-7, AD-A060 795), Reid G. Smith and Randall
Davis, %2Distributed Problem Solving: The Contract Net
Approach%1, 27 pages, June 1978.
STAN-CS-78-668 (HPP-78-10), Alain Bonnet, %2BAOBAB, A Parser for a
Rule-Based System Using a Semantic Grammar%1, 41 pages, June
1978.
STAN-CS-78-669, avail[bibStockmeyer and F. Frances Yao, %2On the
Optimality of Linear Merge%1, 11 pages, June 1978.
STAN-CS-78-670, Ronald L. Graham, Andrew C. Yao, and F. Frances Yao,
%2Information Bounds are Weak in the Shortest Distance
Problem%1, 39 pages, June 1978.
STAN-CS-78-671 (AIM-316), Jerrold Ginsparg (Thesis), %2Natural
Language Processing in an Automatic Programming Domain%1, 172
pages, June 1978.
STAN-CS-78-672, Tony F. C. Chan (Thesis), %2Comparison of Numerical
Methods for Initial Value Problems%1, 195 pages, June 1978.
STAN-CS-78-673 (SU36 P30-59), Tony F. Chan, William M. Coughran, Jr.,
Eric H. Grosse and Michael T. Heath, %2A Numerical Library and
its Support%1, 22 pages, July 1978.
STAN-CS-78-674 (SU326 P30-60), Tony F. Chan and Roland Glowinski,
%2Finite Element Appoximation and Iterative Solution of a Class
of Mildly Non-Linear Elliptic Equations%1, 76 pages, November
1978.
STAN-CS-78-675 (AIM-317), Donald E. Knuth, %2Tau Epsilon Chi, a
system for technical text%1, 200 pages, November 1978.
STAN-CS-78-676 (SLACR-213), John Phineas Banning (Thesis), %2A Method
for Determining the Side Effects of Procedure Calls%1, 283
pages, November 1978.
STAN-CS-78-677, Frank M. Liang (editor), %2Comprehensive Examinations
in Computer Science, 1972-1978%1, 238 pages, November 1978.
STAN-CS-78-678 (AIM-314), Derek C. Oppen, %2Reasoning About
Recursively Defined Data Structures%1, 15 pages, November 1978.
STAN-CS-78-679, Walter Murray and Michael L. Overton, %2Steplength
Algorithms for Minimizing a Class od Nondifferentiable
Functions%1, 57 pages, November 1978.
STAN-CS-78-680, Connie J. Stanley (eDitor), %2Bibliography of
StaffOrd Computer Science Reports, 1963%1978%1, 100 pages,
November 1978.
STAN-CS-78-681 (AD-A065 283!, Louiq Trabb Pardo Thesis), %"Set
Representation and Set InterseCtion%1, 85 pages( December 1978.¬
λSTAN-CS-78-682 (AD-A065 265), Jacobo Valdes (Thesis!, %2Parsing
Flowcharts and Series-Parallel GrapHs%1, 233 pages, December
1958 ≤~(~∃')¬≤[π&4npJl`f@Aβ⊂[α`lT@dpH$XA%← KehA∃]IeJ↓)CeU¬\X@JI'i←e%]NAB↓'aCeMJ~∧@@@A)¬EQJJDX@df↓aCOKLXA K
K[EKH@brn`X~∀~)')β≤5π&Zn`Zl`hQ'*fHhA f@ZlfR0AλL@↓_\@A ←YKr↓C]HA≤\A⊂\@A∂←1kDX@∀e)QJ4∀@@@A≠CiISp@@↓∪]mKβ∪O∃↓αα↔'∨.s[π3.)↓↓α¬∪? 3.i↓↓β6{I↓↓¬β↔K'}#'
↓∧Sπ∂?⊗H4)↓α↓↓α7∂#K'∂/→∃E1β aβC∞;↔M⊃∧#↔∂↔n∪↔I↓ I]aaQ hU:H∀rl:5S;BVgβ*α¬λ∀"l⊗εc*αε ∞εU+λλλnX;ZmM;Hλ
L8+8m =;Yd∧∪≥2d∧
∃~ ↑z<j%A Hλ∧∧λ ,J>_<\lT_;Y∧
_8X-M→;λ \=≤Z/∧⊂{{.∞=_=
≥{\i&∃α⊂_[∞⊂80sYyR⊂"→qrvq→yεE⊂λ⊂⊂⊂_N[\↔εB∧E)j⊂g⊗aiK[\⊗[∞≠⊗⊂)~qt0y→⊂%↔∪4x:7[⊗⊂ y≠7v2⊂∪↔⊂)7\pw12\3P0w→⊂⊂ w→92{P⊂WεE⊂λ⊂⊂⊂,XwV⊂⊂ Y"|:→y30vλ⊂$0yZ4w3@ Sc@!K[KfAM←dAπ←Y1KGiS=]f@@↓←L@A⊃CiB~(@@@@↓'iek
iceKLJbX@LfAaC≥KfHA⊃KGK[ Kd@Bdnp@8hP4*N$
96∞~i]aVgβ*α∧¬∧ LUV3 *D∧αα∧_ET βfTααβg↔αJB∧∧α¬⊗≤=ε∂⊗D∧α¬>←≥π⊗∂\9α`h$∧ααα∧V%π⊗⎇LV>}\]f
α∞Mrαε∀∧¬&F]z'Jε|dα∧6}-V∞b∧
&.∂=yfNvtV∩bαεF∩πε≤|W~`Q$ααα∧λF.≡]\&/∩∧↔∪;BaQ hU:H∀rl:5S;BVgβBαλ→∀jk6↔αJb -vF∂$ V∞vl∃Bα+*=↔B∧L\7'/,↑2ε}d∞FF* Mv>N4
v h$∧αααλ=voπ↑LW∩¬∞-v?⊗≥]VNvtV∩bβV@πε∞|↑2b∧L\6.n,↑"β ⊗wαph!Q%≥$→eT≥~Vwαk3π∀αD →US≠ ∃∃B∧≡ ≡&f/4λrr∧l]G≡}eDα+∀≥dεq∃=Mv:εkT∧∞f⎇}&O&
QPRα∧∧αε6}$ααα∞Mε*α∧
G>zZl↔⊗N≤-F*m ↑"l≡⎇n7'⊗≥≥g"α∧∧∧fNl\↔∩α∧
π⊗}},⊗nn≥lphR∧∧αα¬<≡FO≡m≤⊗⊗NM≡GJ¬∞-v⊗f]TS
bε&απε≤|W~bλLV≡.\,W∩β↔⊗sBpQ!PU≥H→bl≥5VsBkg⊗αααλ→∀jk6&αbαλ_Bl εfRαβVWαJb∧ &}F≡$α∧n≥mf
α ≥f"α
-⊗≡F≡,@hR∧∧αα¬|≥F&Nl|W∩b∧∧S∀
λLV'.>M↔6*∧λ↔ππ-|⊗≡B∞Mrα¬∞-v?⊗≥Tα¬∨≥nFF/=≡2+
Dε3h$∧ααα∞ ⊗>/5D∧&.<]V⊗/$ε∪K;¬aPP`HαC"AQTu⊂)e0tk&wλε[≤LP⊂∀ Q⊗`X≠
⊂⊂_~N∀V⊂⊂∩rs72]4⊂⊂( ⊂⊂⊂!≥q2P⊂
*42yZyPV⊂λ⊂Y*4→FA⊂⊂λ⊂⊂!`/nstructioN of I`≥Sβ#'πD∧∧&∂L⊂αε6} λ∧ ≤8λ"\αb`∨Y%F@@AMsgiK5b@AMβ∪?4∀R↓↓↓↓∧s?;O& ;∪π⊗!αβπαL∩+
Dε∪ J∞ ⊗><kλ Mβ{2`-ber 1978.
αSTAN-CS-78-692 (HPP ~@;95Meb↓αε⊃l AYYβ Q]¬bαβKW≤∧Rα∧u`∧π∞= ⊗v∞eDα¬&⎇P∧jPQ$ααα∧ VO&= VfBβλ∀L]9λ⊃ed∀{:.Mλ_;LD⊂k@
-8z_.,λ∩P↔Z59wgλ%9↔, %"Mo`elS kf
Learning Systems%1, 38 pagas, LkveMber 1978.
STAN-CS-78-693 (AD-A066 099), Dou`∂YCLA∧\A]KghXJeαA
YCgf↓←LAπ=YciS=]f~∀@@@AQ↑AiQ∀A∂←gMS`A!β∪? 3.i∃E1β1EβC∞;↔M⊃∧s?[↔n∪↔I↓ I]aaQ hU:H∀rl:5S+Bβ-N&Eλλ∩M⎇X=~ ≥Hλλ =9Y`∧¬→9~.Mβy∀Vλ⊂∩Y![vx:z→y⊂⊂⊂∀qtrw_rP⊂0]εE⊂⊂λ⊂⊂)z_w37y→⊂_\[MT¬1978%1, 27 pagas, Nkvember 1978.
STAN-CS-78-695 (AIM-321, AD-A066 562), John McCarthy et Al., %2RecEnt
Research in Artificial Intelligence and Foundations of
Programming%1, 94 pages, November 1978.
STAN-CS-78-696 (HPP-78-22, AD-A068 538), Reid G. Smith and Tom M.
Mitchell, %2Considerations for Microprocessor-Based Terminal
Design%1, 14 pages, November 1978.
STAN-CS-78-697, Walter Gander, %2On the Linear Least Squares Probltraint%1, 120 pages, November 1978.
STAN-CS-78-698, Richard E. Sweet (Thesis), %2Empirical Estimates of
Program Entropy%1, 167 pages, November 1978.
STAN-CS-78-699 (HPP-78-23, AD-A068 539), James Bennett, Lewis Creary,
Robert Englemore and Robert Melosh, %2SACMN: A Knowledge-Based
Consultant for Structural Analysis%1, 65 pages, September 1978&
α
%3REPORTS 700 THRU 7drJb~(~∃')¬≤[π&4npJn@`@@@!⊃! Z\pZdp0@Aβλ5α`lp@@df@RX@AIKSH@A∂Ce→SKYHA'[SQP~∀@@@@QQQKgSLRX@@∀eαA
IC[Ko=eV@A→←dA↓I←EYK4@A'←1mS]N↓S\@A∧A SgQaSEkQKH~∀@@@AAe←GKMgSMN↓ ]mSI←][K9hJbXbb`AACGKf0A KG∃[EKdbrnp8~∀
∃M)β≤[
&Znr4n`bX↓≠SiG A_A≠=IKX@!)QKg%fRX@∀e≠←]%iWeS9N@A'egiKZ↓¬KQCYS←d~(@@@@↓S\@A∧Aπ←[AYKp@↓π←[aUiCiS=]CXA∃]mSe=][K]PJbX@bpr@↓aCOKLXA∃C9kCer4∀@@@@brnd\~∀~)')β≤5π&ZndZn`d0A3←gMRA'Q%YWCG X@Je¬\A≡Q8@JhT∀d@A∪1←O<e$RA≠CaS[kZ5
Y←n4∀@@@AβYO=eSiQ4JbX@LfAaC≥KfXA)C]kCIr@br\r\
∀4∃')β8[π&Z\rZn`L@Qβλ5α`lp@ddp$XA¬K9OhAβMamCXAC]H↓3←gg$@A'Q%YP∨π≡A1↓∃∀λ4)↓α↓↓αC|cg;?nKπ1↓¬#'7∃ααπ3∨⎇∪'S#j↓↓β≠⎇⊃↓αO|c[';8↓αOg∨#↔7Mα↓β?→αα3';. H4)α↓↓↓αNs↔GW∞c'S'/→↓α←O#!↓α';=α[∂∪'π d+@~α
W∩α ≥f/∂\≥FO'∀V∩bαε&Rπε≤|W~`Q$ααα∧ &∞w\≡'Jβ↔⊗sJpQ!PU≥H→bl≥5VsJkvεBααλ_Bl εgαβ∪6!∩bα
-vf∞l@∧
r∧
7>.↑EBα+(∀α¬∨↑.f/J∧
v2πM PhR∧∧αα¬>L↔&*∧
v"α
=v7'|≡&*α mw∩α
↔↔&≤≥Bα∧M≤f6/,]g&N≥Dα∧/≡\↔&N⎇n2+
Dε3λh$∧ααα∞ ⊗>/5D∧V∞n\↔↔Jε∪∪;JaQ hU:H∀rl:5S;JVvβ*b∧∧¬⊗},↑'"α∧ F/>≡4ααE<=w"J∧∧∧'↔≡<F∞fUDαα∧→→∩αα
Mε/≡≡5∩`h$∧ααα∧V$>.lZ&∞f∨,V"α
mw⊗}my∩∧&≤≤w⊗∞↑4αε∞lD∧>.⎇\W'⊗≤4α¬≡\≡&≡F≥lr+
Dε∪K0Q$ααα∧∞ε∞≡↑5B∧V≥nV∂↔∀ε∪K;∃aPPh*:D rX:2k;∃Vsβ2D∧∧2r∧λg⊗∞l9↔
α∧ ⊗∞zD∧α+∀},↔εB∧ε"lO=⎇V␈↔
↔≡j∧∧εO~∧ eαhQ$ααα∧λ6}o
HW&*V∃Bβ $∞ε∞≡↑5B∧V≥nV∂↔∀ε∪K;∃aPPh*:D rX:2k;∃Vsβ:Dλ6G⊗≡4α¬6≥d¬ ?:h_-lλλ⊃
⎇X;→∧λ+H∩mn=~β∧∧ ,P$
≤[yn,8εvt[3FE⊂λ⊂⊂⊂ [2⊂(9≠q62vKiwv;~w3P)Yvpw0\∩XV⊂∞→P80Yp¬s, Jafuapy !djr\~(~∃' ¬≤[π&4h
e5;↓a1α∞s∪K↔8α~R _⊗zB∧∧S∀∞dλ⊗v∞M≡6O~
x D (λ∪,]9|↑$λ9≠≠l<=~;ma"Hλ∧∧λ∀p⊃Z2rrP→5y⊂$[x62vYw:4w→P)z0XuyRXK⊂_\≤0sriK⊂%0w≥py<P \[\WβE
STAN-CS-78-709 (AD-A068 231), Mark R. Bpkwn afd↓%WEKIh@A
8A)Ce)C\X~(@@@@Je KMSO\@↓C]H@↓β]CYecSf@↓←LABα↓αβπ& ↓αO'∪W∂S,ε&*α h n⊂)2x≤2yr`.tifg
λ Sorted LInes%1, 50 pages, DeCembeR 1978,∧∩∀~)')β≤5β&ZndZfb`@@Qβ⊂[α`l`@@@dD`RX@A→Y←eH@@@↓)eKM∃iQK\αa↓↓↓+∩;G7,ε&N≡≥APRα∧∧α∧≡⎇↑π/&≡M⊗}r∧
v $λ≥~ Tλ∀p⊃Z;pq= at94\z7s#→v⊂⊂*≤0w9s≠y2pz~ww∩XK⊂⊂~2
pages$ 1979.
λ
∃'Qβ≤[πLZnpZ\bbXAQ←ZA≠%GQCKαaα7π&≠#↔3b↓"S#/≠'M¬b↓∃J[-∪G'∨p↓αOC∞≠↔Miααπ84R↓↓↓↓∧ CCK} ∂!β&yα∂?v≠↔CQ∧c↔πKvK;≥∃
a↓IE2βCπ∨-→1α∪,≠↔7 -⊃↓Ee;A0⊂H!Q%≥$→aT≥~Tw∩k≠⊗$ααD_@ (⊗
N⊂λ→\YTK⊂⊂"7[0r2⊃Tε Knuth, %2The Errata of
Computer Programei@9NJbXjpAa¬O@↔Mbα+π;. Ke↓ IUe8hP0$!Q hU8H∀rl:5S+JVv∪~bλ|Vv*∧λv}g\!B¬∨LZεF.d f∂≡∧∧ε∞vDλ6F∂-HW4∃X;D∧∪≠p-eλ ,H⊃ Hλ∧∧λ∩→.≡y;XL↑Yk4l=≥<@ \=~≠lD→[p→λ:42P∀97q6→vP lλ∃P$!λ≤P!RLT⊂~Xλ80sr\TεE⊂λ⊂⊂⊂%_w:py≡P_\[NWαEεB)j g aiV[NV[XZλ⊂∀!iS⊗j'εLY_∀Vλ⊂#2i≠0s27H⊂!py]0p∞e@⊃BP⊃↓∧3K↔∪-∪'∂-ααπ#?:`4)↓α↓↓αC,εF/∩ o⊗*bλL⊗r¬=H ,≡≠|H ≥Yλ⊃m≥h∃z,\→<Z
⎇→ λ∧VT⊂qIZU∞H∧λ(⊃Sn890w FE⊂⊂λ⊂⊂:7KP(1gY2P*9_w9v ]7y∩XK⊂%0w≥py<P \[\WβE
STAN-CS-79-715 (CSL-TN-161)(λA¬IK]h@↓(\A⊃¬SYaKI\AC]⊂A¬ekα≠∃↓αbqα#''≠?90hQ↓↓↓α↓∃JMk απK≡C'S↔≤εG/⊗T V∞w\≥B+
D &∞w\≡'Jβ↔⊗sJpQ!PU≥H→bl≥5VsJkv⊗bαD→→Rk≠&%∩b∧]_6F∞]D∧>.},v.6eDα+∀∀λg⊗∞\↑v␈⊗4 f␈∩λ=vw'-⎇@hR∧∧ααε≥d¬π⊗|NV∨&≥⎇b¬∨≤>F.o4V∩bβ6Tπε∞|↑2b∧,≥g.∂/∀β Kw∃`hPQ*5$ eX5~kw∃S; t∧αD →US≠∪E∃Bα¬-|&/↔D∧∧≡∂.Nw⊗N⎇∞Bαε≥lBαα -vFr∧ V≤≡≡.FGJAQ"αα∧∧α+∃,\7/↔=~f*¬∞-v?⊗≥↑2ε∂4λg.v>M⊗}w4
⊗rε∀λfO↔>D∧␈⊗L↑"α¬M V␈↔∀V∩bβ6!PRα∧∧απε≤|W~b \↔⊗≡∧ε∪K;∃aPPh*:D rX:2k;∃Vs B¬λ∀LjV6#~JD
6F∞
≤B∧o]*F∞⊗∀ ⊗v"
-vr∧⎇⎇F&n≥eBα+(→B¬/<↑'~8Q$ααα∧ V∞w\≥B+
Dε∪≠2∞ ⊗>/5D∧V∞n\↔↔Jε↔∪;JaQ hU:H∀rl:5S;JVv∪Jb
W'&↑$∧⊗V}.7&∞EDα∧>↑-W.vDλF∞FN≡VO∨D ⊗v"∧λW⊗N4λw⊗␈><R`h$∧ααα∧V$/GN,↔ε}L≡FN}d
v2αλ≡7No∞Mw&N4λWGε≥n6N}n4αε↔∀ ∩α∧]|FN6≤\B∧∞≡M6.pQ$ααα∧∧S6"V+c∩lm}&o.L∀S
bεVBπε≤|W~bλlV↔↔\≡'Jβ↔⊗sJpQ!PU≥H→bl≥5VsJkv&αb¬%dαα∧⎇Mw>Nn=6Jb∧V$}r∧λw⊗ND wπ&≥]↔V∂M≥vrα mw∩∧-}Vv&≡/⊂hR∧∧αα¬l≥G.*
∞&}⊗L]W~+∃Dβ∪∩∞ ⊗>/5D∧6...V∂↔∀ε∪K;∃aPPh*:D rX:2k;∃Vs∪
Dλ⊗v',↑r∧~d ⊗∞z ≥f"∧ed∧7⊗≥l6/~ ≤⊗zb∧V$}rλl↔.gEZF}f↑,⊗w Q$ααα∧ f/'⎇}&←~ mw∩¬=}'&NltS
bε&απε≤|W~bλlV↔↔\≡'Jβ↔⊗sJpQ!PU≥H→bl≥5VsJkv&"αD_ET βvDββ;u∃B∧>≥t¬>N\LW⊗F⎇LBε∞lD¬⊗∞\←"α∧]ETn∂>-∩bαV(⊂hR∧∧αα¬>N'.∨N↑&∞b ]v&.D f␈∩λL↔&∞,≡6*¬?≡7&.↑4S
βVtπε∞|↑2b∧\≡&≡Bε↔∪;JaQ hU:H∀rl:5S;JVv#~αλ_Bl εvBββve∩b∧\Nv∂⊗D αr¬=
w↔&M≤f6*Dλ'↔.<T∧:rλ.V≡F≥l⊗ph$∧ααα ≥f"∧\Nv∂⊗D∧∧
rλlVN>]l&∂.UDαα+)=f␈>L\F>*λ]f>Nl\W⊗Nltαε6}$∧n.M≤6∞`Q$ααα∧λF.≡≡=⊗}r \⊗↑Nlw"αε∀∞&/6≤↑rαε|dε≡}↑∞W&/%\&∂≡\Dαε≡M≥fN≡≥Dε&.=≡6N}aQ"αα∧∧ε∞NN4S
bεV"πε≤|W~bλlV↔↔\≡'Jβ↔⊗sJpQ!PU≥H→bl≥5VsJkv&BαD→→Rk≠&U∩bα -vFr \4≡∂.MπJb∧∧S∀6≡.7"∧},F/∩∧
FF.}-⊗/~
|`hR∧∧αα∧≥lFO6≤NV∞bλ=vv≡↑∞G~ε≥lB¬π-}ε␈≡≡M⊗}w4V∩bβ↔∀πε∞|↑2b∧\≡&≡Bε↔∪;JaQ hU:H∀rl:5S;JVv#*α¬λ∀LjV6#2b∧λ∀"l⊗εs
βF&2Jb∧ &}Fd∧∧n≤<≡'&G∃Dα+∀≡<7⊗N-≥f8h$∧ααα \Vw&≥D¬∂.≥M↔&N↑4π&z \⊗≡F≥lW~+∃Dβ∪*∞ ⊗>/5D∧n∂,=αβ ⊗w∩ph!Q%≥$→eT≥~Vw∩k;&eBα∧≥lG⊗/t∧∧≡F∃X6FN∧∧¬N∞uDαα+(≥bα∧≥l⊗gO=≡2αε|dααF¬M2fb∃QPRα∧∧α¬≡ ]Fg≡}.B+
DεS*π ≤v/~D V∂⊗=∧β Kw∃`hP`h!Q hU:H∀rl:5S;JVv#:α¬λ∀LjV6#:JD∧¬⊗},↑'"αλ]FfN}Dα∧6≥MV∞r∧∧αE& ↑6O~∃Dαα+*Mε(h$∧ααα ≥g&/,≤7&N⎇dαε}d v↔≡↑.f∂&≥⎇bαε≥lB∧NllW⊗.l<R+
D∧β∪≠T∧πε∞|↑2b∧\≡&≡@Q$ααα∧ε∪K;∃aPPh*:D rX:2k;∃Vs∪BD∧¬N␈>=∩¬≡
≥F}∞=¬BααV*VvN⎇eTn.\,W∩∧≥Lv␈⊗≡Mεo~∧ f␈∩ mvrhQ$ααα∧λFO≡-⎇⊗w"
<W'~V∃Bβ $∞ε∞>↑5B∧V≥nV∂↔∀ε∪K;∃aPPh*:D rX:2k;∃Vs∪J∧¬∧ "X⊗β3B∧ε#∪J∃Dα¬⊗|,W↔"∧λVv',Tα¬&≡-&∞rD∧α+∀∀∧¬.v≤m⊗. Q$ααα∧λ↔ππ-|⊗≡B∞Mr¬ε≡Mα¬π-|&f.↑4S
bεF2πε≤|W~bλ≡π⊗NDε∪K;∃aPPH*:D rX:2k;∃Rs≠αDλg⊗∞m4∧jromputer¬
Science, 1965-1958%1 238pages.
STAN-CS-'9-73! (PVG-11, AD-A071 900), D.C* Luckham, S.M. Gerh C\↓ ].\4∀@@@AmO\↓⊃K]W∀XA$]∧\A↔CI`XA 9.TA≠%YP≠∃bα⊃:
rα7CC,q1α]p∧¬ε↑L≥2bε≥lB¬:iE`hR∧∧αα¬<9ε/⊗M≡2bαT*7&∞βYP↔\2⊂( Ta`f⊂∃2y4s~py⊂*\ry⊂&Xw:pv XV⊂ \94v⊂ \[\WβE
STAN-CS-79-732, Donald R. Woods$ %2Notes on Introductory
Combinatorics%1, 120 pages( April 1979.
STAN-CS-79-↔33, Andrew Chi-Chih Yao, %2A Lower Bound to Finding
ConveX Hulls%1, 22 pagas, April 1979.
STAN-CS-79-734 (AD-A074 079), Robert Endre Tarjan, %2Fast Algorithms
forSolving Path Problems%1, 49 pages, April 1979.
STAN-CS-79-735, J. H. Wiliifson, %2Kronecker's Canonical FoRm and the
QR Algorithm%1, 23 pages, ApRil 1959.
STAN-CS-79-736, J. H. Wilkinson, %2NoTe onthe Ppactical SigniFicance
of the DrazIn Inverse%1(λ@d@AaCO∃fPAβAeSX@Drnr\4∀∩∃'Qβ≤[πLZnrZβ9M]1∧ ;∪K/9α
9ααgπ=∧∧⊗v"λebα∧n,⊗v≡↑4¬N∞uDα+∀⎇`π&FTλ↔6/,≤v*hQ$ααα∧ 6∂≡Tλ6}o
HWFOO∀αε↑d
6.f\8
≥Yh≥
(λ~e↑~λ⊂L↑⎇ ,%D
(∧∞_9y.∃α⊂ x≤4vεEλ⊂⊂⊂⊂ \[\WβE
STAN-CS-79-738 (SU32⊗ P3 -65), Ra`≥I¬YPA→∃( ↔G,∧Rb∧|Z&o.l@λλL8∧6 1uist↓C]H~(@@@@↓ CL@↓β]Ie∃JX@@∀eπ←[AkiCI%←]fAIKYCI∃H@Ai<@A∞[MiCESαc'SEαβ? αd¬⊗v.≤!PBα∧∧α∧o]H
≡⎇→4∧ 9=~
|≤i,%D M`∞ 9y<eD⊂εp|H_X[\Kα α
SPAN
AS-'dZff@J↓""BαiP≠JV∩Bb∧_ET βv@ββ;U∃B∧Rd
"`$λλ∀.]8π6 !n, %2IndeCtign
Ove@HA→CE≥JA CQBA¬CMKfJbαa↓E@∀λ ≤βryVλ&p|P \[\WβE
STAN-CS(
nr4j`⊃Aα↓"BZ8iEI%bαI9↓¬→1α∂∂∪S@?-_ m∞λλ⊂-lλ⊃βD∧⊂k@⊂λ'x8"[⊗⊂∩Y∃42FEλ⊂⊂⊂⊂∪4πgi@ AP∨→∧ 3'π≤¬⊗v:T⊂ ∧εMλ⊂__pπes, May 1979.
~∃M)β≤[
&P∃]Ji]@#∃Dα∧g≥H $∧⊂∧0y≠v2⊂⊂∀0ryt_{P⊂∀∃42y`)pεRX@Je
←β∪7π∪MS';≥αβS#∀hQ↓↓↓ααπ;πeK@≡O4 v $⊂;⊃m}X∧p∀hms%!0@bdf↓aCOKLXA¬K9J@br\r\4P0 (αC"AQTq⊂)e0pk&W+)eε$λ∩∀
¬-n+&⊗Kλ⊂(E0,
fD `≤
T∧ Anne Gardne@HX@@JI⊃C@;&∪??-∧{⊂⊂@ Hλ∧∧λ⊂<NM9Z0⊃Zpp Inpel@1SGK]
Jt@AMKCeG JbX@D``Aa¬O@↔Mbα+W≠*β1e]Jp4(Q*5$ eX5~Kw∃S; h
λ→3+,f'λ+λ .8;@λ8p neq( %←iCf@QQQKgSβ→%!↓+∩≡>εcQ↓α¬∧;?π⊂hQ↓↓↓αα7K≤Yg&.Dλ6}n\≥f"∧L≥f?.≤|Rε6} λ ≥]→4L≤⎇~5LTλ∀⊂→≠ws⊂![w9z9≥qz4g[∩XVεB⊂⊂⊂⊂λ_[ZP≤0sriK⊂%:w→P_\[NWαEεB)j g aiV[NV[Z~λ⊂∀!iS⊗j)⊗LYY⊗⊂λ⊂ b⊗PX≠ZPλ→≠≤), HectoR Garcia-Molina
(Thesis), %"Performanc@∀AWLAUaICi∀AβYO=eSiQ5bAM←β⊃αK↔εc'∂π&+⊃α∪∂#∧4 α↓↓↓βNqβ¬α&KOSKN∪WS↔ ∧∧&∂L≤&∂≡TV∩bβ6 ∧∞_9y.5λ∩]-l( &&w+C"AQTu⊂)e0tk&w+-mεT
⊂1¬X,
eDεMMα%Dλ∃~
⎇8<h L9Yx.\<H
M→<z.∃+λλ∧VU<≤ ↑H_;LA"Hλ∧∧λ∪≠n|<Hλλ-⎇;Y∞4≠{H∧
~;9%Z|_8lT∃≤X,L;yYN∀λ~;D (λ∀ \X[→$∧⊃x;,T,+λπεC"H∧∧λλ≤ ≤y<k∧ ];≡$ε.-n%a"C"J:⊂3K(:k-n%Vm
K∧λ;_;D∧⊂[|Mm;Y`¬
~→<m≡j+λ∧∧,U~
≥Ys_,$ +(∧λ(⊂{mn⎇≤X-≥] #!$λλλ∧ |Z9-n→9λ
=;=; ≡~;{D _8[n,=≠|O∀,+λε⊗∞(≤ ≤y<k∧ ];≡$ε.-n%a"C"J:⊂3K(:k-n%Vm
h¬λ23+&6N+λ∧λ1 0&εmH∞εvJ+λ∧λ_=Z,D⊃+H∧∧∃z;
=;\h¬
~→<m≡j+β!$λλλ∧∧,U<m≥Yhλ
=≥→.-\hλ ≥Yλλ
_;\d∧≥≠h∧
{{≥LTλ∀≤M|[→;.4λ_;LDλ⊂{mn≤[{↓QHλλ∧∧∀y8.,z ,%D MM∧∞_9y.5λ∩]-l( .&w+C"AQTu⊂)e0tk&w+-mπ∧
⊂1¬X,
m$εmmJ%D⊃_=M≤λ⊗+D +H⊗.]H_;LD⊃\Y,Dλ⊃kDλ⎇<⎇ ≡\{{EA"Hλ∧∧λ ,Hl<⎇λλ≥→{|M≡~≠<d [|H∧
{{≥M≥Yh∃
|<≠~.OH∀}.>→;(
|Hλ⊃.≡8=~-⎇\h_-lβ"H∧∧λλ⊃M≥Y~;Lt∀X=
≥{X;∧ ;]→..≠{_-n≤i,%D∞(≤ ≤y<k∧ ];≡$ε.-n%a"C"J:⊂3K(:k-n%Vm∞(¬ ∀∀ &w+,-e∃λ∃z-M~8;$∧⊂{_-ly>+∧ X;9.4⊂Y;Ml=≥λ∧ ;Yλ
=;β!$λλλ∧λ{z→-eλλ &(<≤≠
≤x=~-⎇\k3n-9;] \λλ⊂)∀λ∀Y.<8<XmπHλλλ\≥8x.M;{I&∃λ
L↓QHλλ∧∧≤_9l↑kλ∩N]≡( '⊗n+C!!"Tuλ→K0teVn+-fVλλ
λ_ 0,εv(λλε⊗l*+∧∧∀→5 ↑Hλλλ|8|h∧ ;Yλ∧∧∪_<o-≠hλ M⎇X<o%β"H∧∧λλ &)z_8m
8;In4⊂;→m}Z=~
T→[|D ~;Y,≡H∀≤M||X;-];Yi&∃λ ,D∧≤_9l↑kλ∩N]≡#"D∧λλλε↔-n+AQC"TjH3K0j5-n+&v,(
λ→3+,f6
+λ∧ [z_.$∪8;Ml(_;LDλ⊂;-≡H∀≠N\9~+∧∧ ,U
(∪;lL;β"D∧λλλ Myz8d
yH∀∞-y|X-↑i,+∧εmH≤ ≤y<k∧
y<∃ ]8Y4Dε.-n%a"C"J:⊂3K(:k-n%Vm,K∧∧∪:0m 9;λ∧∧∪≠xm≥_<]∧∧∪⎇Y.∞≠{@∧∧
∃~ ↑z<j%Dλ ,J∞[zY,>→9β!$λλλ∧ _9|L≥Yz8-dλλ⊂-L{|Z.M≠<h∧ [|H∧∧∪[p↔≠4w2`\⊂⊂&t[4vp|λ⊂⊂0w→⊂⊂∩`[∩YXCE⊂⊂⊂λ⊂'x:~vt⎇ ]4ww∩LT⊂_[
⊂80sYyV⊂%≥v<P_N[\WεB∧E)j⊂g⊗aiK[\VKMYV⊂ [292{H!t4VPt4t⊗pwV⊂ Y)t7]v2⊂*_q62yH!2P)[y:2r∂RXV⊂ [εE⊂λ⊂⊂⊂8_qryVλ%:v<H_\[\KεEεE∀j g⊗PiV[\K[ZZ⊂
$((⊗M\VY_K⊂ b⊗PX≠[⊂∞≠YTVλ w72H#py2≠2y⊗⊂∩0vriH"0s4Y9wwεB⊂⊂⊂⊂λ0s2λ*2y9≡P⊂+t[7sy0Y⊗⊂⊂∩L'0z:\0r⊂⊂∪0w3zXsrP⊂∃w22y≤z0w2~w3RXK⊂_X_βE⊂⊂⊂λ⊂80sYyV⊂%≥v<P_N[\WεBβεAεEβE)j S⊗aiVM\V[ZMP⊂⊂∀⊂dfVYLXTV⊂λ⊂"v0Zw2P⊂λ%pw:λ⊂⊂∀*~2ytiJV⊂⊂∩L"s34Xtrw1↑FE⊂⊂λ⊂⊂!w[9tr2\0z4w[9P⊂⊂~w⊂⊂⊂∀97sy_vP⊂⊂∀|w:4→yty]λ⊂⊂ Pλ⊂%w7]v2r3YVa0yYrεE⊂λ⊂⊂⊂ \897pXt∩XVλ_[_⊂≤0sryK⊂%:v≡P_\[NWαEεB)j g aiV[NV[Z[λ∀$ ⊂P-79-∩2, AD-A07⊗ 875), Jam` fALXA¬K9]Kihαa↓α ↔+∂¬α8p4)↓α↓↓α ,≠#πl≥bbαλ ↔.b∧
"rα∧λ6}F]`λ∧ 8π2λ!94j≡⊂⊂#$\βher %2Applicatigns-
α ORianted AI Rese@¬aGPt↓'GSK9GJAC9HA CQQKKCQSGfJDX@bb@AaCO∃bPA∃UYr4R↓↓↓↓β e]eph($*≥"ε96≥→5]ei9U]↓DBBA∃αw∩k∪5D∧ "X⊗β;*∧@ ε%+λ∃M≤⎇≠tDλKHλλ=→<z,]≤zz%D∩X;,↑c"H∧∧λλ∀edλλ⊂L]YY0~≥⊂⊂0w→⊂⊂(0]v⊂⊂) ⊂⊂⊂![t2w, %"Applications-Oriented AI
Rese@¬aGPt↓≠KIS
S]JJDX@h`↓aCOKLXA¬K1r@br\r\4Ph ∃≥H→bl≥5P
g∃-m.∧¬⊂⊂λ( [\V@24, AD-A0'X@pnhαI1αK|∪↔KQ∧+3O∂Fcπ>↑ λ∧ 8π2 Jh∂eO∀~∀@@@A!Q%YP∪'∧ε2bαT∧P.↑≠{8.M8h∀∞
βsp∩ammang%1, 100 p@¬K@↔Mbα+GM∀β Kw∃`hPβ"TjH3K0j5-n+&V,(
∀ ≠NTY~TK⊂⊂ v_ts⊂!≠w32`4, %2ScheMa( 'Q%H Aα≤εG,=→1m≤αyFEλ⊂⊂⊂⊂→5y⊂⊂∃w22`2pπiC]⊃S]NAMiekGβ#WK↔ ∧α¬&←∞G4~;@⊂λ'0z:\0p La`≥OUCGJJDX@h`4⊂@@@AaCO∃fP⊃αW+3e↓λπ∪ 7+C"AQTp
S⊗aiVM\VS[ ⊗⊂!↔λ⊂"↔ Grahae, A* C. Yao and F. F. Yag, %2Some
α Monotonicity ProPerti@∃`
β?2αCπK&Kπ1α⎇∪∪↔K~)E "ε $∞_9y.T⊂!`%ppember~∀@@@@Drnr\4⊂⊂∀
≥"ε96≥→5]ehεs &(
⊂(E0,∞εD λ@_JT∧ DouglapεA∧\α↓α←↔≥!1↓↓+∩∨?O≤¬↔εNβY`⊂∃βithout
Dupli@
CiJAQ` π≠≡k'OOL¬vw~T⊃Bβ:∞λ⊗><kλ
<<≥→-\Y<@⊂ \[\WβE
STAN-CS)79-522 (AIM-LfdXA¬λ[α``f@ddβI% "λMvv∞β→⊂⊃Tε Knuth, %2METAFONT, a
pπsgi∃ZAM←β⊃βπL∧∩ ≤Y=⊂→2yt`'n!1, 110 @AC@∨↔~aαO↔∧εF.n,X Dε,∧[\Kαλ
∧~)'!β≤αj≥~T¬`≤KXπ6 &Qβλ[∧`nl@`h
@2∃Dα∧ε|X mL<h⊂E@⊂⊂#r\βt _@∀eα@AMs[@7,εG-8h⊂m 8∧wεBα @ KGα{7C?α9↔&N⎇`λ
|β⊂&∀
⊗7∀RLT∧ "β)βCπ>+@~@λ⊂p∩\8∧ember "βIP≠JaQ hU8¬⊂)@⊗aaVMβ9- .β1Q1α∞s∪K↔8∧∧=~+0m
8∧⊂,XwP %2On @QQJA %[@∃6≤εε∞≡T
G,9→0↔Yαf f@=`λ (αHλ∧∧es,
September1979.
~∃M)β≤[
&Znr4nll@Q'*fHl@A L`Zlr$X@A∀8@A↔CUigWrAC]HA≤\@A⊗\@↓≥SGQ=YfX~(@@@@Je cUSISgQeSEkQS]N@A≠Kg!Kf@@↓oSiP@Aπ←9gieC%]ifJDX@@@Hn@Aa¬OKfX4∀@@@A'KaQK[EKH@brnd\~∀~)')β≤5π&ZndZnln0@AπQ¬eYKfA-C\A→←C8X@@JI∨\@AMiKoCIhOf@↓'S]OUYCdAYCYkJ4∀@@@A KG=[a←g%iS←\↓M←d@↓!Cei%iS←]∃HA∨eQQ←O←9CXA≠¬ieSG∃fJbX@bnAACOKf0~∀@@@A'KAiK[E∃d@br\r\~∀_∩(hP4*N$
96∞~iaA5;1a1αε+S↔I∧;π∂Mε ;⊃αd+?;' α¬)αd+['9b↓∃J∂∂+Oπ⊃αα;↔S>{K/Mε{84)α↓↓↓α>CπQαO→β¬α&+S↔KnK;'O&K
α∂}kCGS∂#'?9z)E!↓∪↓βCπ>+M1α}≠S/ -⊃↓EeC↓84(hRNRεrj∞M5;I5]YJ↓↓↓" !6¬AA→↓↓Q≠⊃%!↓αα←'3dKπ5↓∧S?#9α↓α∂3∞s∂↔eα↓"S#/≠'M%`h)↓↓α↓↓∃J'∪π;O4∧Wαα
|bαα
.Vf*T∧∧⊗∂<\Bααλ←πε/.M↔≡
∧
FG⊗}\vBα∧ ∩α¬NZF␈⊗≤≥@hR∧∧αα∧M≤⊗f}}\R+
DεC3∩∞ ⊗>/5D¬≡/∞LVn⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;∧∧αE¬huS ~∃Dα∧&↑,VZ∧5dα∧␈∞ Vrb∧∧S∃π,↑G'J∧
π⊗NnM⊗v:V∃Bβ∪↓Q"αα∧∧πε∞|↑2b∧|>F}⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;∀¬∧E¬¬VsJk'∃∩b¬ ↑F/∩λUb∧7-≤V&f≥lBαα
Mε/≡≡5∩bαV)6v␈⎇LF>*QQ"αα∧∧∧⊗∂<\Bα∧←∞ε/⊗≥\Vw"∧λF/≡≤⎇bεNd∧∧n}L\7.f≡$α∧>]lW&N>4S
b∧ε∪≠:∞ ⊗>/5APRα∧∧α∧∂\}W∨"ε↔∪;JaQ hU:H∀rl:5S;JVvs∩α¬λ∀LjV63~bλ_Bl πεbαβVεBJbλ.&N∞d∧¬αr∧∧∧n≤>]f*α
Mε/≡≡5∩`h$∧ααα∧V$↔.≥LFNvt∧α¬π-|w⊗∞T∧α∧n|LVg~∧∧∧Nv>,Vn.nL⊗fg∀∧ααεn-vjα∧ ⊗v6}-V∞`Q$ααα∧λF/≡>-↔π&≥⎇g~+∃Dβ #d∞ε∞>↑5B∧}>Mv⊗/$ε∪K;∃aPPh*:D rX:2k;∃Vs;~∧¬∧ "X⊗βC~∧ε∪;α∃D¬&}o∀α∧2d∧α∧≡ ≥bb∧|]f*α ¬bααλ⎇vg.$ ⊗v Q$ααα∧
&∞vL≥B∧Rd∧∧f-l↑↔.*D∧S∃/ L↔&Nlt∧6␈-↑Vf∞T ⊗v" ∀¬ε∞≡.vO≡Tλ⊗f>}-↔&FQQ"αα∧∧ε6␈$λ6}o∞↑FNvt
6∞o
LR¬6≡-⊗∞v<↑2+
Dε∪Jπ ≤v/~D f␈6]\&/∩ε↔∪;JaQ hU:H∀rl:5S;JVvs"αλ_Bl πε2β ⊗5∩b∧|]f*α ¬b∧>⎇NV∩ε≥lB¬⊗|,W↔"∧ "r¬
LVnn⎇n2`h$∧ααα∧V$f∂,|R¬≡<≥F*αλ|V}&↑M⊗~∧L\↔∨"∧
7∂.≡,W~∧≤M'/∨M\Vw"∧ 'J∧M≡7≡.>M⊗}pQ$ααα∧ ⊗v" }'&F|⎇vv∞DλF.≡⎇↑ε␈≡≡M⊗}rV∃Bβ≠4∞ε∞>↑5B∧v}lVn⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;T¬∧ "X⊗βC~ε'βBJD
ε/↔=∀∧&N≤=vvO4 ⊗v"
-vv∞LD∧?⊗≥ ⊗jb∧V%&FQQ"αα∧∧∧∞v≥O↔≡O4
v2¬<↑↔..nM⊗∞bλ←πε/-≥V.wN4π>OM∧∧6.\L&∞≡4∧π&z
>V⊗V\>G~+∃APRα∧∧αβ#∧∞ε∞>↑5B∧v}lVn⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;d∧αE&
≡2πε≡ W∩α∞>Wε/.<V&/4
5$ eX5~kw∃S;+∧∧ε↔J∧ F␈6≡4ε∞vAQ"αα∧∧∧>∞>5∩b∧,]f?"λ≡7π6≥MBε∞lD¬⊗N= ↔⊗"λUbα¬>Mvv*D∧S∀↑ ≤6FO≤≥b?~ M⊗v.≡!PRα∧∧α¬π-|w⊗∞]]⊗v:λ≥F>␈-≡FFjV∃Bβ 4∞ε∞>↑5B∧v}lVn⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;t¬∧ "X⊗βC~ε⊗s2JD∧¬∩tEdα∧?,≥ε∞j ≥f"∧ei"t
d∧α¬≡M|⊗v*D∧S∀}aQ"αα∧∧∧≡}n>F∞wD∧¬>.≤⎇π"αλ=v&/4∧ε∞vD∧∧F∂-]vvN}↑2α∧},↔εG4V∩bα∧ε∪:α∞ ⊗>/5APRα∧∧α∧&\<Vn⊗↑$β Kw∃`hPQ*5$ eX5~kw∃S;;∧∧αD EX∪βC4εS;~∃Dα∧&≡m⊗"∧]MFN␈D∧¬≡F≡uBααV(∩∧F≤↑&∂⊗=
⊗≡∞AQ"αα∧∧∧∂∨=|6N∂M≡f*α∧λ↔⊗≡
≡F.∨N↑&*α mw∩α∧∞FF*∧
ε∂⊗≥MF.b∧∧∧/6≥NV∂&≥⎇bαε|aPRα∧∧α¬⊗]L↔&N⎇l⊗bαλ≥F>..,⊗N~λL↔&∞,≡6*α
∞&Nn≡M↔6/4V∩bβVdαπε≤|W~b |7&},↑ hR∧∧ααβ↔⊗sJpQ!PU≥H→bl≥5Wβαkvw∩bα -vF∂$∧∧n∞ml∩αε≥lBα¬-≤6F∂,Dα¬>≥LFNv|↑"bαV*π⊗}-LVn∂M≤0hR∧∧αα∧l\↔'/,↑2αε|d¬π⊗|}&∞n]≥f:α L⊗v?\≤v/≠$∧∧
α
=↔'.≡M⊗}v≥Dααjλ<⊗f∨]NW_h$∧αααλ≡ππ⊗|≤6B+∃Dβ;α∞ ⊗>/5aPP`h!Q hU:H∀rl:5SCαVwβααλ_Bl πεbβ≠W∃∩b∧M⎇f∞fDλRrα =g/&¬Dα+∃M R∧≡⎇↑π/&↑$∧n}L↑&ph$∧αααλl⊗nNO∀ε}2
O↔ε.l≤6/~V⊃Bβ#εdπε∞|↑2b∧,≥g.∂/∀β Kε¬`hPβ"TjH3K0j5-n+&w (λ∧¬∩⊂∀¬Vn+,f¬λλλλ_ 0,εw∞(λπ⊗
+∧∧λ∩[ml=~_-dλλ∩Edλ∩z-lkβ"D∧λλλ∧VQ>≤
M|Z;LTλ≥~ T∃<q$∧≠yHλM{8:-dλ∩{M}{→9 |(→Sn$λ∀=,↑↑(∀∞-xy4n=9Yc!$λλλ∧λ9YZ,=9;Xo∀,+λε&(≤_,|<kλλL8y;,,<H '⊗n+C!!"Tuλ→K0teVn+-gεKλ⊗M⎇_<@∧ 8;[L∀_;Y∧∧⊂;:.$∀≠],]~+λ∧∧,T}-lz≤[mm⎇<h
<z→;,↑c"H∧∧λλ_-lλ∃~ ]<H⊃ \z<z-⎇H∀∀M|[→;.4,+λε6H≤_,|<kC!!"Tuλ→K0teVn+%gεhλ
Qk$&E+λλ
-8z_.,λλ⊂-L9Hλ <<\λ∧∧
∃~ ↑z<j%Dλ ,J∞[⎇Z-lc"H∧∧λλ⊂m⎇X⎇<N ;]λ
?<⎇→-↑h⊂{n92qz XV⊂_MXP80YpyV⊂∪5{2vX2y⊂_N[\WεB∧E)j⊂g⊗aiK\_⊗KN~⊂∀$∀(∩P_0-2), Mark JefFpey Stefik (Thesis), %2Pla`≥]%]N~∀@@@Aβ;'S!∧≠?;O'∪π'≠'→∃E1β⊃MAβε ∨πMbα+π;. Ke↓λπ∪CαaQ hU8H∀rl:5SCαT¬nεTλ⊂∃Hu,-*%D⊃y4L≡Yλ∩∞\=λ⊂⊂[2⊂"2\2uP!K⊂⊂⊂(≤2w⊗⊂ Y"xzXz4ww≤FE⊂⊂λ⊂⊂0w→⊂)2{\4z2P∀:v2yIXV⊂~L⊂80sYyR⊂%_w:py≡P_\\ ↔αEεB)j g aiVL ⊗[\≠λ∀ bεPX≤≤P∞XY∀Vλ"7w0[2⊂"Wλ%w:z~⊗⊂∩Y⊂v3wi~z46yH4w⊂&[p2y7βE⊂⊂⊂λ⊂"pz~2rpz~qyP0[2⊂!g[x:z2\⊂)q`)ence%1(λ@dTAaCO∃fPA∃¬]kCed@brp@\~∀~)')β≤5π&ZP@Znpn0@A⊂](X@A'e[Z@A¬]H@A(]⊂L@↓/SIW%]g←\0@@JEIKCYSMiSFA∃ee←d4∀@@@A¬←k9IfAM=`ABAMS[aYα)αππ>+;[πg+∃βπv!β'S~απOO|≠'πS.!α↔π>+;[↔≤εF␈∩T⊃@hR∧∧ααβ& πε∞|↑2b∧,≥g.∂/∀β K∧¬`hPβ"TjH3K0j5.λ &W∞λλ∧∧
⊂2)U,lm¬Dλλλλ_ 0,πεHλλ∧ε-m
%Dλλλ∧ Yz≠D∧λλ∪,8x8]
∂+β"D∧λλλ∧VPz0→_zvyq\4x:4[w⊂⊂⊗H⊂ P#≠y6P⊂≠s⊂⊂'≠w⊗fw[7z7w~qP⊂)→pywg~w3RXK⊂_ZFB⊂⊂⊂⊂λ80sr\V⊂#2X9:py≡P_\\ ↔εE⊂λ⊂⊂⊂⊂λ⊂⊂⊂⊂λ⊂⊂⊂⊂λ⊂⊂⊂⊂λ∩Yi"T'i*)H≤__⊂∃$)*P∞≤\RXCEαE)U g⊗aTV\_⊗N__⊗⊂⊃5w0v→⊂"W⊂∩w:z4 ⊂∩Y"→qtx4→y4w3H0P⊂&~w2pyλ!ww3\:rw:~pvεEλ⊂⊂⊂⊂⊃w1y<\:4ww XV⊂_L⊂80sYyV⊂ \94v⊂ \\_↔βEαE)U g⊗aTV\_⊗N__P∀⊂b⊗`X∞XP→\
∀V⊂)_vr⎇⊂⊂⎇4⎇⊂⊃v⊗fp\y0P∀∃42yt\TV⊂⊂ Y'w⊂≥42FEλ⊂⊂⊂⊂⊃2ytc[⊗⊂*yYV⊂⊂0[2⊂$w≥2sy0]4ww⊂≠s⊂⊂"_z0P&[r2v9IXV⊂→ ≤⊂⊂8_sryVλ&p|FB⊂⊂⊂⊂λ_\\_ εEεE∀j g⊗PiV\_ \_→⊂
(+#VL[TV⊂∃wv33Xw3P⊂∩2tw=λ(7v0ZP∀*4→ytyTK⊂⊂∩Y∃42wy≡P7sεB⊂⊂⊂⊂λ!wvx~v2y⊂∀x2qtY4qpz~ww⊂0[2⊂+2\4s4qXz4ww XV⊂→∞≤⊂80YryV⊂∪p|P_N\_↔εBεE)j⊂g⊗aiK\_⊗\ →V⊂!Z94yz≠x42yλ%7t7λ⊂+0wλ+|uP
*42yZyTV⊂ Y P⊂∪0w3zXsrP3≠yεE⊂λ⊂⊂⊂*≡x2yr]:4w3H#y0x~4qyRLV⊂~\H80sr\V⊂&p↑P_\\ ↔εEεB)j g aiV\ ⊗\_~λ⊂∀ dSVYY[
V⊂⊂&Xy:4wλ⊂!97[uyP⊂λ∀*42\tyTVλ⊂∩Y"→z2y6Zw4w3CE⊂⊂⊂λ⊂!wy≤2qz7→yyP1≡P*2y]4w3RLV⊂_YMP80sYyV⊂&X|P_\N_↔εEβεEεEβE)j S⊗aiVN_⊗\_
P∀ dSVYY\K⊂⊂ b `X≤XH_≤_TK⊂⊂"7[0v2⊂⊂↔⊂⊂#Yw72y≡P∀*4→ytyTKεE⊂⊂λ⊂⊂∩Y∪wr2v≠4w3P≥42P"[;4y7[6rw:λ7s⊂0[⊂"|8≠7y4w→P+2t~qv2P_<P⊂&Ypw9P≠sεE⊂λ⊂⊂⊂)]2y2wH+4yt[w∩XFλ_ZXP≤0sryK⊂%:w→P_\\ ↔εEεB)j g aiV\ ⊗\_≠ ⊂⊂1<H⊂+tv≠4pvPλ&W⊂⊂⊂wzst≤0w⊗⊂λ%9↔λ∀*42\tyTVλ⊂∩Y'[⊂:42CE⊂⊂⊂λ⊂ x8≤7|4fXz2P⊂∀wv:z~ww⊂⊂λ7s⊂⊂∩<x2i_7v4qH⊂⊂$w~z4pv a7zw→0y<Pλ+0v:YFE⊂⊂λ⊂⊂(9≠q62v\RXV⊂ [[P8_sryVλ%:w2H_\\_ εEεE∀j g⊗PiV\_ \_≠@λ∀ b⊗PX≤XPλ_Y→TK⊂⊂"0]4r⊂⊂∃W⊂⊂&Xz:v0H⊂0w2λ⊂"0w≠ %2Path-Regular Graphs%1, 39 pages, June 1980.
STAN-CS-80-808 (AIM-3370@Aβλ5α`rb@bpf$X@A∃=Q\@A5GπCEQQr@@!!eS]
SaCX4∀@@@A∪]m∃giSO¬i←dR0@A)Q=[Cf@↓¬S]M=eHX@↓ CmS⊂@A→k
SQCZ0@A5←!Cd@A5C]]B0~∀@@@A%S
QCeH↓+KsQICkGPQβgg=GSCi∀A∪]m∃giSO¬i←ef$X@Je CgSF↓%KgK¬eGPA%\~∀@@@AβIiSMS
SCX@↓∪]iK1YSOK9GJAC9H@A
=k]ICQS←]f↓←L@AAe←Oe¬[[S]≤JbX@ nj~∀@@@AACOKf0A≠Crbrp`$\~∀~)')β≤5π&Zp@Zp`r@Qβ∪4ZffpαI1↓αn{K∨πr↓αM9αα?#←␈3?K'}c∃↓↓αBS#↔≡KM%1α↓∃Jπph)↓↓α↓α↔c&+;S'}qβ?→¬≠∂K↔:αS#↔␈∪eβπv!β'S~απCCfK∂πSN{9βSz↓βS#*απWS}kπS'}p4)↓α↓↓β?2α';∪/≠SK'∞aαπO≡+7 3N+M∃Eb↓EaYπβπ∨↔~aαπC⊗K1↓EKAA84Ph*NR q6∞MkAA5a ↓↓"ε"j¬Ae
↓↓EI"I1α)pα7'∂F ↔1↓¬≠S↔↔d)βπ;"απ;∪⊗+]↓α~qαgπz`4)↓α↓↓↓∃∀c?←↔∩α ?Wv#M↓β6{Iβπf;↔ K∞K
α∪.≠'O'}q↓αS⊗+↔M∃
a↓EIαβCπ∨/→1α+.cd4)α↓↓↓↓ IaA8hP4*N$
96∞~iaA5C E↓"¬2≥5EBaαε⊃l AeEβ→EM%bαOS↔6+9α5rα∨↔Kn 91↓+∩π9α/CS↔;&+⊂4)α↓↓↓α≡+7π;&K
α∪.3';'&K?9β}1αCπ≡≠π1β6{IαC⊗{[';:βS#∃∧ O↔v≠∃↓β}1α∂?nk?84R↓↓↓↓¬∪W;SNk∃α↔↔∪?KM+ 1↓U8βCπ∨/→1α+.s∃↓EKAA84Ph*NR q6∞MkAA5a ⊃↓↓↓DBBA5C↓5EQJa↓α↔';πK⊃α↓α¬9α↓α≠↔N;↔; ∂+51↓α)J/;␈;3↔∪>(4)↓α↓↓α↔v;';↔/∪';≥RαS#∃∧ CC3N+⊃↓α≡K∪∃β|1απK&K≠'∂N 1↓αNsS↔3fK∨↔;≡)∃E1β P4)α↓↓↓βε ∨↔MbαO↔C&+7 ↔∩↓EeAαp4(Q*5$ eX5~kε¬SC 4∧αD →US≠#¬∃Bα∧ ≥g~¬ ZF/∩∧ V␈⊗≡lV~α¬
FF/=~2Jb∧V$}↔>L⊗≡fQQ"αα∧∧∧∂6⎇≤F∞v<Tε∞vD∧∧v∂m≤v∂&≥⎇bεNd∧π&FT
&.∞D
v␈⊗LDαε↔∀ ∩α¬<X -≥Yh∀M|[⎇β!$λλλ∧
[⎇Y.$,+λε⊗mλ∀ ≤y<k∧
y<∃ ]8Y<Dε.. ¬a"C"J:⊂3K(:k* ¬W -λ¬ ∀∀ 'ε ,-eD⊂1 (⊗∞,(∧ε-mj%D∩X;M≤y(∀edλ⊂:-=;\h¬
~→<m≡j+β!$λλλ∧∧,T≤M}≠⎇≡. <hλ ≥Yλ∀∞-y≥0nM;{@∧
];⊃.7H⊂(∧ {[⎇mL9→y$
Y<≤L↑y;] ≡~;{AQHλλ∧∧→[p→λ!wvx≥z2y⊂⊂ww9z[:0z4[w9RXK⊂→_~λ80sr\V⊂ zYzyz⊂ \\_↔βEαE)U g⊗aTV\_⊗N_ZP∀∩((⊗\ ⊗X[∀K⊂"r;Xy2⊂$ ⊂)t7\:64s→2V⊂&K"↔⊗⊂λ(4↔" ⊗⊂∩Y∃;wFEλ⊂⊂⊂⊂∀0x2i≤P⊂7gλ&rr4Xpv⊂⊂⊂wvx:]4w3@ -- (1) Medical Cybernetics: The
Chalenges of Clinical Computing, (2) Consulpation Systems foR
Phyqicians: The Role oF Artificial Intelligence Techniques%1, 56
pag` fX↓∃kIrbr`@8~∀_⊂∀!Q hU8¬⊂)e0pk&@\VP_14, Robert D.A¬I@,¬Rb∧UhBrb∧∧S∀∂↑Mvn∂M→f 4λ≥~ Tλ⊂p~≥p∧p∩Aα{⊂⊂@ ¬⊂⊂λ⊂⊂!`,inacAl Hyph∂iQ∃c@↔Mαβ?9↓∧ ↓αSL¬V*L}-⊗.wLX ∧∧⊃_= ∀λ⊂X.pX
The RX
Pp¬P∨+,∧7",+λε⊗H≤⊂⊂Yp¬s, L¬P∨[,¬V⊗/$ε∪K≠∃aP@!αA)j⊂e⊗aiKXπ9-`b`≥D∧α∧V\h N2|P⊂∀qwr:λ⊂⊂ ⊗@%i`∪↔⊂∧ααEM W=<j+∧∧λ ,H≥X;⊗.tyP⊂≠q
Coa`→KMGCHA!CgQSαs∃∃Eb↓EEE∧εε∞y<k∧λ=9⎇.≡λλ ≤N_⊂∞
S@)¬_[πε4p`@5βα∪Bα¬λ∀L@+(mε∃α⊂⊂⊂⊂b∩`H∞XP⊂_N≠P , Wil@1SC@5α↓α3?,¬↔4λ⊂p⊃Z2y6 )pε~∧@@@@QQQKgSβ→% "∧V$/G∞,W>z;p↔λ(97`#e`urepεAC]⊂A!e←α;@⊗∞β(λλL<Z5L≡~;sDV+λ &@\εE⊂λ⊂⊂⊂(_pπes, August !→80 ≤~(~∃'$
96∞~iaA5βε∪Jα∧¬∧ "X∩βK
∧ε∪Cαα+λ∧∧⊂z≤M≡⎇≠t
<Hλλ≥_;@⊂λ⊂#w`Y⊂⊂∀*~2yt`3)
α %2AomputatiOnad Uq` fA=H βSF)α7πvKCWL≡FN}d v $⊃[tM\8ε⊂(≤αkofS%1, 130
Pa`∂Kf0AβkOUgh@bdp`@8hP4*N$
96∞~iaA∃βε#αα
¬αkε¬S∪∩∃D¬.NMI⊗∞j∧
f∞r \Vf@→(
M→<r.∃+λλ∧VP(⊃
⎇8:3EQ Hλ∧∧λ∩;LL<→0↔→2w:⊂λ)xqj→vP*4_z⊂⊂ Zr9P$[⊂⊂!g[9z9:Xz4ww→P!w7]v2r3YTa0yYrεE⊂λ⊂⊂⊂![w9zv≥0z4w[⊂(97Yy0vyIXV⊂_NY⊂80YpyV⊂∩:s2P \X⊂↔βEαE)U g⊗aTV\⊂⊗N→_V⊂⊃5zq6_yP!↔λ+ryzλ0w2⊂y0tsH W⊂⊂∃7{2|K⊂∩Y)Yvtpw≥4qt0Zw9FEλ⊂⊂⊂⊂_w2⊂*[4qt0Zw⊂!w]2y4w→yP⊂$[⊂"4i→qz⊂(≤5r:a]9P7cλ⊂(0y≥4pv⊂∪y22y≤RXVεB⊂⊂⊂⊂λ→_⊂8_qryVλ)rx*→vq2yλ_\\_ ∧EεE∀j g⊗PiV\_ \→→ελ⊂!2w→z⊂ y\;0v&λ⊂⊂*4→ytyTK⊂∩Q"Y34qtYw:⊂⊂⊂v3wi~z46yH37yεB⊂⊂⊂⊂λ1ry:_ts⊂⊂∀pz4yY4pq4[4z<Pλ0s2 Linear Programming Probhems%1, ?
pages$ September 1980.
STAN-CS-80-_23$ David Elliod Shaw (Thesiq), %2Knowledge-Based
Retrieval On a Relational Database Machine%1, 280 pages, August
1980.
¬
STAN-CS-80-824, Tung Yun MeI, %2LCCD, A Language for Chinese
Character DesiGn%1, 63 pages, October 1980.
STAN-CS-80-(25, C. P. Schnorr, %2Refined Analysis and Improvements on
Soma Factoring Algorithis%1, 30 pages, NoVember 1980.
STAN-CS-80-826, GiO Wiederhold, Anne Beetem, and Garrett Short,
%2Database ApProach to Communication iN VLSI Design%1 11 pages,
October 1900.
¬
STAN-CS-80-827, Andrew Chi-Chih Yao, %2On the Paradlel Computation
fkr the Knapsaci Problem¬1( 11 pages, November 1980.
STAN-CS-80-828, Donald E. Knuth and Michael F. Plass, %2Breaking
Paracraphs Intk Lines%1, 66 pages, NoVember 1980.
α
STAN-CS-80-(29, Bengt Aspvall and Frank Liang, %2The DinneR Table
Problem%1, 13 pages, December 1980.
STAN-CS-80-830, David Matula, Yossi Shiloach and Robert Tarjan, %2Two
Linear-Time Algorithms for Five-Coloring a Planar Graph%1, 23
pages, December 1980.
STAN-CS-80-831, Daniel D. K. Sleator (Thesis), %2An O(nmlogn)
Algorithm for Maximum Network Flow%1, 81 pages, December l980.
STAN-CS-80-832, Danny Dolev, %2Scheduling Wide Graphs%1, 43 pages,
December 1980.
STAN-CS-80-833, John Russell Gilbert (Thesis), %2Graph Separator
Theorems and Sparse Gaussian Elimination%1, 104 pages, December
1980.
STAN-CS-80-834, Petter E. Bjorstad (Thesis), %2Numerical Solution of
the Biharmonic Equation%1, 139 pages, December 1980.
STAN-CS-80-835, Eric H. Grosse (Thesis), %2Approximation and
Optimization of Electron Density Maps%1, 118 pages, December
1980.
STAN-CS-81-836, Zohar Manna and Amir Pnueli, %2Temporal Verification
of Concurrent Programs, Part I: The Temporal Framework for
Concurrent Programs%1, 70 pages, January 1981.
STAN-CS-81-837, Bruce G. Buchanan, %2Research on Expert Systems%1, 38
pages, February 1981.
STAN-CS-81-838, Peter Brown, %2Dynamic Program Building%1, 13 pages,
February 1981.
STAN-CS-81-839, Arthur L. Samuel, %2Short Waits%1, 37 pages, February
1981.
STAN-CS-81-840, Donald E. Knuth, %2Verification of Link-Level
Protocols%1, 6 pages, January 1981.
STAN-CS-81-841, Donald E. Knuth, %2Huffman's Algorithm via Algebra%1,
Plans In
Intelligent Teaching Systems%1, 19 pages, November 1980.
STAN-CS-81-843, Zohar Manna and Amir Pnueli, %2Temporal Verification
of Concurrent Programs, Part II: Proving Invariances%1, 30
pages, March 1981
STAN-CS-81-844, Zohar Manna and Amir Pnueli, %2Temporal Verification
of Concurrent Programs, Part III: Proving Eventualities%1, 35
pages, March 1981
STAN-CS-81-845, Zohar Manna and Amir Pnueli, %2Temporal Verification
of Concurrent Programs, Part IV: The Non-temporal
Alternative%1, 45 pages, March 1981
STAN-CS-81-846, Danny Dolev, %2The Byzantine Generals Strike Again%1,
26 pages, March 1981
STAN-CS-81-847, Henry F. Korth, %2The Optimal Locking Problem in a
Directed Acyclic Graph%1, 6 pages, March 1981
STAN-CS-81-848, Chih-sung Tang, %2On the Problem of Inputting Chinese
Characters%1, 9 pages, April 1981
STAN-CS-81-849, Tohru Nishigaki, %2Experiments on the Knee Criterion
in a Multiprogrammed Computer System%1, 28 pages, March 1981
STAN-CS-80-850, Alfred Z. Spector, %2Performing Remote Operations on
a Local Computer Network%1, 23 pages, December 1980
STAN-CS-81-851, Gio Wiederhold, %2Binding in Information
Processing%1, 41 pages, May 1981
STAN-CS-81-852, Jeffrey D. Ullman, %2A View of Directions in
Relational Database Theory%1, 9 pages, May 1981
STAN-CS-81-853, David Maier and Jeffrey D. Ullman, %2Connections in
Acyclic Hypergraphs%1, 10 pages, May 1981
STAN-CS-81-854, D. Dolev and A. C. Yao, %2On the Security of Public
Key Protocols%1, 22 pages, May 1981 STAN-CS-81-855, Zohar Manna
& Richard Waldinger, %2Deductive Synthesis of the Unification
Algorithm%1, 51 pages, June 1981.
STAN-CS-81-856, Richard Paul Gabriel, (Thesis) %2An Organization for
Programs in Fluid Domains%1, 190 pages, June 1981.
STAN-CS-81-857, Jonathan Jay King, (Thesis) %2Query Optimization by
Semantic Reasoning%1, 128 pages, June 1981
STAN-CS-81-858, V.Ya. Pan, %2The Bit Operation Complexity of
Approximate Evaluation of Matrix and Polynomial Products Using
Arithmetic%1, 6 pages, June 1981.
STAN-CS-81-859, V. Ya. Pan, %2The Additive and Logical Complexities
of Linear and Bilinear Arithmetic Algorithms%1, 21 pages, June
1981.
STAN-CS-81-860, Daniel Boley, %2Computing the
Controllability/Observability Decomposition of a Linear Time-
Invariant Dynamic System, A Numerical Approach%1, 81 pages, June
1981.
STAN-CS-81-861, Rodney A. Brooks, (Thesis) %2Symbolic Reasoning Among
3-D Models and 2-D Images%1, 181 pages, June 1981.
STAN-CS-81-862, V. Ya. Pan %2The Lower Bounds on the Additive
Complexity of Bilinear Problems in Terms of Some Algebraic
Quantities%1, 4 pages, June 1981.
STAN-CS-81-863, Donald E. Knuth and Allan A. Miller, %2A Programming
and Problem-Solving Seminar%1, 84 pages, June 1981.
STAN-CS-81-864, Jon Doyle, %2Three Short Essays on Decisions,
Reasons, and Logics%1, 19 pages, June 1981.
STAN-CS-81-865, Chih-sung Tang, %2Toward a Unified Logical Basis for
Programming Languages%1, 21 pages, June 1981.
STAN-CS-81-866, Steven M. German, %2Verifying the Absence of Common
Runtime Errors in Computer Programs%1, 179 pages, June 1981.
STAN-CS-81-867, Luckham, Larsen, Stevenson and von Henke, %2ADAM - An
Ada based Language for Multi-processing%1, 71 pages, June 1981.
STAN-CS-81-868, Donald E. Knuth, %2The Last Whole Errate Catalog%1,
42 pages, July 1981.
STAN-CS-81-869, Carolyn E. Tajnai, %Stanford Computer Science
Comprehensive Examination%1, 225 pages, July 1981.
end.