perm filename LISTIN[BIB,CSR]2 blob sn#373524 filedate 1978-08-14 generic text, type C, neo UTF8
C00001 00001
C00003 00002	.require "lstcmd[bib,csr]" source file
C00004 00003	.once center <<contents>>
C00006 00004	.ONCE CENTER <<introduction>>
C00011 00005	.ONCE CENTER <<1963>>
C00012 00006	.ONCE CENTER <<1964>>
C00016 00007	.ONCE CENTER <<1965>>
C00021 00008	.ONCE CENTER <<1966>>
C00026 00009	.ONCE CENTER <<1967>>
C00033 00010	.ONCE CENTER <<1968>>
C00041 00011	.ONCE CENTER <<1969>>
C00047 00012	.ONCE CENTER <<1970>>
C00059 00013	.ONCE CENTER <<1971>>
C00071 00014	.ONCE CENTER <<1972>>
C00077 00015	.once center <<1976>>
C00091 00016	.ONCE CENTER <<1977>>
C00107 00017	.ONCE CENTER <<1978>>
C00114 00018	.<<appendix - requires the file APPEND[BIB,CSR]>>
C00115 ENDMK
.require "lstcmd[bib,csr]" source file
.EVEN HEADING (%3Computer Science Reports,,%3{PAGE})
.ODD HEADING (%3{PAGE},,%3Computer Science Reports)
.once center <<contents>>
.skip 2
.begin nofill



.ONCE CENTER <<introduction>>

@In the Bibliography which follows, there is a listing for each Computer Science
Department Report published as of the date of this writing.  Each listing contains
the following information:
		1.  The report number(s) *
		2.  The author(s) and whether or not the report
			is a thesis
		3.  The "title" of the report
		4.  The number of pages in the report,
			the month and year it was published,
			and the cost of the report (if any).

* There are up to three numbers given for each listing (i, ii, iii):
	(i)  the "CS" (Computer Science) number is on the left, with  the 
	form being "STAN-CS-yy-nnn", where  "yy" is the last two digits of 
	the  year of publication and "nnn" the report numbers;

	(ii)  any group number (i.e. AIM, TR, DOE, SLAC, etc.) in the middle;

	(iii)  a NTIS stock number (often beginning "AD...")  on the right,
	with the code "NAN" in that slot meaning "not at NTIS".

Special  symbols preceding  the  "CS" number  indicate availability at this writing, 
as follows:
		+ hard copy or microfiche,
		⊗ microfiche only,
		* out-of-stock.

If there is no special symbol, then it is available in hard copy only.

@All Computer Science Reports that are in stock may be requested from:
		Stanford University
		Computer Science Department
		Polya Hall, Room 202
		Stanford, California 94305  U.S.A.

However, Artificial Intelligence Memos (AIM-xxx) should be obtained from the
Artificial Intelligence Laboratory.  Their address is:
		Artificial Intelligence Laboratory
		Attn:  Documentation Services
		Stanford University
		Stanford, California 94305  U.S.A.

@Rising costs and restrictions on the use of research funds for printing reports
have made it necessary to charge for reports at their replacement cost.  By doing 
so, we will be able to reprint popular reports rather than simply declaring them 
"out of print".  Microfiche on the other hand is available free of charge.

@Alternatively, reports that are out-of-stock at Stanford University may be ordered 
(for a nominal fee), in either hard copy or microfiche form, from:
		National Technical Information Service
		P. O. Box 1553
		Springfield, Virginia 22161

If there is no NTIS  number given, then they may or may  not have the report.  
In requesting copies in this case, give them both the "CS" and the group number.
If the code "NAN" appears in this position, it indicates that that particular
report is "not available at NTIS".

@Reports that are also Ph.D. theses have been so marked and, if out-of-stock at
Stanford University, may be ordered from:
		University Microfilm
		P. O. Box 1346
		Ann Arbor, Michigan 48106

.ONCE CENTER <<1963>>
.begin indent 0,8,0
*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.

.ONCE CENTER <<1964>>
*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
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 Pseudoinverse 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.

.ONCE CENTER <<1965>>
*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 
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, , , 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
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.

.ONCE CENTER <<1966>>
*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 
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 
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.

.ONCE CENTER <<1967>>
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 
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 
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.

.ONCE CENTER <<1968>>
STAN-CS-68-83, ,AD664237, A. Bjorck and G. Golub,
%2Iterative Refinements of Linear Squares Solutions by House-Holder 
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 
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. Stterthwaite, Jr.,
%2The PL360 System%1,
89 pages, April 1968.

STAN-CS-68-92, ,PB178078, H. Enea,
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, , , 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 Evaluation and its Use in Testing for a
Chebyshev System%1,
26 pages, April 1968.

*STAN-CS-68-97, , , 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.

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 
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),
96∞~iYa5↓Y1αJ55Y*aαε⊃39Me]
aα	9∧CW↔⊗kπ9↓E##↔OO→%04R)J¬απ∪?∨K∞iβS=¬β3πe∧≠#↔O~α↔;⊃∧;π7↔~)E04S	Yaβε∨↔MbαπW∨/≠Q↓EK1a84Ph*NRq6∞Mk1a5Eβ91↓2!YYa+)a1αjqα+↔v[';M`h)∃J
αS#K.)6OS∞;∃α[∂∪'πf)6O#N3Qα'&+KπSN{9β≠␈⊃αC?gK;?7N1αk/∪?Mβ∞s⊃β''_4*K.cπS'}qβS=∧;↔;↔⊗3'k.!αKπNc↔'∨Bα';S/∪πS'}q∃E0hQQYβε∨↔MbαπW∨/≠Q↓EK1a84Ph*NRq6∞Mk1a5EβA2ε⊃3IIYa
α∂?7π+S↔I¬≠gOS.iβ≠?∩α←K'&K;≥β∞s⊃αS/≠S';:αSKπw≠≠?KnS'?v1α∨⊗77π↔→↓5↓αα≠';∞a4*⊗+C?K")E04S	QβC∞;↔M1¬≠↔CS.k↔Iβ	eYaph(4*≥"ε96≥→5Yak	EA1αbB	EC↓eIAbα!9α⊗W↔IbαM9α⊗+∂/↔∩aαM9∧;Kπ#∞iβπ;"α∃9α≡SS↔↔##←πO#∃04R)Jε2<z1α]αCK↔[O≠↔⊃%`h)EA~βCπ∨/→1α?∨#?↔∩↓EeYBp4(4U~Rε9l~M5YBiEEEb↓2ε⊃3IIYe
aα)9∧3K'↔&kπ9β∞s⊃αQrα7πK&s↔I0hQ∃Jπv3gOO→β'9¬#Kπ;≡3?K7∂#'?;∞aα∨K∞k7πI+	04)AβCπ>+M1α∂+∨WO"↓EeYBp4(4U~Rε9l~M5YBiEEIb↓2ε⊃3IIYa:aα)9∧3K'↔&kπ9β∞s⊃α	rαC?3f∂-0hQ∃J¬∧≠?;S⊗{1α3∞s∨Wπ>)β≠?∩αSKπw≠≠?KnS'?v1α∨⊗77π∩)E04S)EβC∞;↔M1∧W∨W∨!↓Ee3A84(hRNRεrj∞M53A5EE~a↓2B∪	aa]β)1α]rα)9αF;O↔r`4)∃∃##∃αNkCπ∂"β?→α∨#?Kπ>)α7πv∨↔7.sQβ?rαC3↔BαCK?≡+OO'v9α3πv;Wπ∨*4*'oβ3↔7.sSπSN{9∃E`h)IU~βCπ∨/→1α+.ce↓EK1a84Ph*NRq6∞Mk1a5E!1↓2∧⊃EaI)Y1αRqα∨↔␈∪∨∃0hQ∃J∂∞c∨↔9bαπ9αNsS↔K∞≠S'[*αC'∂'+K∃α≡3∂Wg+Mα∨.s↔Kπ&K?9α∨KOS↔j)E04S9UβC∞;↔M1∧#↔∂↔n∪↔I↓IYa0hP4*N$
96∞~iYa5	U1↓d
⊃Ye∪1aY1∧Q9α≠⊗K↔∪7∞q1αQrαK↔'!1αIrα∪?K∞q1αQrα7πK&s↔Iβ∞s⊃α	rαC?3f∂-0hQ∃JC⊗{∨Kπnk↔I∨~α7π;.1β≠␈⊃β¬α≡{7CW&+IαOO≠S↔5ε3?Iα'∪π;O6{K7π&K?;πbα∨KπnkπI∃
`4)EKIβCπ>+M1α∂+∨WO"↓EeYBp4(4U~Rε9l~M5YBiEEYbαε&5k9I1α!YaAβ→Y1α"qαC'/β↔I↓E##↔OO→%04R)JS#*α/';.kπS'∨→β?→∧kπ;'π+3πS␈∪MαWv#↔Iα≡{7CW&+Iα∂}sSK?b)E04S	U]βε∨↔Mbα?∂S}∪↔I↓IYa8hP4*N$
96∞~iYa5	]1↓eα	Ea∪	UE1∧!9απ&7M↓E##↔OO→%04R)J¬α≡{7CW&S'?v1α7}#↔1β>KS!α&S¬α6c?]α≡+GW↔v≠';≥+	04)→AβC∞;↔M1∧#↔∂↔n∪↔I↓IYa8hP4*N$
96∞~iYa5	a1αJ55]"aαε⊃3AEAI:aα⊃9¬;πS↔⊗kπ9↓E##↔OO→%04R)J7π≡C';∃∧c↔πKvK;≥β}1α#↔/∪'OSN≠M∃E`h)IM*βCπ∨/→1α∪.≠↔7/⊃↓Ee3A84(hRNRεrj∞M53A5EEJa↓2ε#1eIYC	1α≥rα∪π;'S'≥1ε+Qβπbq04)+∩7πSF+7πSN≠π1απ∪?∨K∞k7';:α3π;?+π∨∃+	04)K	βCπ>+M1αne↓EK1a84Ph*NRq6∞Mk1a5E∪↓1↓2∧⊃EaI1Y1α*r∀↓t Satterthwaite,
%2Mutant 0.5:  An Experimental Programming Language%1,
60 pages, February 1968.

.ONCE CENTER <<1969>>
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, , , 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
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, , D. Gries,
%2Compiler Implementation Language%1,
113 pages, May 1969.

STAN-CS-69-136, SLACR-104, , 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%2
(has also been printed incorrectly as STAN-STAN-CS-69-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.

.next page
.ONCE CENTER <<1970>>
STAN-CS-70-146, , , 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
8 pages, January 1970.

STAN-CS-70-151, , , 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, , , 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, 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, NAN, 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
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, TR-6, AD711334, T. Bredt,
%2Analysis and Synthesis of Concurrent Sequential Programs%1,
50 pages, May 1970.

STAN-CS-70-171, TR-8, AD714202, T. Bredt,
%2A Survey of Models for Parrallel Computing%1, 
58 pages, August 1970.

STAN-CS-70-172, TR-7, AD714180, T. Bredt,
%2Analysis of Parallel Systems%1,
59 pages, August 1970.

STAN-CS-70-173, 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
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, ,NAN, G. Forsythe and W. F. Miller,
%2Research Review%1,
186 pages, October 1970.

STAN-CS-70-179, AIM-135, AD716566, D. C. Smith,
99 pages, October 1970.

STAN-CS-70-180, AIM-132, AD715665, G. Falk (Thesis),
%2Computer Interpretation of Imperfect Line Data as a Three-Dimensional 
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, NAN, 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
30 pages, December 1970.

STAN-CS-70-196, ,AD725167, C. B. Moler,
%2Matrix Computations with Fortran and Paging%1,
13 pages, December 1970.

.next page
.ONCE CENTER <<1971>>
STAN-CS-71-197, ,NAN, 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
250 pages, February 1971.

STAN-CS-71-199, ,PB198415, Staff,
%2Bibliography of Stanford Computer Science Reports 1963-1971%1,
28 pages, February 1971.

STAN-CS-71-200, ,PB198416, J. G. Herriot and C. H. Peinsch,
%2ALGOL 60 Procedures for the Calculation of Interpolating Natural Spline
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, NAN, 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, NAN, Lynn Quam (Thesis),
%2Computer Comparison of Pictures%1,
120 pages, May 1971.

STAN-CS-71-220, TR-14, 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, ,NAN, Wayne Wilner,
%2Declarative Semantic Definition%1,
211 pages, August 1971.

STAN-CS-71-234, ,NAN, Gene H. Golub,
%2Some Modified Eigenvalue Problems%1,
38 pages, September 1971.

STAN-CS-71-235, AIM-150, NAN, 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, 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, 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, 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, , 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
30 pages, November 1971.

STAN-CS-71-247, AIM-157, , 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, ,NAN, 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.

.ONCE CENTER <<1972>>
CS-251, TR-19, AD736814, Harold Stone, 
%2An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear
System of Equation%1, 24 pages, January 1972.

CS-252, SU326 P30 14, , M. A. Saunders,
%2Large-Scale Linear Programming Using the Cholesky Factorization%1,
40 pages, January 1972.

CS-253, AIM-159, NAN, J. A. Feldman and P. C. Shields, %2Total
Complexity and the Inference of Best Programs%1, January 1972.

CS-254, , AD740330, G. E. Forsythe, %2Von Neumann's Comparison Method
for Random Sampling from the Normal and Other Distributions%1, 19 pages,
January 1972.

CS-255, AIM-160, AD740140, J. A. Feldman, %2Automatic Programming%1,
20 pages, January 1972.

CS-256, ,AD740331, V. Chvatal, %2Edmonds Polyhedra and Weakly
Hamiltonian Graphs%1, 22 pages, January 1972.

CS-257, ,PB208519, N. Wirth, %2On Pascal, Code Generation, and
the CDC 6000 Computer%1, 39 pages, February 1972.

CS-258, ,AD740332, Harold Brown, %2Some Basic Machine Algorithms
for Integral Order Computations%1, 15 pages, February 1972.

CS-259, ,PB208595, Clark A. Crane (Thesis), %2Linear Lists and Priority
Queues as Balanced Binary Trees%1, 131 pages, February 1972.

CS-260, ,AD740110, Vaughan R. Pratt (Thesis), %2Shellsort and
Sorting Networks%1, 59 pages, February 1972.

CS-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.

CS-262, ,PB209357, Staff, %2Bibliography%1, 36 pages, February 1972.

CS-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.

CS-264, AIM-161, AD741189, Yorick Wilks, %2Artificial Intelligence
Approach to Machine Translation%1, 42 pages, February 1972.

CS-265, AIM-162, AD744634, Neil Goldman, Roger Shank, Chuck Rieger and
Chris Riesbeck, %2Primitive Concepts Underlying Verbs of Thought%1,
80 pages, February 1972.

CS-266, AIM-163, NAN, Jean Cadiou (Thesis), %2Recursive Definitions of Partial
and Functions and Their Computation%1, 160 pages, March 1972.

CS-267, , PB209629, Pierre E. Bonzon, %2MPL (An Appraisal Based on
Practical Experiment)%1, 26 pages, March 1972.

CS-268, , AD742348, V. Chvatal, %2Degrees and Matchings%1,
16 pages, March 1972.

CS-269, , AD742747, David Klarner and R. Rado,
%2Arithmetic Properties of Certain Recursively Defined Sets%1, 30 pages,
March 1972.

CS-270, , PB209616, G. Golum, J. H. Wilkinson and R. Underwood,
%2The Lanczos Algorithm for the Symmetric Ax = λ Bx Problem%1,
21 pages, Marcy 1972.

CS-271, , NAN, William E. Riddle (Thesis), %2The Modeling and
Analysis of Supervisory Systems%1, 174 pages, March 1972.

CS-272, AIM-164, AD742748, Zohar Manna and J. Vuillemin,
%2Fixedpoint Approach to the Theory of Computation%1,
25 pages, March 1972.

CS-273, , PB209806, V. Chvatal and J. Sichler,
%2Chromatic Automorphisms of Graphs%1, 12 pages, March 1972.

CS-274, , AD742749, D. Klarner and Richard Rado,
%2Linear Combinations of Sets of Consecutive Integers%1,
12 pages, March 1972.

CS-275, , AD742750, David A. Klarner,
%2Sets Generated by Iteration of a Linear Operation%1,
16 pages, March 1972.

.next page
.once center <<1976>>
STAN-CS-76-533, , ,
P. Concus, G. H. Golub and D. P. O'Leary,
%2A Generalized Conjugate Gradient Method for the Numerical Solution of
Elliptic Partial Differential Equations%1,
24 pages, January 1976.  Cost: $2.40

⊗STAN-CS-76-534, AIM-273, ,
Linda G. Hemphill (Thesis),
%2A Conceptual Approach to Automatic Language Understanding and Belief
Structures:  With Disambiguation of the Word 'For' %1,
254 pages, January 1976.  

STAN-CS-76-535, , ,
P. Concus and G. H. Golub,
%2A Generalized Conjugate Gradient Method for Non-Selmmetric Systems of
Linear Equations%1,
12 pages, January 1976.

+STAN-CS-76-536, AIM-274, AD-A020 942/9WC,
David Grossman and Russell Taylor,
%2Interactive Generation of Object Models with a Manipulator%1,
32 pages, January 1976.  Cost: $2.60

+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.  Cost: $4.00

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.  Cost: $2.40

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.  Cost: $3.05

STAN-CS-76-550, , ,
R. E. Tarjan 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.  Cost: $2.40

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.  Cost: $2.85

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 Control Programs from Task-level Specifications%1,
229 pages, July 1976.  Cost: $8.10

STAN-CS-76-561, , ,
D. R. Woods,
%2Mathematical Programming Language:  User's Guide%1,
139 pages, August 1976.

STAN-CS-76-562, ,AD-A032 123,
Donald E. Knuth and L. Trabb Prado,
%2The Early Development of Programming Languages%1,
109 pages, August 1976.

STAN-CS-76-563, , ,
D. L. Russell,
%2State Restoration Among Communicating Processes%1,
173 pages, August 1976.

⊗STAN-CS-76-564, AIM-283, ,
Randall Davis (Thesis),
%2Applications of Meta Level Knowledge to the Construction, Maintenance
and Use of Large Knowledge Bases%1,
304 pages, July 1976.

STAN-CS-76-565, ,AD-A032 802,
J. C. Strikwerda (Thesis),
%2Initial Boundary Value Problems for Incompletely Parabolic Systems%1,
107 pages, November 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, ,
Rafael Finkel (Thesis),
%2Constructing and Debugging Manipulator Programs%1,
171 pages pages, August 1976.

⊗STAN-CS-76-568, AIM-285, PB-259 130/2WC,
T. O. Binford, D. D. Grossman, C. R. Lui, R. C. Bolles, R. A. Finkel,
M. S. Mujtaba, M. D. Roderick, B. E. Shimano, R. H. Taylor, R. H. Goldman,
J. P. 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.  Cost: $8.85

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.  Cost: $4.45

+STAN-CS-76-572, AIM-288, ,
Robert Filman and Richard Weyhrauch,
%2An FOL Primer%1,
36 pages, September 1976.  Cost: $2.70

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 (ed.),
%2SAIL Manual%1,
178 pages, August 1976.  Cost: $6.70

+STAN-CS-76-575, AIM-290, AD-A042 494,
Nancy W. Smith,
%2SAIL Tutorial%1,
54 pages, November 1976.  Cost: $3.20

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.  Cost: $2.55

⊗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 Results Concerning Multicoloring%1,
9 pages, December 1976.

+STAN-CS-76-591, AIM-295, ,
Robert C. Bolles (Thesis),
%2Verification Vision Within a Programmable Assembly System%1,
245 pages, December 1976.  Cost: $8.55

+STAN-CS-76-592, AIM-296,
Robert Cartwright (Thesis),
%2Practical Formal Semantic Definition and Verification Systems%1,
158 pages, December 1976.  Cost: $6.15

.ONCE CENTER <<1977>>
STAN-CS-77-583, ,AD-A038 864,
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.  Cost: $2.95

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.  Cost: $8.55

+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.  Cost: $6.15

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.

STAN-CS-77-600, ,AD-A040 538,
Mark R. Brown (Thesis),
%2The Analysis of a Practical and Nearly Optimal Priority Queue%1,
102 pages, April 1977.

STAN-CS-77-601, ,A045 652,
John F. Reiser (Thesis),
%2Analysis of Additive Random Number Generators%1,
34 pages, April 1977.

STAN-CS-77-602, , ,
C. DeBoor and G. H. Golub,
%2The Numerically Stable Reconstruction of a Jacobi Matrix from Spectral 
21 pages, April 1977.

STAN-CS-77-603, ,AD-A041 292,
Robert E. Tarjan,
%2Reference Machines Require Non-Linear Time to Maintain Disjoint Sets%1,
45 pages, April 1977.

STAN-CS-77-604, ,AD-A040 399,
Tony F. C. Chan and Joseph Oliger,
%2Control of the Dissipativity of Lax-Wendroff Type Methods for First Order
Systems of Hyperbolic Equations%1,
45 pages, April 1977.

STAN-CS-77-605, HPP-77-14, AD-A042 834,
R. G. Smith, T. M. Mitchell, R. A. Chestek and B. Buchanan,
%2A Model for Learning Systems%1,
22 pages, June 1977.

STAN-CS-77-606, , ,
Michael J. Clancy and Donald E. Knuth,
%2A Programming and Problem-Solving Seminar%1,
104 pages, June 1977.

STAN-CS-77-607, TR-133, ,
Susan Owicki,
%2Specifications and Proofs for Abstract Data Types in Concurrent Programs%1,
26 pages, June 1977.

STAN-CS-77-608, , ,
Istvan Simon,
%2On Some Subrecursive Reducibilities%1,
102 pages, June 1977.

STAN-CS-77-609, ,AD-A043 362,
Robert E. Tarjan,
%2Complexity of Combinatorial Algorithms%1,
97 pages, June 1977.

⊗STAN-CS-77-610, AIM-297, ,
Terry Winograd,
%2A Framework for Understanding Discourse%1,
24 pages, June 1977.

⊗STAN-CS-77-611, AIM-298, AD-A046 703,
Zohar Manna, Richard Waldinger,
%2The Logic of Computer Programming%1,
90 pages, June 1977.

STAN-CS-77-612, HPP-77-7, AD-A042 756,
H. Penny Nii and Edward A. Feigenbaum,
%2Rule-Based Understanding of Signals%1,
23 pages, June 1977.

STAN-CS-77-613, , ,
E. Spedicato,
%2On Some Classes of Quasi-Newton Methods for Systms of Nonlinear Algebraic 
31 pages, June 1977. 

+STAN-CS-77-614, AIM-299, ,
Zohar Manna, Adi Shamir,
%2The Convergence of Functions to Fixedpoints of Recursive Definitions%1,
45 pages, June 1977.  Cost: $2.95

STAN-CS-77-615, , ,
R. Glowinski and O. Pironneau,
%2Numerical Methods for the First Biharmonic Equation and for the Two-
Dimensional Stokes Problem%1,
86 pages, June 1977.

STAN-CS-77-616, ,AD-A046 311,
Heinz-Otto Kreiss and Joseph Oliger,
%2Stability of the Fourier Method%1,
25 pages, September 1977.

⊗STAN-CS-77-617, AIM-300, ,
Terry Winograd,
%2On some Contested Suppositions of Generative Linguistics about the
Scientific Study of Language%1,
25 pages, September 1977.

STAN-CS-77-618, HPP-77-28, AD-A045 948,
Nils J. Nilsson,
%2A Production System for Automatic Deduction%1,
42 pages, September 1977.

STAN-CS-77-619, ,AD-A046 481,
W. J. Paul and R. E. Tarjan,
%2Time-Space Trade-Offs in a Pebble Game%1,
8 pages, September 1977.

STAN-CS-77-620, , ,
J. Bolstad and J. Oliger,
%2Adaptation of the Fourier Method to the Nonperiodic Initial Boundary 
Value Problem%1,
80 pages, September 1977.

STAN-CS-77-621, HPP-77-25, AD-A046 289,
E. A. Feigenbaum,
%2The Art of Artificial Intelligence:  I. Themes and Case Studies of 
Knowledge Engineering%1,
18 pages, September 1977.

STAN-CS-77-622, , ,
G. H. Golub, M. Heath and G. Wahba,
%2Generalized Cross-Validation as a Method for Choosing a Good Ridge 
25 pages, September 1977.

STAN-CS-77-623, , ,
D. Boley and G. H. Golub,
%2Inverse Eigenvalue Problems for Band Matrices%1,
75 pages, September 1977.

*STAN-CS-77-624, AIM-301, AD-A044 231,
Lester Earnest, et. al.,
%2Recent Research in Computer Science%1,
118 pages, September 1977.  Cost: $5.00

STAN-CS-77-625, ,AD-A046 090,
Mark R. Brown and Robert E. Tarjan,
%2A Fast Merging Algorithm%1,
42 pages, September 1977.

STAN-CS-77-626, , ,
Andrew C. Yao,
%2On the Loop Switching Addressing Problem%1,
21 page, October 1977.

STAN-CS-77-627, ,AD-A048 786,
Richard J. Lipton and Robert E. Tarjan,
%2A Separator Theorem for Planar Graphs%1,
31 pages, October 1977.

STAN-CS-77-628, ,AD-A048 787,
Richard J. Lipton and Robert E. Tarjan,
%2Applications of a Planar Separator Theorem%1,
34 pages, October 1977.

STAN-CS-77-629, , ,
Andrew C. Yao,
%2The Complexity of Pattern Matching for a Random String%1,
43 pages, October 1977.

+STAN-CS-77-630, AIM-302,
Zohar Manna and Richard Waldinger
%2Synthesis:  Dreams => Programs%1,
119 pages, October 1977.  Cost: $5.05

⊗STAN-CS-77-631, AIM-303, AD-A050 806,
Nachum Dershowitz and Zohar Manna,
%2Inference Rules for Program Annotation%1,
46 pages, October 1977.

+STAN-CS-77-632, AIM-304, AD-A048 684,
Todd Jeffery Wagner (Thesis),
%2Hardware Verification%1,
102 pages, October 1977.  Cost: $4.55

+STAN-CS-77-633, AIM-305, AD-A048 660,
William Faught (Thesis),
%2Motivation and Intensionality in a Computer Simulation Model%1,
104 pages, October 1977.  Cost: $4.60

STAN-CS-77-634, , ,
W. Hoffmann and B. N. Parlett,
%2A New Proof of Global Convergence for the Tridiagonal QL Algorithm%1,
18 pages, October 1977.

STAN-CS-77-635, , ,
G. H. Golub, F. T. Luk and M. L. Overton,
%2A Block Lanczos Method to Computer the Singular Value and Corresponding 
Singular Vectrs of a Matrix%1,
80 pages, October 1977.

STAN-CS-77-636, ,AD-A048 788,
Kenneth P. Bube,
%2C↑m Convergence of Trigonometric Interpolants%1,
25 pages, October 1977.

STAN-CS-77-637, , ,
Lyle Ramshaw,
%2On the Gap Structure of Sequences of Points on a Circle%1,
26 pages, September 1977.  Cost: $

STAN-CS-77-638, SU326 P30-57, ,
Dianne Prost O'Leary,
%2A Generalized Conjugate Gradient Algorithm for Solving a Class of
Quadratic Programming Problems%1,
49 pages, October 1977.  Cost: $

+STAN-CS-77-639, AIM-306, AD-A053 175,
Cordell Green, David Barstow,
%2On Program Synthesis Knowledge%1,
63 pages, November 1977.  Cost: $3.45

+STAN-CS-77-640, AIM-307, AD-A053 176,
Zohar Manna and Richard Waldinger,
%2Structured Programming Without Recursion%1,
10 pages, December 1977.  Cost: $2.00

+STAN-CS-77-641, AIM-308, AD-A053 184,
David Barstow (Thesis),
%2Automatic Construction of Algorithms%1,
220 pages, December 1977.  Cost: $7.85

STAN-CS-77-642, , ,
Andrew C. Yao,
%2On Constructing Minimum Spanning Trees in k-Dimensional Spaces
and Related Problems%1,
37 pages, November 1977.  Cost: $

STAN-CS-77-643, , ,
Kunio Tanabe,
%2A Geometric Method in Nonlinear Programming %1,
53 pages, December 1977.  Cost: $

STAN-CS-77-644, , ,
Bernard Mont-Reynaud (Thesis),
%2Hierarchical Properties of Flows and the Determination of Inner Loops%1,
164 pages, December 1977.  Cost: $

STAN-CS-77-645, , ,
Richard J. Lipton, Donald J. Rose, and Robert Endre Tarjan,
%2Generalized Nested Dissection%1,
32 pages, December 1977.  Cost: $

STAN-CS-77-646, AIM-309, ,
C. G. Nelson and Derek C. Oppen,
%2Efficient Decision Procedures Based on Congruence Closure%1,
15 pages, December 1977.  Cost: $

.ONCE CENTER <<1978>>
STAN-CS-78-647, , ,
Andrew C. Yao,
%2A Lower Bound to Palindrome Recognition by Probabilistic
  Turing Machines%1,
20 pages, January 1978.

STAN-CS-78-648, ,AD-A054 143,
Donald E. Knuth,
%2Mathematical Typography%1,
68 pages, January 1978. 

STAN-CS-78-649, HPP-78-1, ,
Bruce G. Buchanan and Edward A. Feigenbaum,
%2DENDRAL and Meta-DENDRAL:  Their Applications Dimension%1,
25 pages, January 1978.  

STAN-CS-78-650, ,AD-A054 144,
Thomas Lengaue and Robert E. Tarjan,
%2A Fast Algorithm for Finding Dominators in a Flow Graph%1,
40 pages, February 1978.  

STAN-CS-78-651, AIM-310, ,
Nachum Dershowitz and Zohar Manna,
%2Proving Termination with Multiset Orderings%1,
30 pages, March 1978.  Cost: $2.50

STAN-CS-78-652, AIM-311, ,
Greg Nelson and Derek C. Oppen,
%2A Simplifier Based on Efficient Decision Algorithms%1,
20 pages, March 1978.  Cost: $2.26

STAN-CS-78-653, , ,
Yossi Shiloach,
%2Multi-Terminal 0-1 Flow%1,
18 pages, January 1978.  Cost: $2.20

STAN-CS-78-654, , ,
Yossi Shiloach,
%2The Two Paths Problem is Polynomial%1,
23 pages, September 1977.  Cost: $2.40

STAN-CS-78-655, , ,
Germund Dahlquist,
%2On Accuracy and Unconditional Stability of Linear Multistep Methods for
Second Order Differential Equations%1,
8 pages, March 1978.  Cost: $1.90

STAN-CS-78-656, , ,
Michael T. Heath,
%2Numerical Algorithms for Nonlinearly Constrained Optimization%1,
142 pages, March 1978.  Cost $5.70

STAN-CS-78-657, AIM-312, ,
John McCarthy, Masahiko Sato, Takeshi Hayashi, and Shigeru Igarashi,
%2On the Model Theory of Knowledge%1,
12 pages, April 1978.  Cost: $2.00

STAN-CS-78-658, SLAC-205, ,
Leonard J. Shustek,
%2Analysis and Performance of Computer Instruction Sets%1,
177 pages, March 1978.  Cost: $6.00

STAN-CS-78-659, SLAC-206, ,
John E. Zolnowsky,
%2Topics in Computational Geometry%1,
63 pages, March 1978.  Cost: $3.45

⊗STAN-CS-78-660, AIM-313, ,
Bruce E. Shimano (Thesis),
%2The Kinematic Design and Force Control of Computer Controlled 
135 pages, March 1978.

STAN-CS-78-661, , ,
John R. Gilbert and Robert E. Tarjan,
%2Variations of a Pebble Game on Graphs%1,
23 pages, April 1978.  Cost: $2.35

STAN-CS-78-662, , ,
Andrew Chi-Chih Yao,
%2New Algorithms in Bin Packing%1,
50 pages, May 1978.  Cost: $3.10

STAN-CS-78-663, , ,
Eric Grosse,
%2Software Restyling in Graphics and Programming Languages%1,
30 pages, May 1978.  Cost: $2.55

STAN-CS-78-664, , ,
Peter Bjorstad and Jorge Nocedal,
%2Analysis of a New Algorithm for One-Dimensional Minimization%1,
18 pages, May 1978.  Cost: $2.20

STAN-CS-78-665, TR-152, ,
T. M. McWilliams and L. C. Widdoes, Jr.,
%2SCALD:  Structured Computer-Aided Logic Design%1,
39 pages, March 1978.  Cost: $2.80

STAN-CS-78-666, TR-153, ,
T. M. McWilliams and L. C. Widdoes, Jr.,
%2The SCALD Physical Design Subsystem%1,
28 pages, March 1978.  Cost: $2.50

STAN-CS-78-667, HPP-78-7, ,
Reid G. Smith and Randall Davis,
%2Distributed Problem Solving:  The Contract Net Approach%1,
27 pages, June 1978.  Cost: $2.50

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.  Cost: $2.85

STAN-CS-78-669, , ,
Paul K. Stockmeyer and F. Frances Yao,
%2On the Optimality of Linear Merge%1,
11 pages, June 1978.  Cost: $2.05

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.  Cost: $2.80

STAN-CS-78-671, AIM-316, ,
Jerrold Ginsparg (Thesis),
%2Natural Language Processing in an Automatic Programming Domain%1,
172 pages, June 1978.  Cost: $6.55

⊗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-   , , Donald E. Knuth,
%2 Tau Epsilon Chi, a system for technical text%1, 200 pages, November 1978.

.next page
.<<appendix - requires the file APPEND[BIB,CSR]>>