perm filename BIB.PUB[BIB,CSR]18 blob sn#472366 filedate 1979-08-29 generic text, type C, neo UTF8

COMMENT ⊗ VALID 00011 PAGES C REC PAGE DESCRIPTION C00001 00001 C00002 00002 .DEVICE XGP C00004 00003 .once center <<key>> C00008 00004 .once center <<1 - 99>> C00031 00005 .once center <<100 - 199>> C00054 00006 .once center <<200 - 299>> C00081 00007 .once center <<300 - 399>> C00105 00008 .once center <<400 - 499>> C00129 00009 .once center <<500 - 599>> C00154 00010 .once center <<600 - 699>> C00178 00011 .once center <<700 - 799>> C00192 ENDMK C⊗; .DEVICE XGP; .SINGLESCRIPT .SPACING 10*5 MILLS; .PAGE FRAME 45 HIGH 80 WIDE .TITLE AREA HEADING LINES 1 TO 3 .AREA TEXT LINES 4 TO 45 . .turn on "↔" for "→" .turn on "%,π,α,#,&,∂,↑,↓,[,]" .turn on "∩" for "↑" .turn on "∪" for "↓" .<<font 1 "ngr25"; <<regular text>> .font 1 "metm"; .font 2 "baxm30"; <<italic text>> .font 3 "nonlb"; <<bold face text>> .font 4 "sail25"; <<typewriter font>> .font 5 "fix25"; <<fixed width>> .font 6 "math30"; <<mathematical symbols>> .font 7 "ngb40"; <<cover>> .font A "grkl30"; <<greek>> .SELECT 1 . .AT 8 ⊂ONCE INDENT 5;⊃ .at "@" ⊂"####"⊃ .at "-" ⊂"%5α-%*"⊃ .at "=" ⊂"%5α=%*"⊃ .at "<" ⊂"%5α<%*"⊃ .at ">" ⊂"%5α>%*"⊃ .at "<=>" ⊂"%5α<α=α>%*"⊃ .at "=>" ⊂"%5α=α>%*"⊃ .at "<=" ⊂"%5α<α=%*"⊃ .at "⊗" ⊂"%6αO%*"⊃ .at "*" ⊂"%5α*%*"⊃ .at "+" ⊂"%5α+%*"⊃ . .macro bf; ⊂ .nofill; .turn on "\" . ⊃ . .macro bi; ⊂ .nofill; .turn on "\"; . ⊃ . .PLACE TEXT; . .NEXT PAGE .every heading (%3Computer Science,,%*) .once center <<key>> %3Numbering Key%1 .SKIP The following is a key to reading the different report numbers. .skip .begin bf .tabs 20 STAN-CS-\%2This 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.%1 .BREAK AIM-\%2This is a "group" number. It stands for Artificial Intelligence Memo.%1 HPP-\%2This is a "group" number. It stands for Heuristic Programming Project.%1 SU326\%2This is a DOE sponsored report number.%1 .BREAK SLAC-\%2This report was printed jointly with the Stanford Linear Accelerator Center.%1 LBL-\%2This report was printed jointly with the Lawrence Berkeley Laboratory.%1 CSL-\%2This report was printed jointly with the Computer Science Laboratory.%1 .BREAK PB\%2This report may be ordered from NTIS using this number.%1 AD\%2This report may be ordered from NTIS using this number.%1 AD-A\%2This report may be ordered from NTIS using this number.%1 .end For example: If a report was numbered .once center STAN-CS-77-611 (AIM-298, AD-A046 703) that 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 NTIS and ask for the same report by specifying number AD-A046 703. To order reports from the Stanford Department of Computer Science, use the following address: .skip .begin nofill; indent 10 Publications Coordinator Department of Computer Science Stanford University Stanford, California 94305 U.S.A. .end To order reports from NTIS, use the following address: .skip .begin nofill; indent 10 U.S. Department of Commerce National Technicl Information Service 5285 Port Royal Road Springfield, Virginia 22161 U.S.A. .end An availability listing of all the STAN-CS- reports is given in Appendix A, and is current as of this printing. .once center <<1 - 99>> %3Reports 1 thru 99%1 .begin indent 0,10,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. 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 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. 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 8AD618216), 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. Stterthwaite, 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. .next page .once center <<100 - 199>> %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. .next page .once center <<200 - 299>> %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, %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. .next page .once center <<300 - 399>> %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 X 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, 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 Zmir 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. .next page .once center <<400 - 499>> %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 "Go To" 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 Queue Structure%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 of First Order Logic%1, 55 pages, November 1974. STAN-CS-74-468 (AD-A003 832), S. Krogdahl, %2A Combinatorial Base for Some Optimal Matroid Intersection Algorithms%1, 25 pages, November 1974. STAN-CS-74-469, H. Brown, %2Molecular Structure Elucidation III%1, 38 pages, December 1974. STAN-CS-74-470, L. Trabb Prado, %2Stable Sorting and Merging with Optimal Time and 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-Parametric 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, 16 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, %2Numerical Experiments with the Spectral Test%1, 31 pages, May 1975. STAN-CS-75-491, G. D. Knott (Thesis), %2Deletion in Binary Storage Trees%1, 93 pages, May 1975. STAN-CS-75-492, R. Sedgewick (Thesis), %2Quicksort%1, 352 pages, May 1975. STAN-CS-75-493 (PB244421/AS), R. Kurki-Suonio, %2Describing Automata in Terms of Languages Associated with Their Peripheral Devices%1, 37 pages, May 1975. STAN-CS-75-494, E. H. Satterthwaite, Jr. (Thesis), %2Source Language Debugging Tools%1, 345 pages, May 1975. STAN-CS-75-495 (AD-A014 424), S. Krogdahl, %2The Dependence Graph for Bases in Matroids%1, 29 pages, May 1975. STAN-CS-75-496 (SU326 P30-41), R. Underwood (Thesis), %2An Iterative Block Lanczos Method for the Solution of Large Sparse Symmetric Eigenproblems%1, 133 pages, May 1975. STAN-CS-75-497 (AD-A016 825), R. L. Graham and L. Lovasz, %2Distance Matrices of Trees%1, 48 pages, August 1975. STAN-CS-75-498 (AIM-259, AD-A017 025), H. Samet (Thesis), %2Automatically Proving the Correctness of Translations Involving Optimized Code%1, 214 pages, August 1975. STAN-CS-75-499 (AIM-260), D. C. Smith (Thesis), %2PYGMALION: A Creative Programming Environment%1, 193 pages, August 1975. .next page .once center <<500 - 599>> %3Reports 500 thru 599%1 STAN-CS-75-500 (PB246708/AS), R. Kurki-Suonio, %2Towards Better Definitions of Programming Languages%1, 29 pages, August 1975. STAN-CS-75-501 (AIM-261, AD-A016 810), O. Pettersen, %2Procedural Events as Software Interrupts%1, 8 pages, August 1975. STAN-CS-75-502 (AIM-262, AD-A016 808), O. Pettersen, %2Synchronization of Concurrent Processes%1, 14 pages, August 1975. STAN-CS-75-503 (AIM-263, AD-A016 807), O. Pettersen, %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 Techniques for Fixed Radius Near Neighbor Searching%1, 30 pages, October 1975. STAN-CS-75-514 (PB247561/AS), N. Tokura, %2A Microprogram Control Unit Based on a Tree Memory%1, 39 pages, October 1975. STAN-CS-75-515, R. P. Brent, %2Fast Multiple-Precision Evaluation of Elementary Functions%1, 22 pages, October 1975. STAN-CS-75-516 (SU326 P30-42), J. Stoer, %2On the Relation Between Quadratic Termination and Convergence Properties of Minimization Algorithms%1, 103 pages, October 1975. STAN-CS-75-517, V. Chvatal and C. Thomassen, %2Distances in Orientations of Graphs%1, 24 pages, October 1975. STAN-CS-75-518 (AD-A018 461), V. Chvatal and P. L. Hammer, %2Aggregation of Inequalities in Integer Programming%1, 27 pages, October 1975. STAN-CS-75-519 (AIM-266, AD-A019 641), R. Davis, B. Buchanan and E. Shortliffe, %2Production Rules as a Representation for a Knowledge-Based Consultation Program%1, 37 pages, November 1975. STAN-CS-75-520 (AIM-267, AD-A019 664), F. W. von Henke, %2On the Representation of Data Structures in LCF with Applications to Program Generation%1, 41 pages, November 1975. STAN-CS-75-521 (AIM-268), C. Thompson, %2Depth Perception in Stereo Computer Vision%1, 16 pages, November. STAN-CS-75-522 (AIM-269, AD-A019 569), D. C. Luckham and N. Suzuki, %2Automatic Program Verification IV: Proof of Termination Within a Weak Logic of Programs%1, 39 pages, November 1975. STAN-CS-75-523 (AIM-270, AD-A019 467), J. F. Reiser, %2BAIL -- A Debugger for SAIL%1, 26 pages, November 1975. STAN-CS-75-524 (AIM-271, AD-A019 702), R. Davis and J. King, %2An Overview of Production Systems%1, 40 pages, November 1975. STAN-CS-75-525 (AIM-272), S. Ganapathy (Thesis), %2Reconstruction of Secnes Containing Polyhedra from Stereo Pair of Views%1, 204 pages, November 1975. STAN-CS-75-526 (AD-A020 848), Robert E. Tarjan, %2Graph Theory and Gaussian Elimination%1, 23 pages, November 1975. STAN-CS-75-527 (CSL-TR-100, not at NTIS), E. McCluskey, J. Wakerley and R. Ogus, %2Center for Reliable Computing%1, 100 pages, November 1975. STAN-CS-75-528 (AD-A020 597), Robert E. Tarjan, %2Solving Path Problems on Directed Graphs%1, 45 pages, November 1975. STAN-CS-75-529 (SLACP-1665), J. L. Bentley and J. H. Friedman, %2Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces%1, 29 pages, November 1975. STAN-CS-75-530 (SU326 P30-40), M. Lentini and V. Pereyra, %2An Adaptive Finite Difference Solver for Nonlinear Two Point Boundary Problems with Mild Boundary Layers%1, 42 pages, November 1975. STAN-CS-75-531 (AD-A020 847), D. J. Rose and R. E. Tarjan, %2Algorithmic Aspects of Vertex Elimination on Directed Graphs%1, 45 pages, November 1975. STAN-CS-75-532, Pat E. Jacobs (staff), %2Bibliography of Computer Science Reports%1, 77 pages, November 1975. STAN-CS-76-533 (LBL-4604, SU326 P30-44), 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. 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. 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. 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. 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 Control Programs from Task-level Specifications%1, 229 pages, July 1976. 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. 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 Results Concerning Multicoloring%1, 9 pages, December 1976. 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. 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. .next page .once center <<600 - 699>> %3Reports 600 thru 699%1 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 (AD-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 Data%1, 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 (CSL-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 (Thesis), %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 Equations%1, 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. 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 Parameter%1, 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. 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 pages, 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, AD-AO49 761), Zohar Manna and Richard Waldinger %2Synthesis: Dreams => Programs%1, 119 pages, October 1977. 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. 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. 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. 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. STAN-CS-77-639 (AIM-306, AD-A053 175), Cordell Green and David Barstow, %2On Program Synthesis Knowledge%1, 63 pages, November 1977. STAN-CS-77-640 (AIM-307, AD-A053 176), Zohar Manna and Richard Waldinger, %2Structured Programming Without Recursion%1, 10 pages, December 1977. STAN-CS-77-641 (AIM-308, AD-A053 184), David Barstow (Thesis), %2Automatic Construction of Algorithms%1, 220 pages, December 1977. STAN-CS-77-642, Andrew C. Yao, %2On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems%1, 37 pages, November 1977. STAN-CS-77-643, Kunio Tanabe, %2A Geometric Method in Nonlinear Programming %1, 53 pages, December 1977. STAN-CS-77-644, Bernard Mont-Reynaud (Thesis), %2Hierarchical Properties of Flows and the Determination of Inner Loops%1, 164 pages, December 1977. STAN-CS-77-645, Richard J. Lipton, Donald J. Rose, and Robert Endre Tarjan, %2Generalized Nested Dissection%1, 32 pages, December 1977. STAN-CS-77-646 (AIM-309), C. G. Nelson and Derek C. Oppen, %2Efficient Decision Procedures Based on Congruence Closure%1, 5 pages, December 1977. 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, AD-A058 601), Nachum Dershowitz and Zohar Manna, %2Proving Termination with Multiset Orderings%1, 30 pages, March 1978. STAN-CS-78-652 (AIM-311), Greg Nelson and Derek C. Oppen, %2A Simplifier Based on Efficient Decision Algorithms%1, 20 pages, March 1978. STAN-CS-78-653, Yossi Shiloach, %2Multi-Terminal 0-1 Flow%1, 18 pages, January 1978. STAN-CS-78-654 (PB288520/AS), Yossi Shiloach, %2The Two Paths Problem is Polynomial%1, 23 pages, September 1977. 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. 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. STAN-CS-78-658 (SLAC-205), Leonard J. Shustek (Thesis), %2Analysis and Performance of Computer Instruction Sets%1, 177 pages, March 1978. STAN-CS-78-659 (SLAC-206), John E. Zolnowsky (Thesis), %2Topics in Computational Geometry%1, 63 pages, March 1978. STAN-CS-78-660 (AIM-313), Bruce E. Shimano (Thesis), %2The Kinematic Design and Force Control of Computer Controlled Manipulators%1, 135 pages, March 1978. STAN-CS-78-661 (AD-A060 794), John R. Gilbert and Robert E. Tarjan, %2Variations of a Pebble Game on Graphs%1, 23 pages, April 1978. STAN-CS-78-662, Andrew Chi-Chih Yao, %2New Algorithms in Bin Packing%1, 50 pages, May 1978. STAN-CS-78-663 (AD-A060 793), Eric Grosse, %2Software Restyling in Graphics and Programming Languages%1, 30 pages, May 1978. STAN-CS-78-664, Peter Bjorstad and Jorge Nocedal, %2Analysis of a New Algorithm for One-Dimensional Minimization%1, 18 pages, May 1978. 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, Paul K. Stockmeyer 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 of Nondifferentiable Functions%1, 57 pages, November 1978. STAN-CS-78-680, Connie J. Stanley (editor), %2Bibliography of Stanford Computer Science Reports, 1963-1978%1, 100 pages, November 1978. STAN-CS-78-681 (AD-A065 283), Louis Trabb Pardo (Thesis), %2Set 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 1978. STAN-CS-78-683 (AD-A065 284), Robert Endre Tarjan, %2Storing a Sparse Table%1, 23 pages, December 1978. STAN-CS-78-684 (SU326 P30-63), D. L. Boley and G. H. Golub, %2The Matrix Inverse Eigenvalue Problem for Periodic Jacobi Matrices%1, 18 pages, December 1978. STAN-CS-78-685 (AD-A065 285), Franklin Tai-cheung Luk (Thesis), %2Sparse and Parallel Matrix Computations%1, 168 pages, December 1978. STAN-CS-78-686, Richard J. Lipton, Arnold L. Rosenberg and Andrew C. Yao, %2External Hashing Schemes for Collections of Data Structures%1, 33 pages, December 1978. STAN-CS-78-687 (AIM-315, AD-A065 698), Richard Weyhrauch, %2Prolegomena to a Theory of Formal Reasoning%1, 41 pages, December 1978. STAN-CS-78-688 (AIM-318), Zohar Manna, %2Six Lectures on the Logic of Computer Programming%1, 54 pages, December 1978. STAN-CS-78-689 (AIM-319), Charles G. Nelson, %2An n∩[log n] Algorithm for the Two-Variable-Per-Constraint Linear Programming Satisfiability Problem%1, 20 pages, December 1978. STAN-CS-78-690 (AIM-320, AD-A065 558), Zohar Manna and Richard Waldinger, %2A Deductive Approach to Program Synthesis%1, 30 pages, December 1978. STAN-CS-78-691 (AD-A066 058), Kenneth P. Bube (Thesis), %2The Construction of Initial Data for Hyperbolic Systems from Nonstandard Data%1, 119 pages, November 1978. STAN-CS-78-692 (HPP-77-39, AD-A066 147), Bruce G. Buchanan, Tom M. Mitchell, Reid G. Smith and C. Richard Johnson Jr., %2Models of Learning Systems%1, 38 pages, November 1978. STAN-CS-78-693 (AD-A066 099), Douglas B. West, %2A Class of Solutions to the Gossip Problem%1, 61 pages, November 1978. STAN-CS-78-694, Jonathan King (editor), %2Computer Science at Stanford 1977-1978%1, 27 pages, November 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 Problem with a Quadratic Constraint%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, %2SACON: A Knowledge-Based Consultant for Structural Analysis%1, 65 pages, September 1978. .next page .once center <<700 - 799>> %3Reports 700 thru 799%1 STAN-CS-78-700 (HPP-78-28, AD-A068 230), Reid Garfield Smith (Thesis), %2A Framework for Problem Solving in a Distributed Processing Environment%1, 150 pages, December 1978. STAN-CS-79-701, Mitch L Model (Thesis), %2Monitoring System Behavior in a Complex Computational Environment%1, 189 pages, January 1979. STAN-CS-79-702, Yossi Shiloach, %2An O(n|cdIlog↑2I) Maximum-Flow Algorithm%1, 33 pages, January 1979. STAN-CS-79-703 (AD-A068 228), Bengt Aspval and Yossi Shiloach, %2A Polynomial Time Algorithm for Solving Systems of Linear Inequalities With Two Variables Per Inequality%1, 25 pages, January 1979. STAN-CS-79-704 (AD-A068 232), Roland A. Sweet, %2A Survey of the State of Software for Partial Differential Equations%1, 31 pages, January 1979. STAN-CS-79-705, Robert Lewis (Scot) Drysdale, III (Thesis), %2Generalized Voronoi Diagrams and Geometric Searching%1, 196 pages, January 1979. STAN-CS-79-706, F. Francis Yao, %2Graph 2-Isomorphism is NP-Complete%1, 12 pages, January 1979. STAN-CS-79-707, Chris Van Wyk and Donald E. Knuth, %2A Programming and Problem-Solving Seminar%1, 83 pages, January 1979. STAN-CS-79-708, Andrew C. Yao, %2An Analysis of a Memory Allocation Scheme for Implementing Stacks%1, 18 pages, January 1979. STAN-CS-78-709 (AD-A068 231), Mark R. Brown and Robert E. Tarjan, %2Design and Analysis of a Data Structure for Representing Sorted Lines%1, 50 pages, December 1978. STAN-CS-79-710 (AD-A068 210), Lloyd Trefethen, %2Numerical Computation of the Schwarz-Christoffel Transformation%1, 42 pages, 1979. STAN-CS-78-711, Tom Michael Mitchell (Thesis), %2Version Spaces: An Approach to Concept Learning%1, 216 pages, December 1978. STAN-CS-79-712 (AD-A068 393), Donald E. Knuth, %2The Errata of Computer Programming%1, 58 pages, January 1979. STAN-CS-79-713, Gene Golub, Stephen Nash and Charles Van Loan, %2A Hessenberg-Schur Method for the Problem AX + XB = C%1, 50 pages, January 1979. STAN-CS-79-714 (CSL-TN-160), Fernando Castaneda, Frederick Chow, Peter Nye, Dan Sleator and Gio Wiederhold, %2PCFORT: A Fortran-to-Pcode Translator%1, January 1979. STAN-CS-79-715 (CSL-TN-161), Brent T. Hailpern and Bruce L. Hitson, %2S-1 Architecture Manual%1, January 1979. STAN-CS-79-716 (AIM-322), Michael Georgeff, %2A Framework for Control in Production Systems%1, 35 pages, January 1979. STAN-CS-79-717 (AIM-324), Robert Cartwright and John McCarthy, %2Recursive Programs as Functions in a First Order Theory%1, 32 pages, March 1979. STAN-CS-79-718 (AIM-323), Shahid Mujtaba and Ron Goldman, %2AL Users' Manual%1, 136 pages, January 1979. STAN-CS-79-719, Petter Bj%6O%1rstad, Germund Dahlquist and Eric Grosse, %2Extrapolation of Asymptotic Expansions by a Modified Aitken %Ad%2↑2-Formula%1, 54 pages, February 1979. STAN-CS-79-720, R. Glowinski, %2 On Grid Optimization for Boundary Value Problems%1, 22 pages, February 1979. STAN-CS-79-721, Andrew C. Yao and F. Frances Yao, %2On Fault-Tolerant Networks for Sorting%1, 20 pages, February 1979. STAN-CS-79-722, Gio Wiederhold and Ramez El-Masri, %2A Structural Model for Database Systems%1 57 pages, March 1979. STAN-CS-79-723, Edward H. Shortliffe, Bruce G. Buchanan and Edward A. Feigenbaum, %2Knowledge Engineering for Medical Decision Making: a review of computer-based clinical decision aids%1, 52 pages, February 1979. STAN-CS-79-724 (AIM-325), John McCarthy, %2First Order Theories of Individual Concepts and Propositions%1, 19 pages, March 1979. STAN-CS-79-725 (AIM-326), John McCarthy, %2Ascribing Mental Qualities to Machines%1, 25 pages, March 1979. STAN-CS-79-726, Andrew Chi-Chih Yao, %2An Analysis of (h,k,l)-Shellsort%1, 55 pages, March 1979. STAN-CS-79-727 (AIM-327), Robert Elliot Filman (Thesis), %2The Interaction of Observation and Inference%1, 235 pages, March 1979. STAN-CS-79-728, Yossi Shiloach, %2Union-Member Algorithms for Non-Disjoint Sets%1, 12 pages, January 1979. STAN-CS-79-729 (AD-A068 229), Robert Endre Tarjan, %2 A Unified Approach to Path Problems%1, 43 pages, April 1979. STAN-CS-79-730, Frank M. Liang, %2Qualifying Examinations in Computer Science, 1965-1978%1, 238 pages. STAN-CS-79-731 (P.V. α#11), D.C. Luckham, S.M. German F.W. von Henke, R.A. Karp, P.W. Milne, D.C. Oppen, W. Polak, and W.L. Scherlis, %2Stanford PASCAL Verifier User Manual%1, April 1979. STAN-CS-79-732, Donald R. Woods, %2Notes on Introductory Combinatorics%1, 120 pages, April 1979. STAN-CS-79-733, Andrew Chi-Chih Yao, %2A Lower Bound to Finding Convex Hulls%1, 22 pages, April 1979. STAN-CS-79-734, Robert Endre Tarjan, %2Fast Algorithms for Solving Path Problems%1, 49 pages, April 1979. STAN-CS-79-735, J. H. Wilkinson, %2Kronecker's Canonical Form and the QZ Algorithm%1, 23 pages, April 1979. STAN-CS-79-736, J. H. Wilkinson, %2Note on the Practical Significance of the Drazin Inverse%1, 20 pages, April 1979. STAN-CS-79-737, Andrew C. Yao and F. Frances Yao, %2On the Average-case Complexity of Selecting the k-th Best%1, 45 pages, April 1979. STAN-CS-79-738 (SU326 P30-65), Randall LeVeque, Germund Dahlquist and Dan Andree, %2Computations Related to G-Stability of Linear Multistep Methods%1, 27 pages, May 1979. STAN-CS-79-739 (HPP-79-14), J. R. Quinlan, %2Induction Over Large Data Bases%1, 19 pages, May 1979. STAN-CS-79-740, R. S. Cartwright and D. C. Oppen, %2The Logic of Aliasing%1, 24 pages, May 1979. STAN-CS-79-741, Lyle Harold Ramshaw (Thesis), %2Formalizing the Analysis of Algorithms%1, 123 pages, June 1979. STAN-CS-79-742 (HPP-79-12), Anne Gardner, %2Handbook of Artificial Intelligence: Search%1, 100 pages, June l979. STAN-CS-79-743 (AIM-328), Juan Bulnes-Rozas (Thesis), %2GOAL: A Goal Oriented Command Language for Interactive Proof Construction%1, 175 pages, June 1979. STAN-CS-79-744 (CSL-TR-172), Hector Garcia-Molina (Thesis), %2Performance of Update Algorithms for Replicated Data in a Distributed Database%1, 320 pages, June 1979. STAN-CS-79-745, Thomas Lengauer (Thesis), %2Upper and Lower Bounds on Time-Space Tradeoffs in a Pebble Game%1, 82 pages, July 1979. STAN-CS-79-746, Alan Borning (Thesis), %2ThingLab -- A Constraint-Oriented Simulation Laboratory%1, 109 pages, July 1979. STAN-CS-79-747 (AIM-329), David E. Wilkins (Thesis), %2Using Patterns and Plans to Solve Problems and Control Search%1, 264 pages, June 1979. STAN-CS-79-748, David Y. Y. Yun, %2Fast Algorithms for Solving Toeplitz System of Equations and Finding Rational Interpolants%1, 9 pages, July 1979. STAN-CS-79-749 (HPP-79-17), William Clancey, James Bennett and Paul Cohen, %2Applications-Oriented AI Research: Education%1, 60 pages, July 1979. STAN-CS-79-750, Peter Gacs and Laszlo Lovasz, %2Khachian's Algorithm for Linear Programming%1, 12 pages, July 1979. STAN-CS-79-751 (AIM-330), Zohar Manna and Amir Pnueli, %2The Model Logic of Programs%1, 36 pages, September 1979. STAN-CS-79-752, Michael Lockhart Overton (Thesis), %2Projected Lagrangian Algorithms for Nonlinear Minimax and l↓1 Optimization%1, 164 pages, July 1979. STAN-CS-79-753, Andrew Chi-Chih Yao, %2Should Tables Be Sorted?%1, 36 pages, July 1979. STAN-CS-79-754 (HPP-79-21), Anne Gardner, James Davidson and Terry Winograd, %2Natural Language Understanding%1, 100 pages, July 1979. STAN-CS-79-755 (AIM-331), Elaine Kant (Thesis), %2Efficiency Considerations in Program Synthesis: A Knowledge-Based Approach%1, 160 pages, July 1979. STAN-CS-79-756 (HPP-79-22), James S. Bennett, Bruce G. Buchanan, Paul R. Cohen and Fritz Fisher, %2Applications-Oriented AI Research: Science and Mathematics%1, 110 pages, July 1979. STAN-CS-79-757 (HPP-79-23), Victor B. Clesielski, James S. Bennett and Paul R. Cohen, %2Applications-Oriented AI Research: Medicine%1, 40 pages, July 1979. STAN-CS-79-578 (HPP-79-24), Robert Elschlager and Jorge Phillips, %2Automatic Programming%1, 100 pages, July 1979. STAN-CS-79-759 (HPP-79-25), Alain Bonnet, %2Schema-Shift Strategies for Understanding Structured Texts in Natural Language%1, 40 pages, July 1979. .end .NEXT PAGE