perm filename BIBUPD.MSS[BIB,CSR] blob sn#614592
filedate 1981-09-30 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00002 00002 .require "setup.csr[bib,csr]" source file
.require "setup.csr[bib,csr]" source file;
F pointer operationsf
Update to Computer Science Bibliography of Reports
STAN-CS-80-789 (PVG-16, AD-A086 577), D. C. Luckham and W. Polak, %2Ada
Exceptions: Specification and Proof Techniques%1, 19 pages, February
STAN-CS-80-790 (AD-A086 838), Gio Wiederhold, %2Databases in Healthcare%1,
76 pages, March 1980.
STAN-CS-80-791 (CSL TR-166), Clark R. Wilcox, Mary L. Dageforde, and
Gregory A. Jirak, %2MAINSAIL Language Manual%1, 247 pages, March 1980.
STAN-CS-80-792 (CSL TR-167), Clark R. Wilcox, Mary L. Dageforde, and
Gregory A. Jirak, %2MAINSAIL Implementation Overview%1, 70 pages, March
STAN-CS-80-793 (HPP-80-3, AD-A089 073), Avron Barr and James Davidson, %2Representation
of Knowledge%1, 90 pages, March 1980.
STAN-CS-80-794 (AD-A091 122), Robert Endre Tarjan, %2Recent Developments in the
Complexity of Combinatorial Algorithms%1, 28 pages, June 1980.
STAN-CS-80-795, Donald E. Knuth, %2The Letter S%1, 33 pages, April 1980.
STAN-CS-80-796 (AIM-335), Arthur Samuel, %2Essential E%1, 33 pages, March
STAN-CS-80-797 (Princeton TR-267, AD-A089 913), Hector Garcia-Molina and Gio
Wiederhold, %2Read-Only Transactions in a Distributed Database%1, 25
pages, April 1980.
STAN-CS-80-798, Robert W. Floyd and Jeffrey D. Ullman, %2The Compilation
of Regular Expressions into Integrated Circuits%1, 28 pages, April 1980.
STAN-CS-80-799 (SLAC-PUB-2504), Jerome H. Friedman, Eric Grosse, and
Werner Stuetzle, %2Multidimensional Additive Spline Approximation%1, 22
pages, May 1980.
STAN-CS-80-800, Donald E. Knuth, %2Deciphering a Linear Congruential
Encryption%1, 10 pages, April 1980.
STAN-CS-80-801 (AD-A091 384), Ramez Aziz El-Masri (Thesis), %2On the Design, Use, and
Integration of Data Models%1, 228 pages, May 1980.
STAN-CS-80-802 (PVG-17), Wolfgang Heinz Polak (Thesis), %2Theory of
Compiler Specification and Verification%1, 288 pages, May 1980.
STAN-CS-80-803, Christopher John Van Wyk (Thesis), %2A Language for
Typesetting Graphics%1, 59 pages, May 1980.
STAN-CS-80-804 (AIM-336), Martin Brooks (Thesis), %2Determining
Correctness by Testing%1, 135 pages, May 1980.
STAN-CS-80-805 (AIM-339, AD-A091 081), Donald B. Gennery (Thesis), %2Modelling the Environment of
an Exploring Vehicle by Means of Stereo Vision%1, 151 pages, June 1980.
STAN-CS-80-806, by William M. Coughran, Jr. (Thesis), %2On the Approximate
Solution of Hyperbolic Initial-Boundary Value Problems%1, 177 pages, June
STAN-CS-80-807 (AD-A091 123), David W. Matula and Danny Dolev, %2Path-Regular Graphs%1,
39 pages, June 1980.
STAN-CS-80-808 (AIM-337, AD-A091 183),
John McCarthy (Principal Investigator), Thomas Binford, David Luckham,
Zohar Manna, Richard Weyhrauch (Associate Investigators),
%2Basic Research in Artificial Intelligence and Foundations of Programming%1,
(75 pages, May 1980).
STAN-CS-80-809 (AIM-338), Morgan S. Ohwovoriole (Thesis), %2An Extention
of Screw Theory and its Application to the Automation of Industrial
Assemblies%1, 186 pages, April 1980.
STAN-CS-80-810 (AD-A091 124), J. Michael Steele and Andrew C. Yao, %2Lower Bounds for
algebraic Decision Trees%1, 12 pages, July 1980.
STAN-CS-80-811 (PVG-18, AD-A091 313), Steven M. German, %2An Extended Semantic
Definition of Pascal for Proving the Absence of Common Runtime Errors%1,
57 pages, June 1980.
STAN-CS-80-812 (HPP-80-14), Edward A. Feigenbaum, %2Knowledge Engineering:
The Applied Side of Artificial Intelligence%1, 14 pages, September 1980.
STAN-CS-80-813 (AIM-340), Hans Peter Moravec (Thesis), %2Obstacle
Avoidance and Navigation in the Real World by a Seeing Robot Rover%1, 174
pages, September 1980.
STAN-CS-80-814 (HPP-80-17, AD-A091 177), Janice S. Aikins (Thesis), %2Prototypes and
Production Rules: A Knowledge Representation for Computer Consultations%1,
204 pages, August 1980.
STAN-CS-80-815 (HPP-80-16), Edward H. Shortliffe, M.D., Ph.D., %2Two
Papers on Medical Computing -- (1) Medical Cybernetics: The Chalenges of
Clinical Computing, (2) Consultation Systems for Physicians: The Role of
Artificial Intelligence Techniques%1, 56 pages, July 1980.
STAN-CS-79-816, Robert L. Blum, M.D., %2Automating the Study of Clinical
Hypotheses on a Time-Oriented Data Base: The RX Project%1, 12 pages,
STAN-CS-79-817, Jeffrey Scott Vitter (Thesis), %2Analysis of Coalesced
Hashing%1, 111 pages, August 1980.
STAN-CS-80-818 (AIM-341, AD-A091 187), William Louis Scherlis (Thesis), %2Expression
Procedures and Program Derivation%1, 178 pages, August 1980.
STAN-CS-80-819 (AD-A091 180), Christopher Alan Goad (Thesis), %2Computational Uses
of the Manipulation of Formal Proofs%1,130 pages, August 1980.
STAN-CS-80-820 (HPP-80-22), William van Melle (Thesis), %2A Domain-Independent
System That Aids in Constructiong Knowledge-Based Consultation Programs%1,
192 pages, June 1980.
STAN-CS-80-821, Doublas B. West and Craig A. Tovey, %2Semiantichains and Unichain
Coverings in Direct Products of Partial Orders%1, 20 pages, September 1980.
STAN-CS-80-822,Bengt Aspvall (Thesis),%2Efficient Algorithms for certain
Satisfiability and Linear Programming Problems%1, 59 pages, September 1980.
STAN-CS-80-823, David Elliot Shaw (Thesis), %2Knowledge-Based Retrieval on a
Relational Database Machine%1, 280 pages, August 1980.
STAN-CS-80-824,Tung Yun Mei, %2LCCD, A Language for Chinese Character Design%1,
63 pages, October 1980.
STAN-CS-80-825, C. P. Schnorr, %2Refined Analysis and Improvements on Some
Factoring Algorithms%1, 30 pages, November 1980.
STAN-CS-80-826,Gio Wiederhold, Anne Beetem, and Garrett Short, %2Database
Approach to Communication in VLSI Design%1, 11 pages, October 1980.
STAN-CS-80-827, Andrew Chi-Chih Yao, %2On the Parallel Computation for the
Knapsack Problem%1, 11 pages, November 1980.
STAN-CS-80-828, Donald E. Knuth and Michael F. Plass, %2Breaking Paragraphs
Into Lines%1, 66 pages, November 1980.
STAN-CS-80-829, Bengt Aspvall and Frank Liang, %2The Dinner Table Problem%1,
13 pages, December 1980.
STAN-CS-80-830, David Matula, Yossi Shiloach and Robert Tarjan, %2Two Linear-
Time Algorithms for Five-Coloring a Planar Graph%1, 23 pages, December 1980.
STAN-CS-80-831, Daniel D. K. Sleator (Thesis), %2An O(nmlogn) Algorithm for Maximum
Network Flow%1, 81 pages, December l980.
STAN-CS-80-832, Danny Dolev, %2Scheduling Wide Graphs%1, 43 pages, December 1980.
STAN-CS-80-833, John Russell Gilbert (Thesis), %2Graph Separator Theorems and
Sparse Gaussian Elimination%1, 104 pages, December 1980.
STAN-CS-80-834, Petter E. Bjorstad (Thesis), %2Numerical Solution of the Biharmonic
Equation%1, 139 pages, December 1980.
STAN-CS-80-835, Eric H. Grosse (Thesis), %2Approximation and Optimization of
Electron Density Maps%1, 118 pages, December 1980.
STAN-CS-81-836, Zohar Manna and Amir Pnueli, %2Verification of Concurrent
Programs, Part I: The Temporal Framework%1, 62 pages, June 1981.
STAN-CS-81-837, Bruce G. Buchanan, %2Research on Expert Systems%1,
37 pages, March 1981.
STAN-CS-81-838, Peter Brown, %2Dynamic Program Building%1, 13 pages,
STAN-CS-81-839, Arthur L. Samuel, %2Short Waits%1, 37 pages, February 1981.
STAN-CS-81-840, Donald E. Knuth, %2Verification of Link-Level Protocols%1,
6 pages, January 1981.
STAN-CS-81-841, Donald E. Knuth, %2Huffman's Algorithm via Algebra%1,
6 pages, March 1981.
STAN-CS-81-842, Michael R. Genesereth, %2The Role of Plans In Intelligent
Teaching Systems%1, 19 pages, November 1980.
STAN-CS-81-843, Zohar Manna and Amir Pnueli, %2Verification of Concurrent
Programs, Part II: Temporal Proof Principles%1, 51 pages, September 1981.
STAN-CS-81-844, Zohar Manna and Amir Pnueli, %2Verification of Concurrent
Programs, Part III: Proving Eventualities%1, 35 pages, March 1981.
STAN-CS-81-845, Zohar Manna and Amir Pnueli, %2Verification of Concurrent
Programs, Part IV: The Non-temporal Alternative%1, 45 pages, March 1981.
STAN-CS-81-846, Danny Dolev, %2The Byzantine Generals Strike Again%1,
26 pages, March 1981.
STAN-CS-81-847, Henry F. Korth, %2The Optimal Locking Problem in a Directed
Acyclic Graph%1, 6 pages, March 1981.
STAN-CS-81-848, Chih-sung Tang, %2On the Problem of Inputting Chinese
Characters%1, 9 pages, April 1981.
STAN-CS-81-849, Tohru Nishigaki, %2Experiments on the Knee Criterion in a
Multiprogrammed Computer System%1, 28 pages, March 1981.
STAN-CS-81-850, Alfred Z. Spector, %2Performing Remote Operations Efficiently
on a Local Computer Network%1, 23 pages, December 1980.
STAN-CS-81-851, Gio Wiederhold, %2Binding in Information Processing%1,
41 pages, May 1981.
STAN-CS-81-852, Jeffrey D. Ullman, %2A View of Directions in Relational Database
Theory%1, 9 pages, May 1981.
STAN-CS-81-853, David Maier & Jeffrey D. Ullman, %2Connections in Acyclic
Hypergraphs%1, 10 pages, May 1981.
STAN-CS-81-854, D. Dolev & A.C. Yao, %2On the Security of Public Key Protocols%1,
22 pages, May 1981.
STAN-CS-81-855, Z. Manna & R. Waldinger, %2Deductive Synthesis of the Unification
Algorithm%1, 51 pages, June 1981.
STAN-CS-81-856, Richard P. Gabriel (Thesis), %2An Organization for Programs in
Fluid Domains%1, 190 pages, May 1981.
STAN-CS-81-857, Jonathan Jay King(Thesis), %2Query Optimization by Semantic
Reasoning%1, 128 pages, May 1981.
STAN-CS-81-858, V. Pan,
%2The Bit-Operation Complexity of Approximate Evaulation of Matrix & Polynomial
Products Using Modular Arithmetic%1, 6 pages, June 1981.
STAN-CS-81-859, V. Pan, %2The Additive and Logical Complexities of Linear
and Bilinear Arithmetic Algorithms%1, 21 pages, June 1981.
STAN-CS-81-860, Daniel Boley (Thesis), %2Computing the Controllability/Observability
Decomposition of a Linear Time Invariant Dynamic System, A Numerical Approach%1,
81 pages, June 1981.
STAN-CS-81-861, Rodney A. Brooks(Thesis), %2Symbolic Reasoning Among 3-D Models
and 2-D Images%1, 181 pages, June 1981.
STAN-CS-81-862, V. Pan, %2The Lower Bounds on the Additive Complexity of Bilinear
Problems in Terms of Some Algebraic Quantities%1, 4 pages, June 1981.
STAN-CS-81-863, Donald E. Knuth & Allan A. Miller, %2A Programming and Problem-
Solving Seminar%1, 84 pages, June 1981.
STAN-CS-81-864, Jon Doyle, %2Three Short Essays on Decisions, Reasons, and Logics%1,
19 pages, May 1981.
STAN-CS-81-865, Chih-sung Tang, %2Toward A Unified Logical Basis for Programming
Languages%1, 21 pages, June 1981.
STAN-CS-81-867, D.C. Luckham, H.J. Larsen, D.R. Stevenson, F.W. von Henke,
%2ADAM - An Ada Based Language for Multi-processing%1, 71 pages, July 1981.
STAN-CS-81-868, Donald E. Knuth, %2The Last Whole Errata Catalog%1, 42 pages,
STAN-CS-81-869,Carolyn E. Tajnai, %2Comprehensive Examinations in Computer
Science - 1978/79 to 1980/81%1, 225 pages, July 1981.
STAN-CS-81-870, Michael F. Plass(Thesis), %2Optimal Pagination Techniques for
Automatic Typesetting Systems%1, 77 pages, June 1981.
STAN-CS-81-871, Howard W. Trickey, %2Good Layouts for Pattern Recognizers%1,
15 pages, August 1981.
STAN-CS-81-872, Z. Manna & Pierre Wolper, %2Synthesis of Communicating Processes
from Temporal Logic Specifications%1, 28 pages, September 1981.
STAN-CS-81-873, Richard William Carr(Thesis), %2Virtual Memory Management%1,
230 pages, August 1981.
STAN-CS-81-874, Alfred Z. Spector(Thesis), %2Multiprocessing Architectures for
Local Computer Networks%1, 125 pages, August 1981.
STAN-CS-81-875, T. C. Hu & M. T. Shing, %2Computation of Matrix Chain Products,
Part I, Part II%1, 124 pages, September 1981.