/LMAR=0/XLINE=10/FONT#0=NONM/FONT#1=BASI30/FONT#2=METMB/FONT#3=MATH30/FONT#4=SAIL25/FONT#5=GRKL30/FONT#6=ZERO30/FONT#9=MATH55
␈↓ ↓X␈↓␈↓ ¬FF pointer operationsf

␈↓"β␈↓ ↓X␈↓                        Update to Computer Science Bibliography of Reports

␈↓"β␈↓ ↓X␈↓STAN-CS-80-789␈α∂(PVG-16,␈α⊂AD-A086␈α∂577),␈α⊂D.␈α∂C.␈α⊂Luckham␈α∂and␈α⊂W.␈α∂Polak,␈α⊂␈↓↓Ada␈α∂Exceptions:
␈↓ ↓X␈↓↓Specification and Proof Techniques␈↓, 19 pages, February 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-790␈α
(AD-A086␈α
838),␈α
Gio␈αWiederhold,␈α
␈↓↓Databases␈α
in␈α
Healthcare␈↓,␈α
76␈αpages,␈α
March
␈↓ ↓X␈↓1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-791␈α(CSL␈αTR-166),␈αClark␈αR.␈αWilcox,␈αMary␈αL.␈αDageforde,␈αand␈αGregory␈αA.␈αJirak,
␈↓ ↓X␈↓␈↓↓MAINSAIL Language Manual␈↓, 247 pages, March 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-792␈α(CSL␈αTR-167),␈αClark␈αR.␈αWilcox,␈αMary␈αL.␈αDageforde,␈αand␈αGregory␈αA.␈αJirak,
␈↓ ↓X␈↓␈↓↓MAINSAIL Implementation Overview␈↓, 70 pages, March 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-793␈α"(HPP-80-3,␈α"AD-A089␈α"073),␈α!Avron␈α"Barr␈α"and␈α"James␈α!Davidson,
␈↓ ↓X␈↓␈↓↓Representation of Knowledge␈↓, 90 pages, March 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-794␈α~(AD-A091␈α~122),␈α~Robert␈α→Endre␈α~Tarjan,␈α~␈↓↓Recent␈α~Developments␈α~in␈α→the
␈↓ ↓X␈↓↓Complexity of Combinatorial Algorithms␈↓, 28 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-795, Donald E. Knuth, ␈↓↓The Letter S␈↓, 33 pages, April 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-796 (AIM-335), Arthur Samuel, ␈↓↓Essential E␈↓, 33 pages, March 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-797␈α→(Princeton␈α→TR-267,␈α→AD-A089␈α→913),␈α→Hector␈α→Garcia-Molina␈α~and␈α→Gio
␈↓ ↓X␈↓Wiederhold, ␈↓↓Read-Only Transactions in a Distributed Database␈↓, 25 pages, April 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-798,␈α∀Robert␈α∀W.␈α∃Floyd␈α∀and␈α∀Jeffrey␈α∀D.␈α∃Ullman,␈α∀␈↓↓The␈α∀Compilation␈α∃of␈α∀Regular
␈↓ ↓X␈↓↓Expressions into Integrated Circuits␈↓, 28 pages, April 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-799␈α~(SLAC-PUB-2504),␈α~Jerome␈α~H.␈α~Friedman,␈α~Eric␈α~Grosse,␈α≠and␈α~Werner
␈↓ ↓X␈↓Stuetzle, ␈↓↓Multidimensional Additive Spline Approximation␈↓, 22 pages, May 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-800,␈αDonald␈α
E.␈αKnuth,␈α
␈↓↓Deciphering␈αa␈αLinear␈α
Congruential␈αEncryption␈↓,␈α
10␈αpages,
␈↓ ↓X␈↓April 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-801␈α⊂(AD-A091␈α⊂384),␈α⊂Ramez␈α⊂Aziz␈α∂El-Masri␈α⊂(Thesis),␈α⊂␈↓↓On␈α⊂the␈α⊂Design,␈α⊂Use,␈α∂and
␈↓ ↓X␈↓↓Integration of Data Models␈↓, 228 pages, May 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-802␈α(PVG-17),␈αWolfgang␈αHeinz␈α
Polak␈α(Thesis),␈α␈↓↓Theory␈αof␈α
Compiler␈αSpecification
␈↓ ↓X␈↓↓and Verification␈↓, 288 pages, May 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-803,␈αChristopher␈αJohn␈αVan␈αWyk␈α(Thesis),␈α␈↓↓A␈αLanguage␈αfor␈αTypesetting␈αGraphics␈↓,
␈↓ ↓X␈↓59 pages, May 1980.
␈↓ ↓X␈↓STAN-CS-80-804␈α
(AIM-336),␈αMartin␈α
Brooks␈α(Thesis),␈α
␈↓↓Determining␈αCorrectness␈α
by␈αTesting␈↓,␈α
135
␈↓ ↓X␈↓pages, May 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-805␈α∪(AIM-339,␈α∪AD-A091␈α∪081),␈α∪Donald␈α∪B.␈α∪Gennery␈α∪(Thesis),␈α∪␈↓↓Modelling␈α∩the
␈↓ ↓X␈↓↓Environment of an Exploring Vehicle by Means of Stereo Vision␈↓, 151 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-806,␈α∪by␈α∪William␈α∪M.␈α∪Coughran,␈α∪Jr.␈α∪(Thesis),␈α∪␈↓↓On␈α∪the␈α∪Approximate␈α∪Solution␈α∪of
␈↓ ↓X␈↓↓Hyperbolic Initial-Boundary Value Problems␈↓, 177 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-807␈α(AD-A091␈α123),␈αDavid␈αW.␈αMatula␈αand␈αDanny␈αDolev,␈α␈↓↓Path-Regular␈αGraphs␈↓,
␈↓ ↓X␈↓39 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-808␈α~(AIM-337,␈α→AD-A091␈α~183),␈α→John␈α~McCarthy␈α~(Principal␈α→Investigator),
␈↓ ↓X␈↓Thomas␈α$Binford,␈α$David␈α$Luckham,␈α$Zohar␈α$Manna,␈α$Richard␈α%Weyhrauch␈α$(Associate
␈↓ ↓X␈↓Investigators),␈α∂␈↓↓Basic␈α∞Research␈α∂in␈α∞Artificial␈α∂Intelligence␈α∞and␈α∂Foundations␈α∞of␈α∂Programming␈↓,␈α∞(75
␈↓ ↓X␈↓pages, May 1980).

␈↓"β␈↓ ↓X␈↓STAN-CS-80-809␈α(AIM-338),␈α
Morgan␈αS.␈α
Ohwovoriole␈α(Thesis),␈α␈↓↓An␈α
Extention␈αof␈α
Screw␈αTheory
␈↓ ↓X␈↓↓and its Application to the Automation of Industrial Assemblies␈↓, 186 pages, April 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-810␈α
(AD-A091␈α
124),␈α
J.␈α
Michael␈α
Steele␈α
and␈α
Andrew␈α
C.␈α
Yao,␈α
␈↓↓Lower␈α
Bounds␈α
for
␈↓ ↓X␈↓↓algebraic Decision Trees␈↓, 12 pages, July 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-811␈α∃(PVG-18,␈α⊗AD-A091␈α∃313),␈α⊗Steven␈α∃M.␈α⊗German,␈α∃␈↓↓An␈α⊗Extended␈α∃Semantic
␈↓ ↓X␈↓↓Definition of Pascal for Proving the Absence of Common Runtime Errors␈↓, 57 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-812␈α(HPP-80-14),␈αEdward␈αA.␈αFeigenbaum,␈α␈↓↓Knowledge␈αEngineering:␈αThe␈αApplied
␈↓ ↓X␈↓↓Side of Artificial Intelligence␈↓, 14 pages, September 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-813␈α≤(AIM-340),␈α≠Hans␈α≤Peter␈α≤Moravec␈α≠(Thesis),␈α≤␈↓↓Obstacle␈α≤Avoidance␈α≠and
␈↓ ↓X␈↓↓Navigation in the Real World by a Seeing Robot Rover␈↓, 174 pages, September 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-814␈α⊃(HPP-80-17,␈α⊃AD-A091␈α⊃177),␈α∩Janice␈α⊃S.␈α⊃Aikins␈α⊃(Thesis),␈α∩␈↓↓Prototypes␈α⊃and
␈↓ ↓X␈↓↓Production␈α
Rules:␈α
A␈α
Knowledge␈α∞Representation␈α
for␈α
Computer␈α
Consultations␈↓,␈α
204␈α∞pages,␈α
August
␈↓ ↓X␈↓1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-815␈α⊂(HPP-80-16),␈α⊂Edward␈α⊂H.␈α⊂Shortliffe,␈α⊂M.D.,␈α⊂Ph.D.,␈α⊂␈↓↓Two␈α⊂Papers␈α⊂on␈α∂Medical
␈↓ ↓X␈↓↓Computing␈α∩--␈α∩(1)␈α∩Medical␈α∩Cybernetics:␈α∩The␈α∩Chalenges␈α∩of␈α∩Clinical␈α∩Computing,␈α∪(2)␈α∩Consultation
␈↓ ↓X␈↓↓Systems for Physicians: The Role of Artificial Intelligence Techniques␈↓, 56 pages, July 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-79-816,␈α
Robert␈α
L.␈αBlum,␈α
M.D.,␈α
␈↓↓Automating␈αthe␈α
Study␈α
of␈αClinical␈α
Hypotheses␈α
on␈αa␈α
Time-
␈↓ ↓X␈↓↓Oriented Data Base:  The RX Project␈↓, 12 pages, November 1979.

␈↓"β␈↓ ↓X␈↓STAN-CS-79-817,␈α
Jeffrey␈α
Scott␈α
Vitter␈α
(Thesis),␈α
␈↓↓Analysis␈α
of␈α
Coalesced␈α
Hashing␈↓,␈α
111␈αpages,
␈↓ ↓X␈↓August 1980.
␈↓ ↓X␈↓STAN-CS-80-818␈α∀(AIM-341,␈α∪AD-A091␈α∀187),␈α∪William␈α∀Louis␈α∪Scherlis␈α∀(Thesis),␈α∪␈↓↓Expression
␈↓ ↓X␈↓↓Procedures and Program Derivation␈↓, 178 pages, August 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-819␈α(AD-A091␈α180),␈αChristopher␈αAlan␈αGoad␈α(Thesis)␈α␈↓↓Computational␈αUses␈αof␈αthe
␈↓ ↓X␈↓↓Manipulation of Formal Proofs␈↓, 130 pages, August 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-820␈α⊃(HPP-80-22),␈α⊂William␈α⊃van␈α⊂Melle␈α⊃(Thesis),␈α⊂␈↓↓A␈α⊃Domain-Independent␈α⊂System
␈↓ ↓X␈↓↓That Aids in Constructiong Knowledge-Based Consultation Programs␈↓, 192 pages, June 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-821,␈α↔Doublas␈α⊗B.␈α↔West␈α⊗and␈α↔Craig␈α⊗A.␈α↔Tovey,␈α⊗␈↓↓Semiantichains␈α↔and␈α⊗Unichain
␈↓ ↓X␈↓↓Coverings in Direct Products of Partial Orders␈↓, 20 pages, September 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-822,␈α⊂Bengt␈α⊂Aspvall␈α⊂(Thesis),␈α⊂␈↓↓Efficient␈α⊂Algorithms␈α⊂for␈α⊂certain␈α⊂Satisfiability␈α∂and
␈↓ ↓X␈↓↓Linear Programming Problems␈↓, ? pages, September 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-823,␈α∪David␈α∪Elliot␈α∪Shaw␈α∪(Thesis),␈α∪␈↓↓Knowledge-Based␈α∪Retrieval␈α∪on␈α∀a␈α∪Relational
␈↓ ↓X␈↓↓Database Machine␈↓, 280 pages, August 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-824,␈αTung␈αYun␈αMei,␈α␈↓↓LCCD,␈αA␈αLanguage␈αfor␈αChinese␈αCharacter␈αDesign␈↓,␈α63␈αpages,
␈↓ ↓X␈↓October 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-825,␈α∃C.␈α∃P.␈α∃Schnorr,␈α∃␈↓↓Refined␈α∃Analysis␈α∃and␈α∃Improvements␈α∃on␈α∃Some␈α∀Factoring
␈↓ ↓X␈↓↓Algorithms␈↓, 30 pages, November 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-826,␈α∂Gio␈α∂Wiederhold,␈α∂Anne␈α∂Beetem,␈α∂and␈α∂Garrett␈α∂Short,␈α∂␈↓↓Database␈α⊂Approach␈α∂to
␈↓ ↓X␈↓↓Communication in VLSI Design␈↓, 11 pages, October 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-827,␈α∃Andrew␈α∃Chi-Chih␈α∃Yao,␈α∃␈↓↓On␈α∃the␈α∃Parallel␈α∃Computation␈α∃for␈α∃the␈α∃Knapsack
␈↓ ↓X␈↓↓Problem␈↓, 11 pages, November 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-828,␈αDonald␈αE.␈αKnuth␈αand␈αMichael␈αF.␈αPlass,␈α␈↓↓Breaking␈αParagraphs␈αInto␈αLines␈↓,␈α66
␈↓ ↓X␈↓pages, November 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-829,␈α∩Bengt␈α⊃Aspvall␈α∩and␈α∩Frank␈α⊃Liang,␈α∩␈↓↓The␈α∩Dinner␈α⊃Table␈α∩Problem␈↓,␈α∩13␈α⊃pages,
␈↓ ↓X␈↓December 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-830,␈α_David␈α↔Matula,␈α_Yossi␈α↔Shiloach␈α_and␈α↔Robert␈α_Tarjan,␈α_␈↓↓Two␈α↔Linear-Time
␈↓ ↓X␈↓↓Algorithms for Five-Coloring a Planar Graph␈↓, 23 pages, December 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-831,␈α∀Daniel␈α∀D.␈α∃K.␈α∀Sleator␈α∀(Thesis),␈α∃␈↓↓An␈α∀O(nmlogn)␈α∀Algorithm␈α∃for␈α∀Maximum
␈↓ ↓X␈↓↓Network Flow␈↓, 81 pages, December l980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-832, Danny Dolev, ␈↓↓Scheduling Wide Graphs␈↓, 43 pages, December 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-833,␈α∀John␈α∀Russell␈α∀Gilbert␈α∃(Thesis),␈α∀␈↓↓Graph␈α∀Separator␈α∀Theorems␈α∃and␈α∀ Sparse
␈↓ ↓X␈↓↓Gaussian Elimination␈↓, 104 pages, December 1980.
␈↓ ↓X␈↓STAN-CS-80-834,␈αPetter␈αE.␈αBjorstad␈α(Thesis),␈α␈↓↓Numerical␈αSolution␈αof␈αthe␈αBiharmonic␈αEquation␈↓,
␈↓ ↓X␈↓139 pages, December 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-80-835,␈α
Eric␈α
H.␈αGrosse␈α
(Thesis),␈α
␈↓↓Approximation␈αand␈α
Optimization␈α
of␈αElectron␈α
Density
␈↓ ↓X␈↓↓Maps␈↓, 118 pages, December 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-836,␈α
Zohar␈α
Manna␈αand␈α
Amir␈α
Pnueli,␈α␈↓↓Temporal␈α
Verification␈α
of␈αConcurrent␈α
Programs,
␈↓ ↓X␈↓↓Part I: The Temporal Framework for Concurrent Programs␈↓, 70 pages, January 1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-837,␈α∪Bruce␈α∪G.␈α∪Buchanan,␈α∪␈↓↓Research␈α∩on␈α∪Expert␈α∪Systems␈↓,␈α∪38␈α∪pages,␈α∩February
␈↓ ↓X␈↓1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-838, Peter Brown, ␈↓↓Dynamic Program Building␈↓, 13 pages, February 1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-839, Arthur L. Samuel, ␈↓↓Short Waits␈↓, 37 pages, February 1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-840,␈α⊃Donald␈α⊃E.␈α∩Knuth,␈α⊃␈↓↓Verification␈α⊃of␈α∩Link-Level␈α⊃Protocols␈↓,␈α⊃6␈α∩pages,␈α⊃January
␈↓ ↓X␈↓1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-841, Donald E. Knuth, ␈↓↓Huffman's Algorithm via Algebra␈↓, 6 pages, March 1981.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-842,␈αMichael␈αR.␈α
Genesereth,␈α␈↓↓The␈αRole␈αof␈α
Plans␈αIn␈αIntelligent␈α
Teaching␈αSystems␈↓,
␈↓ ↓X␈↓19 pages, November 1980.

␈↓"β␈↓ ↓X␈↓STAN-CS-81-843,␈α
Zohar␈α
Manna␈αand␈α
Amir␈α
Pnueli,␈α␈↓↓Temporal␈α
Verification␈α
of␈αConcurrent␈α
Programs,
␈↓ ↓X␈↓↓Part II: Proving Invariances␈↓, 30 pages, March 1981

␈↓"β␈↓ ↓X␈↓STAN-CS-81-844,␈α
Zohar␈α
Manna␈αand␈α
Amir␈α
Pnueli,␈α␈↓↓Temporal␈α
Verification␈α
of␈αConcurrent␈α
Programs,
␈↓ ↓X␈↓↓Part III:  Proving Eventualities␈↓, 35 pages, March 1981

␈↓"β␈↓ ↓X␈↓STAN-CS-81-845,␈α
Zohar␈α
Manna␈αand␈α
Amir␈α
Pnueli,␈α␈↓↓Temporal␈α
Verification␈α
of␈αConcurrent␈α
Programs,
␈↓ ↓X␈↓↓Part IV:  The Non-temporal Alternative␈↓, 45 pages, March 1981