COMMENT ⊗   VALID 00005 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.DEVICE XGP
C00004 00003	.begin center
C00015 00004	STAN-CS-74-410 (TR-46), James L. Peterson,
C00026 00005	STAN-CS-79-701, Mitch L Model,
C00036 ENDMK
C⊗;
.DEVICE XGP;
.SINGLESCRIPT
.SPACING 10*5 MILLS;
.PAGE FRAME 48 HIGH 80 WIDE
.TITLE AREA HEADING LINES 1 TO 3
.AREA TEXT LINES 4 TO 48
.
.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 (%3Appendix B,,%3Theses%1)
.begin center
%3APPENDIX B
%3THESES%1
.end
.SKIP
.begin indent 0,10,0
STAN-CS-64-10, R. L. Causey,
%2On Closest Normal Matrices%1

STAN-CS-65-15, D. W. Grace,
%2Computer Search for Non-Isomorphic Convex Polyhedra%1

STAN-CS-65-22, C. B. Moler,
%2Finite Difference Methods for the Eigenbales of Laplace's Operator%1

STAN-CS-65-23, B. D. Rudin,
%2Convex Polynomial Approximation%1

STAN-CS-66-48, W. M. McKeeman,
%2An Approach to Computer Language Design%1

STAN-CS-66-49 (AIM-43), D. R. Reddy,
%2An Approach to Computer Speech Recognition by Direct Analysis of Speech Wave%1

STAN-CS-66-50 (AIM-46), S. Persson,
%2Some Sequence Extrapulating Programs:  A Study of Representation and Modelling in Inquiring Systems%1

STAN-CS-67-58, V. Tixier,
%2Recursive Functions of Regular Expressions in Language Analysis%1

STAN-CS-67-66, J. M. Varah,
%2The Computation of Bounds for the Invariant Subspaces of a General Matrix Operator%1

STAN-CS-68-94, A. C. Shaw,
%2The Formal Description and Parsing of Pictures%1

STAN-CS-68-101 (AIM-60), D. M. Kaplan,
%2The Formal Theoretic Analysis of Stront Equivalence for Elemental Programs%1

STAN-CS-68-105, P. Richman,
%2Epsiolon-Calculus%1

STAN-CS-68-106 (AIM-65), B. Huberman,
%2A Program to Play Chess End Games%1

STAN-CS-68-116 (AIM-72), D. Pieper,
%2The Kinematics of Manipulators Under Computer Control%1

STAN-CS-68-117, D. Adams,
%2A Computational Model with Data Flow Sequencing%1

STAN-CS-68-118 (AIM-74), D. Waterman,
%2Machine Learning of Heuristics%1

STAN-CS-69-127 (AIM-85), P. Vicens,
%2Aspects of Speech Recognition by Computer%1

STAN-CS-69-130 (AIM-83), R. C. Schank,
%2A Conceptual Dependency Representation for a Computer-Oriented Semantics%1

STAN-CS-69-131 (SLAC-96), L. B. Smith,
%2The Use of Man-Machine Interaction in Data-Fitting Problems%1

STAN-CS-69-136 (SLACR-104), I. Pohl,
%2Bi-Directional and Heuristic Search in Path Problems%1

STAN-CS-69-138 (AIM-96), C. C. Green,
%2The Application of Theorem Proving to Question-Answering Systems%1

STAN-CS-69-139 (AIM-98), J. J. Horning,
%2A Study of Grammatical Inference%1

STAN-CS-69-143, M. A. Jenkins,
%2Three-Stage Variable-Shift for the Solution of Polynomial Equations with a Posteriori Error Bounds for the Zeros%1

STAN-CS-70-146, G. O. Ramos,
%2Roundoff Error Analysis of the Fast Fourier Transform%1

STAN-CS-70-161 (SLACR-117), L. J. Hoffman,
%2The Formulary Model for Access Control and Privacy in Computer Systems%1

STAN-CS-70-168 (AIM-130), M. Kelly,
%2Visual Identification of People by Computer%1

STAN-CS-70-180 (AIM-132), G. Falk,
%2Computer Interpretation of Imperfect Line Data as a Three-Dimensional Scene%1

STAN-CS-70-182 (AIM-134), J. Tenenbaum,
%2Accomodation in Computer Vision%1

STAN-CS-71-198, R. Brent,
%2Algorithms for Finding Zeros and Extrema of Functions without Calculating Derivatives%1

STAN-CS-71-208, J. A. George,
%2Computer Implementation of the Finite Element Method%1

STAN-CS-71-219 (AIM-144), Lynn Quam,
%2Computer Comparison of Pictures%1

STAN-CS-71-222, W. J. Meyers,
%2Linear Representation of Tree Structure (a Mathematical Theory of Parenthesis-Free Notations)%1

STAN-CS-71-223, Susan Graham,
%2Precedence Languages and Bounded Right Context Languages%1

STAN-CS-71-227 (SLAC-134), J. E. George,
%2GEMS - A Graphical Experimental Meta System%1

STAN-CS-71-231 (AIM-149), Rod Schmidt,
%2A Study of the Real-Time Control of a Computer Driven Vehicle%1

STAN-CS-71-244, R. Tarjan,
%2An Efficient Planarity Algorithm%1

STAN-CS-71-245 (AIM-155), John Ryder,
%2Heuristic Analysis of Large Trees as Generated in the Game of Go%1

STAN-CS-72-259, Clark A. Crane,
%2Linear Lists and Priority Queues as Balanced Binary Trees%1

STAN-CS-72-260, Vaughan R. Pratt,
%2Shellsort and Sorting Networks%1

STAN-CS-72-266 (AIM-163), Jean Cadiou,
%2Recursive Definitions of Partial and Functions and Their Computation%1

STAN-CS-72-271, William E. Riddle,
%2The Modeling and Analysis of Supervisory Systems%1

STAN-CS-72-276, Linda Kaufman,
%2A Generalized LR Method to Solve Ax = Bx%1

STAN-CS-72-293 (TN-32), J. A. Lukes,
%2Combinatorial Solutions to Partitioning Problems%1

STAN-CS-72-296, Michael L. Fredman,
%2Growth Properties of a Class of Recursively Defined Functions%1

STAN-CS-72-303 (AIM-174), F. Lockwood Morris,
%2Correctness of Translations of Programming Languages - an Algebraic Approach%1

STAN-CS-72-305 (AIM-173), Gerald Agin,
%2Representation and Description of Curved Objects%1

STAN-CS-72-309 (TR-157), V. Lesser,
%2Dynamic Control Structures and Their Use in Emulation%1

STAN-CS-72-311 (AIM-177), Richard Paul,
%2Modelling, Trajectory Calculation and Servoing of a Computer Controlled Arm%1

STAN-CS-72-314 (TR-43), Peter M. Kogge,
%2Parallel Algorithms for the Efficient Solution of Recurrence Problems (Part 1)%1

STAN-CS-72-315 (TR-44), Peter M. Kogge,
%2The Numerical Stability of Parallel Algorithms for Solving Recurrence Problems (Part 2)%1

STAN-CS-72-316 (TR-45), Peter M. Kogge,
%2Minimal Paralellism in the Solution of Recurrence Problems (Part 3)%1

STAN-CS-72-321 (AIM-180), Ruzena Bajcsy,
%2Computer Identification of Textured Visual Scenes%1

STAN-CS-72-324 (TR-48), Henry R. Bauer, III,
%2Subproblems of the m X n Sequencing Problem%1

STAN-CS-72-329, Isu Fang,
%2Folds, A Declarative Formal Language Definition System%1

STAN-CS-73-336 (AIM-188), Ashok K. Chandra,
%2On the Properties and Applications of Program Schemas%1

STAN-CS-73-343, David R. Levine,
%2Computer-Based Analytic Grading for German Grammar Instruction%1

STAN-CS-73-363, Linda C. Kaufman,
%2The LZ Algorithm to Solve the Generalized Eigenvalue Problem%1

STAN-CS-73-366 (AIM-201), Gunnar Rutger Grape,
%2Model Bases (Intermediate-Level) Computer Vision%1

STAN-CS-73-372, Michael A. Malcolm,
%2Nonlinear Spline Functions (Part 2)%1

STAN-CS-73-380 (AIM-209), Yoram Yakimovsky,
%2Scene Analysis Using a Semantic Base for Region Growing%1

STAN-CS-73-393 (AIM-218), Jean Etienne Vuillemin,
%2Proof Techniques for Recursive Programs%1

STAN-CS-74-410 (TR-46), James L. Peterson,
%2Modelling of Parallel Systems%1

STAN-CS-74-412 (AIM-230), Daniel C. Swinehart,
%2COPILOT:  A Multiple Process Approach to Interactive Programming Systems%1

STAN-CS-74-413 (AIM-231), James Gips,
%2Shape Grammars and Their Uses%1

STAN-CS-74-415, Ronald L. Rivest,
%2Analysis of Associative Retrieval Algorithms%1

STAN-CS-74-418, Richard L. Sites,
%2Proving That Computer Programs Terminate Cleanly%1

STAN-CS-74-419 (AIM-233), Charles Rieger, III,
%2Conceptual Memory:  A Theory and Computer Program for Processing the Meaning Content of Natural Language Utterances%1

STAN-CS-74-421 (TR-51), John Wakerly,
%2Low-Cost Error Detection Techniques for Small Computers%1

STAN-CS-74-424 (TR-80), Maurice Schlumberger,
%2Logorithmic Communications Networks (Chapter 1)%1

STAN-CS-74-425 (TR-81), Maurice Schlumberger,
%2Vulnerability of deBruijn Communications Networks (Chapter 2)%1

STAN-CS-74-426 (TR-82), Maurice Schlumberger,
%2Queueing Equal Length Messages in a Logorithmic Network (Chapter 3)%1

STAN-CS-74-437 (AIM-238), C. K. Riesbeck,
%2Computational Understanding:  Analysis of Sentences and Context%1

STAN-CS-74-438 (AIM-239), Marsha Jo Hanna,
%2Computer Matching of Areas in Stereo Images%1

STAN-CS-74-443, Douglas K. Brotz,
%2Embedding Heuristic Problem Solving Methods in a Mechanical Theorem Prover%1

STAN-CS-74-449 (TR-89), A. Smith,
%2Performance Analysis of Computer Systems Components%1

STAN-CS-74-452 (AIM-242), J. R. Low,
%2Automatic Coding:  Choice of Data Structures%1

STAN-CS-74-458 (AIM-245), J. Buchanan,
%2A Study in Automatic Programming%1

STAN-CS-74-461 (AIM-247), N. M. Goldman,
%2Computer Generation of Natural Language from a Deep Conceptual Base%1

STAN-CS-74-463 (AIM-249), Bruce Baumgart,
%2Geometric Modeling for Computer Vision%1

STAN-CS-74-464 (AIM-250), Ramakant Nevatia,
%2Structured Descriptions of Complex Curved Objects for Recognition and Visual Memory%1

STAN-CS-74-465 (AIM-251), E. H. Shortliffe,
%2MYCIN:  A Rule-Based Computer Program for Advising Physicians Regarding Antimicrobial Therapy Selection%1

STAN-CS-75-475 (AIM-257), M. C. Newey,
%2Formal Semantics of LISP with Applications to Program Correctness%1

STAN-CS-75-491, G. D. Knott,
%2Deletion in Binary Storage Trees%1

STAN-CS-75-492, R. Sedgewick,
%2Quicksort%1

STAN-CS-75-494, E. H. Satterthwaite, Jr.,
%2Source Language Debugging Tools%1

STAN-CS-75-496, R. Underwood,
%2An Iterative Block Lanczos Method for the Solution of Large Sparse Symmetric Eigenproblems%1

STAN-CS-75-498 (AIM-259), H. Samet,
%2Automatically Proving the Correctness of Translations Involving Optimized Code%1

STAN-CS-75-499 (AIM-260), D. C. Smith,
%2PYGMALION:  A Creative Programming Environment%1

STAN-CS-75-525 (AIM-272), S. Ganapathy,
%2Reconstruction of Secnes Containing Polyhedra from Stereo Pair of Views%1

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

STAN-CS-76-548, D. Prost O'Leary,
%2Hybrid Conjugate Gradient Algorithms%1

STAN-CS-76-552 (AIM-279), Norihsa Suzuki,
%2Automatic Verification of Programs with Complex Data Structures%1

STAN-CS-76-554, F. S. Yu,
%2Modeling the Write Behavior of Computer Programs%1

STAN-CS-76-556, L. J. Guibas,
%2The Analysis of Hashing Algorithms%1

STAN-CS-76-560 (AIM-282), Russell Taylor,
%2Synthesis of Manipulator Control Programs from Task-level Specifications%1

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

STAN-CS-76-565, J. C. Strikwerda,
%2Initial Boundary Value Problems for Incompletely Parabolic Systems%1

STAN-CS-76-566, Margaret Wright,
%2Numerical Methods for Nonlinearly Constrained Optimization%1

STAN-CS-76-567 (AIM-284), Rafael Finkel,
%2Constructing and Debugging Manipulator Programs%1

STAN-CS-76-570 (AIM-286), Douglas Lenat,
%2AM: An Artificial Intelligence Approach to Discovery in Mathematics as Heuristic Search%1

STAN-CS-76-571 (AIM-287), Michael Roderick,
%2Discrete Control of a Robot Arm%1

STAN-CS-77-591 (AIM-295), Robert C. Bolles,
%2Verification Vision Within a Programmable Assembly System%1

STAN-CS-77-592 (AIM-296), Robert Cartwright, Jr.,
%2A Practical Formal Semantic Definition and Verification Systems for Typed LISP%1

STAN-CS-77-594 (SLAC-200), Edwin P. Stritter,
%2File Migration%1

STAN-CS-77-595, John Gregg Lewis,
%2Algorithms for Sparse Matrix Eigenvalue Problems%1

STAN-CS-77-600, Mark R. Brown,
%2The Analysis of a Practical and Nearly Optimal Priority Queue%1

STAN-CS-77-601, John F. Reiser,
%2Analysis of Additive Random Number Generators%1

STAN-CS-77-608, Istvan Simon,
%2On Some Subrecursive Reducibilities%1

STAN-CS-77-632 (AIM-304), Todd Jeffery Wagner,
%2Hardware Verification%1

STAN-CS-77-633 (AIM-305), William Faught,
%2Motivation and Intensionality in a Computer Simulation Model%1

STAN-CS-77-641 (AIM-308), David Barstow,
%2Automatic Construction of Algorithms%1

STAN-CS-77-644, Bernard Mont-Reynaud,
%2Hierarchical Properties of Flows and the Determination of Inner Loops%1

STAN-CS-78-658 (SLAC-205), Leonard J. Shustek,
%2Analysis and Performance of Computer Instruction Sets%1

STAN-CS-78-659 (SLAC-206), John E. Zolnowsky,
%2Topics in Computational Geometry%1

STAN-CS-78-660 (AIM-313), Bruce E. Shimano,
%2The Kinematic Design and Force Control of Computer Controlled Manipulators%1

STAN-CS-78-671 (AIM-316), Jerrold Ginsparg,
%2Natural Language Processing in an Automatic Programming Domain%1

STAN-CS-78-672, Tony F. C. Chan,
%2Comparison of Numerical Methods for Initial Value Problems%1

STAN-CS-78-676 (SLACR-213), John Phineas Banning,
%2A Method for Determining the Side Effects of Procedure Calls%1

STAN-CS-78-681, Louis Trabb Pardo,
%2Set Representation and Set Intersection%1

STAN-CS-78-682, Jacobo Valdes,
%2Parsing Flowcharts and Series-Parallel Graphs%1

STAN-CS-78-685, Franklin Tai-cheung Luk,
%2Sparse and Parallel Matrix Computations%1

STAN-CS-78-691, Kenneth P. Bube,
%2The Construction of Initial Data for Hyperbolic Systems from Nonstandard Data%1

STAN-CS-78-698, Richard E. Sweet,
%2Empirical Estimates of Program Entropy%1

STAN-CS-78-700 (HPP-78-28), Reid Garfield Smith,
%2A Framework for Problem Solving in a Distributed Processing Environment%1

STAN-CS-79-701, Mitch L Model,
%2Monitoring System Behavior in a Complex Computational Environment%1

STAN-CS-79-705, Robert Lewis (Scot) Drysdale, III,
%2Generalized Voronoi Diagrams and Geometric Searching%1

STAN-CS-78-711, Tom Michael Mitchell,
%2Version Spaces:  An Approach to Concept Learning%1

STAN-CS-79-727 (AIM-327), Robert Elliot Filman,
%2The Interaction of Observation and Inference%1

STAN-CS-79-741, Lyle Harold Ramshaw,
%2Formalizing the Analysis of Algorithms%1

STAN-CS-79-743 (AIM-328), Juan Bulnes-Rozas,
%2GOAL: A Goal Oriented Command Language for Interactive Proof Construction%1

STAN-CS-79-744 (CSL TR-172), Hector Garcia-Molina,
%2Performance of Update Algorithms for Replicated Data in a Distributed Database%1

STAN-CS-79-745, Thomas Lengauer,
%2Upper and Lower Bounds on Time-Space Tradeoffs in a Pebble Game%1

STAN-CS-79-746, Alan Borning,
%2ThingLab -- A Constraint-Oriented Simulation Laboratory%1

STAN-CS-79-747 (AIM-329), David E. Wilkins,
%2Using Patterns and Plans to Solve Problems and Control Search%1

STAN-CS-79-753, Michael Lockhart Overton,
%2Projected Lagrangian Algorithms for Nonlinear Minimax and l↓1 Optimization%1

STAN-CS-79-755 (AIM-331), Elaine Kant,
%2Efficiency Considerations in Program Synthesis: A Knowledge-Based Approach%1