@Preamble{
"\input bibnames.sty " #
"\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi"
}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{inst-STAN-CS = "Stanford University, Department of Computer
Science"}
@String{inst-STAN-CS:adr = "Stanford, CA, USA"}
@String{j-LINEAR-ALGEBRA-APPL = "Linear Algebra and its Applications"}
@String{j-NUM-MATH = "Numerische Mathematik"}
@String{j-SIAM-REVIEW = "SIAM Review"}
@String{pub-AMS = "American Mathematical Society"}
@String{pub-AMS:adr = "Providence, RI, USA"}
@String{pub-DP = "Digital Press"}
@String{pub-DP:adr = "12 Crosby Drive, Bedford, MA 01730,
USA"}
@String{pub-KLUWER = "Kluwer Academic Publishers"}
@String{pub-KLUWER:adr = "Norwell, MA, USA, and Dordrecht, The
Netherlands"}
@String{pub-OXFORD = "Oxford University Press"}
@String{pub-OXFORD:adr = "Walton Street, Oxford OX2 6DP, UK"}
@TechReport{Rosen:1963:PPP,
author = "J. B. Rosen",
title = "Primal Partition Programming for Block Diagonal
Matrices",
type = "Technical Report",
number = "STAN-CS-63-1 (AD462108)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = nov,
year = "1963",
bibdate = "Thu Nov 20 14:45:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pavkovich:1963:SLS,
author = "John M. Pavkovich",
title = "The Solution of Large Systems of Algebraic Equations",
type = "Technical Report",
number = "CS-TR-63-2 (AD427753)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = dec,
year = "1963",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-63-2.html",
abstract = "The solution of a system of linear algebraic equations
using a computer is not a difficult problem as long as
the equations are not ill-conditioned and all of the
coefficients can be stored in the computer. However,
when the number of coefficients is so large that
supplemental means of storage, such as magnetic tape,
are required, the problem of solving the system in an
efficient manner increases considerably. This paper
describes a method of solution whereby such systems of
equations can be solved in an efficient manner. The
problems associated with ill-conditioned systems of
equations are not discussed.",
acknowledgement = ack-nhfb,
pdfpages = "50",
}
@TechReport{Forsythe:1964:TPV,
author = "G. E. Forsythe",
title = "The Theorems in a Paper by {V. K. Saulev,
\booktitle{On an Estimate of the Error in Obtaining
Characteristic Functions by the Method of Finite
Differences}}",
type = "Technical Report",
number = "STAN-CS-64-3 (AD430445)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = jan,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Translation from Russian to English by GEF.",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
}
@TechReport{Bergman:1964:NSB,
author = "Stefan Bergman and J. G. Herriot",
title = "Numerical Solution of Boundary Value Problems by the
Method of Integral Operators",
type = "Technical Report",
number = "STAN-CS-64-4 (AD434858)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = feb,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rosen:1964:EUE,
author = "J. B. Rosen",
title = "Existence and Uniqueness of Equilibrium Points for
Concave {$N$}-Person Games",
type = "Technical Report",
number = "STAN-CS-64-5 (N-6519765)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = mar,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hockney:1964:FDS,
author = "Roger W. Hockney",
title = "A fast direct solution of {Poisson}'s equation using
{Fourier} analysis",
type = "Technical Report",
number = "STAN-CS-64-6 (AD600164)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 39",
day = "14",
month = apr,
year = "1964",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-64-6.html",
abstract = "The demand for rapid procedures to solve Poisson's
equation has lead to the development of a direct method
of solution involving Fourier analysis which can solve
Poisson's equation in a square region covered by a $ 48
\times 48 $ mesh in 0.9 seconds on the IBM 7090. This
compares favorably with the best iterative methods
which would require about 10 seconds to solve the same
problem. The method is applicable to rectangular
regions with simple boundary conditions and the maximum
observed error in the potential for several random
charge distributions is $ 5 \times 10^{-7} $ of the
maximum potential charge in the region.",
acknowledgement = ack-nhfb,
pdfpages = "42",
}
@TechReport{Rosen:1964:SCO,
author = "J. B. Rosen",
title = "Sufficient Conditions for Optimal Control of Convex
Processes",
type = "Technical Report",
number = "STAN-CS-64-7 (PE3176753)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = may,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1964:CSV,
author = "Gene H. Golub and William Kahan",
title = "Calculating the Singular Values and Pseudo-inverse of
a Matrix",
type = "Technical Report",
number = "STAN-CS-64-8 (AD6031 16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = may,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
}
@TechReport{Andersen:1964:AMF,
author = "Christian Andersen",
title = "The {$ Q D $}-Algorithm as a Method for Finding the
Roots of a Polynomial Equation When All Roots are
Positive",
type = "Technical Report",
number = "STAN-CS-64-9 (AD604012)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "74",
month = jun,
year = "1964",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-64-9.html",
abstract = "The Quotient--Difference (QD)-scheme, symmetric
functions and some results from the theory of Hankel
determinants are treated. Some well known relations
expressing the elements of the QD-scheme by means of
the Hankel determinants are presented. The question of
convergence of the columns of the QD-scheme is treated.
An exact expression for $ q_n^k $ is developed for the
case of different roots. It is proved that the columns
of the QD-scheme will converge not only in the well
known case of different roots, but in all cases where
the roots are positive. A detailed examination of the
convergence to the smallest root is presented. An exact
expression for $ q_n^N $ is developed. This expression
is correct in all cases of multiple positive roots. It
is shown that the progressive form of the QD-algorithm
is only 'mildly unstable'. Finally, some ALGOL programs
and some results obtained by means of these are
given.",
acknowledgement = ack-nhfb,
pdfpages = "86",
xxauthor = "Charles Anderson",
xxnumber = "CS-TR-64-9",
}
@TechReport{Causey:1964:CNM,
author = "R. L. Causey",
title = "On Closest Normal Matrices",
type = "Technical Report",
number = "STAN-CS-64-10 (AD603163)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = jun,
year = "1964",
bibdate = "Thu Nov 20 14:48:03 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Nakamura:1964:EPA,
author = "Tsuneyoshi Nakamura and Judah {Ben Rosen}",
title = "Elastic-plastic analysis of trusses by the gradient
projection method",
type = "Technical Report",
number = "CS-TR-64-11 (PB176754)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 32",
day = "17",
month = jul,
year = "1964",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-64-11.html",
abstract = "The gradient projection method has been applied to the
problem of obtaining the elastic-plastic response of a
perfectly plastic ideal truss with several degrees of
redundancy to several independently varying sets of
quasi-static loads. It is proved that the minimization
of stress rate intensity subject to a set of yield
inequalities is equivalent to the maximization process
of the gradient projection method. This equivalence
proof establishes the basis of the computational
method. The technique is applied to the problem of
investigating the possibilities of shake down and to
limit analysis. A closed convex `safe load domain' is
defined to represent the load carrying capacity
characteristics of a truss subjected to various
combinations of the several sets of loads.",
acknowledgement = ack-nhfb,
pdfpages = "36",
}
@TechReport{Golub:1964:NMS,
author = "Gene H. Golub and Peter A. Businger",
title = "{{\booktitle{Numerical methods for solving linear
least squares problems}} (by G. Golub); \booktitle{An
ALGOL procedure for finding linear least squares
solutions} (by Peter Businger)}",
type = "Technical Report",
number = "STAN-CS-64-12 (AD608292)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 27",
day = "28",
month = aug,
year = "1964",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-64-12.html",
abstract = "A common problem in a Computer Laboratory is that of
finding linear least squares solutions. These problems
arise in a variety of areas and in a variety of
contexts. Linear least squares problems are
particularly difficult to solve because they frequently
involve large quantities of data, and they are
ill-conditioned by their very nature. In this paper, we
shall consider stable numerical methods for handling
these problems. Our basic tool is a matrix
decomposition based on orthogonal Householder
transformations.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "32",
xxnumber = "CS-TR-64-12 (AD608292)",
}
@TechReport{Pereyra:1964:CPM,
author = "Victor Pereyra and Judah {Ben Rosen}",
title = "Computation of the pseudoinverse of a matrix of
unknown rank",
type = "Technical Report",
number = "CS-TR-64-13 (N6527058)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1964",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-64-13.html",
abstract = "A program is described which computes the
pseudoinverse, and other related quantities, of an $ m
\times n $ matrix $A$ of unknown rank. The program
obtains least square solutions to singular and\slash or
inconsistent linear systems $ A x = B$, where $ m \leq
n$ or $ m > n$ and the rank of $A$ may be less than $
\min (m, n)$. A complete description of the programs
and its use is given, including computational
experience on a variety of problems.",
acknowledgement = ack-nhfb,
pdfpages = "30",
}
@TechReport{Efimenko:1964:ACE,
author = "V. A. Efimenko",
title = "On Approximate Calculations of the Eigenvalues and
Eigenfunctions of Boundary Value Problems in Partial
Differential Equations",
type = "Technical Report",
number = "STAN-CS-64-14 (TT-65-61724)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = nov,
year = "1964",
bibdate = "Thu Nov 20 15:10:53 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Translated by G. Reiter and C. Moler.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Grace:1965:CSN,
author = "D. W. Grace",
title = "Computer Search for Non-Isomorphic Convex Polyhedra",
type = "Technical Report",
number = "STAN-CS-65-15 (AD61 1366)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "137",
month = jan,
year = "1965",
bibdate = "Thu Nov 20 15:10:53 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Forsythe:1965:MSD,
author = "George E. Forsythe and Gene H. Golub",
title = "Maximizing a second-degree polynomial on the unit
sphere",
type = "Technical Report",
number = "STAN-CS-65-16 (AD611427)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 31",
day = "5",
month = feb,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-16.html",
abstract = "Let $A$ be a Hermitian matrix of order $n$, and $b$ a
known vector in $ C^n$. The problem is to determine
which vectors make $ \Phi (x) = {(x - b)}^H A(x - b)$ a
maximum or minimum on the unit sphere {$ U = \{ x
\colon x^H x = 1 \} $}. The problem is reduced to the
determination of a finite point set, the spectrum of $
(A, b)$. The theory reduces to the usual theory of
Hermitian forms when $ b = 0$.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); George Elmer Forsythe (8 January 1917--9 April
1972)",
pdfpages = "36",
xxnumber = "CS-TR-65-16",
}
@TechReport{Forsythe:1965:AGP,
author = "George E. Forsythe and Niklaus Wirth",
title = "Automatic Grading Programs",
type = "Technical Report",
number = "CS-TR-65-17",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 17",
month = feb,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/65/17/CS-TR-65-17.pdf;
http://i.stanford.edu/TR/CS-TR-65-17.html",
abstract = "The ALGOL grader programs are presented for the
computer evaluation of student ALGOL programs. One is
for a beginner's program; it furnishes random data and
checks answers. The other provides a searching test of
the reliability and efficiency of a rootfinding
procedure. There is a statement of the essential
properties of a computer system, in order that grader
programs can be effectively used.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972);
Niklaus Wirth (15 February 1934--1 January 2024)",
pdfpages = "19",
}
@TechReport{Pereyra:1965:DCM,
author = "Victor Pereyra",
title = "The difference correction method for non-linear
two-point boundary value problems",
type = "Technical Report",
number = "CS-TR-65-18",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-18.html",
abstract = "The numerical solution of non-linear two-point
boundary value problems is discussed. It is shown that
for a certain class of finite difference approximations
the a posteriori use of a difference correction raises
the order of the approximation by at least two orders.
The difference correction itself involves only the
solution of one system of linear equations. If Newton's
method is used in the early stage, then it is shown
that the matrices in both processes are identical,
which is a useful feature in coding the method for an
automatic computer. Several numerical examples are
given.",
acknowledgement = ack-nhfb,
pdfpages = "42",
}
@TechReport{Ageev:1965:EEM,
author = "M. I. Ageev and J. Maclaren",
title = "{English} Equivalents of Metalinguistic Terms of
{Russian ALGOL}",
type = "Technical Report",
number = "STAN-CS-65-19 (TT-65-61839)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "115",
month = apr,
year = "1965",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wirth:1965:EGA,
author = "Niklaus Wirth and Helmut Weber",
title = "{EULER}: a Generalization of {ALGOL}, and its Formal
Definition",
type = "Technical Report",
number = "CS-TR-65-20",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xv + 115",
day = "27",
month = apr,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/65/20/CS-TR-65-20.pdf;
http://i.stanford.edu/TR/CS-TR-65-20.html",
abstract = "A method for defining programming languages is
developed which introduces a rigorous relationship
between structure and meaning. The structure of a
language is defined by a phrase structure syntax, the
meaning in terms of the effects which the execution of
a sequence of interpretation rules exerts upon a fixed
set of variables, called the Environment. There exists.
a one-to-one correspondence between syntactic rules and
interpretation rules, and the sequence of executed
interpretation rules is determined by the sequence of
corresponding syntactic reductions which constitute a
parse.\par
The individual interpretation rules are explained in
terms of an elementary and obvious algorithmic
notation. A constructive method for evaluating a text
is provided, and for certain decidable classes of
languages their unambiguity is proven. As an example, a
generalization of ALGOL is described in full detail to
demonstrate that concepts like block-structure,
procedures, parameters etc. can be defined adequately
and precisely by this method.",
acknowledgement = ack-nhfb,
author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
pdfpages = "130",
}
@TechReport{Fisher:1965:VAD,
author = "Donald D. Fisher and Jobst von der Groeben and J.
Gerald Toole",
title = "Vectorcardiographic analysis by digital computer,
selected results",
type = "Technical Report",
number = "CS-TR-65-21",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-21.html",
abstract = "Instrumentation, recording devices and digital
computers now may be combined to obtain detailed
statistical measures of physiological phenomena.
Computers make it possible to study several models of a
system in depth as well as breadth. This report is
concerned with methods employed in a detailed
statistical study of some 600 vectorcardiograms from
different `normal' individuals which were recorded on
analog magnetic tape using two different orthogonal
lead systems (Helm, Frank) giving a total of 1200
cardiograms. A `normal' individual is defined as one in
which no abnormal heart condition was detected by
either medical history or physical examination. One
heartbeat in a train of 15 or 20 was selected for
digitization. An average of 1.2 seconds worth of data
was digitized from each of the three vector leads
simultaneously at a rate of 1000 samples per second for
each lead giving a total of over $ {4.10}^6 $ values.
Statistical models by sex and lead system of the P wave
and QRS complex (at 1 millisecond intervals) and T wave
(normalized to 60 points in time) were obtained for 43
age groups from age 19 to 61 in rectangular
coordinates, polar coordinates and ellipsoidal fit
(F-test) coordinates. Several programs were written to
perform the analyses on an IBM 7090. Two of the
programs used 300000+ words of disk storage to collect
the necessary statistics. Various aspects of the study
are presented in this report.",
acknowledgement = ack-nhfb,
pdfpages = "108",
}
@TechReport{Moler:1965:FDM,
author = "C. B. Moler",
title = "Finite Difference Methods for the Eigenvalues of
{Laplace}'s Operator",
type = "Technical Report",
number = "STAN-CS-65-22 (AD616676)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "142",
month = may,
year = "1965",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/citations/AD0616675",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rudin:1965:CPA,
author = "Bernard D. Rudin",
title = "Convex polynomial approximation",
type = "Technical Report",
number = "CS-TR-65-23",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 44",
day = "4",
month = jun,
year = "1965",
DOI = "https://doi.org/10.5555/891684",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-23.html;
https://dl.acm.org/doi/10.5555/891684;
https://www.proquest.com/pqdtglobal/results/C5640F46CA624452PQ/",
abstract = "Let $ f(t) $ be a continuous function on $ [0, 1] $,
or let it be discretely defined on a finite point set
in $ [0, 1] $. The problem is the following: among all
polynomials $ p(t) $ of degree $n$ or less which are
convex on $ [0, 1] $, find one which minimizes the
functional $ \vert p(t) - f(t) \vert $, where $ \vert
\cdot \vert $ is a suitably defined norm (in
particular, the $ L^p $, $ \ell^p $, and Chebyshev
norms). The problem is treated by showing it to be a
particular case of a more general problem: let $f$ be
an element of a real normed linear space $V$; let $ x_1
(z), \ldots, x_k(z) $ be continuous functions on a
subset $S$ of the Euclidean space $ E^n $ into $V$ such
that for each $ z_o $ in $S$ the set $ \{ x_1 (z_o),
\ldots, x_k(z_o) \} $ is linearly independent in $V$;
let $ (y_1, \ldots, y_k) $ denote an element of the
Euclidean space $ E^k $ and let $H$ be a subset of $
K^k $; then among all $ (y, z)$ in $ H \times S $, find
one which minimizes the functional $ \vert y_1 x_1 (z)
+ \ldots {} + y_k x_k(z) - f \vert $. It is shown that
solutions to this problem exist when $H$ is closed and
$S$ is compact. Conditions for uniqueness and location
of solutions on the boundary of $ H \times S $ are also
given. Each polynomial of degree $ n + 2$ or less which
is convex on $ [0, 1] $ is shown to be uniquely
representable in the form $ y_o + y_1 t + y_2 \int \int
p(z, t) d t^2 $, where $ p(z, t) $ is a certain
representation of the polynomials positive on $ [0, 1]
$, $ y_2 \geq 0 $, and $z$ is constrained to lie in a
certain convex hyperpolyhedron. With this
representation, the convex polynomial approximation
problem can be treated by the theory mentioned above.
It is reduced to a problem of minimizing a functional
subject to linear constraints. Computation of best
least squares convex polynomial approximation is
illustrated in the continuous and discrete cases.",
acknowledgement = ack-nhfb,
pdfpages = "48",
remark = "This is the author's thesis. The abstract text with
complicated math text from the HTML file is not in the
PDF file, and the full thesis text is not available in
the Proquest database to check against.",
}
@TechReport{Klyuyev:1965:MNA,
author = "V. V. Klyuyev and N. I. Kokovkin Shoherbak",
title = "On the Minimization of the Number of Arithmetic
Operations for the Solution of Linear Algebraic Systems
of Equations",
type = "Technical Report",
number = "STAN-CS-65-24 (AD616611)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = jun,
year = "1965",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Translated by G. J. Tee.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hodge:1965:YPL,
author = "Philip G. {Hodge, Jr.}",
title = "Yield-point load determination by nonlinear
programming",
type = "Technical Report",
number = "CS-TR-65-25",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-25.html",
abstract = "The determination of the yield-point load of a
perfectly plastic structure can be formulated as a
nonlinear programming problem by means of the theorems
of limit analysis. This formulation is discussed in
general terms and then applied to the problem of a
curved beam. Recent results in the theory of nonlinear
programming are called upon to solve typical problems
for straight and curved beams. The theory of limit
analysis enables intermediate answers to be given a
physical interpretation in terms of upper and lower
bounds on the yield-point load. The paper closes with
some indication of how the method may be generalized to
more complex problems of plastic yield-point load
determination.",
acknowledgement = ack-nhfb,
pdfpages = "27",
}
@TechReport{Forsythe:1965:SUP,
author = "George E. Forsythe",
title = "{Stanford University}'s {Program in Computer
Science}",
type = "Technical Report",
number = "CS-TR-65-26",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 27",
day = "25",
month = jun,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-26.html",
abstract = "This report discusses the nature and objectives of
Stanford University's Program in Computer Science.
Listings of course offerings and syllabi for Ph.D.
examinations are given in appendices.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "28",
}
@TechReport{Volkov:1965:AOA,
author = "E. A. Volkov",
title = "An Analysis of One Algorithm of Heightened Precision
of the Method of Nets for the Solution of {Poisson}'s
Equation",
type = "Technical Report",
number = "STAN-CS-65-27 (AD618216)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = jul,
year = "1965",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Translated by R. Bartels.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Miller:1965:MTP,
author = "John J. H. Miller and Gilbert Strang",
title = "Matrix theorems for partial differential and
difference equations",
type = "Technical Report",
number = "CS-TR-65-28",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-28.html",
abstract = "We extend the work of Kreiss and Morton to prove: for
some constant $ K(m) $, where $m$ is the order of the
matrix $A$, $ |A^(n)v| \leq C(v) $ for all $ n \geq 0$
and $ |v| = 1$ implies that $ |{SAS}^{-1}| \leq 1 $ for
some $S$ with $ |S^{-1}| \leq 1 $, $ |S v| \leq
k(m)C(v)$. We establish the analogue for exponentials $
e^{Pt} $, and use it to construct the minimal Hilbert
norm dominating $ L_2 $ in which a given partial
differential equation with constant coefficients is
well-posed.",
acknowledgement = ack-nhfb,
pdfpages = "36",
}
@TechReport{Pereyra:1965:IAS,
author = "Victor Pereyra",
title = "On improving an approximate solution of a functional
equation by deferred corrections",
type = "Technical Report",
number = "CS-TR-65-29",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/fox-leslie.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-29.html",
abstract = "The improvement of discretization algorithms for the
approximate solution of nonlinear functional equations
is considered. Extensions to the method of difference
corrections by Fox are discussed and some general
results are proved. Applications to nonlinear boundary
problems and numerical examples are given in some
detail.",
acknowledgement = ack-nhfb,
pdfpages = "40",
}
@TechReport{Marchuk:1965:ACC,
author = "S. Marchuk",
title = "The Automatic Construction of Computational
Algorithms",
type = "Technical Report",
number = "STAN-CS-65-30 (SS624-829)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "56",
month = sep,
year = "1965",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Translated by G. J. Tee.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Raviart:1965:AWS,
author = "Pierre Arnaud Raviart",
title = "On the approximation of weak solutions of linear
parabolic equations by a class of multistep difference
methods",
type = "Technical Report",
number = "CS-TR-65-31",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "6",
month = dec,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-31.html",
abstract = "We consider evolution equations of the form \par
(1) $ d u(t) / d t + A(t)u(t) = f(t) $, $ 0 \leq \ t
\leq \ T $, $f$ given, \par
with the initial condition\par
(2) $ u(o) = u_o $, $ u_o $ given, \par
where each $ A(t)$ is an unbounded linear operator in a
Hilbert space $H$, which is in practice an elliptic
partial differential operator subject to appropriate
boundary conditions.\par
Let $ V_h $ be a Hilbert space which depends on the
parameter $h$. Let $k$ be the time-step such that $ m =
\frac {T}{k} $ is an integer. We approximate the
solution $u$ of (1), (2) by the solution $ u_{h, k}
(u_{h, k} = \{ u_{h, k}(r k) \in V_h, r = 0, 1, \ldots
{}, m - 1 \})$ of the multistep difference
scheme\par
(3) $ \frac {u_{h, k}^{(rk)} - u_{h, k}^{((r -
1)k)}}{k} = \sum_{\ell = 0}^p \gamma_\ell A_h((r -
\ell)k) u_{h, k}((r - \ell) k) = \sum_{\ell = 0}^p
{\gamma }_\ell f_{h, k}((r - \ell)k), r = p, \ldots {},
m - 1 $ \par
(4) $ u_{h, k}(o), \ldots {}, u_{h, k}((p - 1)k) $
given,\par
where each $ A_h(r k) $ is a linear continuous operator
from $ V_h $ into $ V_h $, $ f_{h, k}(r k) (r = 0, 1,
\ldots {}, m - 1)$ are given, and $ \gamma_\ell (\ell =
0, \ldots {}, p)$ are given complex numbers. Our paper
is mainly concerned by the study of the stability of
the approximation. The methods used here are very
closely related to those developed in the author's
thesis and we shall refer to the thesis frequently. In
Section 1, 2, we define the continuous and approximate
problems in precise terms. In Section 4, we find
sufficient conditions for $ u_{h, k} $ to satisfy some
a priori estimates. The definition of the stability is
given in Section 5 and we use the a priori estimates
for proving a general stability theorem. In Section 6
we prove that the stability conditions may be weakened
when $ A(t) $ is a self-adjoint operator (or when only
the principal part of $ A(t) $ is self-adjoint). We
give in Section 7 a weak convergence theorem. Section 8
is concerned with regularity properties. We apply our
abstract analysis to a class of parabolic partial
differential equations with variable coefficients in
Section 9. Strong convergence theorems can be obtained
as in the author's thesis (via compactness arguments)
or as in the thesis of J. P. Aubin. We do not study
here the discretization error (see author's thesis).
For the study of the stability of multistep difference
methods in the case of the Cauchy problem for parabolic
differential operators, we refer to Kreiss [1959],
Widlund [1965].",
acknowledgement = ack-nhfb,
pdfpages = "64",
}
@TechReport{Hockney:1965:MMF,
author = "Roger W. Hockney",
title = "Minimum multiplication {Fourier} analysis",
type = "Technical Report",
number = "CS-TR-65-32",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-32.html",
abstract = "Fourier analysis and synthesis is a frequently used
tool in applied mathematics but is found to be a time
consuming process to apply on a digital computer and
this fact may prevent the practical application of the
technique. This paper describes an algorithm which uses
the symmetries of the sine and cosine functions to
reduce the number of arithmetic operations by a factor
between 10 and 30. The algorithm is applicable to a
finite Fourier (or harmonic) analysis on $ 12
\bigotimes \ 2^q $ values, where $q$ is any integer $
\geq 0 $ and is applicable to a variety of end
conditions. A complete and tested B5000 Algol program
known as FOURIER12 is included.",
acknowledgement = ack-nhfb,
pdfpages = "60",
}
@TechReport{Wirth:1965:PLC,
author = "Niklaus Wirth",
title = "A programming language for the 360 computers",
type = "Technical Report",
number = "CS-TR-65-33",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "24",
month = dec,
year = "1965",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-65-33.html;
https://bitsavers.org/pdf/stanford/cs_techReports/CS33_Wirth_PL360_Dec65.pdf",
abstract = "This paper is a preliminary definition of a
programming language which is specifically designed for
use on IBM 360 computers, and is therefore
appropriately called PL360.",
acknowledgement = ack-nhfb,
pdfpages = "25",
}
@TechReport{Varah:1966:ERM,
author = "James M. Varah",
title = "Eigenvectors of a real matrix by inverse iteration",
type = "Technical Report",
number = "CS-TR-66-34",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-34.html",
abstract = "This report contains the description and listing of an
ALGOL 60 program which calculates the eigenvectors of
an arbitrary real matrix, using the technique of
inverse iteration.",
acknowledgement = ack-nhfb,
pdfpages = "26",
}
@TechReport{Wirth:1966:CDA,
author = "N. Wirth and C. Hoare",
title = "A Contribution to the Development of {ALGOL}",
type = "Technical Report",
number = "STAN-CS-66-35 (PB176758)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "64",
month = feb,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Communications of the ACM}
{\bf 9}(6) June 1966, doi:10.1145/365696.365702",
}
@TechReport{Traub:1966:CZP,
author = "J. F. Traub",
title = "The Calculation of Zeros of Polynomials and Analytic
Functions",
type = "Technical Report",
number = "STAN-CS-66-36 (PB176759)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = apr,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Reynolds:1966:COM,
author = "John C. Reynolds",
title = "{COGENT 1.2} operations manual",
type = "Technical Report",
number = "CS-TR-66-37",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-37.html",
abstract = "This document is an addendum to the COGENT Programming
Manual (Argonne National Laboratory, ANL-7022, March
1965, hereafter referred to as CPM) which describes a
specific implementation of the COGENT system, COGENT
1.2, written for the Control Data 3600 Computer.
Chapters I and II describe a variety of features
available in COGENT 1.2 which are not mentioned in CPM;
these chapters parallel the material in Chapters II and
III of CPM. Chapter III of this report gives various
operational details concerning the assembly and loading
of both COGENT-compiled programs and the compiler
itself. Chapter IV describes system and error messages.
Familiarity with the contents of CPM is assumed
throughout this report. In addition, a knowledge of the
3600 operating system SCOPE, and the assembler COMPASS
is assumed in Chapter III.",
acknowledgement = ack-nhfb,
pdfpages = "44",
}
@TechReport{McCarthy:1966:CCA,
author = "John McCarthy and James Painter",
title = "Correctness of a Compiler for Arithmetic Expressions",
type = "Technical Report",
number = "STAN-CS-66-38 (AIM-40, AD662880)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = apr,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Forsythe:1966:UEP,
author = "George E. Forsythe",
title = "A university's educational program in computer
science",
type = "Technical Report",
number = "CS-TR-66-39",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 26",
day = "18",
month = may,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-39.html",
abstract = "After a review of the power of contemporary computers,
computer science is defined in several ways. The
objectives of computer science education are stated,
and it is asserted that in a U.S. university these will
be achieved only through a computer science department.
The program at Stanford University is reviewed as an
example. The appendix includes syllabi of Ph.D.
qualifying examinations for Stanford's Computer Science
Department. This is a revision of a previous Stanford
Computer Science Department report, CS 26",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "27",
}
@TechReport{Forsythe:1966:HDY,
author = "George E. Forsythe",
title = "How do you solve a quadratic equation?",
type = "Technical Report",
number = "CS-TR-66-40",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 19",
day = "16",
month = jun,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-40.html",
abstract = "The nature of the floating-point number system of
digital computers is explained to a reader whose
university mathematical background is very limited. The
possibly large errors in using mathematical algorithms
blindly with floating-point computation are illustrated
by the formula for solving a quadratic equation. An
accurate way of solving a quadratic is outlined. A few
general remarks are made about computational
mathematics, including the backwards analysis of
rounding error.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "20",
}
@TechReport{Kahan:1966:AES,
author = "William M. Kahan",
title = "Accurate Eigenvalues of a Symmetric Tri-Diagonal
Matrix",
type = "Technical Report",
number = "CS-TR-66-41",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 53",
day = "22",
month = jul,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Revised June 1968",
URL = "http://i.stanford.edu/TR/CS-TR-66-41.html",
abstract = "Having established tight bounds for the quotient of
two different lub-norms of the same tri-diagonal matrix
$J$, the author observes that these bounds could be of
use in an error-analysis provided a suitable algorithm
were found. Such an algorithm is exhibited, and its
errors are thoroughly accounted for, including the
effects of scaling, over/underflow and roundoff. A
typical result is that, on a computer using rounded
floating point binary arithmetic, the biggest
eigenvalue of $J$ can be computed easily to within 2.5
units in its last place, and the smaller eigenvalues
will suffer absolute errors which are no larger. These
results are somewhat stronger than had been known
before.",
acknowledgement = ack-nhfb,
pdfpages = "58",
}
@TechReport{Kahan:1966:WND,
author = "William Kahan",
title = "When to neglect off-diagonal elements of symmetric
tri-diagonal matrices",
type = "Technical Report",
number = "CS-TR-66-42",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 10",
day = "25",
month = jul,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/66/42/CS-TR-66-42.pdf;
http://i.stanford.edu/TR/CS-TR-66-42.html",
abstract = "Given a tolerance $ \epsilon > 0, $ we seek a
criterion by which an off-diagonal element of the
symmetric tri-diagonal matrix $J$ may be deleted
without changing any eigenvalue of $J$ by more than $
\epsilon $. The criterion obtained here permits the
deletion of elements of order $ \sqrt {\epsilon }$
under favorable circumstances, without requiring any
prior knowledge about the separation between the
eigenvalues of $J$.",
acknowledgement = ack-nhfb,
pdfpages = "11",
}
@TechReport{Kahan:1966:TWA,
author = "William Kahan and James M. Varah",
title = "Two working algorithms for the eigenvalues of a
symmetric tridiagonal matrix",
type = "Technical Report",
number = "CS-TR-66-43",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 28",
day = "1",
month = aug,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-43.html",
abstract = "Two tested programs are supplied to find the
eigenvalues of a symmetric tridiagonal matrix. One
program uses a square-root-free version of the $ Q R $
algorithm. The other uses a compact kind of Sturm
sequence algorithm. These programs are faster and more
accurate than the other comparable programs published
previously with which they have been compared.",
acknowledgement = ack-nhfb,
pdfpages = "32",
}
@TechReport{Kahan:1966:RME,
author = "William Kahan",
title = "Relaxation methods for an eigenproblem",
type = "Technical Report",
number = "CS-TR-66-44",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 35",
day = "8",
month = aug,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-44.html",
abstract = "A theory is developed to account for the convergence
properties of certain relaxation iterations which have
been widely used to solve the eigenproblem $ (A -
\lambda B) \underline {x} = 0 $, $ \underline {x} \neq
0 $, with large symmetric matrices $A$ and $B$ and
positive definite $B$. These iterations always
converge, and almost always converge to the right
answer. Asymptotically, the theory is essentially that
of the relaxation iteration applied to a semi-definite
linear system discussed in the author's previous report
[Stanford University Computer Science Department report
CS45, 1966].",
acknowledgement = ack-nhfb,
pdfpages = "40",
}
@TechReport{Kahan:1966:RMS,
author = "William Kahan",
title = "Relaxation methods for semi-definite systems",
type = "Technical Report",
number = "CS-TR-66-45",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 32",
day = "9",
month = aug,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/k/kahan-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-45.html",
abstract = "Certain non-stationary relaxation iterations, which
are commonly applied to positive definite symmetric
systems of linear equations, are also applicable to a
semi-definite system provided that system is
consistent. Some of the convergence theory of the
former application is herein extended to the latter
application. The effects of rounding errors and of
inconsistency are discussed too, but with few helpful
conclusions. Finally, the application of these
relaxation iterations to an indefinite system is shown
here to be ill-advised because these iterations will
almost certainly diverge exponentially.",
acknowledgement = ack-nhfb,
pdfpages = "36",
}
@TechReport{Forsythe:1966:TCM,
author = "G. E. Forsythe",
title = "Today's Computational Methods of Linear Algebra",
type = "Technical Report",
number = "STAN-CS-66-46 (SS638-809)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "47",
day = "11",
month = aug,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/AD0638809.pdf",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
remark = "Invited address presented 15 May 1966 to a national
meeting of SIAM at Iowa City. Published in
\booktitle{SIAM Review} {\bf 9}(3) 489--515, 1967,
doi:10.1137/1009071.",
}
@TechReport{Abrams:1966:IIN,
author = "Philip S. Abrams",
title = "An interpreter for `{Iverson} notation'",
type = "Technical Report",
number = "CS-TR-66-47",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-47.html",
abstract = "Kenneth E. Iverson's book, `\booktitle{A Programming
Language}' [New York: Wiley, 1962], presented a highly
elegant language for the description and analysis of
algorithms. Although not widely acclaimed at first,
`Iverson notation' (referred to as `the language' in
this report) is coming to be recognized as an important
tool by computer scientists and programmers. The
current report contains an up-to-date definition of a
subset of the language, based on recent work by Iverson
and his colleagues. Chapter III describes an
interpreter for the language, written jointly by the
author and Lawrence M. Breed of IBM. The remainder of
the paper consists of critiques of the implementation
and the language, with suggestions for improvement.
This report was originally submitted in fulfillment of
a Computer Science 239 project supervised by Professor
Niklaus Wirth, Stanford University, May 30, 1966.",
acknowledgement = ack-nhfb,
pdfpages = "64",
}
@TechReport{McKeeman:1966:ACL,
author = "W. M. McKeeman",
title = "An Approach to Computer Language Design",
type = "Technical Report",
number = "STAN-CS-66-48 (SS639-166)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "124",
month = aug,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Reddy:1968:ACS,
author = "D. R. Reddy",
title = "An Approach to Computer Speech Recognition by Direct
Analysis of Speech Wave",
type = "Technical Report",
number = "STAN-CS-66-49 (AIM-43, SS640-836)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "143",
month = sep,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Persson:1966:SSE,
author = "S. Persson",
title = "Some Sequence Extrapolating Programs: a Study of
Representation and Modelling in Inquiring Systems",
type = "Technical Report",
number = "STAN-CS-66-50 (AIM-46, PB176761)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "176",
month = sep,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bergman:1966:NCT,
author = "S. Bergman and J. G. Herriot and T. G. Kurtz",
title = "Numerical Calculation of Transonic Flow Patterns",
type = "Technical Report",
number = "STAN-CS-66-51 (AD648394)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = oct,
year = "1966",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Shaw:1966:LNC,
author = "Alan C. Shaw",
title = "Lecture notes on a course in systems programming",
type = "Technical Report",
number = "CS-TR-66-52",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-66-52.html",
abstract = "These notes are based on the lectures of Professor
Niklaus Wirth which were given during the winter and
spring of 1965/66 as CS 236a and part of CS 236b,
Computer Science Department, Stanford University.",
acknowledgement = ack-nhfb,
pdfpages = "226",
}
@TechReport{Wirth:1966:PLC,
author = "Niklaus Wirth",
title = "A programming language for the 360 computers",
type = "Technical Report",
number = "CS-TR-66-53",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 81",
day = "20",
month = dec,
year = "1966",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/66/53/CS-TR-66-53.pdf;
http://i.stanford.edu/TR/CS-TR-66-53.html",
abstract = "A programming language for the IBM 360 computers and
its implementation are described. The language, called
PL360, provides the facilities of a symbolic machine
language, but displays a structure defined by a
recursive syntax. The compiler, consisting of a
precedence syntax analyser and a set of interpretation
rules with strict one-to-one correspondence to the set
of syntactic rules directly reflects the definition of
the language.\par
$k$-th syntax rule: $ S_0 : := S_1 S_2 \ldots {} S_n$
\par
$k$-th interpretation rule: $ V_0 := f_k(V_1, V_2,
\ldots {}, V_n)$ \par
PL360 was designed to improve the readability of
programs which must take into account specific
characteristics and limitations of a particular
computer. It represents an attempt to further the state
of the art of programming by encouraging and even
forcing the programmer to improve his style of
exposition and his principles and discipline in program
organization, and not by merely providing a multitude
of `new' features and facilities. The language is
therefore particularly well suited for tutorial
purposes.\par
The attempt to present a computer as a systematically
organized entity is also hoped to be of interest to
designers of future computers.",
acknowledgement = ack-nhfb,
author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
pdfpages = "96",
}
@TechReport{Golub:1967:GBAa,
author = "Gene H. Golub and Thomas N. Robertson",
title = "A generalized {Bairstow} algorithm",
type = "Technical Report",
number = "STAN-CS-67-54 (AD662882)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 10",
day = "13",
month = jan,
year = "1967",
bibdate = "Thu Nov 06 17:13:36 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-54.html",
abstract = "This report discusses convergence and applications for
the generalized Bairstow algorithm.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "11",
xxnumber = "CS-TR-67-54",
}
@TechReport{Adams:1967:SCP,
author = "Duane A. Adams",
title = "A stopping criterion for polynomial root finding",
type = "Technical Report",
number = "CS-TR-67-55",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-55.html",
abstract = "When solving for the roots of a polynomial, it is
generally difficult to know just when to terminate the
iteration process. In this paper an algorithm is
derived and discussed which allows one to terminate the
iteration process on the basis of calculated bounds for
the roundoff error.",
acknowledgement = ack-nhfb,
pdfpages = "12",
}
@TechReport{Bauer:1967:MNS,
author = "Friedrich L. Bauer",
title = "{$ Q D $}-method with {Newton} shift",
type = "Technical Report",
number = "CS-TR-67-56",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 6",
month = mar,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-56.html",
abstract = "Theoretically, for symmetric matrices, a QR-step is
equivalent to two successive LR-steps, and the
LR-transformation for a tridiagonal matrix is, apart
from organizational details, identical with the
qd-method. For non-positive definite matrices, however,
the LR-transformation cannot be guaranteed to be
numerically stable unless pivotal interchanges are
made. This has led to preference for the
QR-transformation, which is always numerically stable.
If, however, some of the smallest or some of the
largest eigenvalues are wanted, then the
QR-transformation will not necessarily give only these,
and bisection might seem too slow with its fixed
convergence rate of 1/2. In this situation, Newton's
method would be fine if the Newton correction can be
computed sufficiently simply, since it will always tend
monotonically to the nearest root starting from a point
outside the spectrum. Consequently, if one always
worked with positive (or negative) definite matrices,
there would be no objection to using the now stable
qd-algorithm. The report shows that for a qd-algorithm,
the Newton correction can very easily be calculated,
and accordingly a shift which avoids under-shooting, or
a lower bound. Since the last diagonal element gives an
upper bound, the situation is quite satisfactory with
respect to bounds.",
acknowledgement = ack-nhfb,
pdfpages = "8",
}
@TechReport{Gries:1967:UTM,
author = "David Gries",
title = "The use of transition matrices in compiling",
type = "Technical Report",
number = "CS-TR-67-57",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-57.html",
abstract = "The construction of efficient parsing algorithms for
programming languages has been the subject of many
papers in the last few years. Techniques for efficient
parsing and algorithms which generate the parser from a
grammar or phrase structure system have been derived.
Some of the well-known methods are the precedence
techniques of Floyd, and Wirth and Weber, and the
production language of Feldman. Perhaps the first such
discussion was by Samelson and Bauer. There the concept
of the push-down stack was introduced, along with the
idea of a transition matrix. A transition matrix is
just a switching table which lets one determine from
the top element of the stack (denoting a row of the
table) and the next symbol of the program to be
processed (represented by a column of the table)
exactly what should be done. Either a reduction is made
in the stack, or the incoming symbol is pushed onto the
stack. Considering its efficiency, the transition
matrix technique does not seem to have achieved much
attention, probably because it was not sufficiently
well-defined. The purpose of this paper is to define
the concept more formally, to illustrate that the
technique is very efficient, and to describe an
algorithm which generates a transition matrix from a
suitable grammar. The report also describes other uses
of transition matrices besides the usual ones of syntax
checking and compiling.",
acknowledgement = ack-nhfb,
pdfpages = "63",
subject-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Tixier:1967:RFR,
author = "Vincent Emile-Louis Tixier",
title = "Recursive Functions of Regular Expressions in Language
Analysis",
type = "Technical Report",
number = "STAN-CS-67-58 (PB176766)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = mar,
year = "1967",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Wilkinson:1967:ADM,
author = "James H. Wilkinson",
title = "Almost Diagonal Matrices with Multiple or Close
Eigenvalues",
type = "Technical Report",
number = "CS-TR-67-59",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Published as \cite{Wilkinson:1968:ADM}.",
URL = "http://i.stanford.edu/TR/CS-TR-67-59.html",
abstract = "If $ A = D + E $ where $D$ is the matrix of diagonal
elements of $A$, then when $A$ has some multiple or
very close eigenvalues, $E$ has certain characteristic
properties. These properties are considered both for
Hermitian and non-Hermitian $A$. The properties are
important in connexion with several algorithms for
diagonalizing matrices by similarity transformations.",
acknowledgement = ack-nhfb,
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
pdfpages = "19",
}
@TechReport{Wilkinson:1967:TAB,
author = "James H. Wilkinson",
title = "Two Algorithms Based on Successive Linear
Interpolation",
type = "Technical Report",
number = "CS-TR-67-60",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 15",
day = "10",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-60.html",
abstract = "The method of successive linear interpolation has a
very satisfactory asymptotic rate of convergence but
the behavior in the early steps may lead to divergence.
The regular falsi has the advantage of being safe but
its asymptotic behavior is unsatisfactory. Two modified
algorithms are described here which overcome these
weaknesses. Although neither is new, discussions of
their main features do not appear to be readily
available in the literature.",
acknowledgement = ack-nhfb,
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
pdfpages = "16",
}
@TechReport{Forsythe:1967:ADD,
author = "George E. Forsythe",
title = "On the asymptotic directions of the $s$-dimensional
optimum gradient method",
type = "Technical Report",
number = "CS-TR-67-61",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 43",
day = "13",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-61.html",
abstract = "The optimum $s$-gradient method for minimizing a
positive definite quadratic function $ f(x)$ on $ E_n$
has long been known to converge for $ s \geq 1 $. For
these $ \underline {s}$ the author studies the
directions from which the iterates $ x_k$ approach
their limit, and extends to $ s > 1 $ a theory proved
by Akaike for $ s = 1 $. It is shown that $ f(x_k)$ can
never converge to its minimum value faster than
linearly, except in degenerate cases where it attains
the minimum in one step.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "45",
}
@TechReport{Tienari:1967:VLF,
author = "Martti Tienari",
title = "Varying length floating point arithmetic: a necessary
tool for the numerical analyst",
type = "Technical Report",
number = "CS-TR-67-62",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
day = "17",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-62.html",
abstract = "The traditional floating point arithmetic of
scientific computers is biased towards fast and easy
production of numerical results without enough
provision to enable the programmer to control and solve
problems connected with numerical accuracy and
cumulative round-off errors. The author suggests the
varying length floating point arithmetic as a general
purpose solution for most of these problems. Some
general philosophies are outlined for applications of
this feature in numerical analysis. The idea is
analyzed further discussing hardware and software
implementations.",
acknowledgement = ack-nhfb,
pdfpages = "40",
}
@TechReport{Polya:1967:GME,
author = "George Polya",
title = "{Graeffe}'s method for eigenvalues",
type = "Technical Report",
number = "CS-TR-67-63",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-63.html",
abstract = "Let an entire function F(z) of finite genus have
infinitely many zeros which are all positive, and take
real values for real z. Then it is shown how to give
two-sided bounds for all the zeros of F in terms of the
coefficients of the power series of F, and of
coefficients obtained by Graeffe's algorithm applied to
F. A simple numerical illustration is given for a
Bessel function.",
acknowledgement = ack-nhfb,
pdfpages = "11",
}
@TechReport{Richman:1967:FPN,
author = "Paul L. Richman",
title = "Floating-point number representations: base choice
versus exponent range",
type = "Technical Report",
number = "CS-TR-67-64",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-64.html",
abstract = "A digital computer whose memory words are composed of
r-state devices is considered. The choice of the base,
$ \Beta $, for the internal floating-point numbers on
such a computer is discussed. Larger values of $ \Beta
$ necessitate the use of more r-state devices for the
mantissa, in order to preserve some `minimum accuracy,'
leaving fewer r-state devices for the exponent of $
\Beta $. As $ \Beta $ increases, the exponent range may
increase for a short period, but it must ultimately
decrease to zero. Of course, this behavior depends on
what definition of accuracy is used. This behavior is
analyzed for a recently proposed definition of accuracy
which specifies when it is to be said that the set of
q-digit base $ \Beta $ floating-point numbers is
accurate to p-digits base t. The only case of practical
importance today is t=10 and r=2; and in this case we
find that $ \Beta $ = 2 is always best. However the
analysis is done to cover all cases.",
acknowledgement = ack-nhfb,
pdfpages = "36",
}
@TechReport{Wirth:1967:CBC,
author = "Niklaus Wirth",
title = "On certain basic concepts of programming languages",
type = "Technical Report",
number = "CS-TR-67-65",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 30",
day = "1",
month = may,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/67/65/CS-TR-67-65.pdf;
http://i.stanford.edu/TR/CS-TR-67-65.html",
abstract = "Recent developments of programming languages have led
to the emergence of languages whose growth showed
cancerous symptoms: the proliferation of new elements
defied every control exercised by the designers, and
the nature of the new cells often proved to be
incompatible with the existing body. In order that a
language be free from such symptoms, it is necessary
that it be built upon basic concepts which are sound
and mutually independent. The rules governing the
language must be simple, generally applicable and
consistent. In order that simplicity and consistency
can be achieved, the fundamental concepts of a language
must be well-chosen and defined with utmost clarity. In
practice, it turns out that there exists an optimum in
the number of basic concepts, below which not only
implementability of these concepts on actual computers,
but also their appeal to human intuition becomes
questionable because of their high degree of
generalization. These informal notes do not abound with
ready-made solutions, but it is hoped they shed some
light on several related subjects and inherent
difficulties. They are intended to summarize and
interrelate various ideas which are partly present in
existing languages, partly debated within the IFIP
Working Group 2.1, and partly new. While emphasis is
put on clarification of conceptual issues,
consideration of notation cannot be ignored. However,
no formal or concise definitions of notation (syntax)
will be given or used; the concepts will instead be
illustrated by examples, using notation based on Algol
as far as possible.",
acknowledgement = ack-nhfb,
author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
pdfpages = "33",
}
@TechReport{Varah:1967:CBI,
author = "J. M. Varah",
title = "The Computation of Bounds for the Invariant Subspaces
of a General Matrix Operator",
type = "Technical Report",
number = "STAN-CS-67-66 (AD652921)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "240",
month = may,
year = "1967",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bartels:1967:CCR,
author = "Richard H. Bartels and Gene H. Golub",
title = "Computational considerations regarding the calculation
of {Chebyshev} solutions for overdetermined linear
equation systems by the exchange method",
type = "Technical Report",
number = "STAN-CS-67-67 (AD652992)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-67.html",
abstract = "An implementation, using Gaussian $ L U $
decomposition with row interchanges, of Stiefel's
exchange algorithm for determining a Chebyshev solution
to an overdetermined system of linear equations is
presented. The implementation is computationally more
stable than those usually given in the literature. A
generalization of Stiefel's algorithm is developed
which permits the occasional exchange of two equations
simultaneously. Finally, some experimental comparisons
are offered",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "66",
xxnumber = "CS-TR-67-67",
}
@TechReport{Wirth:1967:PS,
author = "Niklaus Wirth",
title = "The {PL360} system",
type = "Technical Report",
number = "CS-TR-67-68",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-68.html",
abstract = "This report describes the use and the organization of
the operating system which serves as the environment of
the PL360 language defined in the companion report, CS
53 [Niklaus Wirth, `A Programming Language for the 360
Computers,' Stanford University Department of Computer
Science, June 1967]. Edited by Niklaus Wirth.",
acknowledgement = ack-nhfb,
pdfpages = "72",
}
@TechReport{Feldman:1967:TWS,
author = "Jerome A. Feldman and David Gries",
title = "Translator writing systems",
type = "Technical Report",
number = "CS-TR-67-69",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-69.html",
abstract = "Compiler writing has long been a glamour field within
programming and has a well developed folklore. More
recently, the attention of researchers has been
directed toward various schemes for automating
different parts of the compiler writer's task. This
paper contains neither a history of nor an introduction
to these developments; the references at the end of
this section provide what introductory material there
is in the literature. Although we will make comparisons
between individual systems and between various
techniques, this is certainly not a consumer's guide to
translator writing systems. Our intended purpose is to
carefully consider the existing work in an attempt to
form a unified scientific basis for future research.",
acknowledgement = ack-nhfb,
pdfpages = "136",
}
@TechReport{Bergman:1967:CFP,
author = "Stefan Bergman and John G. Herriot and Paul L.
Richman",
title = "On computation of flow patterns of compressible fluids
in the transonic region",
type = "Technical Report",
number = "CS-TR-67-70",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-70.html",
abstract = "The first task in devising a numerical procedure for
solving a given problem is that of finding a
constructive mathematical solution to the problem. But
even after such a solution is found there is much to be
done. Mathematical solutions normally involve infinite
processes such as integration and differentiation as
well as infinitely precise arithmetic and functions
defined in arbitrarily involved ways. Numerical
procedures suitable for a computer can involve only
finite processes, fixed or at least bounded length
arithmetic and rational functions. Thus one must find
efficient methods which yield approximate solutions. Of
interest here are the initial and boundary value
problems for compressible fluid flow. Constructive
solutions to these problems can be found in [Bergman,
S., `On representation of stream functions of subsonic
and supersonic flows of compressible fluids,' Journal
of Rational Mechanics and Analysis, v.4 (1955), no. 6,
pp. 883-905]. As presented there, solution of the
boundary value problem is limited to the subsonic
region, and is given symbolically as a linear
combination of orthogonal functions. A numerical
continuation of this (subsonic) solution into the
supersonic region can be done by using the (subsonic)
solution and its derivative to set up an initial value
problem. The solution to the initial value problem may
then be valid in (some part of) the supersonic region.
Whether this continuation will lead to a closed,
meaningful flow is an open question. In this paper, we
deal with the numerical solution of the initial value
problem. We are currently working on the rest of the
procedure described above.",
acknowledgement = ack-nhfb,
pdfpages = "84",
}
@TechReport{Jenkins:1967:AAG,
author = "M. A. Jenkins and J. F. Traub",
title = "An Algorithm for an Automatic General Polynomial
Solver",
type = "Technical Report",
number = "STAN-CS-67-71 (AD655230)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = jul,
year = "1967",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1967:CAC,
author = "Gene H. Golub and Lyle B. Smith",
title = "{Chebyshev} approximation of continuous functions by a
{Chebyshev} system of functions",
type = "Technical Report",
number = "STAN-CS-67-72 (PB175581)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "54",
month = jul,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-72.html",
abstract = "The second algorithm of Remez can be used to compute
the minimax approximation to a function, $ f(x) $, by a
linear combination of functions, $ {\{ Q_i (x) \} }^N_O
$, which form a Chebyshev system. The only restriction
on the function to be approximated is that it be
continuous on a finite interval $ [a, b] $. An Algol 60
procedure is given which will accomplish the
approximation. This implementation of the second
algorithm of Remez is quite general in that the
continuity of $ f(x) $ is all that is required whereas
previous implementations have required
differentiability, that the end points of the interval
be ``critical points,'' and that the number of
``critical points'' be exactly $ N + 2 $. Discussion of
the method used and its numerical properties is given
as well as some computational examples of the use of
the algorithm. The use of orthogonal polynomials (which
change at each iteration) as the Chebyshev system is
also discussed.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "60",
xxnumber = "CS-TR-67-72",
}
@TechReport{Businger:1967:LSS,
author = "P. Businger and Gene H. Golub",
title = "Least Squares, Singular Values and Matrix
Approximations (and an {ALGOL} Procedure for Computing
the Singular Value Decomposition)",
type = "Technical Report",
number = "STAN-CS-67-73 (AD662883)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jul,
year = "1967",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/html/tr/AD0662883",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
}
@TechReport{Forsythe:1967:WSQ,
author = "George E. Forsythe",
title = "What is a Satisfactory Quadratic Equation Solver?",
type = "Technical Report",
number = "CS-TR-67-74",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
day = "7",
month = aug,
year = "1967",
bibdate = "Wed Jul 01 15:33:08 2009",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "The report discusses precise requirements for a
satisfactory computer program to solve a quadratic
equation with floating-point coefficients. The
principal practical problem is coping with overflow and
underflow.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
}
@TechReport{Bauer:1967:TN,
author = "Friedrich L. Bauer",
title = "Theory of norms",
type = "Technical Report",
number = "CS-TR-67-75",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-75.html",
abstract = "These notes are based on lectures given during the
winter of 1967 as CS 233, Computer Science Department,
Stanford University.",
acknowledgement = ack-nhfb,
pdfpages = "146",
}
@TechReport{Anselone:1967:CCO,
author = "Phillip M. Anselone",
title = "Collectively compact operator approximations",
type = "Technical Report",
number = "CS-TR-67-76",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-76.html",
abstract = "This report consists of notes based on lectures
presented July--August 1967. The notes were prepared by
Lyle Smith. A general approximation theory for linear
and nonlinear operators on Banach spaces is presented.
It is applied to numerical integration approximations
of integral operators. Convergence of the operator
approximations is pointwise rather than uniform on
bounded sets, which is assumed in other theories. The
operator perturbations form a collectively compact set,
i.e., they map each bounded set into a single compact
set. In the nonlinear case, Frechet differentiability
conditions are also imposed. Principal results include
convergence and error bounds for approximate solutions
and, for linear operators, results on spectral
approximations.",
acknowledgement = ack-nhfb,
pdfpages = "68",
}
@TechReport{Forsythe:1967:WDT,
author = "George E. Forsythe",
title = "What to do till the computer scientist comes",
type = "Technical Report",
number = "CS-TR-67-77",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 13",
day = "22",
month = sep,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-77.html",
abstract = "The potential impact of computer science departments
in the field of education is discussed. This is an
expanded version of a presentation to a panel session
before the Mathematics Association of America, Toronto,
30 August 1967.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "15",
}
@TechReport{Colby:1967:MUN,
author = "Kenneth Mark Colby and Horace J. Enea",
title = "Machine utilization of the natural language word
'good'",
type = "Technical Report",
number = "CS-TR-67-78",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-78.html",
abstract = "Using the term 'good' as an example, the effect of
natural language input on an interviewing computer
program is described. The program utilizes syntactic
and semantic information to generate relevant plausible
inferences from which statements for a goal-directed
man--machine dialogue can be constructed.",
acknowledgement = ack-nhfb,
pdfpages = "11",
}
@TechReport{Doran:1967:FIF,
author = "Robert W. Doran",
title = "{360 O.S. FORTRAN IV} free field input\slash output
subroutine package",
type = "Technical Report",
number = "CS-TR-67-79",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-79.html",
abstract = "Programmers dealing with aspects of natural language
processing have a difficult task in choosing a computer
language which enables them to program easily, produce
efficient code and accept as data freely written
sentences with words of arbitrary length. List
processing languages such as LISP are reasonably easy
to program in but do not execute very quickly. Other,
formula oriented, languages like FORTRAN are not
provided with free field input. The Computational
Linguistics group at the Stanford University Computer
Science Department is writing a system for testing
transformational grammars. As these grammars are
generally large and complicated, it is important to
make the system as efficient as possible, so we are
using FORTRAN IV (O.S. on IBM 360-65) as our language.
To enable us to handle free field input we have
developed a subroutine package which we describe here
in the hope that it will be useful to others embarking
on natural language tasks. The package consists of two
main programs, free field reader, free field writer,
with a number of utility routines and constant COMMON
blocks.",
acknowledgement = ack-nhfb,
pdfpages = "22",
}
@TechReport{Friedman:1967:DRG,
author = "Joyce Friedman",
title = "Directed random generation of sentences",
type = "Technical Report",
number = "CS-TR-67-80",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-80.html",
abstract = "The problem of producing sentences of a
transformational grammar by using a random generator to
create phrase structure trees for input to the lexical
insertion and transformational phases is discussed. A
purely random generator will produce base trees which
will be blocked by the transformations, and which are
frequently too long to be of practical interest. A
solution is offered in the form of a computer program
which allows the user to constrain and direct the
generation by the simple but powerful device of
restricted subtrees. The program is a directed random
generator which accepts as input a subtree with
restrictions and produces around it a tree which
satisfies the restrictions and is ready for the next
phase of the grammar. The underlying linguistic model
is that of Noam Chomsky, as presented in `Aspects of
the Theory of Syntax.' The program is written in
Fortran IV for the IBM 360/67 and is part of the
Stanford Transformational Grammar Testing System. It is
currently being used with several partial grammars of
English.",
acknowledgement = ack-nhfb,
pdfpages = "32",
}
@TechReport{Golub:1967:CGQ,
author = "Gene H. Golub and John H. Welsch",
title = "Calculation of {Gauss} quadrature rules",
type = "Technical Report",
number = "STAN-CS-67-81 (AD661217)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = nov,
year = "1967",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-67-81.html",
abstract = "Most numerical integration techniques consist of
approximating the integrand by a polynomial in a region
or regions and then integrating the polynomial exactly.
Often a complicated integrand can be factored into a
non-negative 'weight' function and another function
better approximated by a polynomial, thus $ \int_a^b
g(t)d t = \int_a^b \omega (t)f(t)d t \approx \sum_{i =
1}^N w_i f(t_i) $. Hopefully, the quadrature rule $ {\{
w_j, t_j \} }_{j = 1}^N $ corresponding to the weight
function $ \omega (t) $ is available in tabulated form,
but more likely it is not. We present here two
algorithms for generating the Gaussian quadrature rule
defined by the weight function when: (a) the three term
recurrence relation is known for the orthogonal
polynomials generated by $ \omega (t) $, and (b) the
moments of the weight function are known or can be
calculated.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "31",
xxnumber = "CS-TR-67-81",
}
@TechReport{Tesler:1967:DGR,
author = "L. Tesler and H. Enea and K. M. Colby",
title = "A Directed Graph Representation for Computer
Simulation of Belief Systems",
type = "Technical Report",
number = "STAN-CS-67-82 (PB176775)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = dec,
year = "1967",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://en.wikipedia.org/wiki/Larry_Tesler",
acknowledgement = ack-nhfb,
author-dates = "Lawrence Gordon Tesler (24 April 1945--16 February
2020)",
}
@TechReport{Colby:1968:CAL,
author = "Kenneth Mark Colby",
title = "Computer-Aided Language Development in Nonspeaking
Mentally Disturbed Children",
type = "Technical Report",
number = "STAN-CS-68-85 (PB177426)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = dec,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-85.html",
abstract = "Experience with a computer-based method for aiding
language development in nonspeaking mentally disturbed
children is described. Out of a group of 10 children, 8
improved linguistically, while 2 were unimproved.
Problems connected with the method and its future
prospects are briefly discussed.",
acknowledgement = ack-nhfb,
pdfpages = "37",
xxnumber = "CS-TR-68-85",
}
@TechReport{Bredt:1968:CMI,
author = "Thomas H. Bredt",
title = "A Computer Model of Information Processing in
Children",
type = "Technical Report",
number = "STAN-CS-68-100 (PB178877)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = jun,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-100.html",
abstract = "A model of cognitive information processing has been
constructed on the basis of a protocol gathered from a
child taking an object association test. The basic
elements of the model are a graph-like data base and
strategy. The data base contains facts that relate
objects in the experiment. The graph distance that
separates two objects in the data base is the measure
of how well a relation is known. The strategy used in
searching for facts that relate two objects is
sequential in nature. The model has been programmed for
computer testing in the LISP programming language. The
responses of the computer model and the original
subject are compared. To aid in the model evaluation a
revised test was defined and administered to two
children. The results were modeled and the
correspondence of model and subject performance is
discussed.",
acknowledgement = ack-nhfb,
pdfpages = "74",
xxnumber = "CS-TR-68-100",
}
@TechReport{Pnueli:1968:IPC,
author = "Amir Pnueli",
title = "Integer Programming Over a Cone",
type = "Technical Report",
number = "STAN-CS-68-102 (AD677982)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = jul,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-102.html",
abstract = "The properties of a special form integer programming
problem are discussed. We restrict ourselves to
optimization over a cone (a set of n constraints in n
unconstrained variables) with a square matrix of
positive diagonal and non positive off-diagonal
elements. (Called a bounding form by F. Glover [1964]).
It is shown that a simple iterational process gives the
optimal integer solution in a finite number of steps.
It is then shown that any cone problem with bounded
rational solution can be transformed to the bounding
form and hence solved by the outlined method. Some
extensions to more than n constraints are discussed and
a numerical example is shown to solve a bigger
problem.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-68-102",
}
@TechReport{Friedman:1968:LIT,
author = "Joyce Friedman and Thomas H. Bredt",
title = "Lexical Insertion in Transformational Grammar",
type = "Technical Report",
number = "STAN-CS-68-103 (AD692689)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 47",
month = jun,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-103.html",
abstract = "In this paper, we describe the lexical insertion
process for generative transformational grammars. We
also give detailed descriptions of many of the concepts
in transformational theory. These include the notions
of complex symbol, syntactic feature (particularly
contextual feature), redundancy rule, tests for pairs
of complex symbols, and change operations that may be
applied to complex symbols. Because of our general
interpretation of redundancy rules, we define a new
complex symbol test known as compatibility. This test
replaces the old notion of nondistinctness. The form of
a lexicon suitable for use with a generative grammar is
specified.\par
In lexical insertion, vocabulary words and associated
complex symbols are selected from a lexicon and
inserted at lexical category nodes in the tree. Complex
symbols are lists of syntactic features. The
compatibility of a pair of complex symbols and the
analysis procedure used for contextual features are
basic in determining suitable items for insertion.
Contextual features (subcategorization and selectional)
have much in common with the structural description for
a transformation and we use the same analysis procedure
for both. A problem encountered in the insertion of a
complex symbol that contains selectional features is
side effects. We define the notion of side effects and
describe how these effects are to be treated.\par
The development of the structure of the lexicon and the
lexical insertion algorithm has been aided by a system
of computer programs that enable the linguist to study
transformational grammar. In the course of this
development, a computer program to perform lexical
insertion was written. Results obtained using this
program with fragments of transformational grammar are
presented. The paper concludes with suggestions for
extensions of this work and a discussion of
interpretations of transformational theory that do not
fit immediately into our framework.",
acknowledgement = ack-nhfb,
pdfpages = "53",
xxnumber = "CS-TR-68-103",
}
@TechReport{Jenkins:1968:TSV,
author = "M. A. Jenkins",
title = "A Three-Stage Variable-Shift Iteration for Polynomial
Zeros and its Relation to Generalized {Rayleigh}
Iteration",
type = "Technical Report",
number = "STAN-CS-68-107 (AD668558)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = aug,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-107.html",
abstract = "We introduce a new three-stage process for calculating
the zeros of a polynomial with complex coefficients.
The algorithm is similar in spirit to the two-stage
algorithms studied by Traub in a series of papers. The
algorithm is restriction free, that is, it converges
for any distribution of zeros. A proof of global
convergence is given. Zeros are calculated in roughly
increasing order of magnitude to avoid deflation
instability. Shifting is incorporated in a natural and
stable way to break equimodularity and speed
convergence. The three stages use no shift, a fixed
shift, and a variable shift, respectively. To obtain
additional insight we recast the problem and algorithm
into matrix form. The third stage is inverse iteration
with the companion matrix, followed by generalized
Rayleigh iteration. A program implementing the
algorithm was written in a dialect of ALGOL 60 and run
on Stanford University's IBM 360/67. The program has
been extensively tested and testing is continuing. For
polynomials with complex coefficients and of degrees
ranging from 20 to 50, the time required to calculate
all zeros averages $ 8 n^2 $ milliseconds. Timing
information and a numerical example are provided. A
description of the implementation, an analysis of the
effects of finite-precision arithmetic, an ALGOL 60
program, the results of extensive testing, and a second
program which clusters the zeros and provides a
posteriori error bounds will appear elsewhere.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-68-107",
}
@TechReport{Friedman:1968:CSW,
author = "Joyce Friedman",
title = "A Computer System for Writing and Testing
Transformational Grammars --- Final Report",
type = "Technical Report",
number = "STAN-CS-68-109 (AD692690)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = sep,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-109.html",
abstract = "A comprehensive system for transformational grammar
has been designed and is being implemented on the IBM
360/67 computer. The system deals with the
transformational model of syntax, along the lines of
Chomsky's `Aspects of the Theory of Syntax.' The major
innovations include a full and formal description of
the syntax of a transformational grammar, a directed
random phrase structure generator, a lexical insertion
algorithm, and a simple problem-oriented programming
language in which the algorithm for application of
transformations can be expressed. In this paper we
present the system as a whole, first discussing the
philosophy underlying the development of the system,
then outlining the system and discussing its more
important special features. References are given to
papers which consider particular aspects of the system
in detail.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-68-109",
}
@TechReport{Friedman:1968:ATG,
author = "Joyce Friedman and Theodore S. Martner",
title = "Analysis in Transformational Grammar",
type = "Technical Report",
number = "STAN-CS-68-111 (AD692691)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = aug,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-111.html",
abstract = "In generating sentences by means of a transformational
grammar, it is necessary to analyze trees, testing for
the presence or absence of various structures. This
analysis occurs at two stages in the generation process
--- during insertion of lexical items (more precisely,
in testing contextual features), and during the
transformation process, when individual transformations
are being tested for applicability. In this paper we
describe a formal system for the definition of tree
structure of sentences. The system consists of a formal
language for partial or complete definition of the tree
structure of a sentence, plus an algorithm for
comparison of such a definition with a tree. It
represents a significant generalization of Chomsky's
notion of `proper analysis', and is flexible enough to
be used within any transformational grammar which we
have seen.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-68-111",
}
@TechReport{Friedman:1968:CLT,
author = "Joyce Friedman and Bary W. Pollack",
title = "A Control Language for Transformational Grammar",
type = "Technical Report",
number = "STAN-CS-68-112 (AD692687)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = aug,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-112.html",
abstract = "Various orders of application of transformations have
been considered in transformational grammar, ranging
from unorder to cyclical orders involving notions of
`lowest sentence' and of numerical indices on depth of
embedding. The general theory of transformational
grammar does not yet offer a uniform set of `traffic
rules' which are accepted by most linguists. Thus, in
designing a model of transformational grammar, it seems
advisable to allow the specification of the order and
point of application of transformations to be a proper
part of the grammar. In this paper we present a simple
control language designed to be used by linguists for
this specification. In the control language the user
has the ability to: 1. Group transformations into
ordered sets and apply transformations either
individually or by transformation set. 2. Specify the
order in which the transformation sets are to be
considered. 3. Specify the subtrees in which a
transformation set is to be applied. 4. Allow the order
of application to depend on which transformations have
previously modified the tree. 5. Apply a transformation
set either once or repeatedly. In addition, since the
control language has been implemented as part of a
computer system, the behavior of the transformations
may be monitored giving additional information on their
operation. In this paper we present the control
language and examples of its use. Discussion of the
computer implementation will be found in [Pollack, B.
W. The Control Program and Associated Subroutines.
Stanford University. Computer Science Department.
Computational Linguistics Project. Report no. AF-28.
June 1968.].",
acknowledgement = ack-nhfb,
pdfpages = "55",
xxnumber = "CS-TR-68-112",
}
@TechReport{George:1968:CIP,
author = "James E. George",
title = "{Calgen} --- an interactive picture calculus
generation system",
type = "Technical Report",
number = "CS-TR-68-114",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-114.html",
abstract = "A sub-set of the Picture Calculus was implemented on
the IBM 360/75 to experiment with the proposed data
structure, to study the capability of PL/1 for
implementing the Picture Calculus and to evaluate the
usefulness of drawing pictures with this formalized
language. The system implemented is referred to as
Calgen. Like many other drawing programs, Calgen
utilizes a graphic display console; however, it differs
from previous drawing systems in one major area,
namely, Calgen retains structure information. Since the
Picture Calculus is highly structured, Calgen retains
structure information, and only scope images where
convenient; further, these scope images saved may be
altered by changing the structure information. The only
reason scope images are saved by Calgen is to avoid
regeneration of a previously generated picture.",
acknowledgement = ack-nhfb,
pdfpages = "79",
}
@TechReport{Friedman:1968:PMC,
author = "Joyce Friedman and Thomas H. Bredt and Robert W. Doran
and Theodore S. Martner and Bary W. Pollack",
title = "Programmers manual for a computer system for
transformational grammar",
type = "Technical Report",
number = "CS-TR-68-115",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-115.html",
abstract = "This volume provides programming notes on a computer
system for transformational grammar. The important
ideas of the system have been presented in a series of
reports which are listed in Appendix B; this document
is the description of the system as a program. It is
intended for programmers who might wish to maintain,
modify or extend the system.",
acknowledgement = ack-nhfb,
pdfpages = "202",
}
@TechReport{Pieper:1968:KMU,
author = "D. Pieper",
title = "The Kinematics of Manipulators Under Computer
Control",
type = "Technical Report",
number = "STAN-CS-68-116 (AIM-72, AD680036)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "167",
month = oct,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Adams:1968:CMD,
author = "D. Adams",
title = "A Computational Model with Data Flow Sequencing",
type = "Technical Report",
number = "STAN-CS-68-117 (PB182151)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = dec,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Waterman:1968:MLH,
author = "D. Waterman",
title = "Machine Learning of Heuristics",
type = "Technical Report",
number = "STAN-CS-68-118 (AIM-74, AD681027)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "235",
month = dec,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bayer:1968:MMP,
author = "Rudolf Bayer and James H. Bigelow and George B.
Dantzig and David J. Gries and Michael B. McGrath and
Paul D. Pinsky and Stephen K. Schuck and Christoph
Witzgall",
title = "{MPL}: {Mathematical Programming Language}",
type = "Technical Report",
number = "CS-TR-68-119",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-119.html",
abstract = "The purpose of MPL is to provide a language for
writing mathematical programming algorithms that will
be easier to write, to read, and to modify than those
written in currently available computer languages. It
is believed that the writing, testing, and modification
of codes for solving large-scale linear programs will
be a less formidable undertaking once MPL becomes
available. It is hoped that by the Fall of 1968, work
on a compiler for MPL will be well underway.",
acknowledgement = ack-nhfb,
pdfpages = "92",
}
@TechReport{Bjorck:1968:IRL,
author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
title = "Iterative refinements of linear least squares
solutions by {Householder} transformations",
type = "Technical Report",
number = "STAN-CS-68-83 (AD664237)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 28",
day = "19",
month = jan,
year = "1968",
bibdate = "Thu Nov 06 17:24:15 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/h/householder-alston-s.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-83.html",
abstract = "An algorithm is presented in ALGOL for iteratively
refining the solution to a linear least squares problem
with linear constraints. Numerical results presented
show that a high degree of accuracy is obtained.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "29",
xxnumber = "CS-TR-68-83",
xxtitle = "Iterative Refinements of Linear Squares Solutions by
{Householder} Transformations",
}
@TechReport{Friedman:1968:CST,
author = "Joyce Friedman",
title = "A Computer System for Transformational Grammar",
type = "Technical Report",
number = "CS-TR-68-84 (AD692680)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = jan,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-84.html",
abstract = "A comprehensive system for transformational grammar
has been designed and is being implemented on the IBM
360/67 computer. The system deals with the
transformational model of syntax, along the lines of
Chomsky's `Aspects of the Theory of Syntax.' The major
innovations include a full and formal description of
the syntax of a transformational grammar, a directed
random phrase structure generator, a lexical insertion
algorithm, and a simple problem-oriented programming
language in which the algorithm for application of
transformations can be expressed. In this paper we
present the system as a whole, first discussing the
philosophy underlying the development of the system,
then outlining the system and discussing its more
important special features. References are given to
papers which consider particular aspects of the system
in detail.",
acknowledgement = ack-nhfb,
pdfpages = "35",
xxnumber = "STAN-CS-68-84 (AD692680)",
}
@TechReport{Bauer:1968:AW,
author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
Graham",
title = "{ALGOL W}",
type = "Technical Report",
number = "CS-TR-68-86",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-86.html",
abstract = "The textbook `Introduction to Algol' by Baumann,
Feliciano, Bauer, and Samelson describes the
internationally recognized language ALGOL 60 for
algorithm communication. ALGOL W can be viewed as an
extension of ALGOL. This document consists of (1)
`Algol W Notes for Introductory Computer Science
Courses' [by Henry R. Bauer, Sheldon Becker, and Susan
L. Graham] which describes the differences between
ALGOL 60 and ALGOL W and presents the new features of
ALGOL W; (2) `Deck Set-Up'; (3) `Algol W Language
Description' [by Henry R. Bauer, Sheldon Becker, and
Susan L. Graham], a complete syntactic and semantic
description of the language; (4) `Unit Record
Equipment'; and (5) `Error Message.'",
acknowledgement = ack-nhfb,
pdfpages = "116",
}
@TechReport{Ehrman:1968:CLN,
author = "John R. Ehrman",
title = "{CS139} lecture notes. {Part I}: {Sections} 1 thru 21.
{Preliminary} version",
type = "Technical Report",
number = "CS-TR-68-87",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "????",
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-87.html",
abstract = "These notes are meant to provide an introduction to
the IBM System/360 which will help the reader to
understand and to make effective use of the
capabilities of both the machinery and some of its
associated service programs. They are largely
self-contained, and in general the reader should need
to make only occasional reference to the `System/360
Principles of Operation' manual (IBM File No. S360-01,
Form A22-6821) and to the `Operating System/360
Assembler Language' manual (IBM File No. S360-21, Form
C28-6514).",
acknowledgement = ack-nhfb,
pdfpages = "202",
}
@TechReport{Schechter:1968:RMC,
author = "Samuel Schechter",
title = "Relaxation methods for convex problems",
type = "Technical Report",
number = "CS-TR-68-88",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-88.html",
abstract = "Extensions and simplifications are made for
convergence proofs of relaxation methods for nonlinear
systems arising from the minimization of strictly
convex functions. This work extends these methods to
group relaxation, which includes an extrapolated form
of Newton's method, for various orderings. A relatively
simple proof is given for cyclic orderings, sometimes
referred to as nonlinear overrelaxation, and for
residual orderings where an error estimate is given. A
less restrictive choice of relaxation parameter is
obtained than that previously. Applications are
indicated primarily to the solution of nonlinear
elliptic boundary problems.",
acknowledgement = ack-nhfb,
pdfpages = "20",
}
@TechReport{Bauer:1968:AWR,
author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
Graham and George E. Forsythe and Edwin H.
Satterthwaite",
title = "{ALGOL W} (revised)",
type = "Technical Report",
number = "CS-TR-68-89",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 124",
month = mar,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-89.html",
abstract = "The textbook ``\booktitle{Introduction to Algol}' by
Baumann, Feliciano, Bauer, and Samelson describes the
internationally recognized language ALGOL 60 for
algorithm communication. ALGOL W can be viewed as an
extension of ALGOL. This document consists of (1)
``Algol W Deck Set-Up'' [by E. H. Satterthwaite, Jr.];
(2) ``Algol W Language Description'' [by Henry R.
Bauer, Sheldon Becker, and Susan L. Graham], a complete
syntactic and semantic description of the language; (3)
``Algol W Error Messages'' [by Henry R. Bauer, Sheldon
Becker, and Susan L. Graham]; (4) ``Algol W Notes for
Introductory Computer Science Courses'' [by Henry R.
Bauer, Sheldon Becker, and Susan L. Graham] which
describes the differences tween ALGOL 60 and ALGOL W
and presents the new features of ALGOL W; and (5)
``Notes on Number Representation on System/360 and
relations to Algol W'' [by George E. Forsythe].",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "125",
}
@TechReport{Lesser:1968:MLC,
author = "Victor R. Lesser",
title = "A multi-level computer organization designed to
separate data-accessing from the computation",
type = "Technical Report",
number = "CS-TR-68-90",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-90.html",
abstract = "The computer organization to be described in this
paper has been developed to overcome the inflexibility
of computers designed around a few fixed data
structures, and only binary operations. This has been
accomplished by separating the data-accessing
procedures from the computational algorithm. By this
separation, a new and different language may be used to
express data-accessing procedures. The new language has
been designed to allow the programmer to define the
procedures for generating the names of the operands for
each computation, and locating the value of an operand
given its name.",
acknowledgement = ack-nhfb,
pdfpages = "23",
}
@TechReport{Wirth:1968:PS,
author = "Niklaus Wirth and Joseph W. {Wells, Jr.} and Edwin H.
{Satterthwaite, Jr.}",
title = "The {PL360} system",
type = "Technical Report",
number = "CS-TR-68-91",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 89",
day = "1",
month = apr,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/68/91/CS-TR-68-91.pdf;
http://i.stanford.edu/TR/CS-TR-68-91.html",
abstract = "This report describes the use of two operating systems
which serve as environments for the PL360 language
defined in the companion report CS 53 [1]. Some
additions to that language, not described in CS 53, are
documented in the Appendix. One of the systems is a
stand-alone, self-loading program specifically designed
for PL360; the other is a subsystem operating under
IBM's Operating System/360 (0S). With the 2 minor
exceptions noted in Chapter 5, these two systems were
designed to be entirely compatible at the source
language level.",
abstract-2 = "This report describes the use of two operating systems
which serve as environments for the PL360 language
defined in the companion report [Niklaus Wirth, `A
Programming Language for the 360 Computers,' Stanford
University Computer Science Department report CS 53
(revised), June 1967]. Some additions to that language,
not described in CS 53, are documented in the
Appendix.",
acknowledgement = ack-nhfb,
author-dates = "Niklaus Wirth (15 February 1934--1 January 2024)",
pdfpages = "102",
}
@TechReport{Enea:1968:M,
author = "Horace J. Enea",
title = "{MLISP}",
type = "Technical Report",
number = "CS-TR-68-92",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-92.html",
abstract = "Mlisp is an Algol-like list processing language based
on Lisp 1.5. It is currently implemented on the IBM
360/67 at the Stanford Computation Center, and is being
implemented on the DEC PDP-6 at the Stanford Artificial
Intelligence Project. The balance of this paper is a
very informal presentation of the language so that the
reader will be able to run programs in Mlisp with a
minimum of effort. The language has an extremely simple
syntax which is presented in Appendix I.",
acknowledgement = ack-nhfb,
pdfpages = "20",
}
@TechReport{Forsythe:1968:CSE,
author = "G. E. Forsythe",
title = "Computer Science and Education",
type = "Technical Report",
number = "STAN-CS-68-93 (PB178078)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = mar,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
}
@TechReport{Shaw:1968:FDP,
author = "A. C. Shaw",
title = "The Formal Description and Parsing of Pictures",
type = "Technical Report",
number = "STAN-CS-68-94 (SLACR-84)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "205",
month = apr,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Friedman:1968:FST,
author = "Joyce Friedman and Robert W. Doran",
title = "A formal syntax for transformational grammar",
type = "Technical Report",
number = "CS-TR-68-95",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-95.html",
abstract = "A formal definition of the syntax of a
transformational grammar is given using a modified
Backus Naur Form as the metalanguage. Syntax
constraints and interpretation are added in English.
The underlying model is that presented by Chomsky in
`Aspects of the Theory of Syntax.' Definitions are
given for the basic concepts of tree, analysis,
restriction, complex symbol, and structural change, as
well as for the major components of a transformational
grammar, phrase structure, lexicon, and
transformations. The syntax was developed as a
specification of input formats for the computer system
for transformational grammar described in [Joyce
Friedman, `A Computer System for Transformational
Grammar,' Stanford University Computer Science
Department report CS-84, January 1968]. It includes as
a subcase a fairly standard treatment of
transformational grammar, but has been generalized in
many respects.",
acknowledgement = ack-nhfb,
pdfpages = "51",
}
@TechReport{Smith:1968:IAD,
author = "Lyle B. Smith",
title = "Interval arithmetic determinant evaluation and its use
in testing for a {Chebyshev} system",
type = "Technical Report",
number = "CS-TR-68-96",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-96.html",
abstract = "Two recent papers by Hansen and by Hansen and R. R.
Smith have shown how interval arithmetic (I.A.) can be
used effectively to bound errors in matrix
computations. This paper compares a method proposed by
Hansen and R. R. Smith to straight-forward use of I.A.
in determinant evaluation. Computational results show
what accuracy and running times can be expected when
using I.A. for determinant evaluation. An application
using I.A. determinants in a program to test a set of
functions to see if they form a Chebyshev system is
then presented.",
acknowledgement = ack-nhfb,
keywords = "interval arithmetic",
pdfpages = "27",
}
@TechReport{Miller:1968:RCS,
author = "W. F. Miller",
title = "Research in the {Computer Science Department at
Stanford University}",
type = "Technical Report",
number = "STAN-CS-68-97",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "49",
month = apr,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bauer:1968:AWI,
author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
Graham",
title = "{ALGOL W} implementation",
type = "Technical Report",
number = "CS-TR-68-98",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1968",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-98.html",
abstract = "In writing a compiler of a new language (ALGOL W) for
a new machine (IBM System/360) we were forced to deal
with many unforeseen problems in addition to the
problems we expected to encounter. This report
describes the final version of the compiler. The
implemented language ALGOL W is based on the
Wirth/Hoare proposal for a successor to ALGOL 60. The
major differences from that proposal are in string
definition and operations and in complex number
representation.",
acknowledgement = ack-nhfb,
pdfpages = "153",
}
@TechReport{Friedman:1968:LNF,
author = "Joyce Friedman",
title = "Lecture Notes on Foundations for Computer Science",
type = "Technical Report",
number = "STAN-CS-68-99 (PB179057)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "212",
month = jun,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kaplan:1968:FTA,
author = "D. M. Kaplan",
title = "The Formal Theoretic Analysis of Stront Equivalence
for Elemental Programs",
type = "Technical Report",
number = "STAN-CS-68-101 (AIM-60, AD672923)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "263",
month = jun,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bartels:1968:NIS,
author = "R. Bartels",
title = "A Numerical Investigation of the Simplex Method",
type = "Technical Report",
number = "STAN-CS-68-104 (AD673010)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "122",
month = jul,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Richman:1968:EC,
author = "P. Richman",
title = "Epsilon-Calculus",
type = "Technical Report",
number = "STAN-CS-68-105 (AD673674)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "138",
month = aug,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Huberman:1968:PPC,
author = "B. Huberman",
title = "A Program to Play Chess End Games",
type = "Technical Report",
number = "STAN-CS-68-106 (AIM-65, AD673971)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
month = aug,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Friedman:1968:CET,
author = "Joyce Friedman",
title = "Computer Experiments in Transformational Grammar",
type = "Technical Report",
number = "STAN-CS-68-108 (AD692681)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = aug,
year = "1968",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bauer:1969:AWR,
author = "Henry R. Bauer and Sheldon I. Becker and Susan L.
Graham and Robert W. Floyd and George E. Forsythe and
Edwin H. Satterthwaite",
title = "{ALGOL W} (revised)",
type = "Technical Report",
number = "CS-TR-68-110",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-110.html;
https://bitsavers.org/pdf/stanford/cs_techReports/CS110_ALGOL_W_Revised_Sep69.pdf",
abstract = "``\booktitle{A Contribution to the Development of
ALGOL}'' by Niklaus Wirth and C. A. R. Hoare [Comm.
ACM, v.9, no. 6 (June 1966), pp. 413-431] was the basis
for a compiler developed for the IBM 360 at Stanford
University. This report is a description of the
implemented language, ALGOL W. Historical background
and the goals of the language may be found in the Wirth
and Hoare paper.",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001);
George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "112",
tableofcontents = "ALGOL W Language Description / Henry R. Bauer,
Sheldon Becker, Susan L. Graham, Edwin Satterthwaite /
1--65 \\
ALGOL W / Henry R. Bauer, Sheldon Becker, Susan L.
Graham / Error Messages / 66--75 \\
Notes on Number Representation on System/360 and
Relations to ALGOL W / George E. Forsythe / 76--89 \\
ALGOL W Deck Set-Up / 90--91 \\
Grammatical Description of ALGOL W / R. Floyd /
92--103",
}
@TechReport{Hansen:1969:ISM,
author = "Wildred J. Hansen",
title = "The impact of storage management on plex processing
language implementation",
type = "Technical Report",
number = "CS-TR-69-113",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-68-113.html",
abstract = "A plex processing system is implemented within a set
of environments whose relationships are vital to the
system's time/space efficiency: Data Environment Stack
Structures Data Structures Subroutine Environment
Routine Linkage Variable Binding Storage Management
Environment Memory Organization for Allocation Storage
Control This paper discusses these environments and
their relationships in detail. For each environment
there is some discussion of alternative implementation
techniques, the dependence of the implementation on the
hardware, and the dependence of the environment on the
language design. In particular, two language features
are shown to affect substantially the environment
design: variable length plexes and 'release' of active
plexes. Storage management is complicated by the
requirement for variable length plexes, but they can
substantially reduce memory requirements. If inactive
plexes are released, a garbage collector can be
avoided; but considerable tedious programming may be
required to maintain the status of each plex. Many plex
processing systems store numbers in strange formats and
compile arithmetic operations as subroutine calls, thus
handicapping the computer on the only operations it
does well. Careful coordination of the system
environments can permit direct numeric computation,
that is, a single instruction for each arithmetic
operation. This paper considers with each environment,
the requirements for direct numeric computation. To
explore the techniques discussed, a collection of
environments called Swym was implemented. This system
permits variable length plexes and compact lists. The
latter is a list representation requiring less space
than chained lists because pointers to the elements are
stored in consecutive words. In Swym, a list can be
partly compact and partly chained. The garbage
collector converts chained lists into compact lists
when possible. Swym has careful provision for direct
numeric computation, but no compiler has been built. To
illustrate Swym, an interpreter was implemented for a
small language similar to LISP 1.5. Details of Swym and
the language are in a series of appendices.",
acknowledgement = ack-nhfb,
pdfpages = "282",
}
@TechReport{Satterthwaite:1969:MEP,
author = "Edwin H. Satterthwaite",
title = "{MUTANT 0.5}: an experimental programming language",
type = "Technical Report",
number = "CS-TR-69-120",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-120.html",
abstract = "A programming language which continues the extension
and simplification of ALGOL 60 in the direction
suggested by EULER is defined and described. Techniques
used in an experimental implementation of that
language, called MUTANT 0.5, are briefly summarized.
The final section of this report is an attempt to
assess the potential value of the approach to
procedural programming language design exemplified by
MUTANT 0.5. Implementation and use of the experimental
system have indicated a sufficient number of conceptual
and practical problems to suggest that the general
approach is of limited value; however, a number of
specific features were found to be convenient, useful,
and adaptable to other philosophies of language
design.",
acknowledgement = ack-nhfb,
pdfpages = "63",
}
@TechReport{Moler:1969:ABE,
author = "Cleve B. Moler",
title = "Accurate bounds for the eigenvalues of the {Laplacian}
and applications to rhombical domains",
type = "Technical Report",
number = "CS-TR-69-121",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 17",
day = "19",
month = feb,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-121.html",
abstract = "We deal with the eigenvalues and eigenfunctions of
Laplace's differential operator on a bounded
two-dimensional domain G with zero values on the
boundary. The paper describes a new technique for
determining the coefficients in the expansion of an
eigenfunction in terms of particular eigenfunctions of
the differential operator. The coefficients are chosen
to make the sum of the expansion come close to
satisfying the boundary conditions. As an example, the
eigenvalues and eigenfunctions are determined for a
rhombical membrane.",
acknowledgement = ack-nhfb,
pdfpages = "18",
}
@TechReport{Mitchell:1969:HAN,
author = "William C. Mitchell and Douglas L. McCraith",
title = "Heuristic analysis of numerical variants of the
{Gram--Schmidt} orthonormalization process",
type = "Technical Report",
number = "CS-TR-69-122",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/rice-john-r.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-122.html",
abstract = "The Gram--Schmidt orthonormalization process is a
fundamental formula of analysis which is notoriously
unstable computationally. This report provides a
heuristic analysis of the process, which shows why the
method is unstable. Formulas are derived which describe
the propagation of round-off error through the process.
These formulas are supported by numerical experiments.
These formulas are then applied to a computational
variant of a basic method proposed by John R. Rice, and
this method is shown to offer significant improvement
over the basic algorithm. This finding is also
supported by numerical experiment. The formulas for the
error propagation are then used to produce a linear
corrector for the basic Gram--Schmidt process, which
shows significant improvement over both previous
methods, but at the cost of slightly more
computations.",
acknowledgement = ack-nhfb,
pdfpages = "24",
}
@TechReport{Brent:1969:EEP,
author = "R. P. Brent",
title = "Empirical Evidence for a Proposed Distribution of
Small Prime Gaps",
type = "Technical Report",
number = "STAN-CS-69-123 (AD696982)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = feb,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1969:MDS,
author = "Gene H. Golub",
title = "Matrix decompositions and statistical calculations",
type = "Technical Report",
number = "STAN-CS-69-124 (AD687719)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "52",
month = mar,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-124.html",
abstract = "Several matrix decompositions which are of some
interest in statistical calculations are presented. An
accurate method for calculating the canonical
correlation is given.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "stat, nla, lsq, qrd, svd",
pdfpages = "52",
xxnumber = "CS-TR-69-124",
}
@TechReport{Feldman:1969:GCI,
author = "Jerome A. Feldman and James Gips and James J. Horning
and Stephen Reder",
title = "Grammatical complexity and inference",
type = "Technical Report",
number = "CS-TR-69-125",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-125.html",
abstract = "The problem of inferring a grammar for a set of symbol
strings is considered and a number of new decidability
results obtained. Several notions of grammatical
complexity and their properties are studied. The
question of learning the least complex grammar for a
set of strings is investigated leading to a variety of
positive and negative results. This work is part of a
continuing effort to study the problems of
representation and generalization through the
grammatical inference question. Appendices A and B and
Section 2a.0 are primarily the work of Reder, Sections
2b and 3d of Horning, Section 4 and Appendix C of Gips,
and the remainder the responsibility of Feldman.",
acknowledgement = ack-nhfb,
pdfpages = "110",
}
@TechReport{Dantzig:1969:CST,
author = "George B. Dantzig",
title = "Complementary spanning trees",
type = "Technical Report",
number = "CS-TR-69-126",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-126.html",
abstract = "Given a network G whose arcs partition into
non-overlapping 'clubs' (sets) $ R_i $, D. Ray
Fulkerson has considered the problem of constructing a
spanning tree such that no two of its arcs belong to
(represent) the same club and has stated necessary and
sufficient conditions for such trees to exist. When
each club $ R_i $ consists of exactly two arcs, we
shall refer to each of the arc pair as the 'complement'
of the other, and the representative tree as a
complementary tree. Our objective is to prove the
following theorem: If there exists one complementary
tree, there exists at least two.",
acknowledgement = ack-nhfb,
pdfpages = "12",
}
@TechReport{Vicens:1969:ASR,
author = "P. Vicens",
title = "Aspects of Speech Recognition by Computer",
type = "Technical Report",
number = "STAN-CS-69-127 (AIM-85, AD687720)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "210",
month = apr,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Buzbee:1969:MOE,
author = "B. L. Buzbee and Gene H. Golub and C. W. Nielson",
title = "The method of odd\slash even reduction and
factorization with application to {Poisson}'s
equation",
type = "Technical Report",
number = "STAN-CS-69-128 (AD687717)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 37",
month = apr,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-128.html",
abstract = "Several algorithms are presented for solving block
tridiagonal systems of linear algebraic equations when
the matrices on the diagonal are equal to each other
and the matrices on the subdiagonals are all equal to
each other. It is shown that these matrices arise from
the finite difference approximation to certain elliptic
partial differential equations on rectangular regions.
Generalizations are derived for higher order equations
and non-rectangular regions.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "40",
xxnumber = "CS-TR-69-128",
}
@TechReport{Miller:1969:RCS,
author = "William F. Miller",
title = "Research in the {Computer Science Department, Stanford
University}",
type = "Technical Report",
number = "CS-TR-69-129",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-129.html",
abstract = "The research program of the Computer Science
Department can perhaps be best summarized in terms of
its research projects. The chart on the following page
lists the projects and the participation by faculty and
students. Two observations should be made to complete
the picture. Within the Artificial Intelligence
Project, the Stanford Computation Center, the SLAC
Computation Group, and the INFO project, there are a
large number of highly competent professional computer
scientists who add greatly to the total capability of
the campus. Also, there are a number of projects in
other schools or departments which are making
significant contributions to computer science. These,
too, add to the total computer environment. Summarized
by Professor W. F. Miller.",
acknowledgement = ack-nhfb,
pdfpages = "87",
}
@TechReport{Schank:1969:CDR,
author = "R. C. Schank",
title = "A Conceptual Dependency Representation for a
Computer-Oriented Semantics",
type = "Technical Report",
number = "STAN-CS-69-130 (AIM-83, PB183907)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "201",
month = mar,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Smith:1969:UMM,
author = "L. B. Smith",
title = "The Use of Man--Machine Interaction in Data-Fitting
Problems",
type = "Technical Report",
number = "STAN-CS-69-131 (SLAC-96)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "287",
month = mar,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Anonymous:1969:NP,
author = "Anonymous",
title = "{NEVER PRINTED}",
type = "Technical Report",
number = "STAN-CS-69-132",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "????",
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1969:HSL,
author = "Gene H. Golub and Christian H. Reinsch",
title = "Handbook Series Linear Algebra: Singular Value
Decompositions and Least Squares Solutions",
type = "Technical Report",
number = "STAN-CS-69-133 (AD687718)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = may,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); Christian H. Reinsch (?? ?? 1932--8 October
2022)",
}
@TechReport{Golub:1969:LLS,
author = "Gene H. Golub and Michael A. Saunders",
title = "Linear least squares and quadratic programming",
type = "Technical Report",
number = "STAN-CS-69-134 (AD700923)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = may,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-134.html",
abstract = "Several algorithms are presented for solving linear
least squares problems; the basic tool is
orthogonalization techniques. A highly accurate
algorithm is presented for solving least squares
problems with linear inequality constraints. A method
is also given for finding the least squares solution
when there is a quadratic constraint on the solution.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "38",
xxnumber = "CS-TR-69-134",
}
@TechReport{Gries:1969:CCI,
author = "David Gries",
title = "{CIL}: {Compiler Implementation Language}",
type = "Technical Report",
number = "STAN-CS-69-135 (SLACR-102)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-135.html",
abstract = "This report is a manual for the proposed Compiler
Implementation Language, CIL. It is not an expository
paper on the subject of compiler writing or
compiler-compilers. The language definition may change
as work progresses on the project.",
acknowledgement = ack-nhfb,
pdfpages = "124",
xxnumber = "CS-TR-69-135",
}
@TechReport{Pohl:1969:BDH,
author = "I. Pohl",
title = "Bi-Directional and Heuristic Search in Path Problems",
type = "Technical Report",
number = "STAN-CS-69-136 (SLACR-104)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "157",
month = may,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Henrici:1969:FPA,
author = "Peter Henrici",
title = "Fixed points of analytic functions",
type = "Technical Report",
number = "CS-TR-69-137",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 5",
month = jul,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-137.html",
abstract = "A continuous mapping of a simply connected, closed,
bounded set of the Euclidean plane into itself is known
to have at least one fixed point. It is shown that the
usual condition for the fixed point to be unique, and
for convergence of the iteration sequence to the fixed
point, can be relaxed if the mapping is defined by an
analytic function of a complex variable.",
acknowledgement = ack-nhfb,
author-dates = "Peter Karl Henrici (13 September 1923--13 March
1987)",
pdfpages = "8",
}
@TechReport{Green:1969:ATP,
author = "C. C. Green",
title = "The Application of Theorem Proving to
Question-Answering Systems",
type = "Technical Report",
number = "STAN-CS-69-138 (AIM-96, AD696394)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "162",
month = jun,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Horning:1969:SGI,
author = "J. J. Horning",
title = "A Study of Grammatical Inference",
type = "Technical Report",
number = "STAN-CS-69-139 (AIM-98, AD695401)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "166",
month = aug,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Forsythe:1969:DTN,
author = "G. E. Forsythe",
title = "Design --- Then and Now",
type = "Technical Report",
number = "STAN-CS-69-140 (AD698799)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = sep,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
}
@TechReport{Dahlquist:1969:BEL,
author = "Germund Dahlquist and Stanley C. Eisenstat and Gene H.
Golub",
title = "Bounds for the error of linear systems of equations
using the theory of moments",
type = "Technical Report",
number = "STAN-CS-69-141 (PB188542)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-141.html",
abstract = "Consider the system of linear equations $ A \underset
~ \to x = \underset ~ \to b $ where A is an $ n \times
n $ real symmetric, positive definite matrix and $
\underset \to b $ is a known vector. Suppose we are
given an approximation to $ \underset ~ \to x $, $
\underset ~ \to \xi $, and we wish to determine upper
and lower bounds for $ \Vert \underset ~ \to x \ -
\underset ~ \to \xi \Vert $ where $ \Vert \ldots {}
\Vert $ indicates the Euclidean norm. Given the
sequence of vectors $ {\{ {\underset \to r}_i \} }^k_{i
= 0} $ where $ {\underset ~ \to r}_i \ = A{\underset ~
\to r}_{i - 1} $ and $ {\underset ~ \to r}_o \ =
\underset ~ \to b - A \underset ~ \to \xi $, it is
shown how to construct a sequence of upper and lower
bounds for $ \Vert \underset ~ \to x \ - \underset ~
\to \xi \Vert $ using the theory of moments. In
addition, consider the Jacobi algorithm for solving the
system $ \underset ~ \to x \ = M \underset ~ \to x +
\underset ~ \to b \underline {viz.} {\underset ~ \to
x}_{i + 1} = M{\underset \to x}_i + \underset ~ \to b
$. It is shown that by examining $ {\underset ~ \to
\delta }_i \ = {\underset ~ \to x}_{i + 1} - {\underset
~ \to x}_i $, it is possible to construct upper and
lower bounds for $ \Vert {\underset \to x}_i -
\underset ~ \to x \Vert $.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); Germund Dahlquist (16 January 1925--8 February
2005)",
pdfpages = "29",
xxnumber = "CS-TR-69-141",
}
@TechReport{Golub:1969:SVR,
author = "Gene H. Golub and Richard R. Underwood",
title = "Stationary Values of the Ratio of Quadratic Forms
Subject to Linear Constraints",
type = "Technical Report",
number = "STAN-CS-69-142",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = nov,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/Matrix.bib;
https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Cited in {\AA}ke Bj{\"o}rck's bibliography on least
squares, which is available by anonymous ftp from {\tt
math.liu.se} in {\tt pub/references}.",
URL = "http://i.stanford.edu/TR/CS-TR-69-142.html",
abstract = "Let $A$ be a real symmetric matrix of order $n$, $B$ a
real symmetric positive definite matrix of order $n$,
and $C$ an $ n \times p$ matrix of rank $r$ with $ r
\leq p < n$. We wish to determine vectors $ \underset ~
\to x $ for which $ {\underset ~ \to x}^T \ A \underset
~ \to x \ / {\underset \to x}^T \ B \underset ~ \to x $
is stationary and $ C^T \underset ~ \to x \ = \underset
~ \to \Theta $, the null vector. An algorithm is given
for generating a symmetric eigensystem whose
eigenvalues are the stationary values and for
determining the vectors $ \underset ~ \to x $. Several
Algol procedures are included.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "nla, geig, regularization",
pdfpages = "24",
xxnumber = "CS-TR-69-142",
}
@TechReport{Jenkins:1969:TSV,
author = "M. A. Jenkins",
title = "Three-Stage Variable-Shift for the Solution of
Polynomial Equations with a Posteriori Error Bounds for
the Zeros",
type = "Technical Report",
number = "STAN-CS-69-143 (AD694464)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "199",
month = aug,
year = "1969",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis. This has also been
printed incorrectly as STAN-CS-69-138.",
}
@TechReport{Forsythe:1969:MMP,
author = "George E. Forsythe",
title = "The maximum and minimum of a positive definite
quadratic polynomial on a sphere are convex functions
of the radius",
type = "Technical Report",
number = "CS-TR-69-144",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 7",
month = jul,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-69-144.html",
abstract = "It is proved that in Euclidean $n$-space the maximum $
M(\rho) $ and minimum $ m(\rho) $ of a fixed positive
definite quadratic polynomial $Q$ on spheres with fixed
center are both convex functions of the radius $ \rho $
of the sphere. In the proof, which uses elementary
calculus and a result of Forsythe and Golub, $ m(\rho)$
and $ M(\rho)$ are shown to exist and lie in the
interval $ [2 \lambda_1, 2 \lambda_n]$, where $
\lambda_i$ are the eigenvalues of the quadratic form of
$Q$. Hence $ m''(\rho) > 0$ and $ M''(\rho) > 0$.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "10",
}
@TechReport{Henrici:1969:MSS,
author = "Peter Henrici",
title = "Methods of search for solving polynomial equations",
type = "Technical Report",
number = "CS-TR-69-145",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 23",
month = dec,
year = "1969",
bibdate = "Fri Nov 7 07:11:14 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
https://www.math.utah.edu/pub/bibnet/authors/l/lehmer-derrick-henry.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Dedicated to D. H. Lehmer on his 65th birthday.",
URL = "http://i.stanford.edu/TR/CS-TR-69-145.html",
abstract = "The problem of determining a zero of a given
polynomial with guaranteed error bounds, using an
amount of work that can be estimated a priori, is
attacked here by means of a class of algorithms based
on the idea of systematic search. Lehmer's ``machine
method'' for solving polynomial equations is a special
case. The use of the Schur--Cohn algorithm in Lehmer's
method is replaced by a more general proximity test
which reacts positively if applied at a point close to
a zero of a polynomial. Various such tests are
described, and the work involved in their use is
estimated. The optimality and non-optimality of certain
methods, both on a deterministic and on a probabilistic
basis, are established.",
acknowledgement = ack-nhfb,
author-dates = "Peter Karl Henrici (13 September 1923--13 March
1987)",
pdfpages = "26",
}
@TechReport{Ramos:1970:REA,
author = "George U. Ramos",
title = "Roundoff error analysis of the {Fast Fourier
Transform}",
type = "Technical Report",
number = "STAN-CS-70-146",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 29",
month = feb,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-146.html",
abstract = "This paper presents an analysis of roundoff errors
occurring in the floating-point computation of the fast
Fourier transform. Upper bounds are derived for the
ratios of the root-mean-square (RMS) and maximum
roundoff errors in the output data to the RMS value of
the input data for both single and multidimensional
transformations. These bounds are compared
experimentally with actual roundoff errors.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-70-146",
}
@TechReport{Forsythe:1970:PCW,
author = "George E. Forsythe",
title = "Pitfalls in Computation, or Why a Math Book Isn't
Enough",
type = "Technical Report",
number = "STAN-CS-70-147 (AD699897)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 43",
month = jan,
year = "1970",
bibdate = "Fri Jan 12 06:07:12 2024",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/70/147/CS-TR-70-147.pdf;
http://i.stanford.edu/TR/CS-TR-70-147.html",
abstract = "The floating-point number system is contrasted with
the real numbers. The author then illustrates the
variety of computational pitfalls a person can fall
into who merely translates information gained from pure
mathematics courses into computer programs. Examples
include summing a Taylor series, solving a quadratic
equation, solving linear algebraic systems, solving
ordinary and partial differential equations, and
finding polynomial zeros. It is concluded that
mathematics courses should be taught with a greater
awareness of automatic computation.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "54",
xxnumber = "CS-TR-70-147",
}
@TechReport{Knuth:1970:NAG,
author = "Donald E. Knuth and Robert W. Floyd",
title = "Notes on avoiding `go to' statements",
type = "Technical Report",
number = "STAN-CS-70-148 (PB188749)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 15",
month = jan,
year = "1970",
bibdate = "Thu Jan 11 16:32:28 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-70-148_Notes_on_Avoiding_GO_TO_Statements_Jan1970.pdf",
abstract = "During the last decade there has been a growing
sentiment that the use of `go to' statements is
undesirable, or actually harmful. This attitude is
apparently inspired by the idea that programs expressed
solely in terms of conventional iterative constructions
(`for', `while', etc.) are more readable and more
easily proved correct. In this note we will make a few
exploratory observations about the use and disuse of go
to statements, based on two typical programming
examples (from `symbol table searching' and
`backtracking').",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
pdfpages = "17",
remark = "Published in \booktitle{Information Processing
Letters}, {\bf 1}(1) 23--31, February 1971,
doi:10.1016/0020-0190(71)90018-4, and erratum {\bf
1}(4) 177, June 1972,
doi:/10.1016/0020-0190(72)90054-3.",
xxnumber = "CS-TR-70-148",
}
@TechReport{Knuth:1970:OBS,
author = "Donald E. Knuth",
title = "Optimum Binary Search Trees",
type = "Technical Report",
number = "STAN-CS-70-149 (PB188748)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = jan,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Acta Informatica}, {\bf 1}
14--25, 270 (1971).",
}
@TechReport{Wilkinson:1970:EPW,
author = "James H. Wilkinson",
title = "Elementary Proof of the {Wielandt--Hoffman} Theorem
and of its Generalization",
type = "Technical Report",
number = "STAN-CS-70-150 (AD699898)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-150.html",
abstract = "An elementary proof is given of the Wielandt--Hoffman
Theorem for normal matrices and of a generalization of
this theorem. The proof makes no direct appeal to
results from linear-programming theory.",
acknowledgement = ack-nhfb,
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
pdfpages = "10",
xxnumber = "CS-TR-70-150",
}
@TechReport{Volkov:1970:PDS,
author = "E. A. Volkov and George E. Forsythe",
title = "`{{\booktitle{On the Properties of the Derivatives of
the Solutions of Laplace's Equation and the Errors of
the Method of Finite Differences for Boundary Values in
$ C_2 $ and $ C_{1, 1} $}}' by E. A. Volkov}",
type = "Technical Report",
number = "STAN-CS-70-151",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-151.html",
abstract = "If a function $u$ is harmonic in a circular disk and
its boundary values are twice continuously
differentiable, $u$ need not have bounded second
derivatives in the open disk. For the Dirichlet problem
for Laplace's equation in a more general
two-dimensional region the discretization error of the
ordinary method of finite differences is studied, when
Collatz's method of linear interpolation is used at the
boundary. If the boundary of the region has a tangent
line whose angle satisfies a Lipschitz condition, and
if the boundary values have a first derivative
satisfying a Lipschitz condition, then the
discretization error is shown to be of order $ h^2 \ln
h^{-1} $. This bound is shown to be sharp. By a
different method of interpolation at the boundary one
can improve the bound to $ o(h^2) $. There are other
similar results. Translated by G. E. Forsythe.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "28",
xxnumber = "CS-TR-70-151",
}
@TechReport{Gustafson:1970:RCI,
author = "S. Gustafson",
title = "Rapid Computation of Interpolation Formulae and
Mechanical Quadrature Rules",
type = "Technical Report",
number = "STAN-CS-70-152",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = feb,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gustafson:1970:EPU,
author = "S. Gustafson",
title = "Error Propagation by Use of Interpolation Formulae and
Quadrature Rules which are Computed Numerically",
type = "Technical Report",
number = "STAN-CS-70-153 (AD701358)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = feb,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Stone:1970:SID,
author = "H. S. Stone",
title = "The Spectrum of Incorrectly Decoded Bursts for Cyclic
Error Codes",
type = "Technical Report",
number = "STAN-CS-70-154",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = feb,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buzbee:1970:MOE,
author = "B. L. Buzbee and Gene H. Golub and C. W. Nielson",
title = "The method of odd\slash even reduction and
factorization with application to {Poisson}'s equation,
part {II}",
type = "Technical Report",
number = "STAN-CS-70-155 (AD705508)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = mar,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-155.html",
abstract = "In this paper, we derive and generalize the methods of
Buneman for solving elliptic partial difference
equations in a rectangular region. We show why the
Buneman methods lead to numerically accurate solutions
whereas the CORF algorithm may be numerically unstable.
Several numerical examples are given and discussed.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "37",
xxnumber = "CS-TR-70-155",
}
@TechReport{Dantzig:1970:MCR,
author = "George B. Dantzig",
title = "On a model for computing round-off error of a sum",
type = "Technical Report",
number = "STAN-CS-70-156 (AD713972)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-156.html",
abstract = "No abstract available.",
acknowledgement = ack-nhfb,
pdfpages = "7",
xxnumber = "CS-TR-70-156",
}
@TechReport{Brent:1970:AMM,
author = "Richard P. Brent",
title = "Algorithms for matrix multiplication",
type = "Technical Report",
number = "STAN-CS-70-157 (AD705509)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-157.html",
abstract = "Strassen's and Winograd's algorithms for matrix
multiplication are investigated and compared with the
normal algorithm. Floating-point error bounds are
obtained, and it is shown that scaling is essential for
numerical accuracy using Winograd's method. In
practical cases Winograd's method appears to be
slightly faster than the other two methods, but the
gain is, at most, about 20\%. Finally, an attempt to
generalize Strassen's method is described.",
acknowledgement = ack-nhfb,
pdfpages = "55",
xxnumber = "CS-TR-70-157",
}
@TechReport{Stone:1970:PPP,
author = "H. Stone",
title = "Parallel Processing with the Perfect Shuffle",
type = "Technical Report",
number = "STAN-CS-70-158",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = mar,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{George:1970:UDM,
author = "John Alan George",
title = "The use of direct methods for the solution of the
discrete {Poisson} equation on non-rectangular
regions",
type = "Technical Report",
number = "STAN-CS-70-159 (AD708690)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-159.html",
abstract = "Some direct and iterative schemes are presented for
solving a standard finite-difference scheme for
Poisson's equation on a two-dimensional bounded region
R with Dirichlet conditions specified on the boundary $
\delta $R. These procedures make use of special-purpose
direct methods for solving rectangular Poisson
problems. The region is imbedded in a rectangle and a
uniform mesh is superimposed on it. The usual
five-point Poisson difference operator is applied over
the whole rectangle, yielding a block-tridiagonal
system of equations. The original problem, however,
determines only the elements of the right-hand side
which correspond to grid points lying within $ \delta
$R; the remaining elements can be treated as
parameters. The iterative algorithms construct a
sequence of right-hand sides in such a way that the
corresponding sequence of solutions on the rectangle
converges to the solution of the imbedded problem.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-70-159",
}
@TechReport{Bredt:1970:MPC,
author = "Thomas H. Bredt and Edward J. McCluskey",
title = "A model for parallel computer systems",
type = "Technical Report",
number = "STAN-CS-70-160 (CSL-TR-5, AD707762)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-160.html",
abstract = "A flow table model is defined for parallel computer
systems. In this model, fundamental-mode flow tables
are used to describe the operation of system
componenets, which may be programs or circuits.
Components communicate by changing the values on
interconnecting lines which carry binary level signals.
It is assumed that there is no bound on the time for
value changes to propagate over the interconnecting
lines. Given this delay assumption, it is necessary to
specify a mode of operation for system components such
that input changes which arrive while a component is
unstable do not affect the operation of the component.
Such a mode of operation is specified. Using the flow
table model, a new control algorithm for the
two-process mutual exclusion problem is designed. This
algorithm does not depend on the exclusive execution of
any primitive operations used in its implementation. A
circuit implementation of the control algorithm is
described.",
acknowledgement = ack-nhfb,
pdfpages = "66",
xxnumber = "CS-TR-70-160",
}
@TechReport{Hoffman:1970:FMA,
author = "L. J. Hoffman",
title = "The Formulary Model for Access Control and Privacy in
Computer Systems",
type = "Technical Report",
number = "STAN-CS-70-161 (SLACR-117)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "81",
month = may,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bartels:1970:NTMa,
author = "Richard H. Bartels and Gene H. Golub and Michael A.
Saunders",
title = "Numerical techniques in mathematical programming",
type = "Technical Report",
number = "STAN-CS-70-162 (SLACP-760, AD709564)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 61",
month = may,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-162.html",
abstract = "The application of numerically stable matrix
decompositions to minimization problems involving
linear constraints is discussed and shown to be
feasible without undue loss of efficiency. Part A
describes computation and updating of the product-form
of the LU decomposition of a matrix and shows it can be
applied to solving linear systems at least as
efficiently as standard techniques using the
product-form of the inverse. Part B discusses
orthogonalization via Householder transformations, with
applications to least squares and quadratic programming
algorithms based on the principal pivoting method of
Cottle and Dantzig. Part C applies the singular value
decomposition to the nonlinear least squares problem
and discusses related eigenvalue problems.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "complementary pivoting; householder transformations;
least squares; linear programming; matrix
decompositions; non-linear least squares; quadratic
programming",
pdfpages = "74",
xxnumber = "CS-TR-70-162 (SLACP-760, AD709564)",
}
@TechReport{Malcolm:1970:AFP,
author = "Michael A. Malcolm",
title = "An algorithm for floating-point accumulation of sums
with small relative error",
type = "Technical Report",
number = "STAN-CS-70-163 (AD708691)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-163.html",
abstract = "A practical algorithm for floating-point accumulation
is presented. Through the use of multiple accumulators,
errors due to cancellation are avoided. An example in
Fortran is included. An error analysis providing a
sharp bound on the relative error is also given.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-70-163",
}
@TechReport{Gordonova:1970:ERE,
author = "V. I. Gordonova and Linda C. Kaufman",
title = "`{{\booktitle{Estimates of the Roundoff Error in the
Solution of a System of Conditional Equations}}' by V.
I. Gordonova}",
type = "Technical Report",
number = "STAN-CS-70-164 (AD708692)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-164.html",
abstract = "Using backward error analysis, this paper compares the
roundoff error in the least-squares solution of a
system of conditional equations Ax=f by two different
methods. The first one entails solving the normal
equations $ A^T $Ax=$ A^T $ f and the second is one
proposed by Faddeev, Faddeeva, and Kublanovskaya in
1966. This latter method involves multiplying the
system by orthogonal matrices to transform the matrix A
into upper triangular form. Translated by Linda
Kaufman.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-70-164",
}
@TechReport{Bauer:1970:STM,
author = "Henry R. Bauer and Harold S. Stone",
title = "The scheduling of $n$ tasks with $m$ operations on two
processors",
type = "Technical Report",
number = "STAN-CS-70-165",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-165.html",
abstract = "The job shop problem is one scheduling problem for
which no efficient algorithm exists. That is, no
algorithm is known in which the number of computational
steps grow algebraically as the problem enlarges. This
paper presents a discussion of the problem of
scheduling N tasks on two processors when each task
consists of three operations. The operations of each
task must be performed in order and among the
processors. We analyze this problem through four
sub-problems. Johnson's scheduling algorithm is
generalized to solve two of these sub-problems, and
functional equation algorithms are used to solve the
remaining two problems. Except for one case, the
algorithms are efficient. The exceptional case has been
labelled the `core' problem and the difficulties are
described.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-70-165",
}
@TechReport{Sandewall:1970:RNL,
author = "E. J. Sandewall",
title = "Representing Natural-Language Information in Predicate
Calculus",
type = "Technical Report",
number = "STAN-CS-70-166 (AIM-128, AD713841)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jul,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Igarashi:1970:SAL,
author = "S. Igarashi",
title = "Semantics of {ALGOL}-Like Statements",
type = "Technical Report",
number = "STAN-CS-70-167 (AIM-129, AD712460)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "956",
month = jun,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kelly:1970:VIP,
author = "Michael David Kelly",
title = "Visual Identification of People by Computer",
type = "Technical Report",
number = "STAN-CS-70-168 (AIM-130, AD713252)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
month = aug,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "The thesis describes a computer program which performs
a complex picture processing task. The task is to
choose, from a collection of pictures of people taken
by a TV camera, those pictures that depict the same
person. The primary purpose of this research has been
directed toward the development of new techniques for
picture processing",
acknowledgement = ack-nhfb,
pdfpages = "513",
remark = "This is the author's Ph.D. thesis. The PDF file from
Google Books has many blank pages.",
xxpages = "138",
}
@TechReport{Knuth:1970:EFS,
author = "Donald E. Knuth",
title = "Examples of Formal Semantics",
type = "Technical Report",
number = "STAN-CS-70-169 (AIM-126, AD711329)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = aug,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Symposium on semantics of
algorithmic languages}, Springer (1971), ISBN
0-387-05377-8, pp. 212--235.",
}
@TechReport{Bredt:1970:ASC,
author = "Thomas H. Bredt",
title = "Analysis and synthesis of concurrent sequential
programs",
type = "Technical Report",
number = "STAN-CS-70-170 (CSL-TR-6, AD711334)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-170.html",
abstract = "This paper presents analysis and synthesis procedures
for a class of sequential programs. These procedures
aid in the design of programs for parallel computer
systems. In particular, the interactions of a given
program with other programs or circuits in a system can
be described precisely. The basis for this work is a
model for parallel computer systems in which the
operation of each component is described by a flow
table and the components interact by changing values on
interconnecting lines. The details of this model are
discussed in another paper [Stanford University
Department of Computer Science report STAN-CS-70-160].
The analysis procedure produces a flow table
description of a program. In program synthesis, a flow
table description is converted to a sequential program.
Using flow table design procedures, a control program
for the two-program mutual exclusion problem is
produced.",
acknowledgement = ack-nhfb,
pdfpages = "56",
xxnumber = "CS-TR-70-170",
}
@TechReport{Bredt:1970:SMP,
author = "Thomas H. Bredt",
title = "A survey of models for parallel computing",
type = "Technical Report",
number = "STAN-CS-70-171 (CSL-TR-8, AD714202)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-171.html",
abstract = "The work of Adams, Karp and Miller, Luconi, and
Rodriguez on formal models for parallel computations
and computer systems is reviewed. A general definition
of a parallel schema is given so that the similarities
and differences of the models can be discussed. Primary
emphasis is on the control structures used to achieve
parallel operation and on properties of the models such
as determinacy and equivalence. Decidable and
undecidable properties are summarized.",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-70-171",
}
@TechReport{Bredt:1970:APS,
author = "Thomas H. Bredt",
title = "Analysis of parallel systems",
type = "Technical Report",
number = "STAN-CS-70-172 (CSL-TR-7, AD714180)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-172.html",
abstract = "A formal analysis procedure for parallel computer
systems is presented. The flow table model presented in
an earlier paper [Stanford University Department of
Computer Science report STAN-CS-70-160] is used to
describe a system. Each component to the system is
described by a completely specified fundamental-mode
flow table. All delays in a parallel system are assumed
to be finite. Component delays are assumed to be
bounded and line delays unbounded. The concept of an
output hazard is introduced to account for the effects
of line delay and the lack of synchronization among
components. Necessary and sufficient conditions for the
absence of output hazards are given. The state of a
parallel system is defined by the present internal
state and input state of each component. The operation
of the system is described by a system state graph
which specifies all possible state transitions for a
specified initial system state. A procedure for
constructing the system state graph is given. The
analysis procedure may be summarized as follows. A
problem is stated in terms of restrictions on system
operation. A parallel system is said to operate
correctly with respect to the given problem if the
associated restrictions are always satisfied. The
restrictions specify either forbidden system states,
which are never to be entered during the operation of
the system, or forbidden system state sequences, which
must never appear during system operation. The
restrictions are tested by examining the system state
graph. A parallel system for the two-process mutual
exclusion problem is analyzed and the system is shown
to operate correctly with respect to this problem.
Finally, the conditions of determinacy and output
functionality, which have been used in other models of
parallel computing, are discussed as they relate to
correct solutions to the mutual exclusion problem.",
acknowledgement = ack-nhfb,
pdfpages = "64",
xxnumber = "CS-TR-70-172",
}
@TechReport{Bredt:1970:MEP,
author = "Thomas H. Bredt",
title = "The mutual exclusion problem",
type = "Technical Report",
number = "STAN-CS-70-173 (CSL-TR-9, AD714181)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-173.html",
abstract = "This paper discusses how $n$ components, which may be
programs or circuits, in a computer system can be
controlled so that (1) at most one component may
perform a designated `critical' operation at any
instant and (2) if one component wants to perform its
critical operation, it is eventually allowed to do so.
This control problem is known as the mutual exclusion
or interlock problem. A summary of the flow table model
[Stanford University Department of Computer Science
report STAN-CS-70-160] for computer systems is given.
In this model, a control algorithm is represented by a
flow table. The number of internal states in the
control flow table is used as a measure of the
complexity of control algorithms. A lower bound of $ n
+ 1 $ internal states is shown to be necessary if the
mutual exclusion problem is to be solved. Procedures to
generate control flow tables for the mutual exclusion
problem which require the minimum number of internal
states are described and it is proved that these
procedures given correct control solutions. Other
so-called `unbiased' algorithms are described which
require $ 2 n!$ internal states but break ties in the
case of multiple requests in favor of the component
that least recently executed its critical operation.
The paper concludes with a discussion of the tradeoffs
between central and distributed control algorithms.",
acknowledgement = ack-nhfb,
pdfpages = "72",
xxnumber = "CS-TR-70-173",
}
@TechReport{Manna:1970:TAP,
author = "Zohar Manna and Richard J. Waldinger",
title = "Towards automatic program synthesis",
type = "Technical Report",
number = "STAN-CS-70-174 (AIM-127, AD711395)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-174.html",
abstract = "An elementary outline of the theorem-proving approach
to automatic program synthesis is given, without
dwelling on technical details. The method is
illustrated by the automatic construction of both
recursive and iterative programs operating on natural
numbers, lists, and trees. In order to construct a
program satisfying certain specifications, a theorem
induced by those specifications is proved, and the
desired program is extracted from the proof. The same
technique is applied to transform recursively defined
functions into iterative programs, frequently with a
major gain in efficiency. It is emphasized that in
order to construct a program with loops or with
recursion, the principle of mathematical induction must
be applied. The relation between the version of the
induction rule used and the form of the program
constructed is explored in some detail.",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-70-174",
}
@TechReport{Malcolm:1970:DCS,
author = "Michael A. Malcolm",
title = "A description and comparison of subroutines for
computing {Euclidean} inner products on the {IBM 360}",
type = "Technical Report",
number = "STAN-CS-70-175 (AD713842)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-175.html",
abstract = "Several existing subroutines and an Algol W procedure
for computing inner products on the IBM 360, using more
precision than long, are described and evaluated. Error
bounds (when they exist) and execution timing tests are
included.",
acknowledgement = ack-nhfb,
pdfpages = "18",
xxnumber = "CS-TR-70-175",
}
@TechReport{Feigenbaum:1970:GPS,
author = "Edward A. Feigenbaum and Bruce G. Buchanan and Joshua
Lederberg",
title = "On generality and problem solving: a case study using
the {DENDRAL} program",
type = "Technical Report",
number = "STAN-CS-70-176 (AIM-131, AD715128)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 48",
month = aug,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-176.html",
abstract = "Heuristic DENDRAL is a computer program written to
solve problems of inductive inference in organic
chemistry. This paper will use the design of Heuristic
DENDRAL and its performance on different problems for a
discussion of the following topics: 1. the design for
generality; 2. the performance problems attendant upon
too much generality; 3. the coupling of expertise to
the general problem solving processes; 4. the symbiotic
relationship between generality and expertness, and the
implications of this symbiosis for the study and design
of problem solving systems. We conclude the paper with
a view of the design for a general problem solver that
is a variant of the `big switch' theory of
generality.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-70-176",
}
@TechReport{Floyd:1970:BNS,
author = "Robert W. Floyd and Donald E. Knuth",
title = "The {Bose--Nelson} Sorting Problem",
type = "Technical Report",
number = "STAN-CS-70-177 (AD715511)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = oct,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
remark = "Published in \booktitle{A Survey of Combinatorial
Theory}, North Holland (1973), ISBN 0-444-10425-9, pp.
189--195.",
}
@TechReport{Forsythe:1970:RCS,
author = "George E. Forsythe and William F. Miller",
title = "Research in the {Computer Science Department} and
selected other research in computing at {Stanford
University}",
type = "Technical Report",
number = "STAN-CS-70-178",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-178.html",
abstract = "The research program of the Computer Science
Department can perhaps be best summarized in terms of
its research projects. The chart on page ii lists the
projects and the participation by faculty and students.
The sections following the chart provide descriptions
of the individual projects. There are a number of
projects in other schools or departments which are
making significant contributions to computer science;
and these add to the total computer environment.
Descriptions of a few of these projects are also
included with this report. This list of projects
outside of Computer Science does not purport to be
complete or even representative.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "206",
xxnumber = "CS-TR-70-178",
}
@TechReport{Smith:1970:M,
author = "David Canfield Smith",
title = "{MLISP}",
type = "Technical Report",
number = "STAN-CS-70-179 (AIM-135, AD716566)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-179.html",
abstract = "MLISP is a high level list-processing and
symbol-manipulation language based on the programming
language LISP. MLISP programs are translated into LISP
programs and then executed or compiled. MLISP exists
for two purposes: (1) to facilitate the writing and
understanding of LISP programs; (2) to remedy certain
important deficiencies in the list-processing ability
of LISP.",
acknowledgement = ack-nhfb,
pdfpages = "106",
xxnumber = "CS-TR-70-179",
}
@TechReport{Falk:1970:CII,
author = "G. Falk",
title = "Computer Interpretation of Imperfect Line Data as a
Three-Dimensional Scene",
type = "Technical Report",
number = "STAN-CS-70-180 (AIM-132, AD715665)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "187",
month = oct,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hearn:1970:RUM,
author = "Anthony C. Hearn",
title = "{Reduce 2} --- User's Manual",
type = "Technical Report",
number = "STAN-CS-70-181 (AIM-133)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "85",
month = oct,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/red-g-l.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tenenbaum:1970:ACV,
author = "J. Tenenbaum",
title = "Accommodation in Computer Vision",
type = "Technical Report",
number = "STAN-CS-70-182 (AIM-134, AD748565)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "452",
month = sep,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{White:1970:MLT,
author = "George M. White",
title = "Machine learning through signature trees: applications
to human speech",
type = "Technical Report",
number = "STAN-CS-70-183 (AIM-136, AD717600)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-183.html",
abstract = "Signature tree `machine learning', pattern recognition
heuristics are investigated for the specific problem of
computer recognition of human speech. When the data
base of given utterances is insufficient to establish
trends with confidence, a large number of feature
extractors must be employed and `recognition' of an
unknown pattern made by comparing its feature values
with those of known patterns. When the data base is
replete, a `signature' tree can be constructed and
recognition can be achieved by the evaluation of a
select few features. Learning results from selecting an
optimal minimal set of features to achieve recognition.
Properties of signature trees and the heuristics for
this type of learning are of primary interest in this
exposition.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-70-183",
}
@TechReport{Malcolm:1970:NCJ,
author = "Michael A. Malcolm",
title = "A note on a conjecture of {L. J. Mordell}",
type = "Technical Report",
number = "STAN-CS-70-184 (AD715512)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-184.html",
abstract = "A computer proof is described for a previously
unsolved problem concerning the inequality $ \sum {i =
1}{n} x_i / (x_{i + 1} \ + x_{i + 2}) \geq \ f r a
c{n}{2} $.",
acknowledgement = ack-nhfb,
pdfpages = "7",
xxnumber = "CS-TR-70-184",
}
@TechReport{Nelson:1970:GPS,
author = "Edward C. Nelson",
title = "Graph program simulation",
type = "Technical Report",
number = "STAN-CS-70-185 (TID22593)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-185.html",
abstract = "This reports the simulation of a parallel processing
system based on a directed graph representation of
parallel computations. The graph representation is
based on the model developed by Duane Adams in which
programs are written as directed graphs whose nodes
represent operations and whose edges represent data
flow. The first part of the report describes a
simulator which interprets these graph programs. The
second part describes the use of the simulator in a
hypothetical environment which has an unlimited number
of processors and an unlimited amount of memory. Three
programs, a trapezoidal quadrature, a sort and a matrix
multiplication, were used to study the effect of
varying the relative speed of primitive operations on
computation time with problem size. The system was able
to achieve a high degree of parallelism. For example,
the simulator multiplied two $n$ by $n$ matrices in a
simulated time proportional to $n$.",
acknowledgement = ack-nhfb,
pdfpages = "198",
xxnumber = "CS-TR-70-185",
}
@TechReport{Knuth:1970:ESF,
author = "Donald E. Knuth",
title = "An Empirical Study of {Fortran} Programs",
type = "Technical Report",
number = "STAN-CS-70-186 (AIM-137, AD715513)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 42",
month = nov,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/AD0715513.pdf",
abstract = "A sample of programs, written in FORTRAN by a wide
variety of people for a wide variety of applications,
was chosen ``at random'' in an attempt to discover
quantitatively ``what programmers really do.''
Statistical results of this survey are presented here,
together with some of their apparent implications for
future work in compiler design. The principal
conclusion which may be drawn is the importance of a
program ``profile,'' namely a table of frequency counts
which record how often each statement is performed in a
typical run; there are strong indications that
profile-keeping should become a standard practice in
all computer systems, for casual users as well as
system programmers. This paper is the report of a three
month study undertaken by the author and about a dozen
students and representatives of the software industry
during the summer 1970. It is hoped that a reader who
studies this report will obtain a fairly clear
conception of how FORTRAN is being used, and what
compilers can do about it.",
acknowledgement = ack-nhfb,
pdfpages = "45",
}
@TechReport{Eisenstat:1970:MMP,
author = "Stanley C. Eisenstat and Thomas L. Magnanti and Steven
F. Maier and Michael B. McGrath and Vincent J.
Nicholson and Christiane Riedl and George B. Dantzig",
title = "{MPL}, {Mathematical Programming Language}:
specification manual for {Committee} review",
type = "Technical Report",
number = "STAN-CS-70-187 (AD197154)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-70-187.html",
abstract = "Mathematical Programming Language (MPL) is intended as
a highly readable, user oriented, programming tool for
use in the writing and testing of mathematical
algorithms, in particular experimental algorithms for
solving large-scale linear programs. It combines the
simplicity of standard mathematical notation with the
power of complex data structures. Variables may be
implicitly introduced into a program by their use in
the statement in which they first appear. No formal
defining statement is necessary. Statements of the
`let' and `where' type are part of the language.
Included within the allowable data structures of MPL
are matrices, partitioned matrices, and
multidimensional arrays. Ordered sets are included as
vectors with their constructs closely paralleling those
found in set theory. Allocation of storage is dynamic,
thereby eliminating the need for a data manipulating
subset of the language, as is characteristic of most
high level scientific programming languages. This
report summarizes the progress that has been made to
date in developing MPL. It contains a specification
manual, examples of the application of the language,
and the future directions and goals of the project. A
version of MPL, called MPL/70, has been implemented
using PL/I as a translator. This will be reported
separately. Until fully implemented, MPL is expected to
serve primarily as a highly readable communication
language for mathematical algorithms.",
acknowledgement = ack-nhfb,
pdfpages = "72",
xxnumber = "CS-TR-70-187",
}
@TechReport{Ashcroft:1970:TGP,
author = "E. Ashcroft and Zohar Manna",
title = "The Translation of {``Go} To'' Programs to {``While''}
Programs",
type = "Technical Report",
number = "STAN-CS-70-188 (AIM-138, PB197161)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1970:MTP,
author = "Z. Manna",
title = "Mathematical Theory of Partial Correctness",
type = "Technical Report",
number = "STAN-CS-70-189 (AIM-139, AD717601)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hopcroft:1970:AMS,
author = "J. Hopcroft",
title = "An {$ N \log N $} Algorithm for Minimizing States in a
Finite Automaton",
type = "Technical Report",
number = "STAN-CS-70-190 (AD719398)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Lesser:1970:IDE,
author = "V. Lesser",
title = "An Introduction to the Direct Emulation of Control
Structures by a Parallel Micro-Computer",
type = "Technical Report",
number = "STAN-CS-70-191 (SLACP-904, PB198494)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hopcroft:1970:AIP,
author = "J. Hopcroft",
title = "An {$ N \log N $} Algorithm for Isomorphism of Planar
Triply Connected Graphs",
type = "Technical Report",
number = "STAN-CS-70-192 (AD719399)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Schank:1970:IMC,
author = "R. Schank",
title = "Intention, Memory and Computer Understanding",
type = "Technical Report",
number = "STAN-CS-70-193 (AIM-140)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1970:ACP,
author = "Donald E. Knuth",
title = "{{\booktitle{The Art of Computer Programming}}} ---
Errata et Addenda",
type = "Technical Report",
number = "STAN-CS-70-194 (PB198495)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buzbee:1970:DSD,
author = "B. L. Buzbee and Fred W. Dorr and John Alan George and
Gene H. Golub",
title = "The Direct Solution of the Discrete {Poisson} Equation
on Irregular Regions",
type = "Technical Report",
number = "STAN-CS-71-195 (723871)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 30",
month = dec,
year = "1970",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-195.html",
abstract = "There are several very fast direct methods which can
be used to solve the discrete Poisson equation on
rectangular domains. We show that these methods can
also be used to treat problems on irregular regions.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "40",
xxnumber = "CS-TR-71-195",
}
@TechReport{Moler:1970:MCF,
author = "C. B. Moler",
title = "Matrix Computations with {Fortran} and Paging",
type = "Technical Report",
number = "STAN-CS-70-196 (AD725167)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = dec,
year = "1970",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Communications of the ACM},
{\bf 15}(4) April 1972.",
}
@TechReport{Ashcroft:1971:TGP,
author = "Edward A. Ashcroft and Zohar Manna",
title = "The translation of 'go to' programs to 'while'
programs",
type = "Technical Report",
number = "STAN-CS-71-188",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-188.html",
abstract = "In this paper we show that every flowchart program can
be written without $ \underline {\rm go to} $
statements by using $ \underline {\rm while} $
statements. The main idea is to introduce new variables
to preserve the values of certain variables at
particular points in the program; or alternatively, to
introduce special boolean variables to keep information
about the course of the computation. The 'while'
programs produced yield the same final results as the
original flowchart program but need not perform
computations in exactly the same way. However, the new
programs do preserve the 'topology' of the original
flowchart program, and are of the same order of
efficiency. We also show that this cannot be done in
general without adding variables.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-71-188",
}
@TechReport{Manna:1971:MTP,
author = "Zohar Manna",
title = "Mathematical theory of partial correctness",
type = "Technical Report",
number = "STAN-CS-71-189",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-189.html",
abstract = "In this work we show that it is possible to express
most properties regularly observed in algorithms in
terms of 'partial correctness' (i.e., the property that
the final results of the algorithm, if any, satisfy
some given input-output relation). This result is of
special interest since 'partial correctness' has
already been formulated in predicate calculus and in
partial function logic for many classes of
algorithms.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-71-189",
}
@TechReport{Hopcroft:1971:LAM,
author = "John E. Hopcroft",
title = "An $ n \log n $ algorithm for minimizing states in a
finite automaton",
type = "Technical Report",
number = "STAN-CS-71-190",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-190.html",
abstract = "An algorithm is given for minimizing the number of
states in a finite automaton or for determining if two
finite automata are equivalent. The asymptotic running
time of the algorithm is bounded by $ k n \log n $
where $k$ is some constant and $n$ is the number of
states. The constant $k$ depends linearly on the size
of the input alphabet.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-71-190",
}
@TechReport{Lesser:1971:IDE,
author = "Victor R. Lesser",
title = "An introduction to the direct emulation of control
structures by a parallel micro-computer",
type = "Technical Report",
number = "STAN-CS-71-191",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-191.html",
abstract = "This paper is an investigation of the organization of
a parallel micro-computer designed to emulate a wide
variety of sequential and parallel computers. This
micro-computer allows tailoring of its control
structure so that it is appropriate for the particular
computer to be emulated. The control structure of this
micro-computer is dynamically modified by changing the
organization of its data structure for control. The
micro-computer contains six primitive operators which
dynamically manipulate and generate a tree type data
structure for control. This data structure for control
is used as a syntactic framework within which
particular implementations of control concepts, such as
iteration, recursion, co-routines, parallelism,
interrupts, etc., can be easily expressed. The major
features of the control data structure and the
primitive operators are: (1) once the fixed control and
data linkages among processes have been defined, they
need not be rebuilt on subsequent executions of the
control structure; (2) micro-programs may be written so
that they execute independently of the number of
physical processors present and still take advantage of
available processors; (3) control structures for I/O
processes, data-accessing processes, and computational
processes are expressed in a single uniform framework.
An emulator programmed on this micro-computer works as
an iterative two-step process similar to the process of
dynamic compilation or run time macro-expansion. This
dynamic compilation approach to emulation differs
considerably from the conventional approach to
emulation, and provides a unifying approach to the
emulation of a wide variety of sequential and parallel
computers.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-71-191",
}
@TechReport{Hopcroft:1971:LAI,
author = "John E. Hopcroft",
title = "An $ n \log n $ algorithm for isomorphism of planar
triply connected graphs",
type = "Technical Report",
number = "STAN-CS-71-192",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-192.html",
abstract = "It is shown that the isomorphism problem for triply
connected planar graphs can be reduced to the problem
of minimizing states in a finite automaton. By making
use of an $ n \log n $ algorithm for minimizing the
number of states in a finite automaton, an algorithm
for determining whether two planar triply connected
graphs are isomorphic is developed. The asymptotic
growth rate of the algorithm grows as $ n \log n $
where $n$ is the number of vertices in the graph.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-71-192",
}
@TechReport{Schank:1971:IMC,
author = "Roger C. Schank",
title = "Intention, memory, and computer understanding",
type = "Technical Report",
number = "STAN-CS-71-193",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-193.html",
abstract = "Procedures are described for discovering the intention
of a speaker by relating the Conceptual Dependency
representation of the speaker's utterance to the
computer's world model such that simple implications
can be made. These procedures function at levels higher
than that of the sentence by allowing for predictions
based on context and the structure of the memory.
Computer understanding of natural language is shown to
consist of the following parts: assigning a conceptual
representation to an input; relating that
representation to the memory such as to extract the
intention of the speaker; and selecting the correct
response type triggered by such an utterance according
to the situation.",
acknowledgement = ack-nhfb,
pdfpages = "68",
xxnumber = "CS-TR-71-193",
}
@TechReport{Knuth:1971:MUG,
author = "Donald E. Knuth and Richard L. Sites",
title = "{MIX\slash 360} user's guide",
type = "Technical Report",
number = "STAN-CS-71-197",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-197.html;
http://www-db.stanford.edu/TR/CS-TR-71-197.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-71-197",
abstract = "MIX/360 is an assembler and simulator for the
hypothetical MIX machine, which is described for
example in Knuth's $ \underline {The Art of Computer
Programming} $, Section 1.3.1. The system contains
several debugging aids to help program construction and
verification.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-71-197",
pdfpages = "16",
xxnumber = "CS-TR-71-197",
}
@TechReport{Brent:1971:AFZ,
author = "R. Brent",
title = "Algorithms for Finding Zeros and Extrema of Functions
without Calculating Derivatives",
type = "Technical Report",
number = "STAN-CS-71-198 (AD726170)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "250",
month = feb,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Staff:1971:BSC,
author = "{Staff}",
title = "Bibliography of {Stanford Computer Science} Reports
1963--1971",
type = "Technical Report",
number = "STAN-CS-71-199 (PB198415)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = feb,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Herriot:1971:APC,
author = "J. G. Herriot and Christian H. Reinsch",
title = "{ALGOL 60} Procedures for the Calculation of
Interpolating Natural Spline Functions",
type = "Technical Report",
number = "STAN-CS-71-200 (PB198416)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 30",
month = feb,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
ZMnumber = "0252.65006",
acknowledgement = ack-nhfb,
author-dates = "Christian H. Reinsch (?? ?? 1932--8 October 2022)",
}
@TechReport{Hopcroft:1971:PTV,
author = "John E. Hopcroft and Robert Endre Tarjan",
title = "Planarity testing in {$ V \log V $} steps: extended
abstract",
type = "Technical Report",
number = "STAN-CS-71-201 (AD722434)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-201.html",
abstract = "An efficient algorithm is presented for determining
whether or not a given graph is planar. If V is the
number of vertices in the graph, the algorithm requires
time proportional to $ V \log V $ and space
proportional to $V$ when run on a random-access
computer. The algorithm constructs the facial
boundaries of a planar representation without backup,
using extensive list-processing features to speed
computation. The theoretical time bound improves on
that of previously published algorithms. Experimental
evidence indicates that graphs with a few thousand
edges can be tested within seconds.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-71-201",
}
@TechReport{Saal:1971:CS,
author = "Harry J. Saal and William E. Riddle",
title = "Communicating semaphores",
type = "Technical Report",
number = "STAN-CS-71-202 (SLAC-117)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-202.html",
abstract = "This paper describes two extensions to the semaphore
operators originally introduced by Dijkstra. These
extensions can be used to reduce: (1) the number of
semaphore references; (2) the time spent in critical
sections; and (3) the number of distinct semaphores
required for proper synchronization without greatly
increasing the time required for semaphore operations.
Communicating semaphores may be utilized not only for
synchronization but also for message switching,
resource allocation from pools and as general queueing
mechanisms.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-71-202",
}
@TechReport{Buchanan:1971:HDP,
author = "Bruce G. Buchanan and Joshua Lederberg",
title = "The {Heuristic DENDRAL} program for explaining
empirical data",
type = "Technical Report",
number = "STAN-CS-71-203 (AIM-141, AD730506)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-203.html",
abstract = "The Heuristic DENDRAL program uses an information
processing model of scientific reasoning to explain
experimental data in organic chemistry. This report
summarizes the organization and results of the program
for computer scientists. The program is divided into
three main parts: planning, structure generation, and
evaluation. The planning phase infers constraints on
the search space from the empirical data input to the
system. The structure generation phase searches a tree
whose termini are models of chemical molecules using
pruning heuristics of various kinds. The evaluation
phase tests the candidate structures against the
original data. Results of the program's analyses of
some test data are discussed.",
acknowledgement = ack-nhfb,
pdfpages = "21",
xxnumber = "CS-TR-71-203",
}
@TechReport{Ingalls:1971:FFE,
author = "Daniel H. H. Ingalls",
title = "{FETE}: a {Fortran} execution time estimator",
type = "Technical Report",
number = "STAN-CS-71-204 (PB198510)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-204.html",
abstract = "If you want to live cheaply, you must make a list of
how much money is spent on each thing every day. This
enumeration will quickly reveal the principal areas of
waste. The same method works for saving computer time.
Originally, one had to put his own timers and counters
into a program to determine the distribution of time
spent in each part. Recently several automated systems
have appeared which either insert counters
automatically or interrupt the program during its
execution to produce the tallies. FETE is a system of
the former type which has two outstanding
characteristics: it is very easy to implement and it is
very easy to use. By demonstrating such convenience, it
should establish execution timing as a standard tool in
program development.",
acknowledgement = ack-nhfb,
pdfpages = "14",
xxnumber = "CS-TR-71-204",
}
@TechReport{Milner:1971:ADS,
author = "Robin Milner",
title = "An algebraic definition of simulation between
programs",
type = "Technical Report",
number = "STAN-CS-71-205 (AIM-142, AD731383)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-205.html",
abstract = "A simulation relation between programs is defined
which is quasi-ordering. Mutual simulation is then an
equivalence relation, and by dividing out by it we
abstract from a program such details as how the
sequencing is controlled and how data is represented.
The equivalence classes are approximations to the
algorithms which are realized, or expressed, by their
member programs. A technique is given and illustrated
for proving simulation and equivalence of programs;
there is an analogy with Floyd's technique for proving
correctness of programs. Finally, necessary and
sufficient conditions for simulation are given.",
acknowledgement = ack-nhfb,
pdfpages = "23",
subject-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
xxnumber = "CS-TR-71-205",
}
@TechReport{Knuth:1971:MAA,
author = "Donald E. Knuth",
title = "Mathematical Analysis of Algorithms",
type = "Technical Report",
number = "STAN-CS-71-206 (AD726158)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = mar,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hopcroft:1971:EAG,
author = "John E. Hopcroft and Robert Endre Tarjan",
title = "Efficient algorithms for graph manipulation",
type = "Technical Report",
number = "STAN-CS-71-207 (AD726169)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-207.html",
abstract = "Efficient algorithms are presented for partitioning a
graph into connected components, biconnected components
and simple paths. The algorithm for partitioning of a
graph into simple paths is iterative and each iteration
produces a new path between two vertices already on
paths. (The start vertex can be specified dynamically.)
If V is the number of vertices and E is the number of
edges each algorithm requires time and space
proportional to max(V,E) when executed on a random
access computer.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-71-207",
}
@TechReport{George:1971:CIF,
author = "John Alan George",
title = "Computer Implementation of the Finite Element Method",
type = "Technical Report",
number = "STAN-CS-71-208 (AD726171)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "220",
month = mar,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{McCarthy:1971:PTR,
author = "John McCarthy and Arthur L. Samuel and Edward A.
Feigenbaum and Joshua Lederberg",
title = "Project technical report",
type = "Technical Report",
number = "STAN-CS-71-209 (AIM-143, AD724867)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-209.html",
abstract = "An overview is presented of current research at
Stanford in artificial intelligence and heuristic
programming. This report is largely the text of a
proposal to the Advanced Research Projects Agency for
fiscal years 1972-73.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011);
Arthur Lee Samuel (5 December 1901--29 July 1990)",
pdfpages = "90",
xxnumber = "CS-TR-71-209",
}
@TechReport{Purdy:1971:APC,
author = "J. Gerry Purdy",
title = "{ACCESS}: a program for the catalog and access of
information",
type = "Technical Report",
number = "STAN-CS-71-210 (PB201917)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-210.html",
abstract = "ACCESS is a program for the catalog and access of
information. The program is primarily designed for and
intended to handle a personal library, although larger
applications are possible. ACCESS produces a listing of
all entries by locator code (so one knows where to find
the entry in his library), a listing of entry titles by
user-specified category codes, and a keyword-in-context
KWIC listing (each keyword specified by the user).
ACCESS is presently programmed in FORTRAN and operates
on any IBM System/360 under OS (it uses the IBM
SORT/MERGE package). It is anticipated a machine
language version (soon to be implemented) will greatly
decrease the running time of the program.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-71-210",
}
@TechReport{Malcolm:1971:ARP,
author = "Michael A. Malcolm",
title = "Algorithms to reveal properties of floating-point
arithmetic",
type = "Technical Report",
number = "STAN-CS-71-211 (AD727104)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-211.html",
abstract = "Two algorithms are presented in the form of Fortran
subroutines. Each subroutine computes the radix and
number of digits of the floating-point numbers and
whether rounding or chopping is done by the machine on
which it is run. The methods are shown to work on any
`reasonable' floating-point computer.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-71-211",
}
@TechReport{Morgana:1971:TMR,
author = "Maria Aurora Morgana",
title = "Time and memory requirements for solving linear
systems",
type = "Technical Report",
number = "STAN-CS-71-212 (AD727107)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-212.html",
abstract = "The Computer Science Department program library
contains a number of ALGOL W procedures and FORTRAN
subroutines which can be used to solve systems of
linear equations. This report describes the results of
tests to determine the amount of time and memory
required to solve systems of various orders.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-71-212",
}
@TechReport{Tarjan:1971:SPS,
author = "Robert Endre Tarjan",
title = "The switchyard problem: sorting using networks of
queues and stacks",
type = "Technical Report",
number = "STAN-CS-71-213 (PB201629)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-213.html",
abstract = "The problem of sorting a sequence of numbers using a
network of queues and stacks is presented. A
characterization of sequences sortable using parallel
queues is given, and partial characterizations of
sequences sortable using parallel stacks and networks
of queues are given.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-71-213",
}
@TechReport{Graham:1971:CTC,
author = "Ronald L. Graham and Donald E. Knuth and T. S.
Motzkin",
title = "Complements and Transitive Closures",
type = "Technical Report",
number = "STAN-CS-71-214 (AD727108)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = apr,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
remark = "Published in \booktitle{Discrete Mathematics}, {\bf 2}
17--29 (1972).",
}
@TechReport{Malcolm:1971:PRP,
author = "Michael A. Malcolm",
title = "{PL360} (Revised) A Programming Language for the {IBM
360}",
type = "Technical Report",
number = "STAN-CS-71-215 (AD727115)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 94",
month = may,
year = "1971",
bibdate = "Thu Jan 11 16:35:00 2024",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://infolab.stanford.edu/pub/cstr/reports/cs/tr/71/215/CS-TR-71-215.pdf;
https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-215_PL360_Rev_May72.pdf",
abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
description of PL360, a programming language designed
specifically for the IBM 360. PL360 has an appearance
similar to that of Algol, but it provides the
facilities of a symbolic machine language. Since 1968,
numerous extensions and modifications have been made to
the PL360 compiler which was originally designed and
implemented by N. Wirth and J. Wells. Interface and
input--output subroutines have been written which allow
the use of PL360 under OS, DOS, MTS and Orvyl.\par
A formal description of PL360 as it is presently
implemented is given. The description of the language
is followed by sections on the use of PL360 under
various operating systems, namely OS, DOS and MTS.
Instructions on how to use the PL360 compiler and PL360
programs in an interactive mode under the Orvyl
time-sharing monitor are also included.",
acknowledgement = ack-nhfb,
pdfpages = "112",
xxnumber = "CS-TR-71-215",
}
@TechReport{Kling:1971:RAA,
author = "R. E. Kling",
title = "Reasoning by Analogy with Applications to Heuristics
Problem Solving: a Case Study",
type = "Technical Report",
number = "STAN-CS-71-216 (AIM-147, AD732457)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "180",
month = may,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ashcroft:1971:DPM,
author = "Edward A. Ashcroft and Zohar Manna and Amir Pneuli",
title = "Decidable properties of monadic functional schemas",
type = "Technical Report",
number = "STAN-CS-71-217 (AIM-148, AD731730)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-217.html",
abstract = "We define a class of (monadic) functional schemas
which properly includes 'Ianov' flowchart schemas. We
show that the termination, divergence and freedom
problems for functional schemas are decidable. Although
it is possible to translate a large class of non-free
functional schemas into equivalent free functional
schemas, we show that this cannot be done in general.
We show also that the equivalence problem for free
functional schemas is decidable. Most of the results
are obtained from well-known results in Formal
Languages and Automata Theory.",
acknowledgement = ack-nhfb,
pdfpages = "11",
xxnumber = "CS-TR-71-217",
}
@TechReport{Debruijn:1971:AHP,
author = "N. G. Debruijn and Donald E. Knuth and S. O. Rice",
title = "The Average Height of Plane Trees",
type = "Technical Report",
number = "STAN-CS-71-218 (AD731038)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
month = may,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Quam:1971:CCP,
author = "Lynn Quam",
title = "Computer Comparison of Pictures",
type = "Technical Report",
number = "STAN-CS-71-219 (AIM-144)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = may,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Stone:1971:DME,
author = "Harold Stone",
title = "Dynamic Memories with Enhanced Data Access",
type = "Technical Report",
number = "STAN-CS-71-220 (CSL-14, AD727116)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = feb,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buchanan:1971:HPS,
author = "Bruce G. Buchanan and Edward A. Feigenbaum and Joshua
Lederberg",
title = "A heuristic programming study of theory formation in
science",
type = "Technical Report",
number = "STAN-CS-71-221 (AIM-145, AD731729)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-221.html",
abstract = "The Meta-DENDRAL program is a vehicle for studying
problems of theory formation in science. The general
strategy of Meta-DENDRAL is to reason from data to
plausible generalizations and then to organize the
generalizations into a unified theory. Three main
subproblems are discussed: (1) explain the experimental
data for each individual chemical structure, (2)
generalize the results from each structure to all
structures, and (3) organize the generalizations into a
unified theory. The program is built upon the concepts
and programmed routines already available in the
Heuristic DENDRAL performance program, but goes beyond
the performance program in attempting to formulate the
theory which the performance program will use.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-71-221",
}
@TechReport{Meyers:1971:LRT,
author = "W. J. Meyers",
title = "Linear Representation of Tree Structure (a
Mathematical Theory of Parenthesis-Free Notations)",
type = "Technical Report",
number = "STAN-CS-71-222 (PB235417/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "245",
month = jun,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Graham:1971:PLB,
author = "Susan Graham",
title = "Precedence Languages and Bounded Right Context
Languages",
type = "Technical Report",
number = "STAN-CS-71-223 (PB203429)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "192",
month = jul,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ershov:1971:PP,
author = "Andrei P. Ershov",
title = "Parallel programming",
type = "Technical Report",
number = "STAN-CS-71-224 (AIM-146, PB212183)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-224.html",
abstract = "This report is based on lectures given at Stanford
University by Dr. Ershov in November, 1970.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-71-224",
}
@TechReport{Bjorck:1971:NMC,
author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
title = "Numerical methods for computing angles between linear
subspaces",
type = "Technical Report",
number = "STAN-CS-71-225 (PB203344)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-225.html",
abstract = "Assume that two subspaces $F$ and $G$ of unitary space
are defined as the ranges (or nullspaces) of given
rectangular matrices $A$ and $B$. Accurate numerical
methods are developed for computing the principal
angles $ \theta_k (F, G) $ and orthogonal sets of
principal vectors $ u_k \ \epsilon F $ and $ v_k
\epsilon G $, $ k = 1, 2, \ldots {}, q = \dim (G) \leq
\dim (F)$. An important application in statistics is
computing the canonical correlations $ \sigma_k = \cos
\theta_k $ between two sets of variates. A perturbation
analysis shows that the condition number for $ \theta_k
$ essentially is $ \max (\kappa (A), \kappa (B)) $,
where $ \kappa $ denotes the condition number of a
matrix. The algorithms are based on a preliminary $ Q
R$-factorization of $A$ and $B$ (or $ A^H$ and $ B^H
$), for which either the method of Householder
transformations (HT) or the modified Gram--Schmidt
method (MGS) is used. Then $ \cos \theta_k$ and $ \sin
\theta_k$ are computed as the singular values of
certain related matrices. Experimental results are
given, which indicates that MGS gives $ \theta_k $ with
equal precision and fewer arithmetic operations than
HT. However, HT gives principal vectors, which are
orthogonal to working accuracy, which is not in general
true for MGS. Finally the case when $A$ and\slash or
$B$ are rank deficient is discussed.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "33",
xxnumber = "CS-TR-71-225",
}
@TechReport{George:1971:SSP,
author = "James E. George",
title = "{SIMPLE}: a simple precedence translator writing
system",
type = "Technical Report",
number = "STAN-CS-71-226 (SLAC-133)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-226.html",
abstract = "SIMPLE is a translator writing system composed of a
simple precedence syntax analyzer and a semantic
constructor and is implemented in PL/I. It provides an
error diagnostic and recovery mechanism for any system
implemented using SIMPLE. The removal of precedence
conflicts is discussed in detail with several examples.
The utilization of SIMPLE is illustrated by defining a
command language meta system for the construction of
scanners for a wide variety of command oriented
languages. This meta system is illustrated by defining
commands from several text editors.",
acknowledgement = ack-nhfb,
pdfpages = "98",
xxnumber = "CS-TR-71-226",
}
@TechReport{George:1971:GGE,
author = "James E. George",
title = "{GEMS} --- a Graphical Experimental Meta System",
type = "Technical Report",
number = "STAN-CS-71-227 (SLAC-134)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "184",
month = jul,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kaufman:1971:FMA,
author = "Linda C. Kaufman",
title = "Function minimization and automatic therapeutic
control",
type = "Technical Report",
number = "STAN-CS-71-228 (PB203343)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-228.html",
abstract = "No abstract available.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-71-228",
}
@TechReport{Lee:1971:VSN,
author = "Erastus H. Lee and George E. Forsythe",
title = "Variational study of nonlinear spline curves",
type = "Technical Report",
number = "STAN-CS-71-229 (AD732766)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-229.html",
abstract = "This is an exposition of the variational and
differential properties of nonlinear spline curves,
based on the Euler-Bernoulli theory for the bending of
thin beams or elastica. For both open and closed
splines through prescribed nodal points in the
Euclidean plane, various types of nodal constraints are
considered, and the corresponding algebraic and
differential equations relating curvature, angle, arc
length, and tangential force are derived in a simple
manner. The results for closed splines are apparently
new, and they cannot be derived by the consideration of
a constrained conservative system. There is a survey of
the scanty recent literature.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
pdfpages = "27",
xxnumber = "CS-TR-71-229",
}
@TechReport{Sites:1971:ARM,
author = "Richard L. Sites",
title = "{ALGOL} With Reference Manual",
type = "Technical Report",
number = "STAN-CS-71-230 (PB203601)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = aug,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Schmidt:1971:SRT,
author = "Rod Schmidt",
title = "A Study of the Real-Time Control of a Computer Driven
Vehicle",
type = "Technical Report",
number = "STAN-CS-71-231 (AIM-149, AD732644)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "180",
month = aug,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Moler:1971:AGM,
author = "Cleve B. Moler and Gilbert W. Stewart",
title = "An algorithm for the generalized matrix eigenvalue
problem {$ A x = \lambda B x $}",
type = "Technical Report",
number = "STAN-CS-71-232 (AD733073 CNA-32)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 50",
month = oct,
year = "1971",
bibdate = "Sat Apr 07 09:36:51 2007",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Issued jointly as report CNA 32 by the Center for
Numerical Analysis, the University of Texas at
Austin.",
URL = "https://apps.dtic.mil/sti/tr/pdf/AD0746896.pdf",
abstract = "A new method, called the $ Q Z $ algorithm, solution
of the matrix eigenvalue problem $ A x = \lambda B x $
with general square matrices $A$ and $B$. Particular
attention is paid to the degeneracies which result when
$B$ is singular. No inversions of $B$ or its
submatrices are used. The algorithm is a generalization
of the the $ Q R $ algorithm, and reduces to it when $
B = I$. A Fortran program and some illustrative
examples are included.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-71-232",
}
@TechReport{Wilner:1971:DSD,
author = "Wayne Wilner",
title = "Declarative Semantic Definition",
type = "Technical Report",
number = "STAN-CS-71-233",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "211",
month = aug,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1971:SMEa,
author = "Gene H. Golub",
title = "Some modified eigenvalue problems",
type = "Technical Report",
number = "STAN-CS-71-234 (SU326 P30-11)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = aug,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-234.html",
abstract = "We consider the numerical calculation of several
eigenvalue problems which require some manipulation
before the standard algorithms may be used. This
includes finding the stationary values of a quadratic
form subject to linear constraints and determining the
eigenvalues of a matrix which is modified by a matrix
of rank one. We also consider several inverse
eigenvalue problems. This includes the problem of
computing the Gauss--Radau and Gauss--Lobatto
quadrature rules. In addition, we study several
eigenvalue problems which arise in least squares.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "38",
xxnumber = "CS-TR-71-234",
}
@TechReport{Floyd:1971:TID,
author = "Robert W. Floyd",
title = "Toward Iterative Design of Correct Programs",
type = "Technical Report",
number = "STAN-CS-71-235 (AIM-150)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = sep,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Golub:1971:NCU,
author = "Gene H. Golub and George P. H. Styan",
title = "Numerical computations for univariate linear models",
type = "Technical Report",
number = "STAN-CS-71-236 (AD737648)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = sep,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-236.html",
abstract = "We consider the usual univariate linear model $
E(\underset ~ \to y) = \underset ~ \to X \underset ~
\to \gamma $, $ V (\underset ~ \to y) = \sigma^2
\underset ~ \to I $. In Part One of this paper $
\underset ~ \to X $ has full column rank. Numerically
stable and efficient computational procedures are
developed for the least squares estimation of $
\underset ~ \to \gamma $ and the error sum of squares.
We employ an orthogonal triangular decomposition of $
\underset ~ \to X $ using Householder transformations.
A lower bound for the condition number of $ \underset ~
\to X $ is immediately obtained from this
decomposition. Similar computational procedures are
presented for the usual F-test of the general linear
hypothesis $ \underset ~ \to L \ ' \underset ~ \to
\gamma = \underset ~ \to 0 $ ; $ \underset ~ \to L \ '
\underset ~ \to \gamma = \underset ~ \to m $ is also
considered for $ \underset ~ \to m \ \neq \ 0 $.
Updating techniques are given for adding to or removing
from ($ \underset ~ \to X, \underset ~ \to y $) a row,
a set of rows or a column. In Part Two, $ \underset ~
\to X$ has less than full rank. Least squares estimates
are obtained using generalized inverses. The function $
\underset ~ \to L ' \underset ~ \to \gamma $ is
estimable whenever it admits an unbiased estimator
linear in $ \underset ~ \to y$. We show how to
computationally verify estimability of $ \underset ~
\to L ' \underset ~ \to \gamma $ and the equivalent
testability of $ \underset ~ \to L ' \underset ~ \to
\gamma \ = \underset ~ \to 0$.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "39",
xxnumber = "CS-TR-71-236",
}
@TechReport{VanVoorhis:1971:GDS,
author = "David C. {Van Voorhis}",
title = "A generalization of the divide-sort-merge strategy for
sorting networks",
type = "Technical Report",
number = "STAN-CS-71-237 (CSL-TR-16, AD737270)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-237.html",
abstract = "With a few notable exceptions the best sorting
networks known have employed a `divide-sort-merge'
strategy. That is, the N inputs are divided into 2
groups --- normally of size $ \lceil \frac {1}{2} N
\rceil $ and $ \lfloor \frac {1}{2} N \rfloor $ [Here $
\lceil x \rceil $ denotes the smallest integer greater
than or equal to $x$, whereas $ \lfloor x \rfloor $
denotes the largest integer less than or equal to $x$]
that are sorted independently and then `merged'
together to form a single sorted sequence. An N-sorter
network that uses this strategy consists of 2 smaller
sorting networks followed by a merge network. The best
merge networks known are also constructed recursively,
using 2 smaller merge networks followed by a simple
arrangement of $ \lceil \frac {1}{2} N \rceil $ - 1
comparators. We consider a generalization of the
divide-sort-merge strategy in which the N inputs are
divided into g $ \geq $ 2 disjoint groups that are
sorted independently and then merged together. The
merge network that combines these $g$ sorted groups
uses $ d \geq 2 $ smaller merge networks as an initial
subnetwork. The two parameters g and d together define
what we call a `$ [g, d]$' strategy. A $ [g, d]$
$N$-sorter network consists of g smaller sorting
networks followed by a $ [g, d]$ merge network. The
initial portion of the $ [g, d]$ merge network consists
of d smaller merge networks; the final portion, which
we call the `$f$-network,' includes whatever additional
comparators are required to complete the merge. When $
g = d = 2$, the $f$-network is a simple arrangement of
$ \lceil \frac {1}{2} N \rceil $ - 1 comparators;
however, for larger $ g, d$ the structure of the $ [g,
d]$ $f$-network becomes increasingly complicated. In
this paper we describe how to construct $ [g, d]$
$f$-networks for arbitrary g,d. For $ N > 8$ the
resulting $ [g, d]$ $N$-sorter networks are more
economical than any previous networks that use the
divide-sort-merge strategy; for $ N > 34$ the resulting
networks are more economical than previous networks of
any construction. The $ [4, 4]$ $N$-sorter network
described in this paper requires $ \frac {1}{4}
N{(log_2 N)}^2 \ \frac {1}{3} N(\log_2 N) + O(N) $
comparators, which represents an asymptotic improvement
of $ \frac {1}{12} N(\log_2 N) $ comparators over the
best previous $N$-sorter. We indicate that special
constructions (not described in this paper) have been
found for [$ 2^r, 2^r$] $f$-networks, which lead to an
$N$-sorter network that requires only $ 0.25 N{(\log_2
N)}^2 - 0.372 N(\log_2 N) + O(N)$ comparators.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-71-237",
}
@TechReport{VanVoorhis:1971:LBS,
author = "David C. {Van Voorhis}",
title = "A lower bound for sorting networks that use the
divide-sort-merge strategy",
type = "Technical Report",
number = "STAN-CS-71-238 (CSL-TR-17, AD735901)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-238.html",
abstract = "Let $ M_g (g^{k + 1}) $ represent the minimum number
of comparators required by a network that merges g
sorted multisets containing $ g^k $ members each. In
this paper we prove that $ M_g (g^{k + 1}) \geq \ g
M_g(g^k) + g^{k - 1} \sum_{\ell = 2}^g \lfloor (\ell -
1)g / \ell \rfloor $. From this relation we are able to
show that an N-sorter network which uses the g-way
divide-sort-merge strategy must contain at least order
$ N{(log_2 N)}^2 $ comparators.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-71-238",
}
@TechReport{VanVoorhis:1971:LSN,
author = "David C. {Van Voorhis}",
title = "Large $ [g, d] $ sorting networks",
type = "Technical Report",
number = "STAN-CS-71-239 (CSL-TR-18, AD736610)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-239.html",
abstract = "With only a few exceptions the minimum-comparator
$N$-sorter networks employ the generalized
`divide-sort-merge' strategy. That is, the $N$ inputs
are divided among $ g \geq 2 $ smaller sorting networks
--- of size $ N_1, N_2, \ldots {}, N_g $, where $ N =
\sum_{k = 1}^g N_k $ --- that comprise the initial
portion of the $N$-sorter network. The remainder of the
$N$-sorter is a comparator network that merges the
outputs of the $ N_1 -, N_2 -, \ldots {}, $ and $
N_g$-sorter networks into a single sorted sequence. The
most economical merge networks yet designed, known as
the `$ [g, d]$' merge networks, consist of $d$ smaller
merge networks --- where $d$ is a common divisor of $
N_1, N_2, \ldots {}, N_g$ --- followed by a special
comparator network labeled a `$ [g, d]$ $f$-network.'
In this paper we describe special constructions for $
[2^r, 2^r]$ $f$-networks, $ r > 1$, which enable us to
reduce the number of comparators required by a large
$N$-sorter network from $ 0.25 N {(\log_2 N)}^2 - 0.25
N(\log_2 N) + O(N)$ to $ 0.25 N{(\log_2 N)}^2 - 0.37
N(\log_2 N) + O(N)$.",
acknowledgement = ack-nhfb,
pdfpages = "68",
xxnumber = "CS-TR-71-239",
}
@TechReport{London:1971:CTC,
author = "Ralph L. London",
title = "Correctness of two compilers for a {Lisp} subset",
type = "Technical Report",
number = "STAN-CS-71-240 (AIM-151, AD738568)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-240.html",
abstract = "Using mainly structural induction, proofs of
correctness of each of two running Lisp compilers for
the PDP-10 computer are given. Included are the
rationale for presenting these proofs, a discussion of
the proofs, and the changes needed to the second
compiler to complete its proof.",
acknowledgement = ack-nhfb,
pdfpages = "50",
xxnumber = "CS-TR-71-240",
}
@TechReport{Bierman:1971:ITM,
author = "Alan Bierman",
title = "On the Inference of {Turing} Machines from Sample
Computations",
type = "Technical Report",
number = "STAN-CS-71-241 (AIM-152, AD732642)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = oct,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "An algorithm is presented which, when given a complete
description of a set of Turing machine computations,
finds a Turing machine which is capable of doing those
computations. This algorithm can serve as the basis for
designing a trainable device which can be trained to
simulate any Turing machine by being led through a
series of sample computations done by that machine. A
number of examples illustrate the use of the techniques
and the possibility of its application to other types
of problems.",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Artificial Intelligence}, {\bf
3}, 181--198, 1972, doi:10.1016/0004-3702(72)90048-3",
}
@TechReport{Hayes:1971:FPR,
author = "Patrick J. Hayes",
title = "The frame problem and related problems in artificial
intelligence",
type = "Technical Report",
number = "STAN-CS-71-242 (AIM-153, AD738569)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-242.html",
abstract = "The frame problem arises in considering the logical
structure of a robot's beliefs. It has been known for
some years, but only recently has much progress been
made. The problem is described and discussed. Various
suggested methods for its solution are outlined, and
described in a uniform notation. Finally, brief
consideration is given to the problem of adjusting a
belief system in the face of evidence which contradicts
beliefs. It is shown that a variation on the situation
notation of (McCarthy and Hayes, 1969) permits an
elegant approach, and relates this problem to the frame
problem.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-71-242",
}
@TechReport{Manna:1971:IMP,
author = "Zohar Manna and S. Ness and J. Vuillemin",
title = "Inductive Methods for Proving Properties of Programs",
type = "Technical Report",
number = "STAN-CS-71-243 (AIM-154, AD738570)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = nov,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tarjan:1971:EPA,
author = "R. Tarjan",
title = "An Efficient Planarity Algorithm",
type = "Technical Report",
number = "STAN-CS-71-244 (AD738027)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "154",
month = nov,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ryder:1971:HAL,
author = "John Ryder",
title = "Heuristic Analysis of Large Trees as Generated in the
Game of {Go}",
type = "Technical Report",
number = "STAN-CS-71-245 (AIM-155)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "350",
month = nov,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Colby:1971:RTV,
author = "Kenneth Mark Colby and Franklin Dennis Hilf and Sylvia
Weber and Helena C. Kraemer",
title = "A resemblance test for the validation of a computer
simulation of paranoid processes",
type = "Technical Report",
number = "STAN-CS-71-246 (AIM-156, AD740141)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-246.html",
abstract = "A computer simulation of paranoid processes in the
form of a dialogue algorithm was subjected to a
validation study using an experimental resemblance test
in which judges rated degrees of paranoia present in
initial psychiatric interviews of both paranoid
patients and of versions of the paranoid model. The
statistical results indicate a satisfactory degree of
resemblance between the two groups of interviews. It is
concluded that the model provides a successful
simulation of naturally occurring paranoid processes.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-71-246",
}
@TechReport{Wilks:1971:OSH,
author = "Yorick A. Wilks",
title = "One small head --- some remarks on the use of 'model'
in linguistics",
type = "Technical Report",
number = "STAN-CS-71-247 (AIM-157)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-247.html",
abstract = "I argue that the present situation in formal
linguistics, where much new work is presented as being
a `model of the brain', or of `human language
behavior', is an undesirable one. My reason for this
judgement is not the conservative (Braithwaitian) one
that the entities in question are not really models but
theories. It is rather that they are called models
because they cannot be theories of the brain at the
present stage of brain research, and hence that the use
of `model' in this context is not so much aspirational
as resigned about our total ignorance of how the brain
stores and processes linguistic information. The reason
such explanatory entities cannot be theories is that
this ignorance precludes any `semantic ascent' up the
theory; i.e., interpreting the items of the theory in
terms of observables. And the brain items, whatever
they may be, are not, as Chomsky has sometimes claimed,
in the same position as the `occult entities' of
Physics like Gravitation; for the brain items are not
theoretically unreachable, merely unreached. I then
examine two possible alternate views of what linguistic
theories should be proffered as theories of: theories
of sets of sentences, and theories of a particular
class of algorithms. I argue for a form of the latter
view, and that its acceptance would also have the
effect of making Computational Linguistics a central
part of Linguistics, rather than the poor relation it
is now. I examine a distinction among `linguistic
models' proposed recently by Mey, who was also arguing
for the self-sufficiency of Computational Linguistics,
though as a `theory of performance'. I argue that his
distinction is a bad one, partly for the reasons
developed above and partly because he attempts to tie
it to Chomsky's inscrutable competence-performance
distinction. I conclude that the independence and
self-sufficiency of Computational Linguistics are
better supported by the arguments of this paper.",
acknowledgement = ack-nhfb,
pdfpages = "18",
xxnumber = "CS-TR-71-247",
}
@TechReport{Fredman:1971:RRB,
author = "Michael Fredman and Donald E. Knuth",
title = "Recurrence Relations Based on Minimization",
type = "Technical Report",
number = "STAN-CS-71-248 (AD739335)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = dec,
year = "1971",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Notices of the American
Mathematical Society}, {\bf 18}(6) 960, October 1971.",
}
@TechReport{Pollack:1971:ABC,
author = "Bary W. Pollack",
title = "An annotated bibliography on the construction of
compilers",
type = "Technical Report",
number = "STAN-CS-71-249",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-249.html",
abstract = "This bibliography is divided into 9 sections: 1.
General Information on Compiling Techniques 2. Syntax-
and Base-Directed Parsing 3. Parsing in General 4.
Resource Allocation 5. Errors - Detection and
Correction 6. Compiler Implementation in General 7.
Details of Compiler Construction 8. Additional Topics
9. Miscellaneous Related References Within each section
the entries are alphabetical by author. Keywords
describing the entry will be found for each entry set
off by pound signs (\#). Some amount of
cross-referencing has been done; e.g., entries which
fall into Section 3 as well as Section 7 will generally
be found in both sections. However, entries will be
found listed only under the principle or first author's
name. `Computing Reviews' citations are given following
the annotation when available.",
acknowledgement = ack-nhfb,
pdfpages = "172",
xxnumber = "CS-TR-71-249",
}
@TechReport{Chandra:1971:PSE,
author = "Ashok K. Chandra and Zohar Manna",
title = "Program schemas with equality",
type = "Technical Report",
number = "STAN-CS-71-250 (AIM-158, AD740127)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1971",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-250.html",
abstract = "We discuss the class of program schemas augmented with
equality tests, that is, tests of equality between
terms. In the first part of the paper we discuss and
illustrate the `power' of equality tests. It turns out
that the class of program schemas with equality is more
powerful than the `maximal' classes of schemas
suggested by other investigators. In the second part of
the paper we discuss the decision problems of program
schemas with equality. It is shown for example that
while the decision problems normally considered for
schemas (such as halting, divergence, equivalence,
isomorphism and freedom) are solvable for Ianov
schemas, they all become unsolvable if general equality
tests are added. We suggest, however, limited equality
tests which can be added to certain subclasses of
program schemas while preserving their solvable
properties.",
acknowledgement = ack-nhfb,
pdfpages = "14",
xxnumber = "CS-TR-71-250",
}
@TechReport{Malcolm:1972:PRP,
author = "Michael A. Malcolm",
title = "{PL360} (revised): a programming language for the {IBM
360}",
type = "Technical Report",
number = "STAN-CS-71-215 (AD727115)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 103",
month = may,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-215.html",
abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
description of PL360, a programming language designed
specifically for the IBM 360. PL360 has an appearance
similar to that of Algol, but it provides the
facilities of a symbolic machine language. Since 1968,
numerous extensions and modifications have been made to
the PL360 compiler which was originally designed and
implemented by N. Wirth and J. Wells. Interface and
input-output subroutines have been written which allow
the use of PL360 under OS, DOS, MTS and Orvyl. A formal
description of PL360 as it is presently implemented is
given. The description of the language is followed by
sections on the use of PL360 under various operating
systems, namely OS, DOS and MTS. Instructions on how to
use the PL360 compiler and PL360 programs in an
interactive mode under the Orvyl time-sharing monitor
are also included.",
acknowledgement = ack-nhfb,
pdfpages = "112",
xxnumber = "CS-TR-71-215",
}
@TechReport{Malcolm:1972:PRA,
author = "Michael A. Malcolm",
title = "{PL360} (Revised Again) A Programming Language for the
{IBM 360}",
type = "Technical Report",
number = "STAN-CS-71-215 (revised again)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 103",
month = may,
year = "1972",
bibdate = "Thu Jan 11 16:35:00 2024",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Original version May 1971.",
URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-215_PL360_Revised_A_Programming_Language_For_The_IBM_360_May71.pdf",
abstract = "In 1968, N. Wirth (Jan. JACM) published a formal
description of PL360, a programming language designed
specifically for the IBM 360. PL360 has an appearance
similar to that of Algol, but it provides the
facilities of a symbolic machine language. Since 1968,
numerous extensions and modifications have been made to
the PL360 compiler which was originally designed and
implemented by N. Wirth and J. Wells. Interface and
input--output subroutines have been written which allow
the use of PL360 under OS, DOS, MTS and Orvyl.\par
A formal description of PL360 as it is presently
implemented is given. The description of the language
is followed by sections on the use of PL360 under
various operating systems, namely OS, DOS and MTS.
Instructions on how to use the PL360 compiler and PL360
programs in an interactive mode under the Orvyl
time-sharing monitor are also included.",
acknowledgement = ack-nhfb,
pdfpages = "107",
xxnumber = "CS-TR-71-215 (revised again)",
}
@TechReport{Sites:1972:AWR,
author = "Richard L. Sites",
title = "{ALGOL W} reference manual",
type = "Technical Report",
number = "STAN-CS-71-230 (PB203601)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 141",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-71-230.html;
https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-71-230_Algol_W_Reference_Manual_Feb72.pdf",
abstract = "``A Contribution to the Development of ALGOL'' by
Niklaus Wirth and C. A. R. Hoare was the basis for a
compiler developed for the IBM 360 at stanford
University. This report is a description of the
implemented language, ALGOL W. Historical background
and the goals of the language may be found in the Wirth
and Hoare paper.\par
This document is a major revision of and supersedes CS
110. The revisions were made in order to document a
significantly improved version of the ALGOL W compiler.
This version was known as X ALGOL W during the spring
and summer of 1971. In addition to new debugging
facilities documented under Compiler Options, the new
version of the compiler has slightly more meaningful
error messages documented in the completely re-written
Error Messages section. Various minor corrections and
changes have been made throughout the book, and same
examples have been added. There is now an index, and a
complete list of all words the compiler treats in any
special way.",
abstract-2 = "'A Contribution to the Development of ALGOL' by
Niklaus Wirth and C. A. R. Hoare was the basis for a
compiler developed for the IBM 360 at Stanford
University. This report is a description of the
implemented language, ALGOL W. Historical background
and the goals of the language may be found in the Wirth
and Hoare paper. This manual refers to the version of
the Algol W compiler dated 16 January 1972.",
acknowledgement = ack-nhfb,
pdfpages = "160",
xxnumber = "CS-TR-71-230",
}
@TechReport{Stone:1972:EPA,
author = "Harold Stone",
title = "An Efficient Parallel Algorithm for the Solution of a
Tridiagonal Linear System of Equation",
type = "Technical Report",
number = "STAN-CS-72-251 (CSL-TR-19, AD736814)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = jan,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Saunders:1972:LSL,
author = "Michael A. Saunders",
title = "Large-scale linear programming using the {Cholesky}
factorization",
type = "Technical Report",
number = "STAN-CS-72-252 (SU326 P30-14)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "64",
month = jan,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-252.html",
abstract = "A variation of the revised simplex method is proposed
for solving the standard linear programming problem.
The method is derived from an algorithm recently
proposed by Gill and Murray, and is based upon the
orthogonal factorization $ B = L Q $ or, equivalently,
upon the Cholesky factorization $ B B^T = L L^T $ where
$B$ is the usual square basis, $L$ is lower triangular
and $Q$ is orthogonal. We wish to retain the favorable
numerical properties of the orthogonal factorization,
while extending the work of Gill and Murray to the case
of linear programs which are both large and sparse. The
principal property exploited is that the Cholesky
factor $L$ depends only on $ \underline {\rm which} $
variables are in the basis, and not upon the $
\underline {\rm order} $ in which they happen to enter.
A preliminary ordering of the rows of the full data
matrix therefore promises to ensure that $L$ will
remain sparse throughout the iterations of the simplex
method. An initial (in-core) version of the algorithm
has been implemented in Algol W on the IBM 360/91 and
tested on several medium-scale problems from industry
(up to 930 constraints). While performance has not been
especially good on problems of high density, the method
does appear to be efficient on problems which are very
sparse, and on structured problems which have either
generalized upper bounding, block-angular, or staircase
form.",
acknowledgement = ack-nhfb,
pdfpages = "64",
xxnumber = "CS-TR-72-252",
}
@TechReport{Feldman:1972:TCI,
author = "Jerome A. Feldman and Paul C. Shields",
title = "Total complexity and the inference of best programs",
type = "Technical Report",
number = "STAN-CS-72-253 (AIM-159)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-253.html",
abstract = "Axioms for a total complexity measure for abstract
programs are presented. Essentially, they require that
total complexity be an unbounded increasing function of
the Blum time and size measures. Algorithms for finding
the best program on a finite domain are presented, and
their limiting behaviour for infinite domains
described. For total complexity, there are important
senses in which a machine $ \underline {\rm can} $ find
the best program for a large class of functions.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-72-253",
}
@TechReport{Forsythe:1972:NCMa,
author = "George E. Forsythe",
title = "{Von Neumann}'s comparison method for random sampling
from the normal and other distributions",
type = "Technical Report",
number = "STAN-CS-72-254 (AD740330)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = jan,
year = "1972",
bibdate = "Mon Jun 06 19:17:03 2005",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/f/forsythe-george-elmer.bib;
https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/NCSTRL/STAN.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/STAN.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Techreports/Stanford.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-254.html",
abstract = "The author presents a generalization he worked out in
1950 of von Neumann's method of generating random
samples from the exponential distribution by
comparisons of uniform random numbers on (0,1). It is
shown how to generate samples from any distribution
whose probability density function is piecewise both
absolutely continuous and monotonic on $ ( - \infty,
\infty) $. A special case delivers normal deviates at
an average cost of only 4.036 uniform deviates each.
This seems more efficient than the Center--Tail method
of Dieter and Ahrens, which uses a related, but
different, method of generalizing the von Neumann idea
to the normal distribution.",
acknowledgement = ack-nhfb,
author-dates = "George Elmer Forsythe (8 January 1917--9 April 1972)",
notes = "[Adminitrivia V1/Prg/19951016]",
pdfpages = "21",
subject-dates = "John von Neumann (28 December 1903--8 February
1957)",
xxnumber = "CS-TR-72-254",
}
@TechReport{Feldman:1972:AP,
author = "Jerome A. Feldman",
title = "Automatic programming",
type = "Technical Report",
number = "STAN-CS-72-255 (AIM-160, AD740140)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-255.html",
abstract = "The revival of interest in Automatic Programming is
considered. The research is divided into direct efforts
and theoretical developments and the successes and
prospects of each are described.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-72-255",
}
@TechReport{Chvatal:1972:EPW,
author = "Vaclav Chv{\'a}tal",
title = "{Edmonds} polyhedra and weakly {Hamiltonian} graphs",
type = "Technical Report",
number = "STAN-CS-72-256 (AD740331)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-256.html",
abstract = "Jack Edmonds developed a new way of looking at
extremal combinatorial problems and applied his
technique with a great success to the problems of the
maximal-weight degree-constrained subgraphs. Professor
C. St. J. A. Nash-Williams suggested to use Edmonds'
approach in the context of Hamiltonian graphs. In the
present paper, we determine a new set of inequalities
(the `comb inequalities') which are satisfied by the
characteristic functions of Hamiltonian circuits but
are not explicit in the straightforward integer
programming formulation. A direct application of the
linear programming duality theorem then leads to a new
necessary condition for the existence of Hamiltonian
circuits; this condition appears to be stronger than
the previously known ones. Relating linear programming
to Hamiltonian circuits, the present paper can also be
seen as a continuation of the work of Dantzig,
Fulkerson and Johnson on the travelling salesman
problem.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-72-256",
}
@TechReport{Wirth:1972:PCG,
author = "Niklaus Wirth",
title = "On `{PASCAL},' code generation, and the {CDC 6000}
computer",
type = "Technical Report",
number = "STAN-CS-72-257 (PB208519)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-257.html;
https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-72-257_6600_PASCAL_Feb72.pdf",
abstract = "'PASCAL' is a general purpose programming language
with characteristics similar to ALGOL 60, but with an
enriched set of program- and data structuring
facilities. It has been implemented on the CDC 6000
computer. This paper discusses selected topics of code
generation, in particular the selection of instruction
sequences to represent simple operations on arithmetic,
Boolean, and powerset operands. Methods to implement
recursive procedures are briefly described, and it is
hinted that the more sophisticated solutions are not
necessarily also the best. The CDC 6000 architecture
appears as a frequent source of pitfalls and nuisances,
and its main trouble spots are scrutinized and
discussed.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-72-257",
}
@TechReport{Brown:1972:SBM,
author = "Harold Brown",
title = "Some basic machine algorithms for integral order
computations",
type = "Technical Report",
number = "STAN-CS-72-258 (AD740332)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-258.html",
abstract = "Three machine implemented algorithms for computing
with integral orders are described. The algorithms are:
1. For an integral order R given in terms of its left
regular representation relative to any basis, compute
the nil radical J(R) and a left regular representation
of R/J(R). 2. For a semisimple order R given in terms
of its left regular representation relative to any
basis, compute a new basis for R and the associated
left regular representation of R such that the first
basis element of the transformed basis is an integral
multiple of the identity element in Q $ \bigotimes $ R.
3. Relative to any fixed Z -basis for R, compute a
unique canonical form for any given finitely generated
Z -submodule of Q $ \bigotimes $ R described in terms
of that basis.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-72-258",
}
@TechReport{Crane:1972:LLP,
author = "Clark A. Crane",
title = "Linear Lists and Priority Queues as Balanced Binary
Trees",
type = "Technical Report",
number = "STAN-CS-72-259 (PB208595)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = feb,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pratt:1972:SSN,
author = "Vaughan R. Pratt",
title = "Shellsort and Sorting Networks",
type = "Technical Report",
number = "STAN-CS-72-260 (AD740110)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = feb,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Golub:1972:DPN,
author = "Gene H. Golub and Victor Pereyra",
title = "The differentiation of pseudoinverses and nonlinear
least squares problems whose variables separate",
type = "Technical Report",
number = "STAN-CS-72-261 (SU326 P30 15)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-261.html",
abstract = "For given data $ (t_i, y_i), i = 1, \ldots, m $, we
consider the least squares fit of nonlinear models of
the form\par
$ F(\underset \tilde a, \underset \tilde \alpha; t) =
\sum_{j = 1}^n g_j (\underset \tilde a) \varphi_j
(\underset \tilde \alpha; t), \underset \tilde a \in
R^s, \underset \tilde \alpha \in R^k $.\par
For this purpose we study the minimization of the
nonlinear functional\par
$ r(\underset \tilde a, \underset \tilde \alpha) =
\sum_{i = 1}^m {(y_i - F(\underset \tilde a, \underset
\tilde \alpha, t_i))}^2 $.\par
It is shown that by defining the matrix $ \{ \Phi
(\underset \tilde \alpha) \}_{i, j} = \varphi_j
(\underset \tilde \alpha; t_i) $, and the modified
functional $ r_2 (\underset \tilde \alpha) = \|
\underset \tilde y - \Phi (\underset \tilde \alpha)
\Phi^+(\underset \tilde \alpha) \underset \tilde y
\|_2^2 $, it is possible to optimize first with respect
to the parameters $ \underset \tilde \alpha $, and then
to obtain, a posteriori, the optimal parameters $
\overset^\to {\underset \tilde a} $. The matrix $
\Phi^+(\underset \tilde \alpha) $ is the Moore--Penrose
generalized inverse of $ \Phi (\underset \tilde \alpha)
$, and we develop formulas for its Frechet derivative
under the hypothesis that $ \Phi (\underset \tilde \to
\alpha) $ is of constant (though not necessarily full)
rank. From these formulas we readily obtain the
derivatives of the orthogonal projectors associated
with $ \Phi (\underset \tilde \alpha) $, and also that
of the functional $ r_2 (\underset \tilde \alpha) $.
Detailed algorithms are presented which make extensive
use of well-known reliable linear least squares
techniques, and numerical results and comparisons are
given. These results are generalizations of those of H.
D. Scolnik [1971].",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "52",
xxnumber = "CS-TR-72-261",
}
@TechReport{Staff:1972:B,
author = "{Staff}",
title = "Bibliography",
type = "Technical Report",
number = "STAN-CS-72-262 (PB209357)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = feb,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Klarner:1972:PIU,
author = "David A. Klarner and Ronald L. Rivest",
title = "A procedure for improving the upper bound for the
number of $n$-ominoes",
type = "Technical Report",
number = "STAN-CS-72-263 (AD741189)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-263.html",
abstract = "An $n$-omino is a plane figure composed of n unit
squares joined together along their edges. Every
$n$-omino is generated by joining the edge of a unit
square to the edge of a unit square in some $ (n -
1)$-omino so that the new square does not overlap any
squares. Let $ t(n)$ denote the number of $n$-ominoes,
then it is known that the sequence $ \{ ((t(n)) \}^{1 /
n} : n = 1, 2, \ldots)$ increases to a limit $ \Theta
$, and $ 3.72 < \Theta < 6.75$. A procedure exists for
computing an increasing sequence of numbers bounded
above by $ \Theta $. (Chandra recently showed that the
limit of this sequence is $ \Theta $.) In the present
work we give a procedure for computing a sequence of
numbers bounded below by $ \Theta $. Whether or not the
limit of this sequence is $ \Theta $ remains an open
question. By computing the first ten terms of our
sequence, we have shown that $ \Theta $ < 4.65.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-72-263",
}
@TechReport{Wilks:1972:AIA,
author = "Yorick A. Wilks",
title = "An artificial intelligence approach to machine
translation",
type = "Technical Report",
number = "STAN-CS-72-264 (AIM-161, AD741189)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-264.html",
abstract = "The paper describes a system of semantic analysis and
generation, programmed in LISP 1.5 and designed to pass
from paragraph length input in English to French via an
interlingual representation. A wide class of English
input forms will be covered, but the vocabulary will
initially be restricted to one of a few hundred words.
With this subset working, and during the current year
(71-72), it is also hoped to map the interlingual
representation onto some predicate calculus notation so
as to make possible the answering of very simple
questions about the translated matter. The
specification of the translation system itself is
complete, and its main points of interest that
distinguish it from other systems are: (i) It
translated phrase by phrase --- with facilities for
reordering phrases and establishing essential semantic
connectivities between them --- by mapping complex
semantic structures of `message' onto each phrase.
These constitute the interlingual representation to be
translated. This matching is done without the explicit
use of a conventional syntax analysis, by taking as the
appropriate matched structure the `most dense' of the
alternative structures derived. This method has been
found highly successful in earlier versions of this
analysis system. (ii) The French output strings are
generated without the explicit use of a generative
grammar. That is done by means of STEREOTYPES: strings
of French words, and functions evaluating to French
words, which are attached to English word senses in the
dictionary and built into the interlingual
representation by the analysis routines. The generation
program thus receives an interlingual representation
that already contains both French output and implicit
procedures for assembling the output, since the
stereotypes are in effect recursive procedures
specifying the content and production of the output
word strings. Thus the generation program at no time
consults a word dictionary or inventory of grammar
rules. It is claimed that the system of notation and
translation described is a convenient one for
expressing and handling the items of semantic
information that are ESSENTIAL to any effective MT
system, I discuss in some detail the semantic
information needed to ensure the correct choice of
output prepositions in French, a vital matter
inadequately treated by virtually all previous
formalisms and projects.",
acknowledgement = ack-nhfb,
pdfpages = "50",
xxnumber = "CS-TR-72-264",
}
@TechReport{Schank:1972:PCU,
author = "Roger C. Schank and Neil M. Goldman and Charles J.
Rieger and Christopher K. Riesbeck",
title = "Primitive concepts underlying verbs of thought",
type = "Technical Report",
number = "STAN-CS-72-265 (AIM-162, AD744634)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-265.html",
abstract = "In order to create conceptual structures that will
uniquely and unambiguously represent the meaning of an
utterance, it is necessary to establish 'primitive'
underlying actions and states into which verbs can be
mapped. This paper presents analyses of the most common
mental verbs in terms of such primitive actions and
states. In order to represent the way people speak
about their mental processes, it was necessary to add
to the usual ideas of memory structure the notion of
Immediate Memory. It is then argued that there are only
three primitive mental ACTs.",
acknowledgement = ack-nhfb,
pdfpages = "110",
xxnumber = "CS-TR-72-265",
}
@TechReport{Cadiou:1972:RDP,
author = "Jean Cadiou",
title = "Recursive Definitions of Partial and Functions and
Their Computation",
type = "Technical Report",
number = "STAN-CS-72-266 (AIM-163)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "160",
month = mar,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bonzon:1972:MPL,
author = "Pierre E. Bonzon",
title = "Mathematical Programming Language: an appraisal based
on practical experiments",
type = "Technical Report",
number = "STAN-CS-72-267 (PB209629)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-267.html",
abstract = "The newly proposed Mathematical Programming Language
is approached from the user's point of view. To
demonstrate its facility of use, three programs are
presented which solve large scale linear programming
problems with the generalized upper-bounding
structure.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-72-267",
}
@TechReport{Chvatal:1972:DM,
author = "Vaclav Chv{\'a}tal",
title = "Degrees and matchings",
type = "Technical Report",
number = "STAN-CS-72-268 (AD742348)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-268.html",
abstract = "Let $n$, $b$, $d$ be positive integers. D. Hanson
proposed to evaluate $ f(n, b, d)$, the largest
possible number of edges in a graph with $n$ vertices
having no vertex of degree greater than $d$ and no set
of more than $b$ independent edges. Using the
alternating path method, he found partial results in
this direction. We complete Hanson's work; our proof
technique has a linear programming flavor and uses
Berge's matching formula.",
acknowledgement = ack-nhfb,
pdfpages = "17",
xxnumber = "CS-TR-72-268",
}
@TechReport{Klarner:1972:APC,
author = "David A. Klarner and Richard Rado",
title = "Arithmetic properties of certain recursively defined
sets",
type = "Technical Report",
number = "STAN-CS-72-269 (AD742747)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-269.html",
abstract = "Let $R$ denote a set of linear operations defined on
the set $P$ of positive integers; for example, a
typical element of R has the form $ \rho (x_1, \ldots,
x_r) = m_0 + m_1 x_1 + \ldots + m_r x_r$ where $ m_0,
\ldots, m_r $ denote certain integers. Given a set $A$
of positive integers, there is a smallest set of
positive integers denoted",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-72-269",
}
@TechReport{Golub:1972:LAS,
author = "Gene H. Golub and Richard R. Underwood and James H.
Wilkinson",
title = "The {Lanczos} Algorithm for the Symmetric {$ A x =
\lambda B x $} Problem",
type = "Technical Report",
number = "STAN-CS-72-270 (PB209616 SU326P30-16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 24",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/gvl.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-270.html",
abstract = "The problem of computing the eigensystem of $ A x =
\lambda B x $ when $A$ and $B$ are symmetric and $B$ is
positive definite is considered. A generalization of
the Lanczos algorithm for reducing the problem to a
symmetric tridiagonal eigenproblem is given. A
numerically stable variant of the algorithm is
described. The new algorithm depends heavily upon the
computation of elementary Hermitian matrices. An ALGOL
W procedure and a numerical example are also given.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); James H. Wilkinson (27 September 1919--5 October
1986)",
keywords = "band; Cholesky; eigenvalue; eigenvector; elementary
Hermitian matrix; error analysis; geig; generalized;
Householder; Lanczos; Lanczos algorithm; matrix; nla;
orthogonalization; positive definite; symmetric;
tridiagonal",
pdfpages = "27",
subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
xxnumber = "CS-TR-72-270",
}
@TechReport{Riddle:1972:MAS,
author = "William E. Riddle",
title = "The Modeling and Analysis of Supervisory Systems",
type = "Technical Report",
number = "STAN-CS-72-271",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "174",
month = mar,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Manna:1972:FAT,
author = "Zohar Manna and Jean Vuillemin",
title = "Fixpoint approach to the theory of computation",
type = "Technical Report",
number = "STAN-CS-72-272 (A7IM-164, AD742748)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-272.html",
abstract = "Following the fixpoint theory of Scott, we propose to
define the semantics of computer programs in terms of
the least fixpoints of recursive programs. This allows
one not only to justify all existing verification
techniques, but also to extend them to handle various
properties of computer programs, including correctness,
termination and equivalence, in a uniform manner.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-72-272",
}
@TechReport{Chvatal:1972:CAG,
author = "Vaclav Chv{\'a}tal and Jiri Sichler",
title = "Chromatic automorphisms of graphs",
type = "Technical Report",
number = "STAN-CS-72-273 (PB209806)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-273.html",
abstract = "The coloring group and the full automorphism group of
an n-chromatic graph are independent if and only if n
is an integer $ \geq $ 3.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-72-273",
}
@TechReport{Klarner:1972:LCS,
author = "D. Klarner and Richard Rado",
title = "Linear Combinations of Sets of Consecutive Integers",
type = "Technical Report",
number = "STAN-CS-72-274 (AD742749)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = mar,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
pdfpages = "11",
}
@TechReport{Klarner:1972:SGI,
author = "David A. Klarner",
title = "Sets generated by iteration of a linear operation",
type = "Technical Report",
number = "STAN-CS-72-275 (AD742750)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = mar,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-275.html",
abstract = "This note is a continuation of the paper
`\booktitle{Arithmetic properties of certain
recursively defined sets}', written in collaboration
with Richard Rado. Here the sets under consideration
are those having the form $ = \langle m_1 x_1 + \ldots
\ + m_r x_r : 1 \rangle $ where $ m_1, \ldots, m_r $
are given natural numbers with greatest common divisor
1. The set $S$ is the smallest set of natural numbers
which contains 1 and is closed under the operation $
m_1 x_1 + \ldots \ + m_r x_r$. Also, $S$ can be
constructed by iterating the operation $ m_1 x_1 +
\ldots \ + m_r X_r$ over the set $ \{ 1 \} $. For
example, $ \langle 2 x + 3 y : 1 \rangle = \{ 1, 5, 13,
17, 25, \ldots \} = (1 + 12 N) \cup (5 + 12 N)$ where $
N = \{ 0, 1, 2, \ldots \} $. It is shown in this note
that $S$ contains an infinite arithmetic progression
for all natural numbers $ r - 1, m_1, \ldots, m_r$.
Furthermore, if $ (m_1, \ldots, m_r) = (m_1 \ldots m_r,
m_1 + \ldots \ + m_r) = 1$, then $S$ is a per-set; that
is, $S$ is a finite union of infinite arithmetic
progressions. In particular, this implies $ (m x + n y
: 1)$ is a per-set for all pairs $ \{ m, n \} $ of
relatively prime natural numbers. It is an open
question whether $S$ is a per-set when $ (m_1, \ldots,
m_r) = 1$, but $ (m_1 \ldots m_r, m_1 + \ldots \ + m_r)
> 1$.",
acknowledgement = ack-nhfb,
pdfpages = "11",
xxnumber = "CS-TR-72-275",
}
@TechReport{Kaufman:1972:GMS,
author = "Linda Kaufman",
title = "A Generalized {$ L R $} Method to Solve {$ A x =
\lambda B x $}",
type = "Technical Report",
number = "STAN-CS-72-276 (AD745022)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = apr,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Zahn:1972:RBT,
author = "C. T. Zahn",
title = "Region Boundaries on a Triangular Grid",
type = "Technical Report",
number = "STAN-CS-72-277 (SLAC-149)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = apr,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Concus:1972:UFD,
author = "Paul Concus and Gene H. Golub",
title = "Use of fast direct methods for the efficient numerical
solution of nonseparable elliptic equations",
type = "Technical Report",
number = "STAN-CS-72-278 (SU326 P30-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 39",
month = apr,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-278.html",
abstract = "We study an iterative technique for the numerical
solution of strongly elliptic equations of divergence
form in two dimensions with Dirichlet boundary
conditions on a rectangle. The technique is based on
the repeated solution by a fast direct method of a
discrete Helmholtz equation on a uniform rectangular
mesh. The problem is suitably scaled before iteration,
and Chebyshev acceleration is applied to improve
convergence. We show that convergence can be
exceedingly rapid and independent of mesh size for
smooth coefficients. Extensions to other boundary
conditions, other equations, and irregular mesh
spacings are discussed, and the performance of the
technique is illustrated with numerical examples.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "41",
xxnumber = "CS-TR-72-278",
}
@TechReport{Osborne:1972:TO,
author = "Michael R. Osborne",
title = "Topics in optimization",
type = "Technical Report",
number = "STAN-CS-72-279 (AD744313)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-279.html",
abstract = "These notes are based on a course of lectures given at
Stanford, and cover three major topics relevant to
optimization theory. First an introduction is given to
those results in mathematical programming which appear
to be most important for the development and analysis
of practical algorithms. Next unconstrained
optimization problems are considered. The main emphasis
is on that subclass of descent methods which (a)
requires the evaluation of first derivatives of the
objective function, and (b) has a family connection
with the conjugate direction methods. Numerical results
obtained using a program based on this material are
discussed in an Appendix. In the third section, penalty
and barrier function methods for mathematical
programming problems are studied in some detail, and
possible methods for accelerating their convergence
indicated.",
acknowledgement = ack-nhfb,
pdfpages = "154",
xxnumber = "CS-TR-72-279",
}
@TechReport{Bochvar:1972:TPP,
author = "D. A. Bochvar",
title = "Two Papers on Partial Predicate Calculus",
type = "Technical Report",
number = "STAN-CS-72-280 (AIM-165, AD742751)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "99",
month = apr,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Quam:1972:CIP,
author = "Lynn H. Quam and Sidney {Liebes, Jr.} and Robert B.
Tucker and Marsha Jo Hannah and Botond G. Eross",
title = "Computer interactive picture processing",
type = "Technical Report",
number = "STAN-CS-72-281 (AIM-166, AD743598)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-281.html",
abstract = "This report describes work done in image processing
using an interactive computer system. Techniques for
image differencing are described and examples using
images returned from Mars by the Mariner Nine
spacecraft are shown. Also described are techniques for
stereo image processing. Stereo processing for both
conventional camera systems and the Viking 1975 Lander
camera system is reviewed.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-72-281",
}
@TechReport{Chandra:1972:ECL,
author = "Ashok K. Chandra",
title = "Efficient compilation of linear recursive programs",
type = "Technical Report",
number = "STAN-CS-72-282 (AIM-167, AD747254)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-282.html",
abstract = "We consider the class of linear recursive programs. A
linear recursive program is a set of procedures where
each procedure can make at most one recursive call. The
conventional stack implementation of recursion requires
time and space both proportional to n, the depth of
recursion. It is shown that in order to implement
linear recursion so as to execute in time n one doesn't
need space proportional to n: $ n^\epsilon $ for
arbitrarily small $ \epsilon $ will do. It is also
known that with constant space one can implement linear
recursion in time $ n^2 $. We show that one can do much
better: $ n^{1 + \epsilon } $ for arbitrarily small $
\epsilon $. We also describe an algorithm that lies
between these two: it takes time n.log(n) and space
log(n). It is shown that several problems are closely
related to the linear recursion problem, for example,
the problem of reversing an input tape given a finite
automaton with several one-way heads. By casting all
these problems into a canonical form, efficient
solutions are obtained simultaneously for all.",
acknowledgement = ack-nhfb,
pdfpages = "56",
xxnumber = "CS-TR-72-282",
}
@TechReport{Stoutemyer:1972:NIS,
author = "David R. Stoutemyer",
title = "Numerical Implementation of the {Schwarz} Alternating
Procedure for Elliptic Partial Differential Equations",
type = "Technical Report",
number = "STAN-CS-72-283",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = may,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chvatal:1972:EPH,
author = "Vaclav Chv{\'a}tal",
title = "{Edmonds} polyhedra and a hierarchy of combinatorial
problems",
type = "Technical Report",
number = "STAN-CS-72-284 (O.R. 72-6, AD745778)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-284.html",
abstract = "Let S be a set of linear inequalities that determine a
bounded polyhedron P. The closure of S is the smallest
set of inequalities that contains S and is closed under
two operations: (i) taking linear combinations of
inequalities, (ii) replacing an inequality $ \sum \ a_j
x_j \leq \ a_0 $, where $ a_1, a_2, \ldots {}, a_n $
are integers, by the inequality $ \sum \ a_j x_j \leq \
a $ with $ a \geq \ [a_0] $. Obviously, if integers $
x_1, x_2, \ldots {}, x_n $ satisfy all the inequalities
in S then they satisfy also all the inequalities in the
closure of S. Conversely, let $ \sum \ c_j x_j \leq \
c_0 $ hold for all choices of integers $ x_1, x_2,
\ldots {}, x_n $, that satisfy all the inequalities in
S. Then we prove that $ \sum \ c_j x_j \leq \ c_0 $
belongs to the closure of S. To each integer linear
programming problem, we assign a nonnegative integer,
called its rank. (The rank is the minimum number of
iterations of the operation (ii) that are required in
order to eliminate the integrality constraint.) We
prove that there is no upper bound on the rank of
problems arising from the search for largest
independent sets in graphs.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-72-284",
}
@TechReport{Floyd:1972:LTT,
author = "Robert W. Floyd and Alan J. Smith",
title = "A Linear Time Two Tape Merge",
type = "Technical Report",
number = "STAN-CS-72-285 (PB210910)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = may,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Chandra:1972:SMP,
author = "Ashok K. Chandra",
title = "On the solution of {Moser}'s problem in four
dimensions, and related issues. {A} collection of two
papers: On the solution of {Moser}'s problem in four
dimensions and Independent permutations as related to a
problem of {Moser} and a theorem of {Polya}",
type = "Technical Report",
number = "STAN-CS-72-286 (PB211036)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-286.html",
abstract = "The problem of finding the largest set of nodes in a
d-cube of side 3 such that no three nodes are collinear
was proposed by Moser. Small values of d (viz., $ d
\leq \ 3$) resulted in elegant symmetric solutions. It
is shown that this does not remain the case in 4
dimensions where at most 43 nodes can be chosen, and
these must not include the center node.",
acknowledgement = ack-nhfb,
pdfpages = "35",
xxnumber = "CS-TR-72-286",
}
@TechReport{Igarashi:1972:AFP,
author = "Shigaru Igarashi",
title = "Admissibility of Fixed-Point Induction in First-Order
Logic of Typed Theories",
type = "Technical Report",
number = "STAN-CS-72-287 (AIM-168, AD746146)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = may,
year = "1972",
DOI = "https://doi.org/10.1007/3-540-06720-5_22",
bibdate = "Thu Nov 27 18:06:23 2025",
URL = "https://dl.acm.org/doi/10.5555/646795.759643",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Proceedings of the
International Symposium on Theoretical Programming},
Pages 344--383, 07 August 1972.",
}
@TechReport{Milner:1972:LCF,
author = "Robin Milner",
title = "Logic for Computable Functions: description of a
machine implementation",
type = "Technical Report",
number = "STAN-CS-72-288 (AIM-169)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-288.html",
abstract = "This paper is primarily a user's manual for LCF, a
proof-checking program for a logic of computable
functions proposed by Dana Scott in 1969 but
unpublished by him. We use the name LCF also for the
logic itself, which is presented at the start of the
paper. The proof-checking program is designed to allow
the user interactively to generate formal proofs about
computable functions and functionals over a variety of
domains, including those of interest to the computer
scientist - for example, integers, lists and computer
programs and their semantics. The user's task is
alleviated by two features: a subgoaling facility and a
powerful simplification mechanism. Applications include
proofs of program correctness and in particular of
compiler correctness; these applications are not
discussed herein, but are illustrated in the papers
referenced in this introduction.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-72-288",
}
@TechReport{Wilks:1972:LLN,
author = "Yorick A. Wilks",
title = "{Lakoff} on linguistics and natural logic",
type = "Technical Report",
number = "STAN-CS-72-289 (AIM-170, AD748607)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-289.html",
abstract = "The paper examines and criticises Lakoff's notions of
a natural logic and of a generative semantics described
in terms of logic. I argue that the relationship of
these notions to logic as normally understood is
unclear, but I suggest, in the course of the paper, a
number of possible interpretations of his thesis of
generative semantics. I argue further that on these
interpretations the thesis (of Generative Semantics) is
false, unless it be taken as a mere notational variant
of Chomskyan theory. I argue, too, that Lakoff's work
may provide a service in that it constitutes a {\em
reductio ad absurdum\/} of the derivational paradigm of
modern linguistics; and shows, inadvertently, that only
a system with the ability to reconsider its own
inferences can do the job that Lakoff sets up for
linguistic enquiry --- that is to say, only an
`artificial intelligence' system.",
acknowledgement = ack-nhfb,
pdfpages = "21",
xxnumber = "CS-TR-72-289",
}
@TechReport{Schank:1972:AB,
author = "Roger C. Schank",
title = "Adverbs and belief",
type = "Technical Report",
number = "STAN-CS-72-290 (AIM-171, AD746147)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-290.html",
abstract = "The treatment of a certain class of adverbs in
conceptual representation is given. Certain adverbs are
shown to be representative of complex belief
structures. These adverbs serve as pointers that
explain where the sentence that they modify belongs in
a belief structure.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-72-290",
}
@TechReport{Knuth:1972:SCL,
author = "Donald E. Knuth",
title = "Some combinatorial lemmas",
type = "Technical Report",
number = "STAN-CS-72-291 (AD746189)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-291.html;
http://www-db.stanford.edu/TR/CS-TR-72-291.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-72-291",
abstract = "This report consists of several short papers which are
completely independent of each other: 1. ``Wheels
Within Wheels.'' Every finite strongly connected
digraph is either a single point or a set of $n$
smaller strongly connected digraphs joined by an
oriented cycle of length $n$. This result is proved in
somewhat stronger form, and two applications are given.
2. ``An Experiment in Optimal Sorting.'' An
unsuccessful attempt, to sort 13 or 14 elements in less
comparisons than the Ford--Johnson algorithm, is
described. (Coauthor: E. B. Kaehler.) 3. ``Permutations
With Nonnegative Partial Sums.'' A sequence of $s$
positive and $t$ negative real numbers, whose sum is
zero, can be arranged in at least $ (s + t - 1)!$ and
at most $ (s + t)! / (\max (s, t) + 1) < 2 (s + t -
1)!$ ways such that the partial sums $ x_1 + \cdots {}
+ x_j$ are nonnegative for $ 1 \leq j \leq s + t$.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-72-291",
pdfpages = "22",
xxnumber = "CS-TR-72-291",
}
@TechReport{Chvatal:1972:SCR,
author = "Vaclav Chv{\'a}tal and David A. Klarner and Donald E.
Knuth",
title = "Selected combinatorial research problems",
type = "Technical Report",
number = "STAN-CS-72-292 (AD746150)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-292.html;
http://www-db.stanford.edu/TR/CS-TR-72-292.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-72-292",
abstract = "Thirty-seven research problems are described, covering
a wide range of combinatorial topics. Unlike Hilbert's
problems, most of these are not especially famous and
they might be ``do-able'' in the next few years.
(Problems 1--16 were contributed by Klarner, 17--26 by
Chv{\'a}tal, 27--37 by Knuth). All cash awards are
Chv{\'a}tal's responsibility.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-72-292",
pdfpages = "31",
xxnumber = "CS-TR-72-292",
}
@TechReport{Lukes:1972:CSP,
author = "J. A. Lukes",
title = "Combinatorial Solutions to Partitioning Problems",
type = "Technical Report",
number = "STAN-CS-72-293 (CSL-TN-32, PB212234)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = jun,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Saal:1972:MIC,
author = "Harry J. Saal and Leonard J. Shustek",
title = "Microprogrammed Implementation of Computer Measurement
Techniques",
type = "Technical Report",
number = "STAN-CS-72-294 (SLACP-1072)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jun,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Paige:1972:BMS,
author = "C. C. Paige",
title = "Bidiagonalization of Matrices and Solution of Linear
Equations",
type = "Technical Report",
number = "STAN-CS-72-295 (PB212130)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jun,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Fredman:1972:GPC,
author = "Michael L. Fredman",
title = "Growth Properties of a Class of Recursively Defined
Functions",
type = "Technical Report",
number = "STAN-CS-72-296 (AD748606)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "84",
month = jun,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Paige:1972:EAM,
author = "C. C. Paige",
title = "An Error Analysis of a Method for Solving Matrix
Equations",
type = "Technical Report",
number = "STAN-CS-72-297 (PB212300)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = jun,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kogge:1972:PAEa,
author = "P. M. Kogge and H. S. Stone",
title = "A Parallel Algorithm for the Efficient Solution of a
General Class of Recurrence Equations",
type = "Technical Report",
number = "STAN-CS-72-298 (CSL-TR-25)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = jul,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Russell:1972:SCN,
author = "Sylvia Weber Russell",
title = "semantic categories of nominals for conceptual
dependency analysis of natural language",
type = "Technical Report",
number = "STAN-CS-72-299 (AIM-172, AD752801)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-299.html",
abstract = "A system for the semantic categorization of conceptual
objects (nominals) is provided. The system is intended
to aid computer understanding of natural language.
Specific implementations for `noun-pairs' and
prepositional phrases are offered.",
acknowledgement = ack-nhfb,
pdfpages = "74",
xxnumber = "CS-TR-72-299",
}
@TechReport{Kaufman:1972:CCF,
author = "Marc T. Kaufman",
title = "Counterexample to a conjecture of {Fujii}, {Kasami}
and {Ninomiya}",
type = "Technical Report",
number = "STAN-CS-72-300 (CSL-TN-17, AD749848)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-300.html",
abstract = "In a recent paper [1], Fujii, Kasami and Ninomiya
presented a procedure for the optimal scheduling of a
system of unit length tasks represented as a directed
acyclic graph on two identical processors. The authors
conjecture that the algorithm can be extended to the
case where more than two processors are employed. This
note presents a counterexample to that conjecture. [1]
Fujii, M., T. Kasami and K. Ninomiya, `Optimal
Sequencing of Two Equivalent Processors, SIAM J. Appl.
Math., Vol. 17, No.4, July 1969, pp. 784-789.",
acknowledgement = ack-nhfb,
pdfpages = "4",
xxnumber = "CS-TR-72-300",
}
@TechReport{Saunders:1972:PFC,
author = "Michael A. Saunders",
title = "Product form of the {Cholesky} factorization for
large-scale linear programming",
type = "Technical Report",
number = "STAN-CS-72-301 (SU326 P30-21)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-301.html",
abstract = "A variation of Gill and Murray's version of the
revised simplex algorithm is proposed, using the
Cholesky factorization $ {BB}^T = {LDL}^T $ where B is
the usual basis, D is diagonal and L is unit lower
triangular. It is shown that during change of basis L
may be updated in product form. As with standard
methods using the product form of inverse, this allows
use of sequential storage devices for accumulating
updates to L. In addition the favorable numerical
properties of Gill and Murray's algorithm are retained.
Cloase attention is given to efficient out-of-core
implementation. In the case of large-scale
block-angular problems, the updates to L will remain
very sparse for all iterations.",
acknowledgement = ack-nhfb,
pdfpages = "41",
xxnumber = "CS-TR-72-301",
}
@TechReport{Golub:1972:SUL,
author = "G. H. Golub",
title = "Some Uses of the {Lanczos} Algorithm in Numerical
Linear Algebra",
type = "Technical Report",
number = "STAN-CS-72-302 (SU326 P30-19)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = aug,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974);
Gene Howard Golub (February 29, 1932--November 16,
2007)",
}
@TechReport{Morris:1972:CTP,
author = "F. Lockwood Morris",
title = "Correctness of Translations of Programming Languages
--- an Algebraic Approach",
type = "Technical Report",
number = "STAN-CS-72-303 (AIM-174, PB212827)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "125",
month = aug,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Anderssen:1972:RNS,
author = "Robert S. Anderssen and Gene H. Golub",
title = "{Richardson}'s non-stationary matrix iterative
procedure",
type = "Technical Report",
number = "STAN-CS-72-304 (SU326 P30-20)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "76",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-304.html",
abstract = "Because of its simplicity, Richardson's non-stationary
iterative scheme is a potentially powerful method for
the solution of (linear) operator equations. However,
its general application has more or less been blocked
by (a) the problem of constructing polynomials, which
deviate least from zero on the spectrum of the given
operator, and which are required for the determination
of the iteration parameters of the non-stationary
method, and (b) the instability of this scheme with
respect to rounding error effects. Recently, these
difficulties were examined in two Russian papers. In
the first, Lebedev [1969] constructed polynomials which
deviate least from zero on a set of subintervals of the
real axis which contains the spectrum of the given
operator. In the second, Lebedev and Finogenov [1971]
gave an ordering for the iteration parameters of the
non-stationary Richardson scheme which makes it a
stable numerical process. Translation of these two
papers appear as Appendices 1 and 2, respectively, in
this report. The body of the report represents an
examination of the properties of Richardson's
non-stationary scheme and the pertinence of the two
mentioned papers along with the results of numerical
experimentation testing the actual implementation of
the procedures given in them.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "76",
xxnumber = "CS-TR-72-304",
}
@TechReport{Agin:1972:RDC,
author = "Gerald Agin",
title = "Representation and Description of Curved Objects",
type = "Technical Report",
number = "STAN-CS-72-305 (AIM-173, AD755139)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "125",
month = aug,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pollack:1972:BCG,
author = "Bary W. Pollack",
title = "A bibliography on computer graphics",
type = "Technical Report",
number = "STAN-CS-72-306 (SU326 P23-X-2)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-306.html",
abstract = "This bibliography includes the most important works
describing the software aspects of generative computer
graphics. As such it will be of most usefullness to
researchers, system designers and programmers whose
interests and responsibilities include the development
of software systems for interactive graphical
input/output. The bibliography does include a short
section on hardware systems. Image analysis, pattern
recognition and picture processing and related fields
are rather poorly represented here. The interested
researcher is referred to journals in this field and to
the reports of Azriel Rosenfeld, University of
Maryland, which include excellent bibliographic
references.",
acknowledgement = ack-nhfb,
pdfpages = "156",
xxnumber = "CS-TR-72-306 (SU326 P23-X-2)",
}
@TechReport{Tanaka:1972:HTS,
author = "Hozumi Tanaka",
title = "{Hadamard} transform for speech wave analysis",
type = "Technical Report",
number = "STAN-CS-72-307 (AIM-175)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-307.html",
abstract = "Two methods of speech wave analysis using the Hadamard
transform are discussed. The first method is a direct
application of the Hadamard transform for speech waves.
The reason this method yields poor results is
discussed. The second method is the application of the
Hadamard transform to a log-magnitude frequency
spectrum. After the application of the Fourier
transform the Hadamard transform is applied to detect a
pitch period or to get a smoothed spectrum. This method
shows some positive aspects of the Hadamard transform
for the analysis of a speech wave with regard to the
reduction of processing time required for smoothing,
but at the cost of precision. A formant tracking
program for voiced speech is implemented by using this
method and an edge following technique used in scene
analysis.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-72-307",
}
@TechReport{Feldman:1972:RDS,
author = "Jerome A. Feldman and James R. Low and Daniel C.
Swinehart and Russell H. Taylor",
title = "Recent developments in {SAIL}, an {ALGOL}-based
language for artificial intelligence",
type = "Technical Report",
number = "STAN-CS-72-308 (AIM-176, AD754109)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-308.html",
abstract = "New features added to SAIL, an ALGOL based language
for the PDP-10, are discussed. The features include:
procedure variables; multiple processes; coroutines; a
limited form of backtracking; an event mechanism for
inter-process communication; and matching procedures, a
new way of searching the LEAP associative data base.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-72-308",
}
@TechReport{Lesser:1972:DCS,
author = "V. Lesser",
title = "Dynamic Control Structures and Their Use in
Emulation",
type = "Technical Report",
number = "STAN-CS-72-309",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "251",
month = aug,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kaufman:1972:ASU,
author = "Marc T. Kaufman",
title = "Anomalies in scheduling unit-time tasks",
type = "Technical Report",
number = "STAN-CS-72-310 (CSL-TR-34, AD750671)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-310.html",
abstract = "In this paper we examine the problem of scheduling a
set of tasks on a system with a number of identical
processors. Several timing anomalies are known to exist
for the general case, in which the execution time can
increase when inter-task constraints are removed or
processors are added. It is shown that these anomalies
also exist when tasks are restricted to be of equal
(unit) length. Several, increasingly restrictive,
heuristic scheduling algorithms are reviewed. The
`added processor' anomaly is shown to persist through
all of them, though in successively weaker form.",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-72-310",
}
@TechReport{Paul:1972:MTC,
author = "Richard Paul",
title = "Modelling, Trajectory Calculation and Serving of a
Computer Controlled Arm",
type = "Technical Report",
number = "STAN-CS-72-311 (AIM-177)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "????",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gill:1972:VFR,
author = "Ahron Gill",
title = "Visual Feedback and Related Problems in Computer
Controlled Hand-Eye Coordination",
type = "Technical Report",
number = "STAN-CS-72-312 (AIM-178, AD754108)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "134",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Staff:1972:BCS,
author = "{Staff}",
title = "Bibliography of Computer Science Reports",
type = "Technical Report",
number = "STAN-CS-72-313 (PB218353/1)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kogge:1972:PAEb,
author = "Peter M. Kogge",
title = "Parallel Algorithms for the Efficient Solution of
Recurrence Problems",
type = "Technical Report",
number = "STAN-CS-72-314 (CSL-TR-43, PB212893)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "74",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Part I).",
}
@TechReport{Kogge:1972:NSP,
author = "Peter M. Kogge",
title = "The Numerical Stability of Parallel Algorithms for
Solving Recurrence Problems",
type = "Technical Report",
number = "STAN-CS-72-315 (CSL-TR-44, PB212894)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "49",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Part II).",
}
@TechReport{Kogge:1972:MPS,
author = "Peter M. Kogge",
title = "Minimal Parallelism in the Solution of Recurrence
Problems",
type = "Technical Report",
number = "STAN-CS-72-316 (CSL-TR-45, PB212828)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = sep,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Part III).",
}
@TechReport{Fuller:1972:ADS,
author = "Samuel H. Fuller and Forest Baskett",
title = "An analysis of drum storage units",
type = "Technical Report",
number = "STAN-CS-72-317 (CSL-TR-26, AD750672)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-317.html",
abstract = "This article discusses the modeling and analysis of
drum-like storage units. Two common forms of drum
organizations and two common scheduling disciplines are
considered: the file drum and the paging drum;
first-in-first-out (FIFO) scheduling and
shortest-latency-time-first (SLTF) scheduling. The
modeling of the I/O requests to the drum is an
important aspect of this analysis. Measurements are
presented to indicate that it is realistic to model
requests for records, or blocks of information to a
file drum, as requests that have starting addresses
uniformly distributed around the circumference of the
drum and transfer times that are exponentially
distributed with a mean of 1/2 to 1/3 of a drum
revolution. The arrival of I/O requests is first
assumed to be a Poisson process and then generalized to
the case of a computer system with a finite degree of
multiprogramming. An exact analysis of all the models
except the SLTF file drum is presented; in this case
the complexity of the drum organization has forced us
to accept an approximate analysis. In order to examine
the error introduced into the analysis of the SLTF file
drum by our approximations, the results of the analytic
models are compared to a simulation model of the SLTF
file drum.",
acknowledgement = ack-nhfb,
pdfpages = "70",
xxnumber = "CS-TR-72-317",
}
@TechReport{Brown:1972:CGL,
author = "Harold Brown and Larry M. Masinter and Larry
Hjelmeland",
title = "Constructive graph labeling using double cosets",
type = "Technical Report",
number = "STAN-CS-72-318 (AD755140)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-318.html",
abstract = "Two efficient computer implemented algorithms are
presented for explicitly constructing all distinct
labelings of a graph G with a set of (not necessarily
distinct) labels L, given the symmetry group B of G.
Two recursive reductions of the problem and a
precomputation involving certain orbits of stabilizer
subgroups are the techniques used by the algorithm.
Moreover, for each labeling, the subgroup of B which
preserves that labeling is calculated.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-72-318",
}
@TechReport{Golub:1972:CBS,
author = "Gene H. Golub and James M. Varah",
title = "On a characterization of the best $ \ell_2 $ scaling
of a matrix",
type = "Technical Report",
number = "STAN-CS-72-319 (SU326 P30-22)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = oct,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-319.html",
abstract = "This paper is concerned with best two-sided scaling of
a general square matrix, and in particular with a
certain characterization of that best scaling: namely
that the first and last singular vectors (on left and
right) of the scaled matrix have components of equal
modulus. Necessity, sufficiency, and its relation with
other characterizations are discussed. Then the problem
of best scaling for rectangular matrices is introduced
and a conjecture made regarding a possible best
scaling. The conjecture is verified for some special
cases.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "15",
xxnumber = "CS-TR-72-319",
}
@TechReport{Baumgart:1972:WEP,
author = "Bruce G. Baumgart",
title = "Winged edge polyhedron representation",
type = "Technical Report",
number = "STAN-CS-72-320 (AIM-179)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-320.html",
abstract = "A winged edge polyhedron representation is stated and
a set of primitives that preserve Euler's F-E+V = 2
equation are explained. Present use of this
representation in artificial intelligence for computer
graphics and world modeling is illustrated and its
intended future application to computer vision is
described.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-72-320",
}
@TechReport{Bajcsy:1972:CIT,
author = "Ruzena Bajcsy",
title = "Computer Identification of Textured Visual Scenes",
type = "Technical Report",
number = "STAN-CS-72-321 (AIM-180, AD759712)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "156",
month = oct,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gill:1972:MMM,
author = "Phillip E. Gill and Gene H. Golub and Walter A. Murray
and Michael A. Saunders",
title = "Methods for modifying matrix factorizations",
type = "Technical Report",
number = "STAN-CS-72-322 (SU326 P30-23)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "62",
month = nov,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-322.html",
abstract = "In recent years several algorithms have appeared for
modifying the factors of a matrix following a rank-one
change. These methods have always been given in the
context of specific applications and this has probably
inhibited their use over a wider field. In this report
several methods are described for modifying Cholesky
factors. Some of these have been published previously
while others appear for the first time. In addition, a
new algorithm is presented for modifying the complete
orthogonal factorization of a general matrix, from
which the conventional QR factors are obtained as a
special case. A uniform notation has been used and
emphasis has been placed on illustrating the similarity
between different methods.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "63",
xxnumber = "CS-TR-72-322",
}
@TechReport{Malcolm:1972:FMS,
author = "Michael A. Malcolm and John Palmer",
title = "A fast method for solving a class of tri-diagonal
linear systems",
type = "Technical Report",
number = "STAN-CS-72-323",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-323.html",
abstract = "The solution of linear systems having real, symmetric,
diagonally dominant, tridiagonal coefficient matrices
with constant diagonals is considered. It is proved
that the diagonals of the LU decomposition of the
coefficient matrix rapidly converge to full
floating-point precision. It is also proved that the
computed LU decomposition converges when floating-point
arithmetic is used and that the limits of the LU
diagonals using floating point are roughly within
machine precision of the limits using real arithmetic.
This fact is exploited to reduce the number of
floating-point operations required to solve a linear
system from 8n-7 to 5n+2k-3, where k is much less than
n, the order of the matrix. If the elements of the sub-
and superdiagonals are 1, then only 4n+2k-3 operations
are needed. The entire LU decomposition takes k words
of storage, and considerable savings in array
subscripting are achieved. Upper and lower bounds on k
are obtained in terms of the ratio of the coefficient
matrix diagonal constants and parameters of the
floating-point number system. Various generalizations
of these results are discussed.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-72-323",
}
@TechReport{Bauer:1972:SMX,
author = "Henry R. {Bauer, III}",
title = "Subproblems of the $ m \times n $ Sequencing Problem",
type = "Technical Report",
number = "STAN-CS-72-324 (CSL-TR-48, PB214612)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "115",
month = nov,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Buchanan:1972:RHD,
author = "Bruce G. Buchanan",
title = "Review of {Hubert Dreyfus}' {{\booktitle{What
Computers Can't Do: a Critique of Artificial Reason}}
(Harper \& Row, New York, 1972)}",
type = "Technical Report",
number = "STAN-CS-72-325 (AIM-181)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-325.html",
abstract = "The recent book $ \underline {What Computers Can't Do}
$ by Hubert Dreyfus is an attack on artificial
intelligence research. This review takes the position
that the philosophical content of the book is
interesting, but that the attack on artificial
intelligence is not well reasoned.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-72-325",
}
@TechReport{Colby:1972:CEJ,
author = "Kenneth Mark Colby and Franklin Dennis Hilf",
title = "Can expert judges, using transcripts of teletyped
psychiatric interviews, distinguish human paranoid
patients from a computer simulation of paranoid
processes?",
type = "Technical Report",
number = "STAN-CS-72-326 (AIM-182, AD754107)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-326.html",
abstract = "Expert judges (psychiatrists and computer scientists)
could not correctly distinguish a simulation model of
paranoid processes from actual paranoid patients.",
acknowledgement = ack-nhfb,
pdfpages = "12",
xxnumber = "CS-TR-72-326",
}
@TechReport{Klarner:1972:ABN,
author = "David A. Klarner and Ronald L. Rivest",
title = "Asymptotic Bounds for the Number of Convex
$n$-Ominoes",
type = "Technical Report",
number = "STAN-CS-72-327 (AD755138)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = dec,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gabow:1972:EIE,
author = "Harold N. Gabow",
title = "An efficient implementation of {Edmonds}' maximum
matching algorithm",
type = "Technical Report",
number = "STAN-CS-72-328 (CSL-TR-31, PB218929)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-72-328.html",
abstract = "A matching in a graph is a collection of edges, no two
of which share a vertex. A maximum matching contains
the greatest number of edges possible. This paper
presents an efficient implementation of Edmonds'
algorithm for finding maximum matchings. The
computation time is proportional to $ V^3 $, where V is
the number of vertices; previous algorithms have
computation time proportional to $ V^4 $. The
implementation avoids Edmonds' blossom reduction by
using pointers to encode the structure of alternating
paths.",
acknowledgement = ack-nhfb,
pdfpages = "78",
xxnumber = "CS-TR-72-328",
}
@TechReport{Fang:1972:FDF,
author = "Isu Fang",
title = "{Folds}, a Declarative Formal Language Definition
System",
type = "Technical Report",
number = "STAN-CS-72-329 (PB218875)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "290",
month = dec,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Newey:1972:ATI,
author = "Malcolm Newey",
title = "Axioms and Theorems for Integers, Lists and Finite
Sets in {LCF}",
type = "Technical Report",
number = "STAN-CS-73-330 (AIM-184, AD758651)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "53",
month = jan,
year = "1972",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Fuller:1972:PCM,
author = "Samuel H. Fuller",
title = "Performance of an {I/O} channel with multiple paging
drums (digest edition)",
type = "Technical Report",
number = "STAN-CS-73-351 (SU-SEL-73-010)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 6",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-351.html",
abstract = "For rotating storage units, a paging drum organization
is known to offer substantially better response time to
I/O requests than is a more conventional (file)
organization [Abate and Dubner, 1969; Fuller and
Baskett, 1972]. When several, asynchronous paging drums
are attached to a single I/O channel, however, much of
the gain in response time due to the paging
organization is lost; this article investigates the
reasons for this loss in performance. A model of an I/O
channel with multiple paging drums is presented and we
embed into the model a Markov chain that closely
approximates the behavior of the I/O channel. The
analysis then leads to the moment generating function
of sector queue size and the Laplace--Stieltjes
transform of the waiting time. A significant
observation is that the expected waiting time for an
I/O request to a drum can be divided into two terms:
one independent of the load of I/O requests to the drum
and another that monotonically increases with
increasing load. Moreover, the load varying term of the
waiting time is nearly proportional to (2 - l/k) where
k is the number of drums connected to the I/O channel.
The validity of the Markov chain approximation is
examined in several cases by a comparison of the
analytic results to the actual performance of an I/O
channel with several paging drums.",
acknowledgement = ack-nhfb,
pdfpages = "9",
}
@TechReport{Fuller:1972:EDB,
author = "Samuel H. Fuller",
title = "The expected difference between the {SLTF} and {MTPT}
drum scheduling disciplines (digest edition)",
type = "Technical Report",
number = "STAN-CS-73-352 (CSL-TR-28, AD761176)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-352.html",
abstract = "This report is a sequel to an earlier report [Fuller,
1971] that develops a minimal-total-processing-time
(MTPT) drum scheduling algorithm. A quantitative
comparison between MTPT schedules and
shortest-latency-time-first (SLTF) schedules, commonly
acknowledged as good schedules for drum-like storage
units, is presented here. The analysis develops an
analogy to random walks and proves several asymptotic
properties of collections of records on drums. These
properties are specialized to the MTPT and SLTF
algorithms and it is shown that for sufficiently large
sets of records, the expected processing time of a SLTF
schedule is longer than a MTPT schedule by the expected
record length. The results of a simulation study are
also presented to show the difference in MTPT and SLTF
schedules for small sets of records and for situations
not covered in the analytic discussion.",
acknowledgement = ack-nhfb,
pdfpages = "7",
xxnumber = "CS-TR-73-352",
}
@TechReport{Fuller:1972:RAM,
author = "Samuel H. Fuller",
title = "Random arrivals and {MTPT} disk scheduling
disciplines",
type = "Technical Report",
number = "STAN-CS-73-353 (CSL-TR-29, AD761185)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-353.html",
abstract = "This article investigates the application of
minimal-total-processing-time (MTPT) scheduling
disciplines to rotating storage units when random
arrival of requests is allowed. Fixed-head drum and
moving-head disk storage units are considered and
particular emphasis is placed on the relative merits of
the MTPT scheduling discipline with respect to the
shortest-latency-time-first (SLTF) scheduling
discipline. The data presented are the results of
simulation studies. Situations are discovered in which
the MTPT discipline is superior to the SLTF discipline,
and situations are also discovered in which the
opposite is true. An implementation of the MTPT
scheduling algorithm is presented and the computational
requirements of the algorithm are discussed. It is
shown that the sorting procedure is the most time
consuming phase of the algorithm.",
acknowledgement = ack-nhfb,
pdfpages = "64",
xxnumber = "CS-TR-73-353",
}
@TechReport{Muntz:1972:OCM,
author = "Richard R. Muntz and Forest {Baskett, III}",
title = "Open, closed, and mixed networks of queues with
different classes of customers",
type = "Technical Report",
number = "STAN-CS-73-360 (CSL-TR-33, AD764014)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 35",
month = aug,
year = "1972",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-360.html",
abstract = "We derive the joint equilibrium distribution of queue
sizes in a network of queues containing N service
centers and R classes of customers. The equilibrium
state probabilities have the general form: P(S) - Cd(S)
$ f_1 $ ($ x_1$)$ f_2$ ($ x_2$) \ldots{} $ f_N$ ($
x_N$) where S is the state of the system, $ x_i$ is the
configuration of customers at the $i$-th service
center, d(S) is a function of the state of the model, $
f_i$ is a function that depends on the type of the
$i$-th service center, and C is a normalizing constant.
We consider four types of service centers to model
central processors, data channels, terminals, and
routing delays. The queueing disciplines associated
with these service centers include
first-come-first-served, processor sharing, no
queueing, and last-come-first-served. Each customer
belongs to a single class of customers while awaiting
or receiving service at a service center but may change
classes and service centers according to fixed
probabilities at the completion of a service request.
For open networks we consider state dependent arrival
processes. Closed networks are those with no arrivals.
A network may be closed with respect to some classes of
customers and open with respect to other classes of
customers. At three of the four types of service
centers, the service times of customers are governed by
probability distributions having rational Laplace
transforms, different classes of customers having
different distributions. At first-come-first-served
type service centers the service time distribution must
be identical and exponential for all classes of
customers. Many of the network results of Jackson on
arrival and service rate dependencies, of Posner and
Bernholtz on different classes of customers, and of
Chandy on different types of service centers are
combined and extended in this paper. The results become
special cases of the model presented here. An example
shows how different classes of customers can affect
models of computer systems. Finally, we show that an
equivalent model encompassing all of the results
involves only classes of customers with identical
exponentially distributed service times. All of the
other structure of the first model can be absorbed into
the fixed probabilities governing the change of class
and change of service center of each class of
customers.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-73-360",
}
@TechReport{Newey:1973:ATI,
author = "Malcolm C. Newey",
title = "Axioms and theorems for integers, lists and finite
sets in {LCF}",
type = "Technical Report",
number = "STAN-CS-73-330 (AIM-184, AD758651)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-330.html",
abstract = "LCF (Logic for Computable Functions) is being promoted
as a formal language suitable for the discussion of
various problems in the Mathematical Theory of
Computation (MTC). To this end, several examples of MTC
problems have been formalised and proofs have been
exhibited using the LCF proof-checker. However, in
these examples, there has been a certain amount of
ad-hoc-ery in the proofs; namely, many mathematical
theorems have been assumed without proof and no
axiomatisation of the mathematical domains involved was
given. This paper describes a suitable mathematical
environment for future LCF experiments and its
axiomatic basis. The environment developed, deemed
appropriate for such experiments, consists of a large
body of theorems from the areas of integer arithmetic,
list manipulation and finite set theory.",
acknowledgement = ack-nhfb,
pdfpages = "56",
xxnumber = "CS-TR-73-330",
}
@TechReport{Collins:1973:CTE,
author = "George E. Collins",
title = "The Computing Time of the {Euclidian} Algorithm",
type = "Technical Report",
number = "STAN-CS-73-331 (AIM-187, AD757364)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-331.html",
abstract = "The maximum, minimum and average computing times of
the classical Euclidean algorithm for the greatest
common divisor of two integers are derived, to within
codominance, as functions of the lengths of the two
inputs and the output.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-73-331",
}
@TechReport{Milner:1973:ML,
author = "Robin Milner",
title = "Models of {LCF}",
type = "Technical Report",
number = "STAN-CS-73-332 (AIM-186, AD758645)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-332.html",
abstract = "LCF is a deductive system for computable functions
proposed by D. Scott in 1969 in an unpublished
memorandum. The purpose of the present paper is to
demonstrate the soundness of the system with respect to
certain models, which are partially ordered domains of
continuous functions. This demonstration was supplied
by Scott in his memorandum; the present paper is merely
intended to make this work more accessible.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-73-332",
}
@TechReport{Chandra:1973:PPF,
author = "Ashok K. Chandra and Zohar Manna",
title = "On the Power of Programming Features",
type = "Technical Report",
number = "STAN-CS-73-333 (AIM-185, AD757367)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-333.html",
abstract = "We consider the power of several programming features
such as counters, pushdown stacks, queues, arrays,
recursion and equality. In this study program schemas
are used as the model for computation. The relations
between the powers of these features is completely
described by a comparison diagram.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-73-333",
}
@TechReport{Malcolm:1973:UUR,
author = "Michael A. Malcolm and Cleve B. Moler",
title = "{URAND}, a Universal Random Number Generator",
type = "Technical Report",
number = "STAN-CS-73-334 (AD757366)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 6",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/moler-cleve-b.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-334.html",
abstract = "A subroutine for generating uniformly-distributed
floating-point numbers in the interval $ [0, 1) $ is
presented in ANSI Standard Fortran. The subroutine,
URAND, is designed to be relatively machine
independent. URAND has undergone minimal testing on
various machines and is thought to work properly on any
machine having binary integer number representation,
integer multiplication modulo $m$ and integer addition
either modulo $m$ or yielding at least $ \log_2 (m) $
significant bits, where $m$ is some integral power of
2. Upon the first call of URAND, the value of $m$ is
automatically determined and appropriate constants for
a linear congruential generator are computed following
the suggestions of Donald E. Knuth, volume 2. URAND is
guaranteed to have a full-length cycle. Readers are
invited to apply their favorite statistical tests to
URAND, using any binary machine, and report the results
to the authors.",
acknowledgement = ack-nhfb,
pdfpages = "7",
xxnumber = "CS-TR-73-334",
xxpages = "10",
}
@TechReport{Golub:1973:CSDa,
author = "Gene H. Golub and Eugene Seneta",
title = "Computation of the Stationary Distribution of an
Infinite {Markov} Matrix",
type = "Technical Report",
number = "STAN-CS-73-335 (SU326 P30-24)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jan,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-335.html",
abstract = "An algorithm is presented for computing the unique
stationary distribution of an infinite stochastic
matrix possessing at least one column whose elements
are bounded away from zero. Elementwise convergence
rate is discussed by means of two examples.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "13",
xxnumber = "CS-TR-73-335",
}
@TechReport{Chandra:1973:PAP,
author = "Ashok K. Chandra",
title = "On the Properties and Applications of Program
Schemas",
type = "Technical Report",
number = "STAN-CS-73-336 (AIM-188, AD758646)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "225",
month = jan,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gips:1973:AS,
author = "James Gips and George Stiny",
title = "Aesthetics Systems",
type = "Technical Report",
number = "STAN-CS-73-337 (AIM-189, PB218682)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-337.html",
abstract = "The formal structure of aesthetics systems is defined.
Aesthetics systems provide for the essential tasks of
interpretation and evaluation in aesthetic analysis.
Kolmogorov's formulation of information theory is
applicable. An aesthetics system for a class of
non-representational, geometric paintings and its
application to three actual paintings is described in
the Appendix.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-73-337",
}
@TechReport{Klarner:1973:FBT,
author = "David A. Klarner",
title = "A Finite Basis Theorem Revisited",
type = "Technical Report",
number = "STAN-CS-73-338 (AD759713)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = feb,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-338.html",
abstract = "Let S denote a set of k-dimensional boxes each having
integral sides. Let $ \Gamma $ (S) denote the set of
all boxes which can be filled completely with
translates of elements of S. It is shown here that S
contains a finite subset B such that $ \Gamma $ (B) = $
\Gamma $ (S). This result was proved for k = 1,2 in an
earlier paper, but the proof for k > 2 contained an
error.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-73-338",
}
@TechReport{Dent:1973:CLI,
author = "Warren T. Dent and Gene H. Golub",
title = "Computation of the Limited Information Maximum
Likelihood Estimator",
type = "Technical Report",
number = "STAN-CS-73-339 (SU326 P30-25)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 27",
month = feb,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-339.html",
abstract = "Computation of the Limited Information Maximum
Likelihood Estimator (LIMLE) of the set of coefficients
in a single equation of a system of interdependent
relations is sufficiently complicated to detract from
other potentially interesting properties. Although for
finite samples the LIMLE has no moments [18],
asymptotically it remains normally distributed [2] and
retains other properties associated with maximum
likelihood. The most extensive application of the
estimator has been made in the Brookings studies [7].
We believe that current methods of estimation are
clumsy, and present a numerically stable estimation
schema based on Householder transformations and the
singular value decomposition. The analysis permits a
convenient demonstration of equivalence with the Two
Stage Least Squares Estimator (TSLSE) in the instance
of just identification.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "29",
xxnumber = "CS-TR-73-339",
}
@TechReport{Newey:1973:NPI,
author = "Malcolm C. Newey",
title = "Notes on a Problem Involving Permutations as
Subsequences",
type = "Technical Report",
number = "STAN-CS-73-340 (AIM-190, AD759714)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = mar,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-340.html",
abstract = "The problem (attributed to R. M. Karp by Knuth) is to
describe the sequences of minimum length which contain,
as subsequences, all the permutations of an alphabet of
n symbols. This paper catalogs some of the easy
observations on the problem and proves that the minimum
lengths for n=5, n=6 \& n=7 are 19, 28 and 39
respectively. Also presented is a construction which
yields (for n > 2) many appropriate sequences of length
$ n^2$-2n+4 so giving an upper bound on length of
minimum strings which matches exactly all known
values.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-73-340",
}
@TechReport{Katz:1973:HAP,
author = "Shmuel M. Katz and Zohar Manna",
title = "A Heuristic Approach to Program Verification",
type = "Technical Report",
number = "STAN-CS-73-341 (AIM-191, AD764272)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = mar,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-341.html",
abstract = "We present various heuristic techniques for use in
proving the correctness of computer programs. The
techniques are designed to obtain automatically the
`inductive assertions' attached to the loops of the
program which previously required human `understanding'
of the program's performance. We distinguish between
two general approaches: one in which we obtain the
inductive assertion by analyzing predicates which are
known to be true at the entrances and exits of the loop
($ \underline {top - down} $ approach), and another in
which we generate the inductive assertion directly from
the statements of the loop ($ \underline {bottom - up}
$ approach).",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-73-341",
}
@TechReport{Knuth:1973:MP,
author = "Donald E. Knuth",
title = "Matroid Partitioning",
type = "Technical Report",
number = "STAN-CS-73-342 (AD759715)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
day = "1",
month = mar,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-342.html;
http://www-db.stanford.edu/TR/CS-TR-73-342.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-342",
abstract = "This report discusses a modified version of Edmonds's
algorithm for partitioning of a set into subsets
independent in various given matroids. If $ {\cal M}_1,
\ldots, {\cal M}_k $ are matroids defined on a finite
set $E$, the algorithm yields a simple necessary and
sufficient condition for whether or not the elements of
$E$ can be colored with $k$ colors such that (i) all
elements of color $j$ are independent in $ {\cal M}_j
$, and (ii) the number of elements of color $j$ lies
between given limits, $ n_j \leq \| E_j \| \leq
{n'}_j$. The algorithm either finds such a coloring or
it finds a proof that none exists, after making at most
$ n^3 + n^2 k$ tests of independence in the given
matroids, where $n$ is the number of elements in $E$.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-342",
keywords = "combinatorial geometry; matching; matroid",
pdfpages = "13",
xxnumber = "CS-TR-73-342",
}
@TechReport{Levine:1973:CBA,
author = "David R. Levine",
title = "Computer-Based Analytic Grading for {German} Grammar
Instruction",
type = "Technical Report",
number = "STAN-CS-73-343",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "220",
month = mar,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Schank:1973:FPA,
author = "Roger C. Schank",
title = "The Fourteen Primitive Actions and Their Inferences",
type = "Technical Report",
number = "STAN-CS-73-344 (AIM-183, AD759716)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "71",
month = mar,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-344.html",
abstract = "In order to represent the conceptual information
underlying a natural language sentence, a conceptual
structure has been established that uses the basic
actor-action-object framework. It was the intent that
these structures have only one representation for one
meaning, regardless of the semantic form of the
sentence being represented. Actions were reduced to
their basic parts so as to effect this. It was found
that only fourteen basic actions were needed as
building blocks by which all verbs can be represented.
Each of these actions has a set of actions or states
which can be inferred when they are present.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-73-344",
}
@TechReport{Collins:1973:MRS,
author = "George E. Collins and Ellis Horowitz",
title = "The Minimum Root Separation of a Polynomial",
type = "Technical Report",
number = "STAN-CS-73-345 (AIM-192)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "71",
month = apr,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-345.html",
abstract = "The minimum root separation of a complex polynomial A
is defined as the minimum of the distances between
distinct roots of A. For polynomials with Gaussian
integer coefficients and no multiple roots, three lower
bounds are derived for the root separation. In each
case the bound is a function of the degree, n, of A and
the sum, d, of the absolute values of the coefficients
of A. The notion of a semi-norm for a commutative ring
is defined, and it is shown how any semi-norm can be
extended to polynomial rings and matrix rings,
obtaining a very general analogue of Hadamard's
determinant theorem.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-73-345",
}
@TechReport{Colby:1973:RCB,
author = "Kenneth Mark Colby",
title = "The Rational for Computer Based Treatment of Language
Difficulties in Nonspeaking Autistic Children",
type = "Technical Report",
number = "STAN-CS-73-346 (AIM-193, AD759717)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = mar,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-346.html",
abstract = "The principles underlying a computer-based treatment
method for language acquisition in nonspeaking autistic
children are described. The main principle involves
encouragement of exploratory learning with minimum
adult interference.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-73-346",
}
@TechReport{Colby:1973:MAE,
author = "Kenneth Mark Colby and Franklin Dennis Hilf",
title = "Multidimensional analysis in evaluating a simulation
of paranoid thought",
type = "Technical Report",
number = "STAN-CS-73-347 (AIM-194, PB221170/4)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-347.html",
abstract = "The limitations of Turing's Test as an evaluation
procedure are reviewed. More valuable are tests which
ask expert judges to make ratings along multiple
dimensions essential to the model. In this way the
model's weaknesses become clarified and the model
builder learns where the model must be improved.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-73-347",
}
@TechReport{Colby:1973:MDA,
author = "Kenneth M. Colby and Franklin Dennis Hilf",
title = "Multi Dimensional Analysis in Evaluating a Simulation
of Paranoid Thought Processes",
type = "Technical Report",
number = "STAN-CS-73-347 (AIM-194, PB221170/4)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = apr,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pereyra:1973:HOF,
author = "Victor Pereyra",
title = "High Order Finite Difference Solution of Differential
Equations",
type = "Technical Report",
number = "STAN-CS-73-348 (SU326 P30-26, PB222513)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "86",
month = apr,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-348.html",
abstract = "These seminar notes give a detailed treatment of
finite difference approximations to smooth nonlinear
two-point boundary value problems for second order
differential equations. Consistency, stability,
convergence, and asymptotic expansions are discussed.
Most results are stated in such a way as to indicate
extensions to more general problems. Successive
extrapolations and deferred corrections are described
and their implementations are explored thoroughly. A
very general deferred correction generator is developed
and it is employed in the implementation of a variable
order, variable (uniform) step method. Complete FORTRAN
programs and extensive numerical experiments and
comparisons are included together with a set of 48
references.",
acknowledgement = ack-nhfb,
pdfpages = "88",
xxnumber = "CS-TR-73-348",
}
@TechReport{Blum:1973:TPS,
author = "Manual Blum and Robert W. Floyd and Vaughan R. Pratt
and Ronald L. Rivest and Robert Endre Tarjan",
title = "Two papers on the selection problem: \booktitle{Time
Bounds for Selection} [by {Manual Blum}, {Robert W.
Floyd}, {Vaughan Pratt}, {Ronald L. Rivest}, and
{Robert E. Tarjan}] and \booktitle{Expected Time Bounds
for Selection} [by {Robert W. Floyd} and {Ronald L.
Rivest}]",
type = "Technical Report",
number = "STAN-CS-73-349 (PB221115)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-349.html",
abstract = "(1) The number of comparisons required to select the
$i$-th smallest of $n$ numbers is shown to be at most a
linear function of $n$ by analysis of a new selection
algorithm --- PICK. Specifically, no more than $ 5.4305
n$ comparisons are ever required. This bound is
improved for extreme values of $i$, and a new lower
bound on the requisite number of comparisons is also
proved. (2) A new selection algorithm is presented
which is shown to be very efficient on the average,
both theoretically and practically. The number of
comparisons used to select the $i$-th smallest of $n$
numbers is $ n + \min (i, n - i) + o(n)$. A lower bound
within 9\% of the above formula is also derived.",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
pdfpages = "53",
xxnumber = "CS-TR-73-349",
}
@TechReport{Blum:1973:TBS,
author = "Manuel Blum and Robert Floyd and Vaughn Pratt and
Ronald Rivest and Robert Tarjan",
title = "Time Bounds for Selection",
type = "Technical Report",
number = "STAN-CS-73-349 (PB221115) [part 1]",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = apr,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Floyd:1973:ETB,
author = "Robert Floyd and Ronald Rivest",
title = "Expected Time Bounds for Selection",
type = "Technical Report",
number = "STAN-CS-73-349 (PB221115) [part 2]",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = apr,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Kaufman:1973:AOA,
author = "Marc T. Kaufman",
title = "An Almost-Optimal Algorithm for the Assembly Line
Scheduling Problem",
type = "Technical Report",
number = "STAN-CS-73-350 (CSL-TR-53, AD761177, SU-SEL-73-009)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = jan,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-350.html",
abstract = "This paper considers a solution to the multiprocessor
scheduling problem for the case where the ordering
relation between tasks can be represented as a tree.
Assume that we have n identical processors, and a
number of tasks to perform. Each task $ T_i $ requires
an amount of time $ \mu_i $ to complete, $ 0 < \mu_i
\leq k $, so that $k$ is an upper bound on task length.
Tasks are indivisible, so that a processor once
assigned must remain assigned until the task completes
(no preemption). Then the `longest path' scheduling
method is almost-optimal in the following sense: Let $
\omage $ be the total time required to process all of
the tasks by the `longest path' algorithm. Let $
\omega_o $ be the minimal time in which all of the
tasks can be processed. Let $ \omega_p $ be the minimal
time to process all of the tasks if arbitrary
preemption of processors is allowed. Then: $ \omega_p
\leq \omega_o \leq \omega \leq \omega_p + k - k / n $,
where $n$ is the number of processors available to any
of the algorithms.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-73-350",
}
@TechReport{Klarner:1973:NSC,
author = "David A. Klarner",
title = "The Number of {SDR}'s in Certain Regular Systems",
type = "Technical Report",
number = "STAN-CS-73-354 (PB221165/4)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
month = apr,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-354.html",
abstract = "Let ($ a_1 $, \ldots{}, $ a_k$) = $ \bar {a}$ denote a
vector of numbers, and let C($ \bar {a}$,n) denote the
n $ \times $ n cyclic matrix having ($ a_1$, \ldots{},
$ a_k$,0, \ldots{}, 0) as its first row. It is shown
that the sequences (det C($ \bar {a}$,n): n = k,k+1,
\ldots{} ) and (per C($ \bar {a}$,n): n = k,k+1,
\ldots{} ) satisfy linear homogeneous difference
equations with constant coefficients. The permanent,
per C, of a matrix C is defined like the determinant
except that one forgets about $ {( - 1)}^{sign \pi }$
where $ \pi $ is a permutation.",
acknowledgement = ack-nhfb,
pdfpages = "8",
xxnumber = "CS-TR-73-354",
}
@TechReport{Price:1973:ACP,
author = "Thomas G. Price",
title = "An analysis of central processor scheduling in
multiprogrammed computer systems (digest edition)",
type = "Technical Report",
number = "STAN-CS-73-355 (CSL-TR-57, AD764598, SU-SEL-73-013)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = apr,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-355.html",
abstract = "A simple finite source model is used to gain insight
into the effect of central processor scheduling in
multiprogrammed computer systems. CPU utilization is
chosen as the measure of performance and this decision
is discussed. A relation between CPU utilization and
flow time is developed. It is shown that the
shortest-remaining-processing-time discipline maximizes
both CPU utilization and I/O utilization for the
queueing model M/G/1/N. An exact analysis of processor
utilization using shortest-remaining-processing-time
scheduling for systems with two jobs is given and it is
observed that the processor utilization is independent
of the form of the processing time distribution. The
effect of the CPU processing time distribution on
performance is discussed. For first-come-first-served
scheduling, it is shown that distributions with the
same mean and variance can yield significantly
different processor utilizations and that utilization
may or may not significantly decrease with increasing
variance. The results are used to compare several
scheduling disciplines of practical interest. An
approximate expression for CPU utilization using
shortest-remaining-processing-time scheduling in
systems with N jobs is given.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-73-355 (CSL-TR-57, AD764598)",
}
@TechReport{Smith:1973:M,
author = "David Canfield Smith and Horace J. Enea",
title = "{MLISP2}",
type = "Technical Report",
number = "STAN-CS-73-356 (AIM-195, PB222164)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "92",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-356.html",
abstract = "MLISP2 is a high-level programming language based on
LISP. Features: 1. The notation of MLISP. 2.
Extensibility---the ability to extend the language and
to define new languages. 3. Pattern matching---the
ability to match input against context free or
sensitive patterns. 4. Backtracking--the ability to set
decision points, manipulate contexts and backtrack.",
acknowledgement = ack-nhfb,
pdfpages = "106",
xxnumber = "CS-TR-73-356",
}
@TechReport{Goldman:1973:CBS,
author = "Neil M. Goldman and Christopher K. Riesbeck",
title = "A Conceptually Based Sentence Paraphraser",
type = "Technical Report",
number = "STAN-CS-73-357 (AIM-196, AD762471)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "88",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-357.html",
abstract = "This report describes a system of programs which
performs natural language processing based on an
underlying language free (conceptual) representation of
meaning. This system is used to produce sentence
paraphrases which demonstrate a form of understanding
with respect to a given context. Particular emphasis
has been placed on the major subtasks of language
analysis (mapping natural language into conceptual
structures) and language generation (mapping conceptual
structures into natural language), and on the
interaction between these processes and a conceptual
memory model.",
acknowledgement = ack-nhfb,
pdfpages = "91",
xxnumber = "CS-TR-73-357",
}
@TechReport{Schank:1973:ICU,
author = "Roger C. Schank and Charles J. {Rieger III}",
title = "Inference and the Computer Understanding of Natural
Language",
type = "Technical Report",
number = "STAN-CS-73-358 (AIM-197, AD762470)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-358.html",
abstract = "The notion of computer understanding of natural
language is examined relative to inference mechanisms
designed to function in a language-free deep conceptual
base (Conceptual Dependency). The conceptual analysis
of a natural language sentence into this conceptual
base, and the nature of the memory which stores and
operates upon these conceptual structures are described
from both theoretical and practical standpoints. The
various types of inferences which can be made during
and after the conceptual analysis of a sentence are
defined, and a functioning program which performs these
inference tasks is described. Actual computer output is
included.",
acknowledgement = ack-nhfb,
pdfpages = "66",
xxnumber = "CS-TR-73-358",
}
@TechReport{Stone:1973:NCP,
author = "Harold Stone",
title = "A Note on a Combinatorial Problem of {Burnett} and
{Coffman}",
type = "Technical Report",
number = "STAN-CS-73-359 (CSL-TN-25, PB222064)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = may,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Brown:1973:ACG,
author = "Harold Brown and Larry M. Masinter",
title = "An algorithm for the construction of the graphs of
organic molecules",
type = "Technical Report",
number = "STAN-CS-73-361 (Serra, AD764273)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-361.html",
abstract = "A description and a formal proof of an efficient
computer implemented algorithm for the construction of
graphs is presented. This algorithm, which is part of a
program for the automated analysis of organic
compounds, constructs all of the non-isomorphic,
connected multi-graphs based on a given degree sequence
of nodes and which arise from a relatively small
`catalog' of certain canonical graphs. For the graphs
of the more common organic molecules, a catalog of most
of the canonical graphs is known, and the algorithm can
produce all of the distinct valence isomers of these
organic molecules.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-73-361",
}
@TechReport{Kaufman:1973:ASG,
author = "Linda C. Kaufman",
title = "The {$ L Z $} Algorithm to Solve the Generalized
Eigenvalue Problem",
type = "Technical Report",
number = "STAN-CS-73-363 (Serra, PB222099)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "101",
month = may,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Thosar:1973:EPD,
author = "Ravindra B. Thosar",
title = "Estimation of probability density using signature
tables for applications to pattern recognition",
type = "Technical Report",
number = "STAN-CS-73-364 (AIM-198, AD763611)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-364.html",
abstract = "Signature table training method consists of cumulative
evaluation of a function (such as a probability
density) at pre-assigned co-ordinate values of input
parameters to the table. The training is conditional:
based on a binary valued `learning' input to a table
which is compared to the label attached to each
training sample. Interpretation of an unknown sample
vector is then equivalent of a table look-up, i.e.
extraction of the function value stored at the proper
co-ordinates. Such a technique is very useful when a
large number of samples must be interpreted as in the
case of speech recognition and the time required for
the training as well as for the recognition is at a
premium. However, this method is limited by prohibitive
storage requirements, even for a moderate number of
parameters, when their relative independence cannot be
assumed. This report investigates the conditions under
which the higher dimensional probability density
function can be decomposed so that the density estimate
is obtained by a hierarchy of signature tables with
consequent reduction in the storage requirement.
Practical utility of the theoretical results obtained
in the report is demonstrated by a vowel recognition
experiment.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-73-364",
}
@TechReport{Igarashi:1973:APV,
author = "Shigeru Igarashi and Ralph L. London and David C.
Luckham",
title = "Automatic program verification {I}: a logical basis
and its implementation",
type = "Technical Report",
number = "STAN-CS-73-365 (AIM-200, AD767331)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-365.html",
abstract = "Defining the semantics of programming languages by
axioms and rules of inference yields a deduction system
within which proofs may be given that programs satisfy
specifications. The deduction system herein is shown to
be consistent and also deduction complete with respect
to Hoare's system. A subgoaler for the deduction system
is described whose input is a significant subset of
Pascal programs plus inductive assertions. The output
is a set of verification conditions or lemmas to be
proved. Several non-trivial arithmetic and sorting
programs have been shown to satisfy specifications by
using an interactive theorem prover to automatically
generate proofs of the verification conditions.
Additional components for a more powerful verification
system are under construction.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-73-365",
}
@TechReport{Grape:1973:MBI,
author = "Gunnar Rutger Grape",
title = "Model Bases (Intermediate-Level Computer Vision)",
type = "Technical Report",
number = "STAN-CS-73-366 (AIM-201, AD763673)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "256",
month = may,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Amble:1973:OHT,
author = "Ole Amble and Donald E. Knuth",
title = "Ordered Hash Tables",
type = "Technical Report",
number = "STAN-CS-73-367 (AD763601)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = may,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "Some variants of the traditional hash method, making
use of the numerical or alphabetical order of the keys,
lead to faster searching at the expense of a little
extra work when items are inserted. The paper presents
the new algorithms and analyzes their average running
time.",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{The Computer Journal}, {\bf
17}(2) 135--142, May 1974,
doi:10.1093/comjnl/17.2.135",
}
@TechReport{Schank:1973:GLT,
author = "Roger C. Schank and Yorick A. Wilks",
title = "The goals of linguistic theory revisited",
type = "Technical Report",
number = "STAN-CS-73-368 (AIM-202, AD764396)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-368.html",
abstract = "We examine the original goals of generative linguistic
theory. We suggest that these goals were well defined
but misguided with respect to their avoidance of the
problem of modelling performance. With developments
such as Generative Semantics, it is no longer clear
that the goals are clearly defined. We argue that it is
vital for linguistics to concern itself with the
procedures that humans use in language. We then
introduce a number of basic human competencies, in the
field of language understanding, understanding in
context and the use of inferential information, and
argue that the modelling of these aspects of language
understanding requires procedures of a sort that cannot
be easily accommodated within the dominant paradigm. In
particular, we argue that the procedures that will be
required in these cases ought to be linguistic, and
that the simple-minded importation of techniques from
logic may create a linguistics in which there cannot be
procedures of the required sort.",
acknowledgement = ack-nhfb,
pdfpages = "46",
xxnumber = "CS-TR-73-368",
}
@TechReport{Schank:1973:DCS,
author = "Roger C. Schank",
title = "The development of conceptual structures in children",
type = "Technical Report",
number = "STAN-CS-73-369 (AIM-203, AD764274)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-369.html",
abstract = "Previous papers by the author have hypothesized that
it is possible to represent the meaning of natural
language sentences using a framework which has only
fourteen primitive ACTs. This paper addresses the
problem of when and how these ACTs might be learned by
children. The speech of a child of age 2 is examined
for possible knowledge of the primitive ACTs as well as
the conceptual relations underlying language. It is
shown that there is evidence that the conceptual
structures underlying language are probably complete by
age 2. Next a child is studied from birth to age 1. The
emergence of the primitive ACTs and the conceptual
relations is traced. The hypothesis is made that the
structures that underlie and are necessary for language
are present by age 1.",
acknowledgement = ack-nhfb,
pdfpages = "33",
xxnumber = "CS-TR-73-369",
}
@TechReport{Sridharan:1973:HPD,
author = "N. S. Sridharan and G. Gelernter and A. J. Hart and W.
F. Fowler and H. J. Shue",
title = "A Heuristic Program to Discover Syntheses for Complex
Organic Molecule",
type = "Technical Report",
number = "STAN-CS-73-370 (AIM-205, AD764288)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1973:RSP,
author = "Donald E. Knuth",
title = "A review of {``Structured Programming''}",
type = "Technical Report",
number = "STAN-CS-73-371 (AD223572/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
day = "1",
month = jun,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-371.html;
http://www-db.stanford.edu/TR/CS-TR-73-371.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-371",
abstract = "The recent book \booktitle{Structured Programming} by
0. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare promises
to have a significant impact on computer science. This
report contains a detailed review of the topics treated
in that book, in the form of three informal `open
letters' to the three authors. It is hoped that
circulation of these letters to a wider audience at
this time will help to promote useful discussion of the
important issues.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-371",
pdfpages = "26",
xxnumber = "CS-TR-73-371",
}
@TechReport{Malcolm:1973:NSF,
author = "Michael A. Malcolm",
title = "Nonlinear Spline Functions",
type = "Technical Report",
number = "STAN-CS-73-372 (AD767970)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Part II).",
}
@TechReport{VanLehn:1973:SUM,
author = "Kurt A. VanLehn",
title = "{SAIL} user manual",
type = "Technical Report",
number = "STAN-CS-73-373 (AIM-204, AD765353/BWC)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "124",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-373.html",
abstract = "SAIL is a high-level programming language for the
PDP-10 computer. It includes an extended ALGOL 60
compiler and a companion set of execution-time
routines. In addition to ALGOL, the language features:
(1) flexible linking to hand-coded machine language
algorithms, (2) complete access to the PDP-10 I/O
facilities, (3) a complete system of compile-time
arithmetic and logic as well as a flexible macro
system, (4) user modifiable error handling, (5)
backtracking, and (6) interrupt facilities.
Furthermore, a subset of the SAIL language, called
LEAP, provides facilities for (1) sets and lists, (2)
an associative data structure, (3) independent
processes, and (4) procedure variables. The LEAP subset
of SAIL is an extension of the LEAP language, which was
designed by J. Feldman and P. Rovner, and implemented
on Lincoln Laboratory's TX-2 (see [Feldman \& Rovner,
`An Algol-Based Associative Language,' Communications
of the ACM, v.12, no. 8 (Aug. 1969), pp.439-449]). The
extensions to LEAP are partially described in `Recent
Developments is SAIL' (see [Feldman et al., Proceedings
of the AFIPS Fall Joint Computer Conference, 1972, pp.
1193-1202]). This manual describes the SAIL language
and the execution-time routines for the typical SAIL
user: a non-novice programmer with some knowledge of
ALGOL. It lies somewhere between being a tutorial and a
reference manual.",
acknowledgement = ack-nhfb,
pdfpages = "124",
xxnumber = "CS-TR-73-373",
}
@TechReport{Malcolm:1973:MIA,
author = "Michael A. Malcolm",
title = "A Machine Independent {ALGOL} Procedure for Accurate
Floating-Point Summation",
type = "Technical Report",
number = "STAN-CS-73-374 (AD-764 275)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 6",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/AD0764275.pdf",
acknowledgement = ack-nhfb,
pdfpages = "9",
remark = "This is an extract from the author's thesis.",
}
@TechReport{Fischer:1973:FTM,
author = "D. Fischer and G. H. Golub and O. Hald and C. Levin
and O. Widlund",
title = "On {Fourier--Toeplitz} Methods for Separable Elliptic
Problems",
type = "Technical Report",
number = "STAN-CS-73-375 (SU-326 P30-27)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
}
@TechReport{Meinardus:1973:LEE,
author = "G{\"u}nter Meinardus and Gerald D. Taylor",
title = "Lower estimates for the error of best uniform
approximation",
type = "Technical Report",
number = "STAN-CS-73-376 (SU326 P30-28)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-376.html;
https://en.wikipedia.org/wiki/Remez_algorithm",
abstract = "In this paper the lower bounds of de La Vall{\'e}e
Poussin and Remes for the error of best uniform
approximation from a linear subspace are generalized to
give analogous estimates based on $k$ points, $ k = 1,
\ldots {}, n$.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-73-376",
}
@TechReport{Wilks:1973:PS,
author = "Yorick Wilks",
title = "Preference Semantics",
type = "Technical Report",
number = "STAN-CS-73-377 (AIM-206, AD764652)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Moorer:1973:OCM,
author = "James Anderson Moorer",
title = "The optimum comb method of pitch period analysis of
continuous digitized speech",
type = "Technical Report",
number = "STAN-CS-73-378 (AIM-207, AD767333)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-378.html",
abstract = "A new method of tracking the fundamental frequency of
voiced speech is described. The method is shown to be
of similar accuracy as the Cepstrum technique. Since
the method involves only additions, no multiplication,
it is shown to be faster than the SIFT algorithm.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-73-378",
}
@TechReport{Moorer:1973:HFT,
author = "James Anderson Moorer",
title = "The heterodyne filter as a tool for analysis of
transient waveforms",
type = "Technical Report",
number = "STAN-CS-73-379 (AIM-208, AD767334)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-379.html",
abstract = "A method of analysis of transient waveforms is
discussed. Its properties and limitations are presented
in the context of musical tones. The method is shown to
be useful when the risetimes of the partials of the
tone are not too short. An extension to inharmonic
partials and polyphonic musical sound is discussed.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-73-379",
}
@TechReport{Yakimovsky:1973:SAU,
author = "Yoram Yakimovsky",
title = "Scene Analysis Using a Semantic Base for Region
Growing",
type = "Technical Report",
number = "STAN-CS-73-380 (AIM-209, AD767695/O WC)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = jun,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Sridharan:1973:CGV,
author = "N. S. Sridharan",
title = "Computer Generation of Vertex-Graphs",
type = "Technical Report",
number = "STAN-CS-73-381 (AD767694)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = jul,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "See also \cite{Sridharan:1974:CQT}.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1973:AAT,
author = "Zohar Manna and Amir Pnueli",
title = "Axiomatic approach to total correctness of programs",
type = "Technical Report",
number = "STAN-CS-73-382 (AIM-210, AD767335)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-382.html",
abstract = "We present here an axiomatic approach which enables
one to prove by formal methods that his program is
`totally correct' (i.e., it terminates and is logically
correct --- does what it is supposed to do). The
approach is similar to Hoare's approach for proving
that a program is `partially correct' (i.e., that
whenever it terminates it produces correct results).
Our extension to Hoare's method lies in the possibility
of proving correctness {\em and\/} termination at once,
and in the enlarged scope of properties that can be
proved by it.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-73-382",
}
@TechReport{Wilks:1973:NLI,
author = "Yorick A. Wilks",
title = "Natural language inference",
type = "Technical Report",
number = "STAN-CS-73-383 (AIM-211, AD769673)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 24",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-383.html",
abstract = "The paper describes the way in which a Preference
Semantics system for natural language analysis and
generation tackles a difficult class of anaphoric
inference problems (finding the correct referent for an
English pronoun in context): those requiring either
analysis (conceptual) knowledge of a complex sort, or
requiring weak inductive knowledge of the course of
events in the real world. The method employed converts
all available knowledge to a canonical template form
and endeavors to create chains of non-deductive
inferences from the unknowns to the possible referents.
Its method of selecting among possible chains of
inferences is consistent with the overall principle of
`semantic preference' used to set up the original
meaning representation, of which these anaphoric
inference procedures are a manipulation.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-73-383",
}
@TechReport{Herskovits:1973:GFS,
author = "Annette Herskovits",
title = "The generation of {French} from a semantic
representation",
type = "Technical Report",
number = "STAN-CS-73-384 (AIM-212, AD769379)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-384.html",
abstract = "The report contains first a brief description of
Preference Semantics, a system of representation and
analysis of the meaning structure of natural language.
The analysis algorithm which transforms phrases into
semantic items called templates has been considered in
detail elsewhere, so this report concentrates on the
second phase of analysis, which binds templates
together into a higher level semantic block
corresponding to an English paragraph, and which, in
operation, interlocks with the French generation
procedure. During this phase, the semantic relations
between templates are extracted, pronouns are referred
and those word disambiguations are done that require
the context of a whole paragraph. These tasks require
items called PARAPLATES which are attached to keywords
such as prepositions, subjunctions and relative
pronouns. The system chooses the representation which
maximises a carefully defined `semantic density.' A
system for the generation of French sentences is then
described, based on the recursive evaluation of
procedural generation patterns called STEREOTYPES. The
stereotypes are semantically context sensitive, are
attached to each sense of English words and keywords
and are carried into the representation by the analysis
procedure. The representation of the meaning of words,
and the versatility of the stereotype format, allow for
fine meaning distinctions to appear in the French, and
for the construction of French differing radically from
the English original.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-73-384",
}
@TechReport{Thosar:1973:RCS,
author = "Ravindra B. Thosar",
title = "Recognition of continuous speech: segmentation and
classification using signature table adaptation",
type = "Technical Report",
number = "STAN-CS-73-385 (AIM-213)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-385.html",
abstract = "This report explores the possibility of using a set of
features for segmentation and recognition of continuous
speech. The features are not necessarily `distinctive'
or minimal, in the sense that they do not divide the
phonemes into mutually exclusive subsets, and can have
high redundancy. This concept of feature can thus avoid
apriori binding between the phoneme categories to be
recognized and the set of features defined in a
particular system. An adaptive technique is used to
find the probability of the presence of a feature. Each
feature is treated independently of other features. An
unknown utterance is thus represented by a feature
graph with associated probabilities. It is hoped that
such a representation would be valuable for a
hypothesize-test paradigm as opposed to one which
operates on a linear symbolic input.",
acknowledgement = ack-nhfb,
pdfpages = "39",
xxnumber = "CS-TR-73-385",
}
@TechReport{Perkins:1973:CFV,
author = "W. A. Perkins and Thomas O. Binford",
title = "A corner finder for visual feedback",
type = "Technical Report",
number = "STAN-CS-73-386 (AIM-214, AD767332)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-386.html",
abstract = "In visual-feedback work often a model of an object and
its approximate location are known and it is only
necessary to determine its location and orientation
more accurately. The purpose of the program described
herein is to provide such information for the case in
which the model is an edge or corner. Given a model of
a line or a corner with two or three edges, the program
searches a TV window of arbitrary size looking for one
or all corners which match the model. A model-driven
program directs the search. It calls on another program
to find all lines inside the window. Then it looks at
these lines and eliminates lines which cannot match any
of the model lines. It next calls on a program to form
vertices and then checks for a matching vertex. If this
simple procedure fails, the model-driver has two backup
procedures. First it works with the lines that it has
and tries to form a matching vertex (corner). If this
fails, it matches parts of the model with vertices and
lines that are present and then takes a careful look in
a small region in which it expects to find a missing
line. The program often finds weak contrast edges in
this manner. Lines are found by a global method after
the entire window has been scanned with the Hueckel
edge operator.",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-73-386",
}
@TechReport{Buchanan:1973:ABC,
author = "Bruce G. Buchanan and Natesa S. Sridharan",
title = "Analysis of behavior of chemical molecules: rule
formation on non-homogeneous classes of objects",
type = "Technical Report",
number = "STAN-CS-73-387 (AIM-215, AD769380)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-387.html",
abstract = "An information processing model of some important
aspects of inductive reasoning is presented within the
context of one scientific discipline. Given a
collection of experimental (mass spectrometry) data
from several chemical molecules the computer program
described here separates the molecules into
`well-behaved' subclasses and selects from the space of
all explanatory processes the `characteristic'
processes for each subclass. The definitions of
`well-behaved' and `characteristic' embody several
heuristics which are discussed. Some results of the
program are discussed which have been useful to
chemists and which lend credibility to this approach.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-73-387",
}
@TechReport{Swanson:1973:IPM,
author = "Roger C. Swanson",
title = "Interconnections for parallel memories to unscramble
$p$-ordered vectors",
type = "Technical Report",
number = "STAN-CS-73-388 (CSL-TR-74, PB226044/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-388.html",
abstract = "Several methods are being considered for storing
arrays in a parallel memory system so that various
useful partitions of an array can be fetched from the
memory with a single access. Some of these methods
fetch vectors in an order scrambled from that required
for a computation. This paper considers the problem of
unscrambling such vectors when the vectors belong to a
class called p-ordered vectors and the memory system
consists of a prime number of modules. Pairs of
interconnections are described that can unscramble
p-ordered vectors in a number of steps that grows as
the square root of the number of memories. Lower and
upper bounds are given for the number of steps to
unscramble the worst case vector. The upper bound
calculation that is derived also provides an upper
bound on the minimum diameter of a star polygon with a
fixed number of nodes and two interconnections. An
algorithm is given that has produced optimal pairs of
interconnections for all sizes of memory that have been
tried. The algorithm appears to find optimal pairs for
all memory sizes, but no proof has yet been found.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-73-388",
}
@TechReport{Masinter:1973:AAI,
author = "L. Masinter and N. S. Sridharan and J. Lederberg and
D. H. Smit",
title = "Applications of Artificial Intelligence for Chemical
Inference {XII}: Exhaustive Generation of Cyclic and
Acyclic Isomers",
type = "Technical Report",
number = "STAN-CS-73-389 (AIM-216, AD771299)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = sep,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gips:1973:CIT,
author = "James Gips",
title = "A construction for the inverse of a {Turing} machine",
type = "Technical Report",
number = "STAN-CS-73-390",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-390.html",
abstract = "A direct construction for the inverse of a Turing
machine is presented.",
acknowledgement = ack-nhfb,
pdfpages = "11",
xxnumber = "CS-TR-73-390",
}
@TechReport{Sridharan:1973:SST,
author = "Natesa S. Sridharan",
title = "Search strategies for the task of organic chemical
synthesis",
type = "Technical Report",
number = "STAN-CS-73-391 (AIM-217, AD770610)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-391.html",
abstract = "A computer program has been written that successfully
discovers syntheses for complex organic chemical
molecules. The definition of the search space and
strategies for heuristic search are described in this
paper.",
acknowledgement = ack-nhfb,
pdfpages = "33",
xxnumber = "CS-TR-73-391",
}
@TechReport{Knuth:1973:SSE,
author = "Donald E. Knuth",
title = "{{\booktitle{Sorting and Searching}}} --- errata and
addenda",
type = "Technical Report",
number = "STAN-CS-73-392",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = oct,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-392.html;
http://www-db.stanford.edu/TR/CS-TR-73-392.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-73-392",
abstract = "This report lists all the typographical errors, in
\booktitle{The Art of Computer Programming / Volume 3},
that are presently known to its author. Several recent
developments and references to the literature, which
will be incorporated in the second printing, are also
included in an attempt to keep the book up-to-date.
Several dozen corrections to the second (1971) printing
of volume two are also included.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-73-392",
pdfpages = "38",
xxnumber = "CS-TR-73-392",
}
@TechReport{Vuillemin:1973:PTR,
author = "Jean {\'E}tienne Vuillemin",
title = "Proof Techniques for Recursive Programs",
type = "Technical Report",
number = "STAN-CS-73-393 (AIM-218, AD772063/4WC)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "97",
month = oct,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hoare:1973:PPA,
author = "C. A. R. Hoare",
title = "Parallel programming: an axiomatic approach",
type = "Technical Report",
number = "STAN-CS-73-394 (AIM-219, AD769674)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "97",
month = oct,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-394.html",
abstract = "This paper develops some ideas expounded in [C. A. R.
Hoare. `\booktitle{Towards a Theory of Parallel
Programming},' in \booktitle{Operating Systems
Techniques}, ed. C. A. R. Hoare and R. H. Perrot.
Academic Press. 1972]. It distinguishes a number of
ways of using parallelism, including disjoint
processes, competition, cooperation, communication and
`colluding'. In each case an axiomatic proof rule is
given. Some light is thrown on traps or ON conditions.
Warning: the program structuring methods described here
are not suitable for the construction of operating
systems.",
acknowledgement = ack-nhfb,
pdfpages = "33",
xxnumber = "CS-TR-73-394",
}
@TechReport{Staff:1973:BCS,
author = "{Staff}",
title = "Bibliography of Computer Science Reports",
type = "Technical Report",
number = "STAN-CS-73-395",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = oct,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bolles:1973:USF,
author = "Robert C. Bolles and Richard P. Paul",
title = "The use of sensory feedback in a programmable assembly
system",
type = "Technical Report",
number = "STAN-CS-73-396 (AIM-220, AD772064)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = oct,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-396.html",
abstract = "This article describes an experimental, automated
assembly system which uses sensory feedback to control
an electro-mechanical arm and TV camera. Visual,
tactile, and force feedback are used to improve
positional information, guide manipulations, and
perform inspections. The system has two phases: a
'planning' phase in which the computer is programmed to
assemble some object, and a 'working' phase in which
the computer controls the arm and TV camera in actually
performing the assembly. The working phase is designed
to be run on a mini-computer. The system has been used
to assemble a water pump, consisting of a base, gasket,
top, and six screws. This example is used to explain
how the sensory data is incorporated into the control
system. A movie showing the pump assembly is available
from the Stanford Artificial Intelligence Laboratory.",
acknowledgement = ack-nhfb,
pdfpages = "27",
xxnumber = "CS-TR-73-396",
}
@TechReport{Henrici:1973:CCA,
author = "Peter Henrici",
title = "Computational Complex Analysis",
type = "Technical Report",
number = "STAN-CS-73-397 (SU326 P30-28A)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = oct,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Peter Karl Henrici (13 September 1923--13 March
1987)",
}
@TechReport{Baumgart:1973:ICC,
author = "Bruce G. Baumgart",
title = "Image contouring and comparing",
type = "Technical Report",
number = "STAN-CS-73-398 (AIM-199, AD771300) (also mistakenly
assigned STAN-CS-73-362)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-398.html",
abstract = "A contour image representation is stated and an
algorithm for converting a set of digital television
images into this representation is explained. The
algorithm consists of five steps: digital image
thresholding, binary image contouring, polygon nesting,
polygon smoothing, and polygon comparing. An
implementation of the algorithm is the main routine of
a program called CRE; auxiliary routines provide cart
and turn table control, TV camera input, image display,
and Xerox printer output. A serendip application of CRE
to type font construction is explained. Details about
the intended application of CRE to the perception of
physical objects will appear in sequels to this
paper.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-73-398 (also mistakenly assigned
STAN-CS-73-362)",
}
@TechReport{Paige:1973:SSI,
author = "C. C. Paige and M. A. Saunders",
title = "Solution of Sparse Indefinite Systems of Equations and
Least Squares Problems",
type = "Technical Report",
number = "STAN-CS-73-399 (SU326 P30-29)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "47",
month = oct,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hoare:1973:RDS,
author = "C. A. R. Hoare",
title = "Recursive Data Structures",
type = "Technical Report",
number = "STAN-CS-73-400 (AIM-223, AD-772 509)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 32",
month = oct,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/AD0772509.pdf",
abstract = "The power and convenience of a programming language
may be enhanced for certain applications by permitting
data structures to be defined by recursion. This paper
suggests a pleasing notation by which such structures
can be declared and processed; it gives the axioms
which specify their properties, and suggests an
efficient implementation method. It shows how a
recursive data structure may be used to represent
another data type, for example, a set. It then
discusses two ways in which significant gains in
efficiency can be made by selective updating of
structures, and gives the relevant proof rules and
hints for implementation. It is shown by examples that
a certain range of applications can be efficiently
programmed, without introducing the low-level concept
of a reference into a high-level programming
language.",
acknowledgement = ack-nhfb,
pdfpages = "35",
}
@TechReport{Hoare:1973:MOS,
author = "C. A. R. Hoare",
title = "Monitors: an operating system structuring concept",
type = "Technical Report",
number = "STAN-CS-73-401 (PB226691/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 25",
month = nov,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hansen-per-brinch.bib;
https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-401.html",
abstract = "This paper develops Brinch Hansen's concept of a
monitor as a method of structuring an operating system.
It introduces a form of synchronization, describes a
possible method of implementation in terms of
semaphores, and gives a suitable proof rule.
Illustrative examples include a single resource
scheduler, a bounded buffer, an alarm clock, a buffer
pool, a disc head optimizer, and a version of the
problem of readers and writers.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-73-401",
}
@TechReport{Herriot:1973:APC,
author = "J. G. Herriot and C. H. Reinsch",
title = "{ALGOL 60} Procedures for the Calculation of
Interpolating Natural Quintic Spline Functions",
type = "Technical Report",
number = "STAN-CS-73-402 (PB229616/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = nov,
year = "1973",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Christian H. Reinsch (?? ?? 1932--8 October 2022)",
}
@TechReport{Hoare:1973:HPL,
author = "C. A. R. Hoare",
title = "Hints on programming language design",
type = "Technical Report",
number = "STAN-CS-73-403 (AIM-224, AD773391)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-73-403.html",
abstract = "This paper (based on a keynote address presented at
the SIGACT/SIGPLAN Symposium on Principles of
Programming Languages, Boston, October 1-3, 1973)
presents the view that a programming language is a tool
which should assist the programmer in the most
difficult aspects of his art, namely program design,
documentation, and debugging. It discusses the
objective criteria for evaluating a language design,
and illustrates them by application to language
features of both high level languages and machine code
programming. It concludes with an annotated reading
list, recommended for all intending language
designers.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-73-403",
}
@TechReport{Earnest:1973:FRF,
author = "Lester D. Earnest and John McCarthy and Edward A.
Feigenbaum and Joshua Lederberg",
title = "Final report: the first ten years of artificial
intelligence research at {Stanford}",
type = "Technical Report",
number = "STAN-CS-74-409 (AIM-228, AD776233)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-409.html",
abstract = "The first ten years of research in artificial
intelligence and related fields at Stanford University
have yielded significant results in computer vision and
control of manipulators, speech recognition, heuristic
programming, representation theory, mathematical theory
of computation, and modeling of organic chemical
processes. This report summarizes the accomplishments
and provides bibliographies in each research area.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
pdfpages = "124",
xxnumber = "CS-TR-74-409",
}
@TechReport{Sridharan:1974:CQT,
author = "Natesa S. Sridharan",
title = "A Catalog of Quadri\slash Trivalent Graphs",
type = "Technical Report",
number = "STAN-CS-74-404 (AD775452)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = jan,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-404.html",
abstract = "In a previous report \cite{Sridharan:1973:CGV} a
method for computer generation of quadri\slash
trivalent `vertex-graphs' was presented in detail. This
report is a catalog of 13 classes of graphs generated
by using this method.",
acknowledgement = ack-nhfb,
pdfpages = "50",
xxnumber = "CS-TR-74-404",
}
@TechReport{Davis:1974:SCS,
author = "Randall Davis and Margaret H. Wright",
title = "{Stanford Computer Science Department} research
report",
type = "Technical Report",
number = "STAN-CS-74-405",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-405.html",
abstract = "This collection of reports is divided into two
sections. The first contains the research summaries for
individual faculty members and research associates in
the Computer Science Department. Two professors from
Electrical Engineering are included as `Affiliated
Faculty' because their interests are closely related to
those of the Department, while Professors George
Dantzig and Roger Schank do not appear because they
were on leave and unavailable when the summaries were
prepared. The second section gives an overview of the
activities of research groups in the Department.
`Group' here is taken to imply many different things,
including people related by various degrees of
intellectual interests, physical proximity, or funding
considerations. We have tried to describe any group
whose scope of interest is greater than that of one
person. The list of recent publications for each is not
intended to be comprehensive, but rather to give a
feeling for the range of topics considered. This
collection of reports has been assembled to provide a
reasonably comprehensive review of research activities
in the Department. We hope that it will be widely
useful --- in particular, students in the Department
may find it helpful in discovering interesting projects
and possible thesis topics. We expect also that it will
be of interest to many other people, both within and
outside the Department.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-74-405",
}
@TechReport{Perkins:1974:MMR,
author = "W. A. Perkins",
title = "Memory model for a robot",
type = "Technical Report",
number = "STAN-CS-74-406 (AIM-225, AD775645)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-406.html",
abstract = "A memory model for a robot has been designed and
tested in a simple toy-block world for which it has
shown clarity, efficiency, and generality. In a
constrained pseudo-English one can ask the program to
manipulate objects and query it about the present,
past, and possible future states of its world. The
program has a good understanding of its world and gives
intelligent answers in reasonably good English. Past
and hypothetical states of the world are handled by
changing the state of the world in an imaginary
context. Procedures interrogate and modify two global
databases, one which contains the present
representation of the world and another which contains
the past history of events, conversations, etc. The
program has the ability to create, destroy, and even
resurrect objects in its world.",
acknowledgement = ack-nhfb,
pdfpages = "119",
xxnumber = "CS-TR-74-406",
}
@TechReport{Wright:1974:F,
author = "F. H. G. {Wright, II} and Ralph E. Gorin",
title = "{FAIL}",
type = "Technical Report",
number = "STAN-CS-74-407 (AIM-226, AD778310)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-407.html",
abstract = "This is a reference manual for FAIL, a fast, one-pass
assembler for PDP-10 and PDP-6 machine language. FAIL
statements, pseudo-operations, macros, and conditional
assembly features are described. Although FAIL uses
substantially more main memory than MACRO-10, it
assembles typical programs about five time faster. FAIL
assembles the entire Stanford time-sharing operating
system (two million characters) in less than four
minutes of CPU time on a KA-10 processor. FAIL permits
an ALGOL-type block structure which provides a way of
localizing the usage of some symbols to certain parts
of the program, such that the same symbol name can be
used to mean different things in different blocks.",
acknowledgement = ack-nhfb,
pdfpages = "70",
xxnumber = "CS-TR-74-407",
}
@TechReport{Thomas:1974:IPA,
author = "Arthur Thomas and Thomas Binford",
title = "Information Processing Analysis of Visual Perception:
a review",
type = "Technical Report",
number = "STAN-CS-74-408 (AIM-227, AD-A003 483)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = feb,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Peterson:1974:MPS,
author = "James L. Peterson",
title = "Modelling of Parallel Systems",
type = "Technical Report",
number = "STAN-CS-74-410 (CSL-TR-46, PB231926/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "241",
month = feb,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Anderson:1974:ALL,
author = "D. Bruce Anderson and Thomas O. Binford and Arthur J.
Thomas and Richard W. Weyhrauch and Yorick A. Wilks",
title = "After {Leibniz} \ldots{}: discussions on philosophy
and artificial intelligence",
type = "Technical Report",
number = "STAN-CS-74-411 (AIM-229)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-411.html",
abstract = "This is an edited transcript of informal conversations
which we have had over recent months, in which we
looked at some of the issues which seem to arise when
artificial intelligence and philosophy meet. Our aim
was to see what might be some of the fundamental
principles of attempts to build intelligent machines.
The major topics covered are the relationship of AI and
philosophy and what help they might be to each other:
the mechanisms of natural inference and deduction; the
question of what kind of theory of meaning would be
involved in a successful natural language understanding
program, and the nature of models in AI research.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-74-411",
}
@TechReport{Swinehart:1974:CMP,
author = "Daniel C. Swinehart",
title = "{COPILOT}: a Multiple Process Approach to Interactive
Programming Systems",
type = "Technical Report",
number = "STAN-CS-74-412 (AIM-230, AD786721)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gips:1974:SGT,
author = "James Gips",
title = "Shape Grammars and Their Uses",
type = "Technical Report",
number = "STAN-CS-74-413 (AIM-231, AD-A001 814)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "243",
month = mar,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Baumgart:1974:GGE,
author = "Bruce G. Baumgart",
title = "{GEOMED} --- a geometric editor",
type = "Technical Report",
number = "STAN-CS-74-414 (AIM-232, AD780452)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-414.html",
abstract = "GEOMED is a system for doing 3-D geometric modeling;
used from a keyboard, it is an interactive drawing
program; used as a package of SAIL or LISP accessible
subroutines, it is a graphics language. With GEOMED,
arbitrary polyhedra can be constructed, moved about and
viewed in perspective with hidden lines eliminated. In
addition to polyhedra, camera and image models are
provided so that simulators relevant to computer
vision, problem solving, and animation may be
constructed.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-74-414",
}
@TechReport{Rivest:1974:AAR,
author = "Ronald Linn Rivest",
title = "Analysis of Associative Retrieval Algorithms",
type = "Technical Report",
number = "STAN-CS-74-415 (PB233065/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 102",
month = apr,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://people.csail.mit.edu/rivest/pubs/rivest-1974-PhD.pdf",
acknowledgement = ack-nhfb,
pdfpages = "113",
remark = "This is the author's Ph.D. thesis, dated March 1974.",
}
@TechReport{Knuth:1974:SPG,
author = "Donald E. Knuth",
title = "Structured Programming with {{\tt Go To}} Statements",
type = "Technical Report",
number = "STAN-CS-74-416 (PB233507/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "100",
month = apr,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Computing Surveys}, {\bf 6}(4)
261--301, December 1974. doi:10.1145/356635.356640",
}
@TechReport{Sites:1974:STP,
author = "Richard L. Sites",
title = "Some Thoughts on Proving That Programs Terminate
Cleanly",
type = "Technical Report",
number = "STAN-CS-74-417 (PB233045/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "68",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
xxtitle = "Some thoughts on proving clean termination of
programs",
}
@TechReport{Sites:1974:PCP,
author = "Richard L. Sites",
title = "Proving That Computer Programs Terminate Cleanly",
type = "Technical Report",
number = "STAN-CS-74-418 (PB233045/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "143",
month = may,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-417.html",
abstract = "Proof of clean termination is a useful sub-goal in the
process of proving that a program is totally correct.
Clean termination means that the program terminates (no
infinite loops) and that it does so normally, without
any execution-time semantic errors (integer overflow,
use of undefined variables, subscript out of range,
etc.). In contrast to proofs of correctness, proof of
clean termination requires no extensive annotation of a
program by a human user, but the proof says nothing
about the results calculated by the program, just that
whatever it does, it terminates cleanly. Two example
proofs are given, of previously published programs:
TREESORT3 by Robert Floyd, and SELECT by Ronald L.
Rivest and Robert Floyd.",
acknowledgement = ack-nhfb,
pdfpages = "76",
remark = "This is the author's thesis.",
xxnumber = "CS-TR-74-417",
}
@TechReport{Rieger:1974:CMT,
author = "Charles {Rieger III}",
title = "Conceptual Memory: a Theory and Computer Program for
Processing the Meaning Content of Natural Language
Utterances",
type = "Technical Report",
number = "STAN-CS-74-419 (AIM-233, AD-A000 086)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "393",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wakerly:1973:PSC,
author = "John F. Wakerly",
title = "Partially self-checking ciruits and their use in
performing logical operations",
type = "Technical Report",
number = "STAN-CS-74-420 (CSL-TR-50, PB232543/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1973",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-420.html",
abstract = "A new class of circuits called partially self-checking
circuits is described. These circuits have one mode of
operation called secure mode in which they have the
properties of totally self-checking circuits; that is,
every fault is tested during normal operation and no
fault can cause an undetected error. They also have an
insecure mode of operation with the property that any
fault which affects a result in insecure mode is tested
by some input in secure mode; however, undetected
errors may occur in insecure mode. One application of
these circuits is in the arithmetic and logic unit of a
computer with data encoded in an error-detecting code.
While there is no code simpler than duplication which
detects single errors in logical operations such as AND
and OR, it is shown that there exist partially
self-checking networks to perform these operations. A
commercially available MSI chip, the 74181 4-bit ALU,
can be used in a partially self-checking network to
perform arithmetic and logical operations.",
acknowledgement = ack-nhfb,
pdfpages = "56",
xxnumber = "CS-TR-74-420",
}
@TechReport{Wakerly:1974:LCE,
author = "John Wakerly",
title = "Low-Cost Error Detection Techniques for Small
Computers",
type = "Technical Report",
number = "STAN-CS-74-421 (CSL-TR-51, PB232356/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "232",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Stone:1974:PTD,
author = "Harold Stone",
title = "Parallel Tri-Diagonal Equation Solvers",
type = "Technical Report",
number = "STAN-CS-74-422 (CSL-TR-79, NASA-TM-62,370)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rao:1974:ARA,
author = "Gururaj S. Rao",
title = "Asymptotic representation of the average number of
active modules in an $n$-way interleaved memory",
type = "Technical Report",
number = "STAN-CS-74-423 (CSL-TN-41, PB232860/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-423.html",
abstract = "In an $n$-way interleaved memory the effective
bandwidth depends on the average number of concurrently
active modules. Using a model for the memory which does
not permit queueing on busy modules and which assumes
an infinite stream of calls on the modules, where the
elements in the stream occur with equal probability,
the average number is a combinatorial quantity.
Hellerman has previously approximated this quantity by
$ n^{0.56} $. We show in this paper that the average
number is asymptotically equal to $ \sqrt {\frac {\pi
n}{2}} - \frac {1}{3} $. The method is due to Knuth and
expresses the combinatorial quantity in terms of the
incomplete gamma function and its derivatives.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-74-423",
}
@TechReport{Schlumberger:1974:LCN,
author = "Maurice Schlumberger",
title = "Logarithmic Communications Networks",
type = "Technical Report",
number = "STAN-CS-74-424 (CSL-TR-80, PB232602/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Chapter 1).",
}
@TechReport{Schlumberger:1974:VDC,
author = "Maurice Schlumberger",
title = "Vulnerability of {deBruijn} Communications Networks",
type = "Technical Report",
number = "STAN-CS-74-425 (CSL-TR-81, PB232598/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "68",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Chapter 2).",
}
@TechReport{Schlumberger:1974:QEL,
author = "Maurice Schlumberger",
title = "Queueing Equal Length Messages in a Logarithmic
Network",
type = "Technical Report",
number = "STAN-CS-74-426 (CSL-TR-82, PB232597)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "75",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis (Chapter 3).",
}
@TechReport{Lang:1974:PPS,
author = "Tomas Lang",
title = "Performing the Perfect Schuffle in an Array Computer",
type = "Technical Report",
number = "STAN-CS-74-427 (CSL-TN-36, PB232624/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is an excerpt from the author's thesis.",
}
@TechReport{Lang:1974:IBP,
author = "Tomas Lang",
title = "Interconnections Between Processors and Memory Modules
Using the Schuffle--Exchange Network",
type = "Technical Report",
number = "STAN-CS-74-428 (CSL-TR-76, PB232633/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is an excerpt from the author's thesis.",
}
@TechReport{Orcutt:1974:EDR,
author = "Samuel E. Orcutt",
title = "Efficient Data Routing Schemes for {ILLIAC IV}-Type
Computers",
type = "Technical Report",
number = "STAN-CS-74-429 (CSL-TR-70, PB232623/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is an excerpt from the author's thesis.",
}
@TechReport{Orcutt:1974:NPC,
author = "Samuel E. Orcutt",
title = "A Novel Parallel Computer Architecture and Some
Applications",
type = "Technical Report",
number = "STAN-CS-74-430 (CSL-TR-71, PB234513/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is an excerpt from the author's thesis.",
}
@TechReport{Colby:1974:PMR,
author = "Kenneth Mark Colby and Roger C. Parkison and William
S. Faught",
title = "Pattern-matching rules for the recognition of natural
language dialogue expressions",
type = "Technical Report",
number = "STAN-CS-74-431 (AIM-234)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = jun,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-431.html",
abstract = "Man--machine dialogues using everyday conversational
English present problems for computer processing of
natural language. Grammar-based parsers which perform a
word-by-word, parts-of-speech analysis are too fragile
to operate satisfactorily in real time interviews
allowing unrestricted English. In constructing a
simulation of paranoid thought processes, we designed
an algorithm capable of handling the linguistic
expressions used by interviewers in teletyped
diagnostic psychiatric interviews. The algorithm uses
pattern-matching rules which attempt to characterize
the input expressions by progressively transforming
them into patterns which match, completely or fuzzily,
abstract stored patterns. The power of this approach
lies in its ability to ignore recognized and
unrecognized words and still grasp the meaning of the
message. The methods utilized are general and could
serve any `host' system which takes natural language
input.",
acknowledgement = ack-nhfb,
pdfpages = "25",
xxnumber = "CS-TR-74-431",
}
@TechReport{Weyhrauch:1974:FPC,
author = "Richard Weyhrauch and Arthur Thomas",
title = "{FOL}: a Proof Checker for First-Order Logic",
type = "Technical Report",
number = "STAN-CS-74-432 (AIM-235, AD-A006 898)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = may,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buchanan:1974:ACP,
author = "Jack R. Buchanan and David C. Luckham",
title = "On automating the construction of programs",
type = "Technical Report",
number = "STAN-CS-74-433 (AIM-236, AD784513)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "65",
month = may,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-433.html",
abstract = "An experimental system for automatically generating
certain simple kinds of programs is described. The
programs constructed are expressed in a subset of ALGOL
containing assignments, function calls, conditional
statements, while loops, and non-recursive procedure
calls. The input is an environment of primitive
programs and programming methods specified in a
language currently used to define the semantics of the
output programming language. The system has been used
to generate programs for symbolic manipulation, robot
control, every day planning, and computing arithmetical
functions.",
acknowledgement = ack-nhfb,
pdfpages = "72",
xxnumber = "CS-TR-74-433",
}
@TechReport{Ruhe:1974:ASN,
author = "Axel Ruhe and Per {\AA}ke Wedin",
title = "Algorithms for Separable Nonlinear Least Squares
Problems",
type = "Technical Report",
number = "STAN-CS-74-434 (SU326 P30-31)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = jun,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/ruhe-axel.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{SIAM Review}, {\bf 22}(3)
318--337, July 1980, doi:10.1137/1022057.",
}
@TechReport{Price:1974:BCS,
author = "Thomas G. Price",
title = "Balanced computer systems",
type = "Technical Report",
number = "STAN-CS-74-435 (CSL-TR-88, A001-071, SU-SEL-74-037)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "56",
month = apr,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-435.html",
abstract = "We use the central server model to extend Buzen's
results on balance and bottlenecks. We develop two
measures which appear to be useful for evaluating and
improving computer system performance. The first
measure, called the balance index, is useful for
balancing requests to the peripheral processors. The
second quantity, called the sensitivity index,
indicates which processing rates have the most effect
on overall system performance. We define the capacity
of a central server model as the maximum throughput as
we vary the peripheral processor probabilities. We show
that the reciprocal of the CPU utilization is a convex
function of the peripheral processor probabilities and
that a necessary and sufficient condition for the
peripheral processor probabilities to achieve capacity
is that the balance indexes are equal for all
peripheral processors. We give a method to calculate
capacity using classical optimization techniques.
Finally, we consider the problem of balancing the
processing rates of the processors. Two conditions for
`balance' are derived. The first condition maximizes
our uncertainty about the next state of the system.
This condition has several desirable properties
concerning throughput, utilizations, overlap, and
resistance to changes in job mix. The second condition
is based on obtaining the most throughput for a given
cost.",
acknowledgement = ack-nhfb,
pdfpages = "56",
xxnumber = "CS-TR-74-435",
}
@TechReport{Wilks:1974:NLU,
author = "Yorick A. Wilks",
title = "Natural language understanding systems within the {AI}
paradigm: a survey and some comparisons",
type = "Technical Report",
number = "STAN-CS-74-436 (AIM-237, AD-A012 477)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 40",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-436.html",
abstract = "The paper surveys the major projects on the
understanding of natural language that fall within what
may now be called the artificial intelligence paradigm
for natural language systems. Some space is devoted to
arguing that the paradigm is now a reality and
different in significant respects from the generative
paradigm of present day linguistics. The comparisons
between systems center around questions of the relative
perspicuity of procedural and static representations;
the advantages and disadvantages of developing systems
over a period survey and some comparisons.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-74-436",
}
@TechReport{Riesbeck:1974:CUA,
author = "C. K. Riesbeck",
title = "Computational Understanding: Analysis of Sentences and
Context",
type = "Technical Report",
number = "STAN-CS-74-437 (AIM-238, AD-A005 040)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "245",
month = jul,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hanna:1974:CMA,
author = "Marsha Jo Hanna",
title = "Computer Matching of Areas in Stereo Images",
type = "Technical Report",
number = "STAN-CS-74-438 (AIM-239, AD786720)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "99",
month = jul,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cottle:1974:SLS,
author = "Richard W. Cottle and Gene H. Golub and Richard S.
Sacher",
title = "On the solution of large, structured linear
complementarity problems: {III}",
type = "Technical Report",
number = "STAN-CS-74-439 (OR-74-7, SU326 P30-32)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "87",
month = aug,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-439.html",
abstract = "This paper addresses the problem of solving a class of
specially-structured linear complementarity problems of
potentially very large size. An efficient method which
couples a modification of the block successive
overrelaxation technique and several techniques
discussed by the authors in previous papers is
proposed. Problems of the type considered arise, for
example, in solving approximations to both the free
boundary problem for finite-length journal bearings and
percolation problems in porous dams by numerical
methods. These applications and our computational
experience with the method are presented here.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "89",
xxnumber = "CS-TR-74-439",
}
@TechReport{Morris:1974:FPM,
author = "James H. {Morris, Jr.} and Vaughn R. Pratt and Donald
E. Knuth",
title = "Fast Pattern Matching in Strings",
type = "Technical Report",
number = "STAN-CS-74-440 (PB237360/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = jul,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published, with different author order, in
\booktitle{SIAM Journal on Computing}, {\bf 6}(2)
323--350, June 1977, doi:10.1137/0206024.",
}
@TechReport{Knuth:1974:AAB,
author = "Donald E. Knuth and Ronald W. Moore",
title = "An Analysis of Alpha--Beta Pruning",
type = "Technical Report",
number = "STAN-CS-74-441 (AD-A000 284)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "64",
month = jul,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/citations/tr/ADA000284;
https://kodu.ut.ee/~ahto/eio/2011.07.11/ab.pdf",
abstract = "The alpha--beta technique for searching game trees is
analyzed, in an attempt to provide some insight into
its behavior. The first portion of this paper is an
expository presentation of the method together with a
proof of its correctness and a historical discussion.
The alpha--beta procedure is shown to be optimal in a
certain sense, and bounds are obtained for its running
time with various kinds of random data.",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Artificial Intelligence}, {\bf
6}(4) 293--326, 1975.
doi:10.1016/0004-3702(75)90019-3",
}
@TechReport{Knuth:1974:EEB,
author = "Donald E. Knuth",
title = "Estimating the efficiency of backtrack programs",
type = "Technical Report",
number = "STAN-CS-74-442 (AD-A004 208)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 29",
month = aug,
year = "1974",
MRclass = "68A20 05-04 O5A15 65005 90B99",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lehmer-derrick-henry.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Dedicated to Derrich H. Lehmer on his 70th birthday,
February 32, 1975.",
URL = "http://i.stanford.edu/TR/CS-TR-74-442.html;
http://www-db.stanford.edu/TR/CS-TR-74-442.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-74-442",
abstract = "One of the chief difficulties associated with the
so-called backtracking technique for combinatorial
problems has been our inability to predict the
efficiency of a given algorithm, or to compare the
efficiencies of different approaches, without actually
writing and running the programs. This paper presents a
simple method which produces reasonable estimates for
most applications, requiring only a modest amount of
hand calculation. The method should prove to be of
considerable utility in connection with D. H. Lehmer's
branch-and-bound approach to combinatorial
optimization.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-74-442",
keywords = "analysis of algorithms; backtrack; branch and bound;
color cubes; Instant Insanity; knight's |tours; Monte
Carlo method; tree functions",
pdfpages = "34",
remark = "Published in \booktitle{Mathematics of Computation},
{\bf 29}(129) 121--136, January 1975",
xxnumber = "CS-TR-74-442",
}
@TechReport{Brotz:1974:EHP,
author = "Douglas K. Brotz",
title = "Embedding Heuristic Problem Solving Methods in a
Mechanical Theorem Prover",
type = "Technical Report",
number = "STAN-CS-74-443 (PB-236 471/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "107",
month = jul,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Green:1974:PRP,
author = "C. Cordell Green and Richard J. Waldinger and David R.
Barstow and Robert A. Elschlager and Douglas B. Lenat
and Brian P. McCune and David E. Shaw and Louis I.
Steinberg",
title = "Progress report on program-understanding systems",
type = "Technical Report",
number = "STAN-CS-74-444 (AIM-240, AD787035)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = jul,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-444.html",
abstract = "This progress report covers the first year and one
half of work by our automatic-programming research
group at the Stanford Artificial Intelligence
Laboratory. Major emphasis has been placed on methods
of program specification, codification of programming
knowledge, and implementation of pilot systems for
program writing and understanding. List processing has
been used as the general problem domain for this
work.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-74-444",
}
@TechReport{Friedman:1974:REA,
author = "J. H. Friedman and F. Baskett and L. J. Shustek",
title = "A Relatively Efficient Algorithm for Finding Nearest
Neighbors",
type = "Technical Report",
number = "STAN-CS-74-445 (SLACP-1448)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Aiello:1974:LIL,
author = "Luigia Aiello and Richard W. Weyhrauch",
title = "{LCFsmall}: an implementation of {LCF}",
type = "Technical Report",
number = "STAN-CS-74-446 (AIM-241, AD786723)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 45",
month = aug,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-446.html",
abstract = "This is a report on a computer program implementing a
simplified version of LCF. It is written (with minor
exceptions) entirely in pure LISP and has none of the
user oriented features of the implementation described
by Milner. We attempt to represent directly in code the
metamathematical notions necessary to describe LCF. We
hope that the code is simple enough and the
metamathematics is clear enough so that properties of
this particular program (e.g. its correctness) can
eventually be proved. The program is reproduced in
full.",
acknowledgement = ack-nhfb,
pdfpages = "49",
xxnumber = "CS-TR-74-446",
}
@TechReport{Aiello:1974:SPL,
author = "Luigia Aiello and Mario Aiello and Richard W.
Weyhrauch",
title = "The semantics of {PASCAL} in {LCF}",
type = "Technical Report",
number = "STAN-CS-74-447 (AIM-221, AD787631)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-447.html",
abstract = "We define a semantics for the arithmetic part of
PASCAL by giving it an interpretation in LCF, a
language based on the typed $ \lambda $-calculus.
Programs are represented in terms of their abstract
syntax. We show sample proofs, using LCF, of some
general properties of PASCAL and the correctness of
some particular programs. A program implementing the
McCarthy Airline reservation system is proved
correct.",
acknowledgement = ack-nhfb,
pdfpages = "82",
xxnumber = "CS-TR-74-447",
}
@TechReport{Goldfarb:1974:MFO,
author = "D. Goldfarb",
title = "Matrix Factorizations in Optimization of Nonlinear
Functions Subject to Linear Constraints",
type = "Technical Report",
number = "STAN-CS-74-448 (SU326 P30-33)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Smith:1974:PAC,
author = "A. Smith",
title = "Performance Analysis of Computer Systems Components",
type = "Technical Report",
number = "STAN-CS-74-449 (CSL-TR-89, AD785027)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "323",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Baskett:1974:IMC,
author = "F. Baskett and A. J. Smith",
title = "Interference in Multiprocessor Computer Systems with
Interleaved Memory",
type = "Technical Report",
number = "STAN-CS-74-450 (CSL-TR-90, AD787008)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is Chapter 3 of the author's thesis.",
}
@TechReport{Smith:1974:MWS,
author = "A. Smith",
title = "A Modified Working Set Paging Algorithm",
type = "Technical Report",
number = "STAN-CS-74-451 (CSL-TR-91, AD786999)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = oct,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is Chapter 5 of the author's thesis.",
}
@TechReport{Low:1974:ACC,
author = "J. R. Low",
title = "Automatic Coding: Choice of Data Structures",
type = "Technical Report",
number = "STAN-CS-74-452 (AIM-242, AD-A000 500)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "110",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1974:RM,
author = "Donald E. Knuth",
title = "Random Matroids",
type = "Technical Report",
number = "STAN-CS-74-453 (AD-A000 034)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/html/tr/ADA000084/",
abstract = "A simple combinatorial construction capable of
producing an arbitrary matroid is introduced, and some
of its properties are investigated. The structure of a
matroid is defined one rank at a time, and when random
choices are made the result might be called a random
matroid. Some experimental statistics about such
matroids are tabulated. If the subsets of rank $ \leq k
$ are specified, the construction defines a rank
function having the richest possible matroid structure
on the remaining subsets, in the sense that no new
relationships are introduced except those implied by
the given subsets of rank $ \leq k $. An appendix to
this paper presents several computer programs for
dealing with matroids over small sets.",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Discrete Mathematics}, {\bf
12}(4) 341--358, 1975.
doi:10.1016/0012-365X(75)90075-8",
}
@TechReport{Jennings:1974:CAS,
author = "L. S. Jennings",
title = "A Computational Approach to Simultaneous Estimation",
type = "Technical Report",
number = "STAN-CS-74-454 (SU326 P30-35)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = sep,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tarjan:1974:EDS,
author = "Robert Endre Tarjan",
title = "Edge-disjoint spanning trees, dominators, and
depth-first search",
type = "Technical Report",
number = "STAN-CS-74-455 (AD-A000 083)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = sep,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-455.html",
abstract = "This paper presents an algorithm for finding two
edge-disjoint spanning trees rooted at a fixed vertex
of a directed graph. The algorithm uses depth-first
search, an efficient method for computing disjoint set
unions, and an efficient method for computing
dominators. It requires $ O(V \log V + E) $ time and $
O(V + E) $ space to analyze a graph with $V$ vertices
and $E$ edges.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-74-455",
}
@TechReport{Finkel:1974:APS,
author = "Raphael A. Finkel and Russell H. Taylor and Robert C.
Bolles and Richard P. Paul and Jerome A. Feldman",
title = "{AL}, a programming system for automation",
type = "Technical Report",
number = "STAN-CS-74-456 (AIM-243, AD-A003 815)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-456.html",
abstract = "AL is a high-level programming system for
specification of manipulatory tasks such as assembly of
an object from parts. AL includes an ALGOL-like source
language, a translator for converting programs into
runnable code, and a runtime system for controlling
manipulators and other devices. The system includes
advanced features for describing individual motions of
manipulators, for using sensory information, and for
describing assembly algorithms in terms of common
domain-specific primitives. This document describes the
design of AL, which is currently being implemented as a
successor to the Stanford WAVE system.",
acknowledgement = ack-nhfb,
pdfpages = "139",
xxnumber = "CS-TR-74-456",
}
@TechReport{Colby:1974:TCP,
author = "Kenneth Mark Colby",
title = "Ten criticisms of {PARRY}",
type = "Technical Report",
number = "STAN-CS-74-457 (AIM-244)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-457.html",
abstract = "Some major criticisms of a computer simulation of
paranoid processes (PARRY) are reviewed and
discussed.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-74-457",
}
@TechReport{Buchanan:1974:SAP,
author = "J. Buchanan",
title = "A Study in Automatic Programming",
type = "Technical Report",
number = "STAN-CS-74-458 (AIM-245, AD784816)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = oct,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Winograd:1974:FLA,
author = "Terry A. Winograd",
title = "Five Lectures on Artificial Intelligence",
type = "Technical Report",
number = "STAN-CS-74-459 (AIM-246, AD-A000 085)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "95",
month = oct,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Porter:1974:RIP,
author = "Thomas Porter and Istvan Simon",
title = "Random insertion into a priority queue structure",
type = "Technical Report",
number = "STAN-CS-74-460 (PB238148/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = oct,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-460.html",
abstract = "The average number of levels that a new element moves
up when inserted into a heap is investigated. Two
probabilistic models, under which such an average might
be computed are proposed. A `lemma of conservation of
ignorance' is formulated and used in the derivation of
an exact formula for the average in one of these
models. It is shown that this average is bounded by a
constant and its asymptotic behavior is discussed.
Numerical data for the second model is also provided
and analyzed.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-74-460",
}
@TechReport{Goldman:1974:CGN,
author = "N. M. Goldman",
title = "Computer Generation of Natural Language from a Deep
Conceptual Base",
type = "Technical Report",
number = "STAN-CS-74-461 (AIM-247, AD-A005 041)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "316",
month = oct,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Baumgart:1974:GMC,
author = "Bruce Baumgart",
title = "Geometric Modeling for Computer Vision",
type = "Technical Report",
number = "STAN-CS-74-463 (AIM-249, AD-A002 261)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = nov,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Nevatia:1974:SDC,
author = "Ramakant Nevatia",
title = "Structured Descriptions of Complex Curved Objects for
Recognition and Visual Memory",
type = "Technical Report",
number = "STAN-CS-74-464 (AIM-250, AD-A003 488)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "125",
month = nov,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shortliffe:1974:MRB,
author = "E. H. Shortliffe",
title = "{MYCIN}: a Rule-Based Computer Program for Advising
Physicians Regarding Antimicrobial Therapy Selection",
type = "Technical Report",
number = "STAN-CS-74-465 (AIM-251, AD-A001 373)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "409",
month = nov,
year = "1974",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Earnest:1974:RRA,
author = "Lester D. Earnest and John McCarthy and Edward A.
Feigenbaum and Joshua Lederberg and Vinton G. Cerf",
title = "Recent research in artificial intelligence, heuristic
programming, and network protocols",
type = "Technical Report",
number = "STAN-CS-74-466 (AIM-252, AD-A002 246)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "79",
month = jul,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-466.html",
abstract = "This is a progress report for ARPA-sponsored research
projects in computer science for the period July 1973
to July 1974. Accomplishments are reported in
artificial intelligence (especially heuristic
programming, robotics, theorem proving, automatic
programming, and natural language understanding),
mathematical theory of computation, and protocol
development for computer communication networks.
References to recent publications are provided for each
topic.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
pdfpages = "80",
xxnumber = "CS-TR-74-466",
}
@TechReport{Aiello:1974:CPM,
author = "Mario Aiello and Richard W. Weyhrauch",
title = "Checking proofs in the metamathematics of first order
logic",
type = "Technical Report",
number = "STAN-CS-74-467 (AIM-222, AD-A007 562)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 51",
month = aug,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-467.html",
abstract = "This is a report on some of the first experiments of
any size carried out using the new first order proof
checker FOL. We present two different first order
axiomatizations of the metamathematics of the logic
which FOL itself checks and show several proofs using
each one. The difference between the axiomatizations is
that one defines the metamathematics in a many sorted
logic, the other does not.",
acknowledgement = ack-nhfb,
pdfpages = "59",
xxnumber = "CS-TR-74-467",
}
@TechReport{Krogdahl:1974:CBS,
author = "Stein Krogdahl",
title = "A combinatorial base for some optimal matroid
intersection algorithms",
type = "Technical Report",
number = "STAN-CS-74-468 (AD-A003 832)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "55",
month = nov,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-468.html",
abstract = "E. Lawler has given an algorithm for finding maximum
weight intersections for a pair of matroids, using
linear programming concepts and constructions to prove
its correctness. In this paper another theoretical base
for this algorithm is given which depends only on the
basic properties of matroids, and which involves no
linear programming concepts.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-74-468",
}
@TechReport{Brown:1974:MSE,
author = "Harold Brown",
title = "Molecular structure elucidation {III}",
type = "Technical Report",
number = "STAN-CS-74-469",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-469.html",
abstract = "A computer implemented algorithm to solve the
following graph theoretical problem is presented: given
the empirical formula for a molecule and one or more
non-overlapping substructural fragments of the
molecule, determine all the distinct molecular
structures based on the formula and containing the
fragments. That is, given a degree sequence of labeled
nodes and one or more connected multigraphs, determine
a representative set of the isomorphism classes of the
connected multigraphs based on the degree sequence and
containing the given multi-graphs as non-overlapping
subgraphs.",
acknowledgement = ack-nhfb,
pdfpages = "39",
xxnumber = "CS-TR-74-469",
}
@TechReport{TrabbPardo:1974:SSM,
author = "Luis {Trabb Pardo}",
title = "Stable sorting and merging with optimal space and time
bounds",
type = "Technical Report",
number = "STAN-CS-74-470",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 74",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/74/470/CS-TR-74-470.pdf;
http://i.stanford.edu/TR/CS-TR-74-470.html",
abstract = "This work introduces two algorithms for stable merging
and stable sorting of files.\par
The algorithms have optimal worst case time bounds, the
merge is linear and the sort is of order $ n \log n $.
Extra storage requirements are also optimal, since both
algorithms make use of a fixed number of pointers.
Files are handled only by means of the primitives
exchange and comparison of records and basic pointer
transformations.",
acknowledgement = ack-nhfb,
pdfpages = "78",
xxnumber = "CS-TR-74-470",
}
@TechReport{Faught:1974:IIA,
author = "William S. Faught and Kenneth Mark Colby and Roger C.
Parkison",
title = "The interaction of inferences, affects, and
intentions, in a model of paranoia",
type = "Technical Report",
number = "STAN-CS-74-471 (AIM-253, AD-A003 487)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-471.html",
abstract = "The analysis of natural language input into its
underlying semantic content is but one of the tasks
necessary for a system (human or non-human) to use
natural language. Responding to natural language input
requires performing a number of tasks: (1) deriving
facts about the input and the situation in which it was
spoken; (2) attending to the system's needs, desires,
and interests; (3) choosing intentions to fulfill these
interests; (4) deriving and executing actions from
these intentions. We describe a series of processes in
a model of paranoia which performs these tasks. We also
describe the modifications made by the paranoid
processes to the normal processes. A computer program
has been constructed to test this theory.",
acknowledgement = ack-nhfb,
pdfpages = "39",
xxnumber = "CS-TR-74-471",
}
@TechReport{Quam:1974:SAP,
author = "Lynn H. Quam and Marsha Jo Hannah",
title = "{Stanford} automatic photogrammetry research",
type = "Technical Report",
number = "STAN-CS-74-472 (AIM-254, AD-A005 407)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-472.html",
abstract = "This report documents the feasibility study done at
Stanford University's Artificial Intelligence
Laboratory on the problem of computer automated
aerial/orbital photogrammetry. The techniques
investigated were based on correlation matching of
small areas in digitized pairs of stereo images taken
from high altitude or planetary orbit, with the
objective of deriving a 3-dimensional model for the
surface of a planet.",
acknowledgement = ack-nhfb,
pdfpages = "17",
xxnumber = "CS-TR-74-472",
}
@TechReport{Suzuki:1974:APV,
author = "Norihisa Suzuki",
title = "Automatic program verification {II}: verifying
programs by algebraic and logical reduction",
type = "Technical Report",
number = "STAN-CS-74-473 (AIM-255, AD-A005 412)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-473.html",
abstract = "Methods for verifying programs written in a higher
level programming language are devised and implemented.
The system can verify programs written in a subset of
PASCAL, which may have data structures and control
structures such as WHILE, REPEAT, FOR, PROCEDURE,
FUNCTION and COROUTINE. The process of creation of
verification conditions is an extension of the work
done by Igarashi, London and Luckham which is based on
the deductive theory by Hoare. Verification conditions
are proved using specialized simplification and proof
techniques, which consist of an arithmetic simplifier,
equality replacement rules, fast algorithm for
simplifying formulas using propositional truth value
evaluation, and a depth first proof search process. The
basis of deduction mechanism used in this prover is
Gentzen-type formal system. Several sorting programs
including Floyd's TREESORT3 and Hoare's FIND are
verified. It is shown that the resulting array is not
only well-ordered but also a permutation of the input
array.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-74-473",
}
@TechReport{vonHenke:1974:APV,
author = "Friedrich W. von Henke and David C. Luckham",
title = "Automatic program verification {III}: a methodology
for verifying programs",
type = "Technical Report",
number = "STAN-CS-74-474 (AIM-256, AD-A007 563)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = dec,
year = "1974",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-474.html",
abstract = "The paper investigates methods for applying an on-line
interactive verification system designed to prove
properties of PASCAL programs. The methodology is
intended to provide techniques for developing a
debugged and verified version starting from a program,
that (a) is possibly unfinished in some respects, (b)
may not satisfy the given specifications, e.g., may
contain bugs, (c) may have incomplete documentation,
(d) may be written in non-standard ways, e.g., may
depend on user-defined data structures. The methodology
involves (i) interactive application of a verification
condition generator, an algebraic simplifier and a
theorem-prover; (ii) techniques for describing data
structures, type constraints, and properties of
programs and subprograms (i.e. lower level procedures);
(iii) the use of (abstract) data types in structuring
programs and proofs. Within each unit (i.e. segment of
a problem), the interactive use is aimed at reducing
verification conditions to manageable proportions so
that the non-trivial factors may be analysed. Analysis
of verification conditions attempts to localize errors
in the program logic, to extend assertions inside the
program, to spotlight additional assumptions on program
subfunctions (beyond those already specified by the
programmer), and to generate appropriate lemmas that
allow a verification to be completed. Methods for
structuring correctness proofs are discussed that are
similar to those of `structured programming'. A
detailed case study of a pattern matching algorithm
illustrating the various aspects of the methodology
(including the role played by the user) is given.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-74-474",
}
@TechReport{Newey:1975:FSL,
author = "M. C. Newey",
title = "Formal Semantics of {LISP} with Applications to
Program Correctness",
type = "Technical Report",
number = "STAN-CS-75-475 (AIM-257, AD-A005 413)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "184",
month = jan,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pingle:1975:FFD,
author = "Karl K. Pingle and Arthur J. Thomas",
title = "A fast, feature-driven stereo depth program",
type = "Technical Report",
number = "STAN-CS-74-462 (AIM-248)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 17",
month = may,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-74-462.html",
abstract = "In this paper we describe a fast, feature-driven
program for extracting depth information from
stereoscopic sets of digitized TV images. This is
achieved by two means: in the simplest case, by
statistically correlating variable-sized windows on the
basis of visual texture, and in the more complex case
by pre-processing the images to extract significant
visual features such as corners, and then using these
features to control the correlation process.\par
The program runs on the PDP-10 but uses a PDP-11/45 and
an SPS-41 Signal Processing Computer as subsidiary
processors. The use of the two small, fast machines for
the performance of simple but often-repeated
computations effects an increase in speed sufficient to
allow us to think of using this program as a fast
3-dimensional segmentation method, preparatory to more
complex image processing. It is also intended for use
in visual feedback tasks involved in hand-eye
coordination and automated assembly. The current
program is able to calculate the three-dimensional
positions of 10 points to within 5 millimeters, using 5
seconds of computation for extracting features, 1
second per image for correlation, and 0.1 second for
the depth calculation.",
acknowledgement = ack-nhfb,
pdfpages = "23",
xxnumber = "CS-TR-74-462",
}
@TechReport{Green:1975:HDE,
author = "C. Cordell Green and David R. Barstow",
title = "A hypothetical dialogue exhibiting a knowledge base
for a program-understanding system",
type = "Technical Report",
number = "STAN-CS-75-476 (AIM-258, AD-A006 294)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = jan,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-476.html",
abstract = "A hypothetical dialogue with a fictitious
program-understanding system is presented. In the
interactive dialogue the computer carries out a
detailed synthesis of a simple insertion sort program
for linked lists. The content, length and complexity of
the dialogue reflect the underlying programming
knowledge which would be required for a system to
accomplish this task. The nature of the knowledge is
discussed and the codification of such programming
knowledge is suggested as a major research area in the
development of program-understanding systems.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-75-476",
}
@TechReport{Chvatal:1975:LCS,
author = "Vaclav Chv{\'a}tal and David Sankoff",
title = "Longest common subsequences of two random sequences",
type = "Technical Report",
number = "STAN-CS-75-477",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-477.html",
abstract = "Given two random $k$-ary sequences of length $n$, what
is $ f(n, k)$, the expected length of their longest
common subsequence? This problem arises in the study of
molecular evolution. We calculate $ f(n, k)$ for all
$k$, where $ n \leq 5$, and $ f(n, 2)$ where $ n \leq
10$. We study the limiting behavior of $ n^{-1} f(n,
k)$ and derive upper and lower bounds on these limits
for all $k$. Finally we estimate by Monte-Carlo methods
$ f(100, k)$, $ f(1000, 2)$ and $ f(5000, 2)$.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-75-477",
}
@TechReport{Golub:1975:ICE,
author = "Gene H. Golub and James H. Wilkinson",
title = "Ill-Conditioned Eigensystems and the Computation of
the {Jordan} Canonical Form",
type = "Technical Report",
number = "STAN-CS-75-478 (SU326 P30-36)8",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "66",
month = feb,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Published as \cite{Golub:1976:ICE}.",
URL = "http://i.stanford.edu/TR/CS-TR-75-478.html",
abstract = "The solution of the complete eigenvalue problem for a
non-normal matrix A presents severe practical
difficulties when A is defective or close to a
defective matrix. However in the presence of rounding
errors one cannot even determine whether or not a
matrix is defective. Several of the more stable methods
for computing the Jordan canonical form are discussed
together with the alternative approach of computing
well-defined bases (usually orthogonal) of the relevant
invariant subspaces.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); James H. Wilkinson (27 September 1919--5 October
1986)",
pdfpages = "38",
xxnumber = "CS-TR-75-478",
}
@TechReport{Chatelin:1975:EBA,
author = "Fran{\c{c}}ois Chatelin and J. Lemordant",
title = "Error bounds in the approximation of eigenvalues of
differential and integral operators",
type = "Technical Report",
number = "STAN-CS-75-479 (SU326 P30-38)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = feb,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-479.html",
abstract = "Various methods of approximating the eigenvalues and
invariant subspaces of nonself-adjoint differential and
integral operators are unified in a general theory.
Error bounds are given, from which most of the error
bounds in the literature can be derived.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-75-479",
}
@TechReport{Knuth:1975:NGD,
author = "Donald E. Knuth",
title = "Notes on Generalized {Dedekind} Sums",
type = "Technical Report",
number = "STAN-CS-75-480 (A008804)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = feb,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://matwbn.icm.edu.pl/ksiazki/aa/aa33/aa3341.pdf;
https://apps.dtic.mil/sti/pdfs/ADA008804.pdf",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Acta Arithmetica}, {\bf 33}(4)
297--325, 1975.",
xxabstract = "Generalized Dedekind sums sigma h,k,c have proved to
be useful in connection with the analysis of linear
congruential random number generators. This paper
introduces a simple algorithm for the calculation of
generalized Dedekind sums using only integer
arithmetic. A second algorithm, for calculating the
value of $c$ which maximizes or minimizes sigma h,k,c
when $h$ and $k$ are given, is used to deduce optimal a
priori bounds on sigma h,k,c. Finally the reciprocity
law for Dedekind sums is shown to be a consequence of a
much more general reciprocity law.",
}
@TechReport{Oliger:1975:HDM,
author = "Joseph E. Oliger",
title = "Hybrid difference methods for the initial
boundary-value problem for hyperbolic equations",
type = "Technical Report",
number = "STAN-CS-75-481 (SU326 P30-39)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = feb,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-481.html",
abstract = "The use of lower order approximations in the
neighborhood of boundaries coupled with higher order
interior approximations is examined for the mixed
initial boundary-value problem for hyperbolic partial
differential equations. Uniform error can be maintained
using smaller grid intervals with the lower order
approximations near the boundaries. Stability results
are presented for approximations to the initial
boundary-value problem for the model equation $ u_t $ +
$ {cu}_x $ = O which are fourth order in space and
second order in time in the interior and second order
in both space and time near the boundaries. These
results are generalized to a class of methods of this
type for hyperbolic systems. Computational results are
presented and comparisons are made with other
methods.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-75-481",
}
@TechReport{Friedman:1975:AFB,
author = "J. A. Friedman and J. L. Bentley and R. A. Finkel",
title = "An Algorithm for Finding Best Matches in Logarithmic
Time",
type = "Technical Report",
number = "STAN-CS-75-482 (SLACP-1549)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = mar,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Erdos:1975:PSE,
author = "Paul Erd{\H{o}}s and Ronald L. Graham",
title = "On packing squares with equal squares",
type = "Technical Report",
number = "STAN-CS-75-483 (AD-A011 835)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = mar,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-483.html",
abstract = "The following problem arises in connection with
certain multi-dimensional stock cutting problems: How
many non-overlapping open unit squares may be packed
into a large square of side {$ \alpha $}? Of course, if
$ \alpha $ is a positive integer, it is trivial to see
that unit squares ean be successfully packed. However,
if $ \alpha $ is not an integer, the problem becomes
much more complicated. Intuitively, one feels that for
$ \alpha $ = N + 1/100, say, (where N is an integer),
one should pack $ N^2 $ unit squares in the obvious way
and surrender the uncovered border area (which is about
$ \alpha $ /50) as unusable waste. After all, how could
it help to place the unit squares at all sorts of
various skew angles? In this note, we show how it
helps. In particular, we prove that we can always keep
the amount of uncovered area down to at most
proportional to $ {\alpha }^{7 / 11} $, which for large
$ \alpha $ is much less than the linear waste produced
by the `natural' packing above.",
acknowledgement = ack-nhfb,
author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996);
Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "9",
xxnumber = "CS-TR-75-483",
}
@TechReport{Graham:1975:SNI,
author = "Ronald L. Graham and Endre Szemer{\'e}di",
title = "On subgraph number independence in trees",
type = "Technical Report",
number = "STAN-CS-75-484 (AD-A011 832)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = mar,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-484.html",
abstract = "For finite graphs $F$ and $G$, let $ N_F (G) $ denote
the number of occurrences of $F$ in $G$, i.e., the
number of subgraphs of $G$ which are isomorphic to $F$.
If $ {\cal F} $ and $ {\cal G} $ are families of
graphs, it is natural to ask them whether or not the
quantities $ N_F (G)$, $ F \in {\cal F} $, are linearly
independent when $G$ is restricted to $ {\cal G} $. For
example, if $ {\cal F} = \{ K_1, K_2 \} $ (where $ K_n
$ denotes the complete graph on $n$ vertices) and $
{\cal G} $ is the family of all (finite) $ \underline
{\rm trees} $ then of course $ N_{K_1} (T) - N_{K_2}
(T) = 1 $ for all $ T \in {\cal G} $. Slightly less
trivially, if $ {\cal F} = \{ S_n : n = 1, 2, 3, \ldots
{} \} $ (where $ S_n $ denotes the $ \underline {\rm
star} $ on $n$ edges) and $ {\cal G}$ again is the
family of all trees then $ \sum_{n - 1}^{\infty } {( -
1)}^{n + 1} N_{S_n} (T) = 1 {\rm forall} T \in {\cal
G}$. It will be proved that such a linear dependence
can $ \underline {\rm never}$ occur if $ {\cal F}$ is
finite, no $ F \in {\cal F}$ has an isolated point and
$ {\cal G}$ contains all trees. This result has
important applications in recent work of L. Lovasz and
one of the authors.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "19",
xxnumber = "CS-TR-75-484",
}
@TechReport{Erdos:1975:MRI,
author = "Paul Erd{\H{o}}s and Endre Szemer{\'e}di",
title = "On multiplicative representations of integers",
type = "Technical Report",
number = "STAN-CS-75-485 (AD-A011 834)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = mar,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-485.html",
abstract = "In 1969 it was shown by P. Erd{\H{o}}s that if $ 0 <
a_1 < a_2 < \cdots {} < a_k \leq x $ is a sequence of
integers for which the products $ a_i a_j $ are all
distinct then the maximum possible value of k satisfies
$ \pi (x) + c_2 x^{3 / 4} / {(\log x)}^{3 / 2} < m a x
k < \pi (x) + c_1 x^{3 / 4} / (\log x)^{3 / 2} $ where
$ \pi (x) $ denotes the number of primes not exceeding
$x$ and $ c_1 $ and $ c_2 $ are absolute constants. In
this paper we will be concerned with similar results of
the following type. Suppose $ 0 < a_1 < \cdots {} < a_k
\leq x $, $ 0 < b_1 < \cdots {} < b_\ell \leq x $ are
sequences of integers. Let $ g(n)$ denote the number of
representations of $n$ in the form $ a_i b_j $. Then we
prove: (i) If $ g(n) \leq 1$ for all $n$ then for some
constant $ c_3 $, $ k \ell < c_3 x^2 / \log x$. (ii)
For every $c$ there is an $ f(c) $ so that if $ g(n)
\leq c$ for all $n$ then for some constant $ c_4, k
\ell < c_4 x^2 / \log x {(\log = \log x)}^{f(c)}$.",
acknowledgement = ack-nhfb,
author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996)",
pdfpages = "19",
xxnumber = "CS-TR-75-485",
}
@TechReport{Bjorck:1975:EMA,
author = "{\AA}ke Bj{\"o}rck and Gene H. Golub",
title = "Eigenproblems for matrices associated with periodic
boundary conditions",
type = "Technical Report",
number = "STAN-CS-75-486 (SU326 P30-37)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = mar,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-486.html",
abstract = "A survey of algorithms for solving the eigenproblem
for a class of matrices of nearly tridiagonal form is
given. These matrices arise from eigenvalue problems
for differential equations where the solution is
subject to periodic boundary conditions. Algorithms
both for computing selected eigenvalues and
eigenvectors and for solving the complete eigenvalue
problem are discussed.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "22",
xxnumber = "CS-TR-75-486",
}
@TechReport{Friedman:1975:VMD,
author = "J. H. Friedman",
title = "A Variable Metric Decision Rule for {NonParametric}
Classification",
type = "Technical Report",
number = "STAN-CS-75-487 (SLACP-1573)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = apr,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bollabas:1975:CSC,
author = "Bela Bollabas and Paul Erd{\H{o}}s and Endre
Szemer{\'e}di",
title = "On complete subgraphs of $r$-chromatic graphs",
type = "Technical Report",
number = "STAN-CS-75-488 (AD-A011 445)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = apr,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-488.html",
abstract = "Denote by $ G(p, q) $ a graph of $p$ vertices and $q$
edges. $ K_r = G(r, (^r_2))$ is the complete graph with
$r$ vertices and $ K_r$ (t) is the complete $r$
chromatic (i.e., $r$-partite) graph with $t$ vertices
in each color class. $ G_r(n)$ denotes an $r$-chromatic
graph, and $ \delta (G)$ is the minimal degree of a
vertex of graph $G$. Furthermore denote by $ f_r(n)$
the smalleest integer so that every $ G_r(n)$ with $
\delta G_r(n) > f_r(n)$ contains a $ K_r$. It is easy
to see that $ \lim_{n \rightarrow \infty } f_r (n) / n
= c_r$ exists. We show that $ c_4 \geq 2 + 1 / 9$ and $
c_r \geq r - 2 + 1 / 2 - \frac {1}{2(r - 2)}$ for $ r >
4$. We prove that if $ \delta G_3 (n) \geq n + t$ then
$G$ contains at least $ t^3$ triangles but does not
have to contain more than $ 4 t^3$ of them.",
acknowledgement = ack-nhfb,
author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996)",
pdfpages = "17",
xxnumber = "CS-TR-75-488",
}
@TechReport{Szemeredi:1975:RPG,
author = "Endre Szemer{\'e}di",
title = "Regular partitions of graphs",
type = "Technical Report",
number = "STAN-CS-75-489 (AD-A011 833)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = apr,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-489.html",
abstract = "A crucial lemma in recent work of the author (showing
that k-term arithmetic progression-free sets of
integers must have density zero) stated (approximately)
that any large bipartite graph can be decomposed into
relatively few `nearly regular' bipartite subgraphs. In
this note we generalize this result to arbitrary
graphs, at the same time strengthening and simplifying
the original bipartite result.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-75-489",
}
@TechReport{Gosper:1975:NES,
author = "R. William Gosper",
title = "Numerical experiments with the spectral test",
type = "Technical Report",
number = "STAN-CS-75-490 (AD-A014 429)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = may,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/m/marsaglia-george.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-490.html",
abstract = "Following Marsaglia and Dieter, the spectral test for
linear congruential random number generators is
developed from the grid or lattice point model rather
than the Fourier transform model. Several modifications
to the published algorithms were tried. One of these
refinements, which uses results from lesser dimensions
to compute higher dimensional ones, was found to
decrease the computation time substantially. A change
in the definition of the spectral test is proposed in
the section entitled `A Question of Independence.'",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-75-490",
}
@TechReport{Knott:1975:DBS,
author = "G. D. Knott",
title = "Deletion in Binary Storage Trees",
type = "Technical Report",
number = "STAN-CS-75-491",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "93",
month = may,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Sedgewick:1975:Q,
author = "Robert Sedgewick",
title = "Quicksort",
type = "Technical Report",
number = "STAN-CS-75-492",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "352",
month = may,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kurki-Suonio:1975:DAT,
author = "Reino Kurki-Suonio",
title = "Describing automata in terms of languages associated
with their peripheral devices",
type = "Technical Report",
number = "STAN-CS-75-493 (PB244421/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = may,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-493.html",
abstract = "A unified approach is presented to deal with automata
having different kinds of peripheral devices. This
approach is applied to pushdown automata and Turing
machines, leading to elementary proofs of several
well-known theorems concerning transductions,
relationship between pushdown automata and context-free
languages, as well as homomorphic characterization and
undecidability questions. In general, this approach
leads to homomorphic characterization of language
families generated by a single language by finite
transduction.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-75-493",
}
@TechReport{Satterthwaite:1975:SLD,
author = "E. H. {Satterthwaite, Jr.}",
title = "Source Language Debugging Tools",
type = "Technical Report",
number = "STAN-CS-75-494",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "345",
month = may,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Krogdahl:1975:DGB,
author = "S. Krogdahl",
title = "The Dependence Graph for Bases in Matroids",
type = "Technical Report",
number = "STAN-CS-75-495 (AD-A014 424)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = may,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Underwood:1975:IBL,
author = "Richard Ray Underwood",
title = "An Iterative Block {Lanczos} Method for the Solution
of Large Sparse Symmetric Eigenproblems",
type = "Technical Report",
number = "STAN-CS-75-496 (SU326 P30-41)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "133",
month = may,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://www.proquest.com/pqdtglobal/docview/302727419",
acknowledgement = ack-nhfb,
remark = "This is the author's Ph.D. thesis.",
subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
}
@TechReport{Graham:1975:DMT,
author = "Ronald L. Graham and L. Lovasz",
title = "Distance Matrices of Trees",
type = "Technical Report",
number = "STAN-CS-75-497 (AD-A016 825)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = aug,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
}
@TechReport{Samet:1975:APC,
author = "Hanan Samet",
title = "Automatically Proving the Correctness of Translations
Involving Optimized Code",
type = "Technical Report",
number = "STAN-CS-75-498 (AIM-259, AD-A017 025)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 214",
month = may,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-498.html",
abstract = "A formalism is described for proving that programs
written in a higher level language are correctly
translated to assembly language. In order to
demonstrate the validity of the formalism a system has
been designed and implemented for proving that programs
written in a subset of LISP 1.6 as the high level
language are correctly translated to LAP (an assembly
language for the PDP-10) as the low level language.
This work involves the identification of critical
semantic properties of the language and their
interrelationship to the instruction repertoire of the
computer executing these programs. A primary use of the
system is as a postoptimization step in code generation
as well as a compiler debugger.",
acknowledgement = ack-nhfb,
pdfpages = "222",
remark = "This is the author's thesis.",
xxnumber = "CS-TR-75-498",
}
@TechReport{Smith:1975:PCP,
author = "D. C. Smith",
title = "{PYGMALION}: a Creative Programming Environment",
type = "Technical Report",
number = "STAN-CS-75-499 (AIM-260)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "193",
month = aug,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kurki-Suonio:1975:TBS,
author = "Reino Kurki-Suonio",
title = "Towards better structured definitions of programming
languages",
type = "Technical Report",
number = "STAN-CS-75-500 (PB246708/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 29",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-500.html",
abstract = "The use of abstract syntax and a behavioral model is
discussed from the viewpoint of structuring the
complexity in definitions of programming languages. A
formalism for abstract syntax is presented which
reflects the possibility of having one defining
occurrence and an arbitrary number of applied
occurrences of objects. Attributes can be associated
with such a syntax for restricting the set of objects
generated, and for defining character string
representations and semantic interpretations for the
objects. A system of co-operating automata, described
by another abstract syntax, is proposed as a behavioral
model for semantic definition.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-75-500",
}
@TechReport{Pettersen:1975:PES,
author = "Odd Pettersen",
title = "Procedural events as software interrupts",
type = "Technical Report",
number = "STAN-CS-75-501 (AIM-261, AD-A016 810)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-501.html",
abstract = "The paper deals with procedural events, providing a
basis for synchronization and scheduling, particularly
applied on real-time program systems of multiple
parallel activities ('multi-task'). There is a great
need for convenient scheduling mechanisms for
minicomputer systems as used in process control, but so
far mechanisms somewhat similar to those proposed here
are found only in PL/I among the generally known
high-level languages. PL/I, however, is not very common
on computers of this size. Also, the mechanisms in PL/I
seem more restricted, as compared to those proposed
here. A new type of boolean program variable, the
EVENTMARK, is proposed. Eventmarks represent events of
any kind that may occur within a computational process
and are believed to give very efficient and convenient
activation and scheduling of program modules in a
real-time system. An eventmark is declared similar to a
procedure, and the proposed feature could easily be
amended as an extension to existing languages, as well
as incorporated in future language designs.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-75-501",
}
@TechReport{Pettersen:1975:SCP,
author = "Odd Pettersen",
title = "Synchronization of concurrent processes",
type = "Technical Report",
number = "STAN-CS-75-502 (AIM-262, AD-A016 808)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-502.html",
abstract = "The paper gives an overview of commonly used
synchronization primitives and literature, and presents
a new form of primitive expressing conditional critical
regions. A new solution is presented to the problem of
`readers and writers', utilizing the proposed
synchronization primitive. The solution is simpler and
shorter than other known algorithms. The first sections
of the paper give a tutorial introduction into
established methods, in order to provide a suitable
background for the remaining parts.",
acknowledgement = ack-nhfb,
pdfpages = "14",
xxnumber = "CS-TR-75-502",
}
@TechReport{Pettersen:1975:MPS,
author = "Odd Pettersen",
title = "The macro processing system {STAGE2}: transfer of
comments to the generated text",
type = "Technical Report",
number = "STAN-CS-75-503 (AIM-263, AD-A016 807)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-503.html",
abstract = "This paper is a short description of a small extension
of STAGE2, providing possibilities to copy comments
etc. from the source text to the generated text. The
description presupposes familiarity with the STAGE2
system: its purpose, use and descriptions. Only section
3 of this paper requires knowledge of the internal
structures and working of the system, and that section
is unnecessary for the plain use of the described
feature. The extension, if not used, is completely
invisible to the user: No rules, as described in the
original literature, are changed. A user, unaware of
the extension, will see no difference from the original
version.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-75-503",
}
@TechReport{Erdos:1975:SGD,
author = "Paul Erd{\H{o}}s and Ronald L. Graham and Endre
Szemer{\'e}di",
title = "On sparse graphs with dense long paths",
type = "Technical Report",
number = "STAN-CS-75-504 (AD-A017 370)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-504.html",
abstract = "The following problem was raised by H.-J. Stoss in
connection with certain questions related to the
complexity of Boolean functions. An acyclic directed
graph $G$ is said to have property $ P(m, n)$ if for
any set $X$ of $m$ vertices of $G$, there is a directed
path of length $n$ in $G$ which does not intersect $X$.
Let $ f(m, n)$ denote the minimum number of edges a
graph with property $ P(m, n)$ can have. The problem is
to estimate $ f(m, n)$. For the remainder of the paper,
we shall restrict ourselves to the case $ m = n$. We
shall prove (1) $ c_1 n \log n \log \log n < f(n, n) <
c_2 n \log n$ (where $ c_1 $, $ c_2 $, \ldots{}, will
hereafter denote suitable positive constraints). In
fact, the graph we construct in order to establish the
upper bound on $ f(n, n) $ in (1) will have just $ c_3
n $ vertices. In this case the upper bound in (1) is
essentially best possible since it will also be shown
that for $ c_4 $ sufficiently large, every graph on $
c_4 n $ vertices having property $ P(n, n)$ must have
at least $ c_5 n \log n $ edges.",
acknowledgement = ack-nhfb,
author-dates = "Paul Erd{\H{o}}s (26 March 1913--20 September 1996);
Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "15",
xxnumber = "CS-TR-75-504",
}
@TechReport{Chvatal:1975:SLP,
author = "Vaclav Chv{\'a}tal",
title = "Some linear programming aspects of combinatorics",
type = "Technical Report",
number = "STAN-CS-75-505 (AD-A017 053)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-505.html",
abstract = "This is the text of a lecture given at the Conference
on Algebraic Aspects of Combinatorics at the University
of Toronto in January 1975. The lecture was expository,
aimed at an audience with no previous knowledge of
linear programming.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-75-505",
}
@TechReport{Gordon:1975:ORD,
author = "Michael J. C. Gordon",
title = "Operational reasoning and denotational semantics",
type = "Technical Report",
number = "STAN-CS-75-506 (AIM-264, AD-A017 176)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-506.html",
abstract = "'Obviously true' properties of programs can be hard to
prove when meanings are specified with a denotational
semantics. One cause of this is that such a semantics
usually abstracts away from the running process - thus
properties which are obvious when one thinks about this
lose the basis of their obviousness in the absence of
it. To enable process-based intuitions to be used in
constructing proofs one can associate with the
semantics an abstract interpreter so that reasoning
about the semantics can be done by reasoning about
computations on the interpreter. This technique is used
to prove several facts about a semantics of pure LISP.
First a denotational semantics and an abstract
interpreter are described. Then it is shown that the
denotation of any LISP form is correctly computed by
the interpreter. This is used to justify an inference
rule - called `LlSP-induction' - which formalises
induction on the size of computations on the
interpreter. Finally LlSP-induction is used to prove a
number of results. In particular it is shown that the
function eval is correct relative to the semantics -
i.e. that it denotes a mapping which maps forms (coded
as S-expressions) on to their correct values.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-75-506",
}
@TechReport{Gordon:1975:TST,
author = "Michael J. C. Gordon",
title = "Towards a semantic theory of dynamic binding",
type = "Technical Report",
number = "STAN-CS-75-507 (AIM-265)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-507.html",
abstract = "The results in this paper contribute to the
formulation of a semantic theory of dynamic binding
(fluid variables). The axioms and theorems are language
independent in that they don't talk about programs -
i.e, syntactic objects - but just about elements in
certain domains. Firstly the equivalence (in the
circumstances where it's true) of `tying a knot'
through the environment (elaborated in the paper) and
taking a least fixed point is shown. This is central in
proving the correctness of LISP `eval' type
interpreters. Secondly the relation which must hold
between two environments if a program is to have the
same meaning in both is established. It is shown how
the theory can be applied to LISP to yield previously
known facts.",
acknowledgement = ack-nhfb,
pdfpages = "29",
xxnumber = "CS-TR-75-507",
}
@TechReport{Eve:1975:CTC,
author = "James Eve",
title = "On computing the transitive closure of a relation",
type = "Technical Report",
number = "STAN-CS-75-508",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-508.html",
abstract = "An algorithm is presented for computing the transitive
closure of an arbitrary relation which is based upon a
variant of Tarjan's algorithm [1972] for finding the
strongly connected components of a directed graph. This
variant leads to a more compact statement of Tarjan's
algorithm. If V is the number of vertices in the
directed graph representing the relation then the worst
case behavior of the proposed algorithm involves $
O(V^3) $ operations. In this respect it is inferior to
existing algorithms which require $ O(V^3 / \log V) $
and $ O(V^{\log_2 7} \log V) $ operations respectively.
The best case behavior involves only $ O(V^2) $
operations.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-75-508",
}
@TechReport{Overton:1975:FMI,
author = "Michael L. Overton and Andrzej Proskurowski",
title = "Finding the maximal incidence matrix of a large
graph",
type = "Technical Report",
number = "STAN-CS-75-509 (AD-A017 331)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-509.html",
abstract = "This paper deals with the computation of two canonical
representations of a graph. A computer program is
presented which searches for `the maximal incidence
matrix' of a large connected graph without multiple
edges or self-loops. The use of appropriate algorithms
and data structures is discussed.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-75-509",
}
@TechReport{Yao:1975:ASA,
author = "A. C. Yao and D. E. Knuth",
title = "Analysis of the Subtractive Algorithm for Greatest
Common Divisors",
type = "Technical Report",
number = "STAN-CS-75-510 (AD-A017 054)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = aug,
year = "1975",
DOI = "https://doi.org/10.1145/1093397.1093401",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://www.jstor.org/stable/65273;",
acknowledgement = ack-nhfb,
keywords = "Euclidean algorithm; greatest common divisor",
remark = "Published in \booktitle{Proceedings of the National
Academy of Sciences of the United States of America},
{\bf 72}(12) 4720--4722, December 1975.
doi:10.1145/1093397.1093401",
}
@TechReport{Dubost:1975:SIN,
author = "Pierre Dubost and Jean-Michel Trousse",
title = "Software implementation of a new method of
combinatorial hashing",
type = "Technical Report",
number = "STAN-CS-75-511 (AD-A017 294)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-511.html",
abstract = "This is a study of the software implementation of a
new method of searching with retrieval on secondary
keys. A new family of partial match file designs is
presented, the 'worst case' is determined, a detailed
algorithm and program are given and the average
execution time is studied.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-75-511",
}
@TechReport{Tarjan:1975:APC,
author = "Robert Endre Tarjan",
title = "Applications of path compression on balanced trees",
type = "Technical Report",
number = "STAN-CS-75-512 (PB247895/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-512.html",
abstract = "We devise a method for computing functions defined on
paths in trees. The method is based on tree
manipulation techniques first used for efficiently
representing equivalence relations. It has an
almost-linear running time. We apply the method to give
$ O(m \alpha (m, n)) $ algorithms for two problems. A.
Verifying a minimum spanning tree in an undirected
graph (best previous bound: $ O(m \log \log n) $). B.
Finding dominators in a directed graph (best previous
bound: $ O(n \log n + m) $). Here $n$ is the number of
vertices and $m$ the number of edges in the problem
graph, and $ \alpha (m, n) $ is a very slowly growing
function which is related to a functional inverse of
Ackermann's function. The method is also useful for
solving, in $ O(m \alpha (m, n)) $ time, certain kinds
of pathfinding problems on reducible graphs. Such
problems occur in global flow analysis of computer
programs and in other contexts. A companion paper will
discuss this application.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-75-512",
}
@TechReport{Bentley:1975:STF,
author = "Jon Louis Bentley",
title = "A survey of techniques for fixed radius near neighbor
searching",
type = "Technical Report",
number = "STAN-CS-75-513 (SLACR-186)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-513.html",
abstract = "This paper is a survey of techniques used for
searching in a multidimensional space. Though we
consider specifically the problem of searching for
fixed radius near neighbors (that is, all points within
a fixed distance of a given point), the structures
presented here are applicable to many different search
problems in multidimensional spaces. The orientation of
this paper is practical; no theoretical results are
presented. Many areas open for further research are
mentioned.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-75-513",
}
@TechReport{Tokura:1975:MCU,
author = "Nobuki Tokura",
title = "A microprogram control unit based on a tree memory",
type = "Technical Report",
number = "STAN-CS-75-514 (PB247561/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-514.html",
abstract = "A modularized control unit for microprocessors is
proposed that implements ancestor tree programs. This
leads to a reduction of storage required for address
information. The basic architecture is extended to
paged tree memory to enhance the memory space usage.
Finally, the concept of an ancestor tree with shared
subtrees is introduced, and the existence of an
efficient algorithm to find sharable subtrees is
shown.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-75-514",
}
@TechReport{Brent:1975:FMP,
author = "Richard P. Brent",
title = "Fast Multiple-precision Evaluation of Elementary
Functions",
type = "Technical Report",
number = "STAN-CS-75-515",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 22",
month = aug,
year = "1975",
bibdate = "Thu Jan 11 16:47:21 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/agm.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-75_515_Brent_Fast_Multiple-Precision_Evaluation_Of_Elementary_Functions_Aug75.pdf",
abstract = "Let $ f(x) $ be one of the usual elementary functions
($ \exp $, $ \log $, $ \arctan $, $ \sin $, $ \cosh $,
etc.), and let $ M(n) $ be the number of
single-precision operations required to multiply n-bit
integers. We show that $ f(x) $ can be evaluated, with
relative error $ O(2^{-n}) $, in $ O(M(n) \log (n)) $
operations as $ n \to \infty $, for any floating-point
number $x$ (with an $n$-bit fraction) in a suitable
finite interval. From the Sch{\"o}nhage--Strassen bound
on $ M(n) $, it follows that an $n$-bit approximation
to $ f(x) $ may be evaluated in $ O(n \log^2 (n) \log
\log (n)) $ operations. Special cases include the
evaluation of constants such as $ \pi $, $e$, and $ e^p
i $. The algorithms depend on the theory of elliptic
integrals, using the arithmetic--geometric mean
iteration and ascending Landen transformations.",
acknowledgement = ack-nhfb,
pdfpages = "46",
xxnumber = "CS-TR-75-515",
}
@TechReport{Stoer:1975:RBQ,
author = "J. Stoer",
title = "On the Relation Between Quadratic Termination and
Convergence Properties of Minimization Algorithms",
type = "Technical Report",
number = "STAN-CS-75-516 (SU326 P30-42)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "103",
month = oct,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chvatal:1975:DOG,
author = "Vaclav Chv{\'a}tal and Carsten Thomassen",
title = "Distances in orientations of graphs",
type = "Technical Report",
number = "STAN-CS-75-517",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-517.html",
abstract = "We prove that there is a function $ h(k) $ such that
every undirected graph $G$ admits an orientation $H$
with the following property: if an edge $ u v$ belongs
to a cycle of length $k$ in $G$, then $ u v$ or $ v u$
belongs to a directed cycle of length at most $ h(k)$
in $H$. Next, we show that every undirected bridgeless
graph of radius $r$ admits an orientation of radius at
most $ R^2 + r$, and this bound is best possible. We
consider the same problem with radius replaced by
diameter. Finally, we show that the problem of deciding
whether an undirected graph admits an orientation of
diameter (resp. radius) two belongs to a class of
problems called NP-hard.",
acknowledgement = ack-nhfb,
pdfpages = "25",
xxnumber = "CS-TR-75-517",
}
@TechReport{Chvatal:1975:AII,
author = "Vaclav Chv{\'a}tal and Peter L. Hammer",
title = "Aggregation of inequalities in integer programming",
type = "Technical Report",
number = "STAN-CS-75-518 (AD-A018 461)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-518.html",
abstract = "Given an m $ \times $ n zero-one matrix $ \underset
\tilde \to A $ we ask whether there is a single linear
inequality $ \underset \tilde \to a \underset \tilde
\to x \leq b $ whose zero-one solutions are precisely
the zero-one solutions of $ \underset \tilde \to A
\underset \tilde \to x \leq e $. We develop an
algorithm for answering this question in O(m$ n^2$)
steps and investigate other related problems. Our
results may be interpreted in terms of graph theory and
threshold logic.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-75-518",
}
@TechReport{Davis:1975:PRR,
author = "R. Davis and B. Buchanan and E. Shortliffe",
title = "Production Rules as a Representation for a
Knowledge-Based Consultation Program",
type = "Technical Report",
number = "STAN-CS-75-519 (AIM-266, AD-A019 641)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = nov,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{vonHenke:1975:RDS,
author = "Friedrich W. von Henke",
title = "On the representation of data structures in {LCF} with
applications to program generation",
type = "Technical Report",
number = "STAN-CS-75-520 (AIM-267, AD-A019 664)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = sep,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-520.html",
abstract = "In this paper we discuss techniques of exploiting the
obvious relationship between program structure and data
structure for program generation. We develop methods of
program specification that are derived from a
representation of recursive data structures in the
Logic for Computable Functions (LCF). As a step towards
a formal problem specification language we define
definitional extensions of LCF. These include a
calculus for (computable) homogeneous sets and
restricted quantification. Concepts that are obtained
by interpreting data types as algebras are used to
derive function definition schemes from an LCF term
representing a data structure; they also lead to
techniques for the simplification of expressions in the
extended language. The specification methods are
illustrated with a detailed example.",
acknowledgement = ack-nhfb,
pdfpages = "43",
xxnumber = "CS-TR-75-520",
}
@TechReport{Thompson:1975:DPS,
author = "Clark Thompson",
title = "Depth perception in stereo computer vision",
type = "Technical Report",
number = "STAN-CS-75-521 (AIM-268)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-521.html",
abstract = "This report describes a stereo vision approach to
depth perception; the author has build upon a set of
programs that decompose the problem in the following
way: (1) Production of a camera model: the position and
orientation of the cameras in 3-space. (2) Generation
of matching point-pairs: loci of corresponding features
in the two pictures. (3) Computation of the point in
3-space for each point-pair. (4) Presentation of the
resultant depth information.",
acknowledgement = ack-nhfb,
pdfpages = "17",
xxnumber = "CS-TR-75-521",
}
@TechReport{Luckham:1975:APV,
author = "David C. Luckham and Norihisa Suzuki",
title = "Automatic program verification {IV}: proof of
termination within a weak logic of programs",
type = "Technical Report",
number = "STAN-CS-75-522 (AIM-269, AD-A019 569)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-522.html",
abstract = "A weak logic of programs is a formal system in which
statements that mean `the program halts' cannot be
expressed. In order to prove termination, we would
usually have to use a stronger logical system. In this
paper we show how we can prove termination of both
iterative and recursive programs within a weak logic by
adding pieces of code and placing restrictions on loop
invariants and entry conditions. Thus, most of the
existing verifiers which are based on a weak logic of
programs can be used to prove termination of programs
without any modification. We give examples of proofs of
termination and of accurate bounds on computation time
that were obtained using the Stanford Pascal program
verifier.",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-75-522",
}
@TechReport{Reiser:1975:BDS,
author = "John F. Reiser",
title = "{BAIL}: a debugger for {SAIL}",
type = "Technical Report",
number = "STAN-CS-75-523 (AIM-270, AD-A019 467)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-523.html",
abstract = "BAIL is a debugging aid for SAIL programs, where SAIL
is an extended dialect of ALGOL60 which runs on the
PDP-10 computer. BAIL consists of a breakpoint package
and an expression interpreter which allow the user to
stop his program at selected points, examine and change
the values of variables, and evaluate general SAIL
expressions. In addition, BAIL can display text from
the source file corresponding to the current location
in the program. In may respects BAIL is like DDT or
RAID, except that BAIL is oriented towards SAIL and
knows about SAIL data types, primitive operations, and
procedure implementation.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-75-523",
}
@TechReport{Davis:1975:OPS,
author = "R. Davis and J. King",
title = "An Overview of Production Systems",
type = "Technical Report",
number = "STAN-CS-75-524 (AIM-271, AD-A019 702)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = nov,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ganapathy:1975:RSC,
author = "S. Ganapathy",
title = "Reconstruction of Scenes Containing Polyhedra from
Stereo Pair of Views",
type = "Technical Report",
number = "STAN-CS-75-525 (AIM-272)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "204",
month = nov,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tarjan:1975:GTG,
author = "Robert Endre Tarjan",
title = "Graph theory and {Gaussian} elimination",
type = "Technical Report",
number = "STAN-CS-75-526 (AD-A020 848)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = nov,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-526.html",
abstract = "This paper surveys graph-theoretic ideas which apply
to the problem of solving a sparse system of linear
equations by Gaussian elimination. Included are a
discussion of bandwidth, profile, and general sparse
elimination schemes, and of two graph-theoretic
partitioning methods. Algorithms based on these ideas
are presented.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-75-526",
}
@TechReport{McCluskey:1975:CRC,
author = "Edward J. McCluskey and John F. Wakerly and Roy C.
Ogus",
title = "{Center for Reliable Computing}: current research",
type = "Technical Report",
number = "STAN-CS-75-527 (CSL-TR-100, SU-SEL-75-044)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 99",
month = oct,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-527.html",
abstract = "This report summarizes the research work which has
been performed, and is currently active in the Center
for Reliable Computing in the Digital Systems
Laboratory, Stanford University.",
acknowledgement = ack-nhfb,
pdfpages = "110",
xxnumber = "CS-TR-75-527",
}
@TechReport{Tarjan:1975:SPP,
author = "Robert Endre Tarjan",
title = "Solving path problems on directed graphs",
type = "Technical Report",
number = "STAN-CS-75-528 (AD-A020 597)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = oct,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-528.html",
abstract = "This paper considers path problems on directed graphs
which are solvable by a method similar to Gaussian
elimination. The paper gives an axiom system for such
problems which is a weakening of Salomaa's axioms for a
regular algebra. The paper presents a general solution
method which requires $ O(n^3) $ time for dense graphs
with $n$ vertices and considerably less time for sparse
graphs. The paper also presents a decomposition method
which solves a path problem by breaking it into
subproblems, solving each subproblem by elimination,
and combining the solutions. This method is a
generalization of the `reducibility' notion of data
flow analysis, and is a kind of single-element
`tearing'. Efficiently implemented, the method requires
$ O(m \alpha (m, n)) $ time plus time to solve the
subproblems, for problem graphs with n vertices and m
edges. Here $ \alpha (m, n)$ is a very slowly growing
function which is a functional inverse of Ackermann's
function. The paper considers variants of the axiom
system for which the solution methods still work, and
presents several applications including solving
simultaneous linear equations and analyzing control
flow in computer programs.",
acknowledgement = ack-nhfb,
pdfpages = "45",
xxnumber = "CS-TR-75-528",
}
@TechReport{Bentley:1975:FAC,
author = "J. L. Bentley and J. H. Friedman",
title = "Fast Algorithms for Constructing Minimal Spanning
Trees in Coordinate Spaces",
type = "Technical Report",
number = "STAN-CS-75-529 (SLACP-1665)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = nov,
year = "1975",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Lentini:1975:AFD,
author = "M. Lentini and Victor Pereyra",
title = "An adaptive finite difference solver for nonlinear two
point boundary problems with mild boundary layers",
type = "Technical Report",
number = "STAN-CS-75-530 (SU326 P30-40)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = nov,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-530.html",
abstract = "A variable order variable step finite difference
algorithm for approximately solving m-dimensional
systems of the form y' = f(t,y), t $ \in $ [a,b]
subject to the nonlinear boundary conditions
g(y(a),y(b)) = 0 is presented. A program, PASVAR,
implementing these ideas has been written and the
results on several test runs are presented together
with comparisons with other methods. The main features
of the new procedure are: (a) Its ability to produce
very precise global error estimates, which in turn
allow a very fine control between desired tolerance and
actual output precision. (b) Non-uniform meshes allow
an economical and accurate treatment of boundary layers
and other sharp changes in the solutions. (c) The
combination of automatic variable order (via deferred
corrections) and automatic (adaptive) mesh selection
produces, as in the case of initial value problem
solvers, a versatile, robust, and efficient
algorithm.",
acknowledgement = ack-nhfb,
pdfpages = "43",
xxnumber = "CS-TR-75-530",
}
@TechReport{Rose:1975:AAV,
author = "Donald J. Rose and Robert Endre Tarjan",
title = "Algorithmic aspects of vertex elimination on directed
graphs",
type = "Technical Report",
number = "STAN-CS-75-531 (AD-A020 847)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = nov,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-531.html",
abstract = "We consider a graph-theoretic elimination process
which is related to performing Gaussian elimination on
sparse systems of linear equations. We give efficient
algorithms to: (1) calculate the fill-in produced by
any elimination ordering; (2) find a perfect
elimination ordering if one exists; and (3) find a
minimal elimination ordering. We also show that
problems (1) and (2) are at least as time-consuming as
testing whether a directed graph is transitive, and
that the problem of finding a minimum ordering is
NP-complete.",
acknowledgement = ack-nhfb,
pdfpages = "45",
xxnumber = "CS-TR-75-531",
}
@TechReport{Jacobs:1975:BCS,
author = "Patricia E. Jacobs",
title = "Bibliography of {Computer Science Department}
technical reports",
type = "Technical Report",
number = "STAN-CS-75-532",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-532.html",
abstract = "This report lists, in chronological order, all reports
from the Stanford Computer Science series
(STAN-CS-xx-xxx), Artificial Intelligence Memos (AIM),
Digital Systems Laboratory Technical reports (TR) and
Technical Notes (TN), plus Stanford Linear Accelerator
Center publications (SLACP) and reports (SLACR). Also,
for the first time, we have provided an author index
for these reports (at the end of the report listings).
The bibliography issued in October of 1973 is hereby
brought up to date. Each report is identified by title,
author's name, National Technical Information Service
(NTIS) retrieval number, date, number of pages and the
computer science areas treated. Subsequent journal
publication (when known) is also indicated.",
acknowledgement = ack-nhfb,
pdfpages = "79",
xxnumber = "CS-TR-75-532",
}
@TechReport{Concus:1976:GCG,
author = "Paul Concus and Gene H. Golub and Dianne Prost
O'Leary",
title = "A Generalized Conjugate Gradient Method for the
Numerical Solution of Elliptic Partial Differential
Equations",
type = "Technical Report",
number = "STAN-CS-76-533 (LBL-4604, SU326 P30-44)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = jan,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-533.html",
abstract = "We consider a generalized conjugate gradient method
for solving sparse, symmetric, positive-definite
systems of linear equations, principally those arising
from the discretization of boundary value problems for
elliptic partial differential equations. The method is
based on splitting off from the original coefficient
matrix a symmetric, positive-definite one that
corresponds to a more easily solvable system of
equations, and then accelerating the associated
iteration using conjugate gradients. Optimality and
convergence properties are presented, and the relation
to other methods is discussed. Several splittings for
which the method seems particularly effective are also
discussed, and for some, numerical examples are
given.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "30",
xxnumber = "CS-TR-76-533",
}
@TechReport{Hemphill:1976:CAA,
author = "Linda G. Hemphill",
title = "A Conceptual Approach to Automatic Language
Understanding and Belief Structures: With
Disambiguation of the Word {``For''}",
type = "Technical Report",
number = "STAN-CS-76-534 (AIM-273)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "254",
month = jan,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Grossman:1975:IGO,
author = "David D. Grossman and Russell H. Taylor",
title = "Interactive generation of object models with a
manipulator",
type = "Technical Report",
number = "STAN-CS-75-536",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-536.html",
abstract = "Manipulator programs in a high level language consist
of manipulation procedures and object model
declarations. As higher level languages are developed,
the procedures will shrink while the declarations will
grow. This trend makes it desirable to develop means
for automating the generation of these declarations. A
system is proposed which would permit users to specify
certain object models interactively, using the
manipulator itself as a measuring tool in three
dimensions. A preliminary version of the system has
been tested.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-75-536",
}
@TechReport{Bolles:1975:VVW,
author = "Robert C. Bolles",
title = "{Verification Vision} within a programmable assembly
system: an introductory discussion",
type = "Technical Report",
number = "STAN-CS-75-537",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-537.html",
abstract = "This paper defines a class of visual feedback tasks
called `Verification Vision' which includes a
significant portion of the feedback tasks required
within a programmable assembly system. It characterizes
a set of general-purpose capabilities which, if
implemented, would provide a user with a system in
which to write programs to perform such tasks. Example
tasks and protocols are used to motivate these semantic
capabilities. Of particular importance are the tools
required to extract as much information as possible
from planning and/or training sessions. Four different
levels of verification systems are discussed. They
range from a straightforward interactive system which
could handle a subset of the verification vision tasks,
to a completely automatic system which could plan its
own strategies and handle the total range of
verification tasks. Several unsolved problems in the
area are discussed.",
acknowledgement = ack-nhfb,
pdfpages = "88",
xxnumber = "CS-TR-75-537",
}
@TechReport{Knuth:1976:ASF,
author = "Donald E. Knuth and L. {Trabb Pardo}",
title = "Analysis of a Simple Factorization Algorithm",
type = "Technical Report",
number = "STAN-CS-76-538 (AD-A024 416)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "43",
month = jan,
year = "1976",
DOI = "https://doi.org/10.1016/0304-3975(76)90050-5",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA024416.pdf",
abstract = "The probability that the $k$-th largest prime factor
of a number $n$ is at most $n$ is shown to approach a
limit, $ F_k(x)$ as $ n \to \infty $. Several
interesting properties of $ F_(x)$ are explored, and
numerical tables are given. These results are applied
to the analysis of an algorithm commonly used to find
all prime factors of a given number. The average number
of digits in the $k$-th largest prime factor of a
random $m$-digit number is shown to be asymptotically
equivalent to the average length of the $k$-th longest
cycle in a permutation on $m$ objects.",
acknowledgement = ack-nhfb,
keywords = "asymptotic methods; cycle lengths in random
permutation; Dickman's function; prime factors;
probability distributions in number theory.",
pdfpages = "51",
remark = "Published in \booktitle{Theoretical Computer Science}
{\bf 3}(3) 321--348, December 1974.",
}
@TechReport{Manna:1975:NAR,
author = "Zohar Manna and Adi Shamir",
title = "A new approach to recursive programs",
type = "Technical Report",
number = "STAN-CS-75-539 (AIM-276, AD-A021 055\slash 9WC)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = dec,
year = "1975",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-75-539.html",
abstract = "In this paper we critically evaluate the classical
least-fixedpoint approach towards recursive programs.
We suggest a new approach which extracts the maximal
amount of valuable information embedded in the
programs. The presentation is informal, with emphasis
on examples.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-75-539",
}
@TechReport{Friedman:1976:AFB,
author = "Jerome Friedman and Jon Louis Bentley and Raphael Ari
Finkel",
title = "An Algorithm for Finding Best Matches in Logarithmic
Expected Time",
type = "Technical Report",
number = "STAN-CS-75-482 (SLACP-1549)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Original version February 1975. Revised December 1975
and July 1976.",
URL = "http://i.stanford.edu/TR/CS-TR-75-482.html",
abstract = "An algorithm and data structure are presented for
searching a file containing $N$ records, each described
by $k$ real valued keys, for the $m$ closest matches or
nearest neighbors to a given query record. The
computation required to organize the file is
proportional to $ k N \log N$. The expected number of
records examined in each search is independent of the
file size. The expected computation to perform each
search is proportional to $ \log N$. Empirical evidence
suggests that except for very small files, this
algorithm is considerably faster than other methods.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-75-482",
}
@TechReport{Davis:1976:SCS,
author = "Randall Davis and Margaret H. Wright",
title = "{Stanford Computer Science Department} research
report",
type = "Technical Report",
number = "STAN-CS-76-405",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-405.html",
abstract = "This collection of reports is divided into two
sections. The first contains the research summaries for
individual faculty members and research associates in
the Computer Science Department. Two professors from
Electrical Engineering are included as `Affiliated
Faculty' because their interests are closely related to
those of the Department. The second section gives an
overview of the activities of research groups in the
Department. `Group' here is taken to imply many
different things, including people related by various
degrees of intellectual interests, physical proximity,
or funding considerations. We have tried to describe
any group whose scope of interest is greater than that
of one person. The list of recent publications for each
is not intended to be comprehensive, but rather to give
a feeling for the range of topics considered. This
collection of reports has been assembled to provide a
reasonably comprehensive review of research activities
in the Department. We hope that it will be widely
useful --- in particular, students in the Department
may find it helpful in discovering interesting projects
and possible thesis topics. We expect also that it will
be of interest to many other people, both within and
outside the Department.",
acknowledgement = ack-nhfb,
pdfpages = "47",
xxnumber = "CS-TR-76-405",
}
@TechReport{Concus:1976:GCGb,
author = "Paul Concus and Gene H. Golub",
title = "A Generalized {Conjugate Gradient} Method for
Nonsymmetric Systems of Linear Equations",
type = "Technical Report",
number = "STAN-CS-76-535",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jan,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.lin.alg.bib;
https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-535.html",
abstract = "We consider a generalized conjugate gradient method
for solving systems of linear equations having
nonsymmetric coefficient matrices with
positive-definite symmetric part. The method is based
on splitting the matrix into its symmetric and
skew-symmetric parts, and then accelerating the
associated iteration using conjugate gradients, which
simplifies in this case, as only one of the two usual
parameters is required. The method is most effective
for cases in which the symmetric part of the matrix
corresponds to an easily solvable system of equations.
Convergence properties are discussed, as well as an
application to the numerical solution of elliptic
partial differential equations.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "16",
xxnumber = "CS-TR-76-535",
}
@TechReport{Graham:1976:ACM,
author = "Ronald L. Graham and Andrew Chi-Chih Yao and F.
Frances Yao",
title = "Addition chains with multiplicative cost",
type = "Technical Report",
number = "STAN-CS-76-540 (AD-A021 587)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
month = jan,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-540.html",
abstract = "If each step in an addition chain is assigned a cost
equal to the product of the numbers added at that step,
`binary' addition chains are shown to minimize total
cost.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "8",
xxnumber = "CS-TR-76-540",
}
@TechReport{Knuth:1976:MCS,
author = "Donald E. Knuth",
title = "Mathematics and Computer Science: Coping with
Finiteness",
type = "Technical Report",
number = "STAN-CS-76-541",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = mar,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "By presenting these examples, I have tried to
illustrate four main points. (1) Finite numbers can be
really enormous, and the known universe is very small.
Therefore the distinction between finite and infinite
is not as relevant as the distinction between realistic
and unrealistic. (2) In many cases there are subtle
ways to solve very large problems quickly, in spite of
the fact that they appear at first to require
examination of too many possibilities. (3) There are
also cases where we can prove that a fairly natural
problem is intrinsically hard, far beyond our
conceivable capabilities. (4) It takes a good deal of
skill to decide whether a given problem is in the easy
or hard class; but even if a problem does turn out to
be hard there are useful and interesting ways to change
it into one that can be done satisfactorily",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Science}, {\bf 194}(4271)
1235--1242, 17 December 1976,
doi:10.1126/science.194.4271.1235, and
\booktitle{Fiz.-Mat. Spis. Bulgar. Akad. Nauk.}, {\bf
21(54)}(1), 58--74, 1982.",
}
@TechReport{Manna:1976:TAO,
author = "Zohar Manna and Adi Shamir",
title = "The theoretical aspects of the optimal fixedpoint",
type = "Technical Report",
number = "STAN-CS-76-542 (AIM-277, AD-A027 454)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 22",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-542.html",
abstract = "In this paper we define a new type of fixedpoint of
recursive definitions and investigate some of its
properties. This optimal fixedpoint (which always
uniquely exists) contains, in some sense, the maximal
amount of `interesting' information which can be
extracted from the recursive definition, and it may be
strictly more defined than the program's least
fixedpoint. This fixedpoint can be the basis for
assigning a new semantics to recursive programs. This
is a modified and extended version of part 1 of a paper
presented at the Symposium on Theory of Computing,
Albuquerque, New Mexico (May 1975).",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-76-542, AIM-277",
}
@TechReport{Zave:1976:OPS,
author = "Derek A. Zave",
title = "Optimal polyphase sorting",
type = "Technical Report",
number = "STAN-CS-76-543",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-543.html",
abstract = "A read-forward polyphase merge algorithm is described
which performs the polyphase merge starting from an
arbitrary string distribution. This algorithm minimizes
the volume of information moved. Since this volume is
easily computed, it is possible to construct dispersion
algorithms which anticipate the merge algorithm. Two
such dispersion techniques are described. The first
algorithm requires that the number of strings to be
dispersed be known in advance; this algorithm is
optimal. The second algorithm makes no such
requirement, but is not always optimal. In addition,
performance estimates are derived and both algorithms
are shown to be asymptotically optimal.",
acknowledgement = ack-nhfb,
pdfpages = "80",
xxnumber = "CS-TR-76-543",
}
@TechReport{Mont-Reynaud:1976:RTA,
author = "Bernard Mont-Reynaud",
title = "Removing trivial assignments from programs",
type = "Technical Report",
number = "STAN-CS-76-544",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-544.html",
abstract = "An assignment X $ \leftarrow $ Y in a program is
`trivial' when both X and Y are simple program
variables. The paper describes a transformation which
removes all such assignments from a program P,
producing a program P' which executes faster than P but
usually has a larger size. The number of variables used
by P' is also minimized. Worst-case analysis of the
transformation algorithm leads to nonpolynomial bounds.
Such inefficiency, however, does not arise in typical
situations, and the technique appears to be of interest
for practical compiler optimization.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-76-544",
}
@TechReport{Paul:1976:SBG,
author = "Wolfgang J. Paul and Robert Endre Tarjan and James R.
Celoni",
title = "Space bounds for a game on graphs",
type = "Technical Report",
number = "STAN-CS-76-545",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 21",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/76/545/CS-TR-76-545.pdf;
http://i.stanford.edu/TR/CS-TR-76-545.html",
abstract = "We study a one-person game played by placing pebbles,
according to certain rules, on the vertices of a
directed graph. In [J. Hopcroft, W. Paul, and L.
Valiant, `On time versus space and related problems,'
Proc. 16th Annual Symposium on Foundations of Computer
Science (1975), pp.57--64] it was shown that for each
graph with $n$ vertices and maximum in-degree $d$,
there is a pebbling strategy which requires at most $
c(d) n \log n$ pebbles. Here we show that this bound is
tight to within a constant factor. We also analyze a
variety of pebbling algorithms, including one which
achieves the $ O(n \log n)$ bound.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-76-545",
}
@TechReport{Baskett:1976:DLC,
author = "F. Baskett and L. Sustek",
title = "The Design of a Low Cost Video Graphics Terminal",
type = "Technical Report",
number = "STAN-CS-76-546 (SLACP-1715)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = mar,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tarjan:1976:IAG,
author = "Robert Endre Tarjan",
title = "Iterative algorithms for global flow analysis",
type = "Technical Report",
number = "STAN-CS-76-547",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-547.html",
abstract = "This paper studies iterative methods for the global
flow analysis of computer programs. We define a
hierarchy of global flow problem classes, each solvable
by an appropriate generalization of the `node listing'
method of Kennedy. We show that each of these
generalized methods is optimum, among all iterative
algorithms, for solving problems within its class. We
give lower bounds on the time required by iterative
algorithms for each of the problem classes.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-76-547",
}
@TechReport{OLeary:1976:HCG,
author = "Dianne Prost O'Leary",
title = "Hybrid Conjugate Gradient Algorithms",
type = "Technical Report",
number = "STAN-CS-76-548",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = mar,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Luckham:1976:APV,
author = "David C. Luckham and Norihisa Suzuki",
title = "Automatic program verification V:
verification-oriented proof rules for arrays, records
and pointers",
type = "Technical Report",
number = "STAN-CS-76-549 (AIM-278, AD-A027 455)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-549.html",
abstract = "A practical method is presented for automating in a
uniform way the verification of Pascal programs that
operate on the standard Pascal data structures ARRAY,
RECORD, and POINTER. New assertion language primitives
are introduced for describing computational effects of
operations on these data structures. Axioms defining
the semantics of the new primitives are given. Proof
rules for standard Pascal operations on pointer
variables are then defined in terms of the extended
assertion language. Similar rules for records and
arrays are special cases. An extensible axiomatic rule
for the Pascal memory allocation operation, NEW, is
also given. These rules have been implemented in the
Stanford Pascal program verifier. Examples illustrating
the verification of programs which operate on list
structures implemented with pointers and records are
discussed. These include programs with side-effects.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-76-549",
}
@TechReport{Tarjan:1976:FMI,
author = "Robert Endre Tarjan and Anthony E. Trojanowski",
title = "Finding a maximum independent set",
type = "Technical Report",
number = "STAN-CS-76-550",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-550.html",
abstract = "We present an algorithm which finds a maximum
independent set in an n-vertex graph in 0($ 2^{n / 3}$)
time. The algorithm can thus handle graphs roughly
three times as large as could be analyzed using a naive
algorithm.",
acknowledgement = ack-nhfb,
pdfpages = "23",
xxnumber = "CS-TR-76-550",
}
@TechReport{Knuth:1976:SACb,
author = "Donald E. Knuth",
title = "The state of the {Art of Computer Programming}",
type = "Technical Report",
number = "STAN-CS-76-551 (AD-A032 347)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = jun,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-551.html;
http://www-db.stanford.edu/TR/CS-TR-76-551.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-76-551",
abstract = "This report lists all corrections and changes to
volumes 1 and 3 of ``The Art of Computer Programming,''
as of May 14, 1976. The changes apply to the most
recent printings of both volumes (February and March,
1975); if you have an earlier printing there have been
many other changes not indicated here.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-76-551",
pdfpages = "60",
xxnumber = "CS-TR-76-551",
}
@TechReport{Suzuki:1976:AVP,
author = "Norihsa Suzuki",
title = "Automatic Verification of Programs with Complex Data
Structures",
type = "Technical Report",
number = "STAN-CS-76-552 (AIM-279)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "194",
month = feb,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tarjan:1976:CMN,
author = "Robert Endre Tarjan",
title = "Complexity of monotone networks for computing
conjunctions",
type = "Technical Report",
number = "STAN-CS-76-553 (AD-A032 772)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = jun,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-553.html",
abstract = "Let $ F_1 $, $ F_2 $, \ldots{}, $ F_m $ be a set of
Boolean functions of the form $ F_i $ = $ \wedge $ {x$
\in X_i $}, where $ \wedge $ denotes conjunction and
each $ X_i $ is a subset of a set X of n Boolean
variables. We study the size of monotone Boolean
networks for computing such sets of functions. We
exhibit anomalous sets of conjunctions whose smallest
monotone networks contain disjunctions. We show that if
|$ F_i $ | is sufficiently small for all i, such
anomalies cannot happen. We exhibit sets of m
conjunctions in n unknowns which require $ c_2 $ m$
\alpha $ (m,n) binary conjunctions, where $ \alpha $
(m,n) is a very slowly growing function related to a
functional inverse of Ackermann's function. This class
of examples shows that an algorithm given in
[STAN-CS-75-512] for computing functions defined on
paths in trees is optimum to within a constant
factor.",
acknowledgement = ack-nhfb,
pdfpages = "25",
xxnumber = "CS-TR-76-553",
}
@TechReport{Yu:1976:MWB,
author = "F. S. Yu",
title = "Modeling the Write Behavior of Computer Programs",
type = "Technical Report",
number = "STAN-CS-76-554",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "185",
month = jun,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Grossman:1976:MCS,
author = "David D. Grossman",
title = "{Monte Carlo} simulation of tolerancing in discrete
parts manufacturing and assembly",
type = "Technical Report",
number = "STAN-CS-76-555 (AIM-280)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = may,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-555.html",
abstract = "The assembly of discrete parts is strongly affected by
imprecise components, imperfect fixtures and tools, and
inexact measurements. It is often necessary to design
higher precision into the manufacturing and assembly
process than is functionally needed in the final
product. Production engineers must trade off between
alternative ways of selecting individual tolerances in
order to achieve minimum cost while preserving product
integrity. This paper describes a comprehensive Monte
Carlo method for systematically analysing the
stochastic implications of tolerancing and related
forms of imprecision. The method is illustrated by four
examples, one of which is chosen from the field of
assembly by computer controlled manipulators.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-76-555",
}
@TechReport{Guibas:1976:AHA,
author = "Leonidas John Guibas",
title = "The Analysis of Hashing Algorithms",
type = "Technical Report",
number = "STAN-CS-76-556",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "136",
month = aug,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://doc.lagout.org/science/0_Computer%20Science/0_Computer%20History/old-hardware/xerox/parc/techReports/CSL-76-3_The_Analysis_of_Hashing_Algorithms.pdf;
https://en.wikipedia.org/wiki/Leonidas_J._Guibas;
https://www.proquest.com/pqdtglobal/docview/302823644",
abstract = "In this thesis we relate the performance of hashing
algorithms to the notion of clustering, that is the
pile-up phenomenon that occurs because many keys may
probe the table locations in the same sequence. We will
say that a hashing technique exhibits $k$-ary
clustering if the search for a key begins with $k$
independent random probes and the subsequent sequence
of probes is completely determined by the location of
the $k$ initial probes. Such techniques may be very
bad; for instance, the average number of probes
necessary for insertion may grow linearly with the
table size. However, on the average (that is if the
permutations describing the method are randomly
chosen), $k$-ary clustering techniques for $ k > 1$ are
very good. In fact the average performance is
asymptotically equivalent to the performance of uniform
probing, a method that exhibits no clustering and is
known to be optimal in a certain sense.\par
Perhaps the most famous among tertiary clustering
techniques is double hashing, the method in which we
probe the hash table along arithmetic progressions
where the initial element and the increment of the
progression are chosen randomly and independently
depending only on the key $K$ of the search. We prove
that double hashing is also asymptotically equivalent
to uniform probing for load factors a not exceeding a
certain constant $ \alpha_0 = 0.31 \ldots $. Our proof
method has a different flavor from those previously
used in algorithmic analysis. We begin by showing that
the tail of the hypergeometric distribution a fixed
percent away from the mean is exponentially small. We
use this result to prove that random subsets of the
finite ring of integers modulo $m$ of cardinality am
have always nearly the expected number of arithmetic
progressions of length $k$, except with exponentially
small probability. We then use this theorem to start up
a process (called the extension process) of looking at
snapshots of the table as it fills up with double
hashing. Between steps of the extension process we can
show that the effect of clustering is negligible, and
that we therefore never depart too far from the truly
random situation.",
acknowledgement = ack-nhfb,
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Paterson:1976:IBF,
author = "M. S. Paterson",
title = "An Introduction to {Boolean} Function Complexity",
type = "Technical Report",
number = "STAN-CS-76-557 (AD-A032 122)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = aug,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1976:SSB,
author = "Zohar Manna and Richard Waldinger",
title = "Is `sometime' sometimes better than `always'?
{Intermittent} assertions in proving program
correctness",
type = "Technical Report",
number = "STAN-CS-76-558 (AIM-281.1, AD-A042 507)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = jun,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "See also revision \cite{Manna:1977:SSB}.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Golub:1976:RDL,
author = "Gene H. Golub and Virginia C. Klema and Gilbert W.
Stewart",
title = "Rank degeneracy and least squares problems",
type = "Technical Report",
number = "STAN-CS-76-559 (AD-A032 348)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = aug,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-559.html",
abstract = "This paper is concerned with least squares problems
when the least squares matrix $A$ is near a matrix that
is not of full rank. A definition of numerical rank is
given. It is shown that under certain conditions when A
has numerical rank r there is a distinguished r
dimensional subspace of the column space of $A$ that is
insensitive to how it is approximated by $r$
independent columns of A. The consequences of this fact
for the least squares problem are examined. Algorithms
are described for approximating the stable part of the
column space of A.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "42",
xxnumber = "CS-TR-76-559",
}
@TechReport{Taylor:1976:SMC,
author = "Russell Taylor",
title = "Synthesis of Manipulator Control Programs from
Task-level Specifications",
type = "Technical Report",
number = "STAN-CS-76-560 (AIM-282)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "229",
month = jul,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Woods:1976:MPL,
author = "Donald R. Woods",
title = "{Mathematical Programming Language} --- user's guide",
type = "Technical Report",
number = "STAN-CS-76-561",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-561.html",
abstract = "Mathematical Programming Language (MPL) is a
programming language specifically designed for the
implementation of mathematical software and, in
particular, experimental mathematical programming
software. In the past there has been a wide gulf
between the applied mathematicians who design
mathematical algorithms (but often have little
appreciation of the fine points of computing) and the
professional programmer, who may have little or no
understanding of the mathematics of the problem he is
programming. The result is that a vast number of
mathematical algorithms have been devised and
published, with only a small fraction being actually
implemented and experimentally compared on selected
representative problems. MPL is designed to be as close
as possible to the terminology used by the
mathematician while retaining as far as possible
programming sophistications which make for good
software systems. The result is a programming language
which (hopefully!) allows the writing of clear,
concise, easily read programs, especially by persons
who are not professional programmers.",
acknowledgement = ack-nhfb,
pdfpages = "140",
xxnumber = "CS-TR-76-561",
}
@TechReport{Knuth:1976:EDP,
author = "Donald E. Knuth and L. {Trabb Pardo}",
title = "The early development of programming languages",
type = "Technical Report",
number = "STAN-CS-76-562 (AD-A032 123)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 109",
month = aug,
year = "1976",
bibdate = "Thu Jan 11 16:54:37 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-76-562_EarlyDevelPgmgLang_Aug76.pdf",
abstract = "This paper surveys the evolution of ``high level''
programming languages during the first decade of
computer programming activity. We discuss the
contributions of Zuse (``Plankalkiul'', 1945),
Goldstine/von Neumann (``Flow Diagrams'', 1946), Curry
(``Composition'', 1948), Mauchly et al. (``Short
Code'', 1950), Burks (``Intermediate PL'', 1950),
Rutishauser (1951), Bohm (1951), Glennie (``AUTOCODE'',
1952), Hopper et al. (``A-2'', 1953), Laning/Zierler
(1953), Backus et al. (``FORTRAN'', 1954-1957), Brooker
(``Mark I Autocode', 1954), Kemynin/Liubimskii
(``mm-2'', 1954), Ershov (``mm'', 1955), Grems/Porter
(``BACAIC'', 1955), Elsworth et al. (``Kompiler 2'',
1955), Blum (``ADES'', 1956), Perlis et al. (``IT'',
1956), Katz et al. (``MATH-MATIC'', 1956-1958), Hopper
et al. (``FLOW-MATIC'', 1956-1958), Bauer/Samelson
(1956-1958). The principal features of each
contribution are illustrated; and for purposes of
comparison, a particular fixed algorithm has been
encoded (as far as possible) in each of the languages.
This research is based primarily on unpublished source
materials, and the authors hope that they have been
able to compile a fairly complete picture of the early
developments in this area.\par
This article was commissioned by the Encyclopedia of
Computer Science and Technology, ed. by Jack Belzer,
Albert G. Holzman, and Allen Kent, and it is scheduled
to appear in vol. 6 or vol, 7 of that encyclopedia
during 1977.",
acknowledgement = ack-nhfb,
pdfpages = "110",
}
@TechReport{Russell:1976:SRA,
author = "D. L. Russell",
title = "State Restoration Among Communicating Processes",
type = "Technical Report",
number = "STAN-CS-76-563",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "173",
month = aug,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Davis:1976:AML,
author = "Randall Davis",
title = "Applications of Meta Level Knowledge to the
Construction, Maintenance and Use of Large Knowledge
Bases",
type = "Technical Report",
number = "STAN-CS-76-564 (AIM-283, HPP-76-112)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "304",
month = jul,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Strikwerda:1976:IBV,
author = "J. C. Strikwerda",
title = "Initial Boundary Value Problems for Incompletely
Parabolic Systems",
type = "Technical Report",
number = "STAN-CS-76-565 (AD-A032 802)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "107",
month = nov,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wright:1976:NMN,
author = "Margaret Wright",
title = "Numerical Methods for Nonlinearly Constrained
Optimization",
type = "Technical Report",
number = "STAN-CS-76-566",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "262",
month = nov,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Finkel:1976:CDM,
author = "Rafael Finkel",
title = "Constructing and Debugging Manipulator Programs",
type = "Technical Report",
number = "STAN-CS-76-567 (AIM-284)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "171",
month = aug,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Binford:1976:ESC,
author = "Thomas O. Binford and David D. Grossman and C. Richard
Liu and Robert C. Bolles and Raphael A. Finkel and M.
Shahid Mujtaba and Michael D. Roderick and Bruce E.
Shimano and Russell H. Taylor and Ronald H. Goldman and
J. Pitts {Jarvis, III} and Victor D. Scheinman and
Thomas A. Gafford",
title = "Exploratory study of computer integrated assembly
systems. {Progress} report 3, covering the period
{December 1, 1975} to {July 31, 1976}",
type = "Technical Report",
number = "STAN-CS-76-568 (AIM-285, PB-259 130/2WC)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "336",
month = aug,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-568.html",
abstract = "The Computer Integrated Assembly Systems project is
concerned with developing the software technology of
programmable assembly devices, including computer
controlled manipulators and vision systems. A complete
hardware system has been implemented that includes
manipulators with tactile sensors and TV cameras,
tools, fixtures, and auxiliary devices, a dedicated
minicomputer, and a time-shared large computer equipped
with graphic display terminals. An advanced software
system called AL has been developed that can be used to
program assembly applications. Research currently
underway includes refinement of AL, development of
improved languages and interactive programming
techniques for assembly and vision, extension of
computer vision to areas which are currently
infeasible, geometric modeling of objects and
constraints, assembly simulation, control algorithms,
and adaptive methods of calibration.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-76-568",
}
@TechReport{Herriot:1976:CIN,
author = "John G. Herriot",
title = "Calculation of interpolating natural spline functions
using {de Boor}'s package for calculating with
{B}-splines",
type = "Technical Report",
number = "STAN-CS-76-569 (P261 814/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 44",
month = oct,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-569.html",
abstract = "A FORTRAN subroutine is described for finding
interpolating natural splines of odd degree for an
arbitrary set of data points. The subroutine makes use
of several of the subroutines in de Boor's package for
calculating with B-splines. An Algol W translation of
the interpolating natural spline subroutine and of the
required subroutines of the de Boor package are also
given. Timing tests and accuracy tests for the routines
are described.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-76-569",
}
@TechReport{Lenat:1976:AIA,
author = "Douglas Lenat",
title = "{AM}: an Artificial Intelligence Approach to Discovery
in Mathematics as Heuristic Search",
type = "Technical Report",
number = "STAN-CS-76-570 (AIM-286)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "350",
month = jul,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Roderick:1976:DCR,
author = "Michael Roderick",
title = "Discrete Control of a Robot Arm",
type = "Technical Report",
number = "STAN-CS-76-571 (AIM-287)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "98",
month = aug,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Filman:1976:FP,
author = "Robert E. Filman and Richard W. Weyhrauch",
title = "An {FOL} primer",
type = "Technical Report",
number = "STAN-CS-76-572 (AIM-288)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = sep,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-572.html",
abstract = "This primer is an introduction to FOL, an interactive
proof checker for first order logic. Its examples can
be used to learn the FOL system, or read independently
for a flavor of our style of interactive proof
checking. Several example proofs are presented,
successively increasing in the complexity of the FOL
commands employed.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-76-572",
}
@TechReport{Jonassen:1976:STF,
author = "Arne T. Jonassen",
title = "The stationary $p$-tree forest",
type = "Technical Report (AD-A032 945)",
number = "STAN-CS-76-573 (AD-A032 945)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 88",
month = oct,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-573.html",
abstract = "This paper contains a theoretical analysis of the
conditions of a priority queue strategy after an
infinite number of alternating insert/remove steps.
Expected insertion time, expected length, etc. are
found.",
acknowledgement = ack-nhfb,
pdfpages = "94",
xxnumber = "CS-TR-76-573",
}
@TechReport{Reiser:1976:S,
author = "John F. Reiser",
title = "{SAIL}",
type = "Technical Report",
number = "STAN-CS-76-574 (AIM-289)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "178",
month = aug,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/76/574/CS-TR-76-574.pdf;
http://i.stanford.edu/TR/CS-TR-76-574.html",
abstract = "Sail is a high-level programming language for the
PDP-10 computer. It includes an extended ALGOL 60
compiler and a companion set of execution-time
routines. In addition to ALGOL, the language features:
(1) flexible linking to hand-coded machine language
algorithms, (2) complete access to the PDP-10 I/O
facilities, (3) a complete system of compile-time
arithmetic and logic as well as a flexible macro
system, (4) a high-level debugger, (5) records and
references, (6) sets and lists, (7) an associative data
structure, (8) independent processes, (9) procedure
variables, (10) user modifiable error handling, (11)
backtracking, and (12) interrupt facilities. This
manual describes the Sail language and the
execution-time routines for the typical Sail user: a
non-novice programmer with some knowledge of ALGOL. It
lies somewhere between being a tutorial and a reference
manual.",
acknowledgement = ack-nhfb,
pdfpages = "182",
xxnumber = "CS-TR-76-574",
}
@TechReport{Smith:1976:ST,
author = "Nancy W. Smith",
title = "{SAIL} tutorial",
type = "Technical Report",
number = "STAN-CS-76-575 (AIM-290, AD-A042 494)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "54",
month = oct,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-575.html",
abstract = "This tutorial is designed for a beginning user of
Sail, an ALGOL-like language for the PDP10. The first
part covers the basic statements and expressions of the
language; remaining topics include macros, records,
conditional compilation, and input/output. Detailed
examples of Sail programming are included throughout,
and only a minimum of programming background is
assumed.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-76-575",
}
@TechReport{McDiarmid:1976:DCN,
author = "Colin McDiarmid",
title = "Determining the Chromatic Number of a Graph",
type = "Technical Report",
number = "STAN-CS-76-576 (AD-A035 350)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "61",
month = dec,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buchanan:1976:TRJ,
author = "Bruce Buchanan and Joshua Lederberg and John
McCarthy",
title = "Three Reviews of {J. Weizenbaum}'s
{{\booktitle{Computer Power and Human Reason}}}",
type = "Technical Report",
number = "STAN-CS-76-577 (AIM-291, AO44 713)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = nov,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Oliger:1976:TPA,
author = "Joseph Oliger and Arne Sundstr{\"o}m",
title = "Theoretical and practical aspects of some
initial-boundary value problems in fluid dynamics",
type = "Technical Report",
number = "STAN-CS-76-578 (AD-A035 219)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 61",
month = nov,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-578.html",
abstract = "Initial-boundary value problems for several systems of
partial differential equations from fluid dynamics are
discussed. Both rigid wall and open boundary problems
are treated. Boundary conditions are formulated and
shown to yield well-posed problems for the Eulerian
equations for gas dynamics, the shallow-water
equations, and linearized constant coefficient versions
of the incompressible, anelastic equations. The
`primitive' hydrostatic meteorological equations are
shown to be ill-posed with any specification of local,
pointwise boundary conditions. Analysis of simplified
versions of this system illustrates the mechanism
responsible for ill-posedness.",
acknowledgement = ack-nhfb,
pdfpages = "66",
xxnumber = "CS-TR-76-578",
}
@TechReport{Baskett:1976:AIM,
author = "Forest Baskett and Abbas Rafii",
title = "The {A0} inversion model of program paging behavior",
type = "Technical Report",
number = "STAN-CS-76-579 (SLACP-1826)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = nov,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-579.html",
abstract = "When the parameters of a simple stochastic model of
the memory referencing behavior of computer programs
are carefully selected, the model is able to mimic the
paging behavior of a set of actual programs. The
mimicry is successful using several different page
replacement algorithms and a wide range of real memory
sizes in a virtual memory environment. The model is
based on the independent reference model with a new
procedure for determining the page reference
probabilities, the parameters of the model. We call the
result the A0 inversion independent reference model.
Since the fault rate (or miss ratio) is one aspect of
program behavior that the model is able to capture for
many different memory sizes, the model should be
especially useful for evaluating multilevel memory
organizations based on newly emerging memory
technologies.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-76-579",
}
@TechReport{Winograd:1976:TPU,
author = "Terry A. Winograd",
title = "Towards a procedural understanding of semantics",
type = "Technical Report",
number = "STAN-CS-76-580 (AIM-292)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = nov,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-580.html",
abstract = "The term `procedural semantics' has been used in a
variety of ways, not all compatible, and not all
comprehensible. In this paper, I have chosen to apply
the term to a broad paradigm for studying semantics
(and in fact, all of linguistics). This paradigm has
developed in a context of writing computer programs
which use natural language, but it is not a theory of
computer programs or programming techniques. It is
`procedural' because it looks at the underlying
structure of language as fundamentally shaped by the
nature of processes for language production and
comprehension. It is based on the belief that there is
a level of explanation at which there are significant
similarities between the psychological processes of
human language use and the computational processes in
computer programs we can construct and study. Its goal
is to develop a body of theory at this level. This
approach necessitates abandoning or modifying several
currently accepted doctrines, including the way in
which distinctions have been drawn between `semantics'
and `pragmatics' and between `performance' and
`competence'. The paper has three major sections. It
first lays out the paradigm assumptions which guide the
enterprise, and elaborates a model of cognitive
processing and language use. It then illustrates how
some specific semantic problems might be approached
from a procedural perspective, and contrasts the
procedural approach with formal structural and truth
conditional approaches. Finally, it discusses the goals
of linguistic theory and the nature of the linguistic
explanation. Much of what is presented here is a
speculation about the nature of a paradigm yet to be
developed. This paper is an attempt to be evocative
rather than definitive; to convey intuitions rather
than to formulate crucial arguments which justify this
approach over others. It will be successful if it
suggests some ways of looking at language which lead to
further understanding.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-76-580",
}
@TechReport{Bobrow:1976:OKK,
author = "Daniel G. Bobrow and Terry A. Winograd",
title = "An overview of {KRL}, a {Knowledge Representation
Language}",
type = "Technical Report",
number = "STAN-CS-76-581 (AIM-293, AD-A042 508)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = nov,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-581.html",
abstract = "This paper describes KRL, a Knowledge Representation
Language designed for use in understander systems. It
outlines both the general concepts which underlie our
research and the details of KRL-0, an experimental
implementation of some of these concepts. KRL is an
attempt to integrate procedural knowledge with a broad
base of declarative forms. These forms provide a
variety of ways to express the logical structure of the
knowledge, in order to give flexibility in associating
procedures (for memory and reasoning) with specific
pieces of knowledge, and to control the relative
accessibility of different facts and descriptions. The
formalism for declarative knowledge is based on
structured conceptual objects with associated
descriptions. These objects form a network of memory
units with several different sorts of linkages, each
having well-specified implications for the retrieval
process. Procedures can be associated directly with the
internal structure of a conceptual object. This
procedural attachment allows the steps for a particular
operation to be determined by characteristics of the
specific entities involved. The control structure of
KRL is based on the belief that the next generation of
intelligent programs will integrate data-directed and
goal-directed processing by using multi-processing. It
provides for a priority-ordered multi-process agenda
with explicit (user-provided) strategies for scheduling
and resource allocation. It provides procedure
directories which operate along with process frameworks
to allow procedural parameterization of the fundamental
system processes for building, comparing, and
retrieving memory structures. Future development of KRL
will include integrating procedure definition with the
descriptive formalism.",
acknowledgement = ack-nhfb,
pdfpages = "43",
xxnumber = "CS-TR-76-581",
}
@TechReport{Chvatal:1976:TRC,
author = "Vaclav Chv{\'a}tal and M. R. Garey and D. S. Johnson",
title = "Two Results Concerning Multicoloring",
type = "Technical Report",
number = "STAN-CS-76-582 (AD-A038 863)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = dec,
year = "1976",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chvatal:1976:DSN,
author = "Vaclav Chv{\'a}tal",
title = "Determining the stability number of a graph",
type = "Technical Report",
number = "STAN-CS-76-583 (AD-A038 864)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "39",
month = dec,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-583.html",
abstract = "We formalize certain rules for deriving upper bounds
on the stability number of a graph. The resulting
system is powerful enough to (i) encompass the
algorithms of Tarjan's type and (ii) provide very short
proofs on graphs for which the stability number equals
the clique-covering number. However, our main result
shows that for almost all graphs with a (sufficiently
large) linear number of edges, proofs within our system
must have at least exponential length.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-76-583",
}
@TechReport{Knuth:1976:DPR,
author = "Donald E. Knuth",
title = "Deletions That Preserve Randomness",
type = "Technical Report",
number = "STAN-CS-77-584 (AD-A038 865)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 32",
month = dec,
year = "1976",
DOI = "https://doi.org/10.1109/TSE.1977.231160",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038865.pdf",
abstract = "This paper discusses dynamic properties of data
structures under insertions and deletions. It is shown
that, in certain circumstances, the result of $n$
random insertions and $m$ random deletions will be
equivalent to $ n - m$ random insertions, under various
interpretations of the word `random' and under various
constraints on the order of insertions and deletions.",
acknowledgement = ack-nhfb,
pdfpages = "37",
remark-1 = "Published in \booktitle{IEEE Transactions on Software
Engineering}, {\bf SE-3}(5) 351--359, September\slash
October 1977, doi:10.1109/TSE.1977.231160",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Concus:1976:NSN,
author = "Paul Concus and Gene H. Golub and Dianne Prost
O'Leary",
title = "Numerical solution of nonlinear elliptic partial
differential equations by a generalized conjugate
gradient method",
type = "Technical Report",
number = "STAN-CS-76-585 (SU326 P30-50)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 43",
month = dec,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-585.html",
abstract = "We have studied previously a generalized conjugate
gradient method for solving sparse positive-definite
systems of linear equations arising from the
discretization of elliptic partial-differential
boundary-value problems. Here, extensions to the
nonlinear case are considered. We split the original
discretized operator into the sum of two operators, one
of which corresponds to a more easily solvable system
of equations, and accelerate the associated iteration
based on this splitting by (nonlinear) conjugate
gradients. The behavior of the method is illustrated
for the minimal surface equation with splittings
corresponding to nonlinear SSOR, to approximate
factorization of the Jacobian matrix, and to elliptic
operators suitable for use with fast direct methods.
The results of numerical experiments are given as well
for a mildly nonlinear example, for which, in the
corresponding linear case, the finite termination
property of the conjugate gradient algorithm is
crucial.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "differential equations, elliptic --- numerical
solutions",
pdfpages = "50",
xxnumber = "CS-TR-76-585",
}
@TechReport{Dershowitz:1976:EPS,
author = "Nachum Dershowitz and Zohar Manna",
title = "The evolution of programs: a system for automatic
program modification",
type = "Technical Report",
number = "STAN-CS-76-586 (AIM-294, AD-A042 516)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = dec,
year = "1976",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-76-586.html",
abstract = "An attempt is made to formulate techniques of program
modification, whereby a program that achieves one
result can be transformed into a new program that uses
the same principles to achieve a different goal. For
example, a program that uses the binary search paradigm
to calculate the square-root of a number may be
modified to divide two numbers in a similar manner, or
vice versa. Program debugging is considered as a
special case of modification: if a program computes
wrong results, it must be modified to achieve the
intended results. The application of abstract program
schemata to concrete problems is also viewed from the
perspective of modification techniques. We have
embedded this approach in a running implementation; our
methods are illustrated with several examples that have
been performed by it.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-76-586",
}
@TechReport{Garey:1977:CRB,
author = "Michael R. Garey and Ronald L. Graham and David S.
Johnson and Donald E. Knuth",
title = "Complexity Results for Bandwidth Minimization",
type = "Technical Report",
number = "STAN-CS-77-587 (AD-A038 867)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 36",
month = feb,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038867.pdf;
https://www.jstor.org/stable/2100947",
abstract = "We present a linear-time algorithm for sparse
symmetric matrices which converts a matrix into
pentadiagonal form (``bandwidth 2''), whenever it is
possible to do so using simultaneous row and column
permutations. On the other hand when an arbitrary
integer $k$ and graph $G$ are given, we show that it is
NP-complete to determine whether or not there exists an
ordering of the vertices with bandwidth $ \leq k$, even
when $G$ is restricted to the class of free trees with
all vertices of degree $ \leq 3$. Related problems for
acyclic directed graphs (upper triangular matrices) are
also discussed.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "41",
remark-1 = "Published in \booktitle{SIAM Journal on Applied
Mathematics}, {\bf 34}(3) 477--495, May 1978",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Manna:1977:SSB,
author = "Zohar Manna and Richard J. Waldinger",
title = "Is `sometime' sometimes better than `always'?
{Intermittent} assertions in proving program
correctness",
type = "Technical Report",
number = "STAN-CS-76-558 (AIM-281.1, AD-A042 507)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 38",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "See also original version \cite{Manna:1976:SSB}",
URL = "http://i.stanford.edu/TR/CS-TR-76-558.html",
abstract = "This paper explores a technique for proving the
correctness and termination of programs simultaneously.
This approach, which we call the intermittent-assertion
method, involves documenting the program with
assertions that must be true at some time when control
passes through the corresponding point, but that need
not be true every time. The method, introduced by
Burstall, promises to provide a valuable complement to
the more conventional methods. We first introduce the
intermittent-assertion method with a number of examples
of correctness and termination proofs. Some of these
proofs are markedly simpler than their conventional
counterparts. On the other hand, we show that a proof
of correctness or termination by any of the
conventional techniques can be rephrased directly as a
proof using intermittent assertions. Finally, we show
how the intermittent assertion method can be applied to
prove the validity of program transformations and the
correctness of continuously operating programs. This is
a revised and simplified version of a previous paper
with the same title (AIM-281, June 1976).",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-76-558",
}
@TechReport{Weyhrauch:1977:UMF,
author = "Richard W. Weyhrauch",
title = "A users manual for {FOL}",
type = "Technical Report",
number = "STAN-CS-77-432",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 68",
month = jul,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-432.html",
abstract = "This manual explains how to use of the proof checker
FOL, and supersedes all previous manuals. FOL checks
proofs of a natural deduction style formulation of
first order functional calculus with equality augmented
in the following ways: (i) it is a many-sorted
first-order logic in which a partial order over the
sorts may be specified; (ii) conditional expressions
are allowed for forming terms (iii) axiom schemata with
predicate and function parameters are allowed (iv)
purely propositional deductions can be made in a single
step; (v) a partial model of the language can be built
in a LISP environment and some deductions can be made
by direct computation in this model; (vi) there is a
limited ability to make metamathematical arguments;
(vii) there are many operational conveniences. A major
goal of FOL is to create an environment where formal
proofs can be carefully examined with the eventual aim
of designing practical tools for manipulating proofs in
pure mathematics and about the correctness of programs.
This includes checking proofs generated by other
programs. FOL is also a research tool in modeling
common-sense reasoning including reasoning about
knowledge and belief.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-77-432",
}
@TechReport{Chan:1977:CSV,
author = "Tony Fan C. Chan",
title = "On computing the singular value decomposition",
type = "Technical Report",
number = "STAN-CS-77-588 (PB-266 381/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/r/reinsch-christian-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-588.html",
abstract = "The most well-known and widely-used algorithm for
computing the Singular Value Decomposition (SVD) of an
$ m \times n $ rectangular matrix $A$ nowadays is the
Golub--Reinsch algorithm [1971]. In this paper, it is
shown that by (1) first triangularizing the matrix $A$
by Householder transformations before bidiagonalizing
it, and (2) accumulating some left transformations on a
$ n \times n$ array instead of on an $ m \times n$
array, the resulting algorithm is often more efficient
than the Golub--Reinsch algorithm, especially for
matrices with considerably more rows than columns $ (m
\gg n)$, such as in least squares applications. The two
algorithms are compared in terms of operation counts,
and computational experiments that have been carried
out verify the theoretical comparisons. The modified
algorithm is more efficient even when $m$ is only
slightly greater than $n$, and in some cases can
achieve as much as 50\% savings when $ m \gg n$. If
accumulation of left transformations is desired, then $
n^2$ extra storage locations are required (relatively
small if $ m > > n$), but otherwise no extra storage is
required. The modified algorithm uses only orthogonal
transformations and is therefore numerically stable. In
the Appendix, we give the Fortran code of a hybrid
method which automatically selects the more efficient
of the two algorithms to use depending upon the input
values for $m$ and $n$.",
acknowledgement = ack-nhfb,
pdfpages = "64",
xxnumber = "CS-TR-77-588",
}
@TechReport{Engelmore:1977:KBS,
author = "Robert S. Engelmore and H. Penny Nii",
title = "A knowledge-based system for the interpretation of
protein {X}-ray crystallographic data",
type = "Technical Report",
number = "STAN-CS-77-589 (HPP-77-2, AD-A038 866)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-589.html",
abstract = "The broad goal of this project is to develop
intelligent computational systems to infer the
three-dimensional structures of proteins from x-ray
crystallographic data. The computational systems under
development use both formal and judgmental knowledge
from experts to select appropriate procedures and to
constrain the space of plausible protein structures.
The hypothesis generating and testing procedures
operate upon a variety of representations of the data,
and work with several different descriptions of the
structure being inferred. The system consists of a
number of independent but cooperating knowledge sources
which propose, augment and verify a solution to the
problem as it is incrementally generated.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-77-589",
}
@TechReport{Knuth:1977:IPI,
author = "Donald E. Knuth and Michael S. Paterson",
title = "Identities from Partition Involutions",
type = "Technical Report",
number = "STAN-CS-77-590 (AD-A038 868)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 22",
month = feb,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA038868.pdf",
abstract = "Subbarao and Andrews have observed that the
combinatorial technique used by F. Franklin to prove
Euler's famous partition identity\par
$$ (1 - x) (1 - x^2) (1 - x^3) (1 - x^4) \cdots {} = 1
- x - x^2 + x^5 + x^7 - x^{12} - x^{15} + \cdots {} $$
\par
can be applied to prove the more general formula\par
$$ 1 - x - x^2 (1 - x y) - x^3 y^2 (1 - x y) (1 - x^2
y) - x^4 y^3 (1 - x y) (1 - x^2 y)(1 - x^3 y) - \cdots
{} = 1 - x + x^2 y + x^5 y^3 + x^7 y^4 - x^{12} y^6 -
x^{15} y^7 + \cdots {} $$ \par
which reduces to Euler's when $ y = 1 $. This note
shows that several finite versions of Euler's identity
can also be demonstrated using this elementary
technique; for example,\par
$$ \ldots {} $$ \par
By using Sylvester's modification of Franklin's
construction, it is also possible to generalize
Jacobi's triple product identity.",
acknowledgement = ack-nhfb,
pdfpages = "30",
remark = "Published in \booktitle{The Fibonacci Quarterly}, {\bf
16}(3) 198--212, June 1978.
doi:10.1080/00150517.1978.12430319.",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Bolles:1977:VVW,
author = "Robert C. Bolles",
title = "Verification Vision Within a Programmable Assembly
System",
type = "Technical Report",
number = "STAN-CS-77-591 (AIM-295)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "245",
month = feb,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cartwright:1977:PFS,
author = "Robert {Cartwright, Jr.}",
title = "A Practical Formal Semantic Definition and
Verification Systems for Typed {LISP}",
type = "Technical Report",
number = "STAN-CS-77-592 (AIM-296)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "158",
month = feb,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Scott:1977:ECP,
author = "A. Carlisle Scott and William J. Clancey and Randall
Davis and Edward H. Shortliffe",
title = "Explanation capabilities of production-based
consultation systems",
type = "Technical Report",
number = "STAN-CS-77-593 (HPP-77-1)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = feb,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-593.html",
abstract = "A computer program that models an expert in a given
domain is more likely to be accepted by experts in that
domain, and by non-experts seeking its advice, if the
system can explain its actions. An explanation
capability not only adds to the system's credibility,
but also enables the non-expert user to learn from it.
Furthermore, clear explanations allow an expert to
check the system's `reasoning', possibly discovering
the need for refinements and additions to the system's
knowledge base. In a developing system, an explanation
capability can be used as a debugging aid to verify
that additions to the system are working as they
should. This paper discusses the general
characteristics of explanation systems: what types of
explanations they should be able to give, what types of
knowledge will be needed in order to give these
explanations, and how this knowledge might be
organized. The explanation facility in MYCIN is
discussed as an illustration of how the various
problems might be approached.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-77-593",
}
@TechReport{Stritter:1977:FM,
author = "Edwin P. Stritter",
title = "File Migration",
type = "Technical Report",
number = "STAN-CS-77-594 (SLAC-200)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "112",
month = apr,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lewis:1977:ASM,
author = "John Gregg Lewis",
title = "Algorithms for Sparse Matrix Eigenvalue Problems",
type = "Technical Report",
number = "STAN-CS-77-595",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "212",
month = apr,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Stefik:1977:RKB,
author = "Mark J. Stefik and Nancy Martin",
title = "A review of knowledge based problem solving as a basis
for a genetics experiment designing system",
type = "Technical Report",
number = "STAN-CS-77-596 (HPP-77-5)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "97",
month = feb,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-596.html",
abstract = "It is generally accepted that problem solving systems
require a wealth of domain specific knowledge for
effective performance in complex domains. This report
takes the view that all domain specific knowledge
should be expressed in a knowledge base. With this in
mind, the ideas and techniques from problem solving and
knowledge base research are reviewed and outstanding
problems are identified. Finally, a task domain is
characterized in terms of objects, actions, and
control/strategy knowledge and suggestions are made for
creating a uniform knowledge base management system to
be used for knowledge acquisition, problem solving, and
explanation.",
acknowledgement = ack-nhfb,
pdfpages = "96",
xxnumber = "CS-TR-77-596",
}
@TechReport{Buchanan:1977:MDL,
author = "Bruce G. Buchanan and Tom M. Mitchell",
title = "Model-Directed Learning of Production Rules",
type = "Technical Report",
number = "STAN-CS-77-597 (HPP-77-6)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-597.html",
abstract = "The Meta-DENDRAL program is described in general terms
that are intended to clarify the similarities and
differences to other learning programs. Its approach of
model-directed heuristic search through a complex space
of possible rules appears well suited to many induction
tasks. The use of a strong model of the domain to
direct the rule search has been demonstrated for rule
formation in two areas of chemistry. The high
performance of programs which use the generated rules
attests to the success of this learning strategy.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-77-597",
}
@TechReport{Jonassen:1977:TAW,
author = "Arne T. Jonassen and Donald E. Knuth",
title = "A Trivial Algorithm Whose Analysis Isn't",
type = "Technical Report",
number = "STAN-CS-77-598 (AD-A040 486)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 32",
month = apr,
year = "1977",
bibdate = "Thu Nov 27 18:18:30 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA040486.pdf",
abstract = "Very few theoretical results have been obtained to
date about the behavior of information retrieval
algorithms under random deletions, as well as random
insertions. The present paper offers a possible
explanation for this dearth of results, by showing that
one of the simplest such algorithms already requires a
surprisingly intricate analysis. Even when the data
structure never contains more than three items at a
time, it is shown that the performance of the standard
tree search\slash insertion\slash deletion algorithm
involves Bessel functions and the solution of bivariate
integral equations. A step-by-step expository analysis
of this problem is given, and it is shown how the
difficulties arise and can be surmounted.",
acknowledgement = ack-nhfb,
pdfpages = "36",
remark = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Knuth:1977:ELS,
author = "Donald E. Knuth and Arnold Sch{\"o}nhage",
title = "The Expected Linearity of a Simple Equivalence
Algorithm",
type = "Technical Report",
number = "STAN-CS-77-599 (AD-A040 441)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 56",
month = mar,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA040441.pdf",
abstract = "The average time needed to form unions of disjoint
equivalence classes , using an algorithm suggested by
Aho, Hopcroft, and Ullman, is shown to be linear in the
total number of elements, thereby establishing a
conjecture of A. C. Yao. he analytic methods used to
prove this result are of interest in themselves, as
they are based on extensions of Stepanov's approach to
the study of random graphs. Several refinement of Yao's
analyses of related algorithms are also presented.",
acknowledgement = ack-nhfb,
keywords = "analysis of algorithms; asymptotic methods; connected
components; random graphs; random trees; recurrence
relations; set union algorithms; union-find problems",
pdfpages = "60",
remark-1 = "Published in \booktitle{}",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Brown:1977:APN,
author = "Mark R. Brown",
title = "The Analysis of a Practical and Nearly Optimal
Priority Queue",
type = "Technical Report",
number = "STAN-CS-77-600 (AD-A040 538)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "102",
month = apr,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Reiser:1977:AAR,
author = "John Frederick Reiser",
title = "Analysis of Additive Random Number Generators",
type = "Technical Report",
number = "STAN-CS-77-601 (AD-A045 652)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 34",
month = apr,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA045652.pdf",
abstract = "This thesis presents an analysis of the distribution
of residues generated by the $ k^{\rm th}$-order linear
homogeneous recurrence $ y_{n + k} = a_{k - 1} y + {n +
k - 1} + \cdots {} + a_0 y_n \bmod p^\alpha $ when $
x^k - a_{k - 1} x^{k - 1} - \cdots {} - a_0$ is a
primitive polynomial in $ Z_p[x]$. It is shown that for
$ t \leq k$ the tuples of $t$ consecutive residues are
equidistributed in $t$ dimensions in the limit as $
\alpha \to \infty $, subject only to a much weaker
condition on the distribution of the residues. When
specialized to $ |a_j| \leq 1$, the recurrence is the
basis for a computer random number generator which can
be efficiently implemented directly in floating-point
arithmetic with no multiplication and little machine
dependence. The results of empirical tests comparing
generators of this type with standard linear
congruential generators are also presented.",
acknowledgement = ack-nhfb,
pdfpages = "43",
remark = "This is the author's Ph.D. thesis. The PDF file is
OCR'ed scans of microfiche page images.",
}
@TechReport{deBoor:1977:NSR,
author = "Carl de Boor and Gene H. Golub",
title = "The numerically stable reconstruction of a {Jacobi}
matrix from spectral data",
type = "Technical Report",
number = "STAN-CS-77-602",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 18",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-602.html",
abstract = "We show how to construct, from certain spectral data,
a discrete inner product for which the associated
sequence of monic orthogonal polynomials coincides with
the sequence of appropriately normalized characteristic
polynomials of the left principal submatrices of the
Jacobi matrix. The generation of these orthogonal
polynomials via their three term recurrence relation,
as popularized by Forsythe, then provides a stable
means of computing the entries of the Jacobi matrix.
The resulting algorithm might be of help in the
approximate solution of inverse eigenvalue problems for
Sturm-Liouville equations. Our construction provides,
incidentally, very simple proofs of known results
concerning existence and uniqueness of a Jacobi matrix
satisfying given spectral data and its continuous
dependence on that data.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "Jacobi varieties; matrices",
pdfpages = "26",
xxnumber = "CS-TR-77-602",
}
@TechReport{Tarjan:1977:RMR,
author = "Robert Endre Tarjan",
title = "Reference machines require non-linear time to maintain
disjoint sets",
type = "Technical Report",
number = "STAN-CS-77-603 (AD-A041 292)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-603.html",
abstract = "This paper describes a machine model intended to be
useful in deriving realistic complexity bounds for
tasks requiring list processing. As an example of the
use of the model, the paper shows that any such machine
requires non-linear time in the worst case to compute
unions of disjoint sets on-line. All set union
algorithms known to me are instances of the model and
are thus subject to the derived bound. One of the known
algorithms achieves the bound to within a constant
factor.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-77-603",
}
@TechReport{Chan:1977:CDL,
author = "Tony Fan C. Chan and Joseph Oliger",
title = "Control of the dissipativity of {Lax--Wendroff} type
methods for first order systems or hyperbolic
equations",
type = "Technical Report",
number = "STAN-CS-77-604 (AD-A040 399)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-604.html",
abstract = "Lax--Wendroff methods for hyperbolic systems have two
characteristics which are sometimes troublesome. They
are sometimes too dissipative --- they may smooth the
solution excessively --- and their dissipative behavior
does not affect all modes of the solution equally. Both
of these difficulties can be remedied by adding
properly chosen accretive terms. We develop
modifications of the Lax--Wendroff method which
equilibrate the dissipativity over the fundamental
modes of the solution and allow the magnitude of the
dissipation to be controlled. We show that these
methods are stable for the mixed initial boundary value
problem and develop analogous formulations for the
two-step Lax--Wendroff and MacCormack methods.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-77-604",
}
@TechReport{Smith:1977:MLS,
author = "Reid G. Smith and Tom M. Mitchell and Richard A.
Chestek and Bruce G. Buchanan",
title = "A model for learning systems",
type = "Technical Report",
number = "STAN-CS-77-605 (HPP-77-14, AD-A042 834)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-605.html",
abstract = "A model for learning systems is presented, and
representative AI, pattern recognition, and control
systems are discussed in terms of its framework. The
model details the functional components felt to be
essential for any learning system, independent of the
techniques used for its construction, and the specific
environment in which it operates. These components are
performance element, instance selector, critic,
learning element, blackboard, and world model.
Consideration of learning system design leads naturally
to the concept of a layered system, each layer
operating at a different level of abstraction.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-77-605",
}
@TechReport{Clancy:1977:PPS,
author = "Michael J. Clancy and Donald E. Knuth",
title = "A programming and problem-solving seminar",
type = "Technical Report",
number = "STAN-CS-77-606",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = apr,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-606.html;
http://www-db.stanford.edu/TR/CS-TR-77-606.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-77-606",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS 204, Problem
Seminar, during autumn quarter 1976. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms came up during the discussions,
the notes may be of use to graduate students of
computer science at other universities, as well as to
their professors and to professional people in the
``real world''.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-77-606",
pdfpages = "108",
xxnumber = "CS-TR-77-606",
}
@TechReport{Owicki:1977:SPA,
author = "Susan S. Owicki",
title = "Specifications and proofs for abstract data types in
concurrent programs",
type = "Technical Report",
number = "STAN-CS-77-607 (CSL-TR-133)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-607.html",
abstract = "Shared abstract data types, such as queues and
buffers, are useful tools for building well-structured
concurrent programs. This paper presents a method for o
specifying shared types in a way that simplifies
concurrent program verification. The specifications
describe the operations of the shared type in terms of
their effect on variables of the process invoking the
operation. This makes it possible to verify the
processes independently, reducing the complexity of the
proof. The key to defining such specifications is the
concept of a private variable: a variable which is part
of a shared object but belongs to just one process.
Shared types can be implemented using an extended form
of monitors; proof rules are given for verifying that a
monitor correctly implements its specifications.
Finally, it is shown how concurrent programs can be
verified using the specifications of their shared
types. The specification and proof techniques are
illustrated with a number of examples involving a
shared bounded buffer.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-77-607",
}
@TechReport{Simon:1977:SSR,
author = "Istvan Simon",
title = "On Some Subrecursive Reducibilities",
type = "Technical Report",
number = "STAN-CS-77-608",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "102",
month = jun,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tarjan:1977:CCA,
author = "Robert Endre Tarjan",
title = "Complexity of combinatorial algorithms",
type = "Technical Report",
number = "STAN-CS-77-609 (AD-A043 362)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-609.html",
abstract = "This paper examines recent work on the complexity of
combinatorial algorithms, highlighting the aims of the
work, the mathematical tools used, and the important
results. Included are sections discussing ways to
measure the complexity of an algorithm, methods for
proving that certain problems are very hard to solve,
tools useful in the design of good algorithms, and
recent improvements in algorithms for solving ten
representative problems. The final section suggests
some directions for future research.",
acknowledgement = ack-nhfb,
pdfpages = "90",
xxnumber = "CS-TR-77-609",
}
@TechReport{Winograd:1977:FUD,
author = "Terry A. Winograd",
title = "A Framework for Understanding Discourse",
type = "Technical Report",
number = "STAN-CS-77-610 (AIM-297)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "97",
month = jun,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1977:LCP,
author = "Zohar Manna and Richard J. Waldinger",
title = "The logic of computer programming",
type = "Technical Report",
number = "STAN-CS-77-611 (AIM-298, AD-A046 703)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "90",
month = aug,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-611.html",
abstract = "Techniques derived from mathematical logic promise to
provide an alternative to the conventional methodology
for constructing, debugging, and optimizing computer
programs. Ultimately, these techniques are intended to
lead to the automation of many of the facets of the
programming process. This paper provides a unified
tutorial exposition of the logical techniques,
illustrating each with examples. The strengths and
limitations of each technique as a practical
programming aid are assessed and attempts to implement
these methods in experimental systems are discussed.",
acknowledgement = ack-nhfb,
pdfpages = "88",
xxnumber = "CS-TR-77-611",
}
@TechReport{Nii:1977:RBU,
author = "H. Penny Nii and Edward A. Feigenbaum",
title = "Rule-Based Understanding of Signals",
type = "Technical Report",
number = "STAN-CS-77-612 (HPP-77-7, AD-A042 756)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = jun,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Spedicato:1977:SCQ,
author = "E. Spedicato",
title = "On Some Classes of Quasi-{Newton} Methods for Systems
of Nonlinear Algebraic Equations",
type = "Technical Report",
number = "STAN-CS-77-613",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = jun,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1977:CFF,
author = "Zohar Manna and Adi Shamir",
title = "The convergence of functions to fixedpoints of
recursive definitions",
type = "Technical Report",
number = "STAN-CS-77-614 (AIM-299)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = may,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-614.html",
abstract = "The classical method for constructing the least
fixedpoint of a recursive definition is to generate a
sequence of functions whose initial element is the
totally undefined function and which converges to the
desired least fixedpoint. This method, due to Kleene,
cannot be generalized to allow the construction of
other fixedpoints. In this paper we present an
alternate definition of convergence and a new
fixedpoint access method of generating sequences of
functions for a given recursive definition. The initial
function of the sequence can be an arbitrary function,
and the sequence will always converge to a fixedpoint
that is `close' to the initial function. This defines a
monotonic mapping from the set of partial functions
onto the set of all fixedpoints of the given recursive
definition.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-77-614",
}
@TechReport{Glowinski:1977:NMF,
author = "Roland Glowinski and Olivier Pironneau",
title = "Numerical methods for the first biharmonic equation
and for the two-dimensional {Stokes} problem",
type = "Technical Report",
number = "STAN-CS-77-615",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-615.html",
abstract = "We describe in this report various methods, iterative
and `almost direct,' for solving the first biharmonic
problem on general two-dimensional domains once the
continuous problem has been approximated by an
appropriate mixed finite element method. Using the
approach described in this report we recover some well
known methods for solving the first biharmonic equation
as a system of coupled harmonic equations, but some of
the methods discussed here are completely new,
including a conjugate gradient type algorithm. In the
last part of this report we discuss the extension of
the above methods to the numerical solution of the two
dimensional Stokes problem in $p$-connected domains $
(p \geq 1)$ through the stream function-vorticity
formulation.",
acknowledgement = ack-nhfb,
pdfpages = "90",
xxnumber = "CS-TR-77-615",
}
@TechReport{Kreiss:1977:SFM,
author = "Heinz-Otto Kreiss and Joseph Oliger",
title = "Stability of the {Fourier} method",
type = "Technical Report",
number = "STAN-CS-77-616 (AD-A046 311)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = aug,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-616.html",
abstract = "In this paper we develop a stability theory for the
Fourier (or pseudo-spectral) method for linear
hyperbolic and parabolic partial differential equations
with variable coefficients.",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-77-616",
}
@TechReport{Winograd:1977:SCS,
author = "Terry A. Winograd",
title = "On some Contested Suppositions of Generative
Linguistics about the Scientific Study of Language",
type = "Technical Report",
number = "STAN-CS-77-617 (AIM-300)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = sep,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nilsson:1977:PSA,
author = "Nils J. Nilsson",
title = "A production system for automatic deduction",
type = "Technical Report",
number = "STAN-CS-77-618 (HPP-77-28, AD-A045 948)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = aug,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-618.html",
abstract = "A new predicate calculus deduction system based on
production rules is proposed. The system combines
several developments in Artificial Intelligence and
Automatic Theorem Proving research including the use of
domain-specific inference rules and separate mechanisms
for forward and backward reasoning. It has a clean
separation between the data base, the production rules,
and the control system. Goals and subgoals are
maintained in an AND/OR tree to represent assertions.
The production rules modify these structures until they
`connect' in a fashion that proves the goal theorem.
Unlike some previous systems that used production
rules, ours is not limited to rules in Horn Clause
form. Unlike previous PLANNER-like systems, ours can
handle the full range of predicate calculus expressions
including those with quantified variables, disjunctions
and negations.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-77-618",
}
@TechReport{Paul:1977:TST,
author = "Wolfgang J. Paul and Robert Endre Tarjan",
title = "Time-space trade-offs in a pebble game",
type = "Technical Report",
number = "STAN-CS-77-619 (AD-A046 481)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = jul,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-619.html",
abstract = "A certain pebble game on graphs has been studied in
various contexts as a model for the time and space
requirements of computations. In this note it is shown
that there exists a family of directed acyclic graphs $
G_n $ and constants $ c_1 $, $ c_2 $, $ c_3 $ such that
(1) $ G_n $ has n nodes and each node in $ G_n $ has
indegree at most 2. (2) Each graph $ G_n $ can be
pebbled with $ c_1 \sqrt {n} $ pebbles in n moves. (3)
Each graph $ G_n $ can also be pebbled with $ C_2 \sqrt
{n} $ pebbles, $ c_2 $ < $ c_1 $, but every strategy
which achieves this has at least $ 2^{c_3 \sqrt {n}} $
moves.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-77-619",
}
@TechReport{Bolstad:1977:AFM,
author = "J. Bolstad and J. Oliger",
title = "Adaptation of the {Fourier} Method to the Nonperiodic
Initial Boundary Value Problem",
type = "Technical Report",
number = "STAN-CS-77-620",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "80",
month = sep,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Feigenbaum:1977:AAI,
author = "Edward A. Feigenbaum",
title = "The art of artificial intelligence: {I}. {Themes} and
case studies of knowledge engineering",
type = "Technical Report",
number = "STAN-CS-77-621 (HPP-77-25, AD-A046 289)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "80",
month = aug,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-621.html",
abstract = "The knowledge engineer practices the art of bringing
the principles and tools of AI research to bear on
difficult applications problems requiring experts'
knowledge for their solution. The technical issues of
acquiring this knowledge, representing it, and using it
appropriately to construct and explain
lines-of-reasoning, are important problems in the
design of knowledge-based systems. Various systems that
have achieved expert level performance in scientific
and medical inference illuminates the art of knowledge
engineering and its parent science, Artificial
Intelligence.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-77-621",
}
@TechReport{Golub:1977:GCV,
author = "Gene H. Golub and Michael Heath and Grace Wahba",
title = "Generalized cross-validation as a method for choosing
a good ridge parameter",
type = "Technical Report",
number = "STAN-CS-77-622",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = sep,
year = "1977",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Also issued as Department of Statistics Technical
Report number 491, University of Wisconsin, Madison,
WI.",
URL = "http://www.stat.yale.edu/~jtc5/312_612/readings/generalized-cross-validation-and-ridge_Golub-Heath-Wahba_79.pdf;
https://www.jstor.org/stable/10.2307/1268518",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "graphic methods; regression analysis",
remark = "Published in \booktitle{Technometrics}, {\bf 21}(2)
215--223, May 1979,
doi:10.1080/00401706.1979.10489751",
xxnumber = "CS-TR-77-622",
}
@TechReport{Boley:1977:IEPa,
author = "D. Boley and Gene H. Golub",
title = "Inverse eigenvalue problems for band matrices",
type = "Technical Report",
number = "STAN-CS-77-623",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = sep,
year = "1977",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "eigenvalues; matrices",
remark = "Published in \booktitle{Numerical Analysis:
Proceedings of the Biennial Conference held at Dundee,
June 28--July 1, 1977}, Springer 1978, ISBN
0-387-08538-6",
xxnumber = "CS-TR-77-623",
}
@TechReport{McCarthy:1977:RRC,
author = "John McCarthy and Thomas O. Binford and Cordell C.
Green and David C. Luckham and Zohar Manna and Terry A.
Winograd and Lester D. Earnest",
title = "Recent research in computer science",
type = "Technical Report",
number = "STAN-CS-77-624 (AIM-301, AD-A044 231)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "118",
month = jun,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-624.html",
abstract = "This report summarizes recent accomplishments in six
related areas: (1) basic AI research and formal
reasoning, (2) image understanding, (3) mathematical
theory of computation, (4) program verification, (5)
natural language understanding, and (6) knowledge based
programming.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
pdfpages = "126",
xxnumber = "CS-TR-77-624",
}
@TechReport{Brown:1977:FMA,
author = "Mark R. Brown and Robert Endre Tarjan",
title = "A fast merging algorithm",
type = "Technical Report",
number = "STAN-CS-77-625 (AD-A046 090)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = aug,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-625.html",
abstract = "We give an algorithm which merges sorted lists
represented as balanced binary trees. If the lists have
lengths $m$ and $ n (m \leq n)$, then the merging
procedure runs in $ O(m \log n / m) $ steps, which is
the same order as the lower bound on all
comparison-based algorithms for this problem.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-77-625",
}
@TechReport{Yao:1977:LSA,
author = "Andrew Chi-Chih Yao",
title = "On the loop switching addressing problem",
type = "Technical Report",
number = "STAN-CS-77-626",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-626.html",
abstract = "The following graph addressing problem was studied by
Graham and Pollak in devising a routing scheme for
Pierce's Loop Switching Network. Let $G$ be a graph
with $n$ vertices. It is desired to assign to each
vertex $ v_i$ an address in $ {{0, 1, *}}^\ell $, such
that the Hamming distance between the addresses of any
two vertices agrees with their distance in $G$. Let $
N(G)$ be the minimum length $ \ell $ for which an
assignment is possible. It was shown by Graham and
Pollak that $ N(G) \leq m_G(n - 1)$, where $ m_G$ is
the diameter of $G$. In the present paper, we shall
prove that $ N(G) \leq 1.09 (\lg m_G)n + 8 n$ by an
explicit construction. This shows in particular that
any graph has an addressing scheme of length $ O(n \log
n)$.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-77-626",
}
@TechReport{Lipton:1977:STP,
author = "Richard J. Lipton and Robert Endre Tarjan",
title = "A separator theorem for planar graphs",
type = "Technical Report",
number = "STAN-CS-77-627 (AD-A048 786)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-627.html",
abstract = "Let $G$ be any $n$-vertex planar graph. We prove that
the vertices of $G$ can be partitioned into three sets
$A$, $B$, $C$ such that no edge joins a vertex in $A$
with a vertex in $B$, neither $A$ nor $B$ contains more
than $ 2 n / 3 $ vertices, and $C$ contains no more
than $ 2 \sqrt {2} \sqrt {2} $ vertices. We exhibit an
algorithm which finds such a partition $A$, $B$, $C$ in
$ O(n)$ time.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-77-627",
}
@TechReport{Lipton:1977:APS,
author = "Richard J. Lipton and Robert Endre Tarjan",
title = "Applications of a planar separator theorem",
type = "Technical Report",
number = "STAN-CS-77-628 (AD-A048 787)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-628.html",
abstract = "Any $n$-vertex planar graph has the property that it
can be divided into components of roughly equal size by
removing only $ O(\sqrt {n}) $ vertices. This separator
theorem, in combination with a divide-and-conquer
strategy, leads to many new complexity results for
planar graph problems. This paper describes some of
these results.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-77-628",
}
@TechReport{Yao:1977:CPM,
author = "Andrew Chi-Chih Yao",
title = "The complexity of pattern matching for a random
string",
type = "Technical Report",
number = "STAN-CS-77-629",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "43",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-629.html",
abstract = "We study the average-case complexity of finding all
occurrences of a given pattern $ \alpha $ in an input
text string. Over an alphabet of q symbols, let $
c(\alpha, n) $ be the minimum average number of
characters that need to be examined in a random text
string of length $n$. We prove that, for large $m$,
almost all patterns $ \alpha $ of length $m$ satisfy $
c(\alpha, n) = \Theta (\lceil \log_q ({n - m} / {\ln m}
+ 2) \rceil)$ if $ m \leq n \leq 2 m$, and $ c(\alpha,
n) = \Theta ({\lceil \log_q m \rceil } / m n)$ if $ n >
2 m$. This in particular confirms a conjecture raised
in a recent paper by Knuth, Morris, and Pratt [1977].",
acknowledgement = ack-nhfb,
pdfpages = "46",
xxnumber = "CS-TR-77-629",
}
@TechReport{Manna:1977:SDP,
author = "Zohar Manna and Richard Waldinger",
title = "Synthesis: Dreams => Programs",
type = "Technical Report",
number = "STAN-CS-77-630 (AIM-302, AD-AO49 761)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "119",
month = oct,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dershowitz:1977:IRP,
author = "Nachum Dershowitz and Zohar Manna",
title = "Inference rules for program annotation",
type = "Technical Report",
number = "STAN-CS-77-631 (AIM-303, AD-A050 806)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-631.html",
abstract = "Methods are presented whereby an Algol-like program,
given together with its specifications, can be
documented automatically. The program is incrementally
annotated with invariant relationships that hold
between program variables at intermediate points in the
program and explain the actual workings of the program
regardless of whether the program is correct. Thus this
documentation can be used for proving the correctness
of the program or may serve as an aid in the debugging
of an incorrect program. The annotation techniques are
formulated as Hoare-like inference rules which derive
invariants from the assignment statements, from the
control structure of the program, or, heuristically,
from suggested invariants. The application of these
rules is demonstrated by two examples which have run on
an experimental implementation.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-77-631",
}
@TechReport{Wagner:1977:HV,
author = "Todd Jeffery Wagner",
title = "Hardware Verification",
type = "Technical Report",
number = "STAN-CS-77-632 (AIM-304, AD-A048 684)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "102",
month = oct,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Faught:1977:MIC,
author = "William Faught",
title = "Motivation and Intensionality in a Computer Simulation
Model",
type = "Technical Report",
number = "STAN-CS-77-633 (AIM-305, AD-A048 660)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "104",
month = oct,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hoffmann:1977:NPGb,
author = "Walter Hoffmann and Beresford N. Parlett",
title = "A new proof of global convergence for the tridiagonal
{$ Q L $} algorithm",
type = "Technical Report",
number = "STAN-CS-77-634",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/p/parlett-beresford-n.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-634.html",
abstract = "By exploiting the relation of the $ Q L $ algorithm to
inverse iteration we obtain a proof of global
convergence which is more conceptual and less
computational than previous analyses. The proof uses a
new, but simple, error estimate for the first step of
inverse iteration.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-77-634",
}
@TechReport{Golub:1977:BLMa,
author = "Gene H. Golub and Franklin T. Luk and Michael L.
Overton",
title = "A block {Lanczos} method to compute the singular
values and corresponding singular vectors of a matrix",
type = "Technical Report",
number = "STAN-CS-77-635",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "80",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-635.html",
abstract = "We present a block Lanczos method to compute the
largest singular values and corresponding left and
right singular vectors of a large sparse matrix. Our
algorithm does not transform the matrix $A$ but
accesses it only through a user-supplied routine which
computes $ A X $ or $ A^t X $ for a given matrix $X$.
This paper also includes a thorough discussion of the
various ways to compute the singular value
decomposition of a banded upper triangular matrix; this
problem arises as a subproblem to be solved during the
block Lanczos procedure.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "86",
subject-dates = "Cornelius Lanczos (2 February 1893--25 June 1974)",
xxnumber = "CS-TR-77-635",
}
@TechReport{Bube:1977:CTI,
author = "Kenneth P. Bube",
title = "{$ C^m $} convergence of trigonometric interpolants",
type = "Technical Report",
number = "STAN-CS-77-636 (AD-A048 788)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = oct,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-636.html",
abstract = "For $ m \geq 0 $, we obtain sharp estimates of the
uniform accuracy of the $m$-th derivative of the
n-point trigonometric interpolant of a function for two
classes of periodic functions on $R$. As a corollary,
the $n$-point interpolant of a function in $ C^k $
uniformly approximates the function to order $ o(n^{1 /
2 - k})$, improving the recent estimate of $ O(n^{1 -
k})$. These results remain valid if we replace the
trigonometric interpolant by its $K$-th partial sum,
replacing $n$ by $K$ in the estimates.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-77-636",
}
@TechReport{Ramshaw:1977:GSS,
author = "Lyle H. Ramshaw",
title = "On the gap structure of sequences of points on a
circle",
type = "Technical Report",
number = "STAN-CS-77-637",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = nov,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-637.html",
abstract = "Considerable mathematical effort has gone into
studying sequences of points in the interval (0,1)
which are evenly distributed, in the sense that certain
intervals contain roughly the correct percentages of
the first n points. This paper explores the related
notion in which a sequence is evenly distributed if its
first n points split a given circle into intervals
which are roughly equal in length, regardless of their
relative positions. The sequence $ x_k $ = ($ \log_2 $
(2k-1) mod 1) was introduced in this context by
DeBruijn and Erd{\H{o}}s. We will see that the gap
structure of this sequence is uniquely optimal in a
certain sense, and optimal under a wide class of
measures.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-77-637",
}
@TechReport{OLeary:1977:GCG,
author = "Dianne Prost O'Leary",
title = "A generalized conjugate gradient algorithm for solving
a class of quadratic programming problems",
type = "Technical Report",
number = "STAN-CS-77-638 (SU326 P30-57)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "49",
month = dec,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-638.html",
abstract = "In this paper we apply matrix splitting techniques and
a conjugate gradient algorithm to the problem of
minimizing a convex quadratic form subject to upper and
lower bounds on the variables. This method exploits
sparsity structure in the matrix of the quadratic form.
Choices of the splitting operator are discussed and
convergence results are established. We present the
results of numerical experiments showing the
effectiveness of the algorithm on free boundary
problems for elliptic partial differential equations,
and we give comparisons with other algorithms.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-77-638",
}
@TechReport{Green:1977:PSK,
author = "Cordell C. Green and David R. Barstow",
title = "On program synthesis knowledge",
type = "Technical Report",
number = "STAN-CS-77-639 (AIM-306, AD-A053 175)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "63",
month = nov,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-639.html",
abstract = "This paper presents a body of program synthesis
knowledge dealing with array operations, space
reutilization, the divide and conquer paradigm,
conversion from recursive paradigms to iterative
paradigms, and ordered set enumerations. Such knowledge
can be used for the synthesis of efficient and in-place
sorts including quicksort, mergesort, sinking sort, and
bubble sort, as well as other ordered set operations
such as set union, element removal, and element
addition. The knowledge is explicated to a level of
detail such that it is possible to codify this
knowledge as a set of program synthesis rules for use
by a computer-based synthesis system. The use and
content of this set of programming rules is illustrated
herein by the methodical synthesis of bubble sort,
sinking sort, quicksort, and mergesort.",
acknowledgement = ack-nhfb,
pdfpages = "68",
xxnumber = "CS-TR-77-639",
}
@TechReport{Barstow:1977:ACA,
author = "David Barstow",
title = "Automatic Construction of Algorithms",
type = "Technical Report",
number = "STAN-CS-77-641 (AIM-308, AD-A053 184)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "220",
month = dec,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Yao:1977:CMS,
author = "Andrew Chi-Chih Yao",
title = "On constructing minimum spanning trees in
$k$-dimensional spaces and related problems",
type = "Technical Report",
number = "STAN-CS-77-642",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-642.html",
abstract = "The problem of finding a minimum spanning tree
connecting n points in a $k$-dimensional space is
discussed under three common distance metrics ---
Euclidean, rectilinear, and $ L_\infty $. By employing
a subroutine that solves the post office problem, we
show that, for fixed $ k \geq 3 $, such a minimum
spanning tree can be found in time $ O(n^{2 - a(k)}
{(log n)}^{1 - a(k)})$, where $ a(k) = 2^{-(k + 1)}$.
The bound can be improved to $ O((n \log n)^{1.8}) $
for points in the 3-dimensional Euclidean space. We
also obtain $ o(n^2) $ algorithms for finding a
farthest pair in a set of $n$ points and for other
related problems.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-77-642",
}
@TechReport{Tanabe:1977:GMN,
author = "Kunio Tanabe",
title = "A Geometric Method in Nonlinear Programming",
type = "Technical Report",
number = "STAN-CS-77-643",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "53",
month = dec,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mont-Reynaud:1977:HPF,
author = "Bernard Mont-Reynaud",
title = "Hierarchical Properties of Flows and the Determination
of Inner Loops",
type = "Technical Report",
number = "STAN-CS-77-644",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "164",
month = dec,
year = "1977",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lipton:1977:GND,
author = "Richard J. Lipton and Donald J. Rose and Robert Endre
Tarjan",
title = "Generalized nested dissection",
type = "Technical Report",
number = "STAN-CS-77-645",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = dec,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-645.html",
abstract = "J. A. George has discovered a method, called nested
dissection, for solving a system of linear equations
defined on an $ n = k \times k $ square grid in $ O(n
\log n) $ space and $ O(n^{3 / 2}) $ time. We
generalize this method without degrading the time and
space bounds so that it applies to any system of
equations defined on a planar or almost-planar graph.
Such systems arise in the solution of two-dimensional
finite element problems. Our method uses the fact that
planar graphs have good separators. More generally, we
show that sparse Gaussian elimination is efficient for
any class of graphs which have good separators, and
conversely that graphs without good separators
(including almost all sparse graphs) are not amenable
to sparse Gaussian elimination.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-77-645",
}
@TechReport{Yao:1977:LBP,
author = "Andrew Chi-Chih Yao",
title = "A lower bound to palindrome recognition by
probabilistic {Turing} machines",
type = "Technical Report",
number = "STAN-CS-77-647",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1977",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-647.html",
abstract = "We call attention to the problem of proving lower
bounds on probabilistic Turing machine computations. It
is shown that any probabilistic Turing machine
recognizing the language $ L = \{ w \phi w | w \epsilon
\{ 0, 1 \}^* \} $ with error $ \lambda < 1 / 2 $ must
take $ \Omega (n \log n) $ time.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-77-647",
}
@TechReport{Manna:1978:SPR,
author = "Zohar Manna and Richard J. Waldinger",
title = "Structured programming with recursion",
type = "Technical Report",
number = "STAN-CS-77-640 (AIM-307, AD-A053 176)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 5",
month = jan,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-640.html",
abstract = "No abstract available.",
acknowledgement = ack-nhfb,
pdfpages = "7",
xxnumber = "CS-TR-77-640",
}
@TechReport{Nelson:1978:FDA,
author = "Charles Gregory Nelson and Derek C. Oppen",
title = "Fast decision algorithms based on congruence closure",
type = "Technical Report",
number = "STAN-CS-77-646 (AIM-309 MU-309)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 13",
month = feb,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-77-646.html",
abstract = "We define the notion of the 'congruence closure' of a
relation on a graph and give a simple algorithm for
computing it. We then give decision procedures for the
quantifier-free theory of equality and the
quantifier-free theory of LISP list structure, both
based on this algorithm. The procedures are fast enough
to be practical in mechanical theorem proving: each
procedure determines the satisfiability of a
conjunction of length $n$ of literals in time $ O(n^2)
$. We also show that if the axiomatization of the
theory of list structure is changed slightly, the
problem of determining the satisfiability of a
conjunction of literals becomes NP-complete. We have
implemented the decision procedures in our simplifier
for the Stanford Pascal Verifier.",
acknowledgement = ack-nhfb,
pdfpages = "14",
xxnumber = "CS-TR-77-646",
}
@TechReport{Knuth:1978:MT,
author = "Donald E. Knuth",
title = "Mathematical Typography",
type = "Technical Report",
number = "STAN-CS-78-648 (AD-A054 143)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 68",
month = feb,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Josiah Willard Gibb's Lecture, given under the
auspices of the American Mathematical Society, January
4, 1978.",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA054143.pdf",
abstract = "Mathematics books and journals do not look as
beautiful at they used to. It is not that their
mathematical content is unsatisfactory, rather that the
old and well-developed traditions of typesetting have
become too expensive. Fortunately, it now appear. that
mathematics itself can be used to solve this
problem.\par
A first step in the solution is to devise a method for
unambiguously specifying mathematical manuscripts in
such a way that they can easily be manipulated by
machines. Such languages, when properly designed, can
be learned quickly by authors and their typists, yet
manuscripts in this f*a will lead directly to high
quality plates for the printer with little or no human
intervention.\par
A second step in the solution makes use of classical
mathematics to design the shapes of the letters and
symbols themselves. It is possible to give a rigorous
definition of the exact shape of the letter ``a'', for
example, in such a way that infinitely many styles
(bold, extended, sans-serif, italic, etc.) are obtained
from a single definition by changing only a few
parameters. When the same is done for the other letters
and symbols, we obtain a mathematical definition of
type fonts, a definition that can be used on all
machines both now and in the future. The main
significance of this approach is that new symbols can
readily be added in such a way that they are
automatically consistent with the old ones.\par
Of course it is necessary that the
mathematically-defined letters be beautiful according
to traditional notions of aesthetics, Given a sequence
of points in the plane, what is the most pleasing curve
that connects them? This question leads to interesting
mathematics, and one solution based on a novel family
of spline curves has produced excellent fonts of type
in the author's preliminary experiments. We may
conclude that a mathematical approach to the design of
alphabets does not eliminate the artists who have been
doing the job for so many years; on the contrary, it
gives them an exciting new medium to work with.",
acknowledgement = ack-nhfb,
pdfpages = "73",
remark-1 = "Published in \booktitle{Bulletin of the American
Mathematical Society (new series)}, {\bf 1}(2)
337--372, March 1979.",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Buchanan:1978:DMD,
author = "Bruce G. Buchanan and Edward A. Feigenbaum",
title = "{DENDRAL} and {Meta-DENDRAL}: their applications
dimension",
type = "Technical Report",
number = "STAN-CS-78-649 (HPP-78-1)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-649.html",
abstract = "The DENDRAL and Meta-DENDRAL programs assist chemists
with data interpretation problems. The design of each
program is described in the context of the chemical
inference problems the program solves. Some chemical
results produced by the programs are mentioned.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-78-649",
}
@TechReport{Lengauer:1978:FAF,
author = "Thomas Lengauer and Robert E. Tarjan",
title = "A Fast Algorithm for Finding Dominators in a Flow
Graph",
type = "Technical Report",
number = "STAN-CS-78-650 (AD-A054 144)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = feb,
year = "1978",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dershowitz:1978:PTM,
author = "Nachum Dershowitz and Zohar Manna",
title = "Proving termination and multiset orderings",
type = "Technical Report",
number = "STAN-CS-78-651 (AIM-310, AD-A058 601)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-651.html",
abstract = "A common tool for proving the termination of programs
is the well-founded set, a set ordered in such a way as
to admit no infinite descending sequences. The basic
approach is to find a termination function that maps
the elements of the program into some well-founded set,
such that the value of the termination function is
continually reduced throughout the computation. All too
often, the termination functions required are difficult
to find and are of a complexity out of proportion to
the program under consideration. However, by providing
more sophisticated well-founded sets, the corresponding
termination functions can be simplified. Given a
well-founded set S, we consider multisets over S,
`sets' that admit multiple occurrences of elements
taken from S. We define an ordering on all finite
multisets over S that is induced by the given ordering
on S. This multiset ordering is shown to be
well-founded. The value of the multiset ordering is
that it permits the use of relatively simple and
intuitive termination functions in otherwise difficult
termination proofs. In particular, we apply the
multiset ordering to provide simple proofs of the
termination of production systems, programs defined in
terms of sets of rewriting rules.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-78-651",
}
@TechReport{Nelson:1978:SCD,
author = "Charles Gregory Nelson and Derek C. Oppen",
title = "Simplification by cooperating decision procedures",
type = "Technical Report",
number = "STAN-CS-78-652 (AIM-311)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-652.html",
abstract = "We describe a simplifier for use in program
manipulation and verification. The simplifier finds a
normal form for any expression over the language
consisting of individual variables, the usual boolean
connectives, equality, the conditional function cond
(denoting if-then-else), the numerals, the arithmetic
functions and predicates +, - and $ \leq $, the LISP
constants, functions and predicates nil, car, cdr, cons
and atom, the functions store and select for storing
into and selecting from arrays, and uninterpreted
function symbols. Individual variables range over the
union of the reals, the set of arrays, LISP list
structure and the booleans true and false. The
simplifier is complete; that is, it simplifies every
valid formula to true. Thus it is also a decision
procedure for the quantifier-free theory of reals,
arrays and list structure under the above functions and
predicates. The organization of the simplifier is based
on a method for combining decision procedures for
several theories into a single decision procedure for a
theory combining the original theories. More precisely,
given a set S of functions and predicates over a fixed
domain, a satisfiability program for S is a program
which determines the satisfiability of conjunctions of
literals (signed atomic formulas) whose predicate and
function symbols are in S. We give a general procedure
for combining satisfiability programs for sets S and T
into a single satisfiability program for S $ \cup $ T,
given certain conditions on S and T. The simplifier
described in this paper is currently used in the
Stanford Pascal Verifier.",
acknowledgement = ack-nhfb,
pdfpages = "21",
xxnumber = "CS-TR-78-652",
}
@TechReport{Shiloach:1978:MTF,
author = "Yossi Shiloach",
title = "Multi-terminal $0$--$1$ flow",
type = "Technical Report",
number = "STAN-CS-78-653",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-653.html",
abstract = "Given an undirected $0$--$1$ flow network with n
vertices and m edges, we present an $ O(n^2 (m + n))$
algorithm which generates all $ (n \choose 2) $ maximal
flows between all the pairs of vertices. Since $ O(n^2
(m + n)) $ is also the size of the output, this
algorithm is optimal up to a constant factor.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-78-653",
}
@TechReport{Shiloach:1978:TPP,
author = "Yossi Shiloach",
title = "The two paths problem is polynomial",
type = "Technical Report",
number = "STAN-CS-78-654 (PB288520/AS)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-654.html",
abstract = "Given an undirected graph G = (V,E) and vertices $ s_1
$,$ t_1 $;$ s_2 $,$ t_2 $, the problem is to determine
whether or not G admits two vertex disjoint paths $ P_1
$ and $ P_2 $, connecting $ s_1 $ with $ t_1 $ and $
s_2 $ with $ t_2 $ respectively. This problem is solved
by an $ O(n \cdot m) $ algorithm $ (n = |V|, m = |E|)
$. An important by-product of the paper is a theorem
that states that if $G$ is 4-connected and non-planar,
then such paths $ P_1 $ and $ P_2 $ exist for any
choice of $ s_1 $, $ s_2 $, $ t_1 $, and $ t_2 $, (as
was conjectured by Watkins [1968]).",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-78-654",
}
@TechReport{Dahlquist:1978:AUS,
author = "Germund Dahlquist",
title = "On accuracy and unconditional stability of linear
multistep methods for second order differential
equations",
type = "Technical Report",
number = "STAN-CS-78-655",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-655.html",
abstract = "Linear multistep methods for the solution of the
equation y' = f(t,y) are studied by means of the test
equation y' = -$ \omega^2 $ y, with $ \omega $ real. It
is shown that the order of accuracy cannot exceed 2 for
an unconditionally stable method.",
acknowledgement = ack-nhfb,
author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
pdfpages = "14",
xxnumber = "CS-TR-78-655",
}
@TechReport{Heath:1978:NAN,
author = "Michael T. Heath",
title = "Numerical Algorithms for Nonlinearly Constrained
Optimization",
type = "Technical Report",
number = "STAN-CS-78-656",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "142",
month = mar,
year = "1978",
bibdate = "Fri Nov 21 14:21:14 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{McCarthy:1978:MTK,
author = "John McCarthy and Masahiko Sato and Takeshi Hayashi
and Shigeru Igarashi",
title = "On the model theory of knowledge",
type = "Technical Report",
number = "STAN-CS-78-657 (AIM-312)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = apr,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-657.html",
abstract = "Another language for expressing `knowing that' is
given together with axioms and rules of inference and a
Kripke type semantics. The formalism is extended to
time-dependent knowledge. Completeness and decidability
theorems are given. The problem of the wise men with
spots on their foreheads and the problem of the
unfaithful wives are expressed in the formalism and
solved.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
pdfpages = "12",
xxnumber = "CS-TR-78-657",
}
@TechReport{Shustek:1978:APC,
author = "Leonard J. Shustek",
title = "Analysis and Performance of Computer Instruction
Sets",
type = "Technical Report",
number = "STAN-CS-78-658 (SLAC-205)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "177",
month = mar,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Zolnowsky:1978:TCG,
author = "John E. Zolnowsky",
title = "Topics in Computational Geometry",
type = "Technical Report",
number = "STAN-CS-78-659 (SLAC-206)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "63",
month = mar,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shimano:1978:KDF,
author = "Bruce E. Shimano",
title = "The Kinematic Design and Force Control of Computer
Controlled Manipulators",
type = "Technical Report",
number = "STAN-CS-78-660 (AIM-313)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "135",
month = mar,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gilbert:1978:VPG,
author = "John R. Gilbert and Robert Endre Tarjan",
title = "Variations of a pebble game on graphs",
type = "Technical Report",
number = "STAN-CS-78-661 (AD-A060 794)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-661.html",
abstract = "We examine two variations of a one-person pebble game
played on directed graphs, which has been studied as a
model of register allocation. The black-white pebble
game of Cook and Sethi is shown to require as many
pebbles in the worst case as the normal pebble game, to
within a constant factor. For another version of the
pebble game, the problem of deciding whether a given
number of pebbles is sufficient for a given graph is
shown to be complete in polynomial space.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-78-661",
}
@TechReport{Yao:1978:NAP,
author = "Andrew Chi-Chih Yao",
title = "New algorithms in bin packing",
type = "Technical Report",
number = "STAN-CS-78-662",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 50",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-662.html",
abstract = "In the bin-packing problem a list $L$ of $n$ numbers
are to be packed into unit-capacity bins. For any
algorithm $S$, let $ r(S)$ be the maximum ratio $ S(L)
/ L^* $ for large $ L^* $, where $ S(L)$ denotes the
number of bins used by $S$ and $ L^* $ denotes the
minimum number needed. In this paper we give an on-line
$ O(n \log n)$-time algorithm RFF with $ r({\rm RFF}) =
5 / 3$, and an off-line polynomial-time algorithm RFFD
with $ r({\rm RFFD}) = (11 / 9) - \epsilon $ for some
fixed $ \epsilon $ > 0. These are strictly better
respectively than two prominent algorithms --- the
First-Fit (FF) which is on-line with $ r({\rm FF}) = 17
/ 10$, and the First-Fit-Decreasing (FFD) with $ r({\rm
FFD}) = 11 / 9$. Furthermore, it is shown that any
on-line algorithm $S$ must have $ r(S) \geq 3 / 2$. We
also discuss the question `how well can an $ O(n)$-time
algorithm perform?', showing that, in the generalized
$d$-dimensional bin-packing, any $ O(n)$-time algorithm
$S$ must have $ r(S) \geq d$.",
acknowledgement = ack-nhfb,
pdfpages = "52",
xxnumber = "CS-TR-78-662",
}
@TechReport{Grosse:1978:SRG,
author = "Eric H. Grosse",
title = "Software restyling in graphics and programming
languages",
type = "Technical Report",
number = "STAN-CS-78-663 (AD-A060 793)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-663.html",
abstract = "The value of large software products can be cheaply
increased by adding restyled interfaces that attract
new users. As examples of this approach, a set of
graphics primitives and a language precompiler for
scientific computation are described. These two systems
include a general user-defined coordinate system
instead of numerous system settings, indention to
specify block structure, a modified indexing convention
for array parameters, a syntax for
n-and-a-half-times-'round loops, and engineering format
for real constants; most of all, they strive to be as
small as possible.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-78-663",
}
@TechReport{Bjorstad:1978:ANA,
author = "Petter E. Bj{\o}rstad and Jorge Nocedal",
title = "Analysis of a New Algorithm for One-Dimensional
Minimization",
type = "Technical Report",
number = "STAN-CS-78-664",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = may,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{McWilliams:1978:SSC,
author = "Thomas M. McWilliams and Lawrence C. {Widdoes, Jr.}",
title = "{SCALD}: {Structured Computer-Aided Logic Design}",
type = "Technical Report",
number = "STAN-CS-78-665 (CSL-TR-152)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-665.html",
abstract = "SCALD, a graphics-based hierarchical digital logic
design system, is described and an example of its use
is given. SCALD provides a total computer-aided design
environment which inputs a high-level description of a
digital system, and produces output for computer-aided
manufacture of the system. SCALD has been used in the
design of an operational, 15-MIPS, 5500-chip ECL-10k
processor.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-78-665",
}
@TechReport{McWilliams:1978:SPD,
author = "Thomas M. McWilliams and Lawrence C. {Widdoes, Jr.}",
title = "The {SCALD} physical design subsystem",
type = "Technical Report",
number = "STAN-CS-78-666 (CSL-TR-153)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-666.html",
abstract = "The SCALD physical design subsystem is described.
SCALD supports the automatic construction of ECL-10k
logic on wire wrap cards from the output of a
hierarchical design system. Results of its use in the
design of an operational 15-MIPS 5500-chip processor
are presented and discussed.",
acknowledgement = ack-nhfb,
pdfpages = "31",
xxnumber = "CS-TR-78-666",
}
@TechReport{Smith:1978:DPS,
author = "Reid G. Smith and Randall Davis",
title = "Distributed Problem Solving: The Contract Net
Approach",
type = "Technical Report",
number = "STAN-CS-78-667 (HPP-78-7, AD-A060 795)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jun,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bonnet:1978:BPR,
author = "Alain Bonnet",
title = "{BAOBAB}, a parser for a rule-based system using a
semantic grammar",
type = "Technical Report",
number = "STAN-CS-78-668 (HPP-78-10)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-668.html",
abstract = "Until a recent knowledge-based system is able to learn
by itself, it must acquire new knowledge and new
heuristics from human experts. This is traditionally
done with the aid of a computer programmer acting as
intermediary. The direct transfer of knowledge from an
expert to the system requires a natural-language
processor capable of handling a substantial subset of
English. The development of such a natural-language
processor is a long-term goal of automating knowledge
acquisition; facilitating the interface between the
expert and the system is a first step toward this goal.
This paper describes BAOBAB, a program designed and
implemented for MYCIN (Shortliffe 1974), a medical
consultation system for infectious disease diagnosis
and therapy selection. BAOBAB is concerned with the
problem of parsing - recognizing natural language
sentences and encoding them into MYClN's internal
representation. For this purpose, it uses a semantic
grammar in which the non-terminal symbols denote
semantic categories (e.g., infections and symptoms), or
conceptual categories which are common tools of
knowledge representation in artificial intelligence
(e.g., attributes, objects, values and predicate
functions). This differs from a syntactic grammar in
which non-terminal symbols are syntactic elements such
as nouns or verbs.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-78-668",
}
@TechReport{Stockmeyer:1978:OLM,
author = "Paul K. Stockmeyer and F. Frances Yao",
title = "On the Optimality of Linear Merge",
type = "Technical Report",
number = "STAN-CS-78-669",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = jun,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Graham:1978:IBW,
author = "Ronald L. Graham and Andrew C. Yao and F. Frances
Yao",
title = "Information bounds are weak in the shortest distance
problem",
type = "Technical Report",
number = "STAN-CS-78-670",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-670.html",
abstract = "In the all-pair shortest distance problem, one
computes the matrix D = ($ d_{ij}$) where $ d_{ij}$ is
the minimum weighted length of any path from vertex i
to vertex j in a directed complete graph with a weight
on each edge. In all the known algorithms, a shortest
path $ p_{ij}$ achieving $ d_{ij}$ is also implicitly
computed. In fact, $ \log_3$ f(n) is an
information-theoretic lower bound where f(n) is the
total number of distinct patterns ($ p_{ij}$) for
n-vertex graphs. As f(n) potentially can be as large as
$ 2^{n^3}$, it is hopeful that a non-trivial lower
bound can be derived this way in the decision tree
model. We study the characterization and enumeration of
realizable patterns, and show that f(n) $ \leq
C^{n^2}$. Thus no lower bound greater than C$ n^2$ can
be derived from this approach. We prove as a corollary
that the Triangular polyhedron $ T^{(n)}$, defined in $
E^{(n \choose 2)}$ by $ d_{ij} \geq 0$ and the triangle
inequalities $ d_{ij} + d_{jk} \geq d_{ik}$, has at
most $ C^{n^2}$ faces of all dimensions, thus resolving
an open question in a similar information bound
approach to the shortest distance problem.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "42",
xxnumber = "CS-TR-78-670",
}
@TechReport{Ginsparg:1978:NLP,
author = "Jerrold Ginsparg",
title = "Natural Language Processing in an Automatic
Programming Domain",
type = "Technical Report",
number = "STAN-CS-78-671 (AIM-316)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "172",
month = jun,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chan:1978:CNM,
author = "Tony F. C. Chan",
title = "Comparison of Numerical Methods for Initial Value
Problems",
type = "Technical Report",
number = "STAN-CS-78-672",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "195",
month = jun,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chan:1978:NLS,
author = "Tony F. Chan and William M. {Coughran, Jr.} and Eric
H. Grosse and Michael T. Heath",
title = "A numerical library and its support",
type = "Technical Report",
number = "STAN-CS-78-673 (SU326 P30-59)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 20",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/c/coughran-william-m.bib;
https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-673.html",
abstract = "Reflecting on four years of numerical consulting at
the Stanford Linear Accelerator Center, we point out
solved and outstanding problems in selecting and
installing mathematical software, helping users,
maintaining the library and monitoring its use, and
managing the consulting operation.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-78-673",
}
@TechReport{Chan:1978:FEA,
author = "Tony F. Chan and Roland Glowinski",
title = "Finite element approximation and iterative solution of
a class of mildly non-linear elliptic equations",
type = "Technical Report",
number = "STAN-CS-78-674 (SU326 P30-60)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-674.html",
abstract = "We describe in this report the numerical analysis of a
particular class of nonlinear Dirichlet problems. We
consider an equivalent variational inequality
formulation on which the problems of existence,
uniqueness and approximation are easier to discuss. We
prove in particular the convergence of an approximation
by piecewise linear finite elements. Finally, we
describe and compare several iterative methods for
solving the approximate problems and particularly some
new algorithms of augmented Lagrangian type, which
contain as special case some well-known alternating
direction methods. Numerical results are presented.",
acknowledgement = ack-nhfb,
pdfpages = "80",
xxnumber = "CS-TR-78-674",
}
@TechReport{Knuth:1978:TEC,
author = "Donald E. Knuth",
title = "{Tau Epsilon Chi}, a system for technical text",
type = "Technical Report",
number = "STAN-CS-78-675 (AIM-317)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "200",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Revised version published as book
\cite{Knuth:1979:TMN}.",
}
@TechReport{Banning:1978:MDS,
author = "John Phineas Banning",
title = "A Method for Determining the Side Effects of Procedure
Calls",
type = "Technical Report",
number = "STAN-CS-78-676 (SLACR-213)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "283",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{fsSUCSD:1978:CE,
author = "{The faculty and students of the Stanford University
Computer Science Department}",
title = "Comprehensive Examinations 1972--1978",
type = "Technical Report",
number = "STAN-CS-78-677",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/78/677/CS-TR-78-677.pdf",
abstract = "Since Spring 1972, the Stanford Computer Science
Department has periodically given a `comprehensive
examination' as one of the qualifying exams for
graduate students. Such exams generally have consisted
of a six-hour written test followed by a several-day
programming problem. Their intent is to make it
possible to assess whether a student is sufficiently
prepared in all the important aspects of computer
science. This report presents the examination questions
from thirteen comprehensive examinations, along with
their solutions.",
acknowledgement = ack-nhfb,
pdfpages = "250",
xxnumber = "CS-TR-78-677",
}
@TechReport{Oppen:1978:RAR,
author = "Derek C. Oppen",
title = "Reasoning about recursively defined data structures",
type = "Technical Report",
number = "STAN-CS-78-678 (AIM-314)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-678.html",
abstract = "A decision algorithm is given for the quantifier-free
theory of recursively defined data structures which,
for a conjunction of length n, decides its
satisfiability in time linear in n. The first-order
theory of recursively defined data structures, in
particular the first-order theory of LISP list
structure (the theory of CONS, CAR and CDR), is shown
to be decidable but not elementary recursive.",
acknowledgement = ack-nhfb,
pdfpages = "15",
xxnumber = "CS-TR-78-678",
}
@TechReport{Murray:1978:SAM,
author = "Walter Murray and Michael L. Overton",
title = "Steplength algorithms for minimizing a class of
nondifferentiable functions",
type = "Technical Report",
number = "STAN-CS-78-679",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-679.html",
abstract = "Four steplength algorithms are presented for
minimizing a class of nondifferentiable functions which
includes functions arising from $ \ell_1 $ and $
\ell_\infty $ approximation problems and penalty
functions arising from constrained optimization
problems. Two algorithms are given for the case when
derivatives are available wherever they exist and two
for the case when they are not available. We take the
view that although a simple steplength algorithm may be
all that is required to meet convergence criteria for
the overall algorithm, from the point of view of
efficiency it is important that the step achieve as
large a reduction in the function value as possible,
given a certain limit on the effort to be expended. The
algorithms include the facility for varying this limit,
producing anything from an algorithm requiring a single
function evaluation to one doing an exact linear
search. They are based on univariate minimization
algorithms which we present first. These are normally
at least quadratically convergent when derivatives are
used and superlinearly convergent otherwise, regardless
of whether or not the function is differentiable at the
minimum.",
acknowledgement = ack-nhfb,
pdfpages = "68",
xxnumber = "CS-TR-78-679",
}
@TechReport{Stanley:1978:BSC,
author = "Connie J. Stanley",
title = "Bibliography of {Stanford Computer Science} reports,
1963--1978",
type = "Technical Report",
number = "STAN-CS-78-680",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-680.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
since 1963. Each report is identified by Computer
Science number, author's name, title, National
Technical Information Service (NTIS) retrieval number,
date, and number of pages. Complete listings of Theses,
Artificial Intelligence Memos, and Heuristic
Programming Reports are given in the Appendix. Also,
for the first time, each report has been marked as to
its availability for ordering and the cost if
applicable.",
acknowledgement = ack-nhfb,
pdfpages = "110",
xxnumber = "CS-TR-78-680",
}
@TechReport{TrabbPardo:1978:SRS,
author = "Luis {Trabb Pardo}",
title = "Set Representation and Set Intersection",
type = "Technical Report",
number = "STAN-CS-78-681 (AD-A065 283)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 81",
month = dec,
year = "1978",
DOI = "https://doi.org/10.1145/800133.804328",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA065283.pdf;
https://dl.acm.org/doi/10.1145/800133.804328",
abstract = "This work discusses the representation and
manipulation of sets based on two different concepts:
tries, and hashing functions.\par
The sets considered here are assumed to be static: once
created, there will be no further insertions or
deletions. For both trie- and hash-based strategies, a
series of representations is introduced which together
with the availability of preprocessing reduces the
average sizes of the sets to nearly optimal values, yet
retains the inherently good retrieval
characteristics.\par
The intersection procedure for trie-based
representations is based on the traversal in parallel
of the tries representing the sets to be intersected,
and it behaves like a series of binary searches when
the sets to be intersected are of very different sizes.
Hashed intersection runs very fast. The average time is
proportional to the size of the smallest set to be
intersected and is independent of the number of sets
(except for the intersection set itself which has to be
checked for every set)",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis. The PDF file is OCR'ed
scans of microfiche page images.",
}
@TechReport{Valdes:1978:PFS,
author = "Jacobo Valdes",
title = "Parsing Flowcharts and Series Parallel Graphs",
type = "Technical Report",
number = "STAN-CS-78-682 (AD-A065 265)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "233",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tarjan:1978:SST,
author = "Robert Endre Tarjan",
title = "Storing a sparse table",
type = "Technical Report",
number = "STAN-CS-78-683 (AD-A065 284)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-683.html",
abstract = "The problem of storing and searching large sparse
tables arises in compiling and in other areas of
computer science. The standard technique for storing
such tables is hashing, but hashing has poor worst-case
performance. We consider good worst-case methods for
storing a table of n entries, each an integer between 0
and N-1. For dynamic tables, in which look-ups and
table additions are intermixed, the use of a trie
requires $ O(k n) $ storage and allows $ O(\log_k (N /
n)) $ worst-case access time, where $k$ is an arbitrary
parameter. For static tables, in which the entire table
is constructed before any look-ups are made, we propose
a method which requires $ O(n \log^{(\ell)} n)$ storage
and allows $ O(\ell \log_n N)$ access time, where $
\ell $ is an arbitrary parameter. Choosing $ \ell =
\log^* n$ gives a method with $ O(n)$ storage and $
O((\log^* n)(\log_n N)) $ access time.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-78-683",
}
@TechReport{Boley:1978:MIE,
author = "Daniel L. Boley and Gene H. Golub",
title = "The Matrix Inverse Eigenvalue Problem for Periodic
{Jacobi} Matrices",
type = "Technical Report",
number = "STAN-CS-78-684 (SU326 P30-63)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "[5] + 14",
month = dec,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-684.html",
abstract = "A stable numerical algorithm is presented for
generating a periodic Jacobi matrix from two sets of
eigenvalues and the product of the off-diagonal
elements of the matrix. The algorithm requires a simple
generalization of the Lanczos algorithm. It is shown
that the matrix is not unique, but the algorithm will
generate all possible solutions.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "eigenvalues; matrices",
pdfpages = "22",
xxnumber = "CS-TR-78-684",
}
@TechReport{Luk:1978:SPM,
author = "Franklin Tai-Cheung Luk",
title = "Sparse and Parallel Matrix Computations",
type = "Technical Report",
number = "STAN-CS-78-685 (AD-A065 285)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lipton:1978:EHS,
author = "Richard J. Lipton and Arnold L. Rosenberg and Andrew
C. Yao",
title = "External Hashing Schemes for Collections of Data
Structures",
type = "Technical Report",
number = "STAN-CS-78-686",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Journal of the ACM} {\bf
27}(1) 81--95 January 1980",
}
@TechReport{Weyhrauch:1978:PTF,
author = "Richard W. Weyhrauch",
title = "Prolegomena to a theory of formal reasoning",
type = "Technical Report",
number = "STAN-CS-78-687 (AIM-315, AD-A065 698)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-687.html",
abstract = "This paper is an introduction to the mechanization of
a theory of reasoning. Currently formal systems are out
of favor with the AI community. The aim of this paper
is to explain how formal systems can be used in AI by
explaining how traditional ideas of logic can be
mechanized in a practical way. The paper presents
several new ideas. Each of these is illustrated by
giving simple examples of how this idea is mechanized
in the reasoning system FOL. That is, this is not just
theory but there is an existing running implementation
of these ideas. In this paper: (1) we show how to
mechanize the notion of model using the idea of a
simulation structure and explain why this is
particularly important to AI, (2) we show how to
mechanize the notion of satisfaction, (3) we present a
very general evaluator for first order expressions,
which subsumes PROLOG and we propose as a natural way
of thinking about logic programming, (4) we show how to
formalize metatheory, (5) we describe reflection
principles, which connect theories to their
metatheories in a way new to AI, (6) we show how these
ideas can be used to dynamically extend the strength of
FOL by `implementing' subsidiary deduction rules, and
how this in turn can be extended to provide a method of
describing and proving theorems about heuristics for
using these rules, (7) we discuss one notion of what it
could mean for a computer to learn and give an example,
(8) we describe a new kind of formal system that has
the property that it can reason about its own
properties, (9) we give examples of all of the above.",
acknowledgement = ack-nhfb,
pdfpages = "46",
xxnumber = "CS-TR-78-687",
}
@TechReport{Manna:1978:SLL,
author = "Zohar Manna",
title = "Six Lectures on the Logic of Computer Programming",
type = "Technical Report",
number = "STAN-CS-78-688 (AIM-318)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "54",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nelson:1978:ATV,
author = "Charles Gregory Nelson",
title = "An $ n^{\log n} $ algorithm for the
two-variable-per-constraint linear programming
satisfiability problem",
type = "Technical Report",
number = "STAN-CS-78-689 (AIM-319)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-689.html",
abstract = "A simple algorithm is described which determines the
satisfiability over the reals of a conjunction of
linear inequalities, none of which contains more than
two variables. In the worst case the algorithm requires
time $ O({mn}^{\lceil \log^2 n \rceil + 3}) $, where
$n$ is the number of variables and m the number of
inequalities. Several considerations suggest that the
algorithm may be useful in practice: it is simple to
implement, it is fast for some important special cases,
and if the inequalities are satisfiable it provides
valuable information about their so1ution set. The
algorithm is particularly suited to applications in
mechanical program verification.",
acknowledgement = ack-nhfb,
pdfpages = "21",
xxnumber = "CS-TR-78-689",
}
@TechReport{Manna:1978:DAP,
author = "Zohar Manna and Richard J. Waldinger",
title = "A deductive approach to program synthesis",
type = "Technical Report",
number = "STAN-CS-78-690 (AIM-320, AD-A065 558)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-690.html",
abstract = "Program synthesis is the systematic derivation of a
program from a given specification. A deductive
approach to program synthesis is presented for the
construction of recursive programs. This approach
regards program synthesis as a theorem-proving task and
relies on a theorem-proving method that combines the
features of transformation rules, unification, and
mathematical induction within a single framework.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-78-690",
}
@TechReport{Bube:1978:CID,
author = "Kenneth P. Bube",
title = "The Construction of Initial Data for Hyperbolic
Systems from Nonstandard Data",
type = "Technical Report",
number = "STAN-CS-78-691 (AD-A066 058)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "119",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Buchanan:1978:MLS,
author = "Bruce G. Buchanan and Tom M. Mitchell and Reid G.
Smith and C. Richard {Johnson, Jr.}",
title = "Models of Learning Systems",
type = "Technical Report",
number = "STAN-CS-78-692 (HPP-77-39, AD-A066 147)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{West:1978:CSG,
author = "Douglas B. West",
title = "A class of solutions to the gossip problem",
type = "Technical Report",
number = "STAN-CS-78-693 (AD-A066 099)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-693.html",
abstract = "We characterize and count optimal solutions to the
gossip problem in which no one hears his own
information. That is, we consider graphs with n
vertices where the edges have a linear ordering such
that an increasing path exists from each vertex to
every other, but there is no increasing path from any
vertex to itself. Such graphs exist only when n is
even, in which case the fewest number of edges is 2n-4,
as in the original gossip problem. We characterize
optimal solutions of this sort (NOHO-graphs) using a
correspondence with a set of permutations and binary
sequences. This correspondence enables us to count
these solutions and several subclasses of solutions.
The numbers of solutions in each class are simple
powers of 2 and 3, with exponents determined by n. We
also show constructively that NOHO-graphs are planar
and Hamiltonian, and we mention applications to related
problems.",
acknowledgement = ack-nhfb,
pdfpages = "66",
xxnumber = "CS-TR-78-693",
}
@TechReport{King:1978:CSS,
author = "Jonathan J. King",
title = "Computer science at {Stanford}, 1977--1978",
type = "Technical Report",
number = "STAN-CS-78-694",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-694.html",
abstract = "This is a review of research and teaching in the
Stanford Computer Science Department during the
1977-1978 academic year.",
acknowledgement = ack-nhfb,
pdfpages = "30",
xxnumber = "CS-TR-78-694",
}
@TechReport{McCarthy:1978:RRA,
author = "John McCarthy and Tom Binford and Cordell Green and
David Luckham and Zohar Manna and Les Earnest",
title = "Recent Research in Artificial Intelligence and
Foundations of Programming",
type = "Technical Report",
number = "STAN-CS-78-695 (AIM-321, AD-A066 562)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "94",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Smith:1978:CMB,
author = "Reid G. Smith and Tom M. Mitchell",
title = "Considerations for Microprocessor-Based Terminal
Design",
type = "Technical Report",
number = "STAN-CS-78-696 (HPP-78-22, AD-A068 538)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gander:1978:LLS,
author = "Walter Gander",
title = "On the linear least squares problem with a quadratic
constraint",
type = "Technical Report",
number = "STAN-CS-78-697",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-697.html",
abstract = "In this paper we present the theory and practical
computational aspects of the linear least squares
problem with a quadratic constraint. New theorems
characterizing properties of the solutions are given
and extended for the problem of minimizing a general
quadratic function subject to a quadratic constraint.
For two important regularization methods we formulate
dual equations which proved to be very useful for the
applications of smoothing of data. The resulting
algorithm is a numerically stable version of an
algorithm proposed by Rutishauser. We show also how to
choose a third order iteration method to solve the
secular equations. However we are still far away from a
foolproof machine independent algorithm.",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-78-697",
}
@TechReport{Sweet:1978:EEP,
author = "Richard E. Sweet",
title = "Empirical Estimates of Program Entropy",
type = "Technical Report",
number = "STAN-CS-78-698",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "167",
month = nov,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bennett:1978:SKB,
author = "James Bennett and Lewis Creary and Robert S. Engelmore
and Robert Melosh",
title = "{SACON}: a knowledge-based consultant for structural
analysis",
type = "Technical Report",
number = "STAN-CS-78-699 (HPP-78-23, AD-A068 539)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-699.html",
abstract = "In this report we describe an application of
artificial intelligence (AI) methods to structural
analysis. We describe the development and (partial)
implementation of an `automated consultant' to advise
non-expert engineers in the use of a general-purpose
structural analysis program. The analysis program
numerically simulates the behavior of a physical
structure subjected to various mechanical loading
conditions. The automated consultant, called SACON
(Structural Analysis CONsultant), is based on a version
of the MYCIN program [Shortliffe, 1974], originally
developed to advise physicians in the diagnosis and
treatment of infectious diseases. The domain-specific
knowledge in MYCIN is represented as situation-action
rules, and is kept independent of the `inference
engine' that uses the rules. By substituting structural
engineering knowledge for the medical knowledge, the
program was converted easily from the domain of
infectious diseases to the domain of structural
analysis.",
acknowledgement = ack-nhfb,
pdfpages = "70",
xxnumber = "CS-TR-78-699",
}
@TechReport{Smith:1978:FPS,
author = "Reid Garfield Smith",
title = "A Framework for Problem Solving in a Distributed
Processing Environment",
type = "Technical Report",
number = "STAN-CS-78-700 (HPP-78-28, AD-A068 230)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "150",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shiloach:1978:MFA,
author = "Yossi Shiloach",
title = "An {$ O(n \cdot I \log^2 I) $} maximum-flow
algorithm",
type = "Technical Report",
number = "STAN-CS-78-702",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = dec,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-702.html",
abstract = "We present in this paper a new algorithm to find a
maximum flow in a flow-network which has n vertices and
$m$ edges in time of $ O(n \cdot I \log^2 I) $, where $
I = M + n $ is the input size (up to a constant
factor). This result improves the previous upper bound
of $Z$. Galil [1978] which was $ O(I^{7 / 3})$ in the
worst case.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-78-702",
}
@TechReport{Brown:1978:DAD,
author = "Mark R. Brown and Robert E. Tarjan",
title = "Design and Analysis of a Data Structure for
Representing Sorted Lines",
type = "Technical Report",
number = "STAN-CS-78-709 (AD-A068 231)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = dec,
year = "1978",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-78-709.html",
abstract = "In this paper we explore the use of 2-3 trees to
represent sorted lists. We analyze the worst-case cost
of sequences of insertions and deletions in 2-3 trees
under each of the following three assumptions: (i) only
insertions are performed; (ii) only deletions are
performed; (iii) deletions occur only at the small end
of the list and insertions occur only away from the
small end. Our analysis leads to a data structure for
representing sorted lists when the access pattern
exhibits a (perhaps time-varying) locality of
reference. This structure has many of the properties of
the representation proposed by Guibas, McCreight,
Plass, and Roberts [1977], but it is substantially
simpler and may be practical for lists of moderate
size.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-78-709",
}
@TechReport{Mitchell:1978:VSA,
author = "Tom Michael Mitchell",
title = "Version Spaces: an Approach to Concept Learning",
type = "Technical Report",
number = "STAN-CS-78-711",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "216",
month = dec,
year = "1978",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Model:1979:MSB,
author = "Mitch L. Model",
title = "Monitoring System Behavior in a Complex Computational
Environment",
type = "Technical Report",
number = "STAN-CS-79-701",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "189",
month = jan,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Aspvall:1979:PTA,
author = "Bengt Aspvall and Yossi Shiloach",
title = "A Polynomial Time Algorithm for Solving Systems of
Linear Inequalities With Two Variables Per Inequality",
type = "Technical Report",
number = "STAN-CS-79-703 (AD-A068 228)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-703.html",
abstract = "We present a constructive algorithm for solving
systems of linear inequalities (LI) with at most two
variables per inequality. The algorithm is polynomial
in the size of the input. The LI problem is of
importance in complexity theory since it is polynomial
time equivalent to linear programming. The subclass of
LI treated in this paper is also of practical interest
in mechanical verification systems, and we believe that
the ideas presented can be extended to the general LI
problem.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-79-703",
}
@TechReport{Sweet:1979:SSS,
author = "Roland A. Sweet",
title = "A Survey of the State of Software for Partial
Differential Equations",
type = "Technical Report",
number = "STAN-CS-79-704 (AD-A068 232)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-704.html",
abstract = "This paper surveys the state of general purpose
software for the solution of partial differential
equations. A discussion of the purported capabilities
of twenty-one programs is presented. No testing of the
routines was performed.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-79-704",
}
@TechReport{Drysdale:1979:GVD,
author = "Robert Lewis (Scot) {Drysdale, III}",
title = "Generalized {Voronoi} Diagrams and Geometric
Searching",
type = "Technical Report",
number = "STAN-CS-79-705",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "196",
month = jan,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Yao:1979:GIN,
author = "F. Francis Yao",
title = "Graph 2-Isomorphism is {NP}-Complete",
type = "Technical Report",
number = "STAN-CS-79-706",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-706.html",
abstract = "Two graphs G and G' are said to be k-isomorphic if
their edge sets can be partitioned into E(G) = $ E_1
\cup E_2 \cup \ldots {} \cup E_k $ and E(G') = $ {E'}_1
\cup {E'}_2 \cup \ldots {} \cup {E'}_k $ such that as
graphs, $ E_i $ and $ {E'}_i $ are isomorphic for $ 1
\leq i \leq k $. In this note we show that it is
NP-complete to decide whether two graphs are
2-isomorphic.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-79-706",
}
@TechReport{VanWyk:1979:PPS,
author = "Christopher J. {Van Wyk} and Donald E. Knuth",
title = "A Programming and Problem Solving Seminar",
type = "Technical Report",
number = "STAN-CS-79-707",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "83",
day = "1",
month = jan,
year = "1979",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-707.html;
http://www-db.stanford.edu/TR/CS-TR-79-707.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-79-707",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS 204, Problem
Seminar, during autumn quarter 1978. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms came up during the discussions,
these notes may be of interest to graduate students of
computer science at other universities, as well as to
their professors and to professional people in the
`real world.'",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-79-707",
pdfpages = "86",
xxnumber = "CS-TR-79-707",
}
@TechReport{Yao:1979:AMA,
author = "Andrew C. Yao",
title = "An analysis of a memory allocation scheme for
implementing stacks",
type = "Technical Report",
number = "STAN-CS-79-708",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-708.html",
abstract = "Consider the implementation of two stacks by letting
them grow towards each other in a table of size $m$.
Suppose a random sequence of insertions and deletions
are executed, with each instruction having a fixed
probability $p$ $ (0 < p < 1 / 2)$ to be a deletion.
Let $ A_p (m)$ denote the expected value of $ \max \{
x, y \} $, where $x$ and $y$ are the stack heights when
the table first becomes full. We shall prove that, as $
m \rightarrow \infty $, $ A_p (m) = \sqrt {m / (2 \pi
(1 - 2 p))} + O((\log m) / \sqrt {m})$. This gives a
solution to an open problem in Knuth ['The Art of
Computer Programming, Vol. 1, Exercise 2.2.2-13].",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-79-708",
}
@TechReport{Trefethen:1979:NCS,
author = "Lloyd N. Trefethen",
title = "Numerical computation of the {Schwarz--Christoffel}
transformation",
type = "Technical Report",
number = "STAN-CS-79-710 (AD-A068 210)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/trefethen-lloyd-n.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-710.html",
abstract = "A program is described which computes
Schwarz--Christoffel transformations that map the unit
disk conformally onto the interior of a bounded or
unbounded polygon in the complex plane. The inverse map
is also computed. The computational problem is
approached by setting up a nonlinear system of
equations whose unknowns are essentially the `accessory
parameters' $ z_k $. This system is then solved with a
packaged subroutine. New features of this work include
the evaluation of integrals within the disk rather than
along the boundary, making possible the treatment of
unbounded polygons; the use of a compound form of
Gauss-Jacobi quadrature to evaluate the
Schwarz--Christoffel integral, making possible high
accuracy at reasonable cost; and the elimination of
constraints in the nonlinear system by a simple change
of variables. Schwarz--Christoffel transformations may
be applied to solve the Laplace and Poisson equations
and related problems in two-dimensional domains with
irregular or unbounded (but not curved or multiply
connected) geometries. Computational examples are
presented. The time required to solve the mapping
problem is roughly proportional to $ N^3 $, where $N$
is the number of vertices of the polygon. A typical set
of computations to 8-place accuracy with $ N \leq 10 $
takes 1 to 10 seconds on an IBM 370/168.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-79-710",
}
@TechReport{Knuth:1979:ECP,
author = "Donald E. Knuth",
title = "The errata of computer programming",
type = "Technical Report",
number = "STAN-CS-79-712 (AD-A068 393)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-712.html;
http://www-db.stanford.edu/TR/CS-TR-79-712.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-79-712",
abstract = "This report lists all corrections and changes of
Volumes 1 and 3 of ``The Art of Computer Programming,''
as of January 5, 1979. This updates the previous list
in report CS551, May 1976. The second edition of Volume
2 has been delayed two years due to the fact that it
was completely revised and put into the {\TeX}
typesetting language; since publication of this new
edition is not far off, no changes to Volume 2 are
listed here.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-79-712",
pdfpages = "58",
xxnumber = "CS-TR-79-712",
}
@TechReport{Golub:1979:HSMa,
author = "Gene H. Golub and Stephen Nash and Charles F. {Van
Loan}",
title = "A {Hessenberg--Schur} method for the problem {$ {AX +
XB = C} $}",
type = "Technical Report",
number = "STAN-CS-79-713",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = jan,
year = "1979",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "matrix mechanics; numerical analysis",
remark = "Published in \booktitle{IEEE Transactions on Automatic
Control} {\bf 24}(6) 909--913 (1979),
doi:10.1109/TAC.1979.1102170.",
xxnumber = "CS-TR-79-713",
}
@TechReport{Castaneda:1979:PFP,
author = "Fernando Castaneda and Frederick C. Chow and Peter Nye
and Daniel D. Sleator and Gio Wiederhold",
title = "{PCFORT}: a {Fortran-to-Pcode} translator",
type = "Technical Report",
number = "STAN-CS-79-714 (CSL-TN-160)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 85",
month = jan,
year = "1979",
bibdate = "Sun Oct 12 09:17:11 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/79/714/CS-TR-79-714.pdf;
http://i.stanford.edu/TR/CS-TR-79-714.html;
https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-79-714_PCFORT_Jan79.pdf",
abstract = "PCFORT is a compiler for the FORTRAN language designed
to fit as a building block into a PASCAL oriented
environment. It forms part of the programming systems
being developed for the S-1 multiprocessor. It is
written in PASCAL, and generates P-code, an
intermediate language used by transportable PASCAL
compilers to represent the program in a simple form.
P-code is either compiled or interpreted depending upon
the objectives of the programming system.\par
A PASCAL written FORTRAN compiler provides a bridge
between the FORTRAN and PASCAL communities. The
implementation allows PASCAL and FORTRAN generated code
to be combined into one program. The FORTRAN language
supported here is FORTRAN to the full 1966 standard,
extended with those features commonly expected by
available large scientific programs.",
acknowledgement = ack-nhfb,
keywords = "compiler; FORTRAN; P-code; PASCAL; S-1; translator",
pdfpages = "96",
xxnumber = "CS-TR-79-714",
}
@TechReport{Hailpern:1979:AM,
author = "Brent T. Hailpern and Bruce L. Hitson",
title = "{S-1} architecture manual",
type = "Technical Report",
number = "STAN-CS-79-715 (CSL-TR-79-161)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + iv + 366",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-715.html;
https://bitsavers.org/pdf/stanford/cs_techReports/STAN-CS-79-715_S-1_Arch_Man.pdf",
abstract = "This manual provides a complete description of the
instruction-set architecture of the S-1 Uniprocessor
(Mark IIA), exclusive of vector operations. It is
assumed that the reader has a general knowledge of
computer architecture. The manual was designed to be
both a detailed introduction to the S-1 and an
architecture reference manual. Also included are user
manuals for the FASM Assembler and the S-1 Formal
Description Syntax.",
acknowledgement = ack-nhfb,
pdfpages = "376 (CS-TR-79-715)",
xxnumber = "CS-TR-79-715, CSL-TR-79-161",
}
@TechReport{Georgeff:1979:FCP,
author = "Michael P. Georgeff",
title = "A framework for control in production systems",
type = "Technical Report",
number = "STAN-CS-79-716 (AIM-322)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-716.html",
abstract = "A formal model for representing control in production
systems is defined. The formalism allows control to be
directly specified independently of the conflict
resolution scheme, and thus allows the issues of
control and nondeterminism to be treated separately.
Unlike previous approaches, it allows control to be
examined within a uniform and consistent framework. It
is shown that the formalism provides a basis for
implementing control constructs which, unlike existing
schemes, retain all the properties desired of a
knowledge based system --- modularity, flexibility,
extensibility and explanatory capacity. Most
importantly, it is shown that these properties are not
a function of the lack of control constraints, but of
the type of information allowed to establish these
constraints. Within the formalism it is also possible
to provide a meaningful notion of the power of control
constructs. This enables the types of control required
in production systems to be examined and the capacity
of various schemes to meet these requirements to be
determined. Schemes for improving system efficiency and
resolving nondeterminism are examined, and devices for
representing such meta-level knowledge are described.
In particular, the objectification of control
information is shown to provide a better paradigm for
problem solving and for talking about problem solving.
It is also shown that the notion of control provides a
basis for a theory of transformation of production
systems, and that this provides a uniform and
consistent approach to problems involving subgoal
protection.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-79-716",
}
@TechReport{Cartwright:1979:RPF,
author = "Robert Cartwright and John McCarthy",
title = "Recursive Programs as Functions in a First Order
Theory",
type = "Technical Report",
number = "STAN-CS-79-717 (AIM-324)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = mar,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Mujtaba:1979:AUM,
author = "Mohamed Shahid Mujtaba and Ron Goldman",
title = "{AL} Users' manual",
type = "Technical Report",
number = "STAN-CS-79-718 (AIM-323)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-718.html",
abstract = "This document describes the current state of the AL
system now in operation at the Stanford Artificial
Intelligence Laboratory, and teaches the reader how to
use it. The system consists of AL, a high-level
programming language for manipulator control useful in
industrial assembly research; POINTY, an interactive
system for specifying representation of parts; and
ALAID, an interactive debugger for AL.",
acknowledgement = ack-nhfb,
pdfpages = "140",
xxnumber = "CS-TR-79-718",
}
@TechReport{Bjorstad:1979:EAE,
author = "Petter Bj{\o}rstad and Germund Dahlquist and Eric H.
Grosse",
title = "Extrapolation of asymptotic expansions by a modified
{Aitken} $ \delta^2$-formula",
type = "Technical Report",
number = "STAN-CS-79-719",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/grosse-eric.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-719.html",
abstract = "A modified Aitken formula permits iterated
extrapolations to efficiently estimate $ s_\infty $
from $ s_n $ when an asymptotic expansion $ s_n =
s_\infty + n^{-k} (c_0 + c_1 n^{-1} + c_2 n^{-2} +
\ldots {}) $ holds for some (unknown) coefficients $
c_j $. We study the truncation and irregular error and
compare the method with other forms of extrapolation.",
acknowledgement = ack-nhfb,
author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
pdfpages = "56",
xxnumber = "CS-TR-79-719",
}
@TechReport{Glowinski:1979:GOB,
author = "Roland Glowinski",
title = "On grid optimization for boundary value problems",
type = "Technical Report",
number = "STAN-CS-79-720",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-720.html",
abstract = "We discuss in this report the numerical procedures
which can be used to obtain the optimal grid when
solving by a finite element method a model boundary
value problem of elliptic type modelling the potential
flow of an incompressible inviscid fluid. Results of
numerical experiments are presented.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-79-720",
}
@TechReport{Yao:1979:FTN,
author = "Andrew C. Yao and F. Frances Yao",
title = "On fault-tolerant networks for sorting",
type = "Technical Report",
number = "STAN-CS-79-721",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-721.html",
abstract = "The study of constructing reliable systems from
unreliable components goes back to the work of von
Neumann, and of Moore and Shannon. The present paper
studies the use of redundancy to enhance reliability
for sorting and related networks built from unreliable
comparators. Two models of fault-tolerant networks are
discussed. The first model patterns after the concept
of error-correcting codes in information theory, and
the other follows the stochastic criterion used by von
Neumann and Moore--Shannon. It is shown, for example,
that an additional $ k (2 n - 3) $ comparators are
sufficient to render a sorting network reliable,
provided that no more than $k$ of its comparators may
be faulty.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-79-721",
}
@TechReport{Wiederhold:1979:SMD,
author = "Gio Wiederhold and Ramez A. El-Masri",
title = "A structural model for database systems",
type = "Technical Report",
number = "STAN-CS-79-722 (AD-A074 077)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-722.html",
abstract = "This report presents a model to be used for database
design. Because our motivation extends to providing
guidance for the structured implementation of a
database, we call our model the 'Structural Model.' We
derive the design using criteria of correctness,
relevance, and performance from semantic and
operational specifications obtained from multiple
sources. These sources typically correspond to
prospective users or user groups of the database. The
integration of such specifications is a central issue
in the development of an integrated structural database
model. The structural model is used for the design of
the logical structures that represent a real-world
situation. However, it is not meant to represent all
possible real-world semantics, but a subset of the
semantics which are important in database modelling.
The model uses relations as building blocks, and hence
can be considered as an extension of Codd's relational
model [1970]. The main extensions to the relational
model are the explicit representation of logical
connections between relations, the inclusion of
insertion-deletion constraints in the model itself, and
the separation of relations into several structural
types. Connections between relations are used to
represent existence dependencies of tuples in different
relations. These existence dependencies are important
for the definition of semantics of relationships
between classes of real-world entities. The connections
between relations are used to specify these existence
dependencies, and to ensure that they remain valid when
the database is updated. Hence, connections implicitly
define a basic, limited set of integrity constraints on
the database, those that identify and maintain
existence dependencies among tuples from different
relations. Consequently, the rules for the maintenance
of the structural integrity of the model under
insertion and deletion of tuples are easy to specify.
Structural relation types are used to specify how each
relation may be connected to other relations in the
model. Relations are classified into five types:
primary relations, referenced relations, nest
relations, association relations, and lexicon
relations. The motivation behind the choice of these
relation types is discussed, as is their use in data
model design. A methodology for combining multiple,
overlapping data models - also called user views in the
literature - is associated with the structural model.
The database model, or conceptual schema, which
represents the integrated database, may thus be derived
from the individual data models of the users. We
believe that the structural model can be used to
represent the data relationships within the conceptual
schema of the ANSI/SPARC DBMS model since it can
support database submodels, also called external
schema, and maintain the integrity of the submodels
with respect to the integrity constraints expressable
in the structural model. We then briefly discuss the
use of the structural model in database design and
implementation. The structural model provides a tool to
deal effectively with the complexity of large,
real-world databases. We begin this report with a very
short review of existing database models. In Chapter 2,
we state the purpose of the model, and in Chapter 3 we
describe the structural model, first informally and
then using a formal framework based on extensions of
the relational model. Chapter 4 defines the
representations we use, and Chapter 5 covers the
integration of data models that represent the different
user specifications into an integrated database model.
Formal descriptions and examples of the prevalent cases
are given. The work is then placed into context first
relative to other work (Chapter 6) and then briefly
within our methodology for database design (Chapter
7).",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-79-722",
}
@TechReport{Shortliffe:1979:KEM,
author = "Edward H. Shortliffe and Bruce G. Buchanan and Edward
A. Feigenbaum",
title = "Knowledge Engineering for Medical Decision Making: a
review of computer-based clinical decision aids",
type = "Technical Report",
number = "STAN-CS-79-723 (AD-A074 076)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "52",
month = feb,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{McCarthy:1979:FOT,
author = "John McCarthy",
title = "First Order Theories of Individual Concepts and
Propositions",
type = "Technical Report",
number = "STAN-CS-79-724 (AIM-325)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = mar,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{McCarthy:1979:AMQ,
author = "John McCarthy",
title = "Ascribing Mental Qualities to Machines",
type = "Technical Report",
number = "STAN-CS-79-725 (AIM-326, AD-A071 423)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = mar,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Yao:1979:AHK,
author = "Andrew Chi-Chih Yao",
title = "An analysis of $ (h, k, l)$-shellsort",
type = "Technical Report",
number = "STAN-CS-79-726",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-726.html",
abstract = "One classical sorting algorithm, whose performance in
many cases remains unanalyzed, is Shellsort. Let $ \vec
{h} $ be a $t$-component vector of positive integers.
An $ \vec {h}$-Shellsort will sort any given n elements
in t passes, by means of comparisons and exchanges of
elements. Let $ S_j(\vec {h}; n)$ denote the average
number of element exchanges in the $j$-th pass,
assuming that all the $ n!$ initial orderings are
equally likely. In this paper we derive asymptotic
formulas of $ S_j(\vec {h}; n)$ for any fixed $ \vec
{h} = (h, k, l)$, making use of a new combinatorial
interpretation of $ S_3$. For the special case $ \vec
{h} = (3, 2, 1)$, the analysis if further sharpened to
yield exact expressions.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-79-726",
}
@TechReport{Filman:1979:IOI,
author = "Robert Elliot Filman",
title = "The Interaction of Observation and Inference",
type = "Technical Report",
number = "STAN-CS-79-727 (AIM-327)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "235",
month = mar,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shiloach:1979:UMA,
author = "Yossi Shiloach",
title = "Union-member algorithms for non-disjoint sets",
type = "Technical Report",
number = "STAN-CS-79-728",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-728.html",
abstract = "In this paper we deal with the following problem. We
are given a finite set $ U = \{ u_1, \ldots {}, u_n \}
$ and a set $ {\cal S} = \{ S_1, \ldots {}, S_m \} $ of
subsets of $U$. We are also given $ m - 1$ UNION
instructions that have the form UNION($ S_i $,$ S_j$)
and mean `add the set $ S_i \cup S_j$ to the collection
and delete $ S_i$ and $ S_j$.' Interspaced among the
UNIONs are MEMBER(i,j) questions that mean `does $ u_i$
belong to {$ S_j $}?' We present two algorithms that
exhibit the trade-off among the three interesting
parameters of this problem, which are: 1. Time required
to answer one membership question. 2. Time required to
perform the $ m - 1$ UNIONs altogether. 3. Space. We
also give an application of these algorithms to the
problem of 5-coloring of planar graphs.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-79-728",
}
@TechReport{Tarjan:1979:UAP,
author = "Robert Endre Tarjan",
title = "A unified approach to path problems",
type = "Technical Report",
number = "STAN-CS-79-729 (AD-A068 229)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-729.html",
abstract = "We describe a general method for solving path problems
on directed graphs. Such path problems include finding
shortest paths, solving sparse systems of linear
equations, and carrying out global flow analysis of
computer programs. Our method consists of two steps.
First, we construct a collection of regular expressions
representing sets of paths in the graph. This can be
done by using any standard algorithm, such as Gaussian
or Gauss--Jordan elimination. Next, we apply a natural
mapping from regular expressions into the given problem
domain. We exhibit the mappings required to find
shortest paths, solve sparse systems of linear
equations, and carry out global flow analysis. Our
results provide a general-purpose algorithm for solving
any path problem, and show that the problem of
constructing path expressions is in some sense the most
general path problem.",
acknowledgement = ack-nhfb,
pdfpages = "44",
xxnumber = "CS-TR-79-729",
}
@TechReport{Liang:1979:QEC,
author = "Frank M. Liang",
title = "Qualifying examinations in computer science,
1965--1978",
type = "Technical Report",
number = "STAN-CS-79-730",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-730.html",
abstract = "Since 1965, the Stanford Computer Science Department
has periodically given `qualifying examinations' as one
of the requirements of its graduate program. These
examinations are given in each of six subareas of
computer science: Programming Languages and Systems,
Artificial Intelligence, Numerical Analysis, Computer
Design, Theory of Computation, and Analysis of
Algorithms. This report presents the questions from
these examinations, and also the associated reading
lists.",
acknowledgement = ack-nhfb,
pdfpages = "234",
xxnumber = "CS-TR-79-730",
}
@TechReport{Luckham:1979:SPV,
author = "David C. Luckham and Steven M. German and Friedrich W.
von Henke and Richard A. Karp and P. W. Milne and Derek
C. Oppen and Wolfgang Polak and William L. Scherlis",
title = "{Stanford Pascal Verifier} user manual",
type = "Technical Report",
number = "STAN-CS-79-731 (PVG-11, AD-A071 900)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-731.html",
abstract = "The Stanford PASCAL verifier is an interactive program
verification system. It automates much of the work
necessary to analyze a program for consistency with its
documentation, and to give a rigorous mathematical
proof of such consistency or to pin-point areas of
inconsistency. It has been shown to have applications
as an aid to programming, and to have potential for
development as a new and useful tool in the production
of reliable software.",
acknowledgement = ack-nhfb,
pdfpages = "124",
xxnumber = "CS-TR-79-731",
}
@TechReport{Woods:1979:NIC,
author = "Donald R. Woods",
title = "Notes on introductory combinatorics",
type = "Technical Report",
number = "STAN-CS-79-732",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-732.html",
abstract = "In the spring of 1978, Professors George Polya and
Robert Tarjan teamed up to teach CS 150 - Introduction
to Combinatorics. This report consists primarily of the
class notes and other handouts produced by the author
as teaching assistant for the course. Among the topics
covered are elementary subjects such as combinations
and permutations, mathematical tools such as generating
functions and Polya's Theory of Counting, and analyses
of specific problems such as Ramsey Theory, matchings,
and Hamiltonian and Eulerian paths.",
acknowledgement = ack-nhfb,
pdfpages = "124",
xxnumber = "CS-TR-79-732",
}
@TechReport{Yao:1979:LBF,
author = "Andrew Chi-Chih Yao",
title = "A lower bound to finding convex hulls",
type = "Technical Report",
number = "STAN-CS-79-733",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-733.html",
abstract = "Given a set S of n distinct points {($ x_i $,$ y_i$) |
0 $ \leq $ i < n}, the convex hull problem is to
determine the vertices of the convex hull H(S). All the
known algorithms for solving this problem have a
worst-case running time of c$ n \log n $ or higher, and
employ only quadratic tests, i.e., tests of the form
f($ x_0$, $ y_0$, $ x_1$, $ y_1$, \ldots{}, $ x_{n -
1}$, $ y_{n - 1}$): 0 with f being any polynomial of
degree not exceeding 2. In this paper, we show that any
algorithm in the quadratic decision-tree model must
make c$ n \log n $ tests for some input.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-79-733",
}
@TechReport{Tarjan:1979:FAS,
author = "Robert Endre Tarjan",
title = "Fast algorithms for solving path problems",
type = "Technical Report",
number = "STAN-CS-79-734 (AD-A074 079)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-734.html",
abstract = "Let $ G = (V, E) $ be a directed graph with a
distinguished source vertex $s$. The single-source path
expression problem is to find, for each vertex $v$, a
regular expression $ P(s, v)$ which represents the set
of all paths in $G$ from $s$ to $v$. A solution to this
problem can be used to solve shortest path problems,
solve sparse systems of linear equations, and carry out
global flow analysis. We describe a method to compute
path expressions by dividing $G$ into components,
computing path expressions on the components by
Gaussian elimination, and combining the solutions. This
method requires $ O(m \alpha (m, n))$ time on a
reducible flow graph, where $n$ is the number of
vertices in $G$, $m$ is the number of edges in $G$, and
$ \alpha $ is a functional inverse of Ackermann's
function. The method makes use of an algorithm for
evaluating functions defined on paths in trees. A
simplified version of the algorithm, which runs in $
O(m \log n)$ time on reducible flow graphs, is quite
easy to implement and efficient in practice.",
acknowledgement = ack-nhfb,
pdfpages = "50",
xxnumber = "CS-TR-79-734",
}
@TechReport{Wilkinson:1979:KCF,
author = "James Hardy Wilkinson",
title = "{Kronecker}'s canonical form and the {$ Q Z $}
algorithm",
type = "Technical Report",
number = "STAN-CS-79-735",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-735.html",
abstract = "In the QZ algorithm the eigenvalues of Ax = $ \lambda
$Bx are computed via a reduction to the form $ \tilde
{A} $ x = $ \lambda \tilde {B} $ x where $ \tilde {A} $
and $ \tilde {B} $ are upper triangular. The
eigenvalues are given by $ {\lambda }_i $ = $ a_{ii} $
/$ b_{ii} $. It is shown that when the pencil $ \tilde
{A} $ - $ \lambda \tilde {B} $ is singular or nearly
singular a value of $ {\lambda }_i $ may have no
significance even when $ \tilde {a}_{ii} $ and $ \tilde
{b}_{ii} $ are of full size.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-79-735",
}
@TechReport{Wilkinson:1979:NPS,
author = "James Hardy Wilkinson",
title = "Note on the practical significance of the {Drazin}
inverse",
type = "Technical Report",
number = "STAN-CS-79-736",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-736.html",
abstract = "The solution of the differential system $ B x = A x +
f $ where $A$ and $B$ are $ n \times n $ matrices and $
A - \lambda B $ is not a singular pencil may be
expressed in terms of the Drazin inverse. It is shown
that there is a simple reduced form for the pencil $ A
- \lambda B $ which is adequate for the determination
of the general solution and that although the Drazin
inverse could be determined efficiently from this
reduced form it is inadvisable to do so.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-79-736",
}
@TechReport{Yao:1979:ACC,
author = "Andrew C. Yao and F. Frances Yao",
title = "On the average-case complexity of selecting the $k$-th
best",
type = "Technical Report",
number = "STAN-CS-79-737",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-737.html",
abstract = "Let $ {\bar {V}}_k (n) $ be the minimum average number
of pairwise comparisons needed to find the $k$-th
largest of $n$ numbers $ (k \leq 2) $, assuming that
all $ n! $ orderings are equally likely. D. W. Matula
proved that, for some absolute constant $c$, $ {\bar
{V}}_k (n) - n \leq c k \log \log n $ as $ n \to \infty
$. In the present paper, we show that there exists an
absolute constant $ c' > 0 $ such that $ {\bar {V}}_k
(n) - n \leq c' k \log \log n $ as $ n \to \infty $,
proving a conjecture of Matula.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-79-737",
}
@TechReport{LeVeque:1979:CRG,
author = "Randall J. LeVeque and Germund Dahlquist and Dan
Andree",
title = "Computations related to G-stability of linear
multistep methods",
type = "Technical Report",
number = "STAN-CS-79-738 (SU326 P30-65)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-738.html",
abstract = "In Dahlquist's recent proof of the equivalence of
A-stability and G-stability, an algorithm was presented
for calculating a G-stability matrix for any A-stable
linear multistep method. Such matrices, and various
quantities computable from them, are useful in many
aspects of the study of the stability of a given
method. For example, information may be gained as to
the shape of the stability region, or the rate of
growth of unstable solutions. We present a summary of
the relevant theory and the results of some numerical
calculations performed for several backward
differentiation, Adams--Bashforth, and Adams--Moulton
methods of low order.",
acknowledgement = ack-nhfb,
author-dates = "Germund Dahlquist (16 January 1925--8 February 2005)",
pdfpages = "28",
xxnumber = "CS-TR-79-738",
}
@TechReport{Quinlan:1979:ILD,
author = "J. R. Quinlan",
title = "Induction over large data bases",
type = "Technical Report",
number = "STAN-CS-79-739 (HPP-79-14, AD-A074 075)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-739.html",
abstract = "Techniques for discovering rules by induction from
large collections of instances are developed. These are
based on an iterative scheme for dividing the instances
into two sets, only one of which needs to be randomly
accessible. These techniques have made it possible to
discover complex rules from data bases containing many
thousands of instances. Results of several experiments
using them are reported.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-79-739",
}
@TechReport{Cartwright:1979:LA,
author = "Robert Cartwright and Derek C. Oppen",
title = "The logic of aliasing",
type = "Technical Report",
number = "STAN-CS-79-740 (PVG-12)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-740.html",
abstract = "We give a new version of Hoare's logic which correctly
handles programs with aliased variables. The central
proof rules of the logic (procedure call and
assignment) are proved sound and complete.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-79-740",
}
@TechReport{Ramshaw:1979:FAA,
author = "Lyle Harold Ramshaw",
title = "Formalizing the Analysis of Algorithms",
type = "Technical Report",
number = "STAN-CS-79-741",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "123",
month = jun,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gardner:1979:HAI,
author = "Anne Gardner",
title = "Handbook of Artificial Intelligence: Search",
type = "Technical Report",
number = "STAN-CS-79-742 (HPP-79-12, AD-A074 078)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "100",
month = jun,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bulnes-Rozas:1979:GGO,
author = "Juan Bulnes-Rozas",
title = "{GOAL}: a Goal Oriented Command Language for
Interactive Proof Construction",
type = "Technical Report",
number = "STAN-CS-79-743 (AIM-328)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "175",
month = jun,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Garcia-Molina:1979:PUA,
author = "Hector Garcia-Molina",
title = "Performance of Update Algorithms for Replicated Data
in a Distributed Database",
type = "Technical Report",
number = "STAN-CS-79-744 (CSL-TR-172, AD-A075 268)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "320",
month = jun,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lengauer:1979:ULB,
author = "Thomas Lengauer",
title = "Upper and Lower Bounds on Time-Space Tradeoffs in a
Pebble Game",
type = "Technical Report",
number = "STAN-CS-79-745 (AD-A076 264)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "82",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Borning:1979:TCO,
author = "Alan Borning",
title = "{ThingLab} ---- a Constraint- Oriented Simulation
Laboratory",
type = "Technical Report",
number = "STAN-CS-79-746",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "109",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wilkins:1979:UPP,
author = "David E. Wilkins",
title = "Using Patterns and Plans to Solve Problems and Control
Search",
type = "Technical Report",
number = "STAN-CS-79-747 (AIM-329, AD-A076 872)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "264",
month = jun,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Yun:1979:FAS,
author = "David Y. Y. Yun",
title = "Fast algorithms for solving {Toeplitz} systems of
equations and finding rational {Hermite} interpolants",
type = "Technical Report",
number = "STAN-CS-79-748 (AD-A075 376)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-748.html",
abstract = "We present a new algorithm that reduces the
computation for solving a Toeplitz system to O(n $
{log}^2 $ n) and automatically resolves all degenerate
cases of the past. Our fundamental results show that
all rational Hermite interpolants, including Pade
approximants which is intimately related to this
solution process, can be computed fast by an Euclidean
algorithm. In this report we bring out all these
relationships with mathematical justifications and
mention important applications including decoding BCH
codes.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-79-748",
}
@TechReport{Clancey:1979:AOA,
author = "William Clancey and James Bennett and Paul Cohen",
title = "Applications-Oriented {AI} Research: Education",
type = "Technical Report",
number = "STAN-CS-79-749 (HPP-79-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gacs:1979:KAL,
author = "Peter Gacs and Laszlo Lovasz",
title = "{Khachian}'s Algorithm for Linear Programming",
type = "Technical Report",
number = "STAN-CS-79-750 (AD-A075 171)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1979:MLP,
author = "Zohar Manna and Amir Pnueli",
title = "The Modal Logic of Programs",
type = "Technical Report",
number = "STAN-CS-79-751 (AIM-330)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = sep,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Overton:1979:PLA,
author = "Michael Lockhart Overton",
title = "Projected {Lagrangian} Algorithms for Nonlinear
Minimax and $ l_1 $ Optimization",
type = "Technical Report",
number = "STAN-CS-79-752",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "164",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Yao:1979:STS,
author = "Andrew Chi-Chih Yao",
title = "Should tables by sorted?",
type = "Technical Report",
number = "STAN-CS-79-753",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-753.html",
abstract = "We examine optimality questions in the following
information retrieval problem: Given a set S of n keys,
store them so that queries of the form `Is x $ \in $
S?' can be answered quickly. It is shown that, in a
rather general model including al1 the commonly-used
schemes, $ \lceil $ lg(n+l) $ \rceil $ probes to the
table are needed in the worst case, provided the key
space is sufficiently large. The effects of smaller key
space and arbitrary encoding are also explored.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-79-753",
}
@TechReport{Gardner:1979:NLU,
author = "Anne Gardner and James Davidson and Terry A.
Winograd",
title = "Natural Language Understanding",
type = "Technical Report",
number = "STAN-CS-79-754 (HPP-79-21, AD-A076 873)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "100",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kant:1979:ECP,
author = "Elaine Kant",
title = "Efficiency Considerations in Program Synthesis: a
Knowledge-Based Approach",
type = "Technical Report",
number = "STAN-CS-79-755 (AIM-331)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "160",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bennett:1979:AOA,
author = "James S. Bennett and Bruce G. Buchanan and Paul R.
Cohen and Fritz Fisher",
title = "Applications-Oriented {AI} Research: Science and
Mathematics",
type = "Technical Report",
number = "STAN-CS-79-756 (HPP-79-22, AD-A076 875)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "110",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clesielski:1979:AOA,
author = "Victor B. Clesielski and James S. Bennett and Paul R.
Cohen",
title = "Applications-Oriented {AI} Research: Medicine",
type = "Technical Report",
number = "STAN-CS-79-757 (HPP-79-23, AD-A075 402)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ix + 53",
month = jul,
year = "1979",
DOI = "https://doi.org/10.1016/B978-0-86576-090-5.50008-2",
bibdate = "Thu Nov 27 18:27:18 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA075402.pdf",
acknowledgement = ack-nhfb,
pdfpages = "62",
remark = "Published as a section of the \booktitle{Handbook of
Artificial Intelligence}, edited by Avron Barr and
Edward A. Feigenbaum, pp. 175--222, 1982",
}
@TechReport{Elschlager:1979:AP,
author = "Robert Elschlager and Jorge Phillips",
title = "Automatic Programming",
type = "Technical Report",
number = "STAN-CS-79-758 (HPP-79-24, AD-A076 874)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "100",
month = jul,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bonnet:1979:SSS,
author = "Alain Bonnet",
title = "Schema-Shift Strategies for Understanding Structured
Texts in Natural Language",
type = "Technical Report",
number = "STAN-CS-79-759 (HPP-79-25)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + ii + 40",
month = aug,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-759.html",
abstract = "This report presents BAOBAB-2, a computer program
built upon MYCIN [Shortliffe, 1974] that is used for
understanding medical summaries describing the status
of patients. Due both to the conventional way
physicians present medical problems in these summaries
and the constrained nature of medical jargon, these
texts have a very strong structure. BAOBAB-2 takes
advantage of this structure by using a model of this
organization as a set of related schemas that
facilitate the interpretation of these texts.
Structures of the schemas and their relation to the
surface structure are described. Issues relating to
selection and use of these schemas by the program
during interpretation of the summaries are discussed.",
acknowledgement = ack-nhfb,
pdfpages = "48",
xxnumber = "CS-TR-79-759",
}
@TechReport{Graham:1979:SMP,
author = "Ronald L. Graham and Andrew C. Yao and F. Frances
Yao",
title = "Some monotonicity properties of partial orders",
type = "Technical Report",
number = "STAN-CS-79-760",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-760.html",
abstract = "A fundamental quantity which arises in the sorting of
$n$ numbers $ a_1, a_2, \ldots {}, a_n $ is $ {\rm
Pr}(a_i < a_j | P) $, the probability that $ a_i < a_j
$ assuming that all linear extensions of the partial
order $P$ are equally likely. In this paper we
establish various properties of $ {\rm Pr}(a_i < a_j |
P)$ and related quantities. In particular, it is shown
that $ {\rm Pr}(a_i < b_j | P') \geq {\rm Pr}(a_i < b_j
| P)$, if the partial order $P$ consists of two
disjoint linearly ordered sets $ A = \{ a_1 < a_2 <
\cdots {} < a_m \} $, $ B = \{ b_1 < b_2 < \ldots {} <
b_n \} $ and $ P' = P \cup \{ {\rm any relations of the
form} a_k < b_l \} $. These inequalities have
applications in determining the complexity of certain
sorting --- like computations.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "24",
xxnumber = "CS-TR-79-760",
}
@TechReport{West:1979:GDT,
author = "Douglas B. West",
title = "Gossiping without duplicate transmissions",
type = "Technical Report",
number = "STAN-CS-79-761 (AD-A084 021)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-761.html",
abstract = "n people have distinct bits of information, which they
communicate via telephone calls in which they transmit
everything they know. We require that no one ever hear
the same piece of information twice. In the case 4
divides n, n $ \geq $ 8, we provide a construction that
transmits all information using only 9n/4-6 calls.
Previous constructions used 1/2 $ n \log n $ calls.",
acknowledgement = ack-nhfb,
pdfpages = "6",
xxnumber = "CS-TR-79-761",
}
@TechReport{Knuth:1979:MSA,
author = "Donald E. Knuth",
title = "{METAFONT}: a system for alphabet design",
type = "Technical Report",
number = "STAN-CS-79-762 (AIM-332, AD-A083 229)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-762.html",
abstract = "This is the user's manual for METAFONT, a companion to
the \TeX{} typesetting system. The system makes it
fairly easy to define high quality fonts of type in a
machine-independent manner; a user writes `programs' in
a new language developed for this purpose. By varying
parameters of a design, an unlimited number of
typefaces can be obtained from a single set of
programs. The manual also sketches the algorithms used
by the system to draw the character shapes.",
acknowledgement = ack-nhfb,
pdfpages = "58",
xxnumber = "CS-TR-79-762",
}
@TechReport{West:1979:SCD,
author = "Douglas B. West",
title = "A symmetric chain decomposition of {$ L(4, n) $}",
type = "Technical Report",
number = "STAN-CS-79-763 (AD-A076 876)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-763.html",
abstract = "L(m,n) is the set of integer m-tuples ($ a_1 $,
\ldots{}, $ a_m$) with $ 0 \leq a_1 \leq \ldots {} \leq
a_m \leq n$, ordered by $ \underline {a} \leq
\underline {b}$ when $ a_i \leq b_i$ for all i. R.
Stanley conjectured that L(m,n) is a symmetric chain
order for all (m,n). We verify this by construction for
m = 4.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-79-763",
}
@TechReport{Yao:1979:TST,
author = "Andrew Chi-Chih Yao",
title = "On the time-space tradeoff for sorting with linear
queries",
type = "Technical Report",
number = "STAN-CS-79-764",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-764.html",
abstract = "Extending a result of Borodin, et al., we show that
any branching program using linear queries ` $ \sum_i
{\lambda }_i {x_i} : c $ ` to sort n numbers $ x_1 $,$
x_2 $, \ldots{}, $ x_n $ must satisfy the time-space
tradeoff relation TS = $ \Omega (n_2) $. The same
relation is also shown to be true for branching
programs that use queries ` min R = ? ` where R is any
subset of {$ x_1 $,$ x_2 $, \ldots{}, $ x_n $}.",
acknowledgement = ack-nhfb,
pdfpages = "36",
xxnumber = "CS-TR-79-764",
}
@TechReport{Gacs:1979:RBC,
author = "Peter Gacs",
title = "Relation between the complexity and the probability of
large numbers",
type = "Technical Report",
number = "STAN-CS-79-765 (AD-A083 192)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-765.html",
abstract = "$ H(x) $, the negative logarithm of the apriori
probability $ M(x) $, is Levin's variant of
Kolmogorov's complexity of a natural number $x$. Let $
\alpha (n)$ be the minimum complexity of a number
larger than $n$, $ s(n)$ the logarithm of the apriori
probability of obtaining a number larger than $n$. It
was known that $ s(n) \leq \alpha (n) \leq s(n) +
H(\lceil s(n) \rceil)$. We show that the second
estimate is in some sense sharp.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-79-765",
}
@TechReport{Kautsky:1979:EMC,
author = "J. Kautsky and N. K. Nichols",
title = "Equidistributing Meshes with Constraints",
type = "Technical Report",
number = "STAN-CS-79-766 (SU326 P30-69)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = sep,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{VanLoan:1979:SSV,
author = "Charles {Van Loan}",
title = "On {Stewart}'s singular value decomposition for
partitioned orthogonal matrices",
type = "Technical Report",
number = "STAN-CS-79-767",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/stewart-gilbert-w.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-767.html",
abstract = "A variant of the singular value decomposition for
orthogonal matrices due to G. W. Stewart is discussed.
It is shown to be useful in the analysis of (a) the
total least squares problem, (b) the
Golub--Klema--Stewart subset selection algorithm, and
(c) the algebraic Riccati equation.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-79-767",
}
@TechReport{Clancey:1979:TRB,
author = "William John Clancey",
title = "Transfer of Rule-Based Expertise Through a Tutorial
Dialogue",
type = "Technical Report",
number = "STAN-CS-79-769 (AD-A083 432)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xi + 450 + xiii",
month = sep,
year = "1979",
DOI = "https://doi.org/10.5555/908721",
bibdate = "Thu Nov 27 18:35:50 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/citations/ADA083432;
https://apps.dtic.mil/sti/tr/pdf/ADA083432.pdf;
https://dl.acm.org/doi/10.5555/908721;
https://www.semanticscholar.org/paper/Transfer-of-rule-based-expertise-through-a-tutorial-Clancey/754d8ce1fb8511a780a72b120bfad7b7d73a583e",
abstract = "This dissertation describes an intelligent,
computer-aided instructional (ICAI) program, named
GUIDON, with capabilities to carry on a structured case
method dialogue, generate teaching material from
production rules, construct and verify a model of what
the student knows, and explain expert reasoning.
objective of this research has been to convert
consultation program, into an effective instructional
subject matter knowledge of the The principle MYCiN, a
knowledge-based tool. GUIDON combines the consultation
system with tutorial discourse knowledge, while keeping
the two distinct.\par
MYCIN-like knowledge-based consultation programs are
designed to provide expert-level advice about difficult
scientific and medical problems. High performance is
attained by interpreting a large, specialized set of
facts and domain relations that take the form of rules
about what do to in a given circumstance. Such a rule
base is generally built by interviewing human experts
to formulate the knowledge that they use to solve
similar problems In their area of expertise. While it
is generally believed that these programs have
significant educational potential, little work has been
done to evaluate the problems of realizing this
potential.\par
Using a rule base for teaching provides a new
perspective for showing what production rules have to
do with human expertise. This dissertation closely
examines the usefulness and adequacy of MYCIN's rules
for infectious disease diagnosis as an instructional
vehicle: as topics to be discussed in a tutorial, as
problem-solving methods for understanding a student's
behavior, and as skills to be learned by a student. It
is argued that MYCIN-like rule-based systems constitute
a good starting point for developing a tutorial
program, but they are not sufficient in themselves for
making knowledge accessible to a student. Using GUIDON
as an Interactive medium for transferring expertise
provides a larger context about human cognition; this
Is reflected in our consideration of subject matter
representation and principles of tutorial
discourse.\par
The study of subject matter representation focuses on
knowledge that allows the tutor to articulate the
structure, underlying principles, and strategies of the
domain. This dissertation pays particular attention to
aspects of human expertise that have not been captured
by the MYCIN rule base, a kind of Investigation that
has not arisen in the construction, maintenance, and
use of this knowledge base for consultation.\par
The study of tutorial discourse principles focuses on
managing the dialogue to achieve economical, systematic
presentation of problem-solving expertise. In
addition,. tutoring methods for opportunistically
presenting new material and providing hints on the
basis of an hypothesis revision strategy are
demonstrated. GUIDON's teaching and discourse expertise
is represented as explicit rules. These rules comprise
strategies for modeling the student, means for sharing
Initiative, and knowledge of conventional procedures
for discussing a problem in a ``goal-directed''
way.\par
After the basic set of tutorial expertise was developed
using MYCIN's Infectious disease rule set, some
perspective on GUIDON's generality and domain
independence was attained by coupling it to rule sets
for other domains, including an engineering
application. Two experiments of this type were
performed. They reveal the relationship of discourse
strategies to the reasoning structure of the problem
being discussed.",
acknowledgement = ack-nhfb,
pdfpages = "474",
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Oppen:1979:PP,
author = "Derek C. Oppen",
title = "Pretty printing",
type = "Technical Report",
number = "STAN-CS-79-770 (PVG-13)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-770.html",
abstract = "An algorithm for pretty printing is given. For an
input stream of length $n$ and an output device with
margin width $m$, the algorithm requires time $ O(n)$
and space $ O(m)$. The algorithrn is described in terms
of two parallel processes; the first scans the input
stream to determine the space required to print logical
blocks of tokens; the second uses this information to
decide where to break lines of text; the two processes
communicate by means of a buffer of size $ O(m)$. The
algorithm does not wait for the entire stream to be
input, but begins printing as soon as it has received a
linefull of input. The algorithm is easily
implemented.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-79-770",
}
@TechReport{Friedland:1979:KBE,
author = "Peter E. Friedland",
title = "Knowledge-Based Experiment Design in Molecular
Genetics",
type = "Technical Report",
number = "STAN-CS-79-771 (HPP-79-29)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "137",
month = aug,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{McCune:1979:BPM,
author = "Brian P. McCune",
title = "Building Program Models Incrementally from Informal
Descriptions",
type = "Technical Report",
number = "STAN-CS-79-772 (AIM-333, AD-A086 504)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = oct,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chan:1979:UFP,
author = "Tony F. Chan and Gene H. Golub and Randall J.
LeVeque",
title = "Updating formulae and a pairwise algorithm for
computing sample variances",
type = "Technical Report",
number = "STAN-CS-79-773 (AD-A083 170)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = nov,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-773.html",
abstract = "A general formula is presented for computing the
simple variance for a sample of size m + n given the
means and variances for two subsamples of sizes m and
n. This formula is used in the construction of a
pairwise algorithm for computing the variance. Other
applications are discussed as well, including the use
of updating formulae in a parallel computing
environment. We present numerical results and rounding
error analyses for several numerical schemes.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "22",
xxnumber = "CS-TR-79-773",
}
@TechReport{Golub:1979:LSG,
author = "Gene H. Golub and Robert J. Plemmons",
title = "Large scale geodetic least squares adjustment by
dissection and orthogonal decomposition",
type = "Technical Report",
number = "STAN-CS-79-774 (AD-A083 193)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = nov,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-774.html",
abstract = "Very large scale matrix problems currently arise in
the context of accurately computing the coordinates of
points on the surface of the earth. Here geodesists
adjust the approximate values of these coordinates by
computing least squares solutions to large sparse
systems of equations which result from relating the
coordinates to certain observations such as distances
or angles between points. The purpose of this paper is
to suggest an alternative to the formation and solution
of the normal equations for these least squares
adjustment problems. In particular, it is shown how a
block-orthogonal decomposition method can be used in
conjunction with a nested dissection scheme to produce
an algorithm for solving such problems which combines
efficient data management with numerical stability. As
an indication of the magnitude that these least squares
adjustment problems can sometimes attain, the
forthcoming readjustment of the North American Datum in
1983 by the National Geodetic Survey is discussed. Here
it becomes necessary to linearize and solve an
overdetermined system of approximately 6,000,000
equations in 400,000 unknowns - a truly large-scale
matrix problem.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
pdfpages = "40",
xxnumber = "CS-TR-79-774 (AD-A083 193)",
}
@TechReport{Diaconis:1979:ASE,
author = "Persi Diaconis and Ronald L. Graham",
title = "The analysis of sequential experiments with feedback
to subjects",
type = "Technical Report",
number = "STAN-CS-79-775 (AD-A083 288)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-775.html",
abstract = "A problem arising in taste testing, medical, and
parapsychology experiments can be modeled as follows. A
deck of n cards contains $ c_i $ cards labeled i, $ 1
\leq i \leq r $. A subject guesses at the cards
sequentially. After each guess the subject is told the
card just guessed (or at least if the guess was correct
or not). We determine the optimal and worst case
strategies for subjects and the distribution of the
number of correct guesses under these strategies. We
show how to use skill scoring to evaluate such
experiments in a way which (asymptotically) does not
depend on the subject's strategy.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "52",
xxnumber = "CS-TR-79-775",
}
@TechReport{Aspvall:1979:KLP,
author = "Bengt Aspvall and Richard E. Stone",
title = "{Khachiyan}'s Linear Programming Algorithm",
type = "Technical Report",
number = "STAN-CS-79-776",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = nov,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "This paper supersedes STAN-CS-79-750
\cite{Gacs:1979:KAL}.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Graham:1979:CWC,
author = "Ronald L. Graham and Neil J. A. Sloane",
title = "On constant weight codes and harmonious graphs",
type = "Technical Report",
number = "STAN-CS-79-777 (AD-A083 176)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-777.html",
abstract = "Very recently a new method has been developed for
finding lower bounds on the maximum number of codewords
possible in a code of minimum distance d and length n.
This method has led in turn to a number of interesting
questions in graph theory and additive number theory.
In this brief survey we summarize some of these
developments.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
pdfpages = "18",
xxnumber = "CS-TR-79-777",
}
@TechReport{Shaw:1979:HAA,
author = "David Elliot Shaw",
title = "A hierarchical associative architecture for the
parallel evaluation of relational algebraic database
primitives",
type = "Technical Report",
number = "STAN-CS-79-778 (AD-A083 573)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-778.html",
abstract = "Algorithms are described and analyzed for the
efficient evaluation of the primitive operators of a
relational algebra on a proposed non-von Neumann
machine based on a hierarchy of associative storage
devices. This architecture permits an O(log n) decrease
in time complexity over the best known evaluation
methods on a conventional computer system, without the
use of redundant storage, and using currently available
and potentially competitive technology. In many eases
of practical import, the proposed architecture may also
permit a significant improvement (by a factor roughly
proportional to the capacity of the primary associative
storage device) over the performance of previously
implemented or proposed database machine architectures
based on associative secondary storage devices.",
acknowledgement = ack-nhfb,
pdfpages = "60",
xxnumber = "CS-TR-79-778",
}
@TechReport{King:1979:EUD,
author = "Jonathan J. King",
title = "Exploring the Use of Domain Knowledge for Query
Processing Efficiency",
type = "Technical Report",
number = "STAN-CS-79-781",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 21",
month = dec,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-781.html",
abstract = "An approach to query optimization is described that
draws on two sources of knowledge: real world
constraints on the values for the application domain
served by the database; and knowledge about the current
structure of the database and the cost of available
retrieval processes. Real world knowledge is embodied
in rules that are much like semantic integrity rules.
The approach, called `query rephrasing', is to generate
semantic equivalents of user queries that cost less to
process than the original queries. The operation of a
prototype system based on this approach is discussed in
the context of simple queries which restrict a single
file. The need for heuristics to limit the generation
of equivalent queries is also discussed, and a method
using `constraint thresholds' derived from a model of
the retrieval process is proposed.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-79-781",
}
@TechReport{Karp:1979:PCS,
author = "Richard Alan Karp",
title = "Proving Concurrent Systems Correct",
type = "Technical Report",
number = "STAN-CS-80-783 (PVG-14)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "151",
month = nov,
year = "1979",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chow:1980:UFU,
author = "Frederick Chow and Peter Nye and Gio Wiederhold",
title = "{UFORT}: a {Fortran-to-Universal PCODE} Translator",
type = "Technical Report",
number = "CSL-TR-79-168",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 88",
month = jan,
year = "1980",
bibdate = "Fri Jan 12 05:37:03 2024",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib;
https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/csl/tr/79/168/CSL-TR-79-168.pdf",
abstract = "The Fortran compiler described in this document,
UFORT, was written specifically to serve in a Pascal
environment using the Universal P-Code as an
intermediate pseudomachine. The need for implementation
of Fortran these days is due to the great volume of
existing Fortran programs, rather than to a desire to
have this language available to develop new programs.
We have hence implemented the full, but traditional
Fortran standard, rather than the recently adopted
augmented Fortran standard. All aspects of Fortran
which are commonly used in large scientific programs
are available, including such features as SUBROUTINES,
labelled COMMON, and COMPLEX arithmetic. In addition, a
few common extensions, such as integers of different
lengths and assignment of strings to variables, have
been added.",
acknowledgement = ack-nhfb,
}
@TechReport{Gacs:1980:CNW,
author = "Peter Gacs and Leonid A. Levin",
title = "Causal nets or what is a deterministic computation",
type = "Technical Report",
number = "STAN-CS-80-768",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = oct,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-768.html",
abstract = "We introduce the concept of causal nets --- it can be
considered as the most general and elementary concept
of the history of a deterministic computation
(sequential or parallel). Causality and locality are
distinguished as the only important properties of nets
representing such records. Different types of
complexities of computations correspond to different
geometrical characteristics of the corresponding causal
nets --- which have the advantage of being finite
objects. Synchrony becomes a relative notion. Nets can
have symmetries; therefore it will make sense to ask
what can be computed from arbitrary symmetric inputs.
Here, we obtain a complete group-theoretical
characterization of the kind of symmetries that can be
allowed in parallel computations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-768",
}
@TechReport{Manna:1980:PFP,
author = "Zohar Manna and Richard J. Waldinger",
title = "Problematic features of programming languages: a
situational-calculus approach",
type = "Technical Report",
number = "STAN-CS-80-779",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-779.html",
abstract = "Certain features of programming languages, such as
data structure operations and procedure call
mechanisms, have been found to resist formalization by
classical techniques. An alternate approach is
presented, based on a ``situational calculus,'' which
makes explicit reference to the states of a
computation. For each state, a distinction is drawn
between an expression, its value, and the location of
the value. Within this conceptual framework, the
features of a programming language can be described
axiomatically. Programs in the language can then be
synthesized, executed, verified, or transformed by
performing deductions in this axiomatic system.
Properties of entire classes of programs, and of
programming languages, can also be expressed and proved
in this way. The approach is amenable to machine
implementation. In a situational-calculus formalism it
is possible to model precisely many ``problematic''
features of programming languages, including operations
on such data structures as arrays, pointers, lists, and
records, and such procedure call mechanisms as
call-by-reference, call-by-value, and call-by-name. No
particular obstacle is presented by aliasing between
variables, by declarations, or by recursive procedures.
The paper is divided into three parts, focusing
respectively on the assignment statement, on data
structure operations, and on procedure call mechanisms.
In this first part, we introduce the conceptual
framework to be applied throughout and present the
axiomatic definition of the assignment statement. If
suitable restrictions on the programming language are
imposed, the well-known Hoare assignment axiom can then
be proved as a theorem. However, our definition can
also describe the assignment statement of unrestricted
programming languages, for which the Hoare axiom does
not hold.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-779",
}
@TechReport{Knuth:1980:CMF,
author = "Donald E. Knuth",
title = "The {Computer Modern Family} of Typefaces",
type = "Technical Report",
number = "STAN-CS-80-780",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "1",
month = jan,
year = "1980",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-780.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-80-780",
abstract = "This report gives machine-independent definitions of
all the styles of type planned for use in future
editions of ``The Art of Computer Programming.'' Its
main purpose is to provide a detailed example of a
complete family of font definitions using METAFONT, so
that people who want new symbols for their own books
and papers will understand how to incorporate them
easily. The fonts are intended to have the same spirit
as those used in earlier editions of ``The Art of
Computer Programming,'' but each character has been
redesigned and defined in the METAFONT idiom. It is
hoped that some readers will be inspired to make
similar definitions of other important families of
fonts. The bulk of this report consists of about 400
short METAFONT programs for the various symbols needed,
and as such it is pretty boring, but there are some
nice illustrations.",
acknowledgement = ack-nhfb # "\slash " # ack-hk,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-80-780",
xxnumber = "CS-TR-80-780",
}
@TechReport{Anonymous:1980:NP,
author = "Anonymous",
title = "{NEVER PRINTED}",
type = "Technical Report",
number = "STAN-CS-80-782",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "????",
month = "????",
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Stefik:1980:PC,
author = "Mark Jeffrey Stefik",
title = "Planning with Constraints",
type = "Technical Report",
number = "STAN-CS-80-784 (HPP-80-2)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "230",
month = jan,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Huet:1980:ERR,
author = "Gerard Huet and Derek C. Oppen",
title = "Equations and rewrite rules: a survey",
type = "Technical Report",
number = "STAN-CS-80-785 (PVG-15)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-785.html",
abstract = "Equations occur frequently in mathematics, logic and
computer science. In this paper, we survey the main
results concerning equations, and the methods available
for reasoning about them and computing with them. The
survey is self-contained and unified, using traditional
abstract algebra. Reasoning about equations may involve
deciding if an equation follows from a given set of
equations (axioms), or if an equation is true in a
given theory. When used in this manner, equations state
properties that hold between objects. Equations may
also be used as definitions; this use is well known in
computer science: programs written in applicative
languages, abstract interpreter definitions, and
algebraic data type definitions are clearly of this
nature. When these equations are regarded as oriented
``rewrite rules,'' we may actually use them to compute.
In addition to covering these topics, we discuss the
problem of ``solving'' equations (the ``unification''
problem), the problem of proving termination of sets of
rewrite rules, and the decidability and complexity of
word problems and of combinations of equational
theories. We restrict ourselves to first-order
equations, and do not treat equations which define
non-terminating computations or recent work on rewrite
rules applied to equational congruence classes.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-785",
}
@TechReport{Knuth:1980:AMM,
author = "Donald E. Knuth",
title = "Algorithms in modern mathematics and computer
science",
type = "Technical Report",
number = "STAN-CS-80-786 (AD-A089 912)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 25",
month = jan,
year = "1980",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/80/786/CS-TR-80-786.pdf;
http://www-db.stanford.edu/TR/CS-TR-80-786.html",
abstract = "The life and work of the ninth century scientist
al-Khwarizmi, ``the father of algebra and algorithms,''
is surveyed briefly. Then a random sampling technique
is used in an attempt to better understand the kinds of
thinking that good mathematicians and computer
scientists do and to analyze whether such thinking is
significantly ``algorithmic'' in nature. (This is the
text of a talk given at the opening session of a
symposium on ``Algorithms in Modern Mathematics and
Computer Science'' held in Urgench, Khorezm Oblast',
Uzbek S.S.R., during the week of September 16--22,
1979.)",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-80-786",
pdfpages = "30",
xxnumber = "CS-TR-80-786",
}
@TechReport{Symm:1980:REBa,
author = "H. J. Symm and James H. Wilkinson",
title = "Realistic Error Bounds for a Simple Eigenvalue and its
Associated Eigenvector",
type = "Technical Report",
number = "STAN-CS-80-787",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
year = "1980",
bibdate = "Fri Nov 21 09:13:28 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Published as \cite{Symm:1980:REBb}.",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
remark = "Published in \booktitle{Numerische Mathematik} {\bf
35}(2) 113--126, June 1980, doi:10.1007/BF01396310.",
xxnumber = "CS-TR-80-787",
}
@TechReport{McCarthy:1980:CFN,
author = "John McCarthy",
title = "Circumscription --- a form of non-monotonic
reasoning",
type = "Technical Report",
number = "STAN-CS-80-788 (AIM-334, AD-AO86 574)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-788.html",
abstract = "Humans and intelligent computer programs must often
jump to the conclusion that the objects they can
determine to have certain properties or relations are
the only objects that do. Circumscription formalizes
such conjectural reasoning.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-80-788",
}
@TechReport{Luckham:1980:AES,
author = "David C. Luckham and Wolfgang Polak",
title = "{ADA} exceptions: specification and proof techniques",
type = "Technical Report",
number = "STAN-CS-80-789",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-789.html",
abstract = "A method of documenting exception propagation and
handling in Ada programs is proposed. Exception
propagation declarations are introduced as a new
component of Ada specifications. This permits
documentation of those exceptions that can be
propagated by a subprogram. Exception handlers are
documented by entry assertions. Axioms and proof rules
for Ada exceptions are given. These rules are simple
extensions of previous rules for Pascal and define an
axiomatic semantics of Ada exceptions. As a result, Ada
programs specified according to the method can be
analysed by formal proof techniques for consistency
with their specifications, even if they employ
exception propagation and handling to achieve required
results (i.e. non-error situations). Example
verifications are given.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-789",
}
@TechReport{Wiederhold:1980:DH,
author = "Gio Wiederhold",
title = "Databases in healthcare",
type = "Technical Report",
number = "STAN-CS-80-790",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-790.html",
abstract = "This report defines database design and implementation
technology as applicable to healthcare. The
relationship of technology to various healthcare
settings is explored, and the effectiveness on
healthcare costs, quality and access is evaluated. A
summary of relevant development directions is included.
Detailed examples of 5 typical clinical applications
(public health, clinical trials, clinical research,
ambulatory care, and hospitals) are appended. There is
an extended bibliography.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-790",
}
@TechReport{Wilcox:1980:MLM,
author = "Clark R. Wilcox and Mary L. Dageforde and Gregory A.
Jirak",
title = "{Mainsail} Language Manual",
type = "Technical Report",
number = "STAN-CS-80-791 (CSL 78-166)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "247",
month = mar,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "This reported was misnumbered as CS-80-790.",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wilcox:1980:MIO,
author = "Clark R. Wilcox and Mary L. Dageforde and Gregory A.
Jirak",
title = "{MAINSAIL} implementation overview",
type = "Technical Report",
number = "STAN-CS-80-792 (CSL 78-167)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-792.html",
abstract = "The MAINSAIL programming language and the supporting
implementations have been developed over the past five
years as an integrated approach to a viable
machine-independent system suitable for the development
of large, portable programs. Particular emphasis has
been placed on minimizing the effort involved in moving
the system to a new machine and/or operating system.
For this reason, almost all of the compiler and runtime
support is written in MAINSAIL, and is utilized in each
implementation without alteration. This use of a
high-level language to support its own implementation
has proved to be a significant advantage in terms of
documentation and maintenance, without unduly affecting
the execution speed. This paper gives an overview of
the compiler and runtime implementation strategies, and
indicates what an implementation requires for the
machine-dependent and operating-system-dependent
parts.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-792",
}
@TechReport{Barr:1980:RK,
author = "Avron Barr and James Davidson",
title = "Representation of Knowledge",
type = "Technical Report",
number = "STAN-CS-80-793",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "82",
month = mar,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tarjan:1980:RDC,
author = "Robert Endre Tarjan",
title = "Recent developments in the complexity of combinatorial
algorithms",
type = "Technical Report",
number = "STAN-CS-80-794",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-794.html",
abstract = "The last three years have witnessed several major
advances in the area of combinatorial algorithms. These
include improved algorithms for matrix multiplication
and maximum network flow, a polynomial-time algorithm
for linear programming, and steps toward a
polynomial-time algorithm for graph isomorphism. This
paper surveys these results and suggests directions for
future research. Included is a discussion of recent
work by the author and his students on dynamic
dictionaries, network flow problems, and related
questions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-794",
}
@TechReport{Knuth:1980:L,
author = "Donald E. Knuth",
title = "The Letter {S}",
type = "Technical Report",
number = "STAN-CS-80-795",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 34",
month = apr,
year = "1980",
DOI = "https://doi.org/10.1007/BF03023051",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA090470.pdf",
acknowledgement = ack-nhfb,
pdfpages = "37",
remark-1 = "Published in \booktitle{The Mathematical
Intelligencer}, {\bf 2}(3) 114--122 (1979)",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
xxabstract = "This expository paper explains how the problem of
drawing the letter ``S'' leads to interesting problems
in elementary calculus and analytic geometry. It also
gives a brief introduction to the authors METAFONT
language for alphabet design.",
}
@TechReport{Samuel:1980:E,
author = "Arthur L. Samuel",
title = "Essential {E}",
type = "Technical Report",
number = "STAN-CS-80-796 (AIM-335)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 33",
month = mar,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-796.html",
abstract = "This is an introductory manual describing the
display-oriented text editor E that is available on the
Stanford A.I. Laboratory PDP-10 computer. The present
manual is intended to be used as an aid for the
beginner as well as for experienced computer users who
either are unfamiliar with the E editor or use it
infrequently. Reference is made to the two on-line
manuals that help the beginner to get started and that
provide a complete description of the editor for the
experienced user. E is commonly used for writing
computer programs and for preparing reports and
memoranda. It is not a document editor, although it
does provide some facilities for getting a document
into a pleasing format. The primary emphasis is that of
speed, both in terms of the number of key strokes
required of the user and in terms of the demands made
on the computer system. At the same time, E is easy to
learn and it offers a large range of facilities that
are not available on many editors.",
acknowledgement = ack-nhfb,
author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
xxnumber = "CS-TR-80-796",
}
@TechReport{Garcia-Molina:1980:ROT,
author = "Hector Garcia-Molina and Gio Wiederhold",
title = "Read-only transactions in a distributed database",
type = "Technical Report",
number = "STAN-CS-80-797",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-797.html",
abstract = "A read-only transaction or query is a transaction
which does not modify any data. Read-only transactions
could be processed with general transaction processing
algorithms, but in many cases it is more efficient to
process read-only transactions with special algorithms
which take advantage of the knowledge that the
transaction only reads. This paper defines the various
consistency and currency requirements that read-only
transactions may have. The processing of the different
classes of read-only transactions in a distributed
database is discussed. The concept of R insularity is
introduced to characterize both the read-only and
update algorithms. Several simple update and read-only
transaction processing algorithms are presented to
illustrate how the query requirements and the update
algorithms affect the read-only transaction processing
algorithms.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-797",
}
@TechReport{Floyd:1980:CRE,
author = "Robert W. Floyd and Jeffrey D. Ullman",
title = "The Compilation of Regular Expressions into Integrated
Circuits",
type = "Technical Report",
number = "STAN-CS-80-798",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 28",
month = apr,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA090507.pdf",
abstract = "We consider the design of integrated circuits to
implement arbitrary regular expressions. In general, we
may use the McNaughton--Yamada algorithm to convert a
regular expression of length n into a nondeterministic
finite automaton with at most $ 2 n $ states and $ 4 n
$ transitions. Instead of converting the
nondeterministic device to a deterministic one, we
propose two ways of implementing the nondeterministic
device directly. First, we could produce a PLA
(programmable logic array) of approximate dimensions $
4 n \times 4 n $ by representing the states directly by
columns, rather than coding the states in binary. This
approach, while theoretically suboptimal, makes use of
carefully developed technology and, because of the care
with which PLA implementation has been done, may be the
preferred technique in many real situations. Another
approach is to use the hierarchical structure of the
automaton produced from the regular expression to guide
a hierarchical layout of the circuit. This method
produces a circuit $ O(\sqrt {n}) $ on a side and is,
to within a constant factor, the best that can be done
in general.",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
pdfpages = "33",
remark = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Friedman:1980:MAS,
author = "Jerome H. Friedman and Eric Grosse and Werner
Stuetzle",
title = "Multidimensional additive spline approximation",
type = "Technical Report",
number = "STAN-CS-80-799",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-799.html",
abstract = "We describe an adaptive procedure that approximates a
function of many variables by a sum of (univariate)
spline functions $ s_m $ of selected linear
combinations $ a_m \cdot x $ of the coordinates $
\theta (x) = \sum_{1 \leq m \leq M} s_m (a_m \cdot x)
$. The procedure is nonlinear in that not only the
spline coefficients but also the linear combinations
are optimized for the particular problem. The sample
need not lie on a regular grid, and the approximation
is affine invariant, smooth, and lends itself to
graphical interpretation. Function values, derivatives,
and integrals are cheap to evaluate.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-799",
}
@TechReport{Blum:1979:ASC,
author = "Robert L. Blum",
title = "Automating the Study of Clinical Hypotheses on a
Time-Oriented Data Base: The {RX Project}",
type = "Technical Report",
number = "STAN-CS-79-816",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = nov,
year = "1979",
bibdate = "Fri Nov 7 07:00:05 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/TR/CS-TR-79-816.html",
abstract = "The existence of large chronic disease data bases
offers the possibility of studying hypotheses of major
medical importance. An objective of the RX Project is
to assist a clinical researcher with the tasks of
experimental design and statistical analysis. A major
component of RX is a knowledge base of medicine and
statistics, organized as a frame-based, taxonomic tree.
RX determines confounding variables, study design, and
analytic techniques. It then gathers data, analyzes it,
and interprets results. The American Rheumatism
Association Medical Information System is used.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-79-816",
}
@TechReport{Vitter:1980:ACH,
author = "Jeffrey Scott Vitter",
title = "Analysis of Coalesced Hashing",
type = "Technical Report",
number = "STAN-CS-79-817",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "111",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1980:DLC,
author = "Donald E. Knuth",
title = "Deciphering a Linear Congruential Encryption",
type = "Technical Report",
number = "STAN-CS-80-800",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = apr,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/prng.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{IEEE Transactions on
Information Theory}, {\bf 31}(1), 49--52, January 1985,
doi:10.1109/tit.1985.1056997",
}
@TechReport{El-Masri:1980:DUI,
author = "Ramez Aziz El-Masri",
title = "On the Design, Use, and Integration of Data Models",
type = "Technical Report",
number = "STAN-CS-80-801",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "228",
month = may,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Polak:1980:TCS,
author = "Wolfgang Heinz Polak",
title = "Theory of Compiler Specification and Verification",
type = "Technical Report",
number = "STAN-CS-80-802 (PVG-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "288",
month = may,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{VanWyk:1980:LTG,
author = "Christopher John {Van Wyk}",
title = "A Language for Typesetting Graphics",
type = "Technical Report",
number = "STAN-CS-80-803",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "may",
month = "1980",
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Brooks:1980:DCT,
author = "Martin Brooks",
title = "Determining Correctness by Testing",
type = "Technical Report",
number = "STAN-CS-80-804 (AIM-336)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = may,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gennery:1980:MEE,
author = "Donald B. Gennery",
title = "Modelling the Environment of an Exploring Vehicle by
Means of Stereo Vision",
type = "Technical Report",
number = "STAN-CS-80-805 (AIM-339, AD-A091 081)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "151",
month = jun,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Coughran:1980:ASH,
author = "William Marvin Coughran",
title = "On the Approximate Solution of Hyperbolic
Initial-Boundary Value Problems",
type = "Technical Report",
number = "STAN-CS-80-806",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "177",
month = jun,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/c/coughran-william-m.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Matula:1980:PRG,
author = "David W. Matula and Danny Dolev",
title = "Path-regular graphs",
type = "Technical Report",
number = "STAN-CS-80-807 (AD-A091 123)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "39",
month = jun,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-807.html",
abstract = "A graph is vertex-[edge-]path-regular if a list of
shortest paths, allowing multiple copies of paths,
exists where every pair of vertices are the endvertices
of the same number of paths and each vertex [edge]
occurs in the same number of paths of the list. The
dependencies and independencies between the various
path-regularity, regularity of degree, and symmetry
properties are investigated. We show that every
connected vertex-[edge-]symmetric graph is
vertex-[edge-]path-regular, but not conversely. We show
that the product of any two vertex-path-regular graphs
is vertex-path-regular but not conversely, and the
iterated product $ G \times G \times \cdots {} \times G
$ is edge-path-regular if and only if $G$ is
edge-path-regular. An interpretation of path-regular
graphs is given regarding the efficient design of
concurrent communication networks.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-807",
}
@TechReport{McCarthy:1980:FRB,
author = "John McCarthy and Thomas O. Binford and David C.
Luckham and Zohar Manna and Richard W. Weyhrauch and
Les Earnest",
title = "Final report: Basic Research in Artificial
Intelligence and Foundations of Programming",
type = "Technical Report",
number = "STAN-CS-80-808 (AIM-337, AD-A091 183)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-808.html",
abstract = "Recent research results are reviewed in the areas of
formal reasoning, mathematical theory of computation,
program verification, and image understanding.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-80-808",
}
@TechReport{Ohwovoriole:1980:EST,
author = "Morgan S. Ohwovoriole",
title = "An Extension of Screw Theory and its Application to
the Automation of Industrial Assemblies",
type = "Technical Report",
number = "STAN-CS-80-809 (AIM-338)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "186",
month = apr,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Steele:1980:LBA,
author = "J. Michael Steele and Andrew C. Yao",
title = "Lower Bounds for Algebraic Decision Trees",
type = "Technical Report",
number = "STAN-CS-80-810 (AD-A091 124)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jul,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{German:1980:ESD,
author = "Steven M. German",
title = "An extended semantic definition of {Pascal} for
proving the absence of common runtime errors",
type = "Technical Report",
number = "STAN-CS-80-811 (PVG-18, AD-A091 313)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-811.html",
abstract = "We present an axiomatic definition of Pascal which is
the logical basis of the Runcheck system, a working
verifier for proving the absence of runtime errors such
as arithmetic overflow, array subscripting out of
range, and accessing an uninitialized variable. Such
errors cannot be detected at compile time by most
compilers. Because the occurrence of a runtime error
may depend on the values of data supplied to a program,
techniques for assuring the absence of errors must be
based on program specifications. Runcheck accepts
Pascal programs documented with assertions, and proves
that the specifications are consistent with the program
and that no runtime errors can occur. Our axiomatic
definition is similar to Hoare's axiom system, but it
takes into account certain restrictions that have not
been considered in previous definitions. For instance,
our definition accurately models uninitialized
variables, and requires a variable to have a well
defined value before it can be accessed. The logical
problems of introducing the concept of uninitialized
variables are discussed. Our definition of expression
evaluation deals more fully with function calls than
previous axiomatic definitions. Some generalizations of
our semantics are presented, including a new method for
verifying programs with procedure and function
parameters. Our semantics can be easily adopted to
similar languages, such as ADA. One of the main
potential problems for the user of a verifier is the
need to write detailed, repetitious assertions. We
develop some simple logical properties of our
definition which are exploited by Runcheck to reduce
the need for such detailed assertions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-811",
}
@TechReport{Feigenbaum:1980:KEA,
author = "Edward A. Feigenbaum",
title = "Knowledge Engineering: The Applied Side of Artificial
Intelligence",
type = "Technical Report",
number = "STAN-CS-80-812 (HPP-80-14)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = sep,
year = "1980",
bibdate = "Tue Nov 25 08:51:44 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Moravec:1980:OAN,
author = "Hans Peter Moravec",
title = "Obstacle Avoidance and Navigation in the Real World by
a Seeing Robot Rover",
type = "Technical Report",
number = "STAN-CS-80-813 (AIM-340)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "174",
month = sep,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Aikins:1980:PPR,
author = "Janice S. Aikins",
title = "Prototypes and Production Rules: a Knowledge
Representation for Computer Consultations",
type = "Technical Report",
number = "STAN-CS-80-814 (HPP-80-17, AD-A091 177)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "204",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shortliffe:1980:TPM,
author = "Edward H. Shortliffe",
title = "Two Papers on Medical Computing -- (1) Medical
Cybernetics: The Challenges of Clinical Computing, (2)
Consultation Systems for Physicians: The Role of
Artificial Intelligence Techniques",
type = "Technical Report",
number = "STAN-CS-80-815 (HPP-80-16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "56",
month = jul,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Scherlis:1980:EPP,
author = "William Louis Scherlis",
title = "Expression Procedures and Program Derivation",
type = "Technical Report",
number = "STAN-CS-80-818 (AIM-341, AD-A091 187)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "178",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goad:1980:CUM,
author = "Christopher Alan Goad",
title = "Computational Uses of the Manipulation of Formal
Proofs",
type = "Technical Report",
number = "STAN-CS-80-819 (AD-A091 180)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{vanMelle:1980:DIS,
author = "William van Melle",
title = "A Domain-Independent System That Aids in Constructing
Knowledge-Based Consultation Programs",
type = "Technical Report",
number = "STAN-CS-80-820 (HPP-80-22)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "192",
month = jun,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{West:1980:SUC,
author = "Douglas B. West and Craig A. Tovey",
title = "Semiantichains and unichain coverings in direct
products of partial orders",
type = "Technical Report",
number = "STAN-CS-80-821",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-821.html",
abstract = "We conjecture a generalization of Dilworth's theorem
to direct products of partial orders. In particular, we
conjecture that the largest ``semiantichain'' and the
smallest ``unichain covering'' have the same size. We
consider a special class of semiantichains and unichain
coverings and determine when equality holds for them.
This conjecture implies the existence of k-saturated
partitions. A stronger conjecture, for which we also
prove a special case, implies the Greene-Kleitman
result on simultaneous k and $ (k + 1)$-saturated
partitions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-821",
}
@TechReport{Aspvall:1980:EAC,
author = "Bengt Aspvall",
title = "Efficient Algorithms for Certain Satisfiability and
Linear Programming Problems",
type = "Technical Report",
number = "STAN-CS-80-822",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = sep,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Shaw:1980:KBR,
author = "David Elliot Shaw",
title = "Knowledge-Based Retrieval on a Relational Database
Machine",
type = "Technical Report",
number = "STAN-CS-80-823",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "280",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mei:1980:LLC,
author = "Tung Yun Mei",
title = "{LCCD}, a language for {Chinese} character design",
type = "Technical Report",
number = "STAN-CS-80-824",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-824.html",
abstract = "LCCD is a computer system able to produce
aesthetically pleasing Chinese characters for use on
raster-oriented printing devices. It is analogous to
METAFONT, in that the user writes a little program that
explains how to draw each character; but it uses
different types of simulated 'pens' that are more
appropriate to the Chinese idiom, and it includes
special scaling features so that a complex character
can easily be built up from simpler ones, in an
interactive manner. This report contains a user's
manual for LCCD, together with many illustrative
examples and a discussion of the algorithms used.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-824",
}
@TechReport{Schnorr:1980:RAI,
author = "C. P. Schnorr",
title = "Refined Analysis and Improvements on Some Factoring
Algorithm",
type = "Technical Report",
number = "STAN-CS-80-825",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = nov,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wiederhold:1980:DAC,
author = "Gio Wiederhold and Anne Beetem and Garrett Short",
title = "A database approach to communication in {VLSI}
design",
type = "Technical Report",
number = "STAN-CS-80-826",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-826.html",
abstract = "This paper describes recent and planned work at
Stanford in applying database technology to the
problems of VLSI design. In particular, it addresses
the issue of communication within a design's different
representations and hierarchical levels in a multiple
designer environment. We demonstrate the heretofore
questioned utility of using commercial database
systems, at least while developing a versatile,
flexible, and generally efficient model and its
associated communication paths. Completed work and
results from initial work using DEC DBMS-20 is
presented, including macro expansion within the
database, and signalling of changes to higher
structural levels. Considerable discussion regarding
overall philosophy for continued work is also
included.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-826",
}
@TechReport{Yao:1980:PCK,
author = "Andrew Chi-Chih Yao",
title = "On the parallel computation for the knapsack problem",
type = "Technical Report",
number = "STAN-CS-80-827",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-827.html",
abstract = "We are interested in the complexity of solving the
knapsack problem with n input real numbers on a
parallel computer with real arithmetic and branching
operations. A processor-time tradeoff constraint is
derived; in particular, it is shown that an exponential
number of processors have to be used if the problem is
to be solved in time $ t \leq \sqrt {n} / 2 $.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-827",
}
@TechReport{Knuth:1980:BPL,
author = "Donald E. Knuth and Michael F. Plass",
title = "Breaking Paragraphs Into Lines",
type = "Technical Report",
number = "STAN-CS-80-828",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "66",
month = nov,
year = "1980",
DOI = "https://doi.org/10.1002/spe.4380111102",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Software --- Practice and
Experience}, {\bf 11}(11) 1119--1184, November 1981.
doi:10.1002/spe.4380111102",
}
@TechReport{Aspvall:1980:DTP,
author = "Bengt Aspvall and Frank M. Liang",
title = "The dinner table problem",
type = "Technical Report",
number = "STAN-CS-80-829",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = dec,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-829.html",
abstract = "This report contains two papers inspired by the
``dinner table problem'': If n people are seated
randomly around a circular table for two meals, what is
the probability that no two people sit together at both
meals? We show that this probability approaches $
e^{-2} $ as $ n \rightarrow \infty $, and also give a
closed form. We then observe that in many similar
problems on permutations with restricted position, the
number of permutations satisfying a given number of
properties is approximately Poisson distributed. We
generalize our asymptotic argument to prove such a
limit theorem, and mention applications to the problems
of derangements, menages, and the asymptotic number of
Latin rectangles.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-829",
}
@TechReport{Matula:1980:TLT,
author = "David W. Matula and Yossi Shiloach and Robert E.
Tarjan",
title = "Two linear-time algorithms for five-coloring a planar
graph",
type = "Technical Report",
number = "STAN-CS-80-830",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-830.html",
abstract = "A ``sequential processing'' algorithm using bicolor
interchange that five-colors an n vertex planar graph
in $ O(n^2) $ time was given by Matula, Marble, and
Isaacson [1972]. Lipton and Miller used a ``batch
processing'' algorithm with bicolor interchange for the
same problem and achieved an improved $ O(n \log n) $
time bound [1978]. In this paper we use graph
contraction arguments instead of bicolor interchange
and improve both the sequential processing and batch
processing methods to obtain five-coloring algorithms
that operate in O(n) time.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-830",
}
@TechReport{Sleator:1980:AMN,
author = "Daniel D. K. Sleator",
title = "An {$ O(n m \log n) $} Algorithm for Maximum Network
Flow",
type = "Technical Report",
number = "STAN-CS-80-831",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "81",
month = dec,
year = "1980",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dolev:1980:SWG,
author = "Danny Dolev",
title = "Scheduling wide graphs",
type = "Technical Report",
number = "STAN-CS-80-832",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-832.html",
abstract = "The problem of scheduling a partially ordered set of
unit length tasks on m identical processors is known to
be NP-complete. There are efficient algorithms for only
a few special cases of this problem. In this paper we
explore the relations between the structure of the
precedence graph (the partial order) and optimal
schedules. We prove that in finding an optimal schedule
for certain systems it suffices to consider at each
step high roots which belong to at most the m-1 highest
components of the precedence graph. This result reduces
the number of cases we have to check during the
construction of an optimal schedule. Our method may
lead to the development of linear scheduling algorithms
for many practical cases and to better bounds for
complex algorithms. In particular, in the case the
precedence graph contains only inforest and outforest
components, this result leads to efficient algorithms
for obtaining an optimal schedule on two or three
processors.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-832",
}
@TechReport{Gilbert:1980:GST,
author = "John Russell Gilbert",
title = "Graph Separator Theorems and Sparse {Gaussian}
Elimination",
type = "Technical Report",
number = "STAN-CS-80-833",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "104",
month = dec,
year = "1980",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bjorstad:1980:NSB,
author = "Petter E. Bj{\o}rstad",
title = "Numerical Solution of the Biharmonic Equation",
type = "Technical Report",
number = "STAN-CS-80-834 (SU326 P3070)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "139",
month = dec,
year = "1980",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA104084.pdf",
abstract = "The numerical solution of discrete approximations to
the first biharmonic boundary value problem in
rectangular domains is studied. Several finite
difference schemes are compared and a family of new
fast algorithms for the solution of the discrete
systems is developed. These methods are optimal, having
a theoretical computational complexity of $ O(N^2) $
arithmetic operations and requiring $ N^2 + O(N) $
storage locations when solving the problem on an $N$ by
$N$ grid. Several practical computer implementations of
the algorithm are discussed and compared. These
implementations require $ a N^2 + b N^2 \log N$
arithmetic operations with $ b \ll a$. The algorithms
take full advantage of vector or parallel computers and
can also be used to solve a sequence of problems
efficiently. A new fast direct method for the
biharmonic problem on a disk is also developed. It is
shown how the new method of solution is related to the
associated eigenvalue problem. The results of extensive
numerical tests and comparisons are included throughout
the dissertation.\par
It is believed that the material presented provides a
good foundation for practical computer implementations
and that the numerical solution of the biharmonic
equation in rectangular domains from now on, will be
considered no more difficult than Poisson's equation.",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis. The PDF file is OCR'ed
scans of microfiche page images.",
}
@TechReport{Grosse:1980:AOE,
author = "Eric H. Grosse",
title = "Approximation and Optimization of Electron Density
Maps",
type = "Technical Report",
number = "STAN-CS-80-835",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "118",
month = dec,
year = "1980",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Spector:1980:PRO,
author = "Alfred Z. Spector",
title = "Performing remote operations efficiently on a local
computer network",
type = "Technical Report",
number = "STAN-CS-80-850 (CSL 81-207)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = dec,
year = "1980",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-80-850.html",
abstract = "This paper presents a communication model for local
networks, whereby processes execute generalized remote
references that cause operations to be performed by
remote processes. This remote reference/remote
operation model provides a taxonomy of primitives that
(1) are naturally useful in many applications and (2)
can be efficiently implemented. The motivation for this
work is our desire to develop systems architectures for
local network based multiprocessors that support
distributed applications requiring frequent
interprocessor communication. After a section
containing a brief overview, Section 2 of this paper
discusses the remote reference/remote operation model.
In it, we derive a set of remote reference types that
can be supported by a communication system carefully
integrated with the local network interface. The third
section exemplifies a communication system that
provides one remote reference type. These references
(i.e., remote load, store, compare-and-swap, enqueue,
and dequeue) take about 150 microseconds, or 50 average
instruction times, to perform on Xerox Alto computers
connected by a 2.94 megabit Ethernet. The last section
summarizes this work and proposes a complete
implementation resulting in a highly efficient
communication system.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-80-850",
}
@TechReport{Genesereth:1980:RPI,
author = "Michael R. Genesereth",
title = "The Role of Plans In Intelligent Teaching Systems",
type = "Technical Report",
number = "STAN-CS-81-842",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = nov,
year = "1980",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hailpern:1980:VCP,
author = "Brent T. Hailpern",
title = "Verifying Concurrent Processes Using Temporal Logic",
type = "Technical Report",
number = "STAN-CS-82-942",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "114",
month = aug,
year = "1980",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Manna:1981:TVCa,
author = "Zohar Manna and Amir Pnueli",
title = "Verification of concurrent programs, {Part I}: The
temporal framework",
type = "Technical Report",
number = "STAN-CS-81-836",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 62",
month = jun,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-836.html",
abstract = "This is the first in a series of reports describing
the application of temporal logic to the specification
and verification of concurrent programs. We first
introduce temporal logic as a tool for reasoning about
sequences of states. Models of concurrent programs
based both on transition graphs and on linear-text
representations are presented and the notions of
concurrent and fair executions are defined. The general
temporal language is then specialized to reason about
those execution sequences that are fair computations of
a concurrent program. Subsequently, the language is
used to describe properties of concurrent programs. The
set of interesting properties is classified into
invariance (safety), eventuality (liveness), and
precedence (until) properties. Among the properties
studied are: partial correctness, global invariance,
clean behavior, mutual exclusion, absence of deadlock,
termination, total correctness, intermittent
assertions, accessibility, responsiveness, safe
liveness, absence of unsolicited response, fair
responsiveness, and precedence. In the following
reports of this series, we will use the temporal
formalism to develop proof methodologies for proving
the properties discussed here.",
acknowledgement = ack-nhfb,
pdfpages = "65",
xxnumber = "CS-TR-81-836",
}
@TechReport{Buchanan:1981:RES,
author = "Bruce G. Buchanan",
title = "Research on Expert Systems",
type = "Technical Report",
number = "STAN-CS-81-837",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 38",
month = mar,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-837.html",
abstract = "All AI programs are essentially reasoning programs.
And, to the extent that they reason well about a
problem area, all exhibit some expertise at problem
solving. Programs that solve the Tower of Hanoi puzzle,
for example, reason about the goal state and the
initial state in order to find ``expert-level''
solutions. Unlike other programs, however, the claims
about expert systems are related to questions of
usefulness and understandability as well as
performance.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-81-837",
}
@TechReport{Brown:1981:DPB,
author = "Peter Brown",
title = "Dynamic Program Building",
type = "Technical Report",
number = "STAN-CS-81-838",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = feb,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-838.html",
abstract = "This report argues that programs are better regarded
as dynamic running objects rather than as static
textual ones. The concept of dynamic building, whereby
a program is constructed as it runs, is described. The
report then describes the Build system, which is an
implementation of dynamic building for an interactive
algebraic programming language. Dynamic building aids
the locating of run-time errors, and is especially
valuable in environments where programs are relatively
short but run-time errors are frequent and/or costly.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-838",
}
@TechReport{Samuel:1981:SW,
author = "Arthur L. Samuel",
title = "Short {WAITS}",
type = "Technical Report",
number = "STAN-CS-81-839",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ix + 33",
month = feb,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/81/839/CS-TR-81-839.pdf;
http://www-db.stanford.edu/TR/CS-TR-81-839.html",
abstract = "This is an introductory manual describing the SU-AI
timesharing system that is available primarily for
sponsored research in the Computer Science Department.
The present manual is written for the beginner and the
user interested primarily in the message handling
capability as well as for the experienced computer user
and programmer who either is unfamiliar with the SU-AI
computer or who uses it infrequently. References are
made to the available hard-copy manuals and to the
extensive on-line document files where more complete
information can be obtained. The principal advantages
of this system are: (1) The availability of a large
repertoire of useful system features; (2) The large
memory; (3) The large file storage system; (4) The ease
with which one can access other computers via the ARPA
net; (5) The file transfer facilities via the EFTP
program and the ETHERNET; (6) The XGP and the DOVER
printers and the large collections of fonts available
for them; and (7) The fast and convenient E editor with
its macro facilities.",
acknowledgement = ack-nhfb,
author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
xxnumber = "CS-TR-81-839",
}
@TechReport{Knuth:1981:VLL,
author = "Donald E. Knuth",
title = "Verification of Link-Level Protocols",
type = "Technical Report",
number = "STAN-CS-81-840",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 6",
month = jan,
year = "1981",
DOI = "https://doi.org/10.1007/BF01934068",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/pdfs/ADA099140.pdf",
abstract = "Stein Krogdahl [1] has given an interesting
demonstration of the partial correctness of a protocol
skeleton, by which the validity of the essential
aspects of a large variety of data transmission schemes
can be demonstrated. The purpose of this note is to
present a simpler way to obtain the same results, by
first establishing the validity of a less efficient
skeleton and then optimizing the algorithms. The
present approach, which was introduced for a particular
protocol by N. V. Stenning [2], also solves a wider
class of problems that do not require
first-in-first-out transmissions",
acknowledgement = ack-nhfb,
pdfpages = "9",
remark-1 = "Published in \booktitle{BIT} {\bf 21}(1) 31--36, March
1981. doi:10.1007/BF01934068",
remark-2 = "The PDF file is OCR'ed scans of microfiche page
images.",
}
@TechReport{Knuth:1981:HAA,
author = "Donald E. Knuth",
title = "{Huffman}'s Algorithm via Algebra",
type = "Technical Report",
number = "STAN-CS-81-841",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = mar,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1981:TVCb,
author = "Zohar Manna and Amir Pnueli",
title = "Temporal Verification of Concurrent Programs, {Part
II}: Proving Invariances",
type = "Technical Report",
number = "STAN-CS-81-843",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = mar,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Anonymous:1981:NPa,
author = "Anonymous",
title = "{NEVER PRINTED}",
type = "Technical Report",
number = "STAN-CS-81-844",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "???",
year = "1981",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Anonymous:1981:NPb,
author = "Anonymous",
title = "{NEVER PRINTED}",
type = "Technical Report",
number = "STAN-CS-81-845",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "???",
year = "1981",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dolev:1981:BGS,
author = "Danny Dolev",
title = "The {Byzantine Generals} Strike Again",
type = "Technical Report",
number = "STAN-CS-81-846",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = mar,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-846.html",
abstract = "Can unanimity be achieved in an unreliable distributed
system? This problem was named ``The Byzantine Generals
Problem,'' by Lamport, Pease and Shostak [1980]. The
results obtained in the present paper prove that
unanimity is achievable in any distributed system if
and only if the number of faulty processors in the
system is: (1) less than one third of the total number
of processors; and (2) less than one half of the
connectivity of the system's network. In cases where
unanimity is achievable, algorithms to obtain it are
given. This result forms a complete characterization of
networks in light of the Byzantine Problem.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-846",
}
@TechReport{Korth:1981:OLP,
author = "Henry F. Korth",
title = "The optimal locking problem in a directed acyclic
graph",
type = "Technical Report",
number = "STAN-CS-81-847",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = mar,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-847.html",
abstract = "We assume a multiple granularity database locking
scheme similar to that of Gray, et al. [197S] in which
a rooted directed acyclic graph is used to represent
the levels of granularity. We prove that even if it is
known in advance exactly what database references the
transaction will make, it is NP-complete to find the
optimal locking strategy for the transaction.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-847",
}
@TechReport{Tang:1981:PIC,
author = "Chih-sung Tang",
title = "On the Problem of Inputting {Chinese} Characters",
type = "Technical Report",
number = "STAN-CS-81-848",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = apr,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-848.html",
abstract = "If Chinese-speaking society is to make the best use of
computers, it is important to develop an easy, quick,
and convenient way to input Chinese characters together
with other conventional characters. Many people have
tried to approach this problem by designing special
typewriters for Chinese character input, but such
methods have serious deficiencies and they do not take
advantage of the fact that the input process is just
part of a larger system in which a powerful computer
lies behind the keyboard. The purpose of this note is
to clarify the problem and to illustrate a promising
solution based entirely on a standard ASCII keyboard.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-848",
}
@TechReport{Nishigaki:1981:EKC,
author = "Tohru Nishigaki",
title = "Experiments on the {Knee Criterion} in a
multiprogrammed computer system",
type = "Technical Report",
number = "STAN-CS-81-849 (CSL 81-205)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = mar,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-849.html",
abstract = "Although the effectiveness of the Knee Criterion as a
virtual memory management strategy is widely accepted,
it has been impossible to take advantage of it in a
practical system, because little information is
available about the program behavior of executing jobs.
A new memory management technique to achieve the Knee
Criterion in a multiprogrammed virtual memory system is
developed. The technique, termed the Optimum
Working-set Estimator (OWE), abstracts the programs'
behavior from their past histories by exponential
smoothing, and modifies their working set window sizes
in order to attain the Knee Criterion. The OWE method
was implemented and investigated. Measurements
demonstrate its ability to control a variety of jobs.
Furthermore, the results also reveal that the
throughput improvement is possible in a space-squeezing
environment. This technique is expected to increase the
efficiency of multiprogrammed virtual memory systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-849",
}
@TechReport{Wiederhold:1981:BIP,
author = "Gio Wiederhold",
title = "Binding in Information Processing",
type = "Technical Report",
number = "STAN-CS-81-851",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = may,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-851.html",
abstract = "The concept of binding, as used in programming
systems, is analyzed and defined in a number of
contexts. The attributes of variables to be bound and
the phases of binding are enumerated. The definition is
then broadened to cover general issues in information
systems. Its applicability is demonstrated in a wide
range of system design and implementation issues. A
number of Database Management Systems are categorized
according to the terms defined. A first-order
quantitative model is developed and compared with
current practice. The concepts and the model are
considered helpful when used as a tool for the global
design phase of large information systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-851",
}
@TechReport{Ullman:1981:VDR,
author = "Jeffrey D. Ullman",
title = "A View of Directions in Relational Database Theory",
type = "Technical Report",
number = "STAN-CS-81-852",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = may,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Maier:1981:CAH,
author = "David Maier and Jeffrey D. Ullman",
title = "Connections in Acyclic Hypergraphs",
type = "Technical Report",
number = "STAN-CS-81-853",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = may,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dolev:1981:SPK,
author = "Danny Dolev and Andrew C. Yao",
title = "On the Security of Public Key Protocols",
type = "Technical Report",
number = "STAN-CS-81-854",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = may,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-854.html",
abstract = "Recently, the use of public key encryption to provide
secure network communication has received considerable
attention. Such public key systems are usually
effective against passive eavesdroppers, who merely tap
the lines and try to decipher the message. It has been
pointed out, however, that an improperly designed
protocol could be vulnerable to an active saboteur, one
who may impersonate another user or alter the message
being transmitted. In this paper we formulate several
models in which the security of protocols can be
discussed precisely. Algorithms and characterizations
that can be used to determine protocol security in
these models will be given.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-854",
}
@TechReport{Manna:1981:DSU,
author = "Zohar Manna and Richard Waldinger",
title = "Deductive Synthesis of the Unification Algorithm",
type = "Technical Report",
number = "STAN-CS-81-855",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gabriel:1981:OPF,
author = "Richard Paul Gabriel",
title = "An Organization for Programs in Fluid Domains",
type = "Technical Report",
number = "STAN-CS-81-856",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "190",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{King:1981:QOS,
author = "Jonathan Jay King",
title = "Query Optimization by Semantic Reasoning",
type = "Technical Report",
number = "STAN-CS-81-857",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "128",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pan:1981:BOC,
author = "Pan and V. Y.",
title = "The Bit Operation Complexity of Approximate Evaluation
of Matrix and Polynomial Products Using Arithmetic",
type = "Technical Report",
number = "STAN-CS-81-858",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pan:1981:ALC,
author = "V. Y. Pan",
title = "The Additive and Logical Complexities of Linear and
Bilinear Arithmetic Algorithms",
type = "Technical Report",
number = "STAN-CS-81-859",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Boley:1981:CCO,
author = "Daniel Boley",
title = "Computing the Controllability\slash Observability
Decomposition of a Linear Time-Invariant Dynamic
System: a Numerical Approach",
type = "Technical Report",
number = "STAN-CS-81-860",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "81",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Brooks:1981:SRA,
author = "Rodney A. Brooks",
title = "Symbolic Reasoning Among {3-D} Models and {2-D}
Images",
type = "Technical Report",
number = "STAN-CS-81-861",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "181",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pan:1981:LBA,
author = "V. Y. Pan",
title = "The Lower Bounds on the Additive Complexity of
Bilinear Problems in Terms of Some Algebraic
Quantities",
type = "Technical Report",
number = "STAN-CS-81-862",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1981:PPS,
author = "Donald E. Knuth and Allan A. Miller",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-81-863",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "84",
day = "1",
month = jun,
year = "1981",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-863.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-81-863",
abstract = "This report contains a record of the autumn 1980
session of CS 204, a problem-solving and programming
seminar taught at Stanford that is primarily intended
for first-year Ph.D. students. The seminar covers a
large range of topics, research paradigms, and
programming paradigms in computer science, so these
notes will be of interest to graduate students,
professors, and professional computer scientists.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-81-863",
xxnumber = "CS-TR-81-863",
}
@TechReport{Doyle:1981:TSE,
author = "Jon Doyle",
title = "Three Short Essays on Decisions, Reasons, and Logics",
type = "Technical Report",
number = "STAN-CS-81-864",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tang:1981:TUL,
author = "Chih-sung Tang",
title = "Toward a unified logical basis for programming
languages",
type = "Technical Report",
number = "STAN-CS-81-865",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = jun,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-865.html",
abstract = "In recent years, more and more computer scientists
have been paying attention to temporal logic, since
there are many properties of programs that can be
described only by bringing the time parameter into
consideration. But existing temporal logic languages,
such as Lucid, in spite of their mathematical elegance,
are still far from practical. I believe that a
practical temporal-logic language, once it came into
being, would have a wide spectrum of applications. XYZ
/E is a temporal-logic language. Like other logic
languages, it is a logic system as well as a
programming language. But unlike them, it can express
all conventional data structures and control
structures, nondeterminate or concurrent programs, even
programs with branching-time order. We find that the
difficulties met in other logic languages often stem
from the fact that they try to deal with these
structures in a higher level. XYZ /E adopts another
approach. We divide the language into two forms: the
internal form and the external form. The former is
lower level, while the latter is higher. Just as any
logic system contains rules of abbreviation, so also in
XYZ /E there are rules of abbreviation to transform the
internal form into the external form, and vice versa.
These two forms can be considered to be different
representations of the same thing. We find that this
approach can ameliorate many problems of
formalization.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-865",
}
@TechReport{German:1981:VAC,
author = "Steven M. German",
title = "Verifying the Absence of Common Runtime Errors in
Computer Programs",
type = "Technical Report",
number = "STAN-CS-81-866 (CSL 81-208)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "179",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Luckham:1981:AAB,
author = "David C. Luckham and Howard J. Larsen and David R.
Stevenson and Friedrich W. von Henke",
title = "{ADAM} --- an {Ada} based language for
multi-processing",
type = "Technical Report",
number = "STAN-CS-81-867",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 71",
month = jul,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/adabooks.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-867.html",
abstract = "Adam is an experimental language derived from Ada. It
was developed to facilitate study of issues in Ada
implementation. The two primary objectives which
motivated the development of Adam were: to program
supervisory packages for multitask scheduling, and to
formulate algorithms for compilation of Ada tasking.
Adam is a subset of the sequential program constructs
of Ada combined with a set of parallel processing
constructs which are lower level than Ada tasking. In
addition, Adam places strong restrictions on sharing of
global objects between processes. Import declarations
and propagate declarations are included. A compiler has
been implemented in Maclisp on a DEC PDP-10. It
produces assembly code for a PDP-10. It supports
separate compilation, generics, exceptions, and
parallel processes. Algorithms translating Ada tasking
into Adam parallel processing have been developed and
implemented. An experimental compiler for most of the
final Ada language design, including task types and
task rendezvous constructs, based on the Adam compiler,
is presently available on PDP-10's. This compiler uses
a procedure call implementation of task rendezvous, but
will be used to develop and study alternate
implementations.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-81-867",
}
@TechReport{Knuth:1981:LWE,
author = "Donald E. Knuth",
title = "The Last Whole Errata Catalog",
type = "Technical Report",
number = "STAN-CS-81-868",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
day = "1",
month = jul,
year = "1981",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-868.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-81-868",
abstract = "This list supplements previous errata published in
Stanford reports CS551 (1976) and CS712 (1979). It
includes the first corrections and changes to the
second edition of volume two (published January, 1981)
as well as to the most recent printings of volumes one
and three (first published in 1975). In addition to the
errors listed here, about half of the occurrences of
'which' in volumes one and three should be changed to
'that'.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-81-868",
xxnumber = "CS-TR-81-868",
}
@TechReport{Tajnai:1981:CSC,
author = "Carolyn E. Tajnai",
title = "{Computer Science} comprehensive examinations,
1978\slash 79--1980\slash 81",
type = "Technical Report",
number = "STAN-CS-81-869",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xvi + 216",
month = aug,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-869.html",
abstract = "The Stanford Computer Science Comprehensive
Examination was conceived Spring Quarter 1971/72 and
since then has been given winter and spring quarters
each year. The 'Comp' serves several purposes in the
department. There are no course requirements in the
Ph.D. and the Ph.D. Minor programs, and only one
(CS293, Computer Laboratory) in the Master's program.
Therefore, the 'Comp' fulfills the breadth and depth
requirements. The Ph.D. Minor and Master's student must
pass at the Master's level to be eligible for the
degree. For the Ph.D. student it serves as a ``Rite of
Passage''; the exam must be passed at the Ph.D. level
by the end of six quarters of full-time study
(excluding summers) for the student to continue in the
program.\par
This report is a collection of comprehensive
examinations from Winter Quarter 1978/79 through Spring
Quarter 1980/81.",
acknowledgement = ack-nhfb,
pdfpages = "232",
xxnumber = "CS-TR-81-869",
}
@TechReport{Plass:1981:OPT,
author = "Michael F. Plass",
title = "Optimal Pagination Techniques for Automatic
Typesetting Systems",
type = "Technical Report",
number = "STAN-CS-81-870",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "77",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Trickey:1981:GLP,
author = "Howard W. Trickey",
title = "Good Layouts for Pattern Recognizers",
type = "Technical Report",
number = "STAN-CS-81-871",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 14",
month = aug,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/81/871/CS-TR-81-871.pdf;
http://www-db.stanford.edu/TR/CS-TR-81-871.html",
abstract = "A system to lay out custom circuits that recognize
regular languages can be a useful VLSI design
automation tool. This paper describes the algorithms
used in an implementation of a regular expression
compiler. Layouts that use a network of programmable
logic arrays (PLA's) have smaller areas than those of
some other methods, but there are the problems of
partitioning the circuit and then placing the
individual PLA's. Regular expressions have a structure
which allows a novel solution to these problems:
dynamic programming can be used to find layouts which
are in some sense optimal. Various search pruning
heuristics have been used to increase the speed of the
compiler, and the experience with these is reported in
the conclusions.",
acknowledgement = ack-nhfb,
keywords = "control logic design; dynamic programming;
partitioning; programmable logic arrays; regular
expressions; silicon compilers; string pattern
recognition; VLSI layout",
pdfpages = "18",
xxnumber = "CS-TR-81-871",
}
@TechReport{Manna:1981:SCP,
author = "Zohar Manna and Pierre Wolper",
title = "Synthesis of Communicating Processes from Temporal
Logic Specifications",
type = "Technical Report",
number = "STAN-CS-81-872",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = sep,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Carr:1981:VMM,
author = "Richard William Carr",
title = "Virtual Memory Management",
type = "Technical Report",
number = "STAN-CS-81-873",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "238",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Spector:1981:MAL,
author = "Alfred Z. Spector",
title = "Multiprocessing Architectures for Local Computer
Networks",
type = "Technical Report",
number = "STAN-CS-81-874",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "125",
month = aug,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hu:1981:CMC,
author = "T. C. Hu and M. T. Shing",
title = "Computation of matrix chain products: {Part I}, Part
{II}",
type = "Technical Report",
number = "STAN-CS-81-875",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "124",
month = sep,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-875.html",
abstract = "This paper considers the computation of matrix chain
products of the form $ M_1 x M_2 x \ldots {} x M_{n -
1} $. If the matrices are of different dimensions, the
order in which the product is computed affects the
number of operations. An optimum order is an order
which minimizes the total number of operations. Some
theorems about an optimum order of computing the
matrices are presented in part I. Based on these
theorems, an $ O(n \log n) $ algorithm for finding an
optimum order is presented in part II.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-875",
}
@TechReport{Dolev:1981:LAE,
author = "Danny Dolev and Howard W. Trickey",
title = "On Linear Area Embedding of Planar Graphs",
type = "Technical Report",
number = "STAN-CS-81-876",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 21",
month = sep,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "ehttp://www-db.stanford.edu/TR/CS-TR-81-876.html;
http://i.stanford.edu/pub/cstr/reports/cs/tr/81/876/CS-TR-81-876.pdf",
abstract = "Planar embedding with minimal area of graphs on an
integer grid is one of the major issues in VLSI.
Valiant [1981] gave an algorithm to construct a planar
embedding for trees in linear area; he also proved that
there are planar graphs that require quadratic
area.\par
We give an algorithm to embed outerplanar graphs in
linear area. We extend this algorithm to work for every
planar graph that has the following property: for every
vertex there exists a path of length less than K to the
exterior face, where K is a constant.\par
Finally, finding a minimal embedding area is shown to
be NP-complete for forests, and hence for more general
types of graphs.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-81-876",
}
@TechReport{Manna:1981:VSP,
author = "Zohar Manna",
title = "Verification of Sequential Programs: Temporal
Axiomatization",
type = "Technical Report",
number = "STAN-CS-81-877",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = sep,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Maier:1981:MOS,
author = "David Maier and Jeffrey D. Ullman",
title = "Maximal Objects and the Semantics of Universal
Relation Databases",
type = "Technical Report",
number = "STAN-CS-81-878",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = oct,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Masinter:1981:IVR,
author = "Larry M. Masinter",
title = "{Interlisp-VAX}: a Report",
type = "Technical Report",
number = "STAN-CS-81-879",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = aug,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-879.html",
abstract = "This report documents the results of a study to
evaluate the feasibility of implementing the Interlisp
language to run on the DEC VAX computer. Specific goals
of the study were to: (1) assess the technical status
of the on-going implementation project at USC-ISI; (2)
estimate the expected performance of Interlisp on the
VAX family of machines as compared to Interlisp-10,
other Lisp systems for the VAX, and other Interlisp
implementations where performance data were available;
and (3) identify serious obstacles and alternatives to
the timely completion of an effective Interlisp-VAX
system.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-81-879",
}
@TechReport{Mayr:1981:WSP,
author = "Ernst W. Mayr",
title = "Well structured parallel programs are not easier to
schedule",
type = "Technical Report",
number = "STAN-CS-81-880",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 16",
month = sep,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-880.html",
abstract = "The scheduling problem for unit time task systems with
arbitrary precedence constraints is known to be
NP-complete. We show that the same is true even if the
precedence constraints are restricted to certain
subclasses which make the corresponding parallel
programs more structured. Among these classes are those
derived from hierarchic cobegin--coend programming
constructs, level graph forests, and the parallel or
serial composition of an out-tree and an in-tree. In
each case, the completeness proof depends heavily on
the number of processors being part of the problem
instances.",
acknowledgement = ack-nhfb,
pdfpages = "17",
xxnumber = "CS-TR-81-880",
}
@TechReport{Ullman:1981:URS,
author = "Jeffrey D. Ullman",
title = "The {U.R.} Strikes Back",
type = "Technical Report",
number = "STAN-CS-81-881",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = oct,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pan:1981:FMM,
author = "V. Pan",
title = "Fast Matrix Multiplication Without {APP} Algorithms",
type = "Technical Report",
number = "STAN-CS-81-882",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = oct,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pepper:1981:PTA,
author = "P. Pepper",
title = "On program transformations for abstract data types and
concurrency",
type = "Technical Report",
number = "STAN-CS-81-883",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = oct,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-883.html",
abstract = "We study transformation rules for a particular class
of abstract data types, namely types that are
representable by recursive mode declarations. The
transformations are tailored to the development of
efficient tree traversal and they allow for
concurrency. The techniques are exemplified by an
implementation of concurrent insertion and deletion in
2-3-trees.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-883",
}
@TechReport{Ceri:1981:ODD,
author = "Stefano Ceri and Shamkant Navathe and Gio Wiederhold",
title = "Optimal Design of Distributed Databases",
type = "Technical Report",
number = "STAN-CS-81-884",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{vanMelle:1981:EM,
author = "William James van Melle and A. C. Scott and J. S.
Bennett and M. Peairs",
title = "The {EMYCIN} Manual",
type = "Technical Report",
number = "STAN-CS-81-885 (HPP-81-16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 138",
month = oct,
year = "1981",
LCCN = "QA76.76.E95 E49 1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "This manual describes a domain-independent system,
called EMYCIN, for constructing one class of expert
computer programs: rule-based consultants. The
resulting programs use knowledge specific to a problem
domain to provide consultative advice to a client. The
system-building tool, EMYCIN, is based on the
domain-independent core of the MYCIN program. Domain
knowledge is represented in EMYCIN systems primarily as
production rules, which are applied by a goal-directed
backward-chaining control structure. Rules and
consultation data may have associated measures of
certainty, and incomplete data entry is allowed. The
system includes an explanation facility that can
display the line of reasoning followed by the
consultation program, and answer questions from the
client about the contents of its knowledge base.",
acknowledgement = ack-nhfb,
subject = "EMYCIN (Computer system); Handbooks, manuals, etc;
Expert systems (Computer science); Syst{\`e}mes experts
(Informatique); Guides, manuels, etc; Expert systems
(Computer science)",
}
@TechReport{Knuth:1981:CMF,
author = "Donald E. Knuth",
title = "The Concept of a {Meta-Font}",
type = "Technical Report",
number = "STAN-CS-81-886",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = oct,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://s3-us-west-2.amazonaws.com/visiblelanguage/pdf/V16N1_1982_E.pdf",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Visible Language}, {\bf
XVI}(1), 3--27, Winter 1982",
}
@TechReport{Graham:1981:FCH,
author = "Ronald L. Graham and Frances Yao",
title = "Finding the Convex Hull of a Simple Polygon",
type = "Technical Report",
number = "STAN-CS-81-887",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = nov,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-887.html",
abstract = "It is well known that the convex hull of a set of n
points in the (Euclidean) plane can be found by an
algorithm having worst-case complexity $ O(n \log n) $.
In this note we give a short linear algorithm for
finding the convex hull in the case that the (ordered)
set of points from the vertices of a simple (i.e.,
non-self-intersecting) polygon.",
acknowledgement = ack-nhfb,
author-dates = "Ronald Lewis Graham (31 October 1935--6 July 2020)",
xxnumber = "CS-TR-81-887",
}
@TechReport{Gropp:1981:NST,
author = "William D. Gropp",
title = "Numerical Solution of Transport Equations",
type = "Technical Report",
number = "STAN-CS-81-888",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "108",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mujtaba:1981:AUM,
author = "Shahid Mujtaba and Ron Goldman",
title = "{AL} users' manual",
type = "Technical Report",
number = "STAN-CS-81-889",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
month = dec,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-889.html",
abstract = "AL is a high-level programming language for
manipulator control useful in industrial assembly
research. This document describes the current state of
the AL system now in operation at the Stanford
Artificial Intelligence Laboratory, and teaches the
reader how to use it. The system consists of the AL
compiler and runtime system and the source code
interpreter, POINTY, which facilitates specifying
representation of parts, and interactive execution of
AL statements.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-81-889",
}
@TechReport{Higdon:1981:BCH,
author = "Robert L. Higdon",
title = "Boundary Conditions for Hyperbolic Systems of Partial
Differential Equations Having Multiple Time Scales",
type = "Technical Report",
number = "STAN-CS-81-890",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "136",
month = aug,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Dietterich:1981:RCL,
author = "T. G. Dietterich and B. G. Buchanan",
title = "The Role of the Critic in Learning Systems",
type = "Technical Report",
number = "STAN-CS-81-891 (CSL 81-222)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1981:MBI,
author = "William J. Clancey",
title = "Methodology for Building an Intelligent Tutoring
System",
type = "Technical Report",
number = "STAN-CS-81-894 (HPP-81-18)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "55",
month = oct,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-894.html",
abstract = "Over the past 6 years we have been developing a
computer program to teach medical diagnosis. Our
research synthesizes and extends results in artificial
intelligence (Al), medicine, and cognitive psychology.
This paper describes the progression of the research,
and explains how theories from these fields are
combined in a computational model. The general problem
has been to develop an ``intelligent tutoring system''
by adapting the MYCIN ``expert system.'' Thls
conversion requires a deeper understanding of the
nature of expertise and explanation than originally
required for developing MYCIN, and a concomitant shift
in perspective from simple performance goals to
attaining psychological validity in the program's
reasoning process. Others have written extensively
about the relation of artificial intelligence to
cognitive science (e.g., [Pylyshyn, 1978] [Boden,
1977]). Our purpose here is not to repeat those
arguments, but to present a case study which will
provide a common point for further discussion. To this
end, to help evaluate the state of cognitive science,
we will outline our methodology and survey what
resources and viewpoints have helped our research. We
will also discuss pitfalls that other Al-oriented
cognitive scientists may encounter. Finally, we will
present some questions coming out of our work which
might suggest possible collaboration with other fields
of research.",
acknowledgement = ack-nhfb,
pdfpages = "62",
xxnumber = "CS-TR-81-894",
}
@TechReport{Clancey:1981:ERB,
author = "William J. Clancey",
title = "The Epistemology of a Rule-Based Expert System: a
Framework for Explanation",
type = "Technical Report",
number = "STAN-CS-81-896 (HPP-81-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 60",
month = nov,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-896.html",
abstract = "Production rules are a popular representation for
encoding heuristic knowledge in programs for scientific
and medical problem solving. However, experience with
one of these programs, MYCIN, indicates that the
representation has serious limitations: people other
than the original rule authors find it difficult to
modify the rule set, and the rules are unsuitable for
use in other settings, such as for application to
teaching. These problems are rooted in fundamental
limitations in MYCIN's original rule representation:
the view that expert knowledge can be encoded as a
uniform, weakly-structured set of if/then associations
is found to be wanting. To illustrate these problems,
this paper examines MYCIN's rules from the perspective
of a teacher trying to justify them and to convey a
problem-solving approach. We discover that individual
rules play different roles, have different kinds of
justifications, and are constructed using different
rationales for the ordering and choice of premise
clauses. This design knowledge, consisting of
structural and strategic concepts which lie outside the
representation, is shown to be procedurally embedded in
the rules. Moreover, because the data/hypothesis
associations are themselves a proceduralized form of
underlying disease models, they can only be supported
by appealing to this deeper level of knowledge. Making
explicit this structural, strategic and support
knowledge enhances the ability to understand and modify
the system.",
acknowledgement = ack-nhfb,
pdfpages = "68",
xxnumber = "CS-TR-81-896",
}
@TechReport{Whang:1981:SPD,
author = "Kyu-Young Whang and Gio Wiederhold and Daniel
Sagalowicz",
title = "Separability as a Physical Database Design
Methodology",
type = "Technical Report",
number = "STAN-CS-81-898 (CSL-TR-222)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 60",
month = oct,
year = "1981",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-81-898.html",
abstract = "A theoretical approach to the optimal design of large
multifile physical databases is presented. The design
algorithm is based on the theory that, given a set of
join methods that satisfy a certain property called
``separability,'' the problem of optimal assignment of
access structures to the whole database can be reduced
to the subproblem of optimizing individual relations
independently of one another. Coupling factors are
defined to represent all the interactions among the
relations. This approach not only reduces the
complexity of the problem significantly, but also
provides a better understanding of underlying
mechanisms. A closed noniterative formula is introduced
for estimating the number of block accesses in a
database organization, and the error analyzed. This
formula, an approximation of Yao's exact formula, has a
maximum error of 3.7\%, and significantly reduces the
computation time by eliminating the iterative loop. It
also achieves a much higher accuracy than an
approximation proposed by Cardenas.",
acknowledgement = ack-nhfb,
pdfpages = "64",
remark = "Outer cover says October 1981, but inner title page
says 17 January 1982.",
xxnumber = "CS-TR-81-898",
}
@TechReport{Paulson:1981:CGS,
author = "Lawrence Paulson",
title = "A Compiler Generator for Semantic Grammars",
type = "Technical Report",
number = "STAN-CS-82-893",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "166",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Appelt:1981:PNL,
author = "Douglas E. Appelt",
title = "Planning Natural-Language Utterances to Satisfy
Multiple Goals",
type = "Technical Report",
number = "STAN-CS-82-918",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "188",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Roberts:1981:ETE,
author = "Teresa L. Roberts",
title = "Evaluation of Text Editors",
type = "Technical Report",
number = "STAN-CS-82-920",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "188",
month = dec,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Woods:1981:DPG,
author = "Donald R. Woods",
title = "Drawing Planar Graphs",
type = "Technical Report",
number = "STAN-CS-82-943",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "58",
month = jun,
year = "1981",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Anonymous:1989:NP,
author = "Anonymous",
title = "{NEVER PRINTED}",
type = "Technical Report",
number = "STAN-CS-89-1298",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "???",
year = "1981",
bibdate = "Wed Nov 26 08:55:07 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kuper:1982:ARA,
author = "Gabriel M. Kuper",
title = "An Algorithm for Reducing Acyclic Hypergraphs",
type = "Technical Report",
number = "STAN-CS-82-892",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = jan,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-892.html",
abstract = "This report is a description of an algorithm to
compute efficiently the Graham reduction of an acyclic
hypergraph with sacred nodes. To apply the algorithm we
must already have a tree representation of the
hypergraphs, and therefore it is useful when we have a
fixed hypergraph and wish to compute Graham reductions
many times, as we do in the System/U query
interpretation algorithm.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-892",
}
@TechReport{Novak:1982:GUM,
author = "Gordon S. {Novak, Jr.}",
title = "{GLISP} users' manual",
type = "Technical Report",
number = "STAN-CS-82-895 (HPP-82-1)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = jan,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-895.html",
abstract = "GLISP is a high-level, LISP-based language which is
compiled into LISP. GLISP provides a powerful abstract
datatype facility, allowing description and use of both
LISP objects and objects in A.I. representation
languages. GLISP language features include PASCAL-like
control structures, infix expressions with operators
which facilitate list manipulation, and reference to
objects in PASCAL-like or English-like syntax.
English-like definite reference to features of objects
which are in the current computational context is
allowed; definite references are understood and
compiled relative to a knowledge base of object
descriptions. Object-centered programming is supported;
GLISP can substantially improve runtime performance of
object-centered programs by optimized compilation of
references to objects. This manual describes the GLISP
language and use of GLISP within INTERLISP.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-895",
}
@TechReport{Goad:1982:ACS,
author = "Christopher Goad",
title = "Automatic Construction of Special Purpose Programs",
type = "Technical Report",
number = "STAN-CS-82-897",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = jan,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bolstad:1982:AFD,
author = "John H. Bolstad",
title = "An Adaptive Finite Difference Method for Hyperbolic
Systems in One Space Dimension",
type = "Technical Report",
number = "STAN-CS-82-899",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "175",
month = feb,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Blum:1982:DRC,
author = "Robert L. Blum",
title = "Discovery and Representation of Causal Relationships
from a Large Time-Oriented Clinical Database: The {RX
Project}",
type = "Technical Report",
number = "STAN-CS-82-900",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "264",
month = jan,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Fuchs:1982:OFC,
author = "David R. Fuchs and Donald E. Knuth",
title = "Optimal Font Caching",
type = "Technical Report",
number = "STAN-CS-82-901",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 19",
month = mar,
year = "1982",
DOI = "https://doi.org/10.1145/2363.2367",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA119439.pdf;
https://dl.acm.org/doi/pdf/10.1145/2363.2367",
abstract = "An efficient algorithm is presented for communicating
letter-shape information from a high-speed computer
with a large memory to a typesetting device that has a
limited memory. The encoding is optimum, in the sense
that the total time for typesetting is minimized, using
a model that generalizes well-known ``demand paging''
strategies to the case where changes to the cache are
allowed before the associated information is actually
needed. Extensive empirical data shows that good
results are obtained even when difficult technical
material is being typeset on a machine that can store
information concerning only 100 characters. The methods
of this paper are also applicable to other hardware and
software caching applications with restricted
lookahead.",
acknowledgement = ack-nhfb,
keywords = "Cache memory; data reduction; data structures;
lookahead; optimum allocation; prepaging; typesetting",
pdfpages = "21",
remark = "The PDF file is OCR'ed scans of microfiche page
images. Published as ``Optimal Prepaging and Font
Caching'', ACM Transactions on Programming Languages
and Systems, {\bf 7}(1) 67--79, January 1985, at DOI
recorded above",
}
@TechReport{Manna:1982:SRP,
author = "Zohar Manna and Richard Waldinger",
title = "Special Relations in Program-Synthetic Deduction",
type = "Technical Report",
number = "STAN-CS-82-902",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "75",
month = mar,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{McCarthy:1982:CMK,
author = "John McCarthy",
title = "Coloring Maps and the {Kowalski Doctrine}",
type = "Technical Report",
number = "STAN-CS-82-903",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = apr,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-903.html",
abstract = "It is attractive to regard an algorithm as composed of
the logic determining what the results are and the
control determining how the result is obtained. Logic
programmers like to regard programming as controlled
deduction, and there have been several proposals for
controlling the deduction expressed by a Prolog program
and not always using Prolog's normal backtracking
algorithm. The present note discusses a map coloring
program proposed by Pereira and Porto and two coloring
algorithms that can be regarded as control applied to
its logic. However, the control mechanisms required go
far beyond those that have been contemplated in the
Prolog literature.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-82-903",
}
@TechReport{LeVeque:1982:TSM,
author = "Randall John LeVeque",
title = "Time-Split Methods for Partial Differential
Equations",
type = "Technical Report",
number = "STAN-CS-82-904",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "102",
month = apr,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Trefethen:1982:WPS,
author = "Lloyd N. Trefethen",
title = "Wave Propagation and Stability for Finite Difference
Schemes",
type = "Technical Report",
number = "STAN-CS-82-905",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "207",
month = apr,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nash:1982:TNM,
author = "Stephen G. Nash",
title = "Truncated-{Newton} Methods",
type = "Technical Report",
number = "STAN-CS-82-906",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = may,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mayr:1982:CA,
author = "Ernst W. Mayr",
title = "Combinatorial Algorithms {I}",
type = "Technical Report",
number = "STAN-CS-82-907",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "83",
month = may,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1982:NRR,
author = "William J. Clancey and Reed Letsinger",
title = "Neomycin: Reconfiguring a Rule-Based Expert System for
Application to Teaching",
type = "Technical Report",
number = "STAN-CS-82-908 (HPP-81-2)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-908.html",
abstract = "NEOMYClN is a medical consultation system in which
MYClN's knowledge base is reorganized and extended for
use in GUIDON, a teaching program. The new system
constitutes a psychological model for doing diagnosis
designed to provide a basis for interpreting student
behavior and teaching diagnostic strategy. The model
separates out kinds of knowledge that are procedurally
embedded in MYClN's rules and so inaccessible to the
teaching program. The key idea is to represent
explicitly and separately a domain-independent
diagnostic strategy in the form of meta-rules,
knowledge about the structure of the problem space,
causal and data/hypothesis rules and world facts. As a
psychological model, NEOMYCIN captures the
forward-directed, ``compiled associations'' mode of
reasoning that characterizes expert behavior.
Collection and interpretation of data are focused by
the ``differential'' or working memory of hypotheses.
Moreover, the knowledge base is broadened so that
GUIDON can teach a student when to consider a specific
infectious disease and what competing hypotheses to
consider, essentially the knowledge a human would need
in order to use the MYCIN consultation system
properly.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-908",
}
@TechReport{London:1982:PRS,
author = "Bob London and William J. Clancey",
title = "Plan recognition strategies in student modeling:
prediction and description",
type = "Technical Report",
number = "STAN-CS-82-909 (HPP-82-7)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-909.html",
abstract = "This paper describes the student modeler of the
GUIDON2 tutor, which understands plans by a dual search
strategy. It first produces multiple predictions of
student behavior by a model-driven simulation of the
expert. Focused, data-driven searches then explain
incongruities. By supplementing each other, these
methods lead to an efficient and robust plan
understander for a complex domain.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-909",
}
@TechReport{Clancey:1982:ETP,
author = "William J. Clancey and Bruce G. Buchanan",
title = "Exploration of Teaching and Problem-Solving
Strategies, 1979--1982",
type = "Technical Report",
number = "STAN-CS-82-910 (HPP-82-8)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-910.html",
abstract = "This is the final report for Contract
N-00014-79-C-0302, covering the period of 15 March 1979
through 14 March 1982. The goal of the project was to
develop methods for representing teaching and
problem-solving knowledge in computer-based tutorial
systems. One focus of the work was formulation of
principles for managing a case method tutorial
dialogue; the other major focus was investigation of
the use of a production rule representation for the
subject material of a tutorial program. The main theme
pursued by this research is that representing teaching
and problem-solving knowledge separately and explicitly
enhances the ability to build, modify and test complex
tutorial programs. Two major computer programs were
constructed. One was the tutorial program, GUIDON,
which uses a set of explicit ``discourse procedures''
for carrying on a case method dialogue with a student.
GUIDON uses the original MYCIN knowledge base as
subject material, and as such, was an experiment in
exploring the ways in which production rules can be
used in tutoring. GUlDON's teaching knowledge is
separate from and compatible with any knowledge base
that is encoded in MYClN's rule language.
Demonstrations of GUIDON were given for two medical and
one engineering application. Thus, the generality of
this kind of system goes beyond being able to teach
about any problem in a ``case library''--it also allows
teaching expertise to be transferred and tested in
multiple problem domains. The second major program is
the consultation program, NEOMYCIN. This is a second
generation system in which MYClN's knowledge has been
reconfigured to make explicit distinctions that are
important for teaching. Unlike MYCIN, the program uses
the hypothesis-oriented approach and predominantly
forward-directed reasoning. As such, NEOMYCIN is
consistent with and extends psychological models of
diagnostic problem-solving. The program differs from
other knowledge-based Al systems in that reasoning is
completely controlled by a set of explicit meta-rules.
These meta-rules are domain independent and constitute
the diagnostic procedure to be taught to students: the
tasks of diagnosis and heuristics for attending to and
confirming relevant diagnostic hypotheses.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-910",
}
@TechReport{Roberts:1982:BSC,
author = "Barbara J. Roberts and Irris Marashian",
title = "Bibliography of {Stanford Computer Science} reports,
1963--1982",
type = "Technical Report",
number = "STAN-CS-82-911",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-911.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
since 1963. Each report is identified by a Computer
Science number, author's name, title, National
Technical Information Service (NTIS) retrieval number
(i.e., AD-XXXXXX), date, and number of pages. If the
NTIS number is not given, it means that the report is
probably not available from NTIS.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-911",
}
@TechReport{Vardi:1982:IFI,
author = "Moshe Y. Vardi",
title = "The Implication and Finite Implication Problems for
Typed Template Dependencies",
type = "Technical Report",
number = "STAN-CS-82-912",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 34",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/912/CS-TR-82-912.pdf;
http://www-db.stanford.edu/TR/CS-TR-82-912.html",
abstract = "The class of typed template dependencies is a class of
data dependencies that includes embedded multivalued
and join dependencies. We show that the implication and
the finite implication problems for this class are
unsolvable. An immediate corollary is that this class
has no formal system for finite implication. We also
show how to construct a finite set of typed template
dependencies whose implication and finite implication
problems are unsolvable. The class of projected join
dependencies is a proper subclass of the above class,
and it generalizes slightly embedded join dependencies.
It is shown that the implication and the finite
implication problems for this class are also
unsolvable. An immediate corollary is that this class
has no universe-bounded formal system for either
implication or finite implication.",
acknowledgement = ack-nhfb,
pdfpages = "38",
remark = "The outside cover has the incorrect spelling Varde,
but the inside title page has the correct Vardi.",
xxnumber = "CS-TR-82-912",
}
@TechReport{Dietterich:1982:LII,
author = "Thomas Dietterich and Bob London and Kenneth Clarkson
and Geoff Dromey",
title = "Learning and Inductive Inference",
type = "Technical Report",
number = "STAN-CS-82-913 (HPP-82-10)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "207",
month = may,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Guoan:1982:USM,
author = "Gu Guoan and John Hobby",
title = "Using String Matching to Compress {Chinese}
Characters",
type = "Technical Report",
number = "STAN-CS-82-914",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 15",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/914/CS-TR-82-914.pdf;
http://www-db.stanford.edu/TR/CS-TR-82-914.html",
abstract = "A new method for font compression is introduced and
compared to existing methods. A very compact
representation is achieved by using a variant of
McCreight's string matching algorithm to compress the
bounding contour. Results from an actual implementation
are given showing the improvement over other methods
and how this varies with resolution and character
complexity. Compression ratios of up to 150 are
achieved for Chinese characters.",
acknowledgement = ack-nhfb,
pdfpages = "18",
xxnumber = "CS-TR-82-914",
}
@TechReport{Manna:1982:VCP,
author = "Zohar Manna and Amir Pnueli",
title = "Verification of concurrent programs: proving
eventualities by well-founded ranking",
type = "Technical Report",
number = "STAN-CS-82-915",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 25",
month = may,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-915.html",
abstract = "In this paper, one of a series on verification of
concurrent programs, we present proof methods for
establishing eventuality and until properties. The
methods are based on well-founded ranking and are
applicable to both ``just'' and ``fair'' computations.
These methods do not assume a decrease of the rank at
each computation step. It is sufficient that there
exists one process which decreases the rank when
activated. Fairness then ensures that the program will
eventually attain its goal.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-82-915",
}
@TechReport{Bent:1982:DWD,
author = "Samuel W. Bent",
title = "Dynamic Weighted Data Structures",
type = "Technical Report",
number = "STAN-CS-82-916",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "80",
month = jun,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Mujtaba:1982:MSM,
author = "Mohamed Shahid Mujtaba",
title = "Motion Sequencing of Manipulators",
type = "Technical Report",
number = "STAN-CS-82-917",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "307",
month = jul,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wall:1982:MBS,
author = "David Wall",
title = "Mechanisms for Broadcast and Selective Broadcast",
type = "Technical Report",
number = "STAN-CS-82-919 (CSL 80-190)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "122",
month = nov,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Salisbury:1982:KFA,
author = "J. Kenneth Salisbury",
title = "Kinematic and Force Analysis of Articulated Hands",
type = "Technical Report",
number = "STAN-CS-82-921",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "106",
month = jul,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Suwa:1982:AVC,
author = "Motoi Suwa and A. Carlisle Scott and Edward H.
Shortliffe",
title = "An approach to verifying completeness and consistency
in a rule-based expert system",
type = "Technical Report",
number = "STAN-CS-82-922 (HPP-81-5)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = jun,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-922.html",
abstract = "We describe a program for verifying that a set of
rules in an expert system comprehensively spans the
knowledge of a specialized domain. The program has been
devised and tested within the context of the ONCOCIN
System, a rule-based consultant for clinical oncology.
The stylized format of ONCOCIN's rules has allowed the
automatic detection of a number of common errors as the
knowledge base has been developed. This capability
suggests a general mechanism for correcting many
problems with knowledge base completeness and
consistency before they can cause performance errors.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-922",
}
@TechReport{Wallis:1982:EPM,
author = "Jerold W. Wallis and Edward H. Shortliffe",
title = "Explanatory power for medical expert systems: studies
in the representation of causal relationships for
clinical consultations",
type = "Technical Report",
number = "STAN-CS-82-923",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = jul,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-923.html",
abstract = "This paper reports on experiments designed to identify
and implement mechanisms for enhancing the explanation
capabilities of reasoning programs for medical
consultation. The goals of an explanation system are
discussed, as is the additional knowledge needed to
meet these goals in a medical domain. We have focussed
on the generation of explanations that are appropriate
for different types of system users. This task requires
a knowledge of what is complex and what is important;
it is further strengthened by a classification of the
associations or causal mechanisms inherent in the
inference rules. A causal representation can also be
used to aid in refining a comprehensive knowledge base
so that the reasoning and explanations are more
adequate. We describe a prototype system which reasons
from causal inference rules and generates explanations
that are appropriate for the user.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-923",
}
@TechReport{Berger:1982:AMR,
author = "Marsha J. Berger",
title = "Adaptive Mesh Refinement for Hyperbolic Partial
Differential Equations",
type = "Technical Report",
number = "STAN-CS-82-924",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "123",
month = aug,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wolper:1982:SCP,
author = "Pierre L. Wolper",
title = "Synthesis of Communicating Processes from Temporal
Logic Specifications",
type = "Technical Report",
number = "STAN-CS-82-925",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = aug,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Buchanan:1982:PRB,
author = "Bruce G. Buchanan and Richard O. Duda",
title = "Principles of Rule-Based Expert Systems",
type = "Technical Report",
number = "STAN-CS-82-926 (HPP-82-14)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "58",
month = aug,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-926.html",
abstract = "Rule-based expert systems are surveyed. The most
important considerations are representation and
inference. Rule-based systems make strong assumptions
about the representation of knowledge as conditional
sentences and about the control of inference in one of
three ways. The problem of reasoning with incomplete or
inexact information is also discussed, as are several
other issues regarding the design of expert systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-926",
}
@TechReport{Ullman:1982:CSM,
author = "Jeffrey D. Ullman",
title = "Combining state machines and regular expressions for
automatic synthesis of {VLSI} circuits",
type = "Technical Report",
number = "STAN-CS-82-927",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = sep,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-927.html",
abstract = "We discuss a system for translating regular
expressions into logic equations or PLA's, with
particular attention to how we can obtain both the
benefits of regular expressions and state machines as
input languages. An extended example of the method is
given, and the results of our approach is compared with
hand design; in this example we use less than twice the
area of a hand-designed, machine optimized PLA.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-927",
}
@TechReport{Kuhn:1982:AAM,
author = "Ingeborg M. Kuhn and Gio Wiederhold and Jonathan E.
Rodnick and Diane M. Ramsey-Klee and Sanford Benett and
Donald D. Beck",
title = "Automated ambulatory medical record systems in the
{U.S.}",
type = "Technical Report",
number = "STAN-CS-82-928",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "70",
month = aug,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-928.html",
abstract = "This report presents an overview of the developments
in Automated Ambulatory Medical Record Systems (AAMRS)
from 1975 to the present. A summary of findings from a
1975 state-of-the-art review is presented along with
the current findings of a follow-up study of a selected
number of the AAMRS operating today. The studies
revealed that effective automated medical record
systems have been developed for ambulatory care
settings and that they are now in the process of being
transferred to other sites or users, either privately
or as a commercial product. Since 1975 there have been
no significant advances in system design. However,
progress has been substantial in terms of achieving
production goals. Even though a variety of systems are
commercially available, there is a continuing need for
research and development to improve the effectiveness
of the systems in use today.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-928",
}
@TechReport{Maier:1982:FR,
author = "David Maier and Jeffrey D. Ullman",
title = "Fragments of Relations",
type = "Technical Report",
number = "STAN-CS-82-929",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Baker:1982:DEI,
author = "Henry Harlyn Baker",
title = "Depth from Edge and Intensity Based Stereo",
type = "Technical Report",
number = "STAN-CS-82-930 (AIM-347)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "99",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Aikins:1982:PES,
author = "Janice S. Aikins and John C. Kunz and Edward H.
Shortliffe and Robert J. Fallat",
title = "{PUFF}: an expert system for interpretation of
pulmonary function data",
type = "Technical Report",
number = "STAN-CS-82-931 (HPP-82-13)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 21",
month = sep,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-931.html",
abstract = "The application of Artificial Intelligence techniques
to real-world problems has produced promising research
results, but seldom has a system become a useful tool
in its domain of expertise. Notable exceptions are the
DENDRAL and MOLGEN systems. This paper describes PUFF,
a program that interprets lung function test data and
has become a working tool in the pulmonary physiology
lab of a large hospital. Elements of the problem that
paved the way for its success are examined, as are
significant limitations of the solution that warrant
further study.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-82-931",
}
@TechReport{Shortliffe:1982:ESR,
author = "Edward H. Shortliffe and Lawrence M. Fagan",
title = "Expert systems research: modeling the medical decision
making process",
type = "Technical Report",
number = "STAN-CS-82-932 (HPP-82-3)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 23",
month = sep,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-932.html",
abstract = "During the quarter century since the birth of the
branch of computer science known as artificial
intelligence (AI), much of the research has focused on
developing symbolic models of human inference. In the
last decade several related AI research themes have
come together to form what is now known as ``expert
systems research.'' In this paper we review AI and
expert systems to acquaint the reader with the field
and to suggest ways in which this research will
eventually be applied to advanced medical monitoring.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-82-932",
}
@TechReport{Klein:1982:AMS,
author = "Shmuel T. Klein and Eli Shamir",
title = "An algorithmic method for studying percolation
clusters",
type = "Technical Report",
number = "STAN-CS-82-933",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = sep,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-933.html",
abstract = "In percolation theory one studies configurations,
based on some infinite lattice, where the sites of the
lattice are randomly made F (full) with probability p
or E (empty) with probability 1-p. For p > $ p_c $,
the set of configurations which contain an infinite
cluster (a connectivity component) has probability 1.
Using an algorithmic method and a rearrangement lemma
for Bernoulli sequences, we compute the
boundary-to-body quotient of infinite clusters and
prove it has the definite value (1-p)/p with
probability 1.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-933",
}
@TechReport{Barr:1982:USL,
author = "A. Barr and P. Cohen and L. Fagan",
title = "Understanding Spoken Language",
type = "Technical Report",
number = "STAN-CS-82-934 (HPP-82-16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "52",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
pdfpages = "96",
remark = "Published in \booktitle{Handbook of Artificial
Intelligence}, Vol. I, Chap. 5, July 1982, 50 pages.",
}
@TechReport{Tappel:1982:PLA,
author = "Tappel and Westfold and Barr",
title = "Programming Languages for {AI} Research",
type = "Technical Report",
number = "STAN-CS-82-935 (HPP-82-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "90",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Cohen:1982:MC,
author = "Paul R. Cohen",
title = "Models of Cognition",
type = "Technical Report",
number = "STAN-CS-82-936 (HPP-82-18)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "87",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ballantyne:1982:AD,
author = "M. Ballantyne and W. W. Bledsoe and J. Doyle and R. C.
Moore and R. Pattis and S. Rosenschein",
title = "Automatic Deduction",
type = "Technical Report",
number = "STAN-CS-82-937 (HPP-82-19)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "64",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kanade:1982:V,
author = "Takeo Kanade",
title = "Vision",
type = "Technical Report",
number = "STAN-CS-82-938 (HPP-82-20)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "220",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Cohen:1982:PPS,
author = "Paul R. Cohen",
title = "Planning and Problem Solving",
type = "Technical Report",
number = "STAN-CS-82-939 (HPP-82-21)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "61",
month = sep,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ullman:1982:EUR,
author = "Jeffrey D. Ullman and Moshe Y. Vardi and David Maier",
title = "The Equivalence of Universal Relation Definitions",
type = "Technical Report",
number = "STAN-CS-82-940",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 27",
month = oct,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/html/tr/ADA324622/;
https://apps.dtic.mil/sti/tr/pdf/ADA324622.pdf",
abstract = "The universal relation model aims at achieving
complete access path independence by relieving the user
of the need for logical navigation among relations. It
assumes that for every set of attributes there is a
basic relationship that the user has in mind. Two
fundamentally different approaches to the universal
relation model have been taken. The first approach sees
the universal relation as a user view, about which he
poses queries. Specifically, a representative instance
is constructed, and queries are answered based on its
non-null part. The second approach sees the model as
having query-processing capabilities that relieve the
user of the need to specify the logical access path.
The relationship between the user's view and the
computation answering a query is a central issue that
systems supporting a universal view of data must
handle.\par
We introduce ``lossless'' and ``monotone'' expressions
and show that the representative instance construction
has these properties. Also, every lossless monotone
expression produces a result that is a subset of what
the representative instance produces. We show that the
existence of any first-order formula to simulate the
representative instance is equivalent to a
``boundedness'' condition on the dependencies defining
the database scheme. In addition, whenever there is a
first-order formula to simulate the representative
instance, then we can do so with an expression of
simple form: the union of tableau mappings. We close
with a discussion of some of the problems with the
representative instance approach that suggest better
universal relation models may be possible.",
acknowledgement = ack-nhfb,
pdfpages = "28",
}
@TechReport{Martin:1982:ILI,
author = "Paul A. Martin",
title = "Integrating Local Information to Understand Dialog",
type = "Technical Report",
number = "STAN-CS-82-941 (AIM-348)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = oct,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rowe:1982:MDI,
author = "Neil C. Rowe",
title = "Modelling degrees of item interest for a general
database query system",
type = "Technical Report",
number = "STAN-CS-82-947",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 34",
month = apr,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-947.html",
abstract = "Many databases support decision-making. Often this
means choices between alternatives according to partly
subjective or conflicting criteria. Database query
languages are generally designed for precise, logical
specification of the data of interest, and tend to be
awkward in the aforementioned circumstances.
Information retrieval research suggests several
solutions, but there are obstacles to generalizing
these ideas to most databases. To address this problem
we propose a methodology for automatically deriving and
monitoring ``degrees of interest'' among alternatives
for a user of a database system. This includes (a) a
decision theory model of the value of information to
the user, and (b) inference mechanisms, based in part
on ideas from artificial intelligence, that can tune
the model to observed user behavior. This theory has
important applications to improving efficiency and
cooperativeness of the interface between a
decision-maker and a database system.",
acknowledgement = ack-nhfb,
pdfpages = "42",
xxnumber = "CS-TR-82-947",
}
@TechReport{Rowe:1982:TPR,
author = "Neil C. Rowe",
title = "Three Papers on Rule-Based Estimation of Statistics on
Databases",
type = "Technical Report",
number = "STAN-CS-82-948",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = oct,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Broder:1982:SN,
author = "Andrei Z. Broder",
title = "The $r$-{Stirling} Numbers",
type = "Technical Report",
number = "STAN-CS-82-949",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 22",
month = dec,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "http://i.stanford.edu/pub/cstr/reports/cs/tr/82/949/CS-TR-82-949.pdf;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-949.html",
abstract = "The $r$-Stirling numbers of the first and second kind
count restricted permutations and respectively
restricted partitions, the restriction being that the
first r elements must be in distinct cycles and
respectively distinct subsets. The combinatorial and
algebraic properties of these numbers, which is most
cases generalize similar properties of the regular
Stirling numbers, are explored starting from the above
definition.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-82-949",
}
@TechReport{Pratt:1982:FPS,
author = "Vaughan Pratt",
title = "Five paradigm shifts in programming language design
and their realization in {Viron}, a dataflow
programming environment",
type = "Technical Report",
number = "STAN-CS-82-951",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 9",
month = dec,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-951.html",
abstract = "We describe five paradigm shifts in programming
language design, some old and some relatively new,
namely Effect to Entity, Serial to Parallel, Partition
Types to Predicate Types, Computable to Definable, and
Syntactic Consistency to Semantic Consistency. We argue
for the adoption of each. We exhibit a programming
language, Viron, that capitalizes on these shifts.",
acknowledgement = ack-nhfb,
pdfpages = "12",
xxnumber = "CS-TR-82-951",
}
@TechReport{Moszkowski:1982:TLM,
author = "Ben Moszkowski",
title = "A Temporal Logic for Multi-Level Reasoning about
Hardware",
type = "Technical Report",
number = "STAN-CS-82-952",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = nov,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buchanan:1982:PBW,
author = "Bruce G. Buchanan",
title = "Partial Bibliography of Work on Expert Systems",
type = "Technical Report",
number = "STAN-CS-82-953 (HPP-82-30)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = dec,
year = "1982",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-953.html",
abstract = "Since 1971 many publications on expert systems have
appeared in conference proceedings and the technical
literature. Over 200 titles are listed in the
bibliography. Many relevant publications are omitted
because they overlap publications on the list; others
should be called to my attention.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-953",
}
@TechReport{Manna:1982:HCT,
author = "Zohar Manna and Amir Pnueli",
title = "How to Cook a Temporal Proof System for Your Pet
Language",
type = "Technical Report",
number = "STAN-CS-82-954",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = nov,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldman:1982:DIM,
author = "Ron Goldman",
title = "Design of an Interactive Manipulator Programming
Environment",
type = "Technical Report",
number = "STAN-CS-82-955 (AIM-350)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "149",
month = dec,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Barr:1982:AIC,
author = "Avron Barr",
title = "Artificial Intelligence: Cognition as Computation",
type = "Technical Report",
number = "STAN-CS-82-956 (HPP-82-29)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = aug,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Zabala-Salelles:1982:IGO,
author = "Ignacio Andres Zabala-Salelles",
title = "Interfacing with Graphic Objects",
type = "Technical Report",
number = "STAN-CS-82-960",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = dec,
year = "1982",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Korth:1983:SUD,
author = "Henry Korth and Gabriel Kuper and Jeffrey Ullman",
title = "{System/U}: a Database System based on the Universal
Relation Assumption",
type = "Technical Report",
number = "STAN-CS-82-944",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = jan,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gilbert:1983:APT,
author = "Erik James Gilbert",
title = "Algorithm Partitioning Tools for a High-Performance
Multiprocessor",
type = "Technical Report",
number = "STAN-CS-82-946",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "133",
month = feb,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Winston:1983:LPD,
author = "Patrick H. Winston and Thomas O. Binford and Boris
Katz and Michael Lowry",
title = "Learning physical description from functional
definitions, examples and precedents",
type = "Technical Report",
number = "STAN-CS-82-950 (AIM-349)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jan,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-950.html",
abstract = "It is too hard to tell vision systems what things look
like. It is easier to talk about purpose and what
things are for. Consequently, we want vision systems to
use functional descriptions to identify things, when
necessary, and we want them to learn physical
descriptions for themselves, when possible. This paper
describes a theory that explains how to make such
systems work. The theory is a synthesis of two sets of
ideas: ideas about learning from precedents and
exercises developed at MIT and ideas about physical
description developed at Stanford. The strength of the
synthesis is illustrated by way of representative
experiments. All of these experiments have been
performed with an implementation system.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-82-950",
}
@TechReport{Navathe:1983:VPP,
author = "Navathe and Ceri and Wiederhold and Dou",
title = "Vertical Partitioning for Physical and Distribution
Design of Databases",
type = "Technical Report",
number = "STAN-CS-82-957",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = jan,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mulsant:1983:KED,
author = "Benoit Mulsant and David Servan-Schreiber",
title = "Knowledge Engineering: a Daily Activity on a Hospital
Ward",
type = "Technical Report",
number = "STAN-CS-82-998 (HPP-83-40)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iii + 41",
month = sep,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-82-998.html",
abstract = "Two common barriers against the development and
diffusion of Expert Systems in Medicine are the
difficulty of design and the low level of acceptance.
This paper reports on an original experience which
entails potential solutions of these issues: the task
of Knowledge Engineering is performed by medical
students and residents on a hospital ward using a
sophisticated Knowledge Acquisition System, EMYCIN. The
Knowledge Engineering sessions are analysed in detail
and a structured method is proposed. A transcript of a
sample run of the resulting program is presented along
with an evaluation of its performance, acceptance,
educational potential and amount of endeavour required.
The impact of the Knowledge Engineering process itself
is then assessed both from the residents and the
medical students standpoint. Finally, the possibility
of generalizing the experiment is examined.",
acknowledgement = ack-nhfb,
pdfpages = "46",
xxnumber = "CS-TR-82-998",
}
@TechReport{Zwaenepoel:1983:PRP,
author = "Willy Zwaenepoel and Keith A. Lantz",
title = "{Perseus}: Retrospective on a Portable Operating
System",
type = "Technical Report",
number = "STAN-CS-83-945 (CSL-TR-206)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 8",
month = feb,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-945.html",
abstract = "We describe the operating system Perseus, developed as
part of a study into the issues of computer
communications and their impact on operating system and
programming language design. Perseus was designed to be
portable by virtue of its kernel-based structure and
its implementation in Pascal. In particular,
machine-dependent code is limited to the kernel and
most operating systems functions are provided by server
processes, running in user mode. Perseus was designed
to evolve into a distributed operating system by virtue
of its interprocess communication facilities, based on
message-passing. This paper presents an overview of the
system and gives an assessment of how far it satisfied
its original goals. Specifically, we evaluate its
interprocess communication facilities and kernel-based
structure, followed by a discussion of portability. We
close with a brief history of the project, pointing out
major milestones and stumbling blocks along the way.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-83-945",
}
@TechReport{Lantz:1983:TGG,
author = "Keith Lantz and David Cheriton and William Nowicki",
title = "Third Generation Graphics for Distributed Systems",
type = "Technical Report",
number = "STAN-CS-83-958 (CSL Technical Report 235)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "40",
month = feb,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Karplus:1983:CIP,
author = "Kevin Karplus",
title = "{CHISEL} --- an Introduction to the Programming
Language {C} for {VLSI} Layout",
type = "Technical Report",
number = "STAN-CS-83-959",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "137",
month = jan,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Arnold:1983:ASP,
author = "R. David Arnold",
title = "Automated Stereo Perception",
type = "Technical Report",
number = "STAN-CS-83-961 (AIM-351)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = feb,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Berg:1983:BSC,
author = "Kathryn A. Berg",
title = "Bibliography of {Stanford Computer Science} reports,
1963--1983",
type = "Technical Report",
number = "STAN-CS-83-962",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "65",
month = mar,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-962.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
since 1963. Each report is identified by a Computer
Science number, author's name, title, National
Technical Information Service (NTIS) retrieval number
(i.e., AD-XXXXXX), date, and number of pages. If an
NTIS number is not given, it means that the report is
probably not available from NTIS.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-962",
}
@TechReport{Halpern:1983:HSB,
author = "Joseph Halpern and Zohar Manna and Ben Moszkowski",
title = "A Hardware Semantics Based on Temporal Intervals",
type = "Technical Report",
number = "STAN-CS-83-963",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = mar,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-963.html",
abstract = "We present an interval-based temporal logic that
permits the rigorous specification of a variety of
hardware components and facilitates describing
properties such as correctness of implementation.
Conceptual levels of circuit operation ranging from
detailed quantitative timing and signal propagation up
to functional behavior are integrated in a unified way.
After giving some motivation for reasoning about
hardware, we present the propositional and first-order
syntax and semantics of the temporal logic. In addition
we illustrate techniques for describing signal
transitions as well as for formally specifying and
comparing a number of delay models. Throughout the
discussion, the formalism provides a means for
examining such concepts as device equivalence and
internal states.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-963",
}
@TechReport{Manna:1983:PPP,
author = "Zohar Manna and Amir Pnueli",
title = "Proving Precedence Properties: The Temporal Way",
type = "Technical Report",
number = "STAN-CS-83-964",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 38",
month = apr,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/964/CS-TR-83-964.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-964.html",
abstract = "This paper explores the three important classes of
temporal properties of concurrent programs: invariance,
liveness and precedence. It presents the first
methodological approach to the precedence properties,
while providing a review of the invariance and liveness
properties. The approach is based on the 'unless'
operator, which is a weak version of the 'until'
operator. For each class of properties, we present a
single complete proof principle. Finally, we show that
the properties of each class are decidable over finite
state programs.",
acknowledgement = ack-nhfb,
pdfpages = "40",
xxnumber = "CS-TR-83-964",
}
@TechReport{Ghosh:1983:ATD,
author = "Pijush K. Ghosh",
title = "An approach to type design and text composition in
{Indian} scripts",
type = "Technical Report",
number = "STAN-CS-83-965",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = apr,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-965.html",
abstract = "The knowledge of letters exerts a dual enchantment.
When it uncovers the relationships between a series of
arbitrary symbols and the sounds of speech, it fills us
with joy. For others the visible expression of the
letters, their graphical forms, their history and their
development become fascinating. The advent of digital
information technology has opened new vistas in the
concept of letter forms. Unfortunately the graphics
industry in India has remained almost unaffected by
these technological advances, especially in the field
of type design and text composition. This report
strives to demonstrate how to use various tools and
techniques, so that the new technology can cope with
the plurality of Indian scripts. To start with all you
need to know is the basic shapes of the letters of the
Roman alphabet and the sounds they represent. With this
slender thread of knowledge an enjoyable study of
letter design and text composition in Indian scripts
can begin.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-965",
}
@TechReport{Ghosh:1983:FAL,
author = "Pijush K. Ghosh and Charles A. Bigelow",
title = "A formal approach to lettershape description for type
design",
type = "Technical Report",
number = "STAN-CS-83-966",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 51",
month = may,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/966/CS-TR-83-966.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-966.html",
abstract = "This report is designed to explore some analytic means
of specifying lettershapes. Computer representation and
analysis of lettershape have made use of two
diametrically different approaches, one representing a
shape by its boundary, the other by its skeleton or
medial axis. Generally speaking, the boundary
representation is conceptually simpler to the designer,
but the skeletal representation provides more insight
into the ``piecedness'' of the shape. Donald Knuth's
METAFONT is one of the sophisticated lettering design
systems which has basically adopted the medial axis
approach. Moreover, the METAFONT system has introduced
the idea of metafont-description of a letter, i.e., to
give a rigorous definition of the shape of a letter in
such a way that many styles are obtained from a single
definition by changing only a few user-defined
parameters. That is why we have considered the METAFONT
system as our starting point and have shown how we can
arrive at the definition of a formal language for
specifying lettershapes. We have also introduced a
simple mathematical model for decomposing a letter into
its constituent elements.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-966",
}
@TechReport{Manna:1983:VCP,
author = "Zohar Manna and Amir Pnueli",
title = "Verification of concurrent programs: a temporal proof
system",
type = "Technical Report",
number = "STAN-CS-83-967",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "92",
month = jun,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-967.html",
abstract = "A proof system based on temporal logic is presented
for proving properties of concurrent programs based on
the shared-variables computation model. The system
consists of three parts: the general uninterpreted
part, the domain dependent part and the program
dependent part. In the general part we give a complete
proof system for first-order temporal logic with
detailed proofs of useful theorems. This logic enables
reasoning about general time sequences. The domain
dependent part characterizes the special properties of
the domain over which the program operates. The program
dependent part introduces program axioms which restrict
the time sequences considered to be execution sequences
of a given program. The utility of the full system is
demonstrated by proving invariance, liveness and
precedence properties of several concurrent programs.
Derived proof principles for these classes of
properties are obtained and lead to a compact
representation of proofs.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-967",
}
@TechReport{Whang:1983:PDD,
author = "Kyu-Young Whang",
title = "A Physical Database Design Methodology Using the
Property of Separability",
type = "Technical Report",
number = "STAN-CS-83-968",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "271",
month = jun,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Moszkowski:1983:RIT,
author = "Ben Moszkowski and Zohar Manna",
title = "Reasoning in Interval Temporal Logic",
type = "Technical Report",
number = "STAN-CS-83-969",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = jul,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-969.html",
abstract = "Predicate logic is a powerful and general descriptive
formalism with a long history of development. However,
since the logic's underlying semantics have no notion
of time, statements such as ``I increases by 2'' cannot
be directly expressed. We discuss interval temporal
logic (ITL), a formalism that augments standard
predicate logic with operators for time-dependent
concepts. Our earlier work used ITL to specify and
reason about hardware. In this paper we show how ITL
can also directly capture various control structures
found in conventional programming languages. Constructs
are given for treating assignment, iteration,
sequential and parallel computations and scoping. The
techniques used permit specification and reasoning
about such algorithms as concurrent Quicksort. We
compare ITL with the logic-based programming languages
Lucid and Prolog.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-969",
}
@TechReport{Moszkowski:1983:RAD,
author = "Ben Moszkowski",
title = "Reasoning about Digital Circuits",
type = "Technical Report",
number = "STAN-CS-83-970",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = jul,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ruggles:1983:LDS,
author = "Lynn Ruggles",
title = "Letterform Design Systems",
type = "Technical Report",
number = "STAN-CS-83-971",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 24",
month = apr,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/971/CS-TR-83-971.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-971.html",
abstract = "The design of letterforms requires a skilled hand, an
eye for fine detail and an understanding of the
letterforms themselves. This work has traditionally
been done by experienced artisans, but in the last
fifteen years there have been attempts to integrate the
design process with the use of computers in order to
create digital type forms. The use of design systems
for the creation of these digital forms has led to an
analysis of the way type designs are created by type
designers. Their methods have been integrated into a
variety of systems for creating digital forms. This
paper describes these design systems and discusses the
relevant issues for the success of the systems that
exist and are used today.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-83-971",
}
@TechReport{Karlin:1983:ERE,
author = "Anna R. Karlin and Howard W. Trickey and Jeffrey D.
Ullman",
title = "Experience with a Regular Expression Compiler",
type = "Technical Report",
number = "STAN-CS-83-972",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 23",
month = jun,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-972.html",
abstract = "The language of regular expressions is a useful one
for specifying certain sequential processes at a very
high level. They allow easy modification of designs for
circuits, like controllers, that are described by
patterns of events they must recognize and the
responses they must make to those patterns. This paper
discusses the compilation of such expressions into
reasonably compact layouts. The translation of regular
expressions into nondeterministic automata by two
different methods is discussed, along with the
advantages of each method. A major part of the
compilation problem is selection of good state codes
for the nondeterministic automata; one successful
strategy is explained in the paper.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-83-972",
}
@TechReport{Cheriton:1983:DVK,
author = "David R. Cheriton and Willy Zwaenepoel",
title = "The Distributed {V} Kernel and Its Performance for
Diskless Workstations",
type = "Technical Report",
number = "STAN-CS-83-973",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jul,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-973.html",
abstract = "The distributed V kernel is a message-oriented kernel
that provides uniform local and network interprocess
communication. It is primarily being used in an
environment of diskless workstations connected by a
high-speed local network to a set of file servers. We
describe a performance evaluation of the kernel, with
particular emphasis on the cost of network file access.
Our results show that over a local network: 1. Diskless
workstations can access remole files with minimal
performance penalty. 2. The V message facility can be
used to access remote files at comparable cost to any
well-tuned specialized file access protocol. We
conclude that it is feasible to build a distributed
system with all network communication using the V
message facility even when most of the network nodes
have no secondary storage.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-973",
}
@TechReport{Hobby:1983:CMF,
author = "John Hobby and Gu Guoan",
title = "A {Chinese Meta-Font}",
type = "Technical Report",
number = "STAN-CS-83-974",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 22",
month = jul,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/974/CS-TR-83-974.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-974.html",
abstract = "METAFONT is Donald E. Knuth's system for alphabet
design. The system allows an entire family of fonts or
``meta-fonts'' to be specified precisely and
mathematically so that it can be produced in different
sizes and styles for different raster devices.\par
We present a new technique for defining Chinese
characters hierarchically with METAFONT. We define
METAFONT subroutines for commonly used portions of
strokes and then combine some of these into routines
for drawing complete strokes. Parameters describe the
skeletons of the strokes and the stroke routines are
carefully designed to transform themselves
appropriately. This allows us to handle all of the
basic strokes with only 14 different routines.\par
The stroke routines in turn are used to build up groups
of strokes and radicals. Special routines for
positioning control points ensure that the strokes will
join properly in a variety of different styles. The
radical routines are parameterized to allow them to be
placed at different locations in the typeface and to
allow for adjusting their size and shape. Key points
are positioned relative to the bounding box for the
radical, and the special positioning routines find
other points that must be passed to the stroke
routines.\par
We use this method to design high quality Song style
characters. Global parameters control the style, and we
show how these can be used to create Song and Long Song
from the same designs. Other settings can produce other
familiar styles or even new styles. We show how it is
possible to create completely different styles, such as
Bold style, merely by substituting different stroke
routines. The global parameters can be used to augment
simple scaling by altering stroke width and other
details to account for changes in size. We can adjust
stroke widths to help even out the overall darkness of
the characters. We also show how it is possible to
experiment with new ideas such as adjusting character
widths individually.\par
While many of our characters are based on existing
designs, the stroke routines facilitate the design of
new characters without the need to refer to detailed
drawings. The skeletal parameters and special
positioning routines make it easy to position the
strokes properly. In our previous paper, in contrast to
this, we parameterized the strokes according to their
boundaries and copied an existing design. The previous
approach made it very difficult to create different
styles with the same METAFONT program.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-83-974",
}
@TechReport{Rowe:1983:RBS,
author = "Neil C. Rowe",
title = "Rule-Based Statistical Calculations on a Database
Abstract",
type = "Technical Report",
number = "STAN-CS-83-975",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "167",
month = jul,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Beeri:1983:ADD,
author = "Catriel Beeri and Moshe Vardi",
title = "On Acyclic Database Decompositions",
type = "Technical Report",
number = "STAN-CS-83-976",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = jul,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Liang:1983:WHP,
author = "Franklin Mark Liang",
title = "{Word Hy-phen-a-tion by Com-put-er}",
type = "Technical Report",
number = "STAN-CS-83-977",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 85",
month = aug,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/texbook3.bib;
https://www.math.utah.edu/pub/tex/bib/typeset.bib",
URL = "https://www.tug.org/docs/liang/liang-thesis.pdf",
abstract = "This thesis describes research leading to an improved
word hyphenation algorithm for the {\TeX82} typesetting
system. Hyphenation is viewed primarily as a data
compression problem, where we are given a dictionary of
words with allowable division points, and try to devise
methods that take advantage of the large amount of
redundancy present.\par
The new hyphenation algorithm is based on the idea of
hyphenating and inhibiting patterns. These are simply
strings of letters that, when they match in a | word,
give us information about hyphenation at some point in
the pattern. For example, `-tion' and `c-c' are good
hyphenating patterns. An important feature of this
method is that a suitable set of patterns can be
extracted automatically from the dictionary.\par
In order to represent the set of patterns in a compact
form that is also reasonably efficient for searching,
the author has developed a new data structure called a
packed trie. This data structure allows the very fast
search times characteristic of indexed tries, but in
many cases it entirely eliminates the wasted space for
null links usually present in such tries. We
demonstrate the versatility and practical advantages of
this data structure by using a variant of it as the
critical component of the program that generates the
patterns from the dictionary.\par
The resulting hyphenation algorithm uses about 4500
patterns that compile into a packed trie occupying 25K
bytes of storage. These patterns find 89\% of the
hyphens in a pocket dictionary word list, with
essentially no error. By comparison, the uncompressed
dictionary occupies over 500K bytes.",
acknowledgement = ack-nhfb,
pdfpages = "62",
remark = "This is the author's Ph.D. thesis. Pages 45--73 are
missing from the PDF file.",
tableofcontents = "Introduction / 1 \\
Examples / 2 \\
\TeX{} and hyphenation / 3 \\
Time magazine algorithm / 4 \\
Patterns / 5 \\
Overview of thesis / 7 \\
\\
The dictionary problem / 8 \\
Data structures / 9 \\
Superimposed coding / 10 \\
Tries / 11 \\
Packed tries / 15 \\
Suffix compression / 16 \\
Derived forms / 18 \\
Spelling checkers / 19 \\
Related work / 21 \\
\\
Hyphenation / 28 \\
Finite-state machines with output / 28 \\
Minimization with don't cares / 24 \\
Pattern matching / 26 \\
\\
Pattern generation / 29 \\
Heuristics / 30 \\
Collecting pattern statistics / 31 \\
Dynamic packed tries / 32 \\
Experimental results / 34 \\
Examples / 37 \\
\\
History and Conclusion / 39 \\
\\
Appendix / 45 \\
The PATGEN program / 45 \\
List of patterns / 74 \\
\\
References / 83",
}
@TechReport{Knuth:1983:LLM,
author = "Donald E. Knuth",
title = "Lessons Learned from {METAFONT}",
type = "Technical Report",
number = "STAN-CS-83-978",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = aug,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://journals.uc.edu/index.php/vl/article/view/5401/4265",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Visible Language} {\bf XIX}(1)
35--53, Winter 1985.",
}
@TechReport{Graham:1983:NDS,
author = "M. H. Graham and A. O. Mendelzon and M. Y. Vardi",
title = "Notions of Dependency Satisfaction",
type = "Technical Report",
number = "STAN-CS-83-979",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = aug,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1983:WSS,
author = "Donald E. Knuth",
title = "The {WEB} System of Structured Documentation",
type = "Technical Report",
number = "STAN-CS-83-980",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 206",
day = "1",
month = sep,
year = "1983",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Version 2.3.",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/980/CS-TR-83-980.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-980.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-980",
abstract = "This memo describes how to write programs in the WEB
language (Version 2.3, September 1983); and it also
includes the full WEB documentation for WEAVE and
TANGLE, the programs that read WEB input and produce
{\TeX} and PASCAL output, respectively. The philosophy
behind WEB is that an experienced system programmer,
who wants to provide the best possible documentation of
his or her software products, needs two things
simultaneously: a language like {\TeX} for formatting,
and a language like PASCAL for programming. Neither
type of language can provide the best documentation by
itself; but when both are appropriately combined, we
obtain a system that is much more useful than either
language separately",
acknowledgement = ack-nhfb # "\slash " # ack-hk,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-980",
pdfpages = "210",
xxnumber = "CS-TR-83-980",
}
@TechReport{Knuth:1983:LP,
author = "Donald E. Knuth",
title = "Literate Programming",
type = "Technical Report",
number = "STAN-CS-83-981",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = sep,
year = "1983",
DOI = "https://doi.org/10.1093/comjnl/27.2.97",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{The Computer Journal}, {\bf
27}(2) 97--111, May 1984. doi:10.1093/comjnl/27.2.97",
}
@TechReport{Greene:1983:LFL,
author = "Daniel H. Greene",
title = "Labelled Formal Languages and Their Uses",
type = "Technical Report",
number = "STAN-CS-83-982",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "150",
month = aug,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ullman:1983:CTT,
author = "Jeffrey D. Ullman",
title = "A Communication-Time Tradeoff",
type = "Technical Report",
number = "STAN-CS-83-983",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = aug,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Brown:1983:PEE,
author = "Harold Brown and Christopher Tong and Gordon Foyster",
title = "Palladio: an Exploratory Environment for Circuit
Design",
type = "Technical Report",
number = "STAN-CS-83-984 (HPP-83-31)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = jul,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Samuel:1983:FGT,
author = "Arthur L. Samuel",
title = "First grade {\TeX}: a beginner's {\TeX} manual",
type = "Technical Report",
number = "STAN-CS-83-985",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 34",
month = nov,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/83/985/CS-TR-83-985.pdf;
http://www-db.stanford.edu/TR/CS-TR-83-985.html",
abstract = "This is an introductory ready-reference TEX82 manual
for the beginner who would like to do First Grade TEX
work. Only the most basic features of the TEX system
are discussed in detail. Other features are summarized
in an appendix and references are given to the more
complete documentation available elsewhere.",
acknowledgement = ack-nhfb,
author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
xxnumber = "CS-TR-83-985",
}
@TechReport{Cohen:1983:HRA,
author = "Paul R. Cohen",
title = "Heuristic Reasoning about Uncertainty: an Artificial
Intelligence Approach",
type = "Technical Report",
number = "STAN-CS-83-986",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "200",
month = sep,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ullman:1983:STA,
author = "Jeffrey D. Ullman",
title = "Some Thoughts about Supercomputer Organization",
type = "Technical Report",
number = "STAN-CS-83-987",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = oct,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mairson:1983:PCS,
author = "Harry George Mairson",
title = "The Program Complexity of Searching a Table",
type = "Technical Report",
number = "STAN-CS-83-988",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "85",
month = nov,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1983:PPS,
author = "Donald E. Knuth and Joseph S. Weening",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-83-989",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 91",
month = dec,
year = "1983",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-989.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-989",
abstract = "his report contains edited transcripts of the
discussions held in Stanford's course CS 204, Problem
Seminar, during autumn quarter 1981. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms were touched on during the
discussions, these notes may be of interest to graduate
students of computer science at other universities, as
well as to their professors and to professional people
in the ``real world.''\par
The present report is the fourth in a series of such
transcripts, continuing the tradition established in
CS606 (Michael J. Clancy, 1977), CS707 (Chris Van Wyk,
1979), and CS863 (Allan A. Miller, 1981).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-989",
pdfpages = "100",
xxnumber = "CS-TR-83-989",
}
@TechReport{Hobby:1983:PPS,
author = "John D. Hobby and Donald E. Knuth",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-83-990",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 61",
month = dec,
year = "1983",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-990.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-83-990",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS204, Problem
Seminar, during autumn quarter 1982. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms were touched on during the
discussions, these notes may be of interest to graduate
students of computer science at other universities, as
well as to their professors and to professional people
in the ``real world.''\par
The present report is the fifth in a series of such
transcripts, continuing the tradition established in
STAN-CS-77-606 (Michael J. Clancy, 1977),
STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
(Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
Weening, 1983).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-83-990",
pdfpages = "68",
xxnumber = "CS-TR-83-990",
}
@TechReport{Morgensteren:1983:PAA,
author = "Moshe Morgensteren and Eli Shamir",
title = "Parallel algorithms for arithmetics, irreducibility
and factoring of {GFq}-polynomials",
type = "Technical Report",
number = "STAN-CS-83-991",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = dec,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-991.html",
abstract = "A new algorithm for testing irreducibility of
polynomials over finite fields without gcd computations
makes it possible to devise efficient parallel
algorithms for polynomial factorization. We also study
the probability that a random polynomial over a finite
field has no factors of small degree.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-991",
}
@TechReport{Ketonen:1983:LIP,
author = "Jussi Ketonen and Joseph S. Weening",
title = "The Language of an Interactive Proof Checker",
type = "Technical Report",
number = "STAN-CS-83-992",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = dec,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-992.html",
abstract = "We describe the underlying language for EKL, an
interactive theorem-proving system currently under
development at the Stanford Artificial Intelligence
Laboratory. Some of the reasons for its development as
well as its mathematical properties are discussed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-992",
}
@TechReport{Lansky:1983:SAC,
author = "Amy Lansky",
title = "Specification and Analysis of Concurrency",
type = "Technical Report",
number = "STAN-CS-83-993",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "290",
month = dec,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chapiro:1983:SRP,
author = "Daniel M. Chapiro",
title = "Sorting by Recursive Partitioning",
type = "Technical Report",
number = "STAN-CS-83-994",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = dec,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-994.html",
abstract = "We present a new $ O(n \lg \lg n) $ time sort
algorithm that is more robust than $ O(n) $
distribution sorting algorithms. The algorithm uses a
recursive partition-concatenate approach, partitioning
each set into a variable number of subsets using
information gathered dynamically during execution.
Sequences are partitioned using statistical information
computed during the sort for each sequence. Space
complexity is $ O(n) $ and is independent from the
order and distribution of the data. If the data is
originally in a list, only $ O(\sqrt {n}) $ extra space
is necessary. The algorithm is insensitive to the
initial ordering of the data, and it is much less
sensitive to the distribution of the values of the
sorting keys than distribution sorting algorithms. Its
worst-case time is $ O(n \lg \lg n) $ across all
distributions that satisfy a new ``fractalness''
criterion. This condition, which is sufficient but not
necessary, is satisfied by any set with bounded length
keys and bounded repetition of each key. If this
condition is not satisfied, its worst case performance
degrades gracefully to $ O(n \lg n) $. In practice,
this occurs when the density of the distribution over $
\Omega (n) $ of the keys is a fractal curve (for sets
of numbers whose values are bounded), or when the
distribution has very heavy tails with arbitrarily long
keys (for sets of numbers whose precision is bounded).
In some preliminary tests, it was faster than Quicksort
for sets of more than 150 elements. The algorithm is
practical, works basically ``in place'', can be easily
implemented and is particularly well suited both for
parallel processing and for external sorting.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-994",
}
@TechReport{Clancey:1983:AAC,
author = "William J. Clancey",
title = "The advantages of abstract control knowledge in expert
system design",
type = "Technical Report",
number = "STAN-CS-83-995 (HPP-83-17)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = nov,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-995.html",
abstract = "A poorly designed knowledge base can be as cryptic as
an arbitrary program and just as difficult to maintain.
Representing control knowledge abstractly, separately
from domain facts and relations, makes the design more
transparent and explainable. A body of abstract control
knowledge provides a generic framework for constructing
knowledge bases for related problems in other domains
and also provides a useful starting point for studying
the nature of strategies.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-995",
}
@TechReport{Hasling:1983:SED,
author = "Diane Warner Hasling and William J. Clancey and Glenn
Rennels",
title = "Strategic explanations for a diagnostic consultation
system",
type = "Technical Report",
number = "STAN-CS-83-996 (HPP-83-41)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = nov,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-83-996.html",
abstract = "This paper examines the problem of automatic
explanation of reasoning, especially as it relates to
expert systems. By explanation we mean the ability of a
program to discuss what it is doing in some
understandable way. We first present a general
framework in which to view explanation and review some
of the research done in this area. We then focus on the
explanation system for NEOMYCIN, a medical consultation
program. A consultation program interactively helps a
user to solve a problem. Our goal is to have NEOMYCIN
explain its problem-solving strategies. An explanation
of strategy describes the plan the program is using to
reach a solution. Such an explanation is usually
concrete, referring to aspects of the current problem
situation. Abstract explanations articulate a general
principle, which can be applied in different
situations; such explanations are useful in teaching
and in explaining by analogy. We describe the aspects
of NEOMYCIN that make abstract strategic explanations
possible--the representation of strategic knowledge
explicitly and separately from domain knowledge--and
demonstrate how this representation can be used to
generate explanations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-83-996",
}
@TechReport{Clancey:1983:G,
author = "William J. Clancey",
title = "{GUIDON}",
type = "Technical Report",
number = "STAN-CS-83-997 (HPP-83-42)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = nov,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Phillips:1983:SDP,
author = "Jorge Phillips",
title = "Self-Described Programming Environments --- an
Application of a Theory of Design to Programming
Systems",
type = "Technical Report",
number = "STAN-CS-84-1008",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "262",
month = mar,
year = "1983",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ullman:1984:ILQ,
author = "Jeffrey D. Ullman",
title = "Implementation of Logical Query Languages for
Databases",
type = "Technical Report",
number = "STAN-CS-84-1000",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = may,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Brinkley:1984:UTD,
author = "James F. Brinkley",
title = "Ultrasonic Three-Dimensional Organ Modelling",
type = "Technical Report",
number = "STAN-CS-84-1001",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = mar,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{VanGelder:1984:STN,
author = "Allen {Van Gelder}",
title = "A Satisfiability Tester for Non-Clausal Propositional
Calculus",
type = "Technical Report",
number = "STAN-CS-84-1002",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = mar,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Anderson:1984:PGA,
author = "Richard Anderson and Ernst Mayr",
title = "Parallelism and Greedy Algorithms",
type = "Technical Report",
number = "STAN-CS-84-1003",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = apr,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1003.html",
abstract = "A number of greedy algorithms are examined and are
shown to be probably inherently sequential. Greedy
algorithms are presented for finding a maximal path,
for finding a maximal set of disjoint paths in a
layered dag, and for finding the largest induced
subgraph of a graph that has all vertices of degree at
least k. It is shown that for all of these algorithms,
the problem of determining if a given node is in the
solution set of the algorithm is P-complete. This means
that it is unlikely that these sequential algorithms
can be sped up significantly using parallelism.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1003",
}
@TechReport{Goldschlager:1984:CTH,
author = "Leslie M. Goldschlager",
title = "A Computational Theory of Higher Brain Function",
type = "Technical Report",
number = "STAN-CS-84-1004",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = apr,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1004.html",
abstract = "The higher functions of the brain are believed to
occur in the cortex. This region of the brain is
modelled as a memory surface which performs both
storage and computation. Concepts are modelled as
patterns of activity on the memory surface, and the
model explains how these patterns interact with one
another to give the computations which the brain
performs. The method of interaction can explain the
formation of abstract concepts, association of ideas
and train of thought. It is shown that creativity,
self, consciousness and free will are explainable
within the same framework. A theory of sleep is
presented which is consistent with the model.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1004",
}
@TechReport{Manna:1984:APP,
author = "Zohar Manna and Amir Pnueli",
title = "Adequate Proof Principles for Invariance and Liveness
Properties of Concurrent Programs",
type = "Technical Report",
number = "STAN-CS-84-1005",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = may,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1005.html",
abstract = "This paper presents proof principles for establishing
invariance and liveness properties of concurrent
programs. Invariance properties are established by
systematically checking that they are preserved by
every atomic instruction in the program. The methods
for establishing liveness properties are based on
'well-founded assertions' and are applicable to both
``just'' and ``fair'' computations. These methods do
not assume a decrease of the rank at each computation
step. It is sufficient that there exists one process
which decreases the rank when activated. Fairness then
ensures that the program will eventually attain its
goal. In the finite state case such proofs can be
represented by diagrams. Several examples are given.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-84-1005",
}
@TechReport{Ketonen:1984:EIP,
author = "Jussi Ketonen and Joseph S. Weening",
title = "{EKL} --- an interactive proof checker user's
reference manual",
type = "Technical Report",
number = "STAN-CS-84-1006",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "55",
month = jun,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1006.html",
abstract = "EKL is an interactive proof checker and constructor.
Its main goal is to facilitate the checking of
mathematical proofs. Some of the special features of
EKL are: * The language of EKL can be extended all the
way to finite-order predicate logic with typed
lambda-calculus. * Several proofs can be handled at the
same time. * Metatheoretic reasoning allows formal
extensions of the capabilities of EKL. * EKL is a
programmable system. The MACLISP language is available
to the user, and LISP functions can be written to
create input to EKL, thereby allowing expression of
proofs in an arbitrary input language. This document is
a reference manual for EKL. Each of the sections
discusses a major part of the language, beginning with
an overview of that area, and proceeding to a detailed
discussion of available features. To gain an
acquaintance with EKL, it is recommended that you read
only the introductory part of each section. EKL may be
used both at the Stanford Artificial Intelligence
Laboratory (SAIL) computer system, and on DEC TOPS-20
systems that support MACLISP.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1006",
}
@TechReport{Gabriel:1984:QBM,
author = "Richard P. Gabriel and John McCarthy",
title = "Queue-based Multi-processing {Lisp}",
type = "Technical Report",
number = "STAN-CS-84-1007",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = jun,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1007.html",
abstract = "This report presents a dialect of Lisp, called
QLAMBDA, which supports multi-processing. Along with
the definition of the dialect, the report presents
programming examples and performance studies of some
programs written in QLAMBDA. Unlike other proposed
multi-processing Lisps, QLAMBDA provides only a few
very powerful and intuitive primitives rather than a
number of parallel variants of familiar constructs.",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-84-1007",
}
@TechReport{Sagiv:1984:CTC,
author = "Yehoshua Sagiv and Jeffrey D. Ullman",
title = "Complexity of a top-down capture rule",
type = "Technical Report",
number = "STAN-CS-84-1009",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 35",
month = jul,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/84/1009/CS-TR-84-1009.pdf;
http://www-db.stanford.edu/TR/CS-TR-84-1009.html",
abstract = "Capture rules were introduced in [U] as a method for
planning the evaluation of a query expressed in
first-order logic. We examine a capture rule that is
substantiated by a simple top-down implementation of
restricted Horn clause logic. A necessary and
sufficient condition for the top-down algorithm to
converge is shown. It is proved that, provided there is
a bound on the number of arguments of predicates, the
test can be performed in polynomial time; however, if
the arity of predicates is made part of the input, then
the problem of deciding whether the top-down algorithm
converges is NP-hard. We then consider relaxation of
some of our constraints on the form of the logic,
showing that success of the top-down algorithm can
still be tested in polynomial time if the number of
arguments is limited and in exponential time if not.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-84-1009",
}
@TechReport{Lazowska:1984:FAP,
author = "Edward D. Lazowska and John Zahorjan and David R.
Cheriton and Willy Zwaenepoel",
title = "File Access Performance of Diskless Workstations",
type = "Technical Report",
number = "STAN-CS-84-1010",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Cheriton:1984:OMI,
author = "David R. Cheriton and Willy Zwaenepoel",
title = "One-to-Many Interprocess Communication in the
{V-System}",
type = "Technical Report",
number = "STAN-CS-84-1011",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Malachi:1984:TDT,
author = "Yonathan Malachi and Zohar Manna and Richard
Waldinger",
title = "{TABLOG}: The Deductive-Tableau Programming Language",
type = "Technical Report",
number = "STAN-CS-84-1012",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = jun,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1012.html",
abstract = "TABLOG (Tableau Logic Programming Language) is a
language based on first-order predicate logic with
equality that combines functional and logic
programming. TABLOG incorporates advantages of LISP and
PROLOG. A program in TABLOG is a list of formulas in a
first-order logic (including equality, negation, and
equivalence) that is more general and more expressive
than PROLOG's Horn clauses. Whereas PROLOG programs
must be relational, TABLOG programs may define either
relations or functions. While LISP programs yield
results of a computation by returning a single output
value, TABLOG programs can be relations and can produce
several results simultaneously through their arguments.
TABLOG employs the Manna-Waldinger deductive-tableau
proof system as an interpreter in the same way that
PROLOG uses a resolution-based proof system.
Unification is used by TABLOG to match a call with a
line in the program and to bind arguments. The basic
rules of deduction used for computing are nonclausal
resolution and rewriting by means of equality and
equivalence. A pilot interpreter for the language has
been implemented.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1012",
}
@TechReport{Desarmenien:1984:HRT,
author = "Jacques Desarmenien",
title = "How to Run {\TeX} in {French}",
type = "Technical Report",
number = "STAN-CS-84-1013",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Anderson:1984:PCP,
author = "Richard Anderson and Ernst W. Mayr",
title = "A {P}-Complete Problem and Approximations to It",
type = "Technical Report",
number = "STAN-CS-84-1014",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = sep,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1014.html",
abstract = "The P-complete problem that we will consider is the
High Degree Subgraph Problem. This problem is: given a
graph G = (V,E) and an integer k, find the maximum
induced subgraph of G that has all nodes of degree at
least k. After showing that this problem is P-complete,
we will discuss two approaches to finding approximate
solutions to it in NC. We will give a variant of the
problem that is also P-complete that can be
approximated to within a factor of c in NC, for any c
< 1/2, but cannot be approximated by a factor of
better than 1/2 unless P = NC. We will also give an
algorithm that finds a subgraph with moderately high
minimum degree. This algorithm exhibits an interesting
relationship between its performance and the time it
takes.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1014",
}
@TechReport{Kirousis:1984:CRP,
author = "Lefteris Kirousis and Christos Papadimitriou",
title = "The Complexity of Recognizing Polyhedral Scenes",
type = "Technical Report",
number = "STAN-CS-84-1015",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Papadimitriou:1984:IPC,
author = "Christos Papadimitriou and John Tsitsiklis",
title = "Intractable Problems in Control Theory",
type = "Technical Report",
number = "STAN-CS-84-1016",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Papadimitriou:1984:TPB,
author = "Christos Papadimitriou and John Tsitsiklis",
title = "The Throughput of a Precedence-Based Queuing
Discipline",
type = "Technical Report",
number = "STAN-CS-84-1017",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1984:CPS,
author = "William J. Clancey",
title = "Classification Problem Solving",
type = "Technical Report",
number = "STAN-CS-84-1018",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 23",
month = jul,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1018.html",
abstract = "A broad range of heuristic programs--embracing forms
of diagnosis. catalog selection, and skeletal
planning--accomplish a kind of well-structured problem
solving called classification. These programs have a
characteristic inference structure that systematically
relates data to a pre-enumerated set of solutions by
abstraction, heuristic association, and refinement.
This level of description specifies the knowledge
needed to solve a problem, independent of its
representation in a particular computer language. The
classification problem-solving model provides a useful
framework for recognizing and representing similar
problems, for designing representation tools, and for
understanding the problem-solving methods used by
non-classification programs.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-84-1018",
}
@TechReport{Lifschitz:1984:SRC,
author = "Vladimir Lifschitz",
title = "Some Results on Circumscription",
type = "Technical Report",
number = "STAN-CS-84-1019",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = sep,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Lowe:1984:POV,
author = "David Lowe",
title = "Perceptual Organization and Visual Recognition",
type = "Technical Report",
number = "STAN-CS-84-1020",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "152",
month = sep,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kunz:1984:UAI,
author = "John C. Kunz",
title = "Use of Artificial Intelligence and Simple
Mathematics",
type = "Technical Report",
number = "STAN-CS-84-1021",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "182",
month = jul,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Konolige:1984:DMB,
author = "Kurt Konolige",
title = "A Deduction Model of Belief and its Logics",
type = "Technical Report",
number = "STAN-CS-84-1022",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "312",
month = aug,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gordon:1984:MME,
author = "Jean Gordon and Edward H. Shortliffe",
title = "A method for managing evidential reasoning in a
hierarchical hypothesis space",
type = "Technical Report",
number = "STAN-CS-84-1023",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = sep,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1023.html",
abstract = "No abstract.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1023",
}
@TechReport{Upfal:1984:HSM,
author = "Eli Upfal and Avi Wigderson",
title = "How to Share Memory in a Distributed System",
type = "Technical Report",
number = "STAN-CS-84-1024",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = oct,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1024.html",
abstract = "We study the power of shared-memory in models of
parallel computation. We describe a novel distributed
data structure that eliminates the need for shared
memory without significantly increasing the run time of
the parallel computation. More specifically we show how
a complete network of processors can deterministically
simulate one PRAM step in O(log n $ {(loglog n)}^2$)
time, when both models use n processors, and the size
of the PRAM's shared memory is polynomial in n. (The
best previously known upper bound was the trivial
O(n)). We also establish that this upper bound is
nearly optimal. We prove that an on-line simulation of
T PRAM steps by a complete network of processors
requires $ \Omega (T \log n / \log \log n)$ time. A
simple consequence of the upper bound is that an
Ultracomputer (the only currently feasible general
purpose parallel machine), can simulate one step of a
PRAM (the most convenient parallel model to program),
in $ O({(log n loglog n)}^2) $ steps.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1024",
}
@TechReport{Helmbold:1984:FSA,
author = "David Helmbold and Ernst Mayr",
title = "Fast Scheduling Algorithms on Parallel Computers",
type = "Technical Report",
number = "STAN-CS-84-1025",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = nov,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1025.html",
abstract = "With the introduction of parallel processing,
scheduling problems have generated great interest.
Although there are good sequential algorithms for many
scheduling problems, there are few fast parallel
scheduling algorithms. In this paper we present several
good scheduling algorithms that run on EREW PRAMS. For
the unit time execution case, we have algorithms that
will schedule n jobs with intree or outtree precedence
constraints in O(log n) time. The intree algorithm
requires $ n^3 $ processors, and the outtree algorithm
requires $ n^4 $ processors. Another type of scheduling
problem is list scheduling, where a list of n jobs with
integer execution times is to be scheduled in list
order. We show that the general list scheduling problem
on two identical processors is polynomial-time
complete, and therefore is not likely to have a fast
parallel algorithm. However, when the length of the
(binary representation of the) execution times is
bounded by $ O(\log^c n) $ there is an NC algorithm
using $ n^4 $ processors.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1025",
}
@TechReport{Chapiro:1984:GAL,
author = "Daniel M. Chapiro",
title = "Globally-Asynchronous Locally-Synchronous Systems",
type = "Technical Report",
number = "STAN-CS-84-1026",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "136",
month = nov,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1984:TTT,
author = "Donald E. Knuth",
title = "A torture test for {\TeX}",
type = "Technical Report",
number = "STAN-CS-84-1027",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 142",
month = nov,
year = "1984",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1027.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-84-1027",
abstract = "Programs that claim to be implementations of {\TeX82}
are supposed to be able to process the test routine
contained in this report, producing the outputs
contained in this report.",
acknowledgement = ack-nhfb # "\slash " # ack-hk,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-84-1027",
pdfpages = "146",
xxnumber = "CS-TR-84-1027",
}
@TechReport{Hochschild:1984:PGA,
author = "Peter H. Hochschild and Ernst W. Mayr and Alan R.
Siegel",
title = "Parallel Graph Algorithms",
type = "Technical Report",
number = "STAN-CS-84-1028",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "57",
month = dec,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1028.html",
abstract = "This paper presents new paradigms to solve efficiently
a variety of graph problems on parallel machines. These
paradigms make it possible to discover and exploit the
``parallelism'' inherent in many classical graph
problems. We abandon attempts to force sequential
algorithms into parallel environments for such attempts
usually result in transforming a good uniprocessor
algorithm into a hopelessly greedy parallel algorithm.
We show that by employing more local computation and
mild redundance, a variety of problems can be solved in
a resource- and time-efficient manner on a variety of
architectures.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1028",
}
@TechReport{Dietterich:1984:CPT,
author = "Thomas G. Dietterich",
title = "Constraint Propagation Techniques for Theory-Driven
Data Interpretation",
type = "Technical Report",
number = "STAN-CS-84-1030",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "180",
month = dec,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cooper:1984:NCB,
author = "Gregory F. Cooper",
title = "{NESTOR}: a Computer-Based Medical Diagnostic Aid that
Integrates Causal and Probabilistic Knowledge",
type = "Technical Report",
number = "STAN-CS-84-1031",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "251",
month = dec,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Genesereth:1984:SPD,
author = "Michael R. Genesereth and Matthew L. Ginsberg and
Jeffrey S. Rosenschein",
title = "Solving the {Prisoner's Dilemma}",
type = "Technical Report",
number = "STAN-CS-84-1032",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = nov,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1032.html",
abstract = "A framework is proposed for analyzing various types of
rational interaction. We consider a variety of
restrictions of participants' moves; each leads to a
different characterization of rational behavior. Under
an assumption of ``common rationality,'' it is proven
that participants will cooperate, rather than defect,
in the Prisoner's Dilemma.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1032",
}
@TechReport{Gischer:1984:POA,
author = "Jay L. Gischer",
title = "Partial Orders and the Axiomatic Theory of Shuffle",
type = "Technical Report",
number = "STAN-CS-84-1033",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = dec,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hayes-Roth:1984:BAB,
author = "Barbara Hayes-Roth",
title = "{BB1}: an architecture for blackboard systems that
control, explain, and learn about their own behavior",
type = "Technical Report",
number = "STAN-CS-84-1034",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1984",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-84-1034.html",
abstract = "BB1 implements a domain-independent ``blackboard
control architecture'' for Al systems that control,
explain, and learn about their own problem-solving
behavior. A BB1 system comprises: a user-defined domain
blackboard, a pre-defined control blackboard,
user-defined domain and control knowledge sources, a
few generic control knowledge sources, and a
pre-defined basic control loop. The architecture's run
time user interface provides capabilities for:
displaying the blackboard, knowledge sources, and
pending knowledge source actions, recommending an
action for execution, explaining a recommendation,
accepting a user's override, executing a designated
action, and running without user intervention. BB1
supports a variety of control behavior ranging from
execution of pre-defined control procedures to dynamic
construction and modification of complex control plans
during problem solving. It explains problem-solving
actions by showing their roles in the underlying
control plan. It learns new control heuristics from
experience, applies them within the current
problem-solving session, and uses them to construct new
control plans in subsequent sessions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-84-1034",
}
@TechReport{Ullman:1984:CFW,
author = "Jeffrey Ullman and Harry Mairson and Danny Dolev and
David Maier",
title = "Correcting Faults in Write-Once Memory",
type = "Technical Report",
number = "STAN-CS-84-999",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "5",
month = jan,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ginsberg:1984:C,
author = "Matthew L. Ginsberg",
title = "Counterfactuals",
type = "Technical Report",
number = "STAN-CS-85-1029",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = dec,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gardner:1984:AIA,
author = "Anne von der Leith Gardner",
title = "An Artificial Intelligence Approach to Legal
Reasoning",
type = "Technical Report",
number = "STAN-CS-85-1045",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "205",
month = jun,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Apers:1983:TCS,
author = "Peter M. G. Apers and Gio Wiederhold",
title = "Transaction Classification to Survive a Network
Partition",
type = "Technical Report",
number = "STAN-CS-85-1053",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 24",
month = aug,
year = "1983",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1053/CS-TR-85-1053.pdf;
http://www-db.stanford.edu/TR/CS-TR-85-1053.html",
abstract = "When comparing centralized and distributed databases
one of the advantages of distributed databases is said
to be the greater availability of the data.
Availability is defined as having access to the stored
data for update and retrieval, even when some
distributed sites are down due to hardware failures. We
will investigate the functioning of a distributed
database of which the underlying computer network may
fail. A classification of transactions is given to
allow an implementation of different levels of
operatability. Some transactions can be guaranteed to
commit in spite of a network partition, while others
have to wait until the state of potential transactions
in the other partitions is also known. An algorithm is
given to compute a classification. Based on historics
of transactions kept in the different partitions a
merge of histories is computed, generating the new
values for some data items when communication is
re-established. The algorithm to compute the merge of
the histories makes use of a knowledge base containing
knowledge about the transactions, to decide whether to
merge, delete, or delay a transaction.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-85-1053",
}
@TechReport{Ossher:1984:NPS,
author = "Harold L. Ossher",
title = "A New Program Structuring Mechanism Based on Layered
Graphs",
type = "Technical Report",
number = "STAN-CS-85-1078",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "247",
month = dec,
year = "1984",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hayes-Roth:1985:BAB,
author = "Barbara Hayes-Roth",
title = "{BB1}: an architecture for blackboard systems that
control and explain, and learn about their own
behavior",
type = "Technical Report",
number = "STAN-CS-85-1034",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = jan,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Finger:1985:RDA,
author = "J. J. Finger and Michael R. Genesereth",
title = "{RESIDUE}: a Deductive Approach to Design Synthesis",
type = "Technical Report",
number = "STAN-CS-85-1035",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1035.html",
abstract = "We present a new approach to deductive design
synthesis, the Residue Approach, in which designs are
represented as sets of constraints. Previous
approaches, such as PROLOG [18] or the work of Manna
and Waldinger [11], express designs as bindings on
single terms. We give a complete and sound procedure
for finding sets of propositions constituting a legal
design. The size of the search space of the procedure
and the advantages and disadvantages of the Residue
Approach are analysed. In particular we show how
Residue can avoid backtracking caused by making design
decisions of overly coarse granularity. In contrast, it
is awkward for the single term approaches to do the
same. In addition we give a rule for constraint
propagation in deductive synthesis, and show its use in
pruning the design space. Finally, Residue is related
to other work, in particular, to Default Logic [16] and
to Assumption-Based Truth Maintenance [1].",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1035",
}
@TechReport{Hayes-Roth:1985:LCH,
author = "Barbara Hayes-Roth and Michael Hewett",
title = "Learning Control Heuristics in {BB1}",
type = "Technical Report",
number = "STAN-CS-85-1036",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1036.html",
abstract = "BB1, a blackboard system building architecture,
ameliorates the knowledge acquisition bottleneck with
generic knowledge sources that learn control
heuristics. Some learning knowledge sources replace the
knowledge engineer, interacting directly with domain
experts. Others operate autonomously. The paper
presents a trace from the illustrative knowledge
source. Understand-Preference, running in PROTEAN, a
blackboard system for elucidating protein structure.
Understand-Preference is triggered when a domain expert
overrides one of BB1's scheduling recommendations. It
identifies and encodes the heuristic underlying the
expert's scheduling decision. The trace illustrates how
learning knowledge sources exploit BB1's rich
representation of domain and control knowledge,
actions, and results.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1036",
}
@TechReport{MacKinlay:1985:ELC,
author = "Jock MacKinlay and Michael R. Genesereth",
title = "Expressiveness and Language Choice",
type = "Technical Report",
number = "STAN-CS-85-1037",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1037.html",
abstract = "Specialized languages are often more appropriate than
general languages for expressing certain information.
However, specialized languages must be chosen carefully
because they do not allow all sets of facts to be
stated. This paper considers the problems associated
with choosing among specialized languages. Methods are
presented for determining that a set of facts is
expressible in a language, for identifying when
additional facts are stated accidentally, and for
choosing among languages that can express a set of
facts. This research is being used to build a system
that automatically chooses an appropriate graphical
language to present a given set of facts.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1037",
}
@TechReport{Yao:1985:UHO,
author = "Andrew C. Yao",
title = "Uniform Hashing Is Optimal",
type = "Technical Report",
number = "STAN-CS-85-1038",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1038.html",
abstract = "It was conjectured by J. Ullman that uniform hashing
is optimal in its expected retrieval cost among all
open-address hashing schemes (JACM {\bf 19} (1972),
569--575). In this paper we show that, for any
open-address hashing scheme, the expected cost of
retrieving a record from a large table which is $
\alpha $-fraction full is at least $ 1 / \alpha \log 1
/ (1 - \alpha) + o(1)$. This proves Ullman's conjecture
to be true in the asymptotic sense.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1038",
}
@TechReport{Feigenbaum:1985:PTA,
author = "Joan Feigenbaum and John Hershberger and Alejandro A.
Schaffer",
title = "A Polynomial Time Algorithm for Finding the Prime
Factors of Cartesian Product Graphs",
type = "Technical Report",
number = "STAN-CS-85-1039",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jan,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Keller:1985:URD,
author = "Arthur M. Keller",
title = "Updating Relational Databases through Views",
type = "Technical Report",
number = "STAN-CS-85-1040",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "119",
month = feb,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Blicher:1985:EDG,
author = "A. Peter Blicher",
title = "Edge Detection and Geometric Methods in Computer
Vision",
type = "Technical Report",
number = "STAN-CS-85-1041",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "266",
month = feb,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rosenschein:1985:DAR,
author = "Jeffrey S. Rosenschein and Michael R. Genesereth",
title = "Deals Among Rational Agents",
type = "Technical Report",
number = "STAN-CS-85-1042",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = mar,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Karp:1985:CPM,
author = "Richard M. Karp and Eli Upfal and Avi Wigderson",
title = "Constructing a Perfect Matching is in Random {NC}",
type = "Technical Report",
number = "STAN-CS-85-1043",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = mar,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1043.html",
abstract = "We show that the problem of constructing a perfect
matching in a graph is in the complexity class Random
NC: i.e., the problem is solvable in polylog time by a
randomized parallel algorithm using a
polynomial-bounded number of processors. We also show
that several related problems lie in Random NC. These
include: (i) Constructing a perfect matching of maximum
weight in a graph whose edge weights are given in unary
notation; (ii) Constructing a maximum-cardinality
matching; (iii) Constructing a matching covering a set
of vertices of maximum weight in a graph whose vertex
weights are given in binary; (iv) Constructing a
maximum s-t flow in a directed graph whose edge weights
are given in unary.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1043",
}
@TechReport{Manna:1985:OBS,
author = "Zohar Manna and Richard Waldinger",
title = "The Origins of the Binary-Search Paradigm",
type = "Technical Report",
number = "STAN-CS-85-1044",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = mar,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ullman:1985:TAT,
author = "Jeffrey D. Ullman and Allen {Van Gelder}",
title = "Testing Applicability of Top-Down Capture Rules",
type = "Technical Report",
number = "STAN-CS-85-1046",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = apr,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hobby:1985:SEC,
author = "John D. Hobby",
title = "Smooth, Easy to Compute Interpolating Splines",
type = "Technical Report",
number = "STAN-CS-85-1047",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 14",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1047/CS-TR-85-1047.pdf;
http://www-db.stanford.edu/TR/CS-TR-85-1047.html",
abstract = "We present a system of interpolating splines with
first and approximate second order geometric
continuity. The curves are easily computed in linear
time by solving a system of linear equations without
the need to resort to any kind of successive
approximation scheme. Emphasis is placed on the need to
find aesthetically pleasing curves in a wide range of
circumstances; favorable results are obtained even when
the knots are very unequally spaced or widely
separated. The curves are invariant under scaling,
rotation, and reflection, and the effects of a local
change fall off exponentially as one moves away from
the disturbed knot.\par
Approximate second order continuity is achieved by
using a linear ``mock curvature'' function in place of
the actual endpoint curvature for each spline segment
and choosing tangent directions at knots so as to
equalize these. This avoids extraneous solutions and
other forms of undesirable behavior without seriously
compromising the quality of the results.\par
The actual spline segments can come from any family of
curves whose endpoint curvatures can be suitably
approximated, but we propose a specific family of
parametric cubics. There is freedom to allow tangent
directions and ``tension'' parameters to be specified
at knots, and special ``curl'' parameters may be given
for additional control near the endpoints of open
curves.",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-85-1047",
}
@TechReport{Pratt:1985:SCO,
author = "Vaughan Pratt",
title = "Some constructions for order-theoretic models of
concurrency",
type = "Technical Report",
number = "STAN-CS-85-1048",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = mar,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1048.html",
abstract = "We give ``tight'' and ``loose'' constructions suitable
for specifying processes represented as sets of pomsets
(partially ordered multisets). The tight construction
is suitable for specifying ``primitive'' processes; it
introduces the dual notions of concurrence and
orthocurrence. The loose construction specifies a
process in terms of a net of communicating
subprocesses; it introduces the notion of a utilization
embedding a process in a net.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1048",
}
@TechReport{Pratt:1985:PMP,
author = "Vaughan Pratt",
title = "The {Pomset} Model of Parallel Processes: Unifying the
Temporal and the Special",
type = "Technical Report",
number = "STAN-CS-85-1049",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jan,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1049.html",
abstract = "No abstract.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1049",
}
@TechReport{Hershberger:1985:FSA,
author = "John Hershberger and Ernst Mayr",
title = "Fast sequential algorithms to find shuffle-minimizing
and shortest paths in a shuffle-exchange network",
type = "Technical Report",
number = "STAN-CS-85-1050",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = may,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1050.html",
abstract = "This paper analyzes the problem of finding shortest
paths and shuffle-minimizing paths in an n-node
shuffle-exchange network, where $ n = 2^m $. Such paths
have the properties needed by the Valiant--Brebner
permutation routing algorithm, unlike the trivial $ (m
1) $-shuffle paths usually used for shuffle-exchange
routing. The Valiant--Brebner algorithm requires n
simultaneous route computations, one for each packet to
be routed, which can be done in parallel. We give fast
sequential algorithms for both problems we consider.
Restricting the shortest path problem to allow only
paths that use fewer than m shuffles provides intuition
applicable to the general problem. Linear-time pattern
matching techniques solve part of the restricted
problem; as a consequence, a path using fewest shuffles
can be found in $ O(m) $ time, which is optimal up to a
constant factor. The shortest path problem is
equivalent to the problem of finding the Hamming
distances between a bitstring and all shifted instances
of another. An application of the fast Fourier
transform solves this problem and the shortest path
problem in $ O(m \log m) $ time.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1050",
}
@TechReport{Manna:1985:SRA,
author = "Zohar Manna and Richard Waldinger",
title = "Special Relations in Automated Deduction",
type = "Technical Report",
number = "STAN-CS-85-1051",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "63",
month = may,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1051.html",
abstract = "Two deduction rules are introduced to give streamlined
treatment to relations of special importance in an
automated theorem-proving system. These rules, the
relation replacement and relation matching rules,
generalize to an arbitrary binary relation the
paramodulation and E-resolution rules, respectively,
for equality, and may operate within a nonclausal or
clausal system. The new rules depend on an extension of
the notion of polarity to apply to subterms as well as
to subsentences, with respect to a given binary
relation. The rules allow us to eliminate troublesome
axioms, such as transitivity and monotonicity, from the
system; proofs are shorter and more comprehensible, and
the search space is correspondingly deflated.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1051",
}
@TechReport{Tajnai:1985:FSV,
author = "Carolyn E. Tajnai and Fred Terman",
title = "the Father of Silicon Valley",
type = "Technical Report",
number = "STAN-CS-85-1052",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = may,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Broder:1985:WRM,
author = "Andrei Zary Broder",
title = "Weighted Random Mappings; Properties and
Applications",
type = "Technical Report",
number = "STAN-CS-85-1054",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "77",
month = may,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Haddad:1985:PPS,
author = "Ramsey W. Haddad and Donald E. Knuth",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-85-1055",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 103",
day = "1",
month = jun,
year = "1985",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1055.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-85-1055",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS204, Problem
Seminar, during winter quarter 1985. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms were touched on during the
discussions, these notes may be of interest to graduate
students of computer science at other universities, as
well as to their professors and to professional people
in the ``real world.''\par
The present report is the sixth in a series of such
transcripts, continuing the tradition established in
STAN-CS-77-606 (Michael J. Clancy, 1977),
STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
(Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-85-1055",
pdfpages = "108",
xxnumber = "CS-TR-85-1055",
}
@TechReport{Abadi:1985:NTD,
author = "Martin Abadi and Zohar Manna",
title = "Nonclausal Temporal Deduction",
type = "Technical Report",
number = "STAN-CS-85-1056",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 17",
month = jun,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1056.html",
abstract = "We present a proof system for propositional temporal
logic. This system is based on nonclausal resolution;
proofs are natural and generally short. Its extension
to first-order temporal logic is considered. Two
variants of the system are described. The first one is
for a logic with $ \Box $ (''always''), $ \Diamond $
(''sometime''), and $ \bigcirc $ (''next''). The second
variant is an extension of the first one to a logic
with the additional operators U (''until'') and P
(''precedes''). Each of these variants is proved
complete.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-85-1056",
}
@TechReport{Mason:1985:MEP,
author = "Ian A. Mason and Carolyn L. Talcott",
title = "Memories of {S}-expressions Proving properties of
{Lisp}-like programs that destructively alter memory",
type = "Technical Report",
number = "STAN-CS-85-1057",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = jun,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Cheriton:1985:HGM,
author = "David R. Cheriton and Stephen E. Deering",
title = "Host groups: a multicast extension for datagram
internetworks",
type = "Technical Report",
number = "STAN-CS-85-1058",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 8",
month = jul,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1058.html",
abstract = "The extensive use of local networks is beginning to
drive requirements for internetwork facilities that
connect these local networks. In particular, the
availability of multicast addressing in many local
networks and its use by sophisticated distributed
applications motivates providing multicast across
internetworks. In this paper, we propose a model of
service for multicast in an internetwork, describe how
this service can be used, and describe aspects of its
implementation, including how it would fit into one
existing internetwork architecture, namely the US DoD
Internet Architecture.",
acknowledgement = ack-nhfb,
pdfpages = "9",
xxnumber = "CS-TR-85-1058",
}
@TechReport{Trickey:1985:CPP,
author = "Howard Wellington Trickey",
title = "Compiling {Pascal} Programs into Silicon",
type = "Technical Report",
number = "STAN-CS-85-1059",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "x + 184",
month = jul,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
abstract = "The hardware design process is ripe for the same kind
of aid that software compilers give to software
development. This thesis describes a ``silicon
compiler'' called Flamel. It operates on higher level
specifications than other such compilers. Specifically,
ordinary Pascal programs are used to define the
behavior required of the chip. Flamel undertakes to
find parallelism in the program, so it can produce a
fast-running implementation if there is sufficient
silicon area available.\par
The basic method is to manipulate a dataflow-like
representation of the various computations to be
performed, trying to reduce the estimated running time
of the chip while obeying a user-supplied constraint on
the chip area. A new algorithm for expression height
reduction has been developed to work on the types of
graphs that arise in this application. Expression
height reduction works best on large expressions, and
such expressions can be formed by unrolling the loops
and merging the ``then'' and ``else'' computations of
an ``if'' statement. Flamel has a method for deciding
how much of this sort of thing to do, again controlled
by the area constraint.\par
An implementation of Flamel has been completed. The
output is a description of a datapath and a controller,
at a sufficient level of detail that good area and
execution time figures can be estimated. On a series of
tests, Flamel produces implementations of programs that
would run 22 to 200 times faster than an MC68000
running the same programs, if the clock cycles were the
same. The tests also show that a wide range of
time-area tradeoffs are produced by varying the area
constraint",
acknowledgement = ack-nhfb,
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Talcott:1985:ERT,
author = "Carolyn L. Talcott",
title = "The Essence of {Rum}: a theory of the Intensional and
Extensional Aspects of {Lisp}-like Computation",
type = "Technical Report",
number = "STAN-CS-85-1060",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "249",
month = aug,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1985:TP,
author = "Donald E. Knuth",
title = "Theory and Practice",
type = "Technical Report",
number = "STAN-CS-85-1061",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
month = aug,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Keller:1985:CSC,
author = "Arthur M. Keller",
title = "Computer Science comprehensive examinations,
1981\slash 82--1984\slash 85",
type = "Technical Report",
number = "STAN-CS-85-1062",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "294",
month = aug,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1062.html",
abstract = "This report is a collection of the eight comprehensive
examinations from Winter 1982 through Spring 1985
prepared by the faculty and students of Stanford's
Computer Science Department together with solutions to
the problems posed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1062",
}
@TechReport{Smith:1985:CRI,
author = "David Smith and Michael Genesereth and Matthew
Ginsberg",
title = "Controlling Recursive Inference",
type = "Technical Report",
number = "STAN-CS-85-1063",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "58",
month = jun,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ginsberg:1985:DP,
author = "Matthew L. Ginsberg",
title = "Decision Procedures",
type = "Technical Report",
number = "STAN-CS-85-1064",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = may,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1985:RSC,
author = "William J. Clancey",
title = "Review of {Sowa}'s ``{{\booktitle{Conceptual
Structures}}}''",
type = "Technical Report",
number = "STAN-CS-85-1065",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = mar,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1065.html",
abstract = "''Conceptual Structures'' is a bold, provocative
synthesis of logic, linguistics, and Artificial
Intelligence research. At the very least, Sowa has
provided a clean, well-grounded notation for knowledge
representation that many researchers will want to
emulate and build upon. At its best, Sowa's notation
and proofs hint at what a future Principia Mathematica
of knowledge and reasoning may look like. No other AI
text achieves so much in breadth, style, and
mathematical precision. This is a book that everyone in
AI and cognitive science should know about, and that
experienced researchers will profit from studying in
some detail.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1065",
}
@TechReport{Clancey:1985:HC,
author = "William J. Clancey",
title = "Heuristic Classification",
type = "Technical Report",
number = "STAN-CS-85-1066",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "86",
month = jun,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1066.html",
abstract = "A broad range of well-structured problems--embracing
forms of diagnosis, catalog selection, and skeletal
planning--are solved in ``expert systems'' by the
method of heuristic classification. These programs have
a characteristic inference structure that
systematically relates data to a pre-enumerated set of
solutions by abstraction, heuristic association, and
refinement. In contrast with previous descriptions of
classification reasoning, particularly in psychology,
this analysis emphasizes the role of a heuristic in
routine problem solving as a non-hierarchical, direct
association between concepts. In contrast with other
descriptions of expert systems, this analysis specifies
the knowledge needed to solve a problem, independent of
its representation in a particular computer language.
The heuristic classification problem-solving model
provides a useful framework for characterizing kinds of
problems, for designing representation tools, and for
understanding non-classification (constructive)
problem-solving methods.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1066",
}
@TechReport{Clancey:1985:ARE,
author = "William J. Clancey",
title = "Acquiring, representing, and evaluating a competence
model of diagnostic strategy",
type = "Technical Report",
number = "STAN-CS-85-1067",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "94",
month = aug,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1067.html",
abstract = "NEOMYCIN is a computer program that models one
physician's diagnostic reasoning within a limited area
of medicine. NEOMYCIN's diagnostic procedure is
represented in a well-structured way, separately from
the domain knowledge it operates upon. We are testing
the hypothesis that such a procedure can be used to
simulate both expert problem-solving behavior and a
good teacher's explanations of reasoning. The model is
acquired by protocol analysis, using a framework that
separates an expert's causal explanations of evidence
from his descriptions of knowledge relations and
strategies. The model is represented by a procedural
network of goals and rules that are stated in terms of
the effect the problem solver is trying to have on his
evolving model of the world. The model is evaluated for
sufficiency by testing it in different settings
requiring expertise, such as providing advice and
teaching. The model is evaluated for plausibility by
arguing that the constraints implicit in the diagnostic
procedure are imposed by the task domain and human
computational capability. This paper discusses
NEOMYCIN's diagnostic procedure in detail, viewing it
as a memory aid, as a set of operators, as
proceduralized constraints, and as a grammar. This
study provides new perspectives on the nature of
``knowledge compilation'' and how an expert-teacher's
explanations relate to a working program.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1067",
}
@TechReport{Richer:1985:GWG,
author = "Mark H. Richer and William J. Clancey",
title = "{GUIDON-WATCH}: a graphic interface for viewing a
knowledge-based system",
type = "Technical Report",
number = "STAN-CS-85-1068",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "v + 33",
month = aug,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1068.html",
abstract = "This paper describes GUIDON-WATCH, a graphic interface
that uses multiple windows and a mouse to allow a
student to browse a knowledge base and view reasoning
processes during diagnostic problem solving. Methods
are presented for providing multiple views of
hierarchical structures, overlaying results of a search
process on top of static structures to make the
strategy visible, and graphically expressing evidence
relations between findings and hypotheses. This work
demonstrates the advantages of stating a diagnostic
search procedure in a well-structured, rule-based
language, separate from domain knowledge. A number of
issues in software design are also considered,
including the automatic management of a multiple-window
display.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-85-1068",
}
@TechReport{Kuper:1985:LDM,
author = "Gabriel M. Kuper",
title = "The Logical Data Model: a New Approach to Database
Logic",
type = "Technical Report",
number = "STAN-CS-85-1069",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "107",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hobby:1985:DBT,
author = "John D. Hobby",
title = "Digitized Brush Trajectories",
type = "Technical Report",
number = "STAN-CS-85-1070",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "125",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://searchworks.stanford.edu/view/1181669",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Greiner:1985:LUA,
author = "Russell Greiner",
title = "Learning by Understanding Analogies",
type = "Technical Report",
number = "STAN-CS-85-1071",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "423",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Mayr:1985:PPS,
author = "Ernst W. Mayr and Richard J. Anderson and Peter H.
Hochschild",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-85-1072",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "68",
month = oct,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1072.html",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS204, Problem
Seminar, during winter quarter 1984. The course topics
consisted of five problems coming from different areas
of computer science. The problems were discussed in
class and solved and programmed by the students working
in teams.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1072",
}
@TechReport{Hochschild:1985:REP,
author = "Peter H. Hochschild",
title = "Resource-Efficient Parallel Algorithms",
type = "Technical Report",
number = "STAN-CS-85-1073",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "90",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Southall:1985:DNT,
author = "Richard Southall",
title = "Designing New Typefaces with {Metafont}",
type = "Technical Report",
number = "STAN-CS-85-1074",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 37",
month = sep,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/85/1074/CS-TR-85-1074.pdf;
http://www-db.stanford.edu/TR/CS-TR-85-1074.html",
abstract = "The report discusses issues associated with the
symbolic design of new typefaces using programming
languages such as Metafont. A consistent terminology
for the subject area is presented. A schema for type
production systems is described that lays stress on the
importance of communication between the designer of a
new typeface and the producer of the fonts that embody
it. The methods used for the design of printers' type
from the sixteenth century to the present day are
surveyed in the context of this schema. The differences
in the designer's task in symbolic and graphic design
modes are discussed. A new typeface design made with
Metafont is presented, and the usefulness of Metafont
as a tool for making new designs considered.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1074",
}
@TechReport{Buchanan:1985:ESWa,
author = "Bruce G. Buchanan",
title = "Expert systems: Working Systems and the Research
Literature",
type = "Technical Report",
number = "STAN-CS-85-1075",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = oct,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1075.html",
abstract = "Expert systems are the subject of considerable
interest among persons in AI research or applications.
There is no single definition of an expert system, and
thus no precisely defined set of programs or set of
literature references that represent work on expert
systems. This report provides (a) a characterization of
what an expert systems is, (b) a list of expert systems
in routine use or field testing, and (c) a list of
relevant references in the AI research literature.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1075",
}
@TechReport{Buchanan:1985:SAK,
author = "Bruce G. Buchanan",
title = "Some Approaches to Knowledge Acquisition",
type = "Technical Report",
number = "STAN-CS-85-1076",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jul,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "This paper is superseded by STAN-CS-86-1094
\cite{Buchanan:1985:ESWb}.",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1076.html",
abstract = "Knowledge acquisition is not a single, monolithic
problem for AI. There are many ways to approach the
topic in order to understand issues and design useful
tools for constructing knowledge-based systems. Several
of those approaches are being explored in the Knowledge
Systems Laboratory (KSL) at Stanford.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1076",
}
@TechReport{McCarthy:1985:ACF,
author = "John McCarthy",
title = "Applications of Circumscription to Formalizing Common
Sense Knowledge",
type = "Technical Report",
number = "STAN-CS-85-1077",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "John McCarthy (4 September 1927--24 October 2011)",
}
@TechReport{Helmbold:1985:TPS,
author = "David Helmbold and Ernst Mayr",
title = "Two-Processor Scheduling is in {NC}",
type = "Technical Report",
number = "STAN-CS-85-1079",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = oct,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1079.html",
abstract = "We present a parallel algorithm for the two processor
scheduling problem. This algorithm constructs an
optimal schedule for unit execution time task systems
with arbitrary precedence constraints using a
polynomial number of processors and running in time
polylog in the size of the input. Whereas previous
parallel solutions for the problem made extensive use
of randomization, our algorithm is completely
deterministic and based on an interesting decomposition
technique. And it is of independent relevance for two
more reasons. It provides another example for the
apparent difference in complexity between decision and
search problems in the context of fast parallel
computation, and it gives an NC-algorithm for the
matching problem in certain restricted cases.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1079",
}
@TechReport{Russell:1985:CGM,
author = "Stuart Russell",
title = "The Compleat Guide to {MRS}",
type = "Technical Report",
number = "STAN-CS-85-1080",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "126",
month = jun,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1080.html",
abstract = "MRS is a logic programming system with extensive
meta-level facilities. As such it can be used to
implement virtually all kinds of artificial
intelligence applications in a wide variety of
architectures. This guide is intended to be a
comprehensive text and reference for MRS. It also
attempts to explain the foundations of the logic
programming approach from the ground up, and it is
hoped that it will thus provide access, even for the
uninitiated, to all the benefits of AI methods. The
only prerequisites for understanding MRS are a passing
acquaintance with LISP and an open mind.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1080",
}
@TechReport{Rosenschein:1985:RIC,
author = "Jeffrey Solomon Rosenschein",
title = "Rational Interaction: Cooperation among Intelligent
Agents",
type = "Technical Report",
number = "STAN-CS-85-1081",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "133",
month = oct,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Nowicki:1985:PFD,
author = "William I. Nowicki",
title = "Partitioning of Function in a Distributed Graphics
System",
type = "Technical Report",
number = "STAN-CS-85-1082",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
month = mar,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Zwaenepoel:1985:MPL,
author = "Willy Zwaenepoel",
title = "Message Passing on a Local Network",
type = "Technical Report",
number = "STAN-CS-85-1083",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "112",
month = oct,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Edighoffer:1985:TDB,
author = "Judy L. Edighoffer and Keith A. Lantz",
title = "{Taliesin}: a Distributed Bulletin Board System",
type = "Technical Report",
number = "STAN-CS-85-1084",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = sep,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1084.html",
abstract = "This paper describes a computer bulletin board
facility intended to support replicated bulletin boards
on a network that may frequently be in a state of
partition. The two major design issues covered are the
choice of a name space and the choice of replication
algorithms. The impact of the name space on
communication costs is explained. A special purpose
replication algorithm that provides high availability
and response despite network partition is introduced.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1084",
}
@TechReport{Lantz:1985:TUD,
author = "Keith A. Lantz and Judy L. Edighoffer and Bruce L.
Hitson",
title = "Towards a Universal Directory Service",
type = "Technical Report",
number = "STAN-CS-85-1086",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = aug,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1086.html",
abstract = "Directory services and name servers have been
discussed and implemented for a number of distributed
systems. Most have been tightly interwoven with the
particular distributed systems of which they are a
part; a few are more general in nature. In this paper
we survey recent work in this area and discuss the
advantages and disadvantages of a number of approaches.
From this, we are able to extract some fundamental
requirements of a naming system capable of handling a
wide variety of object types in a heterogeneous
environment. We outline how these requirements can be
met in a universal directory service.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1086",
}
@TechReport{Theimer:1985:PRE,
author = "Marvin M. Theimer and Keith A. Lantz and David R.
Cheriton",
title = "Preemptable remote execution facilities for the
{V}-system",
type = "Technical Report",
number = "STAN-CS-85-1087",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = sep,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-85-1087.html",
abstract = "A remote execution facility allows a user of a
workstation-based distributed system to offload
programs onto idle workstations, thereby providing the
user with access to computational resources beyond that
provided by his personal workstation. In this paper, we
describe the design and performance of the remote
execution facility in the V distributed system, as well
as several implementation issues of interest. In
particular, we focus on network transparency of the
execution environment, preemption and migration of
remotely executed programs, and avoidance of residual
dependencies on the original host. We argue that
preemptable remote execution allows idle workstations
to be used as a ``pool of processors'' without
interfering with use by their owners and without
significant overhead for the normal execution of
programs. In general, we conclude that the cost of
providing preemption is modest compared to providing a
similar amount of computation service by dedicated
``computation engines''.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-85-1087",
}
@TechReport{VanGelder:1985:MPF,
author = "Allen {Van Gelder}",
title = "A Message Passing Framework for Logical Query
Evaluation",
type = "Technical Report",
number = "STAN-CS-85-1088",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = dec,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ullman:1985:PCL,
author = "Jeffrey D. Ullman and Allen {Van Gelder}",
title = "Parallel Complexity of Logical Query Programs",
type = "Technical Report",
number = "STAN-CS-85-1089",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = dec,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Yue:1985:CAS,
author = "Kaizhi Yue",
title = "Constructing and Analyzing Specifications of Real
World Systems",
type = "Technical Report",
number = "STAN-CS-86-1090",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "290",
month = sep,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Fu:1985:LOL,
author = "Li-Min Fu",
title = "Learning Object-Level and Meta-Level Knowledge in
Expert Systems",
type = "Technical Report",
number = "STAN-CS-86-1091",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "229",
month = nov,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Anderson:1985:CPA,
author = "Richard Anderson",
title = "The Complexity of Parallel Algorithms",
type = "Technical Report",
number = "STAN-CS-86-1092",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "72",
month = nov,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Subramanian:1985:GRL,
author = "Devika Subramanian and Bruce G. Buchanan",
title = "A General Reading List for Artificial Intelligence",
type = "Technical Report",
number = "STAN-CS-86-1093",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "66",
month = dec,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1093.html",
abstract = "This reading list is based on the syllabus for the
course CS229b offered in Winter 1985. This course was
an intensive 10 week survey intended as preparation for
the 1984-85 qualifying examination in Artificial
Intelligence at Stanford University.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1093",
}
@TechReport{Buchanan:1985:ESWb,
author = "Bruce G. Buchanan",
title = "Expert Systems: Working Systems and the Research
Literature",
type = "Technical Report",
number = "STAN-CS-86-1094",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "57",
month = dec,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1094.html",
abstract = "Many expert systems have moved out of development
laboratories into field test and routine use. About
sixty such systems are listed. Academic research
laboratories are contributing manpower to fuel the
commercial development of AI. But the quantity of AI
research may decline as a result unless the applied
systems are experimented with and analyzed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1094",
}
@TechReport{Malik:1985:ILD,
author = "Jitendra Malik",
title = "Interpreting Line Drawings of Curved Objects",
type = "Technical Report",
number = "STAN-CS-86-1099",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "138",
month = dec,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Malachi:1985:TNA,
author = "Yonathan Malachi and Zohar Manna and Richard
Waldinger",
title = "{Tablog} --- a New Approach to Logic Programming",
type = "Technical Report",
number = "STAN-CS-86-1110",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = mar,
year = "1985",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Fu:1985:IKA,
author = "Li-Min Fu and Bruce G. Buchanan",
title = "Inductive knowledge acquisition for rule-based expert
systems",
type = "Technical Report",
number = "STAN-CS-86-1116 (KSL-85-42)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = oct,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1116.html",
abstract = "The RL program was developed to construct knowledge
bases automatically in rule-based expert systems,
primarily in MYCIN-like evidence-gathering systems
where there is uncertainty about data as well as the
strength of inference, and where rules are chained
together or combined to infer complex hypotheses. This
program comprises three subprograms: (1) a program that
learns confirming rules, which employs a heuristic
search commencing with the most general hypothesis; (2)
a subprogram that learns rules containing intermediate
concepts, which exploits the old partial knowledge or
defines new intermediate concepts, based on heuristics;
(3) a program that learns disconfirming rules, which is
based on the expert's heuristics to formulate
disconfirming rules. RL's validity has been
demonstrated with a performance program that diagnoses
the causes of jaundice.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1116",
}
@TechReport{Lantz:1985:ESD,
author = "Keith Lantz and William Nowicki and Marvin Theimer",
title = "An Empirical Study of Distributed Application
Performance",
type = "Technical Report",
number = "STAN-CS-86-1117 (CSL-85-287)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = oct,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1117.html",
abstract = "A major reason for the rarity of distributed
applications, despite the proliferation of networks, is
the sensitivity of their performance to various aspects
of the network environment. We demonstrate that
distributed applications can run faster than local
ones, using common hardware. We also show that the
primary factors affecting performance are, in
approximate order of importance: speed of the user's
workstation, speed of the remote host (if any), and the
high-level (above the transport level) protocols used.
In particular, the use of batching pipelining, and
structure in high-level protocols reduces the
degradation often experienced between different
bandwidth networks. Less significant, but still
noticeable improvements result from proper design and
implementation of underlying transport protocols.
Ultimately, with proper application of these
techniques, network bandwidth is rendered virtually
insignificant.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1117",
}
@TechReport{Clancey:1985:RCK,
author = "W. J. Clancey and C. Bock",
title = "Representing Control Knowledge as Abstract Task and
Metarules",
type = "Technical Report",
number = "STAN-CS-87-1168 (KSL-85-16)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "73",
month = apr,
year = "1985",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1168.html",
abstract = "A poorly designed knowledge base can be as cryptic as
an arbitrary program and just as difficult to maintain.
Representing inference procedures abstractly,
separately from domain facts and relations, makes the
design more transparent and explainable. The
combination of abstract procedures and a relational
language for organizing domain knowledge provides a
generic framework for constructing knowledge bases for
related problems in other domains and also provides a
useful starting point for studying the nature of
strategies. In HERACLES, inference procedures are
represented as abstract metarules, expressed in a form
of the predicate calculus, organized and controlled as
rule sets. A compiler converts the rules into Lisp code
and allows domain relations to be encoded as arbitrary
data structures for efficiency. Examples are given of
the explanation and teaching capabilities afforded by
this representation. Different perspectives for
understanding HERACLES' inference procedure and how it
defines knowledge bases are discussed in some detail.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1168",
}
@TechReport{Berg:1986:BCS,
author = "Kathryn A. Berg and Taleen Marashian",
title = "Bibliography of {Computer Science} reports,
1963--1986",
type = "Technical Report",
number = "STAN-CS-86-1085",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 71",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1085.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
since 1963. Each report is identified by a Computer
Science number, author's name, title, National
Technical Information Service (NTIS) retrieval number
(i.e., AD-XXXXXX), date, and number of pages.",
acknowledgement = ack-nhfb,
pdfpages = "76",
xxnumber = "CS-TR-86-1085",
}
@TechReport{Knuth:1986:TTM,
author = "Donald E. Knuth",
title = "A Torture Test for {\METAFONT}",
type = "Technical Report",
number = "STAN-CS-86-1095",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "79",
day = "1",
month = jan,
year = "1986",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1095.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-86-1095",
abstract = "Programs that claim to be implementations of
METAFONT84 are supposed to be able to process the test
routine contained in this report, producing the outputs
contained in this report.",
acknowledgement = ack-nhfb # "\slash " # ack-hk,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-86-1095",
xxnumber = "CS-TR-86-1095",
}
@TechReport{Wilkins:1986:MTA,
author = "Marianne Winslett Wilkins",
title = "A model-theoretic approach to updating logical
databases",
type = "Technical Report",
number = "STAN-CS-86-1096",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = jan,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1096.html",
abstract = "We show that it is natural to extend the concept of
database updates to encompass databases with incomplete
information. Our approach embeds the incomplete
database and the updates in the language of first-order
logic, which we believe has strong advantages over
relational tables and traditional data manipulation
languages in the incomplete information situation. We
present semantics for our update operators, and also
provide an efficient algorithm to perform the
operations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1096",
}
@TechReport{Knuth:1986:T,
author = "Donald E. Knuth",
title = "{{\TeX}ware}",
type = "Technical Report",
number = "STAN-CS-86-1097",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "146",
day = "1",
month = apr,
year = "1986",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1097.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-86-1097",
abstract = "This report documents four TEX utility programs: The
POOLtype processor (Version 2, July 1983), The TFtoPL
processor (Version 2.5, September 1985), The PLtoTF
processor (Version 2.3, August 1985), and The DVItype
processor (Version 2.8, August 1984).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-86-1097",
xxnumber = "CS-TR-86-1097",
}
@TechReport{Cheriton:1986:DNF,
author = "David Cheriton and Timothy Mann",
title = "A Decentralized Naming Facility",
type = "Technical Report",
number = "STAN-CS-86-1098",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = feb,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Abadi:1986:MTP,
author = "Martin Abadi and Zohar Manna",
title = "Modal Theorem Proving",
type = "Technical Report",
number = "STAN-CS-86-1100",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 20",
month = may,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/86/1100/CS-TR-86-1100.pdf;
http://www-db.stanford.edu/TR/CS-TR-86-1100.html",
abstract = "We describe resolution proof systems for several modal
logics. First we present the propositional versions of
the systems and prove their completeness. The
first-order resolution rule for classical logic is then
modified to handle quantifiers directly. This new
resolution rule enables us to extend our propositional
systems to complete first-order systems. The systems
for the different modal logics are closely related.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-86-1100",
}
@TechReport{Foulser:1986:RSS,
author = "David E. Foulser",
title = "On Random Strings and Sequence Comparisons",
type = "Technical Report",
number = "STAN-CS-86-1101",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "138",
month = feb,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Naughton:1986:DIR,
author = "Jeffrey F. Naughton",
title = "Data Independent Recursion in Deductive Databases",
type = "Technical Report",
number = "STAN-CS-86-1102",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = feb,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1102.html",
abstract = "Some recursive definitions in deductive database
systems can be replaced by equivalent nonrecursive
definitions. In this paper we give a linear-time
algorithm that detects many such definitions, and
specify a useful subset of recursive definitions for
which the algorithm is complete. It is unlikely that
our algorithm can be extended significantly, as recent
results by Gaifman [5] and Vardi [19] show that the
general problem is undecidable. We consider two types
of initialization of the recursively defined relation:
arbitrary initialization, and initialization by a given
nonrecursive rule. This extends earlier work by Minker
and Nicolas [10], and by Ioannidis [7], and is related
to bounded tableau results by Sagiv [14]. Even if there
is no equivalent nonrecursive definition, a
modification of our algorithm can be used to optimize a
recursive definition and improve the efficiency of the
compiled evaluation algorithms proposed in Henschen and
Naqvi [6] and in Bancilhon et al. [3].",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1102",
}
@TechReport{Mogul:1986:RIA,
author = "Jeffrey C. Mogul",
title = "Representing Information about Files",
type = "Technical Report",
number = "STAN-CS-86-1103",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "204",
month = apr,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Subramanian:1986:CSA,
author = "Devika Subramanian",
title = "{CS229b}: a survey of {AI} classnotes for Winter
84--85",
type = "Technical Report",
number = "STAN-CS-86-1104",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "201",
month = apr,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1104.html",
abstract = "These are the compiled classnotes for the course
CS229b offered in Winter 1985. This course was an
intensive 10 week survey intended as preparation for
the 1984-85 qualifying examination in Artificial
Intelligence at Stanford University.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1104",
}
@TechReport{Cheriton:1986:SCC,
author = "David R. Cheriton and Gert A. Slavenburg and Patrick
D. Boyle",
title = "Software-Controlled Caches in the {VMP}
Multiprocessor",
type = "Technical Report",
number = "STAN-CS-86-1105",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1105.html",
abstract = "VMP is an experimental multiprocessor that follows the
familiar basic design of multiple processors, each with
a cache, connected by a shared bus to global memory.
Each processor has a synchronous, virtually addressed,
single master connection to its cache, providing very
high memory bandwidth. An unusually large cache page
size and fast sequential memory copy hardware make it
feasible for cache misses to be handled in software,
analogously to the handling of virtual memory page
faults. Hardware support for cache consistency is
limited to a simple state machine that monitors the bus
and interrupts the processor when a cache consistency
action is required. In this paper, we show how the VMP
design provides the high memory bandwidth required by
modern high-performance processors with a minimum of
hardware complexity and cost. We also describe simple
solutions to the consistency problems associated with
virtually addressed caches. Simulation results indicate
that the design achieves good performance providing
data contention is not excessive.",
acknowledgement = ack-nhfb,
pdfpages = "13",
xxnumber = "CS-TR-86-1105",
}
@TechReport{Abadi:1986:TR,
author = "Martin Abadi and Zohar Manna",
title = "A Timely Resolution",
type = "Technical Report",
number = "STAN-CS-86-1106",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = apr,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1106.html",
abstract = "We present a novel proof system R for First-order
(Linear) Temporal Logic. This system extends our
Propositional Temporal Logic proof system ([AM]). The
system R is based on nonclausal resolution; proofs are
natural and generally short. Special quantifier rules,
unification techniques, and a resolution rule are
introduced. We relate R to other proof systems for
First-order Temporal Logic and discuss completeness
issues. The system R should be useful as a tool for
such tasks as verification of concurrent programs and
reasoning about hardware devices.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1106",
}
@TechReport{Smith:1986:CI,
author = "David E. Smith",
title = "Controlling Inference",
type = "Technical Report",
number = "STAN-CS-86-1107",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "199",
month = apr,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Morris:1986:DON,
author = "Katherine Morris and Jeffrey D. Ullman and Allen {Van
Gelder}",
title = "Design Overview of the {NAIL!} System",
type = "Technical Report",
number = "STAN-CS-86-1108",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = may,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Casley:1986:PEP,
author = "Ross Casley",
title = "A Proof Editor for Propositional Temporal Logic",
type = "Technical Report",
number = "STAN-CS-86-1109",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = may,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1109.html",
abstract = "This report describes PTL, a program to assist in
constructing proofs in propositional logic extended by
the operators $ \Box $ (''always''), $ \Diamond $
(''eventually'') and $ \bigcirc $ (''at the next
step''). This is called propositional temporal logic
and is one of two systems of logic presented by Abadi
and Manna in [1].",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1109",
}
@TechReport{Rosenbloom:1986:MEB,
author = "Paul S. Rosenbloom and John E. Laird",
title = "Mapping Explanation-Based Generalization onto {Soar}",
type = "Technical Report",
number = "STAN-CS-86-1111",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
keywords = "SOAR (Smalltalk on a RISC)",
}
@TechReport{Demetrescu:1986:SLA,
author = "Stefan G. Demetrescu",
title = "Scan Line Access Memories for High Speed Image
Rasterization",
type = "Technical Report",
number = "STAN-CS-86-1112",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "137",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pratt:1986:MCP,
author = "Vaughan Pratt",
title = "Modelling Concurrency with Partial Orders",
type = "Technical Report",
number = "STAN-CS-86-1113",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Naughton:1986:OFF,
author = "Jeffrey F. Naughton",
title = "Optimizing Function-Free Recursive Inference Rules",
type = "Technical Report",
number = "STAN-CS-86-1114",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = may,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1114.html",
abstract = "Recursive inference rules arise in recursive
definitions in logic programming systems and in
database systems with recursive query languages. Let D
be a recursive definition of a relation t. We say that
D is minimal if for any predicate p in a recursive rule
in D, p must appear in a recursive rule in any
definition of t. We show that testing for minimality is
in general undecidable. However, we do present an
efficient algorithm for a useful class of recursive
rules, and show how to use it to transform a recursive
definition to a minimal recursive definition.
Evaluating the optimized definition will avoid
redundant computation without the overhead of caching
intermediate results and run-time checking for
duplicate goals.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1114",
}
@TechReport{Buchanan:1986:HRM,
author = "Bruce G. Buchanan and Barbara Hayes-Roth and Olivier
Lichtarge and Russ Altman and James Brinkley and
Michael Hewett and Craig Cornelius and Bruce Duncan and
Oleg Jardetzky",
title = "The heuristic refinement method for deriving solution
structures of proteins",
type = "Technical Report",
number = "STAN-CS-86-1115",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1115.html",
abstract = "A new method is presented for determining structures
of proteins in solution. The method uses constraints
inferred from analytic data to successively refine both
the locations for parts of the structure and the levels
of detail for describing those parts. A computer
program, called PROTEAN, which encodes this method, has
been partially implemented and was used to derive
structures for the lac-repressor headpiece from
experimental data.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1115",
}
@TechReport{Helmbold:1986:APS,
author = "David Helmbold and Ernst Mayr",
title = "Applications of Parallel Scheduling to Perfect
Graphs",
type = "Technical Report",
number = "STAN-CS-86-1118",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1118.html",
abstract = "We combine a parallel algorithm for the two processor
scheduling problem, which runs in polylog time on a
polynomial number of processors, with an algorithm to
find transitive orientations of graphs where they
exist. Both algorithms together solve the maximum
clique problem and the minimum coloring problem for
comparability graphs, and the maximum matching problem
for co-comparability graphs. These parallel algorithms
can also be used to identify permutation graphs and
interval graphs, important subclasses of perfect
graphs.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1118",
}
@TechReport{Rosenblum:1986:SUS,
author = "David S. Rosenblum and Ernst W. Mayr",
title = "Simulation of an {Ultracomputer} with Several 'Hot
Spots'",
type = "Technical Report",
number = "STAN-CS-86-1119",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1119.html",
abstract = "This report describes the design and results of a
time-driven simulation of an Ultracomputer-like
multiprocessor in the presence of several ``hot
spots,'' or memory modules which are frequent targets
of requests. Such hot spots exist during execution of
parallel programs in which the several threads of
control synchronize through manipulation of a small
number of shared variables. The simulated system is
comprised of N processing elements (PEs) and N shared
memory modules connected by an N x N buffered,
packet-switched Omega network. The simulator was
designed to accept a wide variety of system
configurations to enable observation of many different
characteristics of the system behavior. We present the
results of four experiments: (1) General simulation of
several 16-PE configurations, (2) General simulation of
several 512-PE configurations, (3) Determination of
critical queue lengths as a function of request rate
(512 PEs) and (4) Determination of the effect of hot
spot spacing on system performance (512 PEs).",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1119",
}
@TechReport{Moses:1986:KDE,
author = "Yoram Moses",
title = "Knowledge in Distributed Environment",
type = "Technical Report",
number = "STAN-CS-86-1120",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "113",
month = mar,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Feigenbaum:1986:PGS,
author = "Joan Feigenbaum",
title = "Product Graphs: Some Algorithmic and Combinatorial
Results",
type = "Technical Report",
number = "STAN-CS-86-1121",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "69",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rennels:1986:CMR,
author = "Glenn D. Rennels",
title = "A Computational Model of Reasoning from the Clinical
Literature",
type = "Technical Report",
number = "STAN-CS-86-1122",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "263",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Nii:1986:BS,
author = "H. Penny Nii",
title = "Blackboard Systems",
type = "Technical Report",
number = "STAN-CS-86-1123 (KSL-86-18)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "95",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1123.html",
abstract = "The first blackboard system was the HEARSAY-II speech
understanding system that evolved between 1971 and
1976. Subsequently, many systems have been built that
have similar system organizations and run-time
behavior. The objectives of this document are: (1) to
define what is meant by ``blackboard systems,'' and (2)
to show the richness and diversity of blackboard system
designs. The article begins with a discussion of the
underlying concept behind all blackboard systems, the
blackboard model of problem solving. In order to bridge
the gap between a model and working systems, the
blackboard framework, an extension of the basic
blackboard model is introduced, including a detailed
description of the model's components and their
behavior. A model does not come into existence on its
own and is usually an abstraction of many examples. In
section 2, the history of ideas is traced and the
designs of some applications systems that helped shape
the blackboard model are detailed. We then describe and
contrast existing blackboard systems. Blackboard
systems can generally be divided into two categories;
application and skeletal systems. In application
systems the blackboard system components are integrated
with the domain knowledge required to solve the problem
at hand. Skeletal systems are devoid of domain
knowledge, and, as the name implies, consist of the
essential system components from which application
systems can be built by the addition of knowledge and
the specification of control (i.e. meta-knowledge).
Application systems will be discussed in Section 3, and
skeletal systems will be discussed elsewhere. In
Section 3.6, we summarize the features of the
applications systems and in Section 4 present the
author's perspective on the utility of the blackboard
approach to problem solving and knowledge
engineering.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1123",
}
@TechReport{Scales:1986:EMA,
author = "Daniel J. Scales",
title = "Efficient Matching Algorithms for the {SOARIOPSS}
Production System",
type = "Technical Report",
number = "STAN-CS-86-1124 (KSL-86-47)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1124.html",
abstract = "SOAR is a problem-solving and learning program
intended to exhibit intelligent behavior. SOAR uses a
modified form of the OPS5 production system for storage
of and access to long-term knowledge. As with most
programs which use production system systems, the match
phase of SOAR's production system dominates all other
SOAR processing. This paper describes the results of an
investigation of various ways of speeding up the
matching process in SOAR through additions and changes
to the OPS5 matching algorithm.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1124",
}
@TechReport{Schoen:1986:CS,
author = "Eric Schoen",
title = "The {CAOS} System",
type = "Technical Report",
number = "STAN-CS-86-1125 (KSL-86-22)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "75",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1125.html",
abstract = "The CAOS system is a framework designed to facilitate
the development of highly concurrent real-time signal
interpretation applications. It explores the potential
of multiprocessor architectures to improve the
performance of expert systems in the domain of signal
interpretation. CAOS is implemented in Lisp on a
(simulated) collection of processor-memory sites,
linked by a high-speed communications subsystem. The
``virtual machine'' on which it depends provides remote
evaluation and packet-based message exchange between
processes, using virtual circuits known as streams. To
this presentation layer, CAOS adds (1) a flexible
process scheduler, and (2) an object-centered notion of
agents, dynamically-instantiable entities which model
interpreted signal features. This report documents the
principal ideas, programming model, and implementation
of CAOS. A model of real-time signal interpretation,
based on replicated ``abstraction'' pipelines, is
presented. For some applications, this model offers a
means by which large numbers of processors may be
utilized without introducing
synchronization-necessitated software bottlenecks. The
report concludes with a description of the performance
of a large CAOS application over various sizes of
multiprocessor configurations. Lessons about problem
decomposition grain size, global problem solving
control strategy, and appropriate service provided to
CAOS by the underlying architecture are discussed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1125",
}
@TechReport{Davies:1986:CVD,
author = "Byron Davies",
title = "{CAREL}: a Visible Distributed {Lisp}",
type = "Technical Report",
number = "STAN-CS-86-1126 (KSL-86-14)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1126.html",
abstract = "CAREL is a Lisp implementation designed to be a
high-level interactive systems programming language for
a distributed-memory multiprocessor. CAREL insulates
the user from the machine language of the
multiprocessor architecture, but still makes it
possible for the user to specify explicitly the
assignment of tasks to processors in the multiprocessor
network. CAREL has been implemented to run on a TI
Explorer Lisp machine using Stanford's CARE
multiprocessor simulator. CAREL is more than a
language: real-time graphical displays provided by the
CARE simulator make CAREL a novel graphical programming
environment for distributed computing. CAREL enables
the user to create programs interactively and then
watch them run on a network of simulated processors. As
a CAREL program executes, the CARE simulator
graphically displays the activity of the processors and
the transmission of data through the network. Using
this capability, CAREL has demonstrated its utility as
an educational tool for multiprocessor computing.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1126",
}
@TechReport{Malachi:1986:NLP,
author = "Yonathan Malachi",
title = "Nonclausal Logic Programming",
type = "Technical Report",
number = "STAN-CS-86-1127",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "167",
month = mar,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Theimer:1986:PRE,
author = "Marvin M. Theimer",
title = "Preemptable Remote Execution Facilities for
Loosely-Coupled Distributed Systems",
type = "Technical Report",
number = "STAN-CS-86-1128 (CSL-86-302)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "139",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cohn:1986:BOE,
author = "Evan R. Cohn and Ramsey W. Haddad",
title = "Beta Operations: Efficient Implementation of a
Primitive Parallel Operation",
type = "Technical Report",
number = "STAN-CS-86-1129",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = aug,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1129.html",
abstract = "We will consider the primitive parallel operation of
the Connection Machine, the Beta Operation. Let the
imput size of the problem be N and output size M. We
will show how to perform the Beta Operation on an
N-node hypercube in O(log N + $ \log^2 $ M) time. For a
$ \sqrt {N} x \sqrt {M} $ mesh-of-trees, we require
O(log N + $ \sqrt {M}$) time.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1129",
}
@TechReport{Nalwa:1986:DE,
author = "Vishvjit S. Nalwa and Thomas O. Binford",
title = "On Detecting Edges",
type = "Technical Report",
number = "STAN-CS-86-1130",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1130.html",
abstract = "An edge in an image corresponds to a discontinuity in
the intensity surface of the underlying scene. It can
be approximated by a piecewise straight curve composed
of edgels, i.e., short, linear edge-elements, each
characterized by a direction and a position. The
approach to edgel-detection here, is to fit a series of
one-dimensional surfaces to each window (kernel of the
operator) and accept the surface-description which is
adequate in the least squares sense and has the fewest
parameters. (A one-dimensional surface is one which is
constant along some direction.) The tanh is an adequate
basis for the step-edge and its combinations are
adequate for the roof-edge and the line-edge. The
proposed method of step-edgel detection is robust with
respect to noise; for (step-size/$ {\sigma }_{noise}$)
>= 2.5, it has subpixel position localization ($
{\sigma }_{position}$ < 1/3) and an angular
localization better than $ 10^\infty $; further, it is
designed to be insensitive to smooth shading. These
results are demonstrated by some simple analysis,
statistical data and edgel-images. Also included is a
comparison, of performance on a real image, with a
typical operator (Difference-of-Gaussians). The results
indicate that the proposed operator is superior with
respect to detection, localization and resolution.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1130",
}
@TechReport{Bar-Noy:1986:PRA,
author = "Amotz Bar-Noy and David Peleg",
title = "Processor Renaming in Asynchronous Environments",
type = "Technical Report",
number = "STAN-CS-86-1131",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = sep,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1131.html",
abstract = "Fischer, Lynch and Paterson proved that in a
completely asynchronous system ``weak agreement''
cannot be achieved even in the presence of a single
``benign'' fault. Following the direction proposed in
Attiya, Bar-Noy, Dolev and Koller (Aug 1986), we
demonstrate the interesting fact that some weaker forms
of processor cooperation are still achievable in such a
situation, and in fact, even in the presence of up to t
< n/2 such faulty processors. In particular, we show
that n processors, each having a distinct name taken
from an unbounded ordered domain, can individually
choose new distinct names from a space of size n + t
(where n is an obvious lower bound). In case the new
names are required also to preserve the original order,
we give an algorithm in which the space of new names is
of size $ {2^t}(n - t + 1) - 1 $, which is tight.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1131",
}
@TechReport{Sagiv:1986:ODP,
author = "Yehoshua Sagiv",
title = "Optimizing Datalog Programs",
type = "Technical Report",
number = "STAN-CS-86-1132",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = mar,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1132.html",
abstract = "Datalog programs, i.e., Prolog programs without
function symbols, are considered. It is assumed that a
variable appearing in the head of a rule must also
appear in the body of the rule. The input of a program
is a set of ground atoms (which are given in addition
to the program's rules) and, therefore, can be viewed
as an assignment of relations to some of the program's
predicates. Two programs are equivalent if they produce
the same result for all possible assignments of
relations to the extensional predicates (i.e., the
predicates that do not appear as heads of rules). Two
programs are uniformly equivalent if they produce the
same result for all possible assignments of initial
relations to all the predicates (i.e. both extensional
and intentional). The equivalence problem for Datalog
programs is known to be undecidable. It is shown that
uniform equivalence is decidable, and an algorithm is
given for minimizing a Datalog program under
equivalence. A technique for removing parts of a
program that are redundant under equivalence (but not
under uniform equivalence) is developed. A procedure
for testing uniform equivalence is also developed for
the case in which the database satisfies some
constraints.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1132",
}
@TechReport{Edighoffer:1986:DRC,
author = "Judy Lynn Edighoffer",
title = "Distributed, Replicated Computer Bulletin Board
Service",
type = "Technical Report",
number = "STAN-CS-86-1133",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "152",
month = jun,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1986:UUS,
author = "David R. Cheriton",
title = "{UIO}: a Uniform {I/O} System Interface for
Distributed Systems",
type = "Technical Report",
number = "STAN-CS-86-1134",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = nov,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1134.html",
abstract = "A uniform I/O interface allows programs to be written
relatively independent of specific I/O services and yet
work with a wide variety of the I/O services available
in a distributed environment. Ideally, the interface
provides this uniform access without excessive
complexity in the interface or loss of performance.
However, a uniform interface does not arise from
careful design of individual system interfaces alone;
it requires explicit definition. In this paper, we
describe the UIO (uniform I/O) system interface that
has been used for the past five years in the V
distributed operating systems, focusing on the key
design issues. This interface provides several
extensions beyond the I/O interface of UNIX, including
support for record I/O, locking, atomic transactions
and replications as well as attributes that indicate
whether optional semantics and operations are
available. We also describe our experience in using and
implementing this interface with a variety of different
I/O services plus the performance of both local and
network I/O. We conclude that the UIO interface
provides a uniform I/O system interface with
significant functionality, wide applicability and no
significant performance penalty.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1134",
}
@TechReport{Treitel:1986:SLP,
author = "Richard Treitel",
title = "Sequentialization of Logic Programs",
type = "Technical Report",
number = "STAN-CS-86-1135",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "167",
month = nov,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Brown:1986:EKB,
author = "Harold D. Brown and Eric Schoen and Bruce A. Delagi",
title = "An Experiment in Knowledge-based Signal Understanding
Using Parallel Architectures",
type = "Technical Report",
number = "STAN-CS-86-1136 (KSL-86-69)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = oct,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1136.html",
abstract = "This report documents an experiment investigating the
potential of a parallel computing architecture to
enhance the performance of a knowledge-based signal
understanding system. The experiment consisted of
implementing and evaluating an application encoded in a
parallel programming extension of Lisp and executing on
a simulated multiprocessor system. The chosen
application for the experiment was a knowledge-based
system for interpreting pre-processed, passively
acquired radar emissions from aircraft. The application
was implemented in an experimental concurrent,
asynchronous object-oriented framework. This framework,
in turn, relied on the services provided by the
underlying hardware system. The hardware system for the
experiment was a simulation of various sized grids of
processors with inter-processor communication via
message-passing. The experiment investigated the
effects of various high-level control strategies on the
quality of the problem solution, the speedup of the
overall system performance as a function of the number
of processors in the grid, and some of the issues in
implementing and debugging a knowledge-based system on
a message-passing multiprocessor system. In this report
we describe the software and (simulated) hardware
components of the experiment and present the
qualitative and quantitative experimental results.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1136",
}
@TechReport{Mogul:1986:LFA,
author = "Jeffrey Mogul",
title = "The {Leaf} File Access Protocol",
type = "Technical Report",
number = "STAN-CS-86-1137",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = dec,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1137.html",
abstract = "Personal computers are superior to timesharing systems
in many ways, but they are inferior in this respect:
they make it harder for users to share files. A local
area network provides a substrate upon which file
sharing can be built; one must also have a protocol for
sharing files. This report describes Leaf, one of the
first protocols to allow remote access to files. Leaf
is a remote file access protocol rather than a file
transfer protocol. Unlike a file transfer protocol,
which must create a complete copy of a file, a file
access protocol provides random access directly to the
file itself. This promotes sharing because it allows
simultaneous access to a file by several remote users,
and because it avoids the creation of new copies and
the associated consistency-maintenance problem. The
protocol described in this report is nearly obsolete.
It is interesting for historical reasons, primarily
because it was perhaps the first non-proprietary remote
file access protocol actually implemented, and also
because it serves as a case study in practical protocol
design. The specification of Leaf is included as an
appendix; it has not been widely available outside of
Stanford.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1137",
}
@TechReport{Mackinlay:1986:ADG,
author = "Jock Mackinlay",
title = "Automatic Design of Graphical Presentations",
type = "Technical Report",
number = "STAN-CS-86-1138",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "200",
month = dec,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Healey:1986:LSS,
author = "Glenn Healey and Thomas O. Binford",
title = "Local Shape from Specularity",
type = "Technical Report",
number = "STAN-CS-86-1139",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = jun,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-86-1139.html",
abstract = "We show that highlights in images of objects with
specularly reflecting surfaces provide significant
information about the surfaces which generate them. A
brief survey is given of specular reflectance models
which have been used in computer vision and graphics.
For our work, we adopt the Torrance-Sparrow specular
model which, unlike most previous models, considers the
underlying physics of specular reflection from rough
surfaces. From this model we derive powerful
relationships between the properties of a specular
feature in an image and local properties of the
corresponding surface. We show how this analysis can be
used for both prediction and interpretation in a vision
system. A shape from specularity system has been
implemented to test our approach. The performance of
the system is demonstrated by careful experiments with
specularly reflecting objects.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-86-1139",
}
@TechReport{Laird:1986:SAG,
author = "John E. Laird and Allen Newell and Paul S.
Rosenbloom",
title = "Soar: an Architecture for General Intelligence",
type = "Technical Report",
number = "STAN-CS-86-1140 (KSL-86-70)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "63",
month = dec,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1986:HCB,
author = "Zohar Manna and Richard Waldinger",
title = "How to Clear a Block: a Theory of Plans",
type = "Technical Report",
number = "STAN-CS-87-1141",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "39",
month = dec,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hayes-Roth:1986:LER,
author = "Barbara Hayes-Roth and Alan Garvey and M. Vaughan
{Johnson, Jr.} and Michael Hewett",
title = "A Layered Environment for Reasoning about Action",
type = "Technical Report",
number = "STAN-CS-87-1147 (KSL-86-38)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "83",
month = nov,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1147.html",
abstract = "An intelligent systems reasons about -- controls,
explains, learns about -- its action, thereby improving
its efforts to achieve goals and function in its
environment. In order to perform effectively, a system
must have knowledge of the actions it can perform, the
events and states that occur, and the relationships
among instances of those actions, events and states. We
represent such knowledge in a hierarchy of knowledge
abstractions and impose uniform standards of knowledge
content and representation on modules within each
hierarchical level. We refer to the evolving set of
such modules as the BB* environment. To illustrate, we
describe selected elements of BB*: * the foundational
BB1 architecture * the ACCORD framework for solving
arrangement problems by means of an assembly method *
two applications of BB1-ACCORD, the PROTEAN system for
modeling protein structures and the SIGHTPLAN system
for designing construction-site layouts * two
hypothetical multifaceted systems that integrate
ACCORD, PROTEAN and SIGHTPLAN with other possible BB*
frameworks and applications.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1147",
}
@TechReport{Russell:1986:AIR,
author = "Stuart J. Russell",
title = "Analogical and Inductive Reasoning",
type = "Technical Report",
number = "STAN-CS-87-1150",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "230",
month = dec,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bellin:1986:EAT,
author = "Gianluigi Bellin and Jussi Ketonen",
title = "Experiments in Automatic Theorem Proving",
type = "Technical Report",
number = "STAN-CS-87-1155",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "265",
month = dec,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1155.html",
abstract = "The experiments described in this report are proofs in
EKL of properties of different LISP programs operating
different representations of the same mathematical
structures -- finite permutations. EKL is an
interactive proof checker based upon the language of
higher order logic, higher order unification and a
decision procedure for a fragment of first order logic.
The following questions are asked: What representations
of mathematical structure and facts are better suited
for formalization and also applicable to several
interesting situations? What methods and strategies
will make it possible to prove automatically an
extensive body of mathematical knowledge? Can higher
order logic be conveniently applied in the proof of
elementary facts? The fact (*) that finite permutations
form a group is proved from the axioms of arithmetic
and elementary set theory, via the ``Pigeon Hole
Principle'' (PHP). Permutations are represented (1) as
association lists and (2) as lists of numbers. In
representation (2) operations on permutations are
represented (2.1) using predicates (2.2) using
functions. Proofs of (*) using the different
representations are compared. The results and
conclusions include the following. Methods to control
the rewriting process and to replace logic inference by
high order rewriting are presented. PHP is formulated
as a second order statement which is then easily
applied to (1) and (2). This demonstrates the value of
abstract, higher order formulation of facts for
application in different contexts. A case is given in
which representation of properties of programs by
predicates may be more convenient than by functions.
Evidence is given that convenient organization of
proofs into lemmata is essential for large scale
computer aided theorem proving.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1155",
}
@TechReport{Thompson:1986:AQM,
author = "T. F. Thompson and W. J. Clancey",
title = "Applying a Qualitative Modeling Shell to Process
Diagnosis: The Caster System",
type = "Technical Report",
number = "STAN-CS-87-1169 (KSL-85-32)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = mar,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1986:VKB,
author = "William J. Clancey",
title = "Viewing Knowledge Bases as Qualitative Models",
type = "Technical Report",
number = "STAN-CS-87-1170 (KSL-86-27)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = may,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1170.html",
abstract = "The concept of a qualitative model provides a unifying
perspective for understanding how expert systems differ
from conventional programs. Knowledge bases contain
qualitative models of systems in the world, that is
primarily non-numeric descriptions that provide a basis
for explaining and predicting behavior and formulating
action plans. The prevalent view that a qualitative
model must be a simulation, to the exclusion of
prototypic and behavioral descriptions, has fragmented
our field, so that we have failed to usefully
synthesize what we have learned about modeling
processes. For example, our ideas about ``scoring
functions'' and ``casual network traversal,'' developed
apart from a modeling perspective, have obscured the
inherent explanatory nature of diagnosis. While
knowledge engineering has greatly benefited from the
study of human experts as a means of informing model
construction, overemphasis on modeling the expert's
knowledge has detracted from the primary objective of
modeling a system in the world. Placing AI squarely in
the evolutionary line of telelogic and topologic
modeling, this talk argues that the study of network
representations has established a foundation for a
science and engineering of qualitative models.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1170",
}
@TechReport{Clancey:1986:QSM,
author = "William J. Clancey",
title = "Qualitative Student Models",
type = "Technical Report",
number = "STAN-CS-87-1171 (KSL-86-15)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = may,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1986:GNH,
author = "William J. Clancey",
title = "From {GUIDON} to {NEOMYCIN} and {HERACLES} in Twenty
Short Lessons",
type = "Technical Report",
number = "STAN-CS-87-1172 (KSL-86-11)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = jul,
year = "1986",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Clancey:1986:RWF,
author = "William J. Clancey",
title = "Review of {Winograd} and {Flores}'
{{\booktitle{Understanding Computers and Cognition}}}",
type = "Technical Report",
number = "STAN-CS-87-1173 (KSL-86-48)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jul,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1173.html",
abstract = "AI researchers and cognitive scientists commonly
believe that thinking involves manipulating
representations. Thinking involves search, inference,
and making choice. This is how we model reasoning and
what goes on in the brain is similar. Winograd and
Flores present a radically different view. They claim
that our knowledge is not represented in the brain at
all, but rather consists of an unformalized shared
background, from which we articulate representations in
order to cope with new situations. In contrast,
computer programs contain only pre-selected objects and
properties, and there is no basis for moving beyond
this initial formalization when breakdown occurs.
Winograd and Flores provide convincing arguments with
examples familiar to most AI researchers. However, they
significantly understate the role of representation in
mediating intelligent behavior, specifically in the
process of reflection, when representations are
generated prior to physical action. Furthermore, they
do not consider the practical benefits of expert
systems and the extent of what can be accomplished.
Nevertheless, the book is crisp and stimulating. It
should make AI researchers more cautious about what
they are doing, more aware of the nature of
formalization, and more open to alternative views.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1173",
}
@TechReport{Clancey:1986:ITS,
author = "William J. Clancey",
title = "Intelligent Tutoring Systems: a Tutorial Survey",
type = "Technical Report",
number = "STAN-CS-87-1174 (KSL-86-58)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "62",
month = sep,
year = "1986",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1174.html",
abstract = "This survey of Intelligent Tutoring Systems is based
on a tutorial originally presented by John Seely Brown,
Richard R. Burton (Xerox --- PARC, USA) and William J.
Clancey at the National Conference on AI (AAAI) in
Austin, TX in August, 1984. The survey describes the
components of tutoring systems, different teaching
scenarios, and their relation to a theory of
instruction. The underlying pedagogical approach is to
make latent knowledge manifest, which the research
accomplishes by different forms of qualitative
modeling: simulating physical processes; simulating
expert problem-solving, including strategies for
montoring and controlling problem solving
(metacognition); modeling the plans behind procedural
behavior; and forcing articulation of model
inconsistencies through the Socratic method of
instruction.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1174",
}
@TechReport{Brinkley:1987:HRS,
author = "James Brinkley and Bruce Buchanan and Russ Altman and
Bruce Duncan and Craig Cornelius",
title = "A Heuristic Refinement for Spacial Constraint
Satisfaction Problems",
type = "Technical Report",
number = "STAN-CS-87-1142 (KSL-87-05)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 15",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1142.html",
abstract = "The problem of arranging a set of physical objects
according to a set of constraints is formulated as a
geometric constraint satisfaction problem (GCSP), in
which the variables are the objects, the possible
locations of the objects are the possible values for
the variables, and the constraints are geometric
constraints between objects. A GCSP is a type of
multidimensional constraint satisfaction problem in
which the number of objects and/or the number of
possible locations per object is too large to permit
direct solution by backtrack search. A method is
described for reducing these numbers by refinement
along two dimensions. The number of objects is reduced
by refinement of the structure, representing a group of
objects as a single abstract object before considering
each object individually. The abstraction used depends
on domain specific knowledge. The number of locations
per object is reduced by applying node and arc
consistency algorithms to refine the accessible volume
of each object. Heuristics are employed to control the
order of operations (and hence to affect the efficiency
of search) but not to change the correctness in the
sense that no solutions that would be found by
backtrack search are eliminated. Application of the
method to the problem of protein structure
determination is described.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-87-1142",
}
@TechReport{Winslett:1987:UDI,
author = "Marianne S. Winslett",
title = "Updating Databases with Incomplete Information",
type = "Technical Report",
number = "STAN-CS-87-1143",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "164",
month = jan,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Byrd:1987:CMT,
author = "Gregory T. Byrd and Bruce A. Delagi",
title = "Considerations for Multiprocessor Topologies",
type = "Technical Report",
number = "STAN-CS-87-1144 (KSL-87-07)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1144.html",
abstract = "Choosing a multiprocessor interconnection topology may
depend on high-level considerations, such as the
intended application domain and the expected number of
processors. It certainly depends on low-level
implementation details, such as packaging and
communications protocols. We first use rough measures
of cost and performance to characterize several
topologies. We then examine how implementation details
can affect the realizable performance of a topology.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1144",
}
@TechReport{Cheriton:1987:NMV,
author = "David R. Cheriton and Cary L. Williamson",
title = "Network Measurement of the {VMTP} Request-Response
Protocol in the {V Distributed System}",
type = "Technical Report",
number = "STAN-CS-87-1145",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = feb,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Byrd:1987:PPM,
author = "Gregory Byrd and Russell Nakano and Bruce Delagi",
title = "A Point-to-Point Multicast Communications Protocol",
type = "Technical Report",
number = "STAN-CS-87-1146 (KSL-87-02)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 30",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1146.html",
abstract = "Many network topologies have been proposed for
connecting a large number of processor-memory pairs in
a high-performance multiprocessor system. In terms of
performance, however, the communications protocol
decisions may be as crucial as topology. This paper
describes a protocol to support point-to-point
interprocessor communications with multicast. Dynamic,
cut- through routing with local flow control is used to
provide a high-throughput, low latency communications
path between processors. In addition, multicast
transmissions are available, in which copies of a
packet are sent to multiple destinations using common
resources as much as possible. Special packet
terminators and selective buffering are introduced to
avoid deadlock during multicasts. A simulated
implementation of the protocol is also described.",
acknowledgement = ack-nhfb,
pdfpages = "38",
xxnumber = "CS-TR-87-1146",
}
@TechReport{Delagi:1987:IASa,
author = "Bruce Delagi and Nakul Saraiya and Sayuri Nishimura
and Greg Byrd",
title = "An Instrumented Architectural Simulation System",
type = "Technical Report",
number = "STAN-CS-87-1148 (KSL-86-36)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 21",
day = "29",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1148.html",
abstract = "Simulation of systems at an architectural level can
offer an effective way to study critical design choices
if 1. the performance of the simulator is adequate to
examine designs executing significant code bodies --
not just toy problems or small application fragments 2.
the details of the simulation include the critical
details of the design 3. The view of the design
presented by the simulator instrumentation leads to
useful insights on the problems with the design 4.
there is enough flexibility in the simulation system so
that the asking of unplanned questions is not
suppressed by the weight of the mechanics involved in
making changes either in the design or its measurement.
A simulation system with these goals is described
together with the approach to its implementation. Its
application to the study of a particular class of
multiprocessor hardware system architectures is
illustrated.",
acknowledgement = ack-nhfb,
pdfpages = "28",
xxnumber = "CS-TR-87-1148",
}
@TechReport{Millen:1987:PNA,
author = "Katie Mac Millen and Ann Diaz-Barriga and Carolyn
Tajnai",
title = "Proceedings from the {Nineteenth Annual Meeting of the
Stanford Computer Forum}",
type = "Technical Report",
number = "STAN-CS-87-1149",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = feb,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1149.html",
abstract = "Operating for almost two decades, the Stanford
Computer Forum is a cooperative venture of the Computer
Science Department and the Computer Systems Laboratory
(a laboratory operated jointly by the Computer Science
and Electrical Engineering Departments). CSD and CSL
are internationally recognized for their excellence;
their faculty members, research staff, and students are
widely known for leadership in developing new ideas and
trends in the organization, design and use of
computers. They are in the forefront of applying
research results to a wide range of applications. The
Forum holds an annual meeting in February to which
three representatives of each member company are
invited. The meeting lasts two days and features
technical sessions at which timely computer research at
Stanford is described by advanced graduate students and
faculty members. There are opportunities for informal
discussions to complement the presentations. This
report includes information on the Forum, the program,
abstracts of the talks and viewgraphs used in the
presentations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1149",
}
@TechReport{Abadi:1987:TLT,
author = "Martin Abadi",
title = "Temporal-Logic Theorem Proving",
type = "Technical Report",
number = "STAN-CS-87-1151",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "179",
month = mar,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Davidson:1987:INL,
author = "James E. Davidson",
title = "Interpreting Natural Language Database Updates",
type = "Technical Report",
number = "STAN-CS-87-1152",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "119",
month = apr,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Markenscoff:1987:OGP,
author = "Xanthippi Markenscoff and Christos Papadimitriou",
title = "Optimum Grip of a Polygon",
type = "Technical Report",
number = "STAN-CS-87-1153",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = apr,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1153.html",
abstract = "It has been shown by Baker, Fortune and Grosse that
any two-dimensional polygonal object can be prehended
stably with three fingers, so that its weight (along
the third dimension) is balanced. Besides, in this
paper we show that form closure of a polygon object can
be achieved by four fingers (previous proofs were not
complete). We formulate and solve the problem of
finding the optimum stable grip or form closure of any
given polygon. For stable grip it is most natural to
minimize the forces needed to balance through friction
the object's weight along the third dimension. For form
closure, we minimize the worst-case forces needed to
balance any unit force acting on the center of gravity
of the object. The mathematical techniques used in the
two instances are an interesting mix of Optimization
and Euclidean geometry. Our results lead to algorithms
for the efficient computation of the optimum grip in
each case.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1153",
}
@TechReport{Rokicki:1987:PPS,
author = "Tomas G. Rokicki and Donald E. Knuth",
title = "A Programming and Problem-Solving Seminar",
type = "Technical Report",
number = "STAN-CS-87-1154",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vi + 89",
month = apr,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/87/1154/CS-TR-87-1154.pdf;
http://www-db.stanford.edu/TR/CS-TR-87-1154.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-87-1154",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's course CS304, Problem
Seminar, during winter quarter 1987. Since the topics
span a large range of ideas in computer science, and
since most of the important research paradigms and
programming paradigms were touched on during the
discussions, these notes may be of interest to graduate
students of computer science at other universities, as
well to their professors and to professional people in
the ``real world.''\par
The present report is the seventh in a series of such
transcripts, continuing the tradition established in
STAN- CS-77-606 (Michael J. Clancy, 1977),
STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
(Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
and STAN-CS-85-1055 (Ramsey W. Haddad, 1985).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-87-1154",
xxnumber = "CS-TR-87-1154",
}
@TechReport{Mayr:1987:DTE,
author = "Ernst W. Mayr",
title = "The Dynamic Tree Expression Problem",
type = "Technical Report",
number = "STAN-CS-87-1156",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = may,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1156.html",
abstract = "Presented is a uniform method for obtaining efficient
parallel algorithms for a rather large class of
problems. The method is based on a logic programming
model, and it derives its efficiency form fast parallel
routines for the evaluation of expression trees.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1156",
}
@TechReport{Mayr:1987:NID,
author = "Ernst W. Mayr and C. Greg Plaxton",
title = "Network Implementation of the {DTEP} Algorithm",
type = "Technical Report",
number = "STAN-CS-87-1157",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = may,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1157.html",
abstract = "The dynamic tree expression problem (DTEP) was defined
in [Ma87]. In this paper, efficient implementations of
the DTEP algorithm are developed for the hypercube,
butterfly, perfect shuffle and multidimensional mesh of
trees families of networks.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1157",
}
@TechReport{Winograd:1987:LAP,
author = "Terry A. Winograd",
title = "A Language\slash Action Perspective on the Design of
Cooperative Work",
type = "Technical Report",
number = "STAN-CS-87-1158",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = may,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Winograd:1987:MTL,
author = "Terry A. Winograd",
title = "{Muir}: a Tool for Language Design",
type = "Technical Report",
number = "STAN-CS-87-1159",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = may,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1159.html",
abstract = "Muir is a language design environment, intended for
use in creating and experimenting with languages such
as programming languages, specification languages,
grammar formalisms, and logical notations. It provides
facilities for a language designer to create a language
specification, which controls the behavior of generic
language manipulating tools typically found in a
language-specific environment, such as structure
editors, interactive interfaces, storage management and
attribute analysis. It is oriented towards use with
evolving languages, providing for mixed structures
(combining different versions), semi-automated updating
of structures from one language version to another, and
incremental language specification. A new hierarchical
grammar formalism serves as the framework for language
specification, with multiple presentation formalisms
and a unified interactive environment based on an
extended notion of edit operations. A prototype version
is operating and has been tested on a small number of
languages.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1159",
}
@TechReport{Winograd:1987:SCR,
author = "Terry A. Winograd",
title = "Strategic Computing Research and the Universities",
type = "Technical Report",
number = "STAN-CS-87-1160",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = mar,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1160.html",
abstract = "The Strategic Computing Initiative offers the
potential of new research funds for university computer
science departments. As with all funds, they bring
benefits and can have unwanted strings attached. In the
case of military funding, the web of attached strings
can be subtle and confusing. The goal of this paper is
to delineate some of these entanglements and perhaps
provide some guidance for loosening and eliminating
them.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1160",
}
@TechReport{Winogad:1987:TMC,
author = "Terry A. Winogad",
title = "Thinking Machines: Can There Be? {Are} We?",
type = "Technical Report",
number = "STAN-CS-87-1161",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Spencer:1987:WMA,
author = "Thomas Spencer",
title = "Weighted Matching Algorithms",
type = "Technical Report",
number = "STAN-CS-87-1162",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hershberger:1987:EAS,
author = "John E. Hershberger",
title = "Efficient Algorithms for Shortest Path and Visibility
Problems",
type = "Technical Report",
number = "STAN-CS-87-1163",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "193",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Karlin:1987:SMD,
author = "Anna R. Karlin",
title = "Sharing Memory in Distributed Systems --- Methods and
Applications",
type = "Technical Report",
number = "STAN-CS-87-1164",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "76",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Fraley:1987:SNL,
author = "Christina Fraley",
title = "Solution of Nonlinear Least-Squares Problems",
type = "Technical Report",
number = "STAN-CS-87-1165",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "325",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Okuna:1987:PEO,
author = "H. G. Okuna and A. Gupta",
title = "Parallel Execution of {OPSS} in {QLISP}",
type = "Technical Report",
number = "STAN-CS-87-1166 (KSL-87-43)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1166.html",
abstract = "Production systems (or rule-based systems) are widely
used for the development of expert systems. To speed-up
the execution of production systems, a number of
different approaches are being taken, a majority of
them being based on the use of parallelism. In this
paper, we explore the issues involved in the parallel
implementation of OPS5 (a widely used production-system
language) in QLISP (a parallel dialect of Lisp proposed
by John McCarthy and Richard Gabriel). This paper shows
that QLISP can easily encode most sources of
parallelism in OPS5 that have been previously discussed
in literature. This is significant because the OPS5
interpreter is the first large program to be encoded in
QLISP, and as a result, this is the first practical
demonstration of the expressive power of QLISP. The
paper also lists the most commonly used QLISP
constructs in the parallel implementation (and the
contexts in which they are used), which serve as a hint
to the QLISP implementor about what to optimize. Also
discussed is the exploitation of speculative
parallelism in RHS-evaluation for OPSS. This has not
been previously discussed in the literature.",
acknowledgement = ack-nhfb,
subject-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-87-1166",
}
@TechReport{Okuno:1987:PEO,
author = "H. G. Okuno and A. Gupta",
title = "Parallel Execution of {OPS5} in {QLISP}",
type = "Technical Report",
number = "STAN-CS-87-1166 (KSL-87-43)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Tang:1987:SST,
author = "Wei-Pai Tang",
title = "{Schwarz} Splitting and Template Operators",
type = "Technical Report",
number = "STAN-CS-87-1167 (Classic-87-03)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "139",
month = jun,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wilkin:1987:UED,
author = "D. C. Wilkin",
title = "Using and Evaluating Differential Modeling in
Intelligent Tutoring and Apprentice Learning Systems",
type = "Technical Report",
number = "STAN-CS-87-1175 (KSL-86-62)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1175.html",
abstract = "A powerful approach to debugging and refining the
knowledge structures of a problem solving agent is to
differentially model the actions of the agent against a
gold standard. This paper proposes a framework for
exploring the inherent limitations of such an approach
when a problem solver is differentially modeled against
an expert system. A procedure is described for
determining a performance upper bound for debugging via
differential modeling, called the synthetic agent
method. The synthetic agent method systematically
explores the space of near miss training instances and
expresses the limits of debugging in terms of the
knowledge representation and control language
constructs of the expert system.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1175",
}
@TechReport{Wilkins:1987:UED,
author = "David C. Wilkins and Bruce G. Buchanan",
title = "Using and Evaluating Differential Modeling in
Intelligent Tutoring and Apprentice Learning Systems",
type = "Technical Report",
number = "STAN-CS-87-1175 (KSL-86-62)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = jan,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Flajolet:1987:BPC,
author = "Philippe Flajolet and Dani{\`e}le Gardy and Lo{\"y}s
Thimonier",
title = "Birthday Paradox, Coupon Collectors, Caching
Algorithms, and Self-Organizing Search",
type = "Technical Report",
number = "STAN-CS-87-1176",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = aug,
year = "1987",
DOI = "https://doi.org/10.1016/0166-218X(92)90177-C",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://inria.hal.science/inria-00075832v1/file/RR-0720.pdf",
acknowledgement = ack-nhfb,
author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
remark = "Published in \booktitle{Discrete Applied Mathematics},
{\bf 39}(3), 207-229, 11 November 1992,
doi:10.1016/0166-218X(92)90177-C",
}
@TechReport{Finlayson:1987:LFE,
author = "Ross S. Finlayson and David R. Cheriton",
title = "Log Files: an Extended File Service Exploiting
Write-Once Storage",
type = "Technical Report",
number = "STAN-CS-87-1177",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = aug,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1177.html",
abstract = "A log service provides efficient storage and retrieval
of data that is written sequentially (append-only) and
not subsequently modified. Application programs an
subsystems use log services for recovery, to record
security audit trails, and for performance monitoring.
Ideally, a log service should accommodate very large,
long-lived logs, and provide efficient retrieval and
low space overhead. In this paper, we describe the
design and implementation of the Clio log service. Clio
provides the abstraction of log files: readable,
append-only files that are accessed in the same way as
conventional files. The underlying storage medium is
required only to be append-only; more general types of
write access are not necessary. We show how log files
can be implemented efficiently and robustly on top of
such storage media --- in particular, write-once.
optical disk. In addition, we describe a general
application software storage architecture that makes
use of log files.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1177",
}
@TechReport{Byrd:1987:DCT,
author = "G. T. Byrd and R. Nakano and B. A. Delagi",
title = "A Dynamic, Cut-Through Communications Protocol with
Multicast",
type = "Technical Report",
number = "STAN-CS-87-1178 (KSL-87-44)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = sep,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1178.html",
abstract = "This paper describes a protocol to support
point-to-point interprocessor communications with
multicast. Dynamic, cut-through routing with local flow
control is used to provide a high-throughput,
low-latency communications path between processors. In
addition, multicast transmissions are available, in
which copies of a packet are sent to multiple
destinations using common resources as much as
possible. special packet terminators and selective
buffering are introduced to avoid deadlock during
multicasts. A simulated implementation of the protocol
is also described.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1178",
}
@TechReport{Mann:1987:DND,
author = "Timothy Paul Mann",
title = "Decentralized Naming in Distributed Computer Systems",
type = "Technical Report",
number = "STAN-CS-87-1179",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "101",
month = sep,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wilkins:1987:DRS,
author = "David C. Wilkins and Bruce G. Buchanan",
title = "On Debugging Rule Sets When Reasoning Under
Uncertainty",
type = "Technical Report",
number = "STAN-CS-87-1181 (KSL-86-30)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = may,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1181.html",
abstract = "Heuristic inference rules with a measure of strength
less than certainty have an unusual property: better
individual rules do not necessarily lead to a better
overall rule set. All less-than-certain rules
contribute evidence towards erroneous conclusions for
some problem instances, and the distribution of these
erroneous conclusions over the instances is not
necessarily related to individual rule quality. This
has important consequences for automatic machine
learning of rules, since rule selection is usually
based on measures of quality of individual rules. In
this paper, we explain why the most obvious and
intuitively reasonable solution to this problem,
incremental modification and deletion of rules
responsible for wrong conclusions a la Teiresias, is
not always appropriate. In our experience, it usually
fails to converge to an optimal set of rules. Given a
set of heuristic rules, we explain why the best rule
set should be considered to be the element of the power
set of rules that yields a global minimum error with
respect to generating erroneous positive and negative
conclusions. This selection process is modeled as a
bipartite graph minimization problem and shown to be
NP-complete. A solution method is described, the
Antidote Algorithm, that performs a model-directed
search of the rule space. On an example from medical
diagnosis, the Antidote Algorithm significantly reduced
the number of misdiagnoses when applied to a rule set
generated from 104 training instances.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1181",
}
@TechReport{Wilkins:1987:KBR,
author = "David C. Wilkins and Bruce G. Buchanan",
title = "Knowledge Base Refinement by Monitoring Abstract
Control Knowledge",
type = "Technical Report",
number = "STAN-CS-87-1182 (KSL-87-01)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = aug,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1182.html",
abstract = "An explicit representation of the problem solving
method of an expert system shell as abstract control
knowledge provides a powerful foundation for learning.
This paper describes the abstract control knowledge of
the Heracles expert system shell for heuristic
classification problems, and describes how the Odysseus
apprenticeship learning program uses this
representation to automate ``end-game'' knowledge
acquisition. Particular emphasis is given to showing
how abstract control knowledge facilitates the use of
underlying domain theories by a learning program.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1182",
}
@TechReport{Clancey:1987:KES,
author = "William J. Clancey",
title = "The Knowledge Engineer as Student: Metacognitive bases
for asking good questions",
type = "Technical Report",
number = "STAN-CS-87-1183 (KSL-87-12)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = jan,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1183.html",
abstract = "Knowledge engineers are efficient, active learners.
They systematically approach domains and acquire
knowledge to solve routine, practical problems. By
modeling their methods, we may develop a basis for
teaching other students how to direct their own
learning. In particular, a knowledge engineer is good
at detecting gaps in a knowledge base and asking
focused questions to improve an expert system's
performance. This ability stems from domain-general
knowledge about: problem-solving procedures, the
categorization of routine problem-solving knowledge,
and domain and task differences. this paper studies
these different forms of metaknowledge, and illustrates
its incorporation in an intelligent tutoring system. A
model of learning is presented that describes how the
knowledge engineer detects problem-solving failures and
tracks them back to gaps in domain knowledge, which are
then reformulated as questions to ask a teacher. We
describe how this model of active learning is being
developed and tested in a knowledge acquisition program
for an expert system.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1183",
}
@TechReport{Okuno:1987:FAF,
author = "H. Okuno and N. Osato and I. Takeuchi",
title = "Firmware Approach to Fast {Lisp} Interpreter",
type = "Technical Report",
number = "STAN-CS-87-1184 (KSL-87-57)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = sep,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1184.html",
abstract = "The approach to speed up a Lisp interpreter by
implementing it in firmware seems promising. A
microcoded Lisp interpreter shows good performance for
very simple benchmarks, while it often fails to provide
good performance for larger benchmarks and applications
unless speedup techniques are devised for it. This was
the case for the TAO/ELIS system. This paper describes
various techniques devised for the TAO/ELIS system in
order to speed up the interpreter of the TAO language
implemented on the ELIS Lisp machine. The techniques
include data type dispatch, variable access, function
call and so on. TAO is not only upward compatible with
Common Lisp, but also incorporates logic programming,
object-oriented programming and Fortran/C-like
programming into Lisp programming. TAO also provides
concurrent programming and supports multiple users (up
to eight users). The TAO interpreter for those
programming paradigms is coded fully in microcodes. In
spite of rich functionalities, the speed of interpreted
codes of TAO is comparable to that of compiled codes of
commercial Lisp machines. Furthermore, the speeds of
the interpreted codes of the same program written in
various programming paradigms in TAO does not differ so
much. This speed balance is very important for the
user. Another outstanding feature of the TAO/ELIS
system is its firmware development environments. Micro
Assembler and Linker are written in TAO, which enables
the user to use the capability of TAO in microcodes.
Since debugging tools are also written in mini-Lisp,
many new tools were developed in parallel to debugging
of microcodes. This high level approach to firmware
development environments is very important to provide
high productivity of development.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1184",
}
@TechReport{Haas:1987:BPI,
author = "Zygmunt Haas and David R. Cheriton",
title = "{Blazenet}: a Photonic Implementable Wide-Area
Network",
type = "Technical Report",
number = "STAN-CS-87-1185 (CSL-TR-87-346)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = dec,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1185.html",
abstract = "High-performance wide-area networks are required to
interconnect clusters of computers connected by local
area and metropolitan area networks. Optical fiber
technology provides long distance channels in the
multi-gigabit per second range. The challenge is to
provide switching nodes that handle these data rates
with minimum delay, and at a reasonable cost. In this
paper, we describe a packet switching network,
christened Blazenet, that provides low delay and has
minimal memory requirements. It can be extended to
support multicast and priority delivery. Such a network
can revolutionize the opportunities for distributed
command and control, information and resources sharing,
real-time conferencing, and wide-area parallel
computation, to mention but a few applications.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1185",
}
@TechReport{Manna:1987:HTP,
author = "Zohar Manna and Amir Pnueli",
title = "A Hierarchy of Temporal Properties",
type = "Technical Report",
number = "STAN-CS-87-1186",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = oct,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1186.html",
abstract = "We propose a classification of temporal properties
into a hierarchy which refines the known
safety-liveness classification of properties. The new
classification recognizes the classes of safety,
guarantee, persistence, fairness, and hyper-fairness.
The classification suggested here is based on the
different ways a property of finite computations can be
extended into a property of infinite computations. For
properties that are expressible by temporal logic and
predicate automata, we provide a syntactic
characterization of the formulae and automata that
specify properties in the different classes. We
consider the verification of properties over a given
program, and provide a unique proof principle for each
class.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1186",
}
@TechReport{Morris:1987:YYA,
author = "K. Morris and J. F. Naughton and Y. Saraiya and J. D.
Ullman and A. {Van Gelder}",
title = "{YAWN}! ({YET ANOTHER WINDOW ON NAIL!})",
type = "Technical Report",
number = "STAN-CS-87-1187",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = oct,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nakano:1987:EKB,
author = "Russell Nakano and Masafumi Minami",
title = "Experiments with a Knowledge-Based System on a
Multiprocessor",
type = "Technical Report",
number = "STAN-CS-87-1188 (KSL-87-61)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "53",
month = oct,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1188.html",
abstract = "This paper documents the results we obtained and the
lessons we learned in the design, implementation, and
execution of a simulated real-time application on a
simulated parallel processor. Specifically, our
parallel program ran 100 times faster on a
100-processor multiprocessor. The machine architecture
is a distributed-memory multiprocessor. The target
machine consists of 10 to 1000 processors, but because
of simulator limitations, we ran simulations of
machines consisting of 1 to 100 processors. Each
processor is a computer with its own local memory,
executing an independent instruction stream. There is
no global shared memory; all processes communicate by
message passing. The target programming environment,
called Lamina, encourages a programming style that
stresses performance gains through problem
decomposition, allowing many processors to be brought
to bear on a problem. THe key is to distribute the
processing load over replicated objects, and to
increase throughput by building pipelined sequences of
objects that handle stages of problem solving. We
focused on a knowledge-based application that simulates
real-time understanding of radar tracks, called
Airtrac. This paper describes a portion of the Airtrac
application implemented in Lamina and a set of
experiments that we performed. We confirmed the
following hypotheses: (1) Performance of our concurrent
program improves with additional processors, and
thereby attains a significant level of speedup. (2)
Correctness of our concurrent program can be maintained
despite a high degree of problem decomposition and
highly overloaded input data conditions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1188",
}
@TechReport{Delagi:1987:IASb,
author = "Bruce A. Delagi and Nakul Saraiya and Sayuri Nishimura
and Greg Byrd",
title = "Instrumented Architectural Simulation",
type = "Technical Report",
number = "STAN-CS-87-1189 (KSL-87-65)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 6",
month = nov,
year = "1987",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1189.html",
abstract = "Simulation of systems at an architectural level can
offer an effective way to study critical design choices
if (1) the performance of the simulator is adequate to
examine designs executing significant code bodies --
not just toy problems or small application fragments,
(2) the details of the simulation include the critical
details of the design, (3) the view of the design
presented by the simulator instrumentation leads to
useful insights on the problems with the design, and
(4) there is enough flexibility in the simulation
system so that the asking of unplanned questions is not
suppressed by the weight of the mechanics involved in
making changes either in the design or its measurement.
A simulation system with these goals is described
together with the approach to its implementation. Its
application to the study of a particular class of
multiprocessor hardware system architectures is
illustrated.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-87-1189",
}
@TechReport{Finger:1987:ECD,
author = "Joseph Jeffrey Finger",
title = "Exploiting Constraints in Design Synthesis",
type = "Technical Report",
number = "STAN-CS-88-1204",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "128",
month = apr,
year = "1987",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Na:1988:BDC,
author = "Taleen M. Na",
title = "Bibliography; {Department of Computer Science}
Technical Reports, 1963--1988",
type = "Technical Report",
number = "STAN-CS-87-1180",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-87-1180.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
(CSD) since 1963. Each report is identified by CSD
number, author's name, title, number of pages, and
date. If a given report is available from the
department at the time of the Bibliography's printing,
price is listed. For convenience, an author index,
ordering information, codes, and alternative sources
are also included.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-87-1180",
}
@TechReport{Nazarian:1988:BDC,
author = "Taleen Marashian Nazarian",
title = "Bibliography, {Department of Computer Science}
Technical Reports 1963--1988",
type = "Technical Report",
number = "STAN-CS-88-1180",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "92",
month = jan,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kim:1988:VTC,
author = "Scott Edward Kim",
title = "Viewpoint: Toward a Computer for Visual Thinkers",
type = "Technical Report",
number = "STAN-CS-88-1190",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "137",
month = jan,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cai:1988:IRM,
author = "Chunsheng Cai",
title = "Instantaneous Robot Motion with Contact between
Surfaces",
type = "Technical Report",
number = "STAN-CS-88-1191",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "183",
month = jan,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1988:UMM,
author = "David R. Cheriton",
title = "The Unified Management of Memory in the {V}
Distributed System",
type = "Technical Report",
number = "STAN-CS-88-1192 (CSL-TR-88-359)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = aug,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1988:MW,
author = "Donald E. Knuth and Tracy Larrabee and Paul M.
Roberts",
title = "Mathematical Writing",
type = "Technical Report",
number = "STAN-CS-88-1193",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "115",
month = jan,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1193.html",
abstract = "This report is based on a course of the same name
given at Stanford University during autumn quarter,
1987. Here's the catalog description: CS 209.
Mathematical Writing--Issues of technical writing and
the effective presentation of mathematics and computer
science. Preparation of theses, papers, books, and
``literate'' computer programs. A term paper on a topic
of your choice; this paper may be used for credit in
another course.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1193",
}
@TechReport{Musen:1988:GMB,
author = "Mark A. Musen",
title = "Generation of Model-Based Knowledge-Acquisition Tools
for Clinical-Trial Advice Systems",
type = "Technical Report",
number = "STAN-CS-88-1194",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "294",
month = jan,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bar-Noy:1988:LBR,
author = "A. Bar-Noy and N. Linial and D. Peleg",
title = "A Lower Bound for Radio Broadcast",
type = "Technical Report",
number = "STAN-CS-88-1195",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = feb,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1195.html",
abstract = "A radio network is a synchronous network of processors
that communicate by transmitting messages to their
neighbors, where a processor receives a message in a
given step if and only if it is silent in this step and
precisely one of its neighbors transmits. In this paper
we prove the existence of a family of radius-2 networks
on n vertices for which any broadcast schedule requires
at least $ \Omega ((\log n / \log n)^2) $ rounds of
transmissions. This almost matches an upper bound of $
O(\log_n) $ rounds for networks of radius 2 proved
earlier by Bar-Yehuda, Goldreich, and Itai.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1195",
}
@TechReport{Latombe:1988:MPU,
author = "Jean-Claude Latombe",
title = "Motion Planning with Uncertainty: The Preimage
Backchaining Approach",
type = "Technical Report",
number = "STAN-CS-88-1196",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 62",
month = mar,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1196.html",
abstract = "This paper addresses the problem of planning robot
motions in the presence of uncertainty. It explores an
approach to this problem, known as the preimage
backchaining approach. Basically, a preimage is a
region in space, such that if the robot executes a
certain motion command from within this region, it is
guaranteed to attain a target and to terminate into it.
Preimage backchaining consists of reasoning backward
from a given goal region, by computing preimages of the
goal, and then recursively preimages of the preimages,
until some preimages include the initial region where
it is known at planning time that the robot will be
before executing the motion plan.",
acknowledgement = ack-nhfb,
pdfpages = "63",
xxnumber = "CS-TR-88-1196",
}
@TechReport{Cheriton:1988:VMI,
author = "D. R. Cheriton and A. Gupta and P. D. Boyle and H. A.
Goosen",
title = "The {VMP} Multiprocessor: Initial Experience,
Refinements and Performance Evaluation",
type = "Technical Report",
number = "STAN-CS-88-1197 (CSL-TR-88-354)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = mar,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1197.html",
abstract = "VMP is an experimental multiprocessor being developed
at Stanford University, suitable for high-performance
workstations and server machines. Its primary novelty
lies in the use of software management of the
preprocessor caches and the design decisions in the
cache and bus that make this approach feasible. The
design and some uniprocessor trace-driven simulations
indicating its performance have been reported
previously. In this paper, we present our initial
experience with the VMP design based on a running
prototype as well as various refinements to the design.
Performance evaluation is based both on measurement of
actual execution as well as trace-driven simulation of
multiprocessor executions from the Mach operating
system.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1197",
}
@TechReport{Lamping:1988:USP,
author = "John Lamping",
title = "A Unified System of Parameterization for Programming
Languages",
type = "Technical Report",
number = "STAN-CS-88-1198",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = apr,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Buning:1988:PVA,
author = "H. K. Buning and T. Lettman and E. W. Mayr",
title = "Projections of Vector Addition System Reachability
Sets are Semilinear",
type = "Technical Report",
number = "STAN-CS-88-1199",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = mar,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1199.html",
abstract = "The reachability sets of Vector Addition Systems of
dimension six or more can be non-semilinear. This may
be one reason why the inclusion problem (as well as the
equality problem) for reachability sets of vector
addition systems in general is undecidable, even though
the reachability problem itself is known to be
decidable. We show that any one-dimensional projection
of the reachability set of an arbitrary vector addition
system is semilinear, and hence, ``simple''.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1199",
}
@TechReport{Anderson:1988:PAA,
author = "R. J. Anderson and E. W. Mayr and M. K. Warmuth",
title = "Parallel Approximation Algorithms for Bin Packing",
type = "Technical Report",
number = "STAN-CS-88-1200",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = mar,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1200.html",
abstract = "We study the parallel complexity of polynomial
heuristics for the bin packing problem. We show that
some well-known (and simple) methods like first-fit-
decreasing are P-complete, and it is hence very
unlikely that they can be efficiently parallelized. On
the other hand, we exhibit an optimal NC algorithm that
achieves the same performance bound as does FFD.
Finally, we discuss parallelization of polynomial
approximation algorithms for bin packing based on
discretization.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1200",
}
@TechReport{Flajolet:1988:SAG,
author = "Philippe Flajolet and Andrew Odlyzko",
title = "Singularity Analysis of Generating Functions",
type = "Technical Report",
number = "STAN-CS-88-1201",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = apr,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
}
@TechReport{Baudinet:1988:PTP,
author = "Marianne Baudinet",
title = "Proving Termination Properties of {PROLOG} Programs: a
Semantic Approach",
type = "Technical Report",
number = "STAN-CS-88-1202",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = mar,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Baudinet:1988:STL,
author = "Marianne Baudinet",
title = "On the Semantics of Temporal Logic Programming",
type = "Technical Report",
number = "STAN-CS-88-1203",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1203.html",
abstract = "Recently, several researchers have suggested directly
exploiting in a programming language temporal logic's
ability to describe changing worlds. The resulting
languages are quite diverse. They are based on
different subsets of temporal logic and use a variety
of execution mechanisms. So far, little attention has
been paid to the formal semantics of these languages.
In this paper, we study the semantics of an instance of
temporal logic programming, namely, the TEMPLOG
language defined by Abadi and Manna. We first give
declarative semantics for TEMPLOG, in model-theoretic
and in fixpoint terms. Then, we study its operational
semantics and prove soundness and completeness theorems
for the temporal-resolution proof method underlying its
execution mechanism.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1203",
}
@TechReport{Armstrong:1988:DRC,
author = "Brian Stewart Randall Armstrong",
title = "Dynamics for Robot Control: Friction Modeling and
Ensuring Excitation During Parameter Identification",
type = "Technical Report",
number = "STAN-CS-88-1205",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "198",
month = may,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Weening:1988:PLS,
author = "Joseph S. Weening",
title = "A Parallel {Lisp} Simulator",
type = "Technical Report",
number = "STAN-CS-88-1206",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = may,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1206.html",
abstract = "CSIM is a simulator for parallel Lisp, based on a
continuation passing interpreter. It models a
shared-memory multiprocessor executing programs written
in Common Lisp, extended with several primitives for
creating and controlling processes. This paper
describes the structure of the simulator, measures its
performance, and gives an examples its use with a
parallel Lisp program.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1206",
}
@TechReport{Burdick:1988:KAD,
author = "Joel W. Burdick",
title = "Kinematic Analysis and Design of Redundant Robot
Manipulators",
type = "Technical Report",
number = "STAN-CS-88-1207",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "267",
month = mar,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Feder:1988:T,
author = "Tomas Feder",
title = "Toetjes",
type = "Technical Report",
number = "STAN-CS-88-1208",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1208.html",
abstract = "A number is secretly chosen from the interval [0, 1],
and n players try to guess this number. When the secret
number is revealed, the player with the closest guess
wins. We describe an optimal strategy for a version of
this game.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1208",
}
@TechReport{Goldberg:1988:CAG,
author = "A. V. Goldberg and S. A. Plotkin and E. Tardos",
title = "Combinatorial Algorithms for the Generalized
Circulation Problem",
type = "Technical Report",
number = "STAN-CS-88-1209",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1209.html",
abstract = "We consider a generalization of the maximum flow
problem in which the amounts of flow entering and
leaving an arc are linearly related. More precisely, if
x(e) units of flow enter an arc e, x(e) gamma(e) units
arrive at the other end. For instance, nodes of the
graph can correspond to different currencies, with the
multipliers being the exchange rates. We require
conservation of flow at every node except a given
source node. The goal is to maximize the amount of flow
excess at the source. This problem is a special case of
linear programming, and therefore can be solved in
polynomial time. In this paper we present the first
polynomial time combinatorial algorithms for this
problem. The algorithms are simple and intuitive.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1209",
}
@TechReport{Bronstein:1988:SFS,
author = "Alexandre Bronstein and Carolyn L. Talcott",
title = "String-Functional Semantics for Formal Verification of
Synchronous Circuits",
type = "Technical Report",
number = "STAN-CS-88-1210",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "62",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1210.html",
abstract = "A new functional semantics is proposed for synchronous
circuits, as a basis for reasoning formally about that
class of hardware systems. Technically, we define an
extensional semantics with monotonic length-preserving
functions on finite strings, and an intensional
semantics based on functionals on those functions. As
support for the semantics we prove the equivalence of
the extensional semantics with a simple operational
semantics, as well as a characterization of circuits
which obey the ``every loop is clocked'' design rule.
Also, we develop the foundations in complete detail
both to increase confidence in the theory, and as a
prerequisite to its future mechanization.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1210",
}
@TechReport{Goldberg:1988:STP,
author = "A. V. Goldberg and S. A. Plotkin and P. M. Vaidya",
title = "Sublinear-Time Parallel Algorithms",
type = "Technical Report",
number = "STAN-CS-88-1211",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1211.html",
abstract = "This paper presents the first sublinear-time
deterministic parallel algorithms for bipartite
matching and several related problems, including
maximal node-disjoint paths, depth-first search, and
flows in zero-one networks. Our results are based on a
better understanding of the combinatorial structure of
the above problems, which leads to new algorithmic
techniques. In particular, we show how to use maximal
matching to extend, in parallel, a current set of
node-disjoint paths and how to take advantage of the
parallelism that arises when a large number of nodes
are ``active'' during an execution of a push/relabel
network flow algorithm. We also show how to apply our
techniques to design parallel algorithms for the
weighted versions of the above problems. In particular,
we present sublinear-time deterministic parallel
algorithms for finding a minimum-weight bipartite
matching and for finding a minimum-cost flow in a
network with zero-one capacities, if the weights are
polynomially bounded integers.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1211",
}
@TechReport{Worley:1988:IRI,
author = "Patrick Haven Worley",
title = "Information Requirements and the Implications for
Parallel Computation",
type = "Technical Report",
number = "STAN-CS-88-1212",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "148",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1988:ERS,
author = "David R. Cheriton",
title = "Exploiting Recursion to Simplify {RPC} Communication
Architectures",
type = "Technical Report",
number = "STAN-CS-88-1213 (CSL-TR-88-360)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Deering:1988:MRI,
author = "Stephen E. Deering",
title = "Multicast Routing in Internetworks and Extended
{LANs}",
type = "Technical Report",
number = "STAN-CS-88-1214 (CSL-TR-88-361)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = jun,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1214.html",
abstract = "Multicasting is used within local-area networks to
make distributed applications more robust and more
efficient. The growing need to distribute applications
across multiple, interconnected networks, and the
increasing availability of high-performance,
high-capacity switching nodes and networks, lead us to
consider providing LAN-style multicasting across an
internetwork. In this paper, we propose extensions to
two common internetwork routing algorithms --
distance-vector routing and link-state routing -- to
support low-delay datagram multicasting. We also
suggest modifications to the single-spanning-tree
routing algorithm, commonly used by link-layer bridges,
to reduce the costs of multicasting in large extended
LANs. Finally, we show how different link-layer and
network-layer multicast routing algorithms can be
combined hierarchically to support multicasting across
large, heterogeneous internetworks.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1214",
}
@TechReport{Stolfi:1988:PCG,
author = "Jorge Stolfi",
title = "Primitives for Computational Geometry",
type = "Technical Report",
number = "STAN-CS-88-1215",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "236",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Schaffer:1988:API,
author = "Alejandro A. Schaffer",
title = "Algorithmic Problems on Intersection Graphs",
type = "Technical Report",
number = "STAN-CS-88-1216",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "139",
month = jul,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Brooks:1988:TVD,
author = "Kenneth P. Brooks",
title = "A Two-View Document Editor with User-Definable
Document Structure",
type = "Technical Report",
number = "STAN-CS-88-1217",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "203",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Bar-Noy:1988:SMA,
author = "Amotz Bar-Noy and David Peleg",
title = "Square Meshes are not Always Optimal",
type = "Technical Report",
number = "STAN-CS-88-1218",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = aug,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1218.html",
abstract = "In this paper we consider mesh connected computers
with multiple buses, providing broadcast facilities
along rows and columns.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1218",
}
@TechReport{Flajolet:1988:FCE,
author = "Philippe Flajolet and Donald E. Knuth and Boris
Pittel",
title = "The First Cycles in an Evolving Graph",
type = "Technical Report",
number = "STAN-CS-88-1219",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "49",
month = sep,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Philippe Flajolet (1 December 1948--22 March 2011)",
}
@TechReport{Vistnes:1988:CTA,
author = "Richard L. Vistnes",
title = "Computer Texture Analysis and Segmentation",
type = "Technical Report",
number = "STAN-CS-88-1220",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "186",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Beigel:1988:QLR,
author = "Richard Beigel",
title = "Query-Limited Reducibilities",
type = "Technical Report",
number = "STAN-CS-88-1221",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "144",
month = jul,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hailpern:1988:LBM,
author = "Max Hailpern",
title = "Load Balancing for Massively Parallel Soft Real-Time
Systems",
type = "Technical Report",
number = "STAN-CS-88-1222 (KSL-88-62)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = sep,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1988:ET,
author = "Donald E. Knuth",
title = "The Errors of {\TeX}",
type = "Technical Report",
number = "STAN-CS-88-1223",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "75",
month = sep,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Singh:1988:DBC,
author = "Vineet Singh",
title = "Distributing Backward-Chaining Deductions to Multiple
Processors",
type = "Technical Report",
number = "STAN-CS-88-1224",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "222",
month = apr,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Mayr:1988:PAA,
author = "Ernst W. Mayr",
title = "Parallel Approximation Algorithms",
type = "Technical Report",
number = "STAN-CS-88-1225",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = sep,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1225.html",
abstract = "Many problems of great practical importance are hard
to solve computationally, at least if exact solutions
are required. We survey a number of (NP- or P-complete)
problems for which fast parallel approximation
algorithms are known: The 0-1 knapsack problem,
binpacking, the minimal makeshift problem, the list
scheduling problem, greedy scheduling, and the high
density subgraph problem. Algorithms for these problems
are presented highlighting the underlying techniques
and principles, and several types of parallel
approximation schemes are exhibited.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1225",
}
@TechReport{Hayes-Roth:1988:MIS,
author = "Barbara Hayes-Roth",
title = "Making Intelligent Systems Adaptive",
type = "Technical Report",
number = "STAN-CS-88-1226 (KSL-88-64)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = oct,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1226.html",
abstract = "Contemporary intelligent systems are isolated
problem-solvers. They accept particular classes of
problems, reason about them, perhaps request additional
information, and eventually produce solutions. By
contrast, human beings and other intelligent animals
continuously adapt to the demands and opportunities
presented by a dynamic environment. Adaptation plays a
critical role in everyday behaviors, such as conducting
a conversation, as well as in sophisticated
professional behaviors, such as monitoring critically
ill medical patients. To make intelligent systems
similarly adaptive, we must augment their reasoning
capabilities with capabilities for perception and
action. Equally important, we must endow them with an
attentional mechanism to allocate their limited
computational resources among competing perceptions,
actions, and cognitions, in real time. In this paper,
we discuss functional objectives for ``adaptive
intelligent systems,'' an architecture designed to
achieve those objectives, and our continuing study of
both objectives and architecture in the context of
particular tasks.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1226",
}
@TechReport{Ahuja:1988:FMC,
author = "Ravindra K. Ahuja and Andrew V. Goldberg and James B.
Orlin and Robert E. Tarjan",
title = "Finding Minimum-Cost Flows by Double Scaling",
type = "Technical Report",
number = "STAN-CS-88-1227",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 27",
month = sep,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1227.html",
abstract = "Several researchers have recently developed new
techniques that give fast algorithms for the
minimum-cost flow problem. In this paper we combine
several of these techniques to yield an algorithm
running in $ O(n m \log \log U \log (n C)) $ time on
networks with $n$ vertices, $m$ edges, maximum arc
capacity $U$, and maximum arc cost magnitude $C$. The
major techniques used are the capacity-scaling approach
of Edmonds and Karp, the excess-scaling approach of
Ahuja and Orlin, the cost-scaling approach Goldberg and
Tarjan, and the dynamic tree data structure of Sleator
and Tarjan. For nonsparse graphs with large maximum arc
capacity, we obtain a similar but slightly better
bound. We also obtain a slightly better bound for the
(noncapacitated) transportation problem. In addition,
we discuss a capacity-bounding approach to the
minimum-cost flow problem.",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-88-1227",
}
@TechReport{Goldberg:1988:PAF,
author = "A. V. Goldberg and R. E. Tarjan",
title = "A Parallel Algorithm for Finding a Blocking Flow in an
Acyclic Network",
type = "Technical Report",
number = "STAN-CS-88-1228",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = nov,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1228.html",
abstract = "We propose a simple parallel algorithm for finding a
blocking flow in an acyclic network. On an $n$-vertex,
$m$-arc network, our algorithm runs in $ O(n \log n) $
time and $ O(n m) $ space using an m-processor EREW
PRAM. A consequence of our algorithm is an $ O(n^2
(\log n) \log (n C)) $-time, $ O(n m) $-space,
$m$-processor algorithm for the minimum-cost
circulation problem, on a network with integer arc
capacities of magnitude at most $C$.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1228",
}
@TechReport{Hayes-Roth:1988:DIWa,
author = "B. Hayes-Roth and M. Hewett and R. Washington and R.
Hewett and A. Seiver",
title = "Distributing Intelligence within an Individual",
type = "Technical Report",
number = "STAN-CS-88-1229 (KSL-88-50)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = nov,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1229.html",
abstract = "Distributed artificial intelligence (DAI) refers to
systems in which decentralized, cooperative agents work
synergistically to perform a task. Alternative
specifications of DAI resemble particular biological or
social systems, such as teams, contract nets, or
societies. Our DAI model resembles a single individual
comprising multiple loosely coupled agents for
perception, action, and cognition functions. We
demonstrate the DAI individual in the Guardian system
for intensive-care monitoring and argue that it is more
appropriate than the prevalent team model for a large
class of similar applications.",
acknowledgement = ack-nhfb,
pdfpages = "26",
xxnumber = "CS-TR-88-1229",
}
@TechReport{Hayes-Roth:1988:DIW,
author = "B. Hayes-Roth and M. Hewett and R. Washington and R.
Hewett",
title = "Distributing Intelligence within an Individual",
type = "Technical Report",
number = "STAN-CS-88-1229 (KSL-88-50)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = nov,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1988:SVC,
author = "Zohar Manna and Amir Pnueli",
title = "Specification and Verification of Concurrent Programs
by For-All Automata",
type = "Technical Report",
number = "STAN-CS-88-1230",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = nov,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1230.html",
abstract = "For-all automata are non-deterministic finite-state
automata over infinite sequences. They differ from
conventional automata in that a sequence is accepted if
all runs of the automaton over the sequence are
accepting. These automata are suggested as a formalism
for the specification and verification of temporal
properties of concurrent programs. It is shown that
they are as expressive as extended temporal logic
(ETL), and, in some cases, provide a more compact
representation of properties than temporal logic. A
structured diagram notation is suggested for the
graphical representation of these automata. A single
sound and complete proof rule is presented for proving
that all computations of a program have the property
specified by a for-all automaton.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1230",
}
@TechReport{Cohn:1988:BOP,
author = "Evan R. Cohn",
title = "The Beta Operation: a Parallel Primitive",
type = "Technical Report",
number = "STAN-CS-88-1231",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "69",
month = nov,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Baudinet:1988:TLP,
author = "Marianne Baudinet",
title = "Temporal Logic Programming is Complete and
Expressive",
type = "Technical Report",
number = "STAN-CS-88-1232",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = oct,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ross:1988:PSW,
author = "Kenneth A. Ross",
title = "A Procedural Semantics for Well Founded Negation in
Logic Programs",
type = "Technical Report",
number = "STAN-CS-88-1233",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 29",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/88/1233/CS-TR-88-1233.pdf;
http://www-db.stanford.edu/TR/CS-TR-88-1233.html",
abstract = "We introduce global SLS-resolution, a procedural
semantics for well-founded negation as defined by Van
Gelder, Ross and Schlipf. Global SLS-resolution extends
Przymusinski's SLS-resolution, and may be applied to
all programs, whether locally stratified or not. Global
SLS-resolution is defined in terms of global trees, a
new data structure representing the dependence of goals
on derived negative subgoals. We prove that global
SLS-resolution is sound with respect to the
well-founded semantics, and complete for
non-floundering queries.",
acknowledgement = ack-nhfb,
pdfpages = "32",
xxnumber = "CS-TR-88-1233",
}
@TechReport{Pittel:1988:ANS,
author = "Boris Pittel",
title = "The Average Number of Stable Matchings",
type = "Technical Report",
number = "STAN-CS-88-1234",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1234.html",
abstract = "The probable behavior of an instance of size n of the
stable marriage problem, chosen uniformly at random, is
studied.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1234",
}
@TechReport{Knuth:1988:CME,
author = "Donald E. Knuth",
title = "Concrete Mathematics Errata",
type = "Technical Report",
number = "STAN-CS-88-1235",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = dec,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Shoham:1988:TAR,
author = "Yoav Shoham",
title = "Time for Action: On the Relation between Time,
Knowledge, and Action",
type = "Technical Report",
number = "STAN-CS-88-1236",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1236.html",
abstract = "We consider the role played by the concept of action
in AI. We first briefly summarize the advantages and
limitations of past approaches to taking the concept as
primitive, as embodied in the situation calculus and
dynamic logic. We also briefly summarize the
alternative, namely adopting a temporal framework, and
point out its complementary advantages and limitations.
We then propose a framework that retains the advantages
of both viewpoints, and that ties the notion of action
closely to that of knowledge. Specifically, we propose
starting with the notion of time lines, and defining
the notion of action as the ability to make certain
choices among sets of time lines. Our definitions shed
new light on the connection between time, action,
knowledge and ignorance, choice-making, feasibility,
and simultaneous reasoning about the same events at
different levels of detail.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1236",
}
@TechReport{Shoham:1988:BDK,
author = "Yoav Shoham and Yoram Moses",
title = "Belief as Defeasible Knowledge",
type = "Technical Report",
number = "STAN-CS-88-1237",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1237.html",
abstract = "We investigate the relation between the notions of
knowledge and belief. Contrary to the well-known slogan
about knowledge being ``justified, true belief,'' we
propose that belief be viewed as defeasible knowledge.
Specifically, we offer a definition of belief as
knowledge-relative-to-assumptions, and tie the
definition to the notion of nonmonotonicity. Our
definition has several advantages. First, it is short.
Second, we do not need to add anything to the logic of
knowledge: the right properties of belief fall out of
the definition and the properties of knowledge. Third,
the connection between knowledge and belief is derived
from one fundamental principle, which is more
enlightening than a collection of arbitrary-seeming
axioms relating the two notions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1237",
}
@TechReport{Bothner:1988:ECL,
author = "Per Magnus Bothner",
title = "Efficiently Combining Logical Constraints with
Functions",
type = "Technical Report",
number = "STAN-CS-88-1238",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "191",
month = dec,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Bar-Noy:1988:SMF,
author = "Amotz Bar-Noy and Joseph Naor",
title = "Sorting, Minimal Feedback Sets and {Hamilton} Paths in
Tournaments",
type = "Technical Report",
number = "STAN-CS-88-1239",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 20",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1239.html",
abstract = "We present a general method for translating sorting by
comparisons algorithms to algorithms that compute a
Hamilton path in a tournament. The translation is based
on the relation between minimal feedback sets and
Hamilton paths in tournaments. We prove that there is a
one to one correspondence between the set of minimal
feedback sets and the set of Hamilton paths. In the
comparison model, all the tradeoffs for sorting between
the number of processors and the number of rounds hold
when a Hamilton path is computed. For the CRCW model,
with O(n) processors, we show the following: (i) Two
paths in a tournament can be merged in $ O(\log \log n)
$ time (Valiant's algorithm): (ii) a Hamilton path can
be computed in $ O(\log n) $ time (Cole's algorithm).
This improves a previous algorithm for computing a
Hamilton path.",
acknowledgement = ack-nhfb,
pdfpages = "24",
xxnumber = "CS-TR-88-1239",
}
@TechReport{Gafni:1988:SEC,
author = "E. Gafni and J. Naor and P. Ragde",
title = "On Separating the {EREW} and {CREW PRAM} Models",
type = "Technical Report",
number = "STAN-CS-88-1240",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = dec,
year = "1988",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-88-1240.html",
abstract = "In [6], Snir proposed the Selection Problem (searching
in a sorted table) to show that the CREW PRAM is
strictly more powerful than the EREW PRAM. This problem
defines a partial function, that is, one that is
defined only on a restricted set of inputs. Recognizing
whether an arbitrary input belongs to this restricted
set is hard for both CREW and EREW PRAMs. The existence
of a total function that exhibits the power of the CREW
model over the EREW model was an open problem. Here we
solve this problem by generalizing the Selection
problem to a Decision Tree problem which is defined on
a full domain and to which Snir's lower bound
applies.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-88-1240",
}
@TechReport{Knuth:1988:SH,
author = "Donald Knuth and Rajeev Motwani and Boris Pittel",
title = "Stable Husbands",
type = "Technical Report",
number = "STAN-CS-88-1241",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = dec,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wilkins:1988:ALT,
author = "David C. Wilkins",
title = "Apprenticeship Learning Techniques for Knowledge Based
Systems",
type = "Technical Report",
number = "STAN-CS-88-1242",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "153",
month = dec,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hayes-Roth:1988:DIWb,
author = "Barbara Hayes-Roth and Michael Hewett and Richard
Washington and Rattikorn Hewett and Adam Seiver",
title = "Distributing Intelligence within an Individual",
type = "Technical Report",
number = "STAN-CS-88-1992 (KSL-88-50)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 21",
month = oct,
year = "1988",
bibdate = "Sat Nov 08 10:17:52 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://bitsavers.org/pdf/stanford/cs_techReports/CS-TR-88-1229_Distributing_Intelligence_Within_An_Individual.pdf",
acknowledgement = ack-nhfb,
remark = "The first four authors are from the Knowledge Systems
Laboratory, and the fifth form the Palo Alto Veterans
Administration Medical Center. To appear in
\booktitle{Distributed Artificial Intelligence}, Vol.
2, L. Gasser and M. N. Huhns (Eds.), Morgan Kaufman,
1988.",
}
@TechReport{DeMoor:1989:RSV,
author = "Bart L. R. {De Moor} and Gene H. Golub",
title = "The restricted singular value decomposition:
properties and applications",
type = "Technical Report",
number = "STAN-CS-2001",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "69",
month = "????",
year = "1989",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "decomposition (mathematics)",
xxnumber = "CS-TR-2001",
}
@TechReport{DeMoor:1989:GSV,
author = "Bart L. R. {De Moor} and Gene H. Golub",
title = "Generalized singular value decompositions: a proposal
for a standardized nomenclature",
type = "Technical Report",
number = "STAN-CS-2002",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = "????",
year = "1989",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "decomposition (mathematics)",
xxnumber = "CS-TR-2002",
}
@TechReport{Elman:1989:IMC,
author = "Howard C. Elman and Gene H. Golub",
title = "Iterative methods for cyclically reduced
non-self-adjoint linear systems {II}",
type = "Technical Report",
number = "STAN-CS-2238 (UMIACS-TR-89-45)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 26",
month = jun,
year = "1989",
DOI = "https://doi.org/10.1090/S0025-5718-1991-1052093-1;
https://doi.org/10.5555/891608",
MRclass = "65F10 65N20 15A06",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://dl.acm.org/doi/10.5555/891608;
https://www.jstor.org/stable/2008506",
abstract = "We perform an analytic and experimental study of line
iterative methods for solving linear systems arising
from finite difference discretizations of
non-self-adjoint elliptic partial differential
equations on two-dimensional domains. The methods
consist of performing one step of cyclic reduction,
followed by solution of the resulting reduced system by
line relaxation. We augment previous analyses of
one-line methods, and we derive a new convergence
analysis for two-line methods, showing that both
classes of methods are highly effective for solving the
convection--diffusion equation. In addition, we compare
the experimental performance of several variants of
these methods, and we show that the methods can be
implemented efficiently on parallel architectures",
abstract-2 = "We study iterative methods for solving linear systems
of the type arising from two-cyclic discretizations of
non-self-adjoint two-dimensional elliptic partial
differential equations. A prototype is the
convection-diffusion equation. The methods consist of
applying one step of cyclic reduction, resulting in a
``reduced system'' of half the order of the original
discrete problem, combined with a reordering and a
block iterative technique for solving the reduced
system. For constant coefficient problems, we present
analytic bounds on the spectral radii of the iteration
matrices in terms of cell Reynolds numbers that show
the methods to be rapidly convergent. In addition, we
describe numerical experiments that supplement the
analysis and that indicate that the methods compare
favorably with methods for solving the ``unreduced''
system.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "convection--diffusion; iterative methods
(mathematics); linear systems; non-self-adjoint;
reduced system",
remark = "Published in \booktitle{Mathematics of Computation},
{\bf 54}(190) 671--700, April 1990,
doi:10.2307/2008506.",
xxnumber = "CS-TR-2238, UMIACS-TR-89-45",
}
@TechReport{Elhay:1989:UDO,
author = "Sylvan Elhay and Gene H. Golub and Jaroslav
Kautsk{\'y}",
title = "Updating and downdating of orthogonal polynomials with
data fitting applications",
type = "Technical Report",
number = "STAN-CS-89-04 (NA-89-04)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = "????",
year = "1989",
DOI = "https://doi.org/10.1137/0612024",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://dl.acm.org/doi/10.1137/0612024",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "least squares; orthogonal polynomials",
remark = "Published in \booktitle{SIAM Journal on Matrix
Analysis and Applications}, {\bf 12}(2) 327--353, April
1991. doi:10.1137/0612024.",
xxnumber = "CS-TR-89-04, NA-89-04",
}
@TechReport{Golub:1989:MMI,
author = "Gene H. Golub and Martin H. Gutknecht",
title = "Modified moments for indefinite weight functions",
type = "Technical Report",
number = "STAN-CS-89-08 (NA-89-08)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = "????",
year = "1989",
bibdate = "Mon Oct 24 10:35:29 MDT 1994",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://people.math.ethz.ch/~mhg/talks/GolGreview/GolGrev.pdf
(slides)",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
keywords = "orthogonal polynomials",
remark = "Published in \booktitle{Numerische Mathematik}, {\bf
57}(6/7) 607--624, July 1990",
xxnumber = "CS-TR-89-08, NA-89-08",
}
@TechReport{Lin:1989:ASU,
author = "Fangzhen Lin and Yoav Shoham",
title = "Argument Systems: a uniform basis for nonmonotonic
reasoning",
type = "Technical Report",
number = "STAN-CS-89-1243",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = jan,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Fraley:1989:SPN,
author = "Christina Fraley",
title = "Software Performance on Nonlinear Least-Squares
Problems",
type = "Technical Report",
number = "STAN-CS-89-1244",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "128",
month = jan,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1244.html",
abstract = "This paper presents numerical results for a large and
varied set of problems using software that is widely
available and has undergone extensive testing. The
algorithms implemented in this software include
Newton-based linesearch and trust-region methods for
unconstrained optimization, as well as Gauss-Newton,
Levenberg-Marquardt, and special quasi-Newton methods
for nonlinear least squares. Rather than give a
critical assessment of the software itself, our
original purpose was to use the best available software
to compare the underlying algorithms, to identify
classes of problems for each method on which the
performance is either very good or very poor and to
provide benchmarks for future work in nonlinear least
squares and unconstrained optimization. The variability
in the results made it impossible to meet either of the
first two goals; however the results are significant as
a step toward explaining why these aims are so
difficult to accomplish.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1244",
}
@TechReport{Wiederhold:1989:MOR,
author = "Gio Wiederhold and Thierry Barsalou and Surajit
Chaoudhuri",
title = "Managing Objects in a Relational Framework",
type = "Technical Report",
number = "STAN-CS-89-1245",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "103",
month = jan,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Byrd:1989:MCM,
author = "Gregory Byrd and Nakul Saraiya and Bruce Delagi",
title = "Multicast Communication in Multiprocessor Systems",
type = "Technical Report",
number = "STAN-CS-89-1246",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = jan,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rabinov:1989:PQC,
author = "Arkady Rabinov and Igor Rivin",
title = "Programming in {Qlisp} --- a Case Study",
type = "Technical Report",
number = "STAN-CS-89-1247",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = jan,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1989:ENS,
author = "Andrew V. Goldberg and Michael D. Grigoriadis and
Robert E. Tarjan",
title = "Efficiency of the Network Simplex Algorithm for the
Maximum Flow Problem",
type = "Technical Report",
number = "STAN-CS-89-1248",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = feb,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1248.html",
abstract = "Goldfarb and Hao have proposed a network simplex
algorithm that will solve a maximum flow problem on an
$n$-vertex, $m$-arc network in at most $ n m$ pivots
and $ O(n^2 m) $ time. In this paper we describe how to
implement their algorithm to run in $ O(n m \log n) $
time by using an extension of the dynamic tree data
structure of Sleator and Tarjan. This bound is less
than a logarithmic factor larger than that of any other
known algorithm for the problem.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1248",
}
@TechReport{Baudinet:1989:LPS,
author = "Marianne Baudinet",
title = "Logic Programming Semantics: Techniques and
Applications",
type = "Technical Report",
number = "STAN-CS-89-1249",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "172",
month = feb,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mason:1989:SCA,
author = "Ian Mason and Carolyn Talcott",
title = "A sound and complete axiomatization of operational
equivalence between programs with memory",
type = "Technical Report",
number = "STAN-CS-89-1250",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = mar,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1250.html",
abstract = "In this paper we present a formal system for deriving
assertions about programs with memory. The assertions
we consider are of the following three forms: (i) e
diverges (i.e. fails to reduce to a value), written $
\arru e $; (ii) $ e_O $ and $ e_1 $ reduce to the same
value and have exactly the same effect on memory,
written $ e_O \bksimlr e_1 $; and (iii) $ e_O $ and $
e_1 $ reduce to the same value and have the same effect
on memory up to production of garbage (are strongly
isomorphic), written $_O \bksimeq e_1$. The e, $ e_j$
are expressions of a first-order Scheme- or Lisp-like
language with the data operations atom, eq, car, cdr,
cons, setcar, setcdr, the control primitives let and
if, and recursive definition of function symbols.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1250",
}
@TechReport{Huggins:1988:EHM,
author = "K. Cleo R. Huggins",
title = "{Egyptian} Hieroglyphs for Modern Printing Devices: an
Outline Font of {Egyptian} Hieroglyphs for
{PostScript(R)} Printers",
type = "Technical Report",
number = "STAN-CS-89-1251",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 60",
day = "1",
month = jun,
year = "1988",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA326695.pdf",
abstract = "Students of Egyptian history face economic and
technological constraints in the reproduction of
hieroglyphs. Ideally, they need a system which provides
a collection of professional quality symbols and a
means to arrange and integrate them in print. The Apple
Macintosh and a laser printer font might offer a
reasonable and inexpensive solution. The goal of this
project is to develop that font and, in so doing,
provide a model for solving similar problems in the
reproduction of unusual, non-Latin characters.",
acknowledgement = ack-nhfb,
pdfpages = "61",
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1989:NFA,
author = "Andrew Goldberg and Eva Tardos and Robert Tarjan",
title = "Network Flow Algorithms",
type = "Technical Report",
number = "STAN-CS-89-1252",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "82",
month = mar,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Vavasis:1989:CFP,
author = "Stephen A. Vavasis",
title = "Complexity of Fixed Point Computations",
type = "Technical Report",
number = "STAN-CS-89-1253",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "102",
month = apr,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1989:M,
author = "Donald E. Knuth and Tomas G. Rokicki and Arthur L.
Samuel",
title = "{METAFONTware}",
type = "Technical Report",
number = "STAN-CS-89-1255",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "209",
day = "1",
month = may,
year = "1989",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/font.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/89/1255/CS-TR-89-1255.pdf;
http://www-db.stanford.edu/TR/CS-TR-89-1255.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1255",
abstract = "This report contains the complete WEB documentation
for four utility programs that are often used in
conjunction with METAFONT: GFtype, GFtoPK, GFtoDVI, and
MFT. This report is analogous to TeXware, published in
1986 (STAN-CS-86-1097). METAFONTware completes the
set.",
acknowledgement = ack-nhfb,
author-dates = "Arthur Lee Samuel (5 December 1901--29 July 1990)",
documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1255",
xxnumber = "CS-TR-89-1255",
}
@TechReport{Billawala:1989:MPS,
author = "Neenie Billawala",
title = "{Metamarks}: Preliminary Studies for a {Pandora}'s Box
of Shapes",
type = "Technical Report",
number = "STAN-CS-89-1256",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = may,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Barraquand:1989:RMP,
author = "Jerome Barraquand and Jean-Claude Latombe",
title = "Robot Motion Planning: a distributed representation
approach",
type = "Technical Report",
number = "STAN-CS-89-1257",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "56",
month = may,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chen:1989:HSB,
author = "Pang-Chieh Chen",
title = "Heuristic Sampling on Backtrack Trees",
type = "Technical Report",
number = "STAN-CS-89-1258",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "172",
month = may,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1989:IPM,
author = "Andrew V. Goldberg and Serge A. Plotkin and David B.
Shmoys and Eva Tardos",
title = "Interior-Point Methods in Parallel Computation",
type = "Technical Report",
number = "STAN-CS-89-1259",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = may,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1259.html",
abstract = "ln this paper we use interior-point methods for linear
programming, developed in the context of sequential
computation, to obtain a parallel algorithm for the
bipartite matching problem. Our algorithm runs in $ O^n
(\sqrt m) $ time. Our results extend to the weighted
bipartite matching problem and to the zero-one
minimum-cost flow problem, yielding $ O^n ((\sqrt m)
\log C) $ algorithms. This improves previous bounds on
these problems and illustrates the importance of
interior-point methods in the context of parallel
algorithm design.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1259",
}
@TechReport{Subramanian:1989:TJR,
author = "Devika Subramanian",
title = "A Theory of Justified Reformulations",
type = "Technical Report",
number = "STAN-CS-89-1260",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "134",
month = may,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Mayr:1989:PPP,
author = "Ernst W. Mayr and C. Greg Plaxton",
title = "Pipelined Parallel Computations, and Sorting on a
Pipelined Hypercube",
type = "Technical Report",
number = "STAN-CS-89-1261",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 15",
month = may,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/89/1261/CS-TR-89-1261.pdf;
http://www-db.stanford.edu/TR/CS-TR-89-1261.html",
abstract = "This paper brings together a number of previously
known techniques in order to obtain practical and
efficient implementations of the prefix operation for
the complete binary tree, hypercube and shuffle
exchange families of networks. For each of these
networks, we also provide a ``pipelined'' scheme for
performing $k$ prefix operations in $ O(k + \log p) $
time on $p$ processors. This implies a similar
pipelining result for the ``data distribution''
operation of Ullman [16]. The data distribution
primitive leads to a simplified implementation of the
optimal merging algorithm of Varman and Doshi, which
runs on a pipelined model of the hypercube [17].
Finally, a pipelined version of the multi-way merge
sort of Nassimi and Sahni [10], running on the
pipelined hypercube model, is described. Given $p$
processors and $ n < p \log p$ values to be sorted, the
running time of the pipelined algorithm is $ O(l o g^2
p / \log ((p \log p) / n)) $. Note that for the
interesting case $ n = p $ this yields a running time
of $ O(\log_2 p / \log \log p) $, which is
asymptotically faster than Batcher's bitonic sort
[3].",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-89-1261",
}
@TechReport{Swami:1989:OLJ,
author = "Arun N. Swami",
title = "Optimization of Large Join Queries",
type = "Technical Report",
number = "STAN-CS-89-1262",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "145",
month = jun,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Karp:1989:HFQ,
author = "Peter D. Karp",
title = "Hypothesis Formation and Qualitative Reasoning in
Molecular Biology",
type = "Technical Report",
number = "STAN-CS-89-1263",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "339",
month = jun,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Fischer:1989:CPA,
author = "Bernd Fischer and Roland Freund",
title = "{Chebyshev} Polynomials are not always Optimal",
type = "Technical Report",
number = "STAN-CS-89-1264",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = jun,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1264.html",
abstract = "We are concerned with the problem of finding among all
polynomials of degree at most $n$ and normalized to be
1 at $c$, the one with minimal uniform norm on Epsilon.
Here, Epsilon is a given ellipse with both foci on the
real axis and $c$ is a given real point not contained
in Epsilon. Problems of this type arise in certain
iterative matrix computations, and, in this context, it
is generally believed and widely referenced that
suitably normalized Chebyshev polynomials are optimal
for such constrained approximation problems. In this
note, we show that this is not true in general.
Moreover, we derive sufficient conditions which
guarantee that Chebyshev polynomials are optimal. Also,
some numerical examples are presented.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1264",
}
@TechReport{Weening:1989:PEL,
author = "Joseph S. Weening",
title = "Parallel Execution of {Lisp} Programs",
type = "Technical Report",
number = "STAN-CS-89-1265",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "94",
month = jun,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1989:MLS,
author = "David R. Cheriton and Hendrik A. Goosen and Patrick D.
Boyle",
title = "Multi-level shared caching techniques for scalability
in {VMP-MC}",
type = "Technical Report",
number = "STAN-CS-89-1266",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 18",
month = may,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1266.html",
abstract = "The problem of building a scalable shared memory
multiprocessor can be reduced to that of building a
scalable memory hierarchy, assuming interprocessor
communication is handled by the memory system. In this
paper, we describe the VMP-MC design, a distributed
parallel multi-computer based on the VMP multiprocessor
design, that is intended to provide a set of building
blocks for configuring machines from one to several
thousand processors. VMP-MC uses a memory hierarchy
based on shared caches, ranging from on-chip caches to
board-level caches connected by busses to, at the
bottom, a high-speed fiber optic ring. In addition to
describing the building block components of this
architecture, we identify the key performance issues
associated with the design and provide performance
evaluation of these issues using trace-drive simulation
and measurements from the VMP.",
acknowledgement = ack-nhfb,
pdfpages = "20",
xxnumber = "CS-TR-89-1266",
}
@TechReport{Alur:1989:RTL,
author = "Rajeev Alur and Thomas A. Henzinger",
title = "A Really Temporal Logic",
type = "Technical Report",
number = "STAN-CS-89-1267",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jul,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1267.html",
abstract = "We introduce a real-time temporal logic for the
specification of reactive systems. The novel feature of
our logic, TPTL, is the adoption of temporal operators
as quantifiers over time variables; every modality
binds a variable to the time(s) it refers to. TPTL is
demonstrated to be both a natural specification
language as well as a suitable formalism for
verification and synthesis. We present a tableau-based
decision procedure and model-checking algorithm for
TPTL. Several generalizations of TPTL are shown to be
highly undecidable.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1267",
}
@TechReport{Floyd:1989:AMa,
author = "Robert W. Floyd and Donald E. Knuth",
title = "Addition Machines",
type = "Technical Report",
number = "STAN-CS-89-1254",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = apr,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
}
@TechReport{Floyd:1989:AMb,
author = "Robert W. Floyd and Donald E. Knuth",
title = "Addition Machines",
type = "Technical Report",
number = "STAN-CS-89-1268",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
day = "1",
month = jul,
year = "1989",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1268.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1268",
abstract = "An addition machine is a computing device with a
finite number of registers, limited to the following
six types of operations: read $x$ \{input to register
$x$ \} $ x \longleftarrow y$ \{copy register $y$ to
register $x$ \} $ x \longleftarrow x + y$ \{add
register $y$ to register $x$ \} $ x \longleftarrow x -
y$ \{subtract register $y$ from register $x$ \} if $ x
\ge y$ \{compare register $x$ to register $y$ \} write
$x$ \{output from register $x$ \} The register contents
are assumed to belong to a given set $A$, which is an
additive subgroup of the real numbers. If $A$ is the
set of all integers, we say the device is an integer
addition machine; if $A$ is the set of all real
numbers, we say the device is a real addition machine.
We will consider how efficiently an integer addition
machine can do operations such multiplication,
division, greatest common divisor, exponentiation, and
sorting. We will also show that any addition machine
with at least six registers can compute the ternary
operation $ x[y / z]$ with reasonable efficiency, given
$x$, $y$, $z$ in $A$ with $z$ not equal to 0.",
acknowledgement = ack-nhfb,
author-dates = "Robert W. Floyd (8 June 1936--25 September 2001)",
documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1268",
pdfpages = "17",
xxnumber = "CS-TR-89-1268",
}
@TechReport{Ross:1989:PPS,
author = "Kenneth A. Ross and Donald E. Knuth",
title = "A Programming and Problem Solving Seminar",
type = "Technical Report",
number = "STAN-CS-89-1269",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "88",
day = "1",
month = jul,
year = "1989",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1269.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-89-1269",
abstract = "This report contains edited transcripts of the
discussions held in Stanford's Computer Science problem
solving course, CS304, during winter quarter 1989.
Since the topics span a large range of ideas in
computer science, and since most of the important
research paradigms and programming paradigms were
touched on during the discussions, these notes may be
of interest to graduate students of computer science at
other universities, as well as to their professors and
to professional people in the ``real world.''\par
The present report is the eighth in a series of such
transcripts, continuing the tradition established in
STAN-CS-77-606 (Michael J. Clancy, 1977),
STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
(Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
STAN-CS-85-1055 (Ramsey W. Haddad, 1985) and
STAN-CS-87-1154 (Tomas G. Rokicki, 1987).",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-89-1269",
xxnumber = "CS-TR-89-1269",
}
@TechReport{Holstege:1989:MDN,
author = "Mary A. Holstege",
title = "Marking and the Design of Notations",
type = "Technical Report",
number = "STAN-CS-89-1270",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "255",
month = jul,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kent:1989:CKL,
author = "Mark David Kent",
title = "{Chebyshev}, {Krylov}, {Lanczos}: Matrix Relationships
and Computations",
type = "Technical Report",
number = "STAN-CS-89-1271",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "x + 126",
month = jul,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://www.proquest.com/pqdtglobal/docview/303724638",
abstract = "The thesis presents a unified approach to
understanding the important symmetric Lanczos algorithm
and its variants.\par
The Chebyshev algorithm for computing orthogonal
polynomials is derived and characterized in terms of
transformations between polynomial bases. This leads to
generalized Krylov sequences and a demonstration of the
equivalence of the modified Chebyshev algorithm and the
symmetric Lanczos algorithm for determining eigenvalues
of linear operators. The theory is successfully
generalized to the block case where matrix-valued
orthogonal polynomials play the key role.\par
Immediate applications include determining optimal
parameters and error bounds for polynomial iterative
methods for solving systems of linear
equations.\par
Comrade matrices naturally appear when generalized
Krylov methods are applied to bounded linear operators.
Properties of comrade matrices, and alternate methods
of computing them, are presented. Finally, parallel
implementations of Bairstow's method and the
Hyman--Laguerre method for computing eigenvalues of
comrade matrices are presented.",
acknowledgement = ack-nhfb,
pdfpages = "140",
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Finlayson:1989:LFS,
author = "Ross S. Finlayson",
title = "A Log File Service Exploiting Write-Once Storage",
type = "Technical Report",
number = "STAN-CS-89-1272",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "98",
month = jul,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1989:SHP,
author = "David R. Cheriton",
title = "{{Sirpent$^{\rm TM}$}}: a High-Performance
Internetworking Approach",
type = "Technical Report",
number = "STAN-CS-89-1273",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 12",
month = jul,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1273.html",
abstract = "A clear target for computer communication technology
is to support a high-performance global internetwork.
Current internetworking approaches use either
concatenated virtual circuits, as in X.75, or a
``universal'' internetwork datagram, as in the DoD
Internet IP protocol and the IS0 connectionless network
protocol (CLNP). Both approaches have significant
disadvantages. This paper describes Sirpent[TM] (Source
Internetwork Routing Protocol with Extended Network
Transfer), a new approach to an internetwork
architecture that makes source routing the basis for
interconnection, rather than an option as in IP. Its
benefits include simple switching with low per-packet
processing and delay, support for accounting and
congestion control, and scalability to a global
internetwork. It also supports flexible,
user-controlled routing such as required for security,
policy-based routing and real-time applications. We
also propose a specific internetwork protocol, called
VIPER[TM], as a realization of the Sirpent approach.",
acknowledgement = ack-nhfb,
pdfpages = "14",
xxnumber = "CS-TR-89-1273",
}
@TechReport{Hirsh:1989:IVS,
author = "Haym Hirsh",
title = "Incremental Version-Space Merging: a General Framework
for Concept Learning",
type = "Technical Report",
number = "STAN-CS-89-1274",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "103",
month = aug,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Subramanian:1989:NAS,
author = "Ashok Subramanian",
title = "A New Approach to Stable Matching Problems",
type = "Technical Report",
number = "STAN-CS-89-1275",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = aug,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1275.html",
abstract = "We show that Stable Matching problems are the same as
problems about stable configurations of X-networks.
Consequences include easy proofs of old theorems, a new
simple algorithm for finding a stable matching, an
understanding of the difference between Stable Marriage
and Stable Roommates, NP-completeness of Three-party
Stable Marriage, CC-completeness of several Stable
Matching problems, and a fast parallel reduction from
the Stable Marriage problem to the Assignment
problem.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1275",
}
@TechReport{Plaxton:1989:NCS,
author = "C. Greg Plaxton",
title = "On the Network Complexity of Selection",
type = "Technical Report",
number = "STAN-CS-89-1276",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = aug,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1276.html",
abstract = "The selection problem is to determine the kth largest
out of a given set of $n$ keys, and its sequential
complexity is well known to be linear. Thus, given a
$p$ processor parallel machine, it is natural to ask
whether or not an $ O(n / p) $ selection algorithm can
be devised for that machine. For the EREW PRAM, Vishkin
has exhibited a straightforward selection algorithm
that achieves optimal speedup for $ n = \Omega (p \log
p \log \log p)$ [18]. For the network model, the
sorting result of Leighton [12] and the token
distribution result of Peleg and Upfal [13] together
imply that Vishkin's algorithm can be adapted to run in
the same asymptotic time bound on a certain class of
bounded degree expander networks. On the other hand,
none of the network families currently of practical
interest have sufficient expansion to permit an
efficient implementation of Vishkin's algorithm. The
main result of this paper is an $ \Omega ((n / p) \log
\log p + \log p) $ lower bound for selection on any
network that satisfies a particular low expansion
property. The class of networks satisfying this
property includes all of the common network families
such as the tree, multi-dimensional mesh, hypercube,
butterfly and shuffle exchange. When $ n / p$ is
sufficiently large (for example, greater than $ \log_2
p$ on the butterfly, hypercube and shuffle exchange),
this result is matched by the upper bound presented in
[14].",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1276",
}
@TechReport{Mitchell:1989:TSP,
author = "John C. Mitchell",
title = "Type Systems for Programming Languages",
type = "Technical Report",
number = "STAN-CS-89-1277",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "90",
month = aug,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mayr:1989:CCV,
author = "Ernst W. Mayr and Ashok Subramanian",
title = "The complexity of circuit value and network
stability",
type = "Technical Report",
number = "STAN-CS-89-1278",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = aug,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1278.html",
abstract = "We develop a method for non-trivially restricting
fanout in a circuit. We study the complexity of the
Circuit Value problem and a new problem, Network
Stability, when fanout is limited. This leads to new
classes of problems within P. We conjecture that the
new classes are different from P and incomparable to
NC. One of these classes, CC, contains several natural
complete problems, including Circuit Value for
comparator circuits, Lex-first Maximal Matching, and
problems related to Stable Marriage and Stable
Roommates. When fanout is appropriately limited, we get
positive results: a parallel algorithm for Circuit
Value that runs in time about the square root of the
number of gates, a linear-time sequential algorithm for
Network Stability, and logspace reductions between
Circuit Value and Network Stability.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1278",
}
@TechReport{Zhu:1989:HAE,
author = "David Zhu and Jean-Claude Latombe",
title = "The Heuristic Algorithms for Efficient Hierarchical
Path Planning",
type = "Technical Report",
number = "STAN-CS-89-1279",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = aug,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Plotkin:1989:SBU,
author = "Serge A. Plotkin",
title = "Sticky Bits and Universality of Consensus",
type = "Technical Report",
number = "STAN-CS-89-1280",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = aug,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1280.html",
abstract = "In this paper we consider implementation of atomic
wait-free objects in the context of a shared-memory
multiprocessor. We introduce a new primitive object,
the ``Sticky-Bit'', and show its universality by
proving that any safe implementation of a sequential
object can be transformed into a wait-free atomic one
using only Sticky Bits and safe registers. The Sticky
Bit may be viewed as a memory-oriented version of
consensus. In particular, the results of this paper
imply ``universality of consensus'' in the sense that
given an algorithm to achieve n-processor consensus, we
can transform any safe implementation of a sequential
object into a wait-free atomic one using polynomial
number of additional safe bits. The presented results
also imply that the Read-Modify-Write (RMW) hierarchy
``collapses''. More precisely, we show that although an
object that supports a 1-bit atomic wait-free RMW is
strictly more powerful than safe register and an object
that supports 3-valued atomic wait-free RMW is strictly
more powerful than 1-bit RMW, the 3-value RMW is
universal in the sense that any RMW can be atomically
implemented from a 3-value atomic RMW in a wait-free
fashion.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1280",
}
@TechReport{Plaxton:1989:LBH,
author = "C. Greg Plaxton",
title = "Load Balancing on the Hypercube and Shuffle-Exchange",
type = "Technical Report",
number = "STAN-CS-89-1281",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = aug,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1281.html",
abstract = "Maintaining a balanced load is of fundamental
importance on any parallel computer, since a strongly
imbalanced load often leads to low processor
utilization. This paper considers two load balancing
operations: Balance and MultiBalance. The Balance
operation corresponds to the token distribution problem
considered by Peleg and Upfal [9] for certain expander
networks. The MultiBalance operation balances several
populations of distinct token types simultaneously.
Efficient implementations of these operations will be
given for the hypercube and shuffle-exchange, along
with tight or near-tight lower bounds.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1281",
}
@TechReport{Sankar:1989:ARC,
author = "Sriram Sankar",
title = "Automatic Runtime Consistency Checking and Debugging
of Formally Specified Programs",
type = "Technical Report",
number = "STAN-CS-89-1282",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "210",
month = aug,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Plaxton:1989:ECS,
author = "C. Gregory Plaxton",
title = "Efficient Computation on Sparse Interconnection
Networks",
type = "Technical Report",
number = "STAN-CS-89-1283",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "122",
month = sep,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1989:TP,
author = "Donald E. Knuth",
title = "Theory and Practice",
type = "Technical Report",
number = "STAN-CS-89-1284",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = sep,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://arxiv.org/pdf/cs/9301114",
abstract = "The author argues to Silicon Valley that the most
important and powerful part of computer science is work
that is simultaneously theoretical and practical. He
particularly considers the intersection of the theory
of algorithms and practical software development. He
combines examples from the development of the TeX
typesetting system with clever jokes, criticisms, and
encouragements.",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Theoretical Computer Science},
{\bf 90}(1), 1--15, November 1991.",
}
@TechReport{Barraquand:1989:NPF,
author = "J. Barraquand and B. Langlois and J. Latombe",
title = "Numerical Potential Field Techniques for Robot Path
Planning",
type = "Technical Report",
number = "STAN-CS-89-1285",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "39",
month = oct,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rothberg:1989:FSM,
author = "Edward Rothberg and Anoop Gupta",
title = "Fast sparse matrix factorization on modern
workstations",
type = "Technical Report",
number = "STAN-CS-89-1286",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 15",
month = oct,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1286.html",
abstract = "The performance of workstation-class machines has
experienced a dramatic increase in the recent past.
Relatively inexpensive machines which offer 14 MIPS and
2 MFLOPS performance are now available, and machines
with even higher performance are not far off. One
important characteristic of these machines is that they
rely on a small amount of high-speed cache memory for
their high performance. In this paper, we consider the
problem of Cholesky factorization of a large sparse
positive definite system of equations on a high
performance workstation. We find that the major factor
limiting performance is the cost of moving data between
memory and the processor. We use two techniques to
address this limitation; we decrease the number of
memory references and we improve cache behavior to
decrease the cost of each reference. When run on
benchmarks from the Harwell-Boeing Sparse Matrix
Collection, the resulting factorization code is almost
three times as fast as SPARSPAK on a DECStation 3100.
We believe that the issues brought up in this paper
will play an important role in the effective use of
high performance workstations on large numerical
problems.",
acknowledgement = ack-nhfb,
pdfpages = "17",
xxnumber = "CS-TR-89-1286",
}
@TechReport{DeMichiel:1989:PDO,
author = "Linda Gail DeMichiel",
title = "Performing Database Operations Over Mismatched
Domains",
type = "Technical Report",
number = "STAN-CS-89-1287",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "172",
month = oct,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Talcott:1989:PPF,
author = "Carolyn Talcott",
title = "Programming and proving with function and control
abstractions",
type = "Technical Report",
number = "STAN-CS-89-1288",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "121",
month = oct,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1288.html",
abstract = "Rum is an intensional semantic theory of function and
control abstractions as computation primitives. It is a
mathematical foundation for understanding and improving
current practice in symbolic (Lisp-style) computation.
The theory provides, in a single context, a variety of
semantics ranging from structures and rules for
carrying out computations to an interpretation as
functions on the computation domain. Properties of
powerful programming tools such as functions as values,
streams, aspects of object oriented programming, escape
mechanisms, and coroutines can be represented
naturally. In addition a wide variety of operations on
programs can be treated including program
transformations which introduce function and control
abstractions, compiling morphisms that transform
control abstractions into function abstractions, and
operations that transform intensional properties of
programs into extensional properties. The theory goes
beyond a theory of functions computed by programs,
providing tools for treating both intensional and
extensional properties of programs. This provides
operations on programs with meanings to transform as
well as meanings to preserve. Applications of this
theory include expressing and proving properties of
particular programs and of classes of programs and
studying mathematical properties of computation
mechanisms. Additional applications are the design and
implementation of interactive computation systems and
the mechanization of reasoning about computation. These
notes are based on lectures given at the Western
Institute of Computer Science summer program, 31 July
--- 1 August 1986. Here we focus on programming and
proving with function and control abstractions and
present a variety of example programs, properties, and
techniques for proving these properties.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1288",
}
@TechReport{Healey:1989:UOI,
author = "Glenn Healey",
title = "The Use of Optical Info in a Machine Vision System",
type = "Technical Report",
number = "STAN-CS-89-1289",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = sep,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Myers:1989:RLQ,
author = "Karen Myers and Devika Subramanian and Ramin Zabih",
title = "Reading list for the Qualifying Examination in
Artificial Intelligence",
type = "Technical Report",
number = "STAN-CS-89-1290",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = nov,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1290.html",
abstract = "This report contains the reading list for the
Qualifying Examination in Artificial Intelligence.
Areas covered include search, representation,
reasoning, planning and problem solving, learning,
expert systems, vision, robotics, natural language,
perspectives and AI programming. An extensive
bibliography is also provided.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1290",
}
@TechReport{Quian:1989:DSD,
author = "Xiaolei Quian",
title = "The Deductive Synthesis of Database Transactions",
type = "Technical Report",
number = "STAN-CS-89-1291",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "194",
month = nov,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Latombe:1989:RMP,
author = "Jean-Claude Latombe and Anthony Lazanas and Shashank
Shekhar",
title = "Robot Motion Planning with Uncertainty in Control and
Sensing",
type = "Technical Report",
number = "STAN-CS-89-1292",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 46",
month = nov,
year = "1989",
DOI = "https://doi.org/10.1016/0004-3702(91)90023-D",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/citations/ADA323613;
https://apps.dtic.mil/sti/pdfs/ADA323613.pdf",
acknowledgement = ack-nhfb,
pdfpages = "52",
remark = "Published in \booktitle{Artificial Intelligence}, {\bf
52}(1), November 1991, Pages 1--47.",
}
@TechReport{Bronstein:1989:SFS,
author = "Alexandre Bronstein",
title = "{MLP}: String-Functional Semantics and {Boyer--Moore}
Mechanization for the Formal Verification of
Synchronous Circuits",
type = "Technical Report",
number = "STAN-CS-89-1293",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "viii + 279",
month = dec,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://www.proquest.com/pqdtglobal/docview/303871822",
acknowledgement = ack-nhfb,
pdfpages = "291",
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Rice:1989:DIP,
author = "James Rice",
title = "The Design and Implementation of {Poligon} and a
High-Performance Concurrent Blackboard System Shell",
type = "Technical Report",
number = "STAN-CS-89-1294",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "88",
month = nov,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Langlotz:1989:DTA,
author = "Curtis Philip Langlotz",
title = "A Decision-Theoretic Approach to Heuristic Planning",
type = "Technical Report",
number = "STAN-CS-89-1295",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "381",
month = nov,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Manna:1989:CTP,
author = "Zohar Manna and Amir Pnueli",
title = "Completing the Temporal Picture",
type = "Technical Report",
number = "STAN-CS-89-1296",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = dec,
year = "1989",
bibdate = "Thu Nov 20 12:11:36 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-89-1296.html",
abstract = "The paper presents a relatively complete proof system
for proving the validity of temporal properties of
reactive programs. The presented proof system improves
all previous temporal systems, such as [MP83a] and
[MP83b], in that it reduces the validity of program
properties into pure assertional reasoning, not
involving additional temporal reasoning. The proof
system is based on the classification of temporal
properties according to the Borel hierarchy, providing
an appropriate proof rule for each of the main classes,
such as safety, response, and progress properties.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-89-1296",
}
@TechReport{Casley:1989:TS,
author = "Ross Casley and Roger F. Crew and Jos{\'e} Meseguer
and Vaughan Pratt",
title = "Temporal Structures",
type = "Technical Report",
number = "STAN-CS-89-1297",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "43",
month = dec,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://boole.stanford.edu/pub/man.pdf",
abstract = "We combine the principles of the
Floyd--Warshall--Kleene algorithm, enriched categories,
and Birkhoff arithmetic, to yield a useful class of
algebras of transitive vertex-labeled spaces. The
motivating application is a uniform theory of abstract
or parametrized time in which to any given notion of
time there corresponds an algebra of concurrent
behaviors and their operations, always the same
operations but interpreted automatically and
appropriately for that notion of time. An interesting
side application is a language for succinctly naming a
wide range of datatypes",
acknowledgement = ack-nhfb,
pdfpages = "31",
remark = "Published in \booktitle{Math. Structures in Comp.
Sci.}, {\bf 1}(2):179--213, July 1991. PDF file and
abstract are from 9 January 2005 version: a revision of
CTCS-89 paper.",
}
@TechReport{Tuminaro:1989:MAP,
author = "Ray Tuminaro",
title = "Multigrid Algorithms on Parallel Processing Systems",
type = "Technical Report",
number = "STAN-CS-90-1299",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "143",
month = dec,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pallas:1989:MSI,
author = "Joseph I. Pallas",
title = "Multiprocessor {Smalltalk}: Implementation,
Performance, and Analysis",
type = "Technical Report",
number = "STAN-CS-90-1315",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "136",
month = dec,
year = "1989",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gray:1990:LEF,
author = "Cary G. Gray and David R. Cheriton",
title = "Leases: an efficient fault-tolerant mechanism for
distributed file cache consistency",
type = "Technical Report",
number = "STAN-CS-90-1298",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1298.html",
abstract = "Caching introduces the overhead and complexity of
ensuring consistency, reducing some of its performance
benefits. In a distributed system, caching must deal
with the additional complications of communication and
host failures. Leases are proposed as a time-based
mechanism that provides efficient consistent access to
cached data in distributed systems. Non-Byzantine
failures affect performance, not correctness, with
their effect minimized by short leases. An analytic
model and an evaluation for file access in the V system
show that leases of short duration provide good
performance. The impact of leases on performance grows
more significant in systems of larger scale and higher
processor performance.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1298",
}
@TechReport{Guibas:1990:RIC,
author = "Leo Guibas and Donald E. Knuth and Micha Sharir",
title = "Randomized Incremental Construction of {Delaunay} and
{Voronoi} Diagrams",
type = "Technical Report",
number = "STAN-CS-90-1300",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = jan,
year = "1990",
DOI = "https://doi.org/10.1007/BF01758770",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Algorithmica} {\bf 7}(1--6)
381--413, June 1992. doi:10.1007/BF01758770",
}
@TechReport{Goldberg:1990:PEI,
author = "Andrew Goldberg",
title = "Processor-Efficient Implementation of a Maximum Flow
Algorithm",
type = "Technical Report",
number = "STAN-CS-90-1301",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = jan,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Larrabee:1990:EGT,
author = "Tracy Larrabee",
title = "Efficient Generation of Test Patterns Using {Boolean}
Satisfiability",
type = "Technical Report",
number = "STAN-CS-90-1302",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "68",
month = feb,
year = "1990",
DOI = "https://doi.org/10.5555/100195",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://dl.acm.org/doi/10.5555/100195;
https://ieeexplore.ieee.org/document/82368",
abstract = "A combinational circuit can be tested for the presence
of a single stuck-at fault by applying a set of inputs
that excite a verifiable output response in that
circuit. If the fault is present, the output will be
different than it would be if the fault were not
present. Given a circuit, the goal of an automatic test
pattern generating system is to generate a set of input
sets that will detect every possible single stuck-at
fault in the circuit. This dissertation describes a new
method for generating test patterns: the Boolean
satisfiability method. The new method generates test
patterns in two steps: First, it constructs a formula
expressing the Boolean difference between the unfaulted
and faulted circuits. Second, it applies a Boolean
satisfiability algorithm to the resulting formula. This
approach differs from most programs now in use, which
directly search the circuit data structure instead of
constructing a formula from it. The new method is quite
general and allows for the addition of any heuristic
used by the structural search methods. The Boolean
satisfiability method has produced excellent results on
popular test pattern generation benchmarks.",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wiederhold:1990:MAA,
author = "Gio Wiederhold and Tore Risch and Peter Rathmann and
Linda DeMichiel and Surajit Chaudhuri and Byung Suk Lee
and Kincho H. Law and Thierry Barsalou and Dallan
Quass",
title = "A Mediator Architecture for Abstract Data Access",
type = "Technical Report",
number = "STAN-CS-90-1303",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "vii + 164",
day = "23",
month = feb,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://apps.dtic.mil/sti/tr/pdf/ADA227362.pdf",
acknowledgement = ack-nhfb,
pdfpages = "171",
}
@TechReport{Matsushima:1990:MOI,
author = "Toshiyuki Matsushima and Gio Wiederhold",
title = "A Model of Object Identities and Values",
type = "Technical Report",
number = "STAN-CS-90-1304",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 64",
day = "23",
month = feb,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1304/CS-TR-90-1304.pdf;
http://www-db.stanford.edu/TR/CS-TR-90-1304.html",
abstract = "In this report, a formalization of the object-oriented
data model is proposed, which integrates value-oriented
models and object-oriented models by providing a simple
semantics of object-identity.\par
The formalism reveals that the semantics of the
object-oriented model consists of two portions. One is
expressed by an algebraic construct, which has
essentially a value-oriented semantics. The other is
expressed by object-identities, which characterize the
essential difference of the object-oriented model from
value-oriented models, such as the relational model and
the logical database model. The value-oriented portion
represents the abstraction of the real world objects,
while the object-oriented portion represents the
existence of the real world objects. These two portions
are integrated by a simple commutative diagram of
modeling functions.\par
The formalism includes the expression of integrity
constraints in its construct of classes. which provides
the natural integration of the logical database model
and the object-oriented database model. More
specifically, we will show that a datalog program can
be expressed as a collection of classes in our
model.\par
As an application of the formalism, formal guidelines
on database design are also discussed.",
abstract-2 = "An algebraic formalization of the object-oriented data
model is proposed. The formalism reveals that the
semantics of the object-oriented model consists of two
portions. One is expressed by an algebraic construct,
which has essentially a value-oriented semantics. The
other is expressed by object-identities, which
characterize the essential difference of the
object-oriented model and value-oriented models, such
as the relational model and the logical database model.
These two portions are integrated by a simple
commutativity of modeling functions. The formalism
includes the expression of integrity constraints in its
construct, which provides the natural integration of
the logical database model and the object-oriented
database model.",
acknowledgement = ack-nhfb,
pdfpages = "66",
xxnumber = "CS-TR-90-1304",
}
@TechReport{Rothberg:1990:CEN,
author = "Edward Rothberg and Anoop Gupta",
title = "A comparative evaluation of nodal and supernodal
parallel sparse matrix factorization: detailed
simulation results",
type = "Technical Report",
number = "STAN-CS-90-1305",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = feb,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1305.html",
abstract = "In this paper we consider the problem of factoring a
large sparse system of equations on a modestly parallel
shared-memory multiprocessor with a non-trivial memory
hierarchy. Using detailed multiprocessor simulation, we
study the behavior of the parallel sparse factorization
scheme developed at the Oak Ridge National Laboratory.
We then extend the Oak Ridge scheme to incorporate the
notion of supernodal elimination. We present detailed
analyses of the sources of performance degradation for
each of these schemes. We measure the impact of
interprocessor communication costs, processor load
imbalance, overheads introduced in order to distribute
work, and cache behavior on overall parallel
performance. For the three benchmark matrices which we
study, we find that the supernodal scheme gives a
factor of 1.7 to 2.7 performance advantage for 8
processors and a factor of 0.9 to 1.6 for 32
processors. The supemodal scheme exhibits higher
performance due mainly to the fact that it executes
many fewer memory operations and produces fewer cache
misses. However, the natural task grain size for the
supernodal scheme is much larger than that of the Oak
Ridge scheme, making effective distribution of work
more difficult, especially when the number of
processors is large.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1305",
}
@TechReport{Altman:1990:EMD,
author = "Russ Biagio Altman",
title = "Exclusion Methods for the Determination of Protein
Structure from Experimental Data",
type = "Technical Report",
number = "STAN-CS-90-1306",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "205",
month = mar,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Alur:1990:RTL,
author = "Rajeev Alur and Thomas A. Henzinger",
title = "Real-Time Logics: Complexity and Expressiveness",
type = "Technical Report",
number = "STAN-CS-90-1307",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = mar,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1307.html",
abstract = "The theory of the natural numbers with linear order
and monadic predicates underlies propositional linear
temporal logic. To study temporal logics for real-time
systems, we combine this classical theory of infinite
state sequences with a theory of time, via a monotonic
function that maps every state to its time. The
resulting theory of timed state sequences is shown to
be decidable, albeit nonelementary, and its expressive
power is characterized by omega-regular sets. Several
more expressive variants are proved to be highly
undecidable. This framework allows us to classify a
wide variety of real-time logics according to their
complexity and expressiveness. In fact, it follows that
most formalisms proposed in the literature cannot be
decided. We are, however, able to identify two
elementary real-time temporal logics as expressively
complete fragments of the theory of timed state
sequences, and give tableau-based decision procedures.
Consequently, these two formalisms are well-suited for
the specification and verification of real-time
systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1307",
}
@TechReport{Patashnik:1990:OCS,
author = "Oren Patashnik",
title = "Optimal Circuit Segmentation for Pseudo-Exhaustive
Testing",
type = "Technical Report",
number = "STAN-CS-90-1308",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "110",
month = mar,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Pratt:1990:DAW,
author = "Vaughan Pratt",
title = "Dynamic Algebras as a well-behaved fragment of
Relation Algebras",
type = "Technical Report",
number = "STAN-CS-90-1309",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = mar,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Barsalou:1990:VOR,
author = "Thierry Barsalou",
title = "View Objects for Relational Databases",
type = "Technical Report",
number = "STAN-CS-90-1310",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "350",
month = mar,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Subramanian:1990:CCC,
author = "Ashok Subramanian",
title = "The Computational Complexity of the Circuit Value and
Network Stability Problems",
type = "Technical Report",
number = "STAN-CS-90-1311",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "171",
month = may,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kambhampati:1990:VSB,
author = "Subbarao Kambhampati and James A. Hendler",
title = "A validation structure based theory of plan
modification and reuse",
type = "Technical Report",
number = "STAN-CS-90-1312",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "56",
month = jun,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1312.html",
abstract = "A framework for the flexible and conservative
modification of plans enables a planner to modify its
plans in response to incremental changes in their
specifications, to reuse its existing plans in new
problem situations, and to efficiently replan in
response to execution time failures. We present a
theory of plan modification applicable to hierarchical
nonlinear planning. Our theory utilizes the validation
structure of stored plans to yield a flexible and
conservative plan modification framework. The
validation structure, which constitutes a hierarchical
explanation of correctness of the plan with respect to
the planner's own knowledge of the domain, is annotated
on the plan as a by-product of initial planning. Plan
modification is formalized as a process of removing
inconsistencies in the validation structure of a plan
when it is being reused in a new (changed) planning
situation. The repair of these inconsistencies involves
removing unnecessary parts of the plan and adding new
non-primitive tasks to the plan to establish missing or
failing validations. The resultant partially reduced
plan (with a consistent validation structure) is sent
to the planner for complete reduction. We discuss the
development of this theory in the PRIAR system, present
an empirical evaluation of this theory, and
characterize its completeness, coverage, efficiency and
limitations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1312",
}
@TechReport{Goldberg:1990:BRP,
author = "Andrew V. Goldberg and Dan Gusfield",
title = "Book review: {{\booktitle{Potokovye Algoritmy (Flow
Algorithms)}} by G. M. Adel'son-Vel'ski, E. A. Dinic,
and A. V. Karzanov}",
type = "Technical Report",
number = "STAN-CS-90-1313",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 14",
month = jun,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1313/CS-TR-90-1313.pdf;
http://www-db.stanford.edu/TR/CS-TR-90-1313.html",
abstract = "This is a review of the book ``Flow Algorithms'' by
Adel'son-Vel'ski, Dinic, and Karzanov, well-known
researchers in the area of algorithm design and
analysis. This remarkable book, published in 1975, is
written in Russian and has never been translated into
English. What is remarkable about the book is that it
describes many major results obtained in the Soviet
Union (and originally published in papers by 1976) that
were independently discovered later (and in some cases
much later) in the West. The book also contains some
minor results that we believe are still unknown in the
West. The book is well-written and a pleasure to read,
at least for someone fluent in Russian. Although the
book is fifteen years old and we believe that all the
major results contained in it are known in the West by
now, the book is still of great historical importance.
Hence a complete review is in order. [from the
Introduction]",
acknowledgement = ack-nhfb,
pdfpages = "16",
xxnumber = "CS-TR-90-1313",
}
@TechReport{Koza:1990:GPP,
author = "John R. Koza",
title = "Genetic programming: a paradigm for genetically
breeding populations of computer programs to solve
problems",
type = "Technical Report",
number = "STAN-CS-90-1314",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = jun,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1314.html",
abstract = "Many seemingly different problems in artificial
intelligence, symbolic processing, and machine learning
can be viewed as requiring discovery of a computer
program that produces some desired output for
particular inputs. When viewed in this way, the process
of solving these problems becomes equivalent to
searching a space of possible computer programs for a
most fit individual computer program. The new ``genetic
programming'' paradigm described herein provides a way
to search for this most fit individual computer
program. In this new ``genetic programming'' paradigm,
populations of computer programs are genetically bred
using the Darwinian principle of survival of the
fittest and using a genetic crossover (recombination)
operator appropriate for genetically mating computer
programs. In this paper, the process of formulating and
solving problems using this new paradigm is illustrated
using examples from various areas. Examples come from
the areas of machine learning of a function; planning;
sequence induction; function identification (including
symbolic regression, empirical discovery, ``data to
function'' symbolic integration, ``data to function''
symbolic differentiation); solving equations, including
differential equations, integral equations, and
functional equations; concept formation; automatic
programming; pattern recognition, time-optimal control;
playing differential pursuer-evader games; neural
network design; and finding a game-playing strategy for
a discrete game in extensive form.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1314",
}
@TechReport{Heckerman:1990:PSN,
author = "David Earl Heckerman",
title = "Probabilistic Similarity Networks",
type = "Technical Report",
number = "STAN-CS-90-1316",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "285",
month = jun,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Barraquand:1990:CMR,
author = "Jerome Barraquand and Jean-Claude Latombe",
title = "Controllability of Mobile Robots with Kinematic
Constraints",
type = "Technical Report",
number = "STAN-CS-90-1317",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = jun,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rothberg:1990:TIP,
author = "Edward Rothberg and Anoop Gupta",
title = "Techniques for improving the performance of sparse
matrix factorization on multiprocessor workstations",
type = "Technical Report",
number = "STAN-CS-90-1318",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = jun,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1318.html",
abstract = "In this paper we look at the problem of factoring
large sparse systems of equations on high-performance
multiprocessor workstations. While these multiprocessor
workstations are capable of very high peak floating
point computation rates, most existing sparse
factorization codes achieve only a small fraction of
this potential. A major limiting factor is the cost of
memory accesses performed during the factorization. ln
this paper, we describe a parallel factorization code
which utilizes the supernodal structure of the matrix
to reduce the number of memory references. We also
propose enhancements that significantly reduce the
overall cache miss rate. The result is greatly
increased factorization performance. We present
experimental results from executions of our codes on
the Silicon Graphics 4D/380 multiprocessor. Using eight
processors, we find that the supernodal parallel code
achieves a computation rate of approximately 40 MFLOPS
when factoring a range of benchmark matrices. This is
more than twice as fast as the parallel nodal code
developed at the Oak Ridge National Laboratory running
on the SGI 4D/380.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1318",
}
@TechReport{Bellin:1990:MPT,
author = "Gianluigi Bellin",
title = "Mechanizing Proof Theory: Resource-Aware Logics and
Proof Transformations to Extract Implicit Information",
type = "Technical Report",
number = "STAN-CS-90-1319",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "237",
month = jun,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Jimison:1990:RGI,
author = "Holly Brugge Jimison",
title = "A Representation for Gaining Insight into Clinical
Decision Models",
type = "Technical Report",
number = "STAN-CS-90-1320",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "202",
month = jun,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Manna:1990:TRP,
author = "Zohar Manna and Amir Pnueli",
title = "Tools and Rules for the Practicing Verifier",
type = "Technical Report",
number = "STAN-CS-90-1321",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "35",
month = jul,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1321.html",
abstract = "The paper presents a minimal proof theory which is
adequate for proving the main important temporal
properties of reactive programs. The properties we
consider consist of the classes of invariance,
response, and precedence properties. For each of these
classes we present a small set of rules that is
complete for verifying properties belonging to this
class. We illustrate the application of these rules by
analyzing and verifying the properties of a new
algorithm for mutual exclusion.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1321",
}
@TechReport{Shoham:1990:ESF,
author = "Yoav Shoham and Fangzhen Lin",
title = "Epistemic Semantics for Fixed-Point Nonmonotonic
Logics",
type = "Technical Report",
number = "STAN-CS-90-1322",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = jul,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Moses:1990:P,
author = "Eyal Mozes and Yoav Shoham",
title = "Protograms",
type = "Technical Report",
number = "STAN-CS-90-1323",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 18",
month = jul,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1323/CS-TR-90-1323.pdf;
http://www-db.stanford.edu/TR/CS-TR-90-1323.html",
abstract = "Motivated largely by tasks that require control of
complex processes in a dynamic environment, we
introduce a new computational construct called a
protogram. A protogram is a program specifying an
abstract course of action, a course that allows for a
range of specific actions, from which a choice is made
through interaction with other protograms. We discuss
the intuition behind the notion, and then explore some
of the details involved in implementing it.
Specifically, we (a) describe a general scheme of
protogram interaction, (b) describe a protogram
interpreter that has been implemented, dealing with
some special cases, (c) describe three applications of
the protogram interpreter, one in data processing and
two in robotics (both currently only implemented as
simulations), (d) describe some more general possible
implementations of a protogram interpreter, and (e)
discuss how protograms can be useful for the Gofer
project. We also briefly discuss the origins of
protograms in psychology and linguistics, compare
protograms to blackboard and subsumption architectures,
and discuss directions for future research.",
acknowledgement = ack-nhfb,
pdfpages = "19",
xxnumber = "CS-TR-90-1323",
}
@TechReport{Guerreira:1990:CMIb,
author = "Ramiro A. de T. Guerreira and Andrea S. Hemerly and
Yoav Shoham",
title = "On the complexity of monotonic inheritance with
roles",
type = "Technical Report",
number = "STAN-CS-90-1324",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 6",
month = jul,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/90/1324/CS-TR-90-1324.pdf;
http://www-db.stanford.edu/TR/CS-TR-90-1324.html",
abstract = "We investigate the complexity of reasoning with
monotonic inheritance hierarchies that contain, beside
ISA edges, also ROLE (or FUNCTION) edges. A ROLE edge
is an edge labelled with a name such as spouse of or
brother of. We call such networks ISAR networks. Given
a network with n vertices and m edges, we consider two
problems: ($ P_1$) determining whether the network
implies an isa relation between two particular nodes,
and ($ P_2$) determining all isa relations implied by
the network. As is well known, without ROLE edges the
time complexity of $ P_1$, is O(m), and the time
complexity of $ P_2$ is $ O(n^3) $. Unfortunately, the
results do not extend naturally to ISAR networks,
except in a very restricted case. For general ISAR
network we first give an polynomial algorithm by an
easy reduction to propositional Horn theory. As the
degree of the polynomial is quite high ($ O(m n^4)$ for
$ P_1$, $ O(m n^6)$ for $ P_2 $), we then develop a
more direct algorithm. For both $ P_1 $ and $ P_2 $ its
complexity is $ O(n^3 + m^2)$. Actually, a finer
analysis of the algorithm reveals a complexity of $ O(n
r(\log r) + n^2 r + n^3)$, where r is the number of
different ROLE labels. One corollary is that if we fix
the number of ROLE labels, the complexity of our
algorithm drops back to $ O(n^3) $.",
acknowledgement = ack-nhfb,
pdfpages = "8",
xxnumber = "CS-TR-90-1324",
}
@TechReport{Lavignon:1990:TA,
author = "Jean-Fran{\c{c}}ois Lavignon and Yoav Shoham",
title = "Temporal Automata",
type = "Technical Report",
number = "STAN-CS-90-1325",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "41",
month = jul,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kaelbling:1990:LES,
author = "Leslie Pack Kaelbling",
title = "Learning in Embedded Systems",
type = "Technical Report",
number = "STAN-CS-90-1326",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "199",
month = jun,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Plambeck:1990:STC,
author = "Thane E. Plambeck",
title = "Semigroups and Transitive Closure",
type = "Technical Report",
number = "STAN-CS-90-1327",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "123",
month = aug,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Radzik:1990:TBN,
author = "Tomasz Radzik and Andrew V. Goldberg",
title = "Tight Bounds on the Number of Minimum-Mean Cycle
Cancellations",
type = "Technical Report",
number = "STAN-CS-90-1328",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = sep,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Henzinger:1990:IMR,
author = "Thomas A. Henzinger and Zohar Manna and Amir Pnueli",
title = "An Interleaving Model for Real Time",
type = "Technical Report",
number = "STAN-CS-90-1329",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = sep,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1329.html",
abstract = "The interleaving model is both adequate and
sufficiently abstract to allow for the practical
specification and verification of many properties of
concurrent systems. We incorporate real time into this
model by defining the abstract notion of a real-time
transition system as a conservative extension of
traditional transition systems: qualitative fairness
requirements are replaced (and superseded) by
quantitative lower-bound and upper-bound real-time
requirements for transitions. We present proof rules to
establish lower and upper real-time bounds for response
properties of real-time transition systems. This proof
system can be used to verify bounded-invariance and
bounded-response properties, such as timely termination
of shared-variables multi-process systems, whose
semantics is defined in terms of real-time transition
systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1329",
}
@TechReport{Rothberg:1990:PIH,
author = "Edward Rothberg and Anoop Gupta",
title = "Parallel {ICCG} on a Hierarchical Memory
Multiprocessor --- Addressing the Triangular Solve
Bottleneck",
type = "Technical Report",
number = "STAN-CS-90-1330",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 20",
month = oct,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1330.html",
abstract = "The incomplete Cholesky conjugate gradient (ICCG)
algorithm is a commonly used iterative method for
solving large sparse systems of equations. In this
paper, we study the parallel solution of sparse
triangular systems of equations, the most difficult
aspect of implementing the ICCG method on a
multiprocessor. We focus on shared-memory
multiprocessor architectures with deep memory
hierarchies. On such architectures we find that
previously proposed parallelization approaches result
in little or no speedup. The reason is that these
approaches cause significant increases in the amount of
memory system traffic as compared to a sequential
approach. Increases of as much as a factor of 10 on
four processors were observed. In this paper we propose
new techniques for limiting these increases, including
data remappings to increase spatial locality, new
processor synchronization techniques to decrease the
use of auxiliary data structures, and data partitioning
techniques to reduce the amount of interprocessor
communication. With these techniques, memory system
traffic is reduced to as little as one sixth of its
previous volume. The resulting speedups are greatly
improved as well, although they are still much less
than linear. We discuss the factors that limit further
speedups. We present both simulation results and
results of experiments on an SGI 4D/340
multiprocessor.",
acknowledgement = ack-nhfb,
keywords = "incomplete Cholesky conjugate gradient (ICCG)
algorithm",
pdfpages = "21",
xxnumber = "CS-TR-90-1330",
}
@TechReport{Snoeyink:1990:TAC,
author = "Jack Scott Snoeyink",
title = "Topological Approaches in Computational Geometry",
type = "Technical Report",
number = "STAN-CS-90-1331",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "104",
month = nov,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Schoen:1990:IAD,
author = "Eric Jonathan Schoen",
title = "Intelligent Assistance for the Design of
Knowledge-Based Systems",
type = "Technical Report",
number = "STAN-CS-90-1332",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "258",
month = oct,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Spreitzer:1990:CSD,
author = "Michael J. Spreitzer",
title = "Comparing Structurally Different Views of a {VLSI}
Design",
type = "Technical Report",
number = "STAN-CS-90-1333",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "161",
month = oct,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Blatt:1990:SCW,
author = "Miriam G. Blatt",
title = "Soft Configurable Wafer Scale Integration Design,
Implementation, and Yield Analysis",
type = "Technical Report",
number = "STAN-CS-90-1334",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "123",
month = oct,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Shoham:1990:AOP,
author = "Yoav Shoham",
title = "Agent-Oriented Programming",
type = "Technical Report",
number = "STAN-CS-90-1335",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "52",
month = oct,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Knuth:1990:CUM,
author = "Donald E. Knuth",
title = "{CWEB} User Manual: The {CWEB} System of Structured
Documentation",
type = "Technical Report",
number = "STAN-CS-90-1336",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "214",
month = oct,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "A related document by DEK and Silvio Levy is in annual
TeX Live distribution trees, such as
https://tug.ctan.org/web/cweb/cwebman.pdf.",
}
@TechReport{Galbiati:1990:SUL,
author = "Louis Galbiati and Carolyn Talcott",
title = "A Simplifier for Untyped Lambda Expressions",
type = "Technical Report",
number = "STAN-CS-90-1337",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 26",
month = oct,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1337.html",
abstract = "Many applicative programming languages are based on
the call-by-value lambda calculus. For these languages
tools such as compilers, partial evaluators, and other
transformation systems often make use of rewriting
systems that incorporate some form of beta reduction.
For purposes of automatic rewriting it is important to
develop extensions of beta-value reduction and to
develop methods for guaranteeing termination. This
paper describes an extension of beta-value reduction
and a method based on abstract interpretation for
controlling rewriting to guarantee termination. The
main innovations are (1) the use of rearrangement rules
in combination with beta-value reduction to increase
the power of the rewriting system and (2) the
definition of a non-standard interpretation of
expressions, the generates relation, as a basis for
designing terminating strategies for rewriting.",
acknowledgement = ack-nhfb,
pdfpages = "29",
xxnumber = "CS-TR-90-1337",
}
@TechReport{Haddad:1990:TTP,
author = "Ramsey W. Haddad",
title = "Triangularization: a Two-Processor Schedule Problem",
type = "Technical Report",
number = "STAN-CS-90-1338",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "126",
month = nov,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nazarian:1990:BDC,
author = "Taleen Nazarian",
title = "Bibliography, {Department of Computer Science}
Technical Reports, 1963--1990",
type = "Technical Report",
number = "STAN-CS-90-1339",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "86",
month = dec,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Mason:1990:PQ,
author = "Ian A. Mason and Joseph D. Pehoushek and Carolyn L.
Talcott and Joseph S. Weening",
title = "Programming in {QLisp}",
type = "Technical Report",
number = "STAN-CS-90-1340",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 56",
day = "24",
month = oct,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "http://www.math.utah.edu/pub/tex/bib/common-lisp.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1340.html",
abstract = "Qlisp is an extension of Common Lisp, to support
parallel programming. It was initially designed by John
McCarthy and Richard Gabriel in 1984. Since then it has
been under development both at Stanford University and
Lucid, Inc. and has been implemented on several
commercial shared-memory parallel computers. Qlisp is a
queue-based, shared-memory, multi-processing language.
This report is a tutorial introduction to the Stanford
dialect of Qlisp.",
acknowledgement = ack-nhfb,
pdfpages = "60",
subject-dates = "John McCarthy (4 September 1927--24 October 2011)",
xxnumber = "CS-TR-90-1340",
}
@TechReport{Wiederhold:1990:TM,
author = "G. Wiederhold and P. Wagner and Stefano Ceri",
title = "Towards Megaprogramming",
type = "Technical Report",
number = "STAN-CS-90-1341",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "45",
month = nov,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pratt:1990:MCG,
author = "Vaughan Pratt",
title = "Modeling Concurrency with Geometry",
type = "Technical Report",
number = "STAN-CS-90-1342",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = nov,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1342.html",
abstract = "The phenomena of branching time and true or
noninterleaving concurrency find their respective homes
in automata and schedules. But these two models of
computation are formally equivalent via Birkhoff
duality, an equivalence we expound on here in tutorial
detail. So why should these phenomena prefer one over
the other? We identify dimension as the culprit:
1-dimensional automata are skeletons permitting only
interleaving concurrency, whereas true n-fold
concurrency resides in transitions of dimension n. The
truly concurrent automaton dual to a schedule is not a
skeletal distributive lattice but a solid one! We
introduce true nondeterminism and define it as monoidal
homotopy; from this perspective nondeterminism in
ordinary automata arises from forking and joining
creating nontrivial homotopy. The automaton dual to a
poset schedule is simply connected whereas that dual to
an event structure schedule need not be, according to
monoidal homotopy though not to group homotopy. We
conclude with a formal definition of higher dimensional
automaton as an n-complex or n-category, whose two
essential axioms are associativity of concatenation
within dimension and an interchange principle between
dimensions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1342",
}
@TechReport{Pratt:1990:ALP,
author = "Vaughan Pratt",
title = "Action Logic and Pure Induction",
type = "Technical Report",
number = "STAN-CS-90-1343",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = nov,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1343.html",
abstract = "In Floyd--Hoare logic, programs are dynamic while
assertions are static (hold at states). In action logic
the two notions become one, with programs viewed as
on-the-fly assertions whose truth is evaluated along
intervals instead of at states. Action logic is an
equational theory ACT conservatively extending the
equational theory REG of regular expressions with
operations preimplication $ a \to b $ (had $ a \# $
then $b$) and postimplication $ b \leftarrow a$ ($b$
if-ever $a$). Unlike REG, ACT is finitely based, makes
$ a^* $ reflexive transitive closure, and has an
equivalent Hilbert system. The crucial axiom is that of
pure induction, $ {(a \to a)}^* = a \to a$.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1343",
}
@TechReport{Cheriton:1990:PHS,
author = "David R. Cheriton and Hendrik A. Goosen and Patrick D.
Boyle",
title = "{ParaDiGM}: a highly scalable shared-memory
multi-computer architecture",
type = "Technical Report",
number = "STAN-CS-90-1344",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = nov,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1344.html",
abstract = "ParaDiGM is a highly scalable shared-memory
multi-computer architecture. It is being developed to
demonstrate the feasibility of building a relatively
low-cost shared-memory parallel computer that scales to
large configurations, and yet provides sequential
programs with performance comparable to a high-end
microprocessor. A key problem is building a scalable
memory hierarchy. In this paper we describe the
ParaDiGM architecture, highlighting the innovations of
our approach and presenting results of our evaluation
of the design. We envision that scalable shared-memory
multiprocessors like ParaDiGM will soon become the
dominant form of parallel processing, even for very
large-scale computation, providing a uniform platform
for parallel programming systems and applications.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-90-1344",
}
@TechReport{Laumond:1990:NMP,
author = "Jean-Paul Laumond",
title = "Nonholonomic Motion Planning versus Controllability
via the Multibody Car System Example",
type = "Technical Report",
number = "STAN-CS-90-1345",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 52",
month = dec,
year = "1990",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-90-1345.html",
abstract = "A multibody car system is a non-nilpotent,
non-regular, triangularizable and well-controllable
system. One goal of the current paper is to prove this
obscure assertion. But its main goal is to explain and
enlighten what it means. Motion planning is an already
old and classical problem in Robotics. A few years ago
a new instance of this problem has appeared in the
literature: motion planning for nonholonomic systems.
While useful tools in motion planning come from
Computer Science and Mathematics (Computational
Geometry, Real Algebraic Geometry), nonholonomic motion
planning needs some Control Theory and more Mathematics
(Differential Geometry). First of all, this paper tries
to give a computational reading of the tools from
Differential Geometric Control Theory required by
planning. Then it shows that the presence of obstacles
in the real world of a real robot challenges
Mathematics with some difficult questions which are
topological in nature, and have been solved only
recently, within the framework of Sub-Riemannian
Geometry. This presentation is based upon a reading of
works recently developed by (1) Murray and Sastry, (2)
Lafferiere and Sussmann, and (3) Bellaiche, Jacobs and
Laumond.",
acknowledgement = ack-nhfb,
pdfpages = "53",
xxnumber = "CS-TR-90-1345",
}
@TechReport{Lee:1990:EIO,
author = "Byung S. Lee",
title = "Efficiency in Instantiating Objects from Relational
Databases Through Views",
type = "Technical Report",
number = "STAN-CS-90-1346",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "147",
month = dec,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Merchant:1990:STB,
author = "Arif Merchant",
title = "Settling Time Bounds for {M|G|1} Queues",
type = "Technical Report",
number = "STAN-CS-91-1349",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
month = dec,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Horvitz:1990:CAU,
author = "Eric Horvitz",
title = "Computation and Action Under Bounded Resources",
type = "Technical Report",
number = "STAN-CS-92-1430 (KSL-90-76)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "320",
month = dec,
year = "1990",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Merchant:1991:AMP,
author = "Arif Merchant",
title = "Analytical Models for the Performance Analysis of
Banyan Networks",
type = "Technical Report",
number = "STAN-CS-91-1347",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "120",
month = jan,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Merchant:1991:MCA,
author = "Arif Merchant",
title = "A {Markov} Chain Approximation for the Analysis of
{Banyan} Networks",
type = "Technical Report",
number = "STAN-CS-91-1348",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = jan,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chang:1991:PPS,
author = "Edward Chang and Steven J. Phillips and Jeffrey D.
Ullman",
title = "A Programming and Problem Solving Seminar",
type = "Technical Report",
number = "STAN-CS-91-1350",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "99",
month = feb,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1350.html",
abstract = "This report contains transcripts of the classroom
discussions of Stanford's Computer Science problem
solving course for Ph.D. students, CS304, during Winter
quarter 1990, and the first CS204 class for
undergraduates, in the Spring of 1990. The problems,
and the solutions offered by the classes, span a large
range of ideas in computer science. Since they
constitute a study both of programming and research
paradigms, and of the problem solving process, these
notes may be of interest to students of computer
science, as well as computer science educators.\par
The present report is the ninth in a series of such
transcripts, continuing the tradition established in
STAN-CS-77-606 (Michael J. Clancy, 1977),
STAN-CS-79-707 (Chris Van Wyk, 1979), STAN-CS-81-863
(Allan A. Miller, 1981), STAN-CS-83-989 (Joseph S.
Weening, 1983), STAN-CS-83-990 (John D. Hobby, 1983),
STAN-CS-85-1055 (Ramsey W. Haddad, 1985),
STAN-CS-87-1154 (Tomas G. Rokicki, 1987), and
STAN-CS-89-1269 (Kenneth A. Ross, 1989).",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1350",
}
@TechReport{Zhu:1991:SVP,
author = "Liping Zhu and Arthur M. Keller and Gio Wiederhold",
title = "Sequence vs. pipeline parallel multiple joins in
{Paradata}",
type = "Technical Report",
number = "STAN-CS-91-1351",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "79",
month = feb,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1351.html",
abstract = "In this report we analyze and compare hash-join based
parallel multi-join algorithms for sequenced and
pipelined processing. The BBN Butterfly machine serves
as the host for the performance analysis. The sequenced
algorithm handles the multiple join operations in a
conventional sequenced manner, except that it
distributes the work load of each operation among all
processors. The pipelined algorithms handle the
different join operations in parallel, by dividing the
processors into several groups, with the data flowing
through these groups. The detailed timing tests
revealed the bus/memory contention that grows linearly
with the number of processors. The existence of such a
contention leads to an optimal region for the number of
processors, given the join operands fixed. We present
the analytical and experimental formulae for both
algorithms, which incorporate this contention. We
discuss the way of finding an optimal point, and give
the heuristics for choosing the best processor's
partition in pipelined processing. The study shows that
the pipelined algorithms produce the first joined
result sooner than the sequenced algorithm and need
less memory to store the intermediate result. The
sequenced algorithm, on the other hand, takes less time
to finish the whole join operations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1351",
}
@TechReport{Chavez:1991:AAA,
author = "R. Martin Chavez",
title = "Architectures and Approximation Algorithms for
Probabilistic Systems",
type = "Technical Report",
number = "STAN-CS-91-1352",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "214",
month = feb,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Phipps:1991:GMV,
author = "Geoffrey Phipps",
title = "{Glue} Manual: Version 1.0",
type = "Technical Report",
number = "STAN-CS-91-1353",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "32",
month = mar,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Winograd:1991:IPP,
author = "Terry Winograd",
title = "Introduction to the {Project on People, Computers, and
Design}",
type = "Technical Report",
number = "STAN-CS-91-1354 (CSLI-91-150 PCD-1)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = apr,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Casley:1991:SCS,
author = "Ross Casley",
title = "On the Specification of Concurrent Systems",
type = "Technical Report",
number = "STAN-CS-91-1355",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "101",
month = feb,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Saraiya:1991:SEA,
author = "Yatin Saraiya",
title = "Subtree Elimination Algorithms in Deductive
Databases",
type = "Technical Report",
number = "STAN-CS-91-1356",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "159",
month = jan,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Christensen:1991:AAP,
author = "Jens Christensen",
title = "Automatic Abstraction Planning",
type = "Technical Report",
number = "STAN-CS-91-1357",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "140",
month = mar,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1991:COL,
author = "Andrew V. Goldberg",
title = "Combinatorial Optimization Lecture Notes for
{CS363\slash OR349} Winter 1991",
type = "Technical Report",
number = "STAN-CS-91-1358",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "78",
month = mar,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Alur:1991:BRP,
author = "Rajeev Alur and Tomas Feder and Thomas A. Henzinger",
title = "The Benefits of Relaxing Punctuality",
type = "Technical Report",
number = "STAN-CS-91-1359",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = may,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1359.html",
abstract = "The most natural, compositional way of modeling
real-time systems uses a dense domain for time. The
satisfiability of real-time constraints that are
capable of expressing punctuality in this model is,
however, known to be undecidable. We introduce a
temporal language that can constrain the time
difference between events only with finite (yet
arbitrary) precision and show the resulting logic to be
EXPSPACE-complete. This result allows us to develop an
algorithm for the verification of timing properties of
real-time systems with a dense semantics.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1359",
}
@TechReport{Henzinger:1991:SST,
author = "Thomas A. Henzinger",
title = "Sooner is Safer Than Later",
type = "Technical Report",
number = "STAN-CS-91-1360",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
month = may,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1360.html",
abstract = "It has been repeatedly observed that the standard
safety-liveness classification of properties of
reactive systems does not fit for real-time properties.
This is because the implicit ``liveness'' of time
shifts the spectrum towards the safety side. While, for
example, response--that ``something good'' will happen,
eventually--is a classical liveness property, bounded
response--that ``something good'' will happen soon,
within a certain amount of time--has many
characteristics of safety. We account for this
phenomenon formally by defining safety and liveness
relative to a given condition, such as the progress of
time.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1360",
}
@TechReport{Gangolli:1991:CBM,
author = "Anil Ramesh Gangolli",
title = "Convergence Bounds for {Markov} Chains and
Applications to Sampling",
type = "Technical Report",
number = "STAN-CS-91-1361",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "153",
month = may,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Feder:1991:SNP,
author = "Tomas Feder",
title = "Stable Networks and Product Graphs",
type = "Technical Report",
number = "STAN-CS-91-1362",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "220",
month = may,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gray:1991:PFT,
author = "Cary G. Gray",
title = "Performance and Fault-Tolerance in a Cache for
Distributed File Service",
type = "Technical Report",
number = "STAN-CS-91-1363",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "140",
month = may,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Winograd:1991:LAA,
author = "Terry Winograd and Finn Kensing",
title = "The Language\slash Action Approach to the Design of
Computer-Support for Cooperative Work: a Preliminary
Study in Work Mapping",
type = "Technical Report",
number = "STAN-CS-91-1364 (CSLI-91-152 PCD 2)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = apr,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Paek:1991:JBT,
author = "Eunok Paek",
title = "A Justification-based Theory of Explanation",
type = "Technical Report",
number = "STAN-CS-91-1365",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "103",
month = may,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cohen:1991:CAO,
author = "Edith Cohen",
title = "Combinatorial Algorithms for Optimization Problems",
type = "Technical Report",
number = "STAN-CS-91-1366",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
month = jun,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Herskovits:1991:CBP,
author = "Edward Herskovits",
title = "Computer-Based Probabilistic-Network Construction",
type = "Technical Report",
number = "STAN-CS-91-1367",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "215",
month = jun,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Friedman:1991:CAC,
author = "Joseph Friedman",
title = "Computational Aspects of Compliant Motion Planning",
type = "Technical Report",
number = "STAN-CS-91-1368",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "122",
month = jun,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Fischer:1991:AMP,
author = "Ted Fischer and Andrew V. Goldberg and Serge Plotkin",
title = "Approximating Matchings in Parallel",
type = "Technical Report",
number = "STAN-CS-91-1369",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "5",
month = jun,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1369.html",
abstract = "We show that for any constant k > O, a matching
with cardinality at least 1 --- 1/(k+1) times the
maximum can be computed in NC.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1369",
}
@TechReport{Nagayama:1991:NME,
author = "Misao Nagayama and Carolyn Talcott",
title = "An {NQTHM} mechanization of ``{{\booktitle{An Exercise
in the Verification of Multi-Process Programs}}}''",
type = "Technical Report",
number = "STAN-CS-91-1370",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 84",
month = jun,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/91/1370/CS-TR-91-1370.pdf;
http://www-db.stanford.edu/TR/CS-TR-91-1370.html",
abstract = "This report presents a formal verification of the
local correctness of a mutex algorithm using the
Boyer-Moore theorem prover. The formalization follows
closely an informal proof of Manna and Pnuelli. The
proof method of Manna and Pnueli is to first extract
from the program a set of states and induced transition
system. One then proves suitable invariants. There are
two variants of the proof. In the first (atomic)
variant, compound tests involving quantification over a
finite set are viewed as atomic operations. In the
second (molecular) variant, this assumption is removed,
making the details of the transitions and proof
somewhat more complicated. The original Manna-Pnueli
proof was formulated in terms of finite sets. This led
to concise and elegant informal proof, however one that
is not easy to mechanize in the Boyer-Moore logic. In
the mechanized version we use a dual isomorphic
representation of program states based on finite
sequences. Our approach was to outline the formal proof
of each invariant, making explicit the case analyses,
assumptions and properties of operations used. The
outline served as our guide in developing the formal
proof. The resulting sequence of events follows the
informal plan quite closely. The main difficulties
encountered were in discovering the precise form of the
lemmas and hints necessary to guide the theorem
prover.",
acknowledgement = ack-nhfb,
pdfpages = "86",
xxnumber = "CS-TR-91-1370",
}
@TechReport{Rathmann:1991:NSP,
author = "Peter Rathmann",
title = "Nonmonotonic Semantics for Partitioned Knowledge
Bases",
type = "Technical Report",
number = "STAN-CS-91-1371",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "116",
month = jul,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1991:NRS,
author = "A. V. Goldberg",
title = "A Natural Randomization Strategy for Multicommodity
Flow and Related Algorithms",
type = "Technical Report",
number = "STAN-CS-91-1372",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = jul,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kanakia:1991:HPH,
author = "Hemant Ratubhai Kanakia",
title = "High-Performance Host Interfacing for Packet-Switched
Networks",
type = "Technical Report",
number = "STAN-CS-91-1373",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "53",
month = jul,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Orlin:1991:PDN,
author = "James B. Orlin and Serge A. Plotkin and Eva Tardos",
title = "Polynomial Dual Network Simplex Algorithms",
type = "Technical Report",
number = "STAN-CS-91-1374",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "28",
month = aug,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1374.html",
abstract = "We show how to use polynomial and strongly polynomial
capacity scaling algorithms for the transshipment
problem to design a polynomial dual network simplex
pivot rule. Our best pivoting strategy leads to an $
O(m^2 \log n) $ bound on the number of pivots, where
$n$ and $m$ denotes the number of nodes and arcs in the
input network. If the demands are integral and at most
$B$, we also give an $ O(m(m + n \log n) \min (\log n
B, m \log n))$-time implementation of a strategy that
requires somewhat more pivots.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1374",
}
@TechReport{Leighton:1991:FAA,
author = "Tom Leighton and Fillia Makedon and Serge Plotkin and
Clifford Stein and Eva Tardos and Spyros Tragoudas",
title = "Fast approximation algorithms for multicommodity flow
problems",
type = "Technical Report",
number = "STAN-CS-91-1375",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = aug,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1375.html",
abstract = "In this paper, we describe the first polynomial-time
combinatorial algorithms for approximately solving the
multicommodity flow problem. Our algorithms are
significantly faster than the best previously known
algorithms, that were based on linear programming. For
a k-commodity multicommodity flow problem, the running
time of our randomized algorithm is (up to log factors)
the same as the time needed to solve k single-commodity
flow problems, thus giving the surprising result that
approximately computing a k-commodity maximum-flow is
not much harder than computing about k single-commodity
maximum-flows in isolation. Given any multicommodity
flow problem as input, our algorithm is guaranteed to
provide a feasible solution to a modified flow problem
in which all capacities are increased by a (1 +
epsilon)-factor, or to provide a proof that there is no
feasible solution to the original problem. We also
describe faster approximation algorithms for
multicommodity flow problems with a special structure,
such as those that arise in the ``sparsest cut''
problems and the uniform concurrent flow problems if k
<= the square root of m.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1375",
}
@TechReport{Strat:1991:NOR,
author = "Thomas M. Strat",
title = "Natural Object Recognition",
type = "Technical Report",
number = "STAN-CS-91-1376",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "156",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rothberg:1991:ELL,
author = "Edward Rothberg and Anoop Gupta",
title = "An Evaluation of Left-Looking, Right-Looking and
Multifrontal Approaches to Sparse {Cholesky}
Factorization and Hierarchical-Memory Machines",
type = "Technical Report",
number = "STAN-CS-91-1377 (CSL-TR-91-487)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 47",
month = aug,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1377.html",
abstract = "In this paper we present a comprehensive analysis of
the performance of a variety of sparse Cholesky
factorization methods on hierarchical-memory machines.
We investigate methods that vary along two different
axes. Along the first axis, we consider three different
high-level approaches to sparse factorization:
left-looking, right-looking, and multifrontal. Along
the second axis, we consider the implementation of each
of these high-level approaches using different sets of
primitives. The primitives vary based on the structures
they manipulate. One important structure in sparse
Cholesky factorization is a single column of the
matrix. We first consider primitives that manipulate
single columns. These are the most commonly used
primitives for expressing the sparse Cholesky
computation. Another important structure is the
supernode, a set of columns with identical non-zero
structures. We consider sets of primitives that exploit
the supemodal structure of the matrix to varying
degrees. We find that primitives that manipulate larger
structures greatly increase the amount of exploitable
data reuse, thus leading to dramatically higher
performance on hierarchical-memory machines. We observe
performance increases of two to three times when
comparing methods based on primitives that make
extensive use of the supernodal structure to methods
based on primitives that manipulate columns. We also
find that the overall approach (left-looking,
right-looking, or multifrontal) is less important for
performance than the particular set of primitives used
to implement the approach.",
acknowledgement = ack-nhfb,
pdfpages = "49",
xxnumber = "CS-TR-91-1377",
}
@TechReport{Alur:1991:TAV,
author = "Rajeev Alur",
title = "Techniques for Automatic Verification of Real-Time
Systems",
type = "Technical Report",
number = "STAN-CS-91-1378",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "188",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hall:1991:FCM,
author = "Keith Hall",
title = "A Framework for Change Management in a Design
Database",
type = "Technical Report",
number = "STAN-CS-91-1379",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "185",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Henzinger:1991:TSV,
author = "Thomas Henzinger",
title = "The Temporal Specification and Verification of
Real-Time Systems",
type = "Technical Report",
number = "STAN-CS-91-1380",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "300",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Hara:1991:IHD,
author = "Yoshinori Hara and Arthur M. Keller and Peter K.
Rathmann and Gio Wiederhold",
title = "Implementing hypertext database relationships through
aggregations and exceptions",
type = "Technical Report",
number = "STAN-CS-91-1381",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "36",
month = sep,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1381.html",
abstract = "In order to combine hypertext with database
facilities, we show how to extract an effective storage
structure from given instance relationships. The schema
of the structure recognizes clusters and exceptions.
Extracting high-level structures is useful for
providing a high performance browsing environment as
well as efficient physical database design, especially
when handling large amounts of data. This paper focuses
on a clustering method, ACE, which generates
aggregations and exceptions from the original graph
structure in order to capture high level relationships.
The problem of minimizing the cost function is
NP-complete. We use a heuristic approach based on an
extended Kernighan-Lin algorithm. We demonstrate our
method on a hypertext application and on a standard
random graph, compared with its analytical model. The
storage reductions of input database size in main
memory were 77.2\% and 12.3\%, respectively. It was
also useful for secondary storage organization for
efficient retrieval.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1381",
}
@TechReport{Morris:1991:SOQ,
author = "Katherine A. Morris",
title = "Subgoal Order for Query Optimization in Logic
Databases",
type = "Technical Report",
number = "STAN-CS-91-1382",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "116",
month = jun,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Henzinger:1991:TPM,
author = "Thomas A. Henzinger and Zohar Manna and Amir Pnueli",
title = "Temporal Proof Methodologies for Real-Time Systems",
type = "Technical Report",
number = "STAN-CS-91-1383",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "49",
month = sep,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1383.html",
abstract = "We extend the specification language of temporal
logic, the corresponding verification framework, and
the underlying computational model to deal with
real-time properties of reactive systems. The abstract
notion of timed transition systems generalizes
traditional transition systems conservatively:
qualitative fairness requirements are replaced (and
superseded) by quantitative lower-bound and upper-bound
timing constraints on transitions. This framework can
model real-time systems that communicate either through
shared variables or by message passing and real-time
issues such as time-outs, process priorities
(interrupts), and process scheduling. We exhibit two
styles for the specification of real-time systems.
While the first approach uses bounded versions of
temporal operators, the second approach allows explicit
references to time through a special clock variable.
Corresponding to the two styles of specification, we
present and compare two fundamentally different proof
methodologies for the verification of timing
requirements that are expressed in these styles. For
the bounded-operator style, we provide a set of proof
rules for establishing bounded-invariance and
bounded-response properties of timed transition
systems. This approach generalizes the standard
temporal proof rules for verifying invariance and
response properties conservatively. For the
explicit-clock style, we exploit the observation that
every time-bounded property is a safety property and
use the standard temporal proof rules for establishing
safety properties.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1383",
}
@TechReport{Myers:1991:UAI,
author = "Karen L. Myers",
title = "Universal Attachment: an Integration Method for Logic
Hybrids",
type = "Technical Report",
number = "STAN-CS-91-1384",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "188",
month = sep,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lin:1991:SNR,
author = "Fangzhen Lin",
title = "A Study of Nonmonotonic Reasoning",
type = "Technical Report",
number = "STAN-CS-91-1385",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "106",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ross:1991:SDD,
author = "Kenneth A. Ross",
title = "The Semantics of Deductive Databases",
type = "Technical Report",
number = "STAN-CS-91-1386",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wilson:1991:APS,
author = "Randall Wilson and Achim Schweikard",
title = "Assembling Polyhedra with Single Translations",
type = "Technical Report",
number = "STAN-CS-91-1387",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = oct,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1387.html",
abstract = "The problem of partitioning an assembly of polyhedral
objects into two subassemblies that can be separated
arises in assembly planning. We describe an algorithm
to compute the set of all translations separating two
polyhedra with n vertices in O(n4) steps and show that
this is optimal. Given an assembly of k polyhedra with
a total of n vertices, an extension of this algorithm
identifies a valid translation and removable
subassembly in O(k2 n4) steps if one exists. Based on
the second algorithm a polynomial time method for
finding a complete assembly sequence consisting of
single translations is derived. An implementation
incorporates several changes to achieve better
average-case performance; experimental results obtained
for composite objects consisting of isothetic polyhedra
are described.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1387",
}
@TechReport{Whang:1991:DMD,
author = "Kyu-Young Whang and Sang-Wook Kim and Gio Wiederhold",
title = "Dynamic Maintenance of Data Distribution for
Selectivity Estimation",
type = "Technical Report",
number = "STAN-CS-91-1388",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = sep,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Torrance:1991:AM,
author = "Mark C. Torrance and Paul A. Viola",
title = "The {AGENT0} Manual",
type = "Technical Report",
number = "STAN-CS-91-1389",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 8",
day = "9",
month = apr,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1389.html",
abstract = "This document describes an implementation of AOP, an
interpreter for programs written in a language called
AGENTO. AGENTO is a first stab at a programming
language for the paradigm of Agent-Oriented
Programming. It is currently under development at
Stanford under the direction of Yoav Shoham. This
implementation is the work of Paul A. Viola of MIT and
Mark C. Torrance of Stanford.",
acknowledgement = ack-nhfb,
pdfpages = "10",
xxnumber = "CS-TR-91-1389",
}
@TechReport{Shoham:1991:VC,
author = "Yoav Shoham",
title = "Varieties of Context",
type = "Technical Report",
number = "STAN-CS-91-1390",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = oct,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Shoham:1991:LPB,
author = "Yoav Shoham and Alvaro del Val",
title = "A Logic for Perception and Belief",
type = "Technical Report",
number = "STAN-CS-91-1391",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 23",
day = "24",
month = sep,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1391.html",
abstract = "We present a modal logic for reasoning about
perception and belief, captured respectively by the
operators P and B. The B operator is the standard
belief operator used in recent years, and the P
operator is similarly defined. The contribution of the
paper is twofold. First, in terms of P we provide a
definition of perceptual indistinguishability, such as
arises out of limited visual acuity. The definition is
concise, intuitive (we find), and avoids traditional
paradoxes. Second, we explore the bimodal B--P system.
We argue that the relationship between the two
modalities varies among settings: The agent may or may
not have confidence in its perception, may or may not
be accurate in it, and so on. We therefore define a
number of agent types corresponding to these various
assumptions, and for each such agent type we provide a
sound and complete axiomatization of the B--P system.",
acknowledgement = ack-nhfb,
pdfpages = "25",
xxnumber = "CS-TR-91-1391",
}
@TechReport{Ceri:1991:CUM,
author = "Stefano Ceri and Maurice A. W. Houtsma and Arthur M.
Keller and Pierangela Samarati",
title = "A classification of update methods for replicated
databases",
type = "Technical Report",
number = "STAN-CS-91-1392",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = oct,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1392.html",
abstract = "In this paper we present a classification of the
methods for updating replicated databases. The main
contribution of this paper is to present the various
methods in the context of a structured taxonomy, which
accommodates very heterogeneous methods. Classes of
update methods are presented through their general
properties, such as the invariants that hold for them.
Methods are reviewed both in their normal and abnormal
behaviour (e.g., after a network partition). We show
that several methods presented in the literature,
sometimes in independent papers with no
cross-reference, are indeed very much related, for
instance because they share the same basic technique.
We also show in what sense they diverge from the basic
technique. This classification can serve as a basis for
choosing the method that is most suitable to a specific
application. It can also be used as a guideline to
researchers who aim at developing new mechanisms.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1392",
}
@TechReport{Goosen:1991:SMC,
author = "Hendrik A. Goosen",
title = "Shared Multilevel Caches for Scalable
Multiprocessors",
type = "Technical Report",
number = "STAN-CS-91-1393",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "76",
month = oct,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Harty:1991:ACP,
author = "Kieran Harty and David R. Cheriton",
title = "Application-controlled physical memory using external
page-cache management",
type = "Technical Report",
number = "STAN-CS-91-1394",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = oct,
year = "1991",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-91-1394.html",
abstract = "Next generation computer systems will have gigabytes
of physical memory and processors in the 100 MIPS range
or higher. Contrary to some conjectures, this trend
requires more sophisticated memory management support
for memory-bound computations such as scientific
simulations and systems such as large-scale database
systems, even though memory management for most
programs will be less of a concern. We describe the
design, implementation and evaluation of a virtual
memory system that provides application control of
physical memory using external page-cache management.
In this approach, a sophisticated application is able
to monitor and control the amount of physical memory it
has available for execution, the exact contents of this
memory, and the scheduling and nature of page-in and
page-out using the abstraction of a physical page cache
provided by the kernel. We claim that this approach can
significantly improve performance for many memory-bound
applications while reducing kernel complexity, yet does
not complicate other applications or reduce their
performance.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-91-1394",
}
@TechReport{Hartfield:1991:LHD,
author = "Brad Hartfield and Terry Winograd and John Bennett",
title = "Learning {HCI} Design: Mentoring Project Groups in a
Course on Human--Computer Interaction",
type = "Technical Report",
number = "STAN-CS-91-1395 (CSLI-91-161 PCD-3)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = dec,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Scales:1991:POM,
author = "Daniel Scales",
title = "Parallelizing the {OPS5} Matching Algorithm in
{Qlisp}",
type = "Technical Report",
number = "STAN-CS-91-1396",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = oct,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Roy:1991:AMP,
author = "Shaibal Roy",
title = "Adaptive Methods in Parallel Databases",
type = "Technical Report",
number = "STAN-CS-91-1397",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "160",
month = aug,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Salesin:1991:EGB,
author = "David Salesin",
title = "Epsilon Geometry: Building Robust Algorithms From
Imprecise Computations",
type = "Technical Report",
number = "STAN-CS-91-1398",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = mar,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Guha:1991:CFS,
author = "Ramanathan Guha",
title = "Contexts: a Formalization and Some Applications",
type = "Technical Report",
number = "STAN-CS-91-1399(KSL-91-74)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "280",
month = dec,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Mumick:1991:QOD,
author = "Inderpal Mumick",
title = "Query Optimization in Deductive and Relational
Databases",
type = "Technical Report",
number = "STAN-CS-91-1400",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "190",
month = dec,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Lehmann:1991:BCB,
author = "Harold Lehmann",
title = "A {Bayesian} Computer-Based Approach to the
Physician's Use of the Clinical Research Literature",
type = "Technical Report",
number = "STAN-CS-92-1402(KSL-91-76)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "300",
month = dec,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Golding:1991:PNC,
author = "Andrew Golding",
title = "Pronouncing Names by a Combination of Rule-Based and
Case-Based Reasoning",
type = "Technical Report",
number = "STAN-CS-92-1403",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "380",
month = oct,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cha:1991:KMB,
author = "Sang Kyun Cha",
title = "Kaleidoscope: a Model-Based Grammar-Driven Menu
Interface for Databases",
type = "Technical Report",
number = "STAN-CS-92-1405",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = jul,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Williamson:1991:MRT,
author = "Carey Lee Williamson",
title = "Minimizing Round-Trip Times for High-Performance
Transport Communication",
type = "Technical Report",
number = "STAN-CS-92-1409",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "129",
month = oct,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Deering:1991:MRD,
author = "Stephen Deering",
title = "Multicast Routing in a Datagram Internetwork",
type = "Technical Report",
number = "STAN-CS-92-1415",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "141",
month = dec,
year = "1991",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rothberg:1992:PID,
author = "Edward Rothberg and Anoop Gupta",
title = "The performance impact of data reuse in parallel dense
{Cholesky} factorization",
type = "Technical Report",
number = "STAN-CS-92-1401(CSL-TR-92-503)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jan,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1401.html",
abstract = "This paper explores performance issues for several
prominent approaches to parallel dense Cholesky
factorization. The primary focus is on issues that
arise when blocking techniques are integrated into
parallel factorization approaches to improve data reuse
in the memory hierarchy. We first consider
panel-oriented approaches, where sets of contiguous
columns are manipulated as single units. These methods
represent natural extensions of the column-oriented
methods that have been widely used previously. On
machines with memory hierarchies, panel-oriented
methods significantly increase the achieved performance
over column-oriented methods. However, we find that
panel- oriented methods do not expose enough
concurrency for problems that one might reasonably
expect to solve on moderately parallel machines, thus
significantly limiting their performance. We then
explore block-oriented approaches, where square
submatrices are manipulated instead of sets of columns.
These methods greatly increase the amount of available
concurrency, thus alleviating the problems encountered
with panel-oriented methods. However, a number of
issues, including scheduling choices and block-
placement issues, complicate their implementation. We
discuss these issues and consider approaches that solve
the resulting problems. The resulting block-oriented
implementation yields high processor utilization levels
over a wide range of problem sizes.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-92-1401",
}
@TechReport{Manna:1992:FDP,
author = "Zohar Manna and Richard Waldinger",
title = "Fundamentals of Deductive Program Synthesis",
type = "Technical Report",
number = "STAN-CS-92-1404",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "62",
month = jan,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Radzik:1992:NMF,
author = "Tomasz Radzik",
title = "{Newton}'s Method for Fractional Combinatorial
Optimization",
type = "Technical Report",
number = "STAN-CS-92-1406",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "22",
month = jan,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Maler:1992:THS,
author = "Oded Maler and Zohar Manna and Amir Pnueli",
title = "From Timed to Hybrid Systems",
type = "Technical Report",
number = "STAN-CS-92-1407",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = jan,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chang:1992:SPC,
author = "Edward Chang and Zohar Manna and Amir Pnueli",
title = "The Safety-Progress Classification",
type = "Technical Report",
number = "STAN-CS-92-1408",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "60",
month = feb,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Alizadeh:1992:IPR,
author = "Farid Alizadeh and Andrew Goldberg",
title = "Implementing the Push-Relabel Method for the Maximum
Flow Problem on the Connection Machine",
type = "Technical Report",
number = "STAN-CS-92-1410",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "17",
month = feb,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wong-Toi:1992:CDR,
author = "Howard Wong-Toi and Gerard Hoffmann",
title = "The Control of Dense Real-Time Discrete Event
Systems",
type = "Technical Report",
number = "STAN-CS-92-1411",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "50",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nilsson:1992:TAP,
author = "Nils J. Nilsson",
title = "Toward Agent Programs with Circuit Semantics",
type = "Technical Report",
number = "STAN-CS-92-1412",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "33",
month = jan,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1412.html",
abstract = "New ideas are presented for computing and organizing
actions for autonomous agents in dynamic environments
--- environments in which the agent's current situation
cannot always be accurately discerned and in which the
effects of actions cannot always be reliably predicted.
The notion of ``circuit semantics'' for programs based
on ``teleo-reactive trees'' is introduced. Program
execution builds a combinational circuit which receives
sensory inputs and controls actions. These formalisms
embody a high degree of inherent conditionality and
thus yield programs that are suitably reactive to their
environments. At the same time, the actions computed by
the programs are guided by the overall goals of the
agent. The paper also speculates about how programs
using these ideas could be automatically generated by
artificial intelligence planning systems and adapted by
learning methods.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-92-1412",
}
@TechReport{Zhu:1992:EIG,
author = "David Zhu",
title = "Exploring the Interaction of Geometry and Search in
Path Planning",
type = "Technical Report",
number = "STAN-CS-92-1413",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "203",
month = feb,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Miller:1992:PTF,
author = "Robert Miller",
title = "Proceedings From the {Twenty-Fourth Annual Meeting of
the Stanford Computer Forum}",
type = "Technical Report",
number = "STAN-CS-92-1414",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "186",
month = feb,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wilson:1992:GAP,
author = "Randall Wilson",
title = "On Geometric Assembly Planning",
type = "Technical Report",
number = "STAN-CS-92-1416",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "154",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Suermondt:1992:EBB,
author = "Henri Jacques Suermondt",
title = "Explanation in {Bayesian} Belief Networks",
type = "Technical Report",
number = "STAN-CS-92-1417",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "263",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1992:ISP,
author = "Andrew Goldberg and Michael Kharitonov",
title = "On Implementing Scaling Push--Relabel Algorithms for
the Minimum Cost Flow Problems",
type = "Technical Report",
number = "STAN-CS-92-1418",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Plotkin:1992:FAA,
author = "Serge A. Plotkin and David B. Shmoys and {\'E}va
Tardos",
title = "Fast Approximation Algorithms for Fractional Packing
and Covering Problems",
type = "Technical Report",
number = "STAN-CS-92-1419",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 52",
month = feb,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1419.html",
abstract = "This paper presents fast algorithms that find
approximate solutions for a general class of problems,
which we call fractional packing and covering problems.
The only previously known algorithms for solving these
problems are based on general linear programming
techniques. The techniques developed in this paper
greatly outperform the general methods in many
applications, and are extensions of a method previously
applied to find approximate solutions to multicommodity
flow problems. Our algorithm is a Lagrangean relaxation
technique; an important aspect of our results is that
we obtain a theoretical analysis of the running time of
a Lagrangean relaxation-based algorithm.\par
We give several applications of our algorithms. The new
approach yields several orders of magnitude of
improvement over the best previously known running
times for the scheduling of unrelated parallel machines
in both the preemptive and the non-preemptive models,
for the job shop problem, for the cutting-stock
problem, and for the minimum cost multicommodity flow
problem.",
acknowledgement = ack-nhfb,
pdfpages = "54",
xxnumber = "CS-TR-92-1419",
}
@TechReport{Chambers:1992:DIS,
author = "Craig Chambers",
title = "The Design and Implementation of the Self Compiler, an
Optimizing Compiler for Object-Oriented Programming
Languages",
type = "Technical Report",
number = "STAN-CS-92-1420",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "246",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wang:1992:FTC,
author = "Alexander Wang",
title = "Fault-Tolerant Computation on Hypercubes",
type = "Technical Report",
number = "STAN-CS-92-1421",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "148",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Walker:1992:PEC,
author = "Michael Walker",
title = "Probability Estimation for Classification Trees and
{DNA} Sequence Analysis",
type = "Technical Report",
number = "STAN-CS-92-1422(KSL-92-27)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "213",
month = mar,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Dwork:1992:TLS,
author = "Cynthia Dwork and Maurice Herlihy and Serge A. Plotkin
and Orli Waarts",
title = "Time-Lapse Snapshots",
type = "Technical Report",
number = "STAN-CS-92-1423",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 19",
month = apr,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1423/CS-TR-92-1423.pdf;
http://www-db.stanford.edu/TR/CS-TR-92-1423.html",
abstract = "A snapshot scan algorithm takes an ``instantaneous''
picture of a region of shared memory that may he
updated by concurrent processes. Many complex shared
memory algorithms can be greatly simplified by
structuring them around the snapshot scan abstraction.
Unfortunately, the substantial decrease in conceptual
complexity is quite often counterbalanced by an
increase in computational complexity.\par
In this paper, we introduce the notion of a weak
snapshot scan, a slightly weaker primitive that has a
more efficient implementation. We propose the following
methodology for using this abstraction: first, design
and verify an algorithm using the more powerful
snapshot scan, and second, replace the more powerful
but less efficient snapshot with the weaker but more
efficient snapshot, and show that the weaker
abstraction nevertheless suffices to ensure the
correctness of the enclosing algorithm.\par
We give two examples of algorithms whose performance
can be enhanced while retaining a simple modular
structure: bounded concurrent timestamping, and bounded
randomized consensus. The resulting timestamping
protocol is the fastest known bounded concurrent
timestamping protocol. The resulting randomized
consensus protocol matches the computational complexity
of the best known protocol that uses only bounded
values.",
acknowledgement = ack-nhfb,
pdfpages = "22",
xxnumber = "CS-TR-92-1423",
}
@TechReport{Takeda:1992:PMM,
author = "Haruo Takeda and Jean-Claude Latombe",
title = "Planning the Motions of a Mobile Robot in a Sensory
Uncertainty Field",
type = "Technical Report",
number = "STAN-CS-92-1424",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = apr,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kavraki:1992:CCS,
author = "Lydia Kavraki",
title = "Computation of Configuration-Space Obstacles Using the
{Fast Fourier Transform}",
type = "Technical Report",
number = "STAN-CS-92-1425",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = apr,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Danvy:1992:PAS,
author = "Olivier Danvy and Carolyn Talcott",
title = "Proceedings of the {ACM SIGPLAN Workshop on
Continuations CW92}",
type = "Technical Report",
number = "STAN-CS-92-1426",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 103",
day = "21",
month = jun,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1426/CS-TR-92-1426.pdf;
http://www-db.stanford.edu/TR/CS-TR-92-1426.html",
abstract = "The notion of continuation is ubiquitous in many
different areas of computer science, including logic,
constructive mathematics, programming languages, and
programming. This workshop aims at providing a forum
for discussion of: new results and work in progress;
work aimed at a better understanding of the nature of
continuations; applications of continuations, and the
relation of continuations to other areas of logic and
computer science. This technical report serves as
informal proceedings for CW92. It consists of submitted
manuscripts bound together according to the program
order.",
acknowledgement = ack-nhfb,
pdfpages = "105",
xxnumber = "CS-TR-92-1426",
}
@TechReport{Goldberg:1992:PAR,
author = "Andrew Goldberg and Bruce Maggs and Serge Plotkin",
title = "A Parallel Algorithm for Reconfiguring a
Multibutterfly Network with Faulty Switches",
type = "Technical Report",
number = "STAN-CS-92-1427",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = apr,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Lazanas:1992:LBR,
author = "Anthony Lazanas and Jean-Claude Latombe",
title = "Landmark-Based Robot Navigation",
type = "Technical Report",
number = "STAN-CS-92-1428",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "54",
month = may,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1992:SAS,
author = "Andrew Goldberg",
title = "Scaling Algorithms for the Shortest Paths Problem",
type = "Technical Report",
number = "STAN-CS-92-1429",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
month = may,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Garcia-Molina:1992:ATR,
author = "Hector Garcia-Molina and Ben Kao and Daniel
Barbar{\'a}",
title = "Aggressive Transmissions Over Redundant Paths for Time
Critical Messages",
type = "Technical Report",
number = "STAN-CS-92-1431",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 43",
month = may,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1431/CS-TR-92-1431.pdf;
http://www-db.stanford.edu/TR/CS-TR-92-1431.html",
abstract = "Fault tolerant computer systems have redundant paths
connecting their components. Given these paths, it is
possible to use aggressive techniques to reduce the
average value and variability of the response time for
critical messages. One technique is to send a copy of a
packet over an alternate path before it is known if the
first copy failed or was delayed. A second technique is
to split a single stream of packets over multiple
paths. We analyze both approaches and show that they
can provide significant improvements over conventional,
conservative mechanisms.",
acknowledgement = ack-nhfb,
pdfpages = "45",
remark = "PDF file contains no publication date; the STAN-CS
bibliographies give this as May 1992 and October 1993,
and have an incorrect author order.",
xxnumber = "CS-TR-92-1431",
}
@TechReport{Chaudhuri:1992:DRT,
author = "Surajit Chaudhuri",
title = "Detecting Redundant Tuples During Query Evaluation",
type = "Technical Report",
number = "STAN-CS-92-1433",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "230",
month = jun,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tomasic:1992:PII,
author = "Anthony Tomasic and Hector Garcia-Molina",
title = "Performance of Inverted Indices in Distributed Text
Document Retrieval Systems",
type = "Technical Report",
number = "STAN-CS-92-1434",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jun,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Motwani:1993:LNA,
author = "Rajeev Motwani",
title = "Lecture Notes on Approximation Algorithms --- {Volume
I}",
type = "Technical Report",
number = "STAN-CS-92-1435",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 132",
month = jun,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1435.html",
abstract = "These lecture notes are based on the course CS351
(Dept. of Computer Science, Stanford University)
offered during the academic year 1991-92. The notes
below correspond to the first half of the course. The
second half consists of topics such as AL4X SNP.
cliques, and colorings, as well as more specialized
material covering topics such as geometric problems,
Steiner trees and multicommodity flows. The second half
is being revised to incorporate the implications of
recent results in approximation algorithms and the
complexity of approximation problems. Please let me
know if you would like to be on the mailing list for
the second half. Comments, criticisms and corrections
are welcome, please send them by electronic mail to
rajeev@cs.Stanford.edu.",
acknowledgement = ack-nhfb,
pdfpages = "134",
remark = "No publication date in PDF file. Stanford
bibliographies record this is as June 1992 and October
1993.",
xxnumber = "CS-TR-92-1435",
}
@TechReport{Winograd:1992:CES,
author = "Terry Winograd",
title = "Computers, Ethics, and Social Responsibility",
type = "Technical Report",
number = "STAN-CS-92-1436",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
month = jul,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Phipps:1992:GDD,
author = "Geoffrey Phipps",
title = "Glue: a Deductive Database Programming Language",
type = "Technical Report",
number = "STAN-CS-92-1437",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "139",
month = jul,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Rothberg:1992:EBO,
author = "Edward Rothberg and Anoop Gupta",
title = "An Efficient Block-Oriented Approach to Parallel
Sparse {Cholesky} Factorization",
type = "Technical Report",
number = "STAN-CS-92-1438(CSL-TR-92-533)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jul,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1992:EIS,
author = "Andrew Goldberg",
title = "An Efficient Implementation of a Scaling {MinimumCost}
Flow Algorithm",
type = "Technical Report",
number = "STAN-CS-92-1439",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = aug,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Woodfill:1992:MVT,
author = "John Woodfill",
title = "Motion Vision and Tracking for Robots in Dynamic,
Unstructured Environments",
type = "Technical Report",
number = "STAN-CS-92-1440",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "163",
month = aug,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Schweikard:1992:MPS,
author = "Achim Schweikard and John R. Adler and Jean-Claude
Latombe",
title = "Motion Planning in Stereotaxic Radiosurgery",
type = "Technical Report",
number = "STAN-CS-92-1441",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = sep,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1441.html",
abstract = "Stereotaxic radiosurgery is a procedure which uses a
beam of radiation as an ablative surgical instrument to
destroy brain tumors. The beam is produced by a linear
accelerator which is moved by a jointed mechanism.
Radiation is concentrated by crossfiring at the tumor
from multiple directions and the amount of energy
deposited in normal brain tissues is reduced. Because
access to the tumor is obstructed along some directions
by critical regions (e.g., brainstem, optic nerves) and
most tumors are not shaped like spheres, planning the
path of the beam is often difficult and time-consuming.
This paper describes a computer-based planner developed
to assist the surgeon generate a satisfactory path,
given the spatial distribution of the brain tissues
obtained with medical imaging. Experimental results
with the implemented planner are presented, including a
comparison with manually generated paths. According to
these results, automatic planning significantly
improves energy deposition. It can also shorten the
overall treatment, hence reducing the patient's pain
and allowing the radiosurgery equipment to be used for
more patients. Stereotaxic radiosurgery is an example
of so-called ``bloodless surgery''. Computer-based
planning techniques are expected to facilitate further
development of this safer, less painful, and more cost
effective type of surgery.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-92-1441",
}
@TechReport{Wilson:1992:RAM,
author = "Randall H. Wilson and Jean-Claude Latombe",
title = "Reasoning About Mechanical Assembly",
type = "Technical Report",
number = "STAN-CS-92-1442",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "31",
month = sep,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Nayak:1992:AMP,
author = "P. Pandurang Nayak",
title = "Automated Modeling of Physical Systems",
type = "Technical Report",
number = "STAN-CS-92-1443 (KSL-92-69)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "315",
month = sep,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1992:MPD,
author = "Aaron J. Goldberg",
title = "Multiprocessor Performance Debugging and Memory
Bottlenecks",
type = "Technical Report",
number = "STAN-CS-92-1444 (CSL-TR-92-542)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "124",
month = may,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kharitonov:1992:CHD,
author = "Michael Kharitonov",
title = "Cryptographic Hardness of Distribution-Specific
Learning",
type = "Technical Report",
number = "STAN-CS-92-1445",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = sep,
year = "1992",
DOI = "https://doi.org/10.1145/167088.167197",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://www.cis.upenn.edu/~mkearns/teaching/Crypto/kharitonov.pdf",
acknowledgement = ack-nhfb,
remark = "Published in \booktitle{Proceedings of the
twenty-fifth annual ACM symposium on Theory of
computing --- STOC '93}, pp. 372--381, 1993.
doi:10.1145/167088.167197",
}
@TechReport{Ceri:1992:IUI,
author = "Stefano Ceri and Maurice A. W. Houtsma and Arthur M.
Keller and Pierangela Samarati",
title = "Independent updates and incremental agreement in
replicated databases",
type = "Technical Report",
number = "STAN-CS-92-1446",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
month = oct,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1446.html",
abstract = "Update propagation and transaction atomicity are major
obstacles to the development of replicated databases.
Many practical applications, such as automated teller
machine (ATM) networks, flight reservation, and part
inventory control, do not really require these
properties. In this paper we present an approach for
incrementally updating a distributed, replicated
database without requiring multi-site atomic commit
protocols. We prove that the mechanism is correct, as
it asymptotically performs all the updates on all the
copies. Our approach has two important characteristics:
it is progressive, and non-blocking. Progressive means
that the transaction's coordinator always commits,
possibly together with a group of other sites. The
update is later propagated asynchronously to the
remaining sites. Non-blocking means that each site can
take unilateral decisions at each step of the
algorithm. Sites which cannot commit updates are
brought to the same final state by means of a
reconciliation mechanism. This mechanism uses the
history logs, which are stored locally at each site, to
bring sites to agreement. It requires a small auxiliary
data structure, called reception vector, to keep track
of the time until which the other sites are guaranteed
to be up-to-date. Several optimizations to the basic
mechanism are also discussed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-92-1446",
}
@TechReport{Goldberg:1992:LNT,
author = "Andrew V. Goldberg and Serge Plotkin",
title = "Lecture Notes: Topics in Combinatorial Optimization",
type = "Technical Report",
number = "STAN-CS-92-1447",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "85",
month = oct,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Crew:1992:MPM,
author = "Roger F. Crew",
title = "Metric Process Models",
type = "Technical Report",
number = "STAN-CS-92-1448",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "87",
month = oct,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Maydan:1992:AAA,
author = "Dror Eliezer Maydan",
title = "Accurate Analysis of Array References",
type = "Technical Report",
number = "STAN-CS-92-1449 (CSL-TR-92-547)",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "144",
month = sep,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Waarts:1992:NAP,
author = "Orli Waarts",
title = "New Algorithms and Primitives for Multi Processor
Coordination",
type = "Technical Report",
number = "STAN-CS-92-1450",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "165",
month = aug,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Radzik:1992:ASL,
author = "Tomasz Radzik",
title = "Algorithms for Some Linear and Fractional
Combinatorial Optimization Problems",
type = "Technical Report",
number = "STAN-CS-92-1451",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "100",
month = aug,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kao:1992:DAD,
author = "Ben Kao and Hector Garcia-Molina",
title = "Deadline assignment in a distributed soft real-time
system",
type = "Technical Report",
number = "STAN-CS-92-1452",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = oct,
year = "1992",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-92-1452.html",
abstract = "In a distributed environment, tasks often have
processing demands on multiple different sites. A
distributed task is usually divided up into several
subtasks, each one to be executed at some site in
order. In a real-time system, an overall deadline is
usually specified by an application designer indicating
when a distributed task is to be finished. However, the
problem of how a global deadline is automatically
translated to the deadline of each individual subtask
has not been well studied. This paper examines (through
simulations) four strategies for subtask deadline
assignment in a distributed soft real-time
environment.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-92-1452",
}
@TechReport{Kao:1992:RTC,
author = "Ben Kao and Hector Garcia-Molina",
title = "Real-Time Communication Over Multiple Standard
Networks",
type = "Technical Report",
number = "STAN-CS-92-1453",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = nov,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Yan:1992:ISS,
author = "Tak W. Yan and Hector Garcia-Molina",
title = "Index Structures for Selective Dissemination of
Information",
type = "Technical Report",
number = "STAN-CS-92-1454",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "48",
month = dec,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Howard:1992:FPE,
author = "Brian Howard",
title = "Fixed Points and Extensionality in Typed Functional
Programming Languages",
type = "Technical Report",
number = "STAN-CS-92-1455",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "66",
month = "????",
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Tomasic:1992:CDS,
author = "Anthony Tomasic and Hector Garcia-Molina",
title = "Caching and Database Scaling in Distributed
Shared-Nothing Information Retrieval Systems",
type = "Technical Report",
number = "STAN-CS-92-1456",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = dec,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Khatib:1992:IPR,
author = "Oussama Khatib",
title = "Inertial Properties in Robotics Manipulation",
type = "Technical Report",
number = "STAN-CS-92-1457",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = dec,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wilson:1992:CPA,
author = "Randall Wilson and Jean-Claude Latombe and Tomas
Lozano-Perez",
title = "On the Complexity of Partitioning an Assembly",
type = "Technical Report",
number = "STAN-CS-92-1458",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
month = dec,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Rothberg:1992:EMH,
author = "Edward Rothberg",
title = "Exploiting the Memory Hierarchy in Sequential and
Parallel Sparse {Cholesky} Factorization",
type = "Technical Report",
number = "STAN-CS-92-1459",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "153",
month = nov,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Derr:1992:AOD,
author = "Marcia A. Derr",
title = "Adaptive Optimization in a Database Programming
Language",
type = "Technical Report",
number = "STAN-CS-92-1460",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "143",
month = dec,
year = "1992",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Breitbart:1992:OMT,
author = "Yuri Breitbart and Hector Garcia-Molina and Avi
Silberschatz",
title = "Overview of Multidatabase Transaction Management",
type = "Technical Report",
number = "STAN-CS-92-1432",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = may,
year = "1992",
DOI = "https://doi.org/10.1145/1925805.1925811",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/92/1432/CS-TR-92-1432.pdf;
http://www-db.stanford.edu/TR/CS-TR-92-1432.html",
abstract = "A multidatabase system (MDBS) is a facility that
allows users access to data located in multiple
autonomous database management systems (DBMSs). In such
a system, global transactions are executed under the
control of the MDBS. Independently, local transactions
are executed under the control of the local DBMSs. Each
local DBMS integrated by the MDBS may employ a
different transaction management scheme. In addition,
each local DBMS has complete control over all
transactions (global and local) executing at its site,
including the ability to abort at any point any of the
transactions executing at its site. Typically, no
design or internal DBMS structure changes are allowed
in order to accommodate the MDBS. Furthermore, the
local DBMSs may not be aware of each other, and, as a
consequence, cannot coordinate their actions. Thus,
traditional techniques for ensuring transaction
atomicity and consistency in homogeneous distributed
database systems may not be appropriate for an MDBS
environment. The objective of this paper is to provide
a brief review of the most current work in the area of
multidatabase transaction management. We first define
the problem and argue that the multidatabase research
will become increasingly important in the coming years.
We then outline basic research issues in multidatabase
transaction management and review recent results in the
area. We conclude the paper with a discussion of open
problems and practical implications of this research.",
acknowledgement = ack-nhfb,
remark = "Published at recorded DOI in CASCON'10 conference
proceedings, pp. 93--126; no PDF file available at
Stanford link. Stanford bibliographies record this as
May 1992 and October 1993.",
xxnumber = "CS-TR-92-1432",
}
@TechReport{Manna:1993:MR,
author = "Zohar Manna and Amir Pnueli",
title = "Models for Reactivity",
type = "Technical Report",
number = "STAN-CS-93-1461",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "73",
month = jan,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gunawardena:1993:PBT,
author = "Jeremy Gunawardena",
title = "Periodic Behaviour in Timed Systems With {{\{And\slash
OR\}}} Causality. {Part I}: Systems of Dimension 1 and
2",
type = "Technical Report",
number = "STAN-CS-93-1462",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = feb,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Manna:1993:TPM,
author = "Zohar Manna and Amir Pnueli",
title = "A Temporal {PROOF} Methodology for Reactive Systems",
type = "Technical Report",
number = "STAN-CS-93-1463",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = feb,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kharitonov:1993:CHM,
author = "Michael Kharitonov",
title = "Cryptographic Hardness of Machine Learning",
type = "Technical Report",
number = "STAN-CS-93-1464",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "131",
month = may,
year = "1993",
DOI = "https://doi.org/10.5555/164350",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://books.google.com/books?id=QvREAQAAIAAJ;
https://dl.acm.org/doi/book/10.5555/164350",
abstract = "This thesis investigates the use of cryptographic
assumptions to obtain strong lower bounds on the
ability of Probably Approximately Correct (PAC)
algorithms to learn various concept classes over the
Boolean domain. We show that under realistic
cryptographic assumptions there is no polynomial time
prediction algorithm with membership queries for
Boolean formulas, constant depth threshold circuits,
and many other natural concept classes. Also, we show
that if there exist non-uniform one-way functions, then
membership queries won't help with predicting CNF or
DNF formulas.\par
We investigate cryptographic lower bounds on the
learnability of Boolean formulas, Boolean circuits, and
constant depth threshold circuits on the uniform
distribution and other specific distributions. We first
show that weakly learning these classes on the uniform
distribution is as hard as factoring Blum integers. We
formalize the notion of a trivially learnable
distribution and extend these hardness results to all
non-trivial distributions. Furthermore, we show that a
sub-exponential lower bound for factoring implies a
lower bound for learning constant depth Boolean
circuits on the uniform distribution which is almost
tight.\par
We also show that a realistic assumption not rooted in
number theory, namely the intractability of solving the
subset sum problem of certain dimensions, can be used
to show that Boolean circuits of low depth are not
learnable on the uniform and other specific
distributions. We observe that, under cryptographic
assumptions, all our bounds can be used to establish
tradeoffs between the running time and the number of
samples necessary to learn.",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Gupta:1993:IPA,
author = "Ashish Gupta and Inderpal Singh Mumick",
title = "Improvement to the {PF} Algorithm",
type = "Technical Report",
number = "STAN-CS-93-1473",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
month = may,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Gunawardena:1993:MMF,
author = "Jeremy Gunawardena",
title = "Min-Max Functions",
type = "Technical Report",
number = "STAN-CS-93-1474",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Pieper:1993:PCI,
author = "Karen Pieper",
title = "Parallelizing Compilers: Implementation and
Effectiveness",
type = "Technical Report",
number = "STAN-CS-93-1475",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "151",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Goldberg:1993:TFE,
author = "Andrew Goldberg and Alexander Karzanov",
title = "Transitive Fork Environments and Minimum Cost Flows",
type = "Technical Report",
number = "STAN-CS-93-1476",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Choi:1993:CTR,
author = "Wonyun Choi",
title = "Contingency-Tolerant Robot Motion Planning and
Control",
type = "Technical Report",
number = "STAN-CS-93-1477",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Wilson:1993:THA,
author = "Randall Wilson and Lydia Kavraki and Tomas
Lozano-Perez and Jean-Claude Latombe",
title = "Two-Handed Assembly Sequencing",
type = "Technical Report",
number = "STAN-CS-93-1478",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Shekhar:1993:CUF,
author = "Shashank Shekhar",
title = "Control Uncertainty in Fine Motion Planning",
type = "Technical Report",
number = "STAN-CS-93-1479",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "110",
month = jun,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Cherkassky:1993:SPA,
author = "Boris Cherkassky and Andrew Goldberg and Tomas
Radzik",
title = "Shortest Paths Algorithms: Theory and Experimental
Evaluation",
type = "Technical Report",
number = "STAN-CS-93-1480",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = jul,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1993:ECS,
author = "Andrew V. Goldberg and Robert Kennedy",
title = "Efficient Cost Scaling Algorithm for the Assignment
Problem",
type = "Technical Report",
number = "STAN-CS-93-1481",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "24",
month = jul,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Levy:1993:IRK,
author = "Alon Levy",
title = "Irrelevance Reasoning in Knowledge Based Systems",
type = "Technical Report",
number = "STAN-CS-93-1482",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "201",
month = jul,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Avrahami:1993:IAC,
author = "Gideon Avrahami",
title = "Identification and Analysis of Curves in Digital
Images",
type = "Technical Report",
number = "STAN-CS-93-1483",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = "????",
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Phillips:1993:TAO,
author = "Steven J. Phillips",
title = "Theory and Applications of Online Algorithms",
type = "Technical Report",
number = "STAN-CS-93-1484",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "93",
month = aug,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Cheriton:1993:ULC,
author = "David Cheriton and Dale Skeen",
title = "Understanding the Limitations of Causally and Totally
Ordered Communication",
type = "Technical Report",
number = "STAN-CS-93-1485",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
month = aug,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{vanGlabbeek:1993:WBT,
author = "Robert van Glabbeek",
title = "What is Branching Time Semantics and Why To Use It",
type = "Technical Report",
number = "STAN-CS-93-1486",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = aug,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Thomas:1993:PAO,
author = "Sarah Rebecca Thomas",
title = "{PLACA}: An Agent Oriented Programming Language",
type = "Technical Report",
number = "STAN-CS-93-1487",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "157",
month = sep,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Takeda:1993:PMM,
author = "Haruo Takeda and Cladio Facchinetti and Jean-Claude
Latombe",
title = "Planning the Motions of a Mobile Robot in a Sensory
Uncertainty Field",
type = "Technical Report",
number = "STAN-CS-93-1488",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "42",
month = sep,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Goldberg:1993:PPS,
author = "Andrew V. Goldberg and Alexander V. Karzanov",
title = "Path Problems in Skew-Symmetric Graphs",
type = "Technical Report",
number = "STAN-CS-93-1489",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 31",
month = oct,
year = "1993",
DOI = "https://doi.org/10.1007/BF01261321",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://alexander-karzanov.net/Publications/93_path_probl_skew.pdf",
abstract = "We study path problems in skew-symmetric graphs. These
problems generalize the standard graph reachability and
shortest paths problems. We develop duality theory for
the skew-symmetric problems and use it to design
efficient algorithms for the problems. The algorithms
presented are competitive with the fastest algorithms
for the standard problems.",
acknowledgement = ack-nhfb,
pdfpages = "32",
remark = "Published in \booktitle{Combinatorica} {\bf 16}(3)
353--382, September 1996.",
}
@TechReport{Kavraki:1993:RPC,
author = "Lydia Kavraki and Jean-Claude Latombe",
title = "Randomized Preprocessing of Configuration",
type = "Technical Report",
number = "STAN-CS-93-1490",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = sep,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kao:1993:SDA,
author = "Ben Kao and Hector Garcia-Molina",
title = "Subtask Deadline Assignment for Complex Distributed
Soft Real-Time Tasks",
type = "Technical Report",
number = "STAN-CS-93-1491",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = oct,
year = "1993",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-93-1491.html",
abstract = "Complex distributed tasks often involve parallel
execution of subtasks at different nodes. To meet the
deadline of a global task, all of its parallel subtasks
have to be finished on time. Comparing to a local task
(which involves execution at only one node), a global
task may have a much harder time making its deadline
because it is fairly likely that at least one of its
subtasks run into an overloaded node. Another problem
with complex distributed tasks occurs when a global
task consists of a number of serially executing
subtasks. In this case, we have the problem of dividing
up the end-to-end deadline of the global task and
assigning them to the intermediate subtasks. In this
paper, we study both of these problems. Different
algorithms for assigning deadlines to subtasks are
presented and evaluated.",
acknowledgement = ack-nhfb,
pdfpages = "25",
xxnumber = "CS-TR-93-1491",
}
@TechReport{Jakobsson:1993:TBT,
author = "Hakan Jakobsson",
title = "Tree-Based Techniques for Query Evaluation",
type = "Technical Report",
number = "STAN-CS-93-1492",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "59",
month = oct,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Davis:1993:MSA,
author = "Helen Davis",
title = "Multiprocessor Simulation: Achieving Accuracy,
Efficiency and Flexibility",
type = "Technical Report",
number = "STAN-CS-93-1493",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "175",
month = nov,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Yan:1993:ISI,
author = "Tak W. Yan and Hector Garcia-Molina",
title = "Index Structures for Information Filtering Under the
Vector Space Model",
type = "Technical Report",
number = "STAN-CS-93-1494",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "i + 33",
month = nov,
year = "1993",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-93-1494.html",
abstract = "With the ever increasing volumes of information
generation, users of information systems are facing an
information overload. It is desirable to support
information filtering as a complement to traditional
retrieval mechanism. The number of users, and thus
profiles (representing users' long-term interests),
handled by an information filtering system is
potentially huge, and the system has to process a
constant stream of incoming information in a timely
fashion. The efficiency of the filtering process is
thus an important issue. In this paper, we study what
data structures and algorithms can be used to
efficiently perform large-scale information filtering
under the vector space model, a retrieval model
established as being effective. We apply the idea of
the standard inverted index to index user profiles. We
devise an alternative to the standard inverted index,
in which we, instead of indexing every term in a
profile, select only the significant ones to index. We
evaluate their performance and show that the indexing
methods require orders of magnitude fewer I/Os to
process a document than when no index is used. We also
show that the proposed alternative performs better in
terms of I/O and CPU processing time in many cases.",
acknowledgement = ack-nhfb,
pdfpages = "34",
xxnumber = "CS-TR-93-1494",
}
@TechReport{Baralis:1993:UDR,
author = "Elena Baralis and Jennifer Widom",
title = "Using Delta Relations to Optimize Condition Evaluation
In Active Databases",
type = "Technical Report",
number = "STAN-CS-93-1495",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "25",
month = nov,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Hayes-Roth:1993:AAI,
author = "Barbara Hayes-Roth",
title = "An Architecture for Adaptive Intelligent Systems",
type = "Technical Report",
number = "STAN-CS-93-1496",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "51",
month = dec,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
}
@TechReport{Kutter:1993:OMB,
author = "Robert A. Kutter",
title = "Optimizing Memory-Based Messaging for Scalable
Shared-Memory Multiprocessor",
type = "Technical Report",
number = "STAN-CS-93-1497",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "82",
month = dec,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Ash:1993:DUA,
author = "David Ash",
title = "Diagnosis Using Action-Based Hierarchies for Optimal
Real-Time Performance",
type = "Technical Report",
number = "STAN-CS-93-1498",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "150",
month = dec,
year = "1993",
bibdate = "Wed Nov 26 12:13:45 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Knuth:1993:ST,
author = "Donald E. Knuth",
title = "The {Sandwich Theorem}",
type = "Technical Report",
number = "STAN-CS-93-1499",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "ii + 49",
day = "6",
month = dec,
year = "1993",
bibdate = "Fri Apr 18 05:25:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://i.stanford.edu/pub/cstr/reports/cs/tr/93/1499/CS-TR-93-1499.pdf;
http://www-db.stanford.edu/TR/CS-TR-93-1499.html;
http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail&id=oai%3Ancstrlh%3Astan%3ASTAN%2F%2FCS-TR-93-1499",
abstract = "This report contains expository notes about a function
$ \vartheta (G) $ that is popularly known as the Lovasz
number of a graph $G$. There are many ways to define $
\vartheta (G)$, and the surprising variety of different
characterizations indicates in itself that $ \vartheta
(G)$ should be interesting. But the most interesting
property of $ \vartheta (G)$ is probably the fact that
it can be computed efficiently, although it lies
``sandwiched'' between other classic graph numbers
whose computation is NP-hard. I have tried to make
these notes self-contained so that they might serve as
an elementary introduction to the growing literature on
Lovasz's fascinating function.",
acknowledgement = ack-nhfb,
documentid = "oai:ncstrlh:stan:STAN//CS-TR-93-1499",
pdfpages = "51",
xxnumber = "CS-TR-93-1499",
}
@TechReport{Chang:1993:CVR,
author = "Edward Chang",
title = "Compositional Verification of Reactive and Real-time
Systems",
type = "Technical Report",
number = "STAN-CS-94-1522",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1993",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1522.html",
abstract = "This thesis presents a compositional methodology for
the verification of reactive and real-time systems. The
correctness of a given system is established from the
correctness of the system's components, each of which
may be treated as a system itself and further reduced.
When no further reduction is possible or desirable,
global techniques for verification may be used to
verify the bottom-level components. Transition modules
are introduced as a suitable compositional model of
computation. Various composition operations are defined
on transition modules, including parallel composition,
sequential composition, and iteration. A restricted
assumption-guarantee style of specification is
advocated, wherein the environment assumption is stated
as a restriction on the environment's next-state
relation. Compositional proof rules are provided in
accordance with the safety-progress hierarchy of
temporal properties. The compositional framework is
then extended naturally to real-time transition modules
and discrete-time metric temporal logic.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1522",
}
@TechReport{Siroker:1994:PSS,
author = "Marianne Siroker",
title = "1993 Publications Summary for the {Stanford Database
Group}",
type = "Technical Report",
number = "STAN-CS-94-1500",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1500.html",
abstract = "This Technical Report contains the first page of
papers written by members of the Stanford Database
Group during 1993. Readers interested in the full
papers can fetch electronic copies via FTP.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1500",
}
@TechReport{delVal:1994:DPB,
author = "Alvaro del Val and Yoav Shoham",
title = "Deriving Properties of Belief Update from Theories of
Action",
type = "Technical Report",
number = "STAN-CS-94-1501",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1501.html",
abstract = "We present an approach to database update as a form of
non monotonic temporal reasoning, the main idea of
which is the (circumscriptive) minimization of changes
with respect to a set of facts declared ``persistent by
default.'' The focus of the paper is on the relation
between this approach and the update semantics recently
proposed by Katsuno and Mendelzon. Our contribution in
this regard is twofold: --- We prove a representation
theorem for KM semantics in terms of a restricted
subfamily of the operators defined by our construction.
--- We show how the KM semantics can be generalized by
relaxing our construction in a number of ways, each
justified in certain intuitive circumstances and each
corresponding to one specific postulate. It follows
that there are reasonable update operators outside the
KM family. Our approach is not dependent for its
plausibility on this connection with KM semantics.
Rather, it provides a relatively rich and flexible
framework in which the frame and ramification problems
can be solved in a systematic way by reasoning about
default persistence of facts.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1501",
}
@TechReport{Magerman:1994:NLP,
author = "David M. Magerman",
title = "Natural Language Parsing as Statistical Pattern
Recognition",
type = "Technical Report",
number = "STAN-CS-94-1502",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "161",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1502.html",
abstract = "Traditional natural language parsers are based on
rewrite rule systems developed in an arduous,
time-consuming manner by grammarians. A majority of the
grammarian's efforts are devoted to the disambiguation
process, first hypothesizing rules which dictate
constituent categories and relationships among words in
ambiguous sentences, and then seeking exceptions and
corrections to these rules. In this work, I propose an
automatic method for acquiring a statistical parser
from a set of parsed sentences which takes advantage of
some initial linguistic input, but avoids the pitfalls
of the iterative and seemingly endless grammar
development process. Based on distributionally-derived
and linguistically-based features of language, this
parser acquires a set of statistical decision trees
which assign a probability distribution on the space of
parse trees given the input sentence. By basing the
disambiguation criteria selection on entropy reduction
rather than human intuition, this parser development
method is able to consider more sentences than a human
grammarian can when making individual disambiguation
rules. In experiments, the decision tree parser
significantly outperforms a grammarian's rule-based
parser, achieving an accuracy rate of 78\% compared to
the rule-based parser's 69\%.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1502",
}
@TechReport{Dabija:1994:DWP,
author = "Vlad G. Dabija",
title = "Deciding whether to plan to react",
type = "Technical Report",
number = "STAN-CS-94-1503",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1503.html",
abstract = "Intelligent agents that operate in real-world
real-time environments have limited resources. An agent
must take these limitations into account when deciding
which of two control modes --- planning versus reaction
--- should control its behavior in a given situation.
The main goal of this thesis is to develop a framework
that allows a resource-bounded agent to decide at
planning time which control mode to adopt for
anticipated possible run-time contingencies. Using our
framework, the agent: (a) analyzes a complete
(conditional) plan for achieving a particular goal; (b)
decides which of the anticipated contingencies require
and allow for preparation of reactive responses at
planning time; and (c) enhances the plan with prepared
reactions for critical contingencies, while maintaining
the size of the plan, the planning and response times,
and the use of all other critical resources of the
agent within task-specific limits. For a given
contingency, the decision to plan or react is based on
the characteristics of the contingency, the associated
reactive response, and the situation itself.
Contingencies that may occur in the same situation
compete for reactive response preparation because of
the agent's limited resources. The thesis also proposes
a knowledge representation formalism to facilitate the
acquisition and maintenance of knowledge involved in
this decision process. We also show how the proposed
framework can be adapted for the problem of deciding,
for a given contingency, whether to prepare a special
branch in the conditional plan under development or to
leave the contingency for opportunistic treatment at
execution time. We make a theoretical analysis of the
properties of our framework and then demonstrate them
experimentally. We also show experimentally that this
framework can simulate several different styles of
human reactive behaviors described in the literature
and, therefore, can be useful as a basis for describing
and contrasting such behaviors. Finally we demonstrate
that the framework can be applied in a challenging real
domain. That is: (a) the knowledge and data needed for
the decision making within our framework exist and can
be acquired from experts, and (b) the behavior of an
agent that uses our framework improves according to
response time, reliability and resource utilization
criteria.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1503",
}
@TechReport{Baralis:1994:AAR,
author = "Elena Baralis and Jennifer Widom",
title = "An Algebraic Approach to Rule Analysis in Expert
Database Systems",
type = "Technical Report",
number = "STAN-CS-94-1504",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1504.html",
abstract = "Expert database systems extend the functionality of
conventional database systems by providing a facility
for creating and automatically executing
Condition-Action rules. While Condition-Action rules in
database systems are very powerful, they also can be
very difficult to program, due to the unstructured and
unpredictable nature of rule processing. We provide
methods for static analysis of Condition-Action rules;
our methods determine whether a given rule set is
guaranteed to terminate, and whether rule execution is
confluent (has a guaranteed unique final state). Our
methods are based on previous methods for analyzing
rules in active database systems. We improve
considerably on the previous methods by providing
analysis criteria that are much less conservative: our
methods often determine that a rule set will terminate
or is confluent when previous methods could not. Our
improved analysis is based on a ``propagation''
algorithm, which uses a formal approach based on an
extended relational algebra to accurately determine
when the action of one rule can affect the condition of
another. Our algebraic approach yields methods that are
applicable to a broad class of expert database rule
languages.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1504",
}
@TechReport{Singhal:1994:UPH,
author = "Sandeep K. Singhal and David R. Cheriton",
title = "Using a Position History-Based Protocol for
Distributed Object Visualization",
type = "Technical Report",
number = "STAN-CS-94-1505",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1505.html",
abstract = "Users of distributed virtual reality applications
interact with users located across the network.
Similarly, distributed object visualization systems
store dynamic data at one host and render it in
real-time at other hosts. Because data in both systems
is animated and exhibits unpredictable behavior,
providing up-to-date information about remote objects
is expensive. Remote hosts must instead apply
extrapolation between successive update packets to
render the object's true animated behavior. This paper
describes and analyzes a ``position history-based''
protocol in which hosts apply several recent position
updates to track the position of remote objects. The
history-based approach offers smooth, accurate
visualizations of remote objects while providing a
scalable solution.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1505",
}
@TechReport{Cheriton:1994:OMB,
author = "David R. Cheriton and Robert A. Kutter",
title = "Optimized Memory-Based Messaging: Leveraging the
Memory System for High-Performance Communication",
type = "Technical Report",
number = "STAN-CS-94-1506",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "26",
month = feb,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1506.html",
abstract = "Memory-based messaging, passing messages between
programs using shared memory, is a recognized technique
for efficient communication that takes advantage of
memory system performance. However, the conventional
operating system support for this approach is
inefficient, especially for large-scale multiprocessor
interconnects, and is too complex to effectively
support in hardware. This paper describes hardware and
software optimizations for memory-based messaging that
efficiently exploit the mechanisms of the memory system
to provide superior communication performance. We
describe the overall model of optimized memory-based
messaging, its implementation in an operating system
kernel and hardware support for this approach in a
scalable multiprocessor architecture. The optimizations
include address-valued signals, message-oriented memory
consistency and automatic signaling on write.
Performance evaluations show these extensions provide a
three-to-five-fold improvement in communication
performance over a comparable software-only
implementation.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1506",
}
@TechReport{Mashack:1994:BDC,
author = "Thea Mashack",
title = "Bibliography {Department of Computer Science}
Technical Reports, 1963--1993",
type = "Technical Report",
number = "STAN-CS-94-1507",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1507.html",
abstract = "This report lists, in chronological order, all reports
published by the Stanford Computer Science Department
(CSD) since 1963. Each report is identified by CSD
number, author's name, title, number of pages, and
date. If a given report is available from the
department at the time of this Bibliography's printing,
price is also listed. For convenience, an author index
is included in the back of the text. This report
supersedes all previous editions. Some reports are
noted with a National Technical Information Service
(NTIS) retrieval number (i.e., AD-XXXXXX), if available
from the NTIS. Other reports are noted with Knowledge
Systems Laboratory (KSL) or Computer Systems Laboratory
(CSL) numbers (KSL-XXXX; CSL-TR-XX-XX), and may be
requested from KSL or CSL, respectively.",
acknowledgement = ack-nhfb,
xxabstract = "This Bibliography lists all the reports published by
the Department of Computer Science from 1963 through
1993",
xxnumber = "CS-TR-94-1507",
}
@TechReport{Kondo:1994:IKH,
author = "Koichi Kondo",
title = "Inverse Kinematics of a Human Arm",
type = "Technical Report",
number = "STAN-CS-94-1508",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1508.html",
abstract = "This paper describes a new inverse kinematics
algorithm for a human arm. Potential applications of
this algorithm include computer-aided design and
concurrent engineering from the viewpoint of human
factors. For example, it may be used to evaluate a new
design in terms of its usability and to automatically
generate instruction videos. The inverse kinematics
algorithm is based on a sensorimotor transformation
model developed in recent neurophysiological
experiments. This method can be applied to both static
arm postures and human manipulation motions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1508",
}
@TechReport{Goldberg:1994:GPU,
author = "Andrew V. Goldberg and Robert Kennedy",
title = "Global Price Updates Help",
type = "Technical Report",
number = "STAN-CS-94-1509",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
month = mar,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1509.html",
abstract = "Periodic global updates of dual variables have been
shown to yield a substantial speed advantage in
implementations of push-relabel algorithms for the
maximum flow and minimum cost flow problems. In this
paper, we show that in the context of the bipartite
matching and assignment problems, global updates yield
a theoretical improvement as well. For bipartite
matching, a push-relabel algorithm that matches the
best bound when global updates are used achieves a
bound that is worse by a square root of n factor
without the updates. A similar result holds for the
assignment problem.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1509",
}
@TechReport{Hayes:1994:KOG,
author = "Barry Hayes",
title = "Key Objects in Garbage Collection",
type = "Technical Report",
number = "STAN-CS-94-1510",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1510.html",
abstract = "When the cost of global garbage collection in a system
grows large, the system can be redesigned to use
generational collection. The newly-created objects
usually have a much shorter half-life than average, and
by concentrating the collector's efforts on them a
large fraction of the garbage can be collected at a
tiny fraction of the cost. The objects that survive
generational collection may still become garbage, and
the current practice is to perform occasional global
garbage collections to purge these objects from the
system, and again, the cost of doing these collections
may become prohibitive when the volume of memory
increases. Previous research has noted that the objects
that survive generational collection often are born,
promoted, and collected in large clusters. In this
dissertation I show that carefully selected
semantically or structurally important key objects can
be drawn from the clusters and collected separately;
when a key object becomes unreachable, the collector
can take this as a hint to collect the cluster from
which the key was drawn. To gauge the effectiveness of
key objects, their use was simulated in ParcPlace's
Objectworks\Smalltalk system. The objects selected as
keys were those that, as young objects, had pointers to
them stored into old objects. The collector attempts to
create a cluster for each key by gathering together all
of the objects reachable from that key and >From no
previous key. Using this simple heuristic for key
objects, the collector finds between 41\% and 92\% of
the clustered garbage in a suite of simple test
programs. Except for one program in the suite, about
95\% of the time these key objects direct the collector
to a cluster that is garbage. The exception should be
heeded in improving the heuristics. In a replay of an
interactive session, key object collection finds 59\%
of the clustered garbage and 66\% of suggested targets
are indeed garbage.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1510",
}
@TechReport{Shoham:1994:CLE,
author = "Yoav Shoham and Moshe Tennenholtz",
title = "Co-Learning and the Evolution of Social Activity",
type = "Technical Report",
number = "STAN-CS-94-1511",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "38",
month = apr,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1511.html",
abstract = "We introduce the notion of co-learning, which refers
to a process in which several agents simultaneously try
to adapt to one another's behavior so as to produce
desirable global system properties. Of particular
interest are two specific co-learning settings, which
relate to the emergence of conventions and the
evolution of cooperation in societies, respectively. We
define a basic co-learning rule, called Highest
Cumulative Reward (HCR), and show that it gives rise to
quite nontrivial system dynamics. In general, we are
interested in the eventual convergence of the
co-learning system to desirable states, as well as in
the efficiency with which this convergence is attained.
Our results on eventual convergence are analytic; the
results on efficiency properties include analytic lower
bounds as well as empirical upper bounds derived from
rigorous computer simulations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1511",
}
@TechReport{Washington:1994:APR,
author = "Richard Washington",
title = "Abstraction Planning in Real Time",
type = "Technical Report",
number = "STAN-CS-94-1512",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "130",
month = apr,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1512.html",
abstract = "When a planning agent works in a complex, real-world
domain, it is unable to plan for and store all possible
contingencies and problem situations ahead of time. The
agent needs to be able to fall back on an ability to
construct plans at run time under time constraints.
This thesis presents a method for planning at run time
that incrementally builds up plans at multiple levels
of abstraction. The plans are continually updated by
information from the world, allowing the planner to
adjust its plan to a changing world during the planning
process. All the information is represented over
intervals of time, allowing the planner to reason about
durations, deadlines, and delays within its plan. In
addition to the method, the thesis presents a formal
model of the planning process and uses the model to
investigate planning strategies. The method has been
implemented, and experiments have been run to validate
the overall approach and the theoretical model.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1512",
}
@TechReport{Egar:1994:CND,
author = "John W. Egar",
title = "Construction of Normative Decision Models Using
Abstract Graph Grammars",
type = "Technical Report",
number = "STAN-CS-94-1513",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "247",
month = may,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1513.html",
abstract = "This dissertation addresses automated assistance for
decision analysis in medicine. In particular, I have
investigated graph grammars as a representation for
encoding how decision-theoretic models can be
constructed from an unordered list of concerns. The
modeling system that I have used requires a standard
vocabulary to generate decision models; the models
generated are qualitative, and require subsequent
assessment of probabilities and utility values. This
research has focused on the modeling of the qualitative
structure of problems given a standard vocabulary and
given that subsequent assessment of probabilities and
utilities is possible. The usefulness of the
graph-grammar representation depends on the
graph-grammar formalism's ability to describe a broad
spectrum of qualitative decision models, on its ability
to maintain a high quality in the models it generates,
and on its clarity in describing topological
constraints to researchers who design and maintain the
actual grammar. I have found that graph grammars can be
used to generate automatically decision models that are
comparable to those produced by decision analysts.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1513",
}
@TechReport{Hailperin:1994:LBU,
author = "Max Hailperin",
title = "Load Balancing Using Time Series Analysis for Soft
Real Time Systems with Statistically Periodic Loads",
type = "Technical Report",
number = "STAN-CS-94-1514",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "147",
month = may,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1514.html",
abstract = "This thesis provides design and analysis of techniques
for global load balancing on ensemble architectures
running soft-real-time object-oriented applications
with statistically periodic loads. It focuses on
estimating the instantaneous average load over all the
processing elements. The major contribution is the use
of explicit stochastic process models for both the
loading and the averaging itself. These models are
exploited via statistical time-series analysis and
Bayesian inference to provide improved average load
estimates, and thus to facilitate global load
balancing. This thesis explains the distributed
algorithms used and provides some optimality results.
It also describes the algorithms' implementation and
gives performance results from simulation. These
results show that our techniques allow more accurate
estimation of the global system loading, resulting in
fewer object migrations than local methods. Our method
is shown to provide superior performance, relative not
only to static load-balancing schemes but also to many
adaptive load-balancing methods. Results from a
preliminary analysis of another system and from
simulation with a synthetic load provide some evidence
of more general applicability.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1514",
}
@TechReport{Wolverton:1994:RSD,
author = "Michael Wolverton",
title = "Retrieving Semantically Distant Analogies",
type = "Technical Report",
number = "STAN-CS-94-1515",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1515.html",
abstract = "Techniques that have traditionally been useful for
retrieving same-domain analogies from small single-use
knowledge bases, such as spreading activation and
indexing on selected features, are inadequate for
retrieving cross-domain analogies from large multi-use
knowledge bases. Blind or near-blind search techniques
like spreading activation will be overwhelmed by
combinatorial explosion as the search goes deeper into
the KB. And indexing a large multi-use KB on salient
features is impractical, largely because a feature that
may be useful for retrieval in one task may be useless
for another task. This thesis describes
Knowledge-Directed Spreading Activation (KDSA), a
method for retrieving analogies in a large semantic
network. KDSA uses task-specific knowledge to guide a
spreading activation search to a case or concept in
memory that meets a desired similarity condition. The
thesis also describes a specific instantiation of this
method for the task of innovative design. KDSA has been
validated in two ways. First, a theoretical model of
knowledge base search demonstrates that KDSA is
tractable for retrieving semantically distant analogies
under a wide range of knowledge base configurations.
Second, an implemented system that uses KDSA to find
analogies for innovative design shows that the method
is able to retrieve semantically distant analogies for
a real task. Experiments with that system show trends
as the knowledge base size grows that suggest the
theoretical model's prediction of large knowledge base
tractability is accurate.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1515",
}
@TechReport{Goyal:1994:FRP,
author = "Nita Goyal",
title = "A Framework for Reasoning Precisely with Vague
Concepts",
type = "Technical Report",
number = "STAN-CS-94-1516",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1516.html",
abstract = "Many knowledge-based systems need to represent vague
concepts such as ``old'' and ``tall''. The practical
approach of representing vague concepts as precise
intervals over numbers (e.g., ``old'' as the interval
[70,110]) is well-accepted in Artificial Intelligence.
However, there have been no systematic procedures, but
only ad hoc methods to delimit the boundaries of
intervals representing the vague predicates. A key
observation is that the vague concepts and their
interval boundaries are constrained by the underlying
domain knowledge. Therefore, any systematic approach to
assigning interval boundaries must take the domain
knowledge into account. Hence, in the dissertation, we
present a framework to represent the domain knowledge
and exploit it to reason about the interval boundaries
via a query language. This framework is comprised of a
constraint language to represent logical constraints on
vague concepts, as well as numerical constraints on the
interval boundaries; a query language to request
information about the interval boundaries; and an
algorithm to answer the queries. The algorithm
preprocesses the constraints by extracting the
numerical information from the logical constraints and
combines them with the given numerical constraints. We
have implemented the framework and applied it to
medical domain to illustrate its usefulness.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1516",
}
@TechReport{vanGlabbeek:1994:RGS,
author = "Rob J. van Glabbeek and Scott A. Smolka and Bernhard
Steffen",
title = "Reactive, Generative and Stratified Models of
Probabilistic Processes",
type = "Technical Report",
number = "STAN-CS-94-1517",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "39",
month = jul,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1517.html",
abstract = "We introduce three models of probabilistic processes,
namely, reactive, generative and stratified. These
models are investigated within the context of PCCS, an
extension of Milner's SCCS in which each summand of a
process summation expression is guarded by a
probability and the sum of these probabilities is 1.
For each model we present a structural operational
semantics of PCCS and a notion of bisimulation
equivalence which we prove to be a congruence. We also
show that the models form a hierarchy: the reactive
model is derivable from the generative model by
abstraction from the relative probabilities of
different actions, and the generative model is
derivable from the stratified model by abstraction from
the purely probabilistic branching structure. Moreover
the classical nonprobabilistic model is derivable from
each of these models by abstraction from all
probabilities.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1517",
}
@TechReport{Manna:1994:SST,
author = "Zohar Manna and Anuchit Anuchitanukul and Nikolaj
Bjorner and Anca Browne and Edward Chang and Michael
Colon and Luca de Alfaro and Harish Devarajan and Henny
Sipma and Tomas Uribe",
title = "{STeP}: The {Stanford Temporal Prover}",
type = "Technical Report",
number = "STAN-CS-94-1518",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1518.html",
abstract = "We describe the Stanford Temporal Prover (STeP), a
system being developed to support the computer-aided
formal verification of concurrent and reactive systems
based on temporal specifications. Unlike systems based
on model-checking, STeP is not restricted to
finite-state systems. It combines model checking and
deductive methods to allow the verification of a broad
class of systems, including programs with infinite data
domains, N-process programs, and N-component circuit
designs, for arbitrary N. In short, STeP has been
designed with the objective of combining the
expressiveness of deductive methods with the simplicity
of model checking. The verification process is for the
most part automatic. User interaction occurs mostly at
the highest, most intuitive level, primarily through a
graphical proof language of verification diagrams.
Efficient simplification methods, decision procedures,
and invariant generation techniques are then invoked
automatically to prove resulting first-order
verification conditions with minimal assistance. We
describe the performance of the system when applied to
several examples, including the N-process dining
philosopher's program, Szymanski's N-process mutual
exclusion algorithm, and a distributed N-way arbiter
circuit.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1518",
}
@TechReport{Kavraki:1994:PRP,
author = "Lydia Kavraki and Petr Svestka and Jean-Claude Latombe
and Mark Overmars",
title = "Probabilistic Roadmaps for Path Planning in
High-Dimensional Configuration Spaces",
type = "Technical Report",
number = "STAN-CS-94-1519",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "37",
month = aug,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1519.html",
abstract = "A new motion planning method for robots in static
workspaces is presented. This method proceeds according
to two phases: a learning phase and a query phase. In
the learning phase, a probabilistic roadmap is
constructed and stored as a graph whose nodes
correspond to collision-free configurations and edges
to feasible paths between these configurations. These
paths are computed using a simple and fast local
planner. In the query phase, any given start and goal
configurations of the robot are connected to two nodes
of the roadmap; the roadmap is then searched for a path
joining these two nodes. The method is general and easy
to implement. It can be applied to virtually any type
of holonomic robot. It requires selecting certain
parameters (e.g., the duration of the learning phase)
whose values depend on the considered scenes, that is
the robots and their workspaces. But these values turn
out to be relatively easy to choose. Increased
efficiency can also be achieved by tailoring some
components of the method (e.g., the local planner) to
the considered robots. In this paper the method is
applied to planar articulated robots with many degrees
of freedom. Experimental results show that path
planning can be done in a fraction of a second on a
contemporary workstation (approximately 150 MIPS),
after learning for relatively short periods of time (a
few dozen seconds).",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1519",
}
@TechReport{Holzle:1994:AOS,
author = "Urs Holzle",
title = "Adaptive Optimization for {SELF}: Reconciling High
Performance with Exploratory Programming",
type = "Technical Report",
number = "STAN-CS-94-1520",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1520.html",
abstract = "Crossing abstraction boundaries often incurs a
substantial run-time overhead in the form of frequent
procedure calls. Thus, pervasive use of abstraction,
while desirable from a design standpoint, may lead to
very inefficient programs. Aggressively optimizing
compilers can reduce this overhead but conflict with
interactive programming environments because they
introduce long compilation pauses and often preclude
source-level debugging. Thus, programmers are caught on
the horns of two dilemmas: they have to choose between
abstraction and efficiency, and between responsive
programming environments and efficiency. This
dissertation shows how to reconcile these seemingly
contradictory goals. Four new techniques work together
to achieve this: --- Type feedback achieves high
performance by allowing the compiler to inline message
sends based on information extracted from the runtime
system. --- Adaptive optimization achieves high
responsiveness without sacrificing performance by using
a fast compiler to generate initial code while
automatically recompiling heavily used program parts
with an optimizing compiler. --- Dynamic deoptimization
allows source-level debugging of optimized code by
transparently recreating non-optimized code as needed.
--- Polymorphic inline caching speeds up message
dispatch and, more significantly, collects concrete
type information for the compiler. With better
performance yet good interactive behavior, these
techniques reconcile exploratory programming,
ubiquitous abstraction, and high performance.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1520",
}
@TechReport{Gupta:1994:CSM,
author = "Vineet Gupta",
title = "{Chu} Spaces: a Model for Concurrency",
type = "Technical Report",
number = "STAN-CS-94-1521",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "101",
month = aug,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1521.html",
abstract = "A Chu space is a binary relation between two sets. In
this thesis we show that Chu spaces form a
non-interleaving model of concurrency which extends
event structures while endowing them with an algebraic
structure whose natural logic is linear logic. We
provide several equivalent definitions of Chu spaces,
including two pictorial representations. Chu spaces
represent processes as automata or schedules, and Chu
duality gives a simple way of converting between
schedules and automata. We show that Chu spaces can
represent various concurrency concepts like conflict,
temporal precedence and internal and external choice,
and they distinguish between causing and enabling
events. We present a process algebra for Chu spaces
including the standard combinators like parallel
composition, sequential composition, choice,
interaction, restriction, and show that the various
operational identities between these hold for Chu
spaces. The solution of recursive domain equations is
possible for most of these operations, giving us an
expressive specification and programming language. We
define a history preserving equivalence between Chu
spaces, and show that it preserves the causal structure
of a process.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1521",
}
@TechReport{Cherkassky:1994:IPR,
author = "Boris V. Cherkassky and Andrew V. Goldberg",
title = "On Implementing Push-Relabel Method for the Maximum
Flow Problem",
type = "Technical Report",
number = "STAN-CS-94-1523",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "21",
month = sep,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1523.html",
abstract = "We study efficient implementations of the push-relabel
method for the maximum flow problem. The resulting
codes are faster than the previous codes, and much
faster on some problem families. The speedup is due to
the combination of heuristics used in our
implementation. We also exhibit a family of problems
for which all known methods seem to have almost
quadratic time growth rate.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1523",
}
@TechReport{deAlfaro:1994:CVD,
author = "Luca de Alfaro and Zohar Manna",
title = "Continuous Verification by Discrete Reasoning",
type = "Technical Report",
number = "STAN-CS-94-1524",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "106",
month = sep,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1524.html",
abstract = "Two semantics are commonly used for the behavior of
real-time and hybrid systems: a discrete semantics, in
which the temporal evolution is represented as a
sequence of snapshots describing the state of the
system at certain times, and a continuous semantics, in
which the temporal evolution is represented by a series
of time intervals, and therefore corresponds more
closely to the physical reality. Powerful verification
rules are known for temporal logic formulas based on
the discrete semantics. This paper shows how to
transfer the verification techniques of the discrete
semantics to the continuous one. We show that if a
temporal logic formula has the property of finite
variability, its validity in the discrete semantics
implies its validity in the continuous one. This leads
to a verification method based on three components:
verification rules for the discrete semantics, axioms
about time, and some temporal reasoning to bring the
results together. This approach enables the
verification of properties of real-time and hybrid
systems with respect to the continuous semantics.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1524",
}
@TechReport{Anuchitanukul:1994:DB,
author = "Anuchit Anuchitanukul and Zohar Manna",
title = "Differential {BDDs}",
type = "Technical Report",
number = "STAN-CS-94-1525",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
month = sep,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1525.html",
abstract = "In this paper, we introduce a class of Binary Decision
Diagrams (BDDs) which we call Differential BDDs
(DBDDs), and two transformations over DBDDs, called
Push-up and Delta transformations. In DBDDs and its
derived classes such as Push-up DBDDs or Delta DBDDs,
in addition to the ordinary node-sharing in the normal
Ordered Binary Decision Diagrams (OBDDs), some
isomorphic substructures are collapsed together forming
an even more compact representation of boolean
functions. The elimination of isomorphic substructures
coincides with the repetitive occurrences of the same
or similar small components in many applications of
BDDs such as in the representation of hardware
circuits. The reduction in the number of nodes, from
OBDDs to DBDDs, is potentially exponential while
boolean manipulations on DBDDs remain efficient.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1525",
}
@TechReport{Mohammed:1994:CET,
author = "John Llewelyn Mohammed",
title = "Combining Experiential and Theoretical Knowledge in
the Domain of Semiconductor Manufacturing",
type = "Technical Report",
number = "STAN-CS-94-1526",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "265",
month = sep,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1526.html",
abstract = "Semiconductor Manufacturing is characterized by
complexity and continual, rapid change. These
characteristics reduce the effectiveness of traditional
diagnostic expert systems: the knowledge represented
cannot adapt to changes in the manufacturing plan
because the dependence of the knowledge on the plan is
not explicitly represented. It is impractical to
manually encode all the dependencies in a complex plan.
We address this problem in two ways. First, we employ
model-based techniques to encode theoretical knowledge,
so that symbolic simulation of a new manufacturing plan
can automatically glean diagnostic information. Our
representation is sufficiently detailed to capture the
plan's inherent causal dependencies, yet sufficiently
abstract to make symbolic simulation practical. This
theoretical knowledge can adapt to changes in the
manufacturing plan. However, the expressiveness and
tractability of our representational machinery limit
the range of phenomena that we can represent. Second,
we describe Generic Rules, which combine the
expressiveness of heuristic rules with the robustness
of theoretical models. Generic Rules are general
patterns for heuristic rules, associated with
model-based restrictions on the situations in which the
patterns can be instantiated to form rules for new
contexts. In this way, theoretical knowledge is
employed to encode the dependence of heuristic
knowledge on the manufacturing plan.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1526",
}
@TechReport{Koller:1994:KB,
author = "Daphne Koller",
title = "From Knowledge to Belief",
type = "Technical Report",
number = "STAN-CS-94-1527",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "219",
month = oct,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1527.html",
abstract = "When acting in the real world, an intelligent agent
must make decisions under uncertainty. The standard
solution requires it to assign degrees of belief to the
relevant assertions. These should be based on the
agent's knowledge. For example, a doctor deciding on
the treatment for a patient should use information
about that patient, statistical correlations between
symptoms and diseases, default rules, and more. The
random-worlds method induces degrees of belief from
very rich knowledge bases, expressed in a language that
augments first-order logic with statistical statements
and default rules (interpreted as qualitative
statistics). The method is based on the principle of
indifference, treating all possible worlds as equally
likely. It naturally derives important patterns of
reasoning such as specificity, inheritance,
indifference to irrelevant information, and a default
assumption of independence. Its expressive power and
intuitive semantics allow it to deal well with examples
that are too complex for most other reasoning systems.
We use techniques from finite model theory to analyze
the computational aspects of random worlds. The problem
of computing degrees of belief is undecidable in
general. However, for unary knowledge bases, a tight
connection to the principle of maximum entropy often
allows us to compute degrees of belief.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1527",
}
@TechReport{Koza:1994:AAO,
author = "John R. Koza",
title = "Architecture-Altering Operations for Evolving the
Architecture of a Multi-Part Program in Genetic
Programming",
type = "Technical Report",
number = "STAN-CS-94-1528",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1528.html",
abstract = "Previous work described a way to evolutionarily select
the architecture of a multi-part computer program
>From among preexisting alternatives in the
population while concurrently solving a problem during
a run of genetic programming. This report describes six
new architecture-altering operations that provide a way
to evolve the architecture of a multi-part program in
the sense of actually changing the architecture of
programs dynamically during the run. The new
architecture-altering operations are motivated by the
naturally occurring operation of gene duplication as
described in Susumu Ohno's provocative 1970 book
Evolution by Means of Gene Duplication as well as the
naturally occurring operation of gene deletion. The six
new architecture-altering operations are branch
duplication, argument duplication, branch creation,
argument creation, branch deletion and argument
deletion. A connection is made between genetic
programming and other techniques of automated problem
solving by interpreting the architecture-altering
operations as providing an automated way to specialize
and generalize programs. The report demonstrates that a
hierarchical architecture can be evolved to solve an
illustrative symbolic regression problem using the
architecture- altering operations. Future work will
study the amount of additional computational effort
required to employ the architecture-altering
operations.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1528",
}
@TechReport{Shahar:1994:KBM,
author = "Yuval Shahar",
title = "A knowledge-based method for temporal abstraction of
clinical data",
type = "Technical Report",
number = "STAN-CS-94-1529",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "330",
month = oct,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1529.html",
abstract = "This dissertation describes a domain-independent
method specific to the task of abstracting higher-level
concepts from time-stamped data. The framework includes
a model of time, parameters, events and contexts. I
applied my framework to several domains of medicine. My
goal is to create, from time-stamped patient data,
interval-based temporal abstractions such as ``severe
anemia for 3 weeks in the context of administering AZ
T.'' The knowledge-based temporal-abstraction method
decomposes the task of abstracting higher-level
abstractions from input data into five subtasks. These
subtasks are solved by five domain-independent
temporal-abstraction mechanisms. The
temporal-abstraction mechanisms depend on four
domain-specific knowledge types. I implemented the
knowledge-based temporal-abstraction method in the
RESUME system. RESUME accepts input and returns output
at all levels of abstraction; accepts input out of
temporal order, modifying a view of the past or of the
present, as necessary; generates context-sensitive,
controlled output; and maintains several possible
concurrent interpretations of the data. I evaluated
RESUME in the domains of protocol-based care,
monitoring of children's growth, and therapy of
diabetes. A formal specification of a domain's
temporal-abstraction knowledge supports acquisition,
maintenance, reuse, and sharing of that knowledge.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1529",
}
@TechReport{Koga:1994:CMA,
author = "Yoshihito Koga",
title = "On Computing Multi-Arm Manipulation Trajectories",
type = "Technical Report",
number = "STAN-CS-94-1530",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "143",
month = oct,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1530.html",
abstract = "This dissertation considers the manipulation task
planning problem of automatically generating the
trajectories for several cooperating robot arms to
manipulate a movable object to a goal location among
obstacles. The planner must reason that the robots may
need to change their grasp of the object to complete
the task, for example, by passing it from one arm to
another. Furthermore, the computed velocities and
accelerations of the arms must satisfy the limits of
the actuators. Past work strongly suggests that solving
this problem in a rigorous fashion is intractable. We
address this problem in a practical two-phase approach.
In step one, using a heuristic we compute a
collision-free path for the robots and the movable
object. For the case of multiple robot arms with many
degrees of freedom, this step may fail to find the
desired path even though it exists. Despite this
limitation, experimental results of the implemented
planner (for solving step one) show that it is
efficient and reliable; for example, the planner is
able to find complex manipulation motions for a system
with seventy eight degrees of freedom. In step two, we
then find the time-parameterization of the path such
that the dynamic constraints on the robot are
satisfied. In fact, we find the time-optimal solution
for the given path. We show simulation results for
various complex examples.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1530",
}
@TechReport{Li:1994:LMP,
author = "Tsai-Yen Li and Jean-Claude Latombe",
title = "On-Line Manipulation Planning for Two Robot Arms in a
Dynamic Environment",
type = "Technical Report",
number = "STAN-CS-94-1531",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "34",
month = dec,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1531.html",
abstract = "In a constantly changing and partially unpredictable
environment, robot motion planning must be on-line. The
planner receives a continuous flow of information about
occurring events and generates new plans, while
previously planned motions are being executed. This
paper describes an on-line planner for two cooperating
arms whose task is to grab parts of various types on a
conveyor belt and transfer them to their respective
goals while avoiding collision with obstacles. Parts
arrive on the belt in random order, at any time. Both
goals and obstacles may be dynamically changed. This
scenario is typical of manufacturing cells serving
machine-tools, assembling products, or packaging
objects. The proposed approach breaks the overall
planning problem into subproblems, each involving a
low-dimensional configuration or configuration-time
space, and orchestrates very fast primitives solving
these subproblems. The resulting planner has been
implemented and extensively tested in a simulated
environment, as well as with a real dual-arm system.
Its competitiveness has been evaluated against an
oracle making (almost) the best decision at any one
time; the results show that the planner compares
extremely well.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1531",
}
@TechReport{Banon:1994:PCF,
author = "Jose Banon",
title = "Planning the Collision-Free Paths of an Actively
Flexible Manipulator",
type = "Technical Report",
number = "STAN-CS-94-1532",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
month = dec,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1532.html",
abstract = "Most robot manipulators consist of a small sequence of
rigid links connected by articulated joints. However,
robot dexterity is considerably enhanced when the
number of joints is large or infinite. Additional
joints make it possible to manipulate objects in
cluttered environments where non-redundant robots are
useless. In this paper we consider a simulated actively
flexible manipulator (AFM), i.e. a manipulator whose
flexibility can be directly controlled by its
actuators. We propose an efficient method for planning
the collision-free paths of an AFM in a
three-dimensional workspace. We implemented this method
on a graphic workstation and experimented with it on
several examples.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1532",
}
@TechReport{Raghavan:1994:RQP,
author = "L. Raghavan and J-C. Kavraki and R. Latombe and P.
Motwani",
title = "Randomized Query Processing in Robot Motion Planning",
type = "Technical Report",
number = "STAN-CS-94-1533",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "18",
month = dec,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-94-1533.html",
abstract = "The subject of this paper is the analysis of a
randomized preprocessing scheme that has been used for
query processing in robot motion planning. The
attractiveness of the scheme stems from its general
applicability to virtually any motion-planning problem,
and its empirically observed success. In this paper we
initiate a theoretical basis for explaining this
empirical success. Under a simple assumption about the
configuration space, we show that it is possible to
perform a preprocessing step following which queries
can be answered quickly. En route, we pose and give
solutions to related problems on graph connectivity in
the evasiveness model, and art-gallery theorems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-94-1533",
}
@TechReport{Lazanas:1994:RAU,
author = "Anthony Lazanas",
title = "Reasoning About Uncertainty in Robot Motion Planning",
type = "Technical Report",
number = "STAN-CS-95-1539",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "255",
month = aug,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1539.html",
abstract = "In this thesis, we investigate the effects of
uncertainty on the difficulty of robot motion planning,
and we study the tradeoff between physical and
computational complexity. We present a formulation of
the general robot motion planning with uncertainty
problem, so that a complete, correct, polynomial
planner can be derived. The key idea is the existence
of reduced uncertainty regions in the workspace
(landmark regions). Planning is performed using the
preimage backchaining method. We extend the standard
definition of a ``nondirectional preimage'' to the case
where a motion command depends on an arbitrary number
of control parameters. The resulting multi-dimensional
preimage can be represented with a polynomial number of
2-D slices, each computed for a critical combination of
values of the parameters. We present implemented
algorithms for one parameter (the commanded direction
of motion) and for two parameters (the commanded
direction of motion and the directional uncertainty).
Experimentation with the algorithm using a real mobile
robot has been successful. By engineering the
workspace, we have been able to satisfy all the
assumptions of our planning model. As a result, the
robot has been able to operate for long periods of time
with no failures.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1539",
}
@TechReport{Wong-Toi:1994:SAV,
author = "Howard Wong-Toi",
title = "Symbolic Approximations for Verifying Real-Time
Systems",
type = "Technical Report",
number = "STAN-CS-95-1546",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "207",
month = dec,
year = "1994",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1546.html",
abstract = "Real-time systems are appearing in more and more
applications where their proper operation is critical,
e.g. transport controllers and medical equipment.
However they are extremely difficult to design
correctly. One approach to this problem is the use of
formal description techniques and automatic
verification. Unfortunately automatic verification
suffers from the state-explosion problem even without
considering timing information. This thesis proposes a
state-based approximation scheme as a heuristic for
efficient yet accurate verification. We first describe
a generic iterative approximation algorithm for
checking safety properties of a transition system.
Successively more accurate approximations of the
reachable states are generated until the specification
is provably satisfied or not. The algorithm
automatically decides where the analysis needs to be
more exact, and uses state partitioning to force the
approximations to converge towards a solution. The
method is complete for finite-state systems. The
algorithm is applied to systems with hard real-time
bounds. State approximations are performed over both
timing information and control information. We also
approximate the system's transition structure. Case
studies include some timing properties of the MAC
sublayer of the Ethernet protocol, the tick-tock
service protocol, and a timing-based communication
protocol where the sender's and receiver's clocks
advance at variable rates.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1546",
}
@TechReport{Gupta:1995:PIB,
author = "Ashish Gupta",
title = "Partial Information Based Integrity Constraint
Checking",
type = "Technical Report",
number = "STAN-CS-95-1534",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1534.html",
abstract = "Integrity constraints are useful for specifying
consistent states of a database, especially in
distributed database systems where data may be under
the control of multiple database managers. Constraints
need to be checked when the underlying database is
updated. Integrity constraint checking in a distributed
environment may involve a distributed transaction and
the expenses associated with it: two phase commit
protocols, distributed concurrency control, network
communication costs, and multiple interface layers if
the databases are heterogeneous. The information used
for constraint checking may include the contents of
base relations, constraint specifications, updates to
the databases, schema restrictions, stored aggregates
etc. We propose using only a subset of the information
potentially available for constraint checking. Thus,
only data that is local to a site may be used for
constraint checking thus avoiding distributed
transactions. The approach is useful also in
centralized systems because relatively inexpensively
accessible subsets may be used for constraint checking.
We discuss constraint checking for the following three
subsets of the aforementioned information. 1.
Constraint Subsumption: How to check one constraint C
using a set of other constraint specifications $ \{ C0,
\ldots {}, C n \} $ and no data, and the knowledge that
the constraints in set $ \{ C0, \ldots {}, C n \} $
hold in the database? 2. Irrelevant Updates. How to
check a constraint C using the database update, a set
of other constraints $ \{ C0, \ldots {}, C n \} $, and
the knowledge that the constraints $ \{ C, C0, \ldots
{}, C n \} $ all hold before the update? 3. Local
Checking. How to check a constraint C using the
database update, the contents of the updated relation,
a set of other constraints $ \{ C0, \ldots {}, C n \}
$, and the knowledge that the constraints $ \{ C, C0,
\ldots {}, C n \} $ all hold before the update? Local
checking is the main focus and the main contribution of
this thesis.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1534",
}
@TechReport{Kavraki:1995:RNC,
author = "Lydia E. Kavraki",
title = "Random Networks in Configuration Space for Fast Path
Planning",
type = "Technical Report",
number = "STAN-CS-95-1535",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "150",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1535.html",
abstract = "In the main part of this dissertation we present a new
path planning method which computes collision-free
paths for robots of virtually any type moving among
stationary obstacles. This method proceeds according to
two phases: a preprocessing phase and a query phase. In
the preprocessing phase, a probabilistic network is
constructed and stored as a graph whose nodes
correspond to collision-free configurations and edges
to feasible paths between these configurations. In the
query phase, any given start and goal configurations of
the robot are connected to two nodes of the network;
the network is then searched for a path joining these
two nodes. We apply our method to articulated robots
with many degrees of freedom. Experimental results show
that path planning can be done in a fraction of a
second on a contemporary workstation ($ \approx $ 150
MIPS), after relatively short preprocessing times (a
few dozen to a few hundred seconds). In the second part
of this dissertation, we present a new method that uses
the Fast Fourier Transform to compute the obstacle map
required by certain path planning algorithms. In the
final part of this dissertation, we consider a problem
from assembly planning. In assembly planning we are
interested in generating feasible sequences of motions
that construct a mechanical product from its individual
parts. We prove that the monotone assembly partitioning
problem in the plane is NP-complete.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1535",
}
@TechReport{Yim:1995:LUM,
author = "Mark Yim",
title = "Locomotion With a Unit-Modular Reconfigurable Robot",
type = "Technical Report",
number = "STAN-CS-95-1536",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1536.html",
abstract = "A unit-modular robot is a robot that is composed of
modules that are all identical. Here we study the
design and control of unit-modular dynamically
reconfigurable robots. This is based upon the design
and construction of a robot called Polypod. We further
choose statically stable locomotion as the task domain
to evaluate the design and control strategy. The result
is the creation of many unique locomotion modes. To
gain insight into the capabilities of robots like
Polypod we examine locomotion in general by building a
functional taxonomy of locomotion. We show that Polypod
is capable of generating all classes of statically
stable locomotion, a feature unique to Polypod. Next,
we propose methods to evaluate vehicles under different
operating conditions such as different terrain
conditions. We then evaluate and compare each mode of
locomotion on Polypod. This study leads to interesting
insights into the general characteristics of the
corresponding classes of locomotion. Finally, since
more modules are expected to increase robot capability,
it is important to examine the limit to the number of
modules that can be put together in a useful form. We
answer this question by investigating the issues of
structural stability, actuator strength, computation
and control requirements.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1536",
}
@TechReport{Quinlan:1995:RTM,
author = "Sean Quinlan",
title = "Real-Time Modification of Collision-Free Paths",
type = "Technical Report",
number = "STAN-CS-95-1537",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "144",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1537.html",
abstract = "The modification of collision-free paths is proposed
as the basis for a new framework to close the gap
between global path planning and real-time sensor-based
robot control. A physically-based model of a flexible
string-like object, called an elastic band, is used to
determine the modification of a path. The initial shape
of the elastic is the free path generated by a planner.
Subjected to artificial forces, the elastic band
deforms in real time to a short and smooth path that
maintains clearance from the obstacles. The elastic
continues to deform as changes in the environment are
detected by sensors, enabling the robot to accommodate
uncertainties and react to unexpected and moving
obstacles. While providing a tight connection between
the robot and its environment, the elastic band
preserves the global nature of the planned path. The
greater part of this thesis deals with the design and
implementation of elastic bands, with emphasis on
achieving real-time performance even for robots with
many degrees of freedom. To achieve these goals, we
propose the concept of bubbles of free-space---a region
of free-space around a given configuration of the robot
generated from distance information. We also develop a
novel algorithm for efficiently computing the distance
between non-convex objects and a real-time algorithm
for calculating a discrete approximation to the
time-optimal parameterization of a path. These various
developments are combined in a system that demonstrates
the elastic band framework for a Puma 560
manipulator.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1537",
}
@TechReport{Hammer:1995:PSS,
author = "Joachim Hammer",
title = "1994 Publications Summary of the {Stanford Database
Group}",
type = "Technical Report",
number = "STAN-CS-95-1538",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1538.html",
abstract = "This technical report contains the first four pages of
papers written by members of the Stanford Database
Group during 1994. We believe that the first four pages
convey the main ideas behind each paper better than a
simple title and abstract does.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1538",
}
@TechReport{Murdock:1995:MMI,
author = "Janet L. Murdock",
title = "Model-Matching and Individuation for Model-Based
Diagnosis",
type = "Technical Report",
number = "STAN-CS-95-1540",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1540.html",
abstract = "In model-based systems that reason about the physical
world, models are attached to portions of the physical
system. To make model-based systems more extensible and
re-usable, this thesis explores automating
model-matching. Models address particular individuals,
portions of the physical world identified as separate
entities. If the set of models is not fixed, one cannot
carve the physical system into a fixed set of
individuals. Our goals are to develop methods for
matching and individuating and identify characteristics
of physical equipment and models required by those
methods. Our approach is to identify a set of
characteristics, build a system which used them, and
test re-usability and extensibility. If the system
correctly defines individuals and matches models, even
when models calls for individuals not previously
defined, then we can conclude that we have identified
some subset of the characteristics required. The system
matches models to a series of equipment descriptions,
simulating re-use. We also add a number of models,
extending the system, having it match the new models.
Our investigation shows characteristics required are
the 3-dimensional space and how the space is filled by
functional components, phases, materials, and
parameters.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1540",
}
@TechReport{Karger:1995:RSG,
author = "David R. Karger",
title = "Random Sampling in Graph Optimization Problems",
type = "Technical Report",
number = "STAN-CS-95-1541",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1541.html",
abstract = "The representative random sample is a central concept
of statistics. It is often possible to gather a great
deal of information about a large population by
examining a small sample randomly drawn from it. This
approach has obvious advantages in reducing the
investigator's work, both in gathering and in analyzing
the data. We apply the concept of a representative
sample to combinatorial optimization. Our focus is
optimization problems on undirected graphs. Highlights
of our results include: The first (randomized) linear
time minimum spanning tree algorithm; A (randomized)
minimum cut algorithm with running time roughly $
O(n^2) $ as compared to previous roughly $ O(n^3) $
time bounds, as well as the first algorithm for finding
all approximately minimal cuts and multiway cuts; An
efficient parallelization of the minimum cut algorithm,
providing the first parallel (RNC) algorithm for
minimum cuts; A derandomization finding minimum cut in
NC; Provably accurate approximations to network
reliability; Very fast approximation algorithms for
minimum cuts, s-t minimum cuts, and maximum flows;
Significantly improved polynomial-time approximation
bounds for network design problems; For coloring
3-colorable graphs, improvements in the approximation
bounds from $ O(n^{3 / 8}) $ to $ O(n^{1 / 4}) $; An
analysis of random sampling in Matroids.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1541",
}
@TechReport{Koza:1995:PGP,
author = "John R. Koza and David Andre",
title = "Parallel Genetic Programming on a Network of
Transputers",
type = "Technical Report",
number = "STAN-CS-95-1542",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1542.html",
abstract = "This report describes the parallel implementation of
genetic programming in the C programming language using
a PC 486 type computer (running Windows) acting as a
host and a network of transputers acting as processing
nodes. Using this approach, researchers of genetic
algorithms and genetic programming can acquire
computing power that is intermediate between the power
of currently available workstations and that of
supercomputers at a cost that is intermediate between
the two. A comparison is made of the computational
effort required to solve the problem of symbolic
regression of the Boolean even-5-parity function with
different migration rates. Genetic programming required
the least computational effort with an 8\% migration
rate. Moreover, this computational effort was less than
that required for solving the problem with a serial
computer and a panmictic population of the same size.
That is, apart from the nearly linear speed-up in
executing a fixed amount of code inherent in the
parallel implementation of genetic programming,
parallelization delivered more than linear speed-up in
solving the problem using genetic programming.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1542",
}
@TechReport{Tomasi:1995:SS,
author = "Carlo Tomasi and Roberto Manduchi",
title = "Stereo Without Search",
type = "Technical Report",
number = "STAN-CS-95-1543",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = feb,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1543.html",
abstract = "Search is not inherent in the correspondence problem.
We propose a representation of images, called intrinsic
curves, that combines the ideas of associative storage
of images with connectedness of the representation:
intrinsic curves are the paths that a set of local
image descriptors trace as an image scanline is
traversed from left to right. Curves become surfaces
when full images are considered instead of scanlines.
Because only the path in the space of descriptors is
used for matching, intrinsic curves lose track of
space, and are invariant with respect to disparity
under ideal circumstances. Establishing stereo
correspondences then becomes a trivial lookup problem.
We also show how to use intrinsic curves to match real
images in the presence of noise, brightness bias,
contrast fluctuations, and moderate geometric
distortion, and we show how intrinsic curves can be
used to deal with image ambiguity and occlusions. We
carry out experiments on single-scanline matching to
prove the feasibility of the approach and illustrate
its main features.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1543",
}
@TechReport{Basch:1995:DVB,
author = "Julien Basch and Sanjeev Khanna and Rajeev Motwani",
title = "On Diameter Verification and {Boolean} Matrix
Multiplication",
type = "Technical Report",
number = "STAN-CS-95-1544",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "5",
month = feb,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1544.html",
abstract = "We present a practical algorithm that verifies whether
a graph has diameter 2 in time $ O(n^3 / \log^2 n) $. A
slight adaptation of this algorithm yields a boolean
matrix multiplication algorithm which runs in the same
time bound; thereby allowing us to compute transitive
closure and verification of the diameter of a graph for
any constant $d$ in $ O(n^3 / \log^2 n)$ time.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1544",
}
@TechReport{Khanna:1995:AAL,
author = "Sanjeev Khanna and Rajeev Motwani and Frances F. Yao",
title = "Approximation Algorithms for the Largest Common
Subtree Problem",
type = "Technical Report",
number = "STAN-CS-95-1545",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
month = feb,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1545.html",
abstract = "The largest common subtree problem is to find a
largest subtree which occurs as a common subgraph in a
given collection of trees. We show that in case of
bounded degree trees, we can achieve an approximation
ratio of $ O((n* \log \log n) / \log^2 n) $. In case of
unbounded degree nodes, we give an algorithm with
approximation ratio $ O((n*(\log \log n)^2) / \log^2 n)
$ when the trees are unlabeled. An approximation ratio
of $ O((n*(\log \log n)^2) / \log^2 n) $ is also
achieved for the case of labeled unbounded degree trees
provided the number of distinct labels is $
O(\log^{O(1)} n) $.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1545",
}
@TechReport{Roy:1995:SRP,
author = "H. Scott Roy",
title = "Sharp, Reliable Predictions using Supervised Mixture
Models",
type = "Technical Report",
number = "STAN-CS-95-1547",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1547.html",
abstract = "This dissertation develops a new way to make
probabilistic predictions from a database of examples.
The method looks for regions in the data where
different predictions are appropriate, and it naturally
extends clustering algorithms that have been used with
great success in exploratory data analysis. In
probabilistic terms, the new method looks at the same
models as before, but it only evaluates them for the
conditional probability they assign to a single feature
rather than the joint probability they assign to all
features. A good models is therefore forced to classify
the data in a way that is useful for a single, desired
prediction, rather than just identifying the strongest
overall pattern in the data. The results of this
dissertation extend the clean, Bayesian approach of the
unsupervised AutoClass system to the supervised
learning problems common in everyday practice.
Highlights include clear probabilistic semantics,
prediction and use of discrete, categorical, and
continuous data, priors that avoid the overfitting
problem, an explicit noise model to identify unreliable
predictions, and the ability to handle missing data. A
computer implementation, MultiClass, validates the
ideas with performance that exceeds neural nets,
decision trees, and other current supervised machine
learning systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1547",
}
@TechReport{Gawlick:1995:RAC,
author = "Rainer Gawlick and Anil Kamath and Serge Plotkin and
K. G. Ramakrishnan",
title = "Routing and Admission Control in General Topology
Networks",
type = "Technical Report",
number = "STAN-CS-95-1548",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "19",
month = may,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1548.html",
abstract = "Emerging high speed Broadband Integrated Services
Digital Networks (B-ISDN) will carry traffic for
services such as video-on-demand and video
teleconferencing -- that require resource reservation
along the path on which the traffic is sent. As a
result, such networks will need effective {\em
admission control} algorithms. The simplest approach is
to use greedy admission control; in other words, accept
every resource request that can be physically
accommodated. However, in the context of symmetric loss
networks (networks with a complete graph topology),
non-greedy admission control has been shown to be more
effective than greedy admission control. This paper
suggests a new {\em non-greedy} routing and admission
control algorithm for {\em general topology} networks.
In contrast to previous algorithms, our algorithm does
not require advance knowledge of the traffic patterns.
Our algorithm combines key ideas from a recently
developed theoretical algorithm with a stochastic
analysis developed in the context of reservation-based
algorithms. We evaluate the performance of our
algorithm using extensive simulations on an existing
commercial network topology and on variants of that
topology. The simulations show that our algorithm
outperforms greedy admission control over a broad range
of network environments. The simulations also
illuminate some important characteristics of our
algorithm. For example, we characterize the importance
of the implicit routing effects of the admission
control part of our algorithm.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1548",
}
@TechReport{Rutledge:1995:DSM,
author = "Geoffrey William Rutledge",
title = "Dynamic Selection of Models",
type = "Technical Report",
number = "STAN-CS-95-1549",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "188",
month = mar,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1549.html",
abstract = "This dissertation develops an approach to high-stakes,
model-based decision making under scarce computation
resources, bringing together concepts and techniques
from the disciplines of decision analysis, statistics,
artificial intelligence, and simulation. A method is
developed and implemented to solve a time-critical
decision problem in the domain of critical-care
medicine. This method selects models that balance the
prediction accuracy and the need for rapid action.
Under a computation-time constraint, the optimal model
for a model-based control application is a model that
maximizes the tradeoff of model benefit (a measure of
how accurately the model predicts the effects of
alternative control settings) and model cost (a measure
of the length of the model-induced computation delay).
This work describes a real-time algorithm that selects,
from a graph of models (GoM), a model that is accurate
and that is computable within a time constraint. The
DSM algorithm is a metalevel reasoning strategy that
relies on a dynamic-selection-of-models (DSM) metric to
guide the search through a GoM that is organized
according to the simplifying assumptions of the models.
The DSM metric balances an estimate of the probability
that a model will achieve the required prediction
accuracy and the cost of the expected model-induced
computation delay. The DSM algorithm provides an
approach to automated reasoning about complex systems
that applies at any level of computation-resource or
computation-time constraint. The DSM algorithm is
implemented in Konan, a program that performs dynamic
selection of patient-specific models from a GoM of
quantitative physiologic models. Konan selects models
that allow a model-based control application (a
ventilator-management advisor) to make real-time
decisions for the control settings of a mechanical
ventilator.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1549",
}
@TechReport{Drakopoulos:1995:TDH,
author = "John A. Drakopoulos",
title = "Theory and Design of a Hybrid Pattern Recognition
System",
type = "Technical Report",
number = "STAN-CS-95-1550",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "109",
month = may,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1550.html",
abstract = "Pattern recognition methods can be divided into four
different categories: statistical or probabilistic,
structural, possibilistic or fuzzy, and neural methods.
A formal analysis shows that there is a computational
complexity versus representational power trade-off
between probabilistic and possibilistic or fuzzy set
measures, in general. Furthermore, sigmoidal theory
shows that fuzzy set membership can be represented
effectively by sigmoidal functions. Those results and
the formalization of sigmoidal functions and
subsequently multi-sigmoidal functions and neural
networks led to the development of a hybrid pattern
recognition system called tFPR. tFPR is a hybrid fuzzy,
neural, and structural pattern recognition system that
uses fuzzy sets to represent multi-variate pattern
classes that can be either static or dynamic depending
on time or some other parameter space. The membership
functions of the fuzzy sets that represent pattern
classes are modeled in three different ways. Simple
sigmoidal configurations are used for simple patterns,
a structural pattern recognition method is used for
dynamic patterns, and multi-sigmoidal neural networks
are used for pattern classes for which is difficult to
obtain a formal definition. Although efficiency is a
very important consideration in tFPR, the main issues
are knowledge acquisition and knowledge representation
(in terms of pattern class descriptions).",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1550",
}
@TechReport{McGuire:1995:TMC,
author = "Hugh W. McGuire",
title = "Two Methods for Checking Formulas of Temporal Logic",
type = "Technical Report",
number = "STAN-CS-95-1551",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "145",
month = jun,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1551.html",
abstract = "This dissertation presents two methods for determining
satisfiability or validity of formulas of Discrete
Metric Annotated Linear Temporal Logic. This logic is
convenient for representing and verifying properties of
reactive and concurrent systems, including software and
electronic circuits. The first method presented here is
an algorithm for automatically deciding whether any
given propositional temporal formula is satisfiable.
This new algorithm efficiently extends the classical
`semantic tableau'-algorithm to formulas with temporal
operators which refer to the past or are metric. Then,
whereas classical proofs of correctness for such
algorithms are existential, the proof here is
constructive; it shows that for any given formula being
checked, any model of the formula is embedded in the
tableau. The second method presented in this
dissertation is a deduction-calculus for determining
the validity of predicate temporal formulas. This new
deduction-calculus employs a refined, conservative
version of classical approaches involving translation
from temporal forms to first-order expressions with
time reified. Here, quantifications are elided, and
addition is used instead of classical complicated
combinations of comparisons. This scheme facilitates
integration of powerful techniques such as
associative-commutative unification and a Presburger
decision-algorithm.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1551",
}
@TechReport{Brafman:1995:ETR,
author = "Ronen I. Brafman and Moshe Tennenholtz",
title = "Embedded Teaching of Reinforcement Learners",
type = "Technical Report",
number = "STAN-CS-95-1552",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1552.html",
abstract = "Knowledge plays an important role in an agent's
ability to perform well in its environment. Teaching
can be used to improve an agent's performance by
enhancing its knowledge. We propose a specific model of
teaching, which we call embedded teaching. An embedded
teacher is an agent situated with a less knowledgeable
``student'' in a common environment. The teacher's goal
is to lead the student to adopt a particular desired
behavior. The teacher's ability to teach is affected by
the dynamics of the common environment and may be
limited by a restricted repertoire of actions or
uncertainty about the outcome of actions; we explicitly
represent these limitations as part of our model. In
this paper, we address a number of theoretical issues
including the characterization of a challenging
embedded teaching domain and the computation of optimal
teaching policies. We then incorporate these ideas in a
series of experiments designed to evaluate our ability
to teach two types of reinforcement learners.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1552",
}
@TechReport{Srinivas:1995:MTA,
author = "Sampath Srinivas",
title = "Modeling techniques and algorithms for probabilistic
model-based diagnosis and repair",
type = "Technical Report",
number = "STAN-CS-95-1553",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1553.html",
abstract = "Model-based diagnosis centers on the use of a
behavioral model of a system to infer diagnoses of
anomalous behavior. For model-based diagnosis
techniques to become practical, some serious problems
in the modeling of uncertainty and in the tractability
of uncertainty management have to be addressed. These
questions include: How can we tractably generate
diagnoses in large systems? Where do the prior
probabilities of component failure come from when
modeling a system? How do we tractably compute low-cost
repair strategies? How can we do diagnosis even if only
partial descriptions of device operation are available?
This dissertation seeks to bring model-based diagnosis
closer to being a viable technology by addressing these
problems. We develop a set of tractable algorithms and
modeling techniques that address each of the problems
introduced above. Our approach synthesizes the
techniques used in model-based diagnosis and techniques
from the field of Bayesian networks.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1553",
}
@TechReport{Lasher:1995:CST,
author = "Rebecca Lasher and Vicky Reich and Greg Anderson",
title = "The {Computer Science Technical Report (CS-TR)
Project}: Considerations from the Library Perspective",
type = "Technical Report",
number = "STAN-CS-95-1554",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
month = jul,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1554.html",
abstract = "In 1992 the Advanced Research Projects Agency (ARPA)
funded a three year grant to investigate the questions
related to large-scale, distributed, digital libraries.
The award focused research on Computer Science
Technical Reports (CS-TR) and was granted to the
Corporation for National Research Initiatives (CNRI)
and five research universities. The ensuing
collaborative research has focused on a broad spectrum
of technical, social, and legal issues, and has
encompassed all aspects of a very large, heterogeneous
distributed digital library environment: acquisition,
storage, organization, search, retrieval, display, use
and intellectual property. The initial corpus of this
digital library is a coherent digital collection of
CS-TRs created at the five participating universities:
Carnegie Mellon, Cornell, MIT, Stanford, and the
University of California at Berkeley. The Corporation
for National Research Initiatives serves as a
collaborator and agent for the project. This technical
report summarizes the accomplishments and collaborative
efforts of the CS-TR project from a librarian's
perspective; to do this we address the following
questions: 1. Why do librarians and computer scientists
make good research partners? 2. What has been learned?
3. What new questions have been articulated? 4. How can
the accomplishments be moved into a service
environment? 5. What actions and activities might
follow from this effort?",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1554",
}
@TechReport{Kiriha:1995:RTD,
author = "Yoshiaki Kiriha",
title = "Real-time Database Experiences in Network Management
Application",
type = "Technical Report",
number = "STAN-CS-95-1555",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1555.html",
abstract = "This report discusses our experiences with real-time
databases in the context of a network management
system, in particular a MIB (Management Information
Base) implementation. We propose an active and
real-time MIB (ART-MIB) architecture that utilizes a
real-time database system. The ART-MIB contains a
variety of modules, such as transaction manager, task
manager, and resource manager. Among the
functionalities provided by ART-MIB, we focus on
transaction scheduling within a memory based real-time
database system. For the developed ART-MIB prototype,
we have evaluated two typical real-time transaction
scheduling algorithms: earliest deadline first (EDF)
and highest value first (HVF). The main results of our
performance comparison show that EDF outperforms HVF
under a low load; however, HVF outperforms EDF in an
overload situation. Furthermore, the fact that the
performance crossover point closely depends on the
magnitude of the scheduler queue, has been validated.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1555",
}
@TechReport{Kennedy:1995:SUW,
author = "J. Robert {Kennedy, Jr.}",
title = "Solving Unweighted and Weighted Bipartite Matching
Problems in Theory and Practice",
type = "Technical Report",
number = "STAN-CS-95-1556",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1556.html",
abstract = "The push-relabel method has been shown to be efficient
for solving maximum flow and minimum cost flow problems
in practice, and periodic global updates of dual
variables have played an important role in the best
implementations. Nevertheless, global updates had not
been known to yield any theoretical improvement in
running time. In this work, we study techniques for
implementing push-relabel algorithms to solve bipartite
matching and assignment problems. We show that global
updates yield a theoretical improvement in the
bipartite matching and assignment contexts, and we
develop a suite of efficient cost-scaling push-relabel
implementations to solve assignment problems. For
bipartite matching, we show that a push-relabel
algorithm using global updates matches the best time
bound known (roughly the number of edges times the
square root of the number of nodes --- better for dense
graphs) and performs worse by a factor of the square
root of the number of nodes without the updates. We
present a similar result for the assignment problem,
for which an algorithm that assumes integer costs has
running time asymptotically dominated by the number of
edges times the number of nodes times a scaling factor
logarithmic in the number of nodes and the largest
magnitude of an edge cost in the problem. The bound we
obtain matches the best cost-scaling bound known. We
develop cost-scaling push-relabel implementations that
take advantage of the assignment problem's special
structure, and compare our codes against the best codes
from the literature. The results show that the
push-relabel method is very promising for practical
use.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1556",
}
@TechReport{Wolf:1995:HMS,
author = "Elizabeth Susan Wolf",
title = "Hierarchical Models of Synchronous Circuits for Formal
Verification and Substitution",
type = "Technical Report",
number = "STAN-CS-95-1557",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "210",
month = oct,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1557.html",
abstract = "We develop a mathematical model of synchronous
sequential circuits that supports both formal
hierarchical verification and substitution. We have
implemented and proved the correctness of automatic
decision procedures for both of these applications
using these models. For hierarchical verification, we
model synchronous circuit specifications and
implementations uniformly. Each of these descriptions
provides both a behavioral and a structural view of the
circuit or specification being modeled. We compare the
behavior of a circuit model to a requirements
specification in order to determine whether the circuit
is an acceptable implementation of the specification.
Our structural view of a circuit provides the
capability to plug in one circuit component in place of
another. We derive a requirements specification for the
acceptable replacement components, in terms of the
desired behavior of the full circuit. We also support
nondeterministic specifications, which capture the
minimum requirements of a circuit. Previous formalisms
have relied on syntactic methods for distinguishing
apparent from actual unlatched feedback loops in
hierarchical hardware designs. However, these methods
are not applicable to nondeterministic models. Our
model of the behavior of a synchronous circuit within a
single clock cycle provides a semantic method to
identify cyclic dependencies even in the presence of
nondeterminism.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1557",
}
@TechReport{Greenwald:1995:DAF,
author = "Michael B. Greenwald and Sandeep K. Singhal and
Jonathan R. Stone and David R. Cheriton",
title = "Designing an Academic Firewall: Policy, Practice and
Experience With {SURF}",
type = "Technical Report",
number = "STAN-CS-95-1558",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1558.html",
abstract = "Corporate network firewalls are well-understood and
are becoming commonplace. These firewalls establish a
security perimeter that aims to block (or heavily
restrict) both incoming and outgoing network
communication. We argue that these firewalls are
neither effective nor appropriate for academic or
corporate research environments needing to maintain
information security while still supporting the free
exchange of ideas. In this paper, we present the
Stanford University Research Firewall (SURF), a network
firewall design that is suitable for a research
environment. While still protecting information and
computing resources behind the firewall, this firewall
is less restrictive of outward information flow than
the traditional model; can be easily deployed; and can
give internal users the illusion of unrestricted
e-mail, anonymous FTP, and WWW connectivity to the
greater Internet. Our experience demonstrates that an
adequate firewall for a research environment can be
constructed for minimal cost using off-the-shelf
software and hardware components.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1558",
}
@TechReport{Kavraki:1995:NEP,
author = "Lydia E. Kavraki",
title = "On the number of equilibrium placements of mass
distributions in elliptic potential fields",
type = "Technical Report",
number = "STAN-CS-95-1559",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1559.html",
abstract = "Recent papers have demonstrated the use of force
fields for mechanical part orientation. The force field
is realized on a plane on which the part is placed. The
forces exerted on the part's contact surface translate
and rotate the part to an equilibrium orientation. Part
manipulation by force fields is very attractive since
it requires no sensing. We describe force fields that
result from elliptic potentials and induce only 2
stable equilibrium orientations for most parts. The
proposed fields represent a considerable improvement
over previously developed force fields which produced
O(n) equilibria for polygonal parts with n vertices.
The successful realization of these force fields could
significantly affect part manipulation in industrial
automation.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1559",
}
@TechReport{Kohavi:1995:WPE,
author = "Ron Kohavi",
title = "Wrappers for Performance Enhancements and Oblivious
Decision Graphs",
type = "Technical Report",
number = "STAN-CS-95-1560",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1560.html",
abstract = "In this doctoral dissertation, we study three basic
problems in machine learning and two new hypothesis
spaces with corresponding learning algorithms. The
problems we investigate are: accuracy estimation,
feature subset selection, and parameter tuning. The
latter two problems are related and are studied under
the wrapper approach. The hypothesis spaces we
investigate are: decision tables with a default
majority rule (DTMs) and oblivious read-once decision
graphs (OODGs). For accuracy estimation, we investigate
cross-validation and the 0.632 bootstrap. We show
examples where they fail and conduct a large scale
study comparing them. We conclude that repeated runs of
five-fold cross-validation give a good tradeoff between
bias and variance for the problem of model selection
used in later chapters. We define the wrapper approach
and use it for feature subset selection and parameter
tuning. We relate definitions of feature relevancy to
the set of optimal features, which is defined with
respect to both a concept and an induction algorithm.
The wrapper approach requires a search space,
operators, a search engine, and an evaluation function.
We investigate all of them in detail and introduce
compound operators for feature subset selection.
Finally, we abstract the search problem into search
with probabilistic estimates. We introduce decision
tables with a default majority rule (DTMs) to test the
conjecture that feature subset selection is a very
powerful bias. The accuracy of induced DTMs is
surprisingly powerful, and we concluded that this bias
is extremely important for many real-world datasets. We
show that the resulting decision tables are very small
and can be succinctly displayed. We study properties of
oblivious read-once decision graphs (OODGs) and show
that they do not suffer from some inherent limitations
of decision trees. We describe a general framework for
constructing OODGs bottom-up and specialize it using
the wrapper approach. We show that the graphs produced
are use less features than C4.5, the state-of-the-art
decision tree induction algorithm, and are usually
easier for humans to comprehend.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1560",
}
@TechReport{Hu:1995:TEF,
author = "Alan John Hu",
title = "Techniques for Efficient Formal Verification Using
Binary Decision Diagrams",
type = "Technical Report",
number = "STAN-CS-95-1561",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1561.html",
abstract = "The appeal of automatic formal verification is that
it's automatic -- minimal human labor and expertise
should be needed to get useful results and
counterexamples. BDD(binary decision diagram)-based
approaches have promised to allow automatic
verification of complex, real systems. For large
classes of problems, however, (including many
distributed protocols, multiprocessor systems, and
network architectures) this promise has yet to be
fulfilled. Indeed, the few successes have required
extensive time and effort from sophisticated
researchers in the field. This thesis identifies
several common obstacles to BDD-based automatic formal
verification and proposes techniques to overcome them
by avoiding building certain problematic BDDs needed in
the standard approaches and by exploiting automatically
generated and user-supplied don't-care information.
Several examples illustrate the effectiveness of the
new techniques in enlarging the envelope of problems
that can routinely be verified automatically.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1561",
}
@TechReport{Bjorner:1995:SST,
author = "Nikolaj Bjorner and Anca Browne and Eddie Chang and
Michael Colon and Arjun Kapur and Zohar Manna and Henny
B. Sipma and Tomas E. Uribe",
title = "{STeP}: The {Stanford Temporal Prover} (Educational
Release) User's Manual",
type = "Technical Report",
number = "STAN-CS-95-1562",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "46",
month = nov,
year = "1995",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-95-1562.html",
abstract = "The STeP (Stanford Temporal Prover) system supports
the computer-aided verification of reactive and
real-time systems. It combines deductive methods with
algorithmic techniques to allow the verification of a
broad class of systems, including infinite-state
systems and parameterized N-process programs. STeP
provides the visual language of verification diagrams
that allow the user to construct proofs hierarchically,
starting from a high-level proof sketch. The
availability of automatically generated bottom-up and
top-down invariants and an integrated suite of decision
procedures allow most verification conditions to be
checked without user intervention.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-95-1562",
}
@TechReport{Silberschatz:1996:DRA,
author = "Avi Silberschatz and Michael Stonebraker and Jeffrey
D. Ullman",
title = "Database Research: Achievements and Opportunities into
the 21st Century",
type = "Technical Report",
number = "STAN-CS-96-1563",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1563.html",
abstract = "In May, 1995 an NSF workshop on the future of database
management systems research was convened. This paper
reports the conclusions of that meeting. Among the most
important directions for future DBMS research
recommended by the panel are: support for multimedia
objects; managing distributed and loosely coupled
information, as on the world-wide web; supporting new
database applications such as data mining and
warehousing; workflow and other complex
transaction-management problems, and enhancing the
ease-of-use of DBMS's for both users and system
managers.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1563",
}
@TechReport{Ohno-Machado:1996:MAN,
author = "Lucila Ohno-Machado",
title = "Medical Applications of Neural Networks: Connectionist
Models of Survival",
type = "Technical Report",
number = "STAN-CS-96-1564",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1564.html",
abstract = "Although neural networks have been applied to medical
problems in recent years, their applicability has been
limited for a variety of reasons. One of those barriers
has been the problem of recognizing rare categories. In
this dissertation, I demonstrate, and prove the utility
of, a new method for tackling this problem. In
particular, I have developed a method that allows the
recognition of rare categories with high sensitivity
and specificity, and will show that it is practical and
robust. This method involves the construction of
sequential neural networks. Rare categories occur and
must be learned if practical application of
neural-network technology is to be achieved. Survival
analysis is one area in which this problem appears. In
this work, I test the hypotheses that (1) sequential
systems of neural networks produce results that are
more accurate (in terms of calibration and resolution)
than nonsequential neural networks; and (2) in certain
circumstances, sequential neural networks produce more
accurate estimates of survival time than Cox
proportional hazards and logistic regression models. I
use two sets of data to test the hypotheses: (1) a data
set of HIV+ patients; and (2) a data set of patients
followed prospectively for the development of cardiac
conditions. I show that a neural network model can
predict death due to AIDS more accurately than a Cox
proportional hazards model. Furthermore, I show that a
sequential neural network model is more accurate than a
standard neural network model. I show that the
predictions of logistic regression and neural networks
are not significantly different, but that any of these
models used sequentially is more accurate than its
standard counterpart.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1564",
}
@TechReport{Sujansky:1996:FMB,
author = "Walter Sujansky",
title = "A Formal Model for Bridging Heterogeneous Relational
Databases in Clinical Medicine",
type = "Technical Report",
number = "STAN-CS-96-1565",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1565.html",
abstract = "This document describes the results of my thesis
research, which focused on developing a standard query
interface to heterogeneous clinical databases. The
high-level goal of this work was to *insulate* the
developers of clinical computer applications from the
implementation details of clinical databases, thereby
facilitating the *sharing* of clinical computer
applications across institutions with different
database implementations. Most clinical databases store
information about patients' diagnoses, laboratory
results, medication orders, drug allergies, and
demographic background. These data are valuable as the
inputs to computer applications that provide real-time
decision support, monitor the quality of care, and
analyze data for research purposes. Clinical databases
at different institutions, however, vary significantly
in the way the databases model, represent, and retrieve
clinical data. This database heterogeneity makes it
impossible for a single computer application to
retrieve data from the clinical databases of various
institutions because the database queries included in
the application must be formulated differently for each
institution. Therefore, database heterogeneity makes it
difficult to share computer applications across
institutions with different database implementations.
In my work, I have developed an *abstract* model of
clinical data and an *abstract* query language that
allow the developers of computer applications to
formulate queries independently of the
institution-specific features of clinical databases. I
have also developed a database mapping language and a
formal query-translation method that automatically
translate the abstract queries that appear in
applications into equivalent institution-specific
queries. This framework ostensibly allows copies of a
single computer application to be distributed to
multiple institutions and to be customized
automatically at each of the institutions such that the
queries in each copy of the application can retrieve
data from the local clinical database. This
dissertation formally describes the abstract data
model, the abstract query language, the mapping
language, and the translation algorithm. It also
presents the results of a formal evaluation that I
performed to assess the feasibility and utility of this
approach for sharing clinical computer applications.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1565",
}
@TechReport{Manna:1996:CTS,
author = "Zohar Manna and Amir Pnueli",
title = "Clocked Transition Systems",
type = "Technical Report",
number = "STAN-CS-96-1566",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1566.html",
abstract = "This paper presents a new computational model for
real-time systems, called the clocked transition system
model. The model is a development of our previous timed
transition model, where some of the changes are
inspired by the model of timed automata. The new model
leads to a simpler style of temporal specification and
verification, requiring no extension of the temporal
language. For verifying safety properties, we present a
run-preserving reduction from the new real-time model
to the untimed model of fair transition systems. This
reduction allows the (re)use of safety verification
methods and tools, developed for untimed reactive
systems, for proving safety properties of real-time
systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1566",
}
@TechReport{Anuchitanukul:1996:SRP,
author = "Anuchit Anuchitanukul",
title = "Synthesis of Reactive Programs",
type = "Technical Report",
number = "STAN-CS-96-1567",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1567.html",
abstract = "We study various problems of synthesizing reactive
programs. A reactive program is a program whose
behaviors are not merely functional relationships
between inputs and outputs, but sequences of actions as
well as interactions between the program and its
environment. The goal of program synthesis in general
is to find an implementation of a program such that the
behaviors of the implementation satisfy a given
specification. The reactive behaviors that we study are
omega-regular infinite sequences and regular finite
sequences. The domain of the implementation is (finite)
transition systems for closed system synthesis, and
transition system modules for open system synthesis. We
consider various solutions, e.g. basic, maximal,
modular and exact, for any particular subclasses of the
implementation language and investigate how
characteristics of the program such as fairness, number
of processes and composition operations, affect the
synthesis algorithm. In addition to the
automata-theoretic algorithms, we give a synthesis
algorithm which synthesizes a program directly from the
linear-time temporal logic ETL.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1567",
}
@TechReport{Cazals:1996:ACI,
author = "Frederic Cazals and G. D. S. Ramkumar",
title = "Algorithms for computing intersection and union of
toleranced polygons with applications",
type = "Technical Report",
number = "STAN-CS-96-1568",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1568.html",
abstract = "Since mechanical operations are performed only up to a
certain precision, the geometry of parts involved in
real life products is never known precisely.
Nevertheless, operations on toleranced objects have not
been studied extensively. In this paper, we initiate a
study of the analysis of the union and intersection of
toleranced simple polygons. We provide a practical and
efficient algorithm that stores in an implicit data
structure the information necessary to answer a request
for specific values of the tolerances without
performing a computation from scratch. If the polygons
are of sizes $m$ and $n$, and $s$ is the number of
intersections between edges occurring for all the
combinations of tolerance values, the pre-processed
data structure takes $ O(s)$ space and the algorithm
that computes a union/intersection from it takes $ O((n
+ m) \log (s) + k' + k \log (k))$ time where $k$ is the
number of vertices of the union/intersection and $ k
\leq k' \leq s$. Although the algorithm is not output
sensitive, we show that the expectations of $k$ and $
k'$ remain within a constant factor tau, a function of
the input geometry. Finally, we list interesting
applications of the algorithms related to feasibility
of assembly and assembly sequencing of real
assemblies.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1568",
}
@TechReport{Unruh:1996:UAA,
author = "Amy Unruh",
title = "Using Automatic Abstraction for Problem-Solving and
Learning",
type = "Technical Report",
number = "STAN-CS-96-1569",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1569.html",
abstract = "Abstraction is a powerful tool for controlling search
combinatorics. This research presents a framework for
automatic abstraction planning, and a family of
associated abstraction methods, called SPATULA. The
framework provides a structure within which different
parameterized methods for automatic abstraction can be
instantiated to generate abstraction planning behavior,
and provides an integrated environment for abstract
problem-solving and learning. A core idea underlying
the abstraction techniques is that abstraction can
arise as an obviation response to impasses in planning.
Abstraction is performed at problem-solving time with
respect to impasses in the current problem context, and
thus the planner generates abstractions in response to
specific situations. This approach is used to reduce
the cost of lookahead evaluation searches, by
performing abstract search in problem spaces which are
automatically abstracted from the ground spaces during
search. New search control rules are learned during
abstract search; they constitute an abstract plan used
in future situations, and produce an emergent
multi-level abstraction behavior. The abstraction
method has been implemented and evaluated. It has been
shown to: reduce planning time, while still yielding
good solutions; reduce learning time; and increase the
effectiveness of learned rules by enabling them to
transfer more widely.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1569",
}
@TechReport{Hasan:1996:OSQ,
author = "Waqar Hasan",
title = "Optimization of {SQL} Queries for Parallel Machines",
type = "Technical Report",
number = "STAN-CS-96-1570",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1570.html",
abstract = "Parallel execution offers a method for reducing the
response time of queries against large databases. We
address the problem of parallel query optimization:
Given a declarative SQL query, find a procedural
parallel plan that delivers the query result in minimal
time. We develop optimization algorithms using models
that incorporate both sources and obstacles to speedup.
We address independent, pipelined and partitioned
parallelism. We incorporate inherent constraints on
available parallelism and the extra cost of parallel
execution. Our models are motivated by experiments with
NonStop SQL, a commercial parallel DBMS. We adopt a
two-phase approach to parallel query optimization: JOQR
(join ordering and query rewrite), followed by
parallelization. JOQR minimizes total work. Then,
parallelization spreads work among processors to
minimize response time. For JOQR, we model
communication costs and abstract physical
characteristics of data as colors. We devise tree
coloring and reordering algorithms that are efficient
and optimal. We model parallelization as scheduling a
tree whose nodes represent operators and edges
represent parallel/precedence constraints.
Computation/communication costs are represented as
node/edge weights. We prove worst-case bounds on the
performance ratios of our algorithms and measure
average cases using simulation. Our results enable the
construction of SQL compilers that effectively exploit
parallel machines.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1570",
}
@TechReport{DeAlfaro:1996:FVP,
author = "Luca DeAlfaro",
title = "Formal Verification of Performance and Reliability of
Real-Time Systems",
type = "Technical Report",
number = "STAN-CS-96-1571",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1571.html",
abstract = "In this paper we propose a methodology for the
specification and verification of performance and
reliability properties of real-time systems within the
framework of temporal logic. The methodology is based
on the system model of stochastic real-time systems
(SRTSs), and on branching-time temporal logics that are
extensions of the probabilistic logics pCTL and pCTL*.
SRTSs are discrete-time transition systems that can
model both probabilistic and nondeterministic behavior.
The specification language extends the branching-time
logics pCTL and pCTL* by introducing an operator to
express bounds on the average time between events. We
present model-checking algorithms for the algorithmic
verification of system specifications, and we discuss
their complexity.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1571",
}
@TechReport{Geddis:1996:CNH,
author = "Donald F. Geddis",
title = "Caching and Non-{Horn} Inference in Model Elimination
Theorem Provers",
type = "Technical Report",
number = "STAN-CS-96-1572",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1572.html",
abstract = "Caching in an inference procedure holds the promise of
replacing exponential search with constant-time lookup,
at a cost of slightly-increased overhead for each node
expansion. Caching will be useful if subgoals are
repeated often enough during proofs. In experiments on
solving queries using a backward chainer on Horn
theories, caching appears to be very helpful on
average. When trying to extend this success to
first-order theories, however, intuition suggests that
subgoal caches are no longer useful. The cause is that
complete first-order backward chaining requires
goal-goal resolutions in addition to resolutions with
the database, and this introduces a context-sensitivity
into the proofs for a subgoal. A cache is only feasible
if the solutions are independent of context, so that
they may be copied from one part of the space to
another. It is shown here that a full exploration of a
subgoal in one context actually provides complete
information about the solutions to the same subgoal in
all other contexts of the proof. In a straightforward
way, individual solutions from one context may be
copied over directly. More importantly, non-Horn
failure caching is also feasible, so no additional
solutions in the new context (that might affect the
query) are possible and therefore there is no need to
re-explore the space in the new context. Thus most Horn
clause caching schemes may be used with minimal changes
in a non-Horn setting. In addition, a new Horn clause
caching scheme is proposed: postponement caching. This
new scheme involves exploring the inference space as a
graph instead of as a tree, so that a given literal
will only occur once in the proof space. Despite the
previous extension of failure caching to non-Horn
theories, postponement caching is incomplete in the
non-Horn case. A counterexample is presented, and
possible enhancements to reclaim completeness are
investigated.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1572",
}
@TechReport{Birchfield:1996:DDP,
author = "Stan Birchfield and Carlo Tomasi",
title = "Depth Discontinuities by Pixel-To-Pixel Stereo",
type = "Technical Report",
number = "STAN-CS-96-1573",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1573.html",
abstract = "This report describes a two-pass binocular stereo
algorithm that is specifically geared towards the
detection of depth discontinuities. In the first pass,
introduced in part I of the report, stereo matching is
performed independently on each epipolar pair for
maximum efficiency. In the second pass, described in
part II, disparity information is propagated between
the scanlines. Part I. Our stereo algorithm explicitly
matches the pixels in the two images, leaving occluded
pixels unpaired. Matching is based upon intensity alone
without utilizing windows. Since the algorithm prefers
piecewise constant disparity maps, it sacrifices depth
accuracy for the sake of crisp boundaries, leading to
precise localization of the depth discontinuities.
Three features of the algorithm are worth noting: (1)
unlike most stereo algorithms, it does not require
texture throughout the images, making it useful in
unmodified indoor settings, (2) it uses a measure of
pixel dissimilarity that is provably insensitive to
sampling, and (3) it prunes bad nodes during the
search, resulting in a running time that is faster than
that of standard dynamic programming. Part II. After
the scanlines are processed independently, the
disparity map is postprocessed, leading to more
accurate disparities and depth discontinuities. Both
the algorithm and the postprocessor are fast, producing
a dense disparity map in about 1.5 microseconds per
pixel per disparity on a workstation. Results on five
stereo pairs are given.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1573",
}
@TechReport{Singhal:1996:ERM,
author = "Sandeep K. Singhal",
title = "Effective Remote Modeling in Large-Scale Distributed
Simulation and Visualization Environments",
type = "Technical Report",
number = "STAN-CS-96-1574",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1574.html",
abstract = "A Distributed Interactive Simulation provides the
illusion of a single, coherent virtual world to a group
of users located at different machines connected by a
network. Networked virtual environments are used for
multiplayer video games, military and industrial
training, and collaborative engineering. Network
bandwidth, network latency, and host processing power
limit the achievable size and detail of future
simulations. This thesis describes network protocols
and algorithms to support ``remote modeling,'' allowing
a host to model and render remote entities in
large-scale distributed simulations. These techniques
require fewer network resources and support more entity
types than previous approaches. The Position
History-Based Dead Reckoning (PHBDR) protocol provides
accurate remote position modeling and minimizes
dependencies on network performance and entity
representation. PHBDR is a foundation for three
protocols which model entity orientation, entity
structural change, and entity groups. This thesis shows
that a simple, efficient protocol can provide smooth,
accurate remote position modeling and that it can be
applied recursively to support entity orientation,
structure, and aggregation at multiple levels of
detail; these protocols offer performance and costs
that are competitive with more complex and
application-specific approaches, while providing
simpler analyses of behavior by exploiting this
recursive structure.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1574",
}
@TechReport{Kamath:1996:RAC,
author = "Anil Kamath and Omri Palmon and Serge Plotkin",
title = "Routing and Admission Control in General Topology
Networks with {Poisson} Arrivals",
type = "Technical Report",
number = "STAN-CS-96-1575",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1575.html",
abstract = "Emerging high speed networks will carry traffic for
services such as video-on-demand and video
teleconferencing -- that require resource reservation
along the path on which the traffic is sent. High
bandwidth-delay product of these networks prevents
circuit rerouting, i.e. once a circuit is routed on a
certain path, the bandwidth taken by this circuit
remains unavailable for the duration (holding time) of
this circuit. As a result, such networks will need
effective routing and admission control strategies.
Recently developed online routing and admission control
strategies have logarithmic competitive ratios with
respect to the admission ratio (the fraction of
admitted circuits). Such guarantees on performance are
rather weak in the most interesting case where the
rejection ratio of the optimum algorithm is very small
or even 0. Unfortunately, these guarantees can not be
improved in the context of the considered models,
making it impossible to use these models to identify
algorithms that are going to perform well in practice.
In this paper we develop routing and admission control
strategies for a more realistic model, where the
requests for virtual circuits between any two points
arrive according to a Poisson process and where the
circuit holding times are exponentially distributed.
Our model is close to the one that was developed to
analyse and tune the (currently used) strategies for
managing traffic in long-distance telephone networks.
We strengthen this model by assuming that the rates of
the Poisson processes (the ``traffic matrix'') are
unknown to the algorithm and are chosen by the
adversary. Our strategy is competitive with respect to
the expected rejection ratio. More precisely, it
achieves expected rejection ratio of at most R+epsilon,
where R is the optimum expected rejection ratio. The
expectations are taken over the distribution of the
request sequences, and $ \epsilon = \sqrt {(r \log n)}
$, where $r$ is the maximum fraction of an edge
bandwidth that can be requested by a single circuit.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1575",
}
@TechReport{Huyn:1996:QRU,
author = "Nam Huyn",
title = "Query Reformulation under Incomplete Mappings",
type = "Technical Report",
number = "STAN-CS-96-1576",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1576.html",
abstract = "This paper focuses on some of the important new
translatability issues that arise in the problem of
interoperation between two database schemas when
mappings between these schemas are inherently more
complex than traditional views or pure Datalog programs
can capture. In many cases, sources cannot be
redesigned, and mappings among them exhibit some form
of incompleteness under which the question of whether a
query can be translated across different schemas is not
immediately obvious. The notion of query we consider
here is the traditional one, in which the answers to a
query are required to be definite: answers cannot be
disjunctive or conditional and must refer only to
domain constants. In this paper, mappings are modeled
by Horn programs that allow existential variables, and
queries are modeled by pure Datalog programs. We then
consider the problem of eliminating functional terms
from the answers to a Horn query where function symbols
are allowed. We identify a class of Horn queries called
``term-bounded'' that are equivalent to pure Datalog
queries. We present an algorithm that rewrites a
term-bounded query into an ``equivalent'' pure Datalog
query. Equivalence is defined here as yielding the same
function-free answer.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1576",
}
@TechReport{Huyn:1996:MAU,
author = "Nam Huyn",
title = "A More Aggressive Use Of Views To Extract
Information",
type = "Technical Report",
number = "STAN-CS-96-1577",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1577.html",
abstract = "Much recent work has focussed on using views to
evaluate queries. More specifically, queries are
rewritten to refer to views instead of the base
relations over which the queries were originally
written. The motivation is that the views represent the
only ways in which some information source may be
accessed. Another use of views that has been overlooked
becomes important especially when no equivalent
rewriting of a query in terms of views is possible:
even though we cannot use the views to get all the
answers to the query, we can still use them to deduce
as many answers as possible. In many global information
applications, the notion of equivalence used is often
too restrictive. We propose a notion of
pseudo-equivalence that allows more queries to be
rewritten usefully: we show that if a query has an
equivalent rewriting, the query also has a
pseudo-equivalent rewriting. The converse is not true
in general. In particular, when the views are
conjunctive, we show that all Datalog queries over the
source do have a pseudo-equivalent Datalog query over
the views. We reduce the problem of finding
pseudo-equivalent queries to that of rewriting Horn
queries with Skolem functions as Datalog queries. We
present an algorithm for the class of term-bounded Horn
queries. We discuss extending the problem to larger
classes of Horn queries, other non-Horn queries that
result from ``inverting'' Datalog views and adding
functional dependencies. The theory and methods
developed in our work have important uses in query
mediation between heterogeneous sources, automatic join
discovery and view updates.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1577",
}
@TechReport{Ip:1996:SRM,
author = "C. Norris Ip",
title = "State Reduction Methods for Automatic Formal
Verification",
type = "Technical Report",
number = "STAN-CS-96-1578",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1996",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-96-1578.html",
abstract = "Validation of industrial designs is becoming more
challenging as technology advances. One of the most
suitable debugging aids is automatic formal
verification. This thesis presents several techniques
for reducing the state explosion problem, that is,
reducing the number of states that are examined. A
major contribution of this thesis is the design of
simple extensions to the Murphi description language,
which enable us to convert two existing abstraction
strategies into two fully automatic algorithms, making
these strategies easy to use and safe to apply. These
two algorithms rely on two facts about high-level
designs: they frequently exhibit structural symmetry,
and their behavior is often independent of the exact
number of replicated components they contain. Another
contribution is the design of a new state reduction
algorithm, which relies on reversible rules
(transitions that do not lose information) in a system
description. This new reduction algorithm can be used
simultaneously with the other two algorithms. These
techniques, implemented in the Murphi verification
system, have been applied to many applications, such as
cache coherence protocols and distributed algorithms.
In the cases of two important classes of infinite
systems, infinite state graphs can be automatically
converted to small finite state graphs.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-96-1578",
}
@TechReport{Tajnai:1997:VHD,
author = "Carolyn Tajnai",
title = "From the {Valley of Heart's Delight} to {Silicon
Valley}: a Study of {Stanford University}'s Role in the
Transformation",
type = "Technical Report",
number = "STAN-CS-97-1579",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1579.html",
abstract = "This study examines the role of Stanford University in
the transformation from the Valley of Heart's Delight
to the Silicon Valley. At the dawn of the Twentieth
Century, California's Santa Clara County was an
agricultural paradise. Because of the benign climate
and thousands of acres of fruit orchards, the area
became known as the Valley of Heart's Delight. In the
early 1890's, Leland and Jane Stanford donated land in
the valley to build a university in memory of their
son. Thus, Leland Stanford, Jr., University was
founded. In the early 1930's, there were almost no jobs
for young Stanford engineering graduates. This was
about to change. Although there was no organized plan
to help develop the economic base of the area around
Stanford University, the concern about the lack of job
opportunities for their graduates motivated Stanford
faculty to begin the chain of events that led to the
birth of Silicon Valley. Stanford University's role in
the transformation of the Valley of Heart's Delight
into Silicon Valley is history, but it is enduring
history. Stanford continues to effect the local economy
by spawning new and creative ideas, dreams, and
ambitions.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1579",
}
@TechReport{Gravano:1997:SSP,
author = "Luis Gravano and Kevin Chang and Hector Garcia-Molina
and Andreas Paepcke",
title = "{STARTS}: {Stanford Protocol Proposal for Internet
Retrieval and Search}",
type = "Technical Report",
number = "STAN-CS-97-1580",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1580.html",
abstract = "Document databases are available everywhere, both
within the internal networks of the organizations and
on the Internet. The database contents are often
``hidden'' behind search interfaces. These interfaces
vary from database to database. Also, the algorithms
with which the associated search engines rank the
documents in the query results are usually incompatible
across databases. Even individual organizations use
search engines from different vendors to index their
internal document collections. These organizations
could benefit from unified query interfaces to multiple
search engines, for example, that would give users the
illusion of a single big document database. Building
such ``metasearchers'' is nowadays a hard task because
different search engines are largely incompatible and
do not allow for interoperability. To improve this
situation, the Digital Library project at Stanford has
coordinated among search-engine vendors and other key
players to reach informal agreements for unifying basic
interactions in these three areas. This is the final
writeup of our informal ``standards'' effort. This
draft is based on feedback from people from Excite,
Fulcrum, GILS, Harvest, Hewlett-Packard Laboratories,
Infoseek, Microsoft Network, Netscape, PLS, Verity, and
WAIS, among others.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1580",
}
@TechReport{Paepcke:1997:TID,
author = "Andreas Paepcke and Steve B. Cousins and Hector
Garcia-Molina and Scott W. Hassan and Steven K.
Ketchpel and Martin Roscheisen and Terry Winograd",
title = "Towards Interoperability in Digital Libraries:
Overview and Selected Highlights of the {Stanford
Digital Library Project}",
type = "Technical Report",
number = "STAN-CS-97-1581",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1581.html",
abstract = "We outline the scope of the Stanford Digital Library
Project which covers five areas: user interface work,
technologies for locating information and library
services, the emerging economic perspective of digital
libraries, infrastructure technology and the use of
agent technologies to support all of these aspects. We
describe technical details for two specific efforts
that have been realized in prototype implementations.
First, we describe how we employ distributed object
technology to move towards an implementation of our
InfoBus vision. The InfoBus consists of translation
services and wrappers around existing protocols to cope
with the problem of interoperability and the
distributed nature of emerging digital library
services. We model autonomous, heterogeneous library
services as CORBA proxy objects. This allows the
construction of unified but extensible method-based
interfaces for client programs to interact through. We
describe how distributed objects enable the design of
communication protocols that leave implementors a large
degree of freedom. This is a benefit because the
resulting implementations can allow users to choose
among multiple performance profile tradeoffs while
staying within the confines of the protocol. The second
effort we cover describes InterPay which uses the
object approach for an architecture that helps manage
heterogeneity in payment mechanisms among autonomous
services. The architecture is organized into three
layers. The top layer contains elements involved in the
task-level interaction with the services. The middle
layer is responsible for enforcing user-specified
payment policies. The lowest layer manages the
mechanics of diverse online payment schemes.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1581",
}
@TechReport{Roscheisen:1997:SWA,
author = "Martin Roscheisen and Christian Mogensen and Terry
Winograd",
title = "Shared Web Annotations as a Platform for Third-Party
Value-Added, Information Providers: Architecture,
Protocols, and Usage Examples",
type = "Technical Report",
number = "STAN-CS-97-1582",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1582.html",
abstract = "In this paper, we present an architecture, called
``ComMentor'', which provides a platform for
third-party providers of lightweight super-structures
to material provided by conventional content providers.
It enables people to share structured in-place
annotations about arbitrary on-line documents. The
system is part of a general ``virtual document''
architecture (''PCD BRIO'') in which--with the help of
lightweight distributed meta information--documents are
dynamically synthesized from distributed sources
depending on the user context and the meta-information
which has been attached to them. The meta-information
is managed independently of the documents themselves on
separate meta-information servers, both in terms of
storage and authority. A wide range of useful scenarios
can be readily realized on this platform. We give
examples of how a more personalized content
presentation can be achieved by leveraging the database
storage of the uniform meta-information and generating
documents dynamically for a particular user
perspective. These include structured discussion about
paper drafts, collaborative filtering, seals of
approval, tours, shared ``hotlists'' with section-based
visibility control, usage indicators, co-presence, and
value-added trails. Our object model and request
interface for the prototype implementation are defined
in technical detail in the appendix.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1582",
}
@TechReport{Chang:1997:BQM,
author = "Kevin Chen-Chuan Chang and Hector Garcia-Molina and
Andreas Paepcke",
title = "{Boolean} Query Mapping Across Heterogeneous
Information Sources (Extended Version)",
type = "Technical Report",
number = "STAN-CS-97-1583",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1583.html",
abstract = "Searching over heterogeneous information sources is
difficult because of the non-uniform query languages.
Our approach is to allow a user to compose Boolean
queries in one rich front-end language. For each user
query and target source, we transform the user query
into a subsuming query that can be supported by the
source but that may return extra documents. The results
are then processed by a filter query to yield the
correct final result. In this paper we introduce the
architecture and associated algorithms for generating
the supported subsuming queries and filters. We show
that generated subsuming queries return a minimal
number of documents; we also discuss how minimal cost
filters can be obtained. We have implemented prototype
versions of these algorithms and demonstrated them on
heterogeneous Boolean systems.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1583",
}
@TechReport{Kamiya:1997:GSP,
author = "Kenichi Kamiya and Martin Roscheisen and Terry
Winograd",
title = "{Grassroots}: a System Providing a Uniform Framework
for Communicating, Structuring, Sharing Information,
and Organizing People",
type = "Technical Report",
number = "STAN-CS-97-1584",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1584.html",
abstract = "People keep pieces of information in diverse
collections such as folders, hotlists, e-mail inboxes,
newsgroups, and mailing lists. These collections
mediate various types of collaborations including
communicating, structuring, sharing information, and
organizing people. Grassroots is a system that provides
a uniform framework to support people's collaborative
activities mediated by collections of information. The
system seamlessly integrates functionalities currently
found in such disparate systems as e-mail, newsgroups,
shared hotlists, hierarchical indexes, hypermail, etc.
Grassroots co-exists with these systems in that its
users benefit from the uniform image provided by
Grassroots, but other people can continue using other
mechanisms, and Grassroots leverages from them. The
current Grassroots prototype is based on an http-proxy
implementation, and can be used with any Web browser.
In the context of the design of a next-generation
version of the Web, Grassroots demonstrates the utility
of a uniform notification infrastructure.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1584",
}
@TechReport{Baldonado:1997:TTM,
author = "Michelle Q. Wang Baldonado and Terry Winograd",
title = "Techniques and Tools for Making Sense out of
Heterogeneous Search Service Results",
type = "Technical Report",
number = "STAN-CS-97-1585",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jan,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1585.html",
abstract = "We describe a set of techniques that allows users to
interact with results at a higher level than the
citation level, even when those results come from a
variety of heterogeneous on-line search services. We
believe that interactive result analysis allows users
to ``make sense'' out of the potentially many results
that may match the constraints they have supplied to
the search services. The inspiration for this approach
comes from reference librarians, who do not respond to
patrons' questions with lists of citations, but rather
give high-level answers that are tailored to the
patrons' needs. We outline here the details of the
methods we employ in order to meet our goal of allowing
for dynamic, user-directed abstraction over result
sets, as well as the prototype tool (SenseMaker) we
have built based upon these techniques. We also take a
brief look at the more general theory that underlies
the tool, and hypothesize that it is applicable to
flexible duplicate detection as well.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1585",
}
@TechReport{Pichumani:1997:CTD,
author = "Ramani Pichumani",
title = "Construction of a Three-dimensional Geometric Model
for Segmentation and Visualization of Cervical Spine
Images",
type = "Technical Report",
number = "STAN-CS-97-1586",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1586.html",
abstract = "This report introduces a new technique for
automatically extracting vertebral segments from
three-dimensional computerized tomography (CT) and
magnetic resonance (MR) images of the human cervical
spine. An important motivation for this work is to
provide accurate information for registration and for
fusion of CT and MR images into a composite
three-dimensional image. One of the major hurdles in
performing image fusion is the difficulty of extracting
and matching corresponding anatomical regions in an
accurate, robust, and timely manner. The complementary
properties of soft and bony tissues revealed in CT and
MR imaging modalities makes it challenging to extract
corresponding regions that can be correlated in an
accurate and robust manner. Ambiguities in the images
due to noise, distortion, limited resolution, and
patient-specific structural variations also create
additional challenges. Whereas fusion of CT and MR
images of the cranium have already been performed, no
one has yet developed an automated technique for fusing
multimodality images of the spine. Unlike the head,
which is relatively rigid, the spine is a complex,
articulating object and is subject to structural
deformation throughout the multimodal scanning
process.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1586",
}
@TechReport{Matan:1997:ESC,
author = "Ofer Matan",
title = "Ensembles for Supervised Classification Learning",
type = "Technical Report",
number = "STAN-CS-97-1587",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1587.html",
abstract = "This dissertation studies the use of multiple
classifiers (ensembles or committees) in learning
tasks. Both theoretical and practical aspects of
combining classifiers are studied. First we analyze the
representational ability of voting ensembles. A voting
ensemble may perform either better or worse than each
of its individual members. We give tight upper and
lower bounds on the classification performance of a
voting ensemble as a function of the classification
performances of its individual members. Boosting is a
method of combining multiple ``weak'' classifiers to
form a ``strong'' classifier. Several issues concerning
boosting are studied in this thesis. We study SBA, a
hierarchical boosting algorithm proposed by Schapire,
in terms of its representation and its search. We
present a rejection boosting algorithm that trades-off
exploration and exploitation: It requires fewer pattern
labels at the expense of lower boosting ability.
Ensembles may be useful in gaining information. We
study their use to minimize labeling costs of data and
to enable improvements on performance over time. For
that purpose a model for on-site learning is presented.
The system learns by querying ``hard'' patterns while
classifying ``easy'' ones.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1587",
}
@TechReport{Cohen:1997:SBE,
author = "Scott Cohen and Carlo Tomasi",
title = "Systems of Bilinear Equations",
type = "Technical Report",
number = "STAN-CS-97-1588",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1588.html",
abstract = "How hard is it to solve a system of bilinear
equations? No solutions are presented in this report,
but the problem is posed and some preliminary remarks
are made. In particular, solving a system of bilinear
equations is reduced by a suitable transformation of
its columns to solving a homogeneous system of bilinear
equations. In turn, the latter has a nontrivial
solution if and only if there exist two invertible
matrices that, when applied to the tensor of the
coefficients of the system, zero its first column.
Matlab code is given to manipulate three-dimensional
tensors, including a procedure that finds one solution
to a bilinear system often, but not always.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1588",
}
@TechReport{Benson:1997:LAM,
author = "Scott Sherwood Benson",
title = "Learning Action Models for Reactive Autonomous
Agents",
type = "Technical Report",
number = "STAN-CS-97-1589",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1589.html",
abstract = "To be maximally effective, autonomous agents such as
robots must be able both to react appropriately in
dynamic environments and to plan new courses of action
in novel situations. Reliable planning requires
accurate models of the effects of actions---models
which are often more appropriately learned through
experience than designed. This thesis describes TRAIL
(Teleo-Reactive Agent with Inductive Learning), an
integrated agent architecture which learns models of
actions based on experiences in the environment. These
action models are then used to create plans that
combine both goal-directed and reactive behaviors.
Previous work on action-model learning has focused on
domains that contain only deterministic, atomic action
models that explicitly describe all changes that can
occur in the environment. The thesis extends this
previous work to cover domains that contain durative
actions, continuous variables, nondeterministic action
effects, and actions taken by other agents. Results
have been demonstrated in several robot simulation
environments and the Silicon Graphics, Inc. flight
simulator. The main emphasis in this thesis is on the
action-model learning process within TRAIL. The agent
begins the learning process by recording experiences in
its environment either by observing a trainer or by
executing a plan. Second, the agent identifies
instances of action success or failure during these
experiences using a new analysis demonstrating nine
possible causes of action failure. Finally, a variant
of the Inductive Logic Programming algorithm DINUS is
used to induce action models based on the action
instances. As the action models are learned, they can
be used for constructing plans whose execution
contributes to additional learning experiences.
Diminishing reliance on the teacher signals successful
convergence of the learning process.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1589",
}
@TechReport{Goldwasser:1997:CMA,
author = "Michael Goldwasser",
title = "Complexity Measures for Assembly Sequences",
type = "Technical Report",
number = "STAN-CS-97-1590",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1590.html",
abstract = "Our work focuses on various complexity measures for
two-handed assembly sequences. For many products, there
exist an exponentially large set of valid sequences,
and a natural goal is to use automated systems to
select wisely from the choices. Although there has been
a great deal of algorithmic success for finding
feasible assembly sequences, there has been very little
success towards optimizing the costs of sequences. We
attempt to explain this lack of progress, by proving
the inherent difficulty in finding optimal, or even
near-optimal, assembly sequences. To begin, we define,
``virtual assembly sequencing'', a graph-theoretic
problem that is a generalization of assembly
sequencing, focusing on the combinatorial aspect of the
family of feasible assembly sequences, while
temporarily separating out the specific geometric
assumptions inherent to assembly sequencing. We
formally prove the hardness of finding even
near-optimal sequences for most cost measures in our
generalized framework. As a special case, we prove
similar, strong inapproximability results for the
problem of scheduling with AND/OR precedence
constraints. Finally, we re-introduce the geometry, and
continue by realizing several of these hardness results
in rather simple geometric settings. We are able to
show strong inapproximability results, for example
using an assembly consisting solely of unit disks in
the plane.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1590",
}
@TechReport{Friedman:1997:MBD,
author = "Nir Friedman",
title = "Modeling beliefs in dynamic systems",
type = "Technical Report",
number = "STAN-CS-97-1591",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
month = jun,
year = "1997",
bibdate = "Thu Nov 27 18:35:50 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
acknowledgement = ack-nhfb,
remark = "This is the author's Ph.D. thesis.",
}
@TechReport{Goel:1997:OTC,
author = "Ashish Goel and Monika R. Henzinger and Serge
Plotkin",
title = "Online Throughput-Competitive Algorithm for Multicast
Routing and Admission Control",
type = "Technical Report",
number = "STAN-CS-97-1592",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jul,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1592.html",
abstract = "We present the first polylog-competitive online
algorithm for the general multicast problem in the
throughput model. The ratio of the number of requests
accepted by the optimum offline algorithm to the
expected number of requests accepted by our algorithm
is polylogarithmic in $M$ and $n$, where $M$ is the
number of multicast groups and $n$ is the number of
nodes in the graph. We show that this is close to
optimum by presenting an $ \Omega (\log n \log M) $
lower bound on this ratio for any randomized online
algorithm against an oblivious adversary. We also show
that it is impossible to be competitive against an
adaptive online adversary. As in the previous online
routing algorithms, our algorithm uses edge-costs when
deciding on which is the best path to use. In contrast
to the previous competitive algorithms in the
throughput model, our cost is not a direct function of
the edge load. The new cost definition allows us to
decouple the effects of routing and admission decisions
of different multicast groups.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1592",
}
@TechReport{Nourbakhsh:1997:IPEa,
author = "Illah Reza Nourbakhsh",
title = "Interleaving Planning and Execution for Autonomous
Robots",
type = "Technical Report",
number = "STAN-CS-97-1593",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "168",
year = "1997",
ISBN = "0-7923-9828-9",
ISBN-13 = "978-0-7923-9828-8",
bibdate = "Thu Nov 27 18:35:50 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Published as \cite{Nourbakhsh:1997:IPEb}.",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Kapur:1997:IPB,
author = "Arjun Kapur",
title = "Interval and Point-Based Approaches to Hybrid System
Verification",
type = "Technical Report",
number = "STAN-CS-97-1594",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1594.html",
abstract = "Hybrid systems are real-time systems consisting of
both continuous and discrete components. This thesis
presents deductive and diagrammatic methodologies for
proving point-based and interval-based properties of
hybrid systems, where the hybrid system is modeled in
either a sampling semantics or a continuous semantics.
Under a sampling semantics the behavior of the system
consists of a discrete number of system snapshots,
where each snapshot records the state of the system at
a particular moment in time. Under a continuous
semantics, the system behavior is given by a function
mapping each point in time to a system state. Two
continuous semantics are studied: a continuous interval
semantics, where at any given point in time the system
is in a unique state, and a super-dense semantics,
where no such requirement is needed. We use Linear-time
Temporal Logic for expressing properties under either a
sampling semantics or a super-dense semantics, and we
introduce Hybrid Temporal Logic for expressing
properties under a continuous interval semantics.
Linear-time Temporal Logic is useful for expressing
point-based properties, whose validity is dependent on
individual states, while Hybrid Temporal Logic is
useful for expressing both interval-based properties,
whose validity is dependent on intervals of time, and
point-based properties. Finally, two different
verification methodologies are presented: a
diagrammatic approach for verifying properties
specified in Linear-time Temporal Logic, and a
deductive approach for verifying properties specified
in Hybrid Temporal Logic.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1594",
}
@TechReport{Huyn:1997:MDW,
author = "Nam Huyn",
title = "Maintaining data warehouses under limited source
access",
type = "Technical Report",
number = "STAN-CS-97-1595",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1595.html",
abstract = "A data warehouse stores views derived from data that
may not reside at the warehouse. Using these
materialized views, user queries can be answered
quickly because querying the external sources where the
base data reside is avoided. However, when the sources
change, the views in the warehouse can become
inconsistent with the base data and must be maintained.
A variety of approaches have been proposed for
maintaining these views incrementally. At the one end
of the spectrum, the required view updates are computed
without restricting which base relations can be used.
View maintenance with this approach is simple but can
be expensive, since it may involve querying the
external data sources. At the other end of the
spectrum, additional views are stored at the warehouse
to make sure that there is enough information to
maintain the views without ever having to query the
data sources. While this approach saves on external
source access, it may require a large amount of
information to be stored and maintained at the
warehouse. In this thesis, we propose an intermediate
approach to warehouse maintenance based on what we call
{\em Runtime View Self-Maintenance}, where the views
are incrementally maintained without using all the base
relations but without requiring additional views to
facilitate maintenance. Under limited information,
however, maintaining a view unambiguously may not
always be possible. Thus, the main questions in runtime
view self-maintenance are: --- View
self-maintainability. Under what conditions (on the
given information) can a view be maintained
unambiguously with respect to a given update? --- View
self-maintenance. If a view can be maintained
unambiguously, how do we maintain it using only the
given information? The information we consider using
for maintaining a view includes: --- At least the
contents of the view itself and the update instance ---
Optionally, the contents of other views in the
warehouse, functional dependencies the base relations
are known to satisfy, a subset of the base relations,
and partial contents of a base relation. Developing
efficient complete solutions for the runtime
self-maintenance of conjunctive-query views is the main
focus and the main contribution of this thesis.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1595",
}
@TechReport{Campbell:1997:DDL,
author = "Keith Eugene Campbell",
title = "Distributed Development of a Logic-Based Controlled
Medical Terminology",
type = "Technical Report",
number = "STAN-CS-97-1596",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1596.html",
abstract = "A controlled medical terminology (CMT) encodes
clinical data: patient's physical signs, symptoms, and
diagnoses. Application developers lack a robust CMT and
the methodologies needed to coordinate terminology
development within and between projects. In this
dissertation, I argue that if a formal terminology
model is adopted and integrated into a
change-management process that supports dynamic CMTs,
then CMTs can evolve from being an impediment to
application development and data analysis to a valuable
resource. My thesis states that such an evolutionary
approach can be supported by using semantics-based
methods for managing concurrent terminology
development, thereby bypassing the disadvantages of
traditional lock-based approaches common in database
systems. By allowing developers to work concurrently on
the terminology while relying on semantics-based
methods to resolve the ``collisions'' that are
inevitable in concurrent work, a scalable approach to
terminology development can be supported. This
dissertation discusses CMT development in terms of
three research topics: 1. Representation of Clinical
Data 2. Concurrency Control 3. Configuration
Management",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1596",
}
@TechReport{Cohen:1997:EMD,
author = "Scott Cohen and Leonidas Guibas",
title = "The {Earth Mover's Distance}: Lower Bounds and
Invariance under Translation",
type = "Technical Report",
number = "STAN-CS-97-1597",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "44",
month = nov,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1597.html",
abstract = "The Earth Mover's Distance (EMD) between two finite
distributions of weight is proportional to the minimum
amount of work required to transform one distribution
into the other. Current content-based retrieval work in
the Stanford Vision Laboratory uses the EMD as a common
framework for measuring image similarity with respect
to color, texture, and shape content. In this report,
we present some fast to compute lower bounds on the EMD
which may allow a system to avoid exact, more expensive
EMD computations during query processing. The
effectiveness of the lower bounds is tested in a
color-based retrieval system. In addition to the lower
bound work, we also show how to compute the EMD under
translation. In this problem, the points in one
distribution are free to translate, and the goal is to
find a translation that minimizes the EMD to the other
distribution.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1597",
}
@TechReport{Duschka:1997:QPO,
author = "Oliver M. Duschka",
title = "Query Planning and Optimization in Information
Integration",
type = "Technical Report",
number = "STAN-CS-97-1598",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1598.html",
abstract = "Information integration systems provide uniform user
interfaces to varieties of different information
sources. Our work focuses on query planning in such
systems. Query planning is the task of transforming a
user query, represented in the user's interface
language and vocabulary, into queries that can be
executed by the information sources. Every information
source might require a different query language and
might use different vocabularies. We show that query
plans with a fixed number of database operations are
insufficient to extract all information from the
sources, if functional dependencies or limitations on
binding patterns are present. Dependencies complicate
query planning because they allow query plans that
would otherwise be invalid. We present an algorithm
that constructs query plans that are guaranteed to
extract all available information in these more general
cases. This algorithm is also able to handle datalog
user queries. We examine further extensions of the
languages allowed for user queries and for describing
information sources: disjunction, recursion and
negation in source descriptions, negation and
inequality in user queries. For these more expressive
cases, we determine the data complexity required of
languages able to represent ``best possible'' query
plans.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1598",
}
@TechReport{Sim:1997:TBI,
author = "Ida Sim",
title = "Trial Banks: an Informatics Foundation for
Evidence-Based Medicine",
type = "Technical Report",
number = "STAN-CS-97-1599",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1599.html",
abstract = "Randomized clinical trials constitute one of our main
sources of medical knowledge, yet trial reports are
difficult to find, read, and apply to clinical care. I
propose that authors report trials both as entries into
electronic knowledge bases --- or trial banks --- and
as text articles in traditional journals. Trial banks
should be interoperable, and we thus require a shared
ontology of clinical-trial concepts. My thesis work is
the design, implementation, and evaluation of such an
ontology. Using a new approach called competency
decomposition, I show that my ontology design is
reasonable, and that the ontology is competent for
three of the four core tasks of clinical-trials
interpretation for a broad range of trial types. Using
this ontology, I implemented a frame-based trial bank
that can be queried dynamically over the World Wide
Web. Clinical researchers successfully used this system
to critique trials in the trial bank. With the advent
of digital publication, we have a window of opportunity
to design our publication systems such that they
support the transfer of evidence from the research
world to the clinic. This dissertation presents
foundational work for an interoperating trial-bank
system that will help us achieve the day-to-day
practice of evidence-based medicine.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1599",
}
@TechReport{Goldberg:1997:ICA,
author = "Andrew Goldberg and Jeffrey D. Oldham and Serge
Plotkin and Cliff Stein",
title = "An Implementation of a Combinatorial Approximation
Algorithm for Minimum-Cost Multicommodity Flow",
type = "Technical Report",
number = "STAN-CS-97-1600",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1997",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-97-1600.html",
abstract = "The minimum-cost multicommodity flow problem involves
simultaneously shipping multiple commodities through a
single network so that the total flow obeys arc
capacity constraints and has minimum cost.
Multicommodity flow problems can be expressed as linear
programs, and most theoretical and practical algorithms
use linear-programming algorithms specialized for the
problems' structures. Combinatorial approximation
algorithms yield flows with costs slightly larger than
the minimum cost and use capacities slightly larger
than the given capacities. Theoretically, the running
times of these algorithms are much less than that of
linear-programming-based algorithms. We combine and
modify the theoretical ideas in these approximation
algorithms to yield a fast, practical implementation
solving the minimum-cost multicommodity flow problem.
Experimentally, the algorithm solved our problem
instances (to 1\% accuracy) two to three orders of
magnitude faster than the linear-programming package
CPLEX and the linear-programming based multicommodity
flow program PPRN.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-97-1600",
}
@TechReport{deAlfaro:1998:FVP,
author = "Luca de Alfaro",
title = "Formal Verification of Probabilistic Systems",
type = "Technical Report",
number = "STAN-CS-98-1601",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1601.html",
abstract = "This dissertation presents methods for the formal
modeling and specification of probabilistic systems,
and algorithms for the automated verification of these
systems. Our system models describe the behavior of a
system in terms of probability, nondeterminism,
fairness and time. The formal specification languages
we consider are based on extensions of branching-time
temporal logics, and enable the expression of
single-event and long-run average system properties.
This latter class of properties, not expressible with
previous formal languages, includes most of the
performance properties studied in the field of
performance evaluation, such as system throughput and
average response time. Our choice of system models and
specification languages has been guided by the goal of
providing efficient verification algorithms. The
algorithms rely on the theory of Markov decision
processes, and exploit a connection between the
graph-theoretical and probabilistic properties of these
processes. This connection also leads to new results
about classical problems, such as an extension to the
solvable cases of the stochastic shortest path problem,
an improved algorithm for the computation of
reachability probabilities, and new results on the
average reward problem for semi-Markov decision
processes.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1601",
}
@TechReport{Fisher:1998:TSO,
author = "Kathleen Fisher",
title = "Type Systems for Object-Oriented Programming
Languages",
type = "Technical Report",
number = "STAN-CS-98-1602",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1602.html",
abstract = "Object-oriented programming languages (OOPL's) provide
important support for today's large-scale software
projects. Unfortunately, typed OOPL's have suffered
from overly restrictive type systems that have forced
programmers to use type-casts to achieve flexibility, a
notorious source of hard-to-find bugs. One source of
this inflexibility is the conflation of subtyping and
inheritance, which reduces potential code reuse.
Attempts to fix this rigidity have resulted in unsound
type systems, most notably Eiffel's. This thesis
develops a sound type system for a formal
object-oriented language. It gains flexibility by
separating subtyping and inheritance and by supporting
method specialization, which allows the types of
methods to be refined during inheritance. The lack of
such a mechanism is a key source of type-casts in
languages like C++. Abstraction primitives in this
formal language support a class construct similar to
the one found in C++ and Java, explaining the link
between inheritance and subtyping: object types that
include implementation information are a form of
abstract type, and the only way to produce a subtype of
an abstract type is via inheritance. Formally, the
language is presented as an object calculus. The thesis
proves type soundness with respect to an operational
semantics via a subject reduction theorem.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1602",
}
@TechReport{Herrod:1998:UCM,
author = "Stephen Alan Herrod",
title = "Using Complete Machine Simulation to Understand
Computer System Behavior",
type = "Technical Report",
number = "STAN-CS-98-1603",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1603.html",
abstract = "This dissertation describes complete machine
simulation, a novel approach to understanding the
behavior of modern computer systems. Complete machine
simulation models all of the hardware found in modern
computer systems, allowing it to investigate the
behavior of highly configurable machines running
commercial operating systems and important workloads
such as database and web servers. Complete machine
simulation extends the applicability of traditional
machine simulation techniques by addressing speed and
data organization challenges. To achieve the speed
needed to investigate long-running workloads, complete
machine simulation allows an investigator to
dynamically adjust the characteristics of its hardware
simulation. An investigator can select a high-speed,
low-detail simulation setting to quickly pass through
uninteresting portions of a workload's execution. Once
the workload has reached a more interesting execution
state, an investigator can switch to slower, more
detailed simulation to obtain behavioral information.
To efficiently organize low-level hardware simulation
data into more useful information, complete machine
simulation provides several mechanisms that incorporate
higher-level workload knowledge into the data
management process. These mechanisms are efficient and
further improve simulation speed by customizing all
data collection and reporting to the specific needs of
an investigation.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1603",
}
@TechReport{Teo:1998:TAS,
author = "Patrick C. Teo",
title = "Theory and Applications of Steerable Functions",
type = "Technical Report",
number = "STAN-CS-98-1604",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1604.html",
abstract = "A function is called steerable if transformed versions
of the function can be expressed using linear
combinations of a fixed set of basis functions. In this
dissertation, we propose a framework, based on Lie
group theory, for studying and constructing functions
steerable under any smooth transformation group.
Existing analytical approaches to steerability are
consistently explained within the framework. The design
of a suitable set of basis functions given any
arbitrary steerable function is one of the main
problems concerning steerable functions. To this end,
we have developed two different algorithms. The first
algorithm is a symbolic method that derives the minimal
set of basis functions automatically given an arbitrary
steerable function. In practice, functions that need to
be steered might not be steerable with a finite number
of basis functions. Moreover, it is often the case that
only a small subset of transformations within the group
of transformations needs to be considered. In response
to these two concerns, the second algorithm computes
the optimal set of k basis functions to steer an
arbitrary function under a subset of the group of
transformations. Lastly, we demonstrate the usefulness
of steerable functions in a variety of applications.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1604",
}
@TechReport{Balabanovic:1998:LSM,
author = "Marko Balabanovic",
title = "Learning to Surf: Multiagent Systems for Adaptive Web
Page Recommendation",
type = "Technical Report",
number = "STAN-CS-98-1605",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1605.html",
abstract = "Imagine a newspaper personalized for your tastes.
Instead of a selection of articles chosen for a general
audience by a human editor, a software agent picks
items just for you, covering your particular topics of
interest. Since there are no journalists at its
disposal, the agent searches the Web for appropriate
articles. Over time, it uses your feedback on
recommended articles to build a model of your
interests. This thesis investigates the design of
``recommender systems'' which create such personalized
newspapers. Two research issues motivate this work and
distinguish it from approaches usually taken by
information retrieval or machine learning researchers.
First, a recommender system will have many users, with
overlapping interests. How can this be exploited?
Second, each edition of a personalized newspaper
consists of a small set of articles. Techniques for
deciding on the relevance of individual articles are
well known, but how is the composition of the set
determined? One of the primary contributions of this
research is an implemented architecture linking
populations of adaptive software agents. Common
interests among its users are used both to increase
efficiency and scalability, and to improve the quality
of recommendations. A novel interface infers document
preferences by monitoring user drag-and-drop actions,
and affords control over the composition of sets of
recommendations. Results are presented from a variety
of experiments: user tests measuring learning
performance, simulation studies isolating particular
tradeoffs, and usability tests investigating
interaction designs.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1605",
}
@TechReport{Basu:1998:ACC,
author = "Julie Basu",
title = "Associative Caching in Client--Server Databases",
type = "Technical Report",
number = "STAN-CS-98-1606",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1606.html",
abstract = "Client-server configuration is a popular architecture
for modern databases. A traditional assumption in such
systems is that clients have limited resources, and
query processing is always performed by the server. The
server is thus a potential performance bottleneck. To
improve the system performance and scalability, today's
powerful clients can cache data locally. In this
dissertation, we study a new scheme, A*Cache, for
associative client-side caching. In contrast to
navigational data access using object or page
identifiers, A*Cache supports content-based associative
access for better data reuse. Query results are stored
locally along with their description, and
predicate-based reasoning is used to examine and
maintain the client cache. Clients execute queries
locally if the data is cached, and use update
notifications generated by the server for cache
maintenance. We first describe the architecture of
A*Cache and its transaction execution model. We then
develop new optimization techniques for improving the
performance of A*Cache. Next, A*Cache performance is
investigated through detailed simulation of a
client-server database under many different workloads,
and compared with other types of caching systems. The
simulation results clearly demonstrate the
effectiveness of our associative caching scheme for
read-only environments, and also for read-write
scenarios with moderately high data update
probabilities.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1606",
}
@TechReport{Roscheisen:1998:NCD,
author = "Martin Roscheisen",
title = "A Network-Centric Design for Relationship-Based Rights
Management",
type = "Technical Report",
number = "STAN-CS-98-1607",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1607.html",
abstract = "Networked environments such as the Internet provide a
new platform for communication and information access.
In this thesis, we address the question of how to
articulate and enforce boundaries of control on top of
this platform, while enabling collaboration and sharing
in a peer-to-peer environment. We develop the concepts
and technologies for a new Internet service layer,
called FIRM, that enables structured
rights/relationship management. Using a prototype
implementation, RManage, we show how FIRM makes it
possible to unify rights/relationship management from a
user-centered perspective and to support full
end-to-end integration of shared control state in
network services and users' client applications. We
present a network-centric architecture for managing
control information, which generalizes previous,
client/server-based models to a peer-to-peer
environment. Principles and concepts from contract law
are used to identify a generic way of representing the
shared structure of different kinds of relationships.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1607",
}
@TechReport{Katz:1998:NPP,
author = "Morris J. Katz",
title = "A New Perspective on Partial Evaluation and Use
Analysis",
type = "Technical Report",
number = "STAN-CS-98-1608",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = jun,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1608.html",
abstract = "Partial evaluators are compile time optimizers
achieving performance improvements through a program
modification technique called specialization. Partial
evaluators produce one or more copies, or
specializations, of each procedure in a source program
in the output program. Specializations are
distinguished by being optimized for invocation from
call sites with different characteristics, for example,
placing certain constraints on argument values.
Specializations are created by partially executing
procedures, leaving only unexecutable portions as
residual code. Symbolic execution can replace variable
references by the referenced values, executed
primitives by their computed results, and function
applications by the bodies of the applied functions,
yielding inlining. One core challenge of partial
evaluation is selecting what specializations to create.
Attempting to produce an infinite number of
specializations results in divergence. The termination
mechanism of a partial evaluator decides whether or not
to symbolically execute a procedure in order to create
a new specialization. Creating a termination mechanism
that precludes divergence is not difficult. However,
crafting a termination mechanism resulting in the
production of a sufficient number of appropriate
specializations to produce high quality residual code
while still terminating all, or most, of the time is
quite challenging. This dissertation presents a new
type of analysis, called use analysis, forming the
basis of a termination mechanism designed to yield a
better combination of residual code quality and
frequent termination than the current
state-of-the-art.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1608",
}
@TechReport{Sanders:1998:ACC,
author = "Gillian D. Sanders",
title = "Automated creation of clinical-practice guidelines
from decision models",
type = "Technical Report",
number = "STAN-CS-98-1609",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xxiv + 244",
month = jul,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1609.html",
abstract = "I developed an approach that allows clinical-practice
guideline (CPG) developers to create, disseminate, and
tailor CPGs, using decision models (DMs). I propose
that guideline developers can use computer-based DMs
that reflect global and site-specific data to generate
CPGs. Such CPGs are high quality, can be tailored to
specific settings, and can be modified automatically as
the DM or evidence evolves. I defined conceptual models
for representing CPGs and DMs, and formalized a method
for mapping between these two representations. I
designed a DM annotation editor that queries the
decision analyst for missing knowledge. I implemented
the ALCHEMIST system that encompasses the conceptual
models, mapping algorithm, and the resulting tailoring
abilities. I evaluated the design of both conceptual
models, and the accuracy of the mapping algorithm. To
show that ALCHEMIST produces high-quality CPGs, I had
users rate the quality of produced CPGs using a
guideline-rating key, and evaluate ALCHEMIST's
tailoring abilities. ALCHEMIST automates the DM-to-CPG
process and distributes the CPG over the web to allow
local developers to apply, tailor, and maintain a
global CPG. I argue that my framework is a method for
guideline developers to create and maintain automated
CPGs, and it thus promotes high-quality and
cost-effective health care.",
acknowledgement = ack-nhfb,
pdfpages = "262",
remark = "This is the author's Ph.D. thesis.",
xxnumber = "CS-TR-98-1609",
}
@TechReport{Veach:1998:RMC,
author = "Eric Veach",
title = "Robust {Monte Carlo} methods for light transport
simulation",
type = "Technical Report",
number = "STAN-CS-98-1610",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xxv + 406",
month = aug,
year = "1998",
bibdate = "Thu Nov 27 18:35:50 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://searchworks.stanford.edu/view/10386091",
acknowledgement = ack-nhfb,
remark = "This is the author's thesis.",
}
@TechReport{Chekuri:1998:AAS,
author = "Chandra Chekuri",
title = "Approximation Algorithms for Scheduling Problems",
type = "Technical Report",
number = "STAN-CS-98-1611",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = sep,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1611.html",
abstract = "This thesis describes efficient approximation
algorithms for some NP-Hard deterministic machine
scheduling and related problems. We study the objective
functions of minimizing makespan (the time to complete
all jobs) and minimizing average completion time in a
variety of settings described below. 1. Minimizing
average completion time and its weighted generalization
for single and parallel machine problems. We introduce
new techniques that either improve earlier results
and/or result in simple and efficient approximation
algorithms. In addition to improved results for
specific problems, we give a general algorithm that
converts an $x$ approximate single machine schedule
into a $ (2 x + 2) $ approximate parallel machine
schedule. 2. Minimizing makespan on machines with
different speeds when jobs have precedence constraints.
We obtain an $ O(\log m)$ approximation ($m$ is the
number of machines) in $ O(n^3)$ time. 3. We introduce
a class of new scheduling problems that arise from
query optimization in parallel databases. The novel
aspect consists of modeling communication costs in
query execution. We devise algorithms for pipelined
operator scheduling. We obtain a PTAS and also simpler
$ O(n \log n)$ time algorithms with ratios of 3.56 and
2.58. 4. Multi-dimensional generalizations of three
well known problems in combinatorial optimization:
multi-processor scheduling, bin packing, and the
knapsack problems. We obtain several approximability
and inapproximability results.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1611",
}
@TechReport{Iliano:1998:PPC,
author = "Iliano Cervesato and John C. Mitchell",
title = "{Pleiades Project}: Collected Work 1997--1998",
type = "Technical Report",
number = "STAN-CS-98-1612",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1612.html",
abstract = "This report collects the papers that were written by
the participants of the Pleiades Project and their
collaborators from April 1997 to August 1998. Its
intent is to give the reader an overview of our
accomplishments during this initial phase of the
project. Therefore, rather than including complete
publications, we chose to reproduce only the first four
pages of each paper. In order to satisfy the legitimate
curiosity of readers interested in specific articles,
each paper can be integrally retrieved from the
World-Wide Web through the provided URL. A list of the
current publications of the Pleiades Project is
accessible at the URL
http://theory.stanford.edu/muri/papers.html. Future
articles will be posted there as they become
available.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1612",
}
@TechReport{Prabhakar:1998:SPP,
author = "Balaji Prabhakar and Nicholas Bambos and Tom
Mountford",
title = "On the synchronization of {Poisson} processes and
queueing networks with service and synchronization
nodes",
type = "Technical Report",
number = "STAN-CS-98-1613",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1613.html",
abstract = "This paper investigates the dynamics of a
synchronization node in isolation, and of networks of
service and synchronization nodes. A synchronization
node consists of $M$ infinite capacity buffers, where
tokens arriving on $M$ distinct random input flows are
stored (there is one buffer for each flow). Tokens are
held in the buffers until one is available from each
flow. When this occurs, a token is drawn from each
buffer to form a group-token, which is instantaneously
released as a synchronized departure. Under independent
Poisson inputs, the output of a synchronization node is
shown to converge weakly (and in certain cases
strongly) to a Poisson process with rate equal to the
minimum rate of the input flows. Hence synchronization
preserves the Poisson property, as do superposition,
Bernoulli sampling and M/M/1 queueing operations. We
then consider networks of synchronization and
exponential server nodes with Bernoulli routing and
exogenous Poisson arrivals, extending the standard
Jackson Network model to include synchronization nodes.
It is shown that if the synchronization skeleton of the
network is acyclic (i.e. no token visits any
synchronization node twice although it may visit a
service node repeatedly), then the distribution of the
joint queue-length process of only the service nodes is
product form (under standard stability conditions) and
easily computable. Moreover, the network output flows
converge weakly to Poisson processes. Finally, certain
results for networks with finite capacity buffers are
presented, and the limiting behavior of such networks
as the buffer capacities become large is studied.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1613",
}
@TechReport{deAlfaro:1998:DTC,
author = "Luca de Alfaro and Zohar Manna and Henny Sipma",
title = "Decomposing, Transforming and Composing Diagrams: The
Joys of Modular Verification",
type = "Technical Report",
number = "STAN-CS-98-1614",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = oct,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1614.html",
abstract = "The paper proposes a modular framework for the
verification of temporal logic properties of systems
based on the deductive transformation and composition
of diagrams. The diagrams represent abstractions of the
modules composing the system, together with information
about the environment of the modules. The proof of a
temporal specification is constructed with the help of
diagram transformation and composition rules, which
enable the gradual decomposition of the system into
manageable modules, the study of the modules, and the
final combination of the diagrams into a proof of the
specification. We illustrate our methodology with the
modular verification of a database demarcation
protocol.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1614",
}
@TechReport{Sahami:1998:UML,
author = "Mehran Sahami",
title = "Using Machine Learning to Improve Information Access",
type = "Technical Report",
number = "STAN-CS-98-1615",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = dec,
year = "1998",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-98-1615.html",
abstract = "We address the problem of topical information space
navigation. Specifically, we combine query tools with
methods for automatically creating topic taxonomies in
order to organize text collections. Our system, named
SONIA (Service for Organizing Networked Information
Autonomously), is implemented in the Stanford Digital
Libraries testbed. It employs several novel
probabilistic Machine Learning methods that enable the
automatic creation of dynamic topic hierarchies based
on the full-text content of documents. First, to
generate such topical hierarchies, we employ a novel
clustering scheme that outperforms traditional methods
used in both Information Retrieval and Probabilistic
Reasoning. Furthermore, we develop methods for
classifying new articles into such automatically
generated, or existing manually generated, hierarchies.
Our method explicitly uses the hierarchical
relationships between topics to improve classification
accuracy. Much of this improvement is derived from the
fact that the classification decisions in such a
hierarchy can be made by considering only the presence
(or absence) of a small number of features (words) in
each document. The choice of relevant words is made
using a novel information theoretic algorithm for
feature selection. The algorithms used in SONIA are
also general enough to have been successfully applied
to data mining problems in different domains than
text.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-98-1615",
}
@TechReport{Bjorner:1998:DVR,
author = "Nikolaj S. Bj{\o}rner and Zohar Manna and Henny B.
Sipma and Tom{\'a}s E. Uribe",
title = "Deductive verification of real-time systems using
{STeP}",
type = "Technical Report",
number = "STAN-CS-98-1616",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
month = jan,
year = "1998",
bibdate = "Thu Nov 27 18:35:50 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Preliminary version appeared in 4th Intl. AMAST
Workshop on Real-Time Systems, LNCS, Vol. 1231,
Springer-Verlag, May 1997, pp. 484--498. Published in
Published in \booktitle{Theoretical Computer Science}
{\bf 253}(1) 27--60, 17 February 2001",
acknowledgement = ack-nhfb,
}
@TechReport{Shiffman:1999:SMI,
author = "Smadar Shiffman",
title = "Segmentation of Medical Image Volumes Using Intrinsic
Shape Information",
type = "Technical Report",
number = "STAN-CS-99-1617",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = feb,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1617.html",
abstract = "I propose a novel approach to segmentation of image
volumes that requires only a small amount of user
intervention and that does not rely on prior global
shape models. The approach, intrinsic shape for volume
segmentation (IVSeg), comprises two methods. T he first
method analyzes isolabel-contour maps to identify
salient regions that correspond to major objects. The
method detects transitions from within objects into the
background by matching isolabel contours that form
along the boundaries of objects as a result of
multilevel thresholding with a fine partition of the
intensity range. The second method searches in the
entire sequence for regions that belong to an object
that the user selects from one or a few sections. The
method uses local overlap criteria to determine whether
regions that overlap in a given direction (coronal,
sagittal, or axial) belong to the same object. For
extraction of blood vessels, the method derives the
criteria dynamically by fitting cylinders to regions in
consecutive sections and computing the expected overlap
of slices of these cylinders. In a formal evaluation
study with CTA data, I showed that IVSeg reduced user
editing time by a factor of 5 without affecting the
results in any significant way.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1617",
}
@TechReport{Uribe:1999:ABD,
author = "Tomas E. Uribe",
title = "Abstraction-based Deductive-Algorithmic Verification
of Reactive Systems",
type = "Technical Report",
number = "STAN-CS-99-1618",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = mar,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1618.html",
abstract = "This thesis presents a framework that combines
deductive and algorithmic methods for verifying
temporal properties of reactive systems, to allow more
automatic verification of general infinite-state
systems and the verification of larger finite-state
ones. Underlying these methods is the theory of
property-preserving assertion-based abstractions, where
a finite-state abstraction of the system is deductively
justified and algorithmically model checked. After
presenting an abstraction framework that accounts for
fairness, we describe a method to automatically
generate finite-state abstractions. We then show how a
number of other verification methods, including
deductive rules, (Generalized) Verification Diagrams,
and Deductive Model Checking, can also be understood as
constructing finite-state abstractions that are model
checked. Our analysis leads to a better classification
and understanding of these verification methods.
Furthermore, it shows how the different abstractions
that they construct can be combined. For this, we
present an algorithmic Extended Model Checking
procedure, which uses all the information that these
methods produce, in a finite-state format that can be
easily and incrementally combined. Besides a standard
safety component, the combined abstractions include
extra bounds on fair transitions, well-founded orders,
and constrained transition relations for the generation
of counterexamples. Thus, our approach minimizes the
need for user interaction and maximizes the impact of
the available automated deduction and model checking
tools. Once proved, verification conditions are re-used
as much as possible, leaving the temporal and
combinatorial reasoning to automatic tools.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1618",
}
@TechReport{Huang:1999:IAA,
author = "Cecil Huang",
title = "Intelligent Alarms: Allocating Attention Among
Concurrent Processes",
type = "Technical Report",
number = "STAN-CS-99-1619",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = apr,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1619.html",
abstract = "I have developed and evaluated a computable, normative
framework for intelligent alarms: automated agents that
allocate scarce attention resources to concurrent
processes in a globally optimal manner. My approach is
decision-theoretic, and relies on Markov decision
processes to model time-varying, stochastic systems
that respond to externally applied actions. Given a
collection of continuing processes and a specified time
horizon, my framework computes, for each process: (1)
an attention allocation, which reflects how much
attention the process is awarded, and (2) an activation
price, which reflects the process's priority in
receiving the allocated attention amount. I have
developed a prototype, Simon, that computes these alarm
signals for a simulated ICU. My validity experiments
investigate whether sensible input results in sensible
output. The results show that Simon produces alarm
signals that are consistent with sound clinical
judgment. To assess computability, I used Simon to
generate alarm signals for an ICU that contained 144
simulated patients; the entire computation took about 2
seconds on a machine with only moderate processing
capabilities. I thus conclude that my alarm framework
is valid and computable, and therefore is potentially
useful in a real-world ICU setting.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1619",
}
@TechReport{Cohen:1999:FCS,
author = "Scott Cohen",
title = "Finding Color and Shape Patterns in Images",
type = "Technical Report",
number = "STAN-CS-99-1620",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = may,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1620.html",
abstract = "This thesis is devoted to the Earth Mover's Distance
(EMD), an edit distance between distributions, and its
use within content-based image retrieval (CBIR). The
major CBIR problem discussed is the pattern problem:
Given an image and a query pattern, determine if the
image contains a region which is visually similar to
the pattern; if so, find at least one such image
region. An important problem that arises in applying
the EMD to CBIR is the EMD under transformation
(EMD\_G) problem: find a transformation of one
distribution which minimizes its EMD to another, where
the set of allowable transformations G is given. The
problem of estimating the size/scale at which a pattern
occurs in an image is phrased and efficiently solved as
an EMD\_G problem. For a large class of transformation
sets, we also present a monotonically convergent
iteration to find at least a locally optimal
transformation. Our pattern problem solution is the
SEDL (Scale Estimation for Directed Location) image
retrieval system. Three important contributions of SEDL
are (1) a general framework for finding both color and
shape patterns, (2) the previously mentioned scale
estimation algorithm using the EMD, and (3) a directed
(as opposed to exhaustive) search strategy.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1620",
}
@TechReport{Rubner:1999:PMI,
author = "Yossi Rubner",
title = "Perceptual Metrics for Image Database Navigation",
type = "Technical Report",
number = "STAN-CS-99-1621",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1621.html",
abstract = "The increasing amount of information available in
today's world raises the need to retrieve relevant data
efficiently. Unlike text-based retrieval, where
keywords are successfully used to index into documents,
content-based image retrieval poses up front the
fundamental questions how to extract useful image
features and how to use them for intuitive retrieval.
We present a novel approach to the problem of
navigating through a collection of images for the
purpose of image retrieval, which leads to a new
paradigm for image database search. We summarize the
appearance of images by distributions of color or
texture features, and we define a metric between any
two such distributions. This metric, which we call the
``Earth Mover's Distance'' (EMD), represents the least
amount of work that is needed to rearrange the mass is
one distribution in order to obtain the other. We show
that the EMD matches perceptual dissimilarity better
than other dissimilarity measures, and argue that it
has many desirable properties for image retrieval.
Using this metric, we employ Multi-Dimensional Scaling
techniques to embed a group of images as points in a
two- or three-dimensional Euclidean space so that their
distances reflect image dissimilarities as well as
possible. Such geometric embeddings exhibit the
structure in the image set at hand, allowing the user
to understand better the result of a database query and
to refine the query in a perceptually intuitive way. By
iterating this process, the user can quickly zoom in to
the portion of the image space of interest. We also
apply these techniques to other modalities such as
mug-shot retrieval.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1621",
}
@TechReport{Oldham:1999:MGF,
author = "Jeffrey David Oldham",
title = "Multicommodity and Generalized Flow Algorithms: Theory
and Practice",
type = "Technical Report",
number = "STAN-CS-99-1622",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1622.html",
abstract = "We present several simple, practical, and fast
algorithms for linear programs, concentrating on
network flow problems. Since the late 1980s,
researchers developed different combinatorial
approximation algorithms for fractional packing
problems, obtaining the fastest theoretical running
times to solve multicommodity minimum-cost and
concurrent flow problems. A direct implementation of
these multicommodity flow algorithms was several orders
of magnitude slower than solving these problems using a
commercial linear programming solver. Through
experimentation, we determined which theoretically
equivalent constructs are experimentally efficient.
Guided by theory, we designed and implemented practical
improvements while maintaining the same worst-case
complexity bounds. The resulting algorithms solve
problems orders of magnitude faster than commercial
linear programming solvers and problems an order of
magnitude larger. We also present simple, combinatorial
algorithms for generalized flow problems. These
problems generalize ordinary network flow problems by
specifying a flow multiplier \mu(a) for each arc a.
Using multipliers permit a flow problem to model
transforming one type into another, e.g., currency
exchange, and modification of the amount of flow, e.g.,
water evaporation from canals or accrual of interest in
bank accounts. First, we show the generalized shortest
paths problem can be solved using existing network flow
ideas, i.e., by combining the Bellman-Ford-Moore
shortest path framework and Megiddo's parametric
search. Second, we combine this algorithm with
fractional packing frameworks to yield the first
polynomial-time combinatorial approximation algorithms
for the generalized versions of the nonnegative-cost
minimum-cost flow, concurrent flow, multicommodity
maximum flow, and multicommodity nonnegative-cost
minimum-cost flow problems. These algorithms show that
generalized concurrent flow and multicommodity maximum
flow have strongly polynomial approximation
algorithms.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1622",
}
@TechReport{Labio:1999:EMR,
author = "Wilburt Juan Labio",
title = "Efficient Maintenance and Recovery of Data
Warehouses",
type = "Technical Report",
number = "STAN-CS-99-1623",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1623.html",
abstract = "Data warehouses collect data from multiple remote
sources and integrate the information as materialized
views in a local database. The materialized views are
used to answer queries that analyze the collected data
for patterns, and trends. This type of query processing
is often called on-line analytical processing (OLAP).
The warehouse views must be updated when changes are
made to the remote information sources. Otherwise, the
answers to OLAP queries are based on stale data.
Answering OLAP queries based on stale data is clearly a
problem especially if OLAP queries are used to support
critical decisions made by the organization that owns
the data warehouse. Because the primary purpose of the
data warehouse is to answer OLAP queries, only a
limited amount of time and/or resources can be devoted
to the warehouse update. Hence, we have developed new
techniques to ensure that the warehouse update can be
done efficiently. Also, the warehouse update is not
devoid of failures. Since only a limited amount of time
and/or resources are devoted to the warehouse update,
it is most likely infeasible to restart the warehouse
update from scratch. Thus, we have developed new
techniques for resuming failed warehouse updates.
Finally, warehouse updates typically transfer gigabytes
of data into the warehouse. Although the price of disk
storage is decreasing, there will be a point in the
``lifetime'' of a data warehouse when keeping and
administering all of the collected is unreasonable.
Thus, we have investigated techniques for reducing the
storage cost of a data warehouse by selectively
``expiring'' information that is not needed.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1623",
}
@TechReport{Greenwald:1999:NBS,
author = "Michael Greenwald",
title = "Non-blocking Synchronization and System Design",
type = "Technical Report",
number = "STAN-CS-99-1624",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1624.html",
abstract = "Non-blocking synchronization (NBS) has significant
advantages over blocking synchronization in areas of
fault-tolerance, system structure, portability, and
performance. These advantages gain importance with the
increased use of parallelism and multiprocessors, and
as delays increase relative to processor speed. This
thesis demonstrates that non-blocking synchronization
is practical as the sole co-ordination mechanism in
systems by showing that careful OS design eases
implementation of efficient NBS, by demonstrating that
DCAS (Double-Compare-and-Swap) is the necessary and
sufficient primitive for implementing NBS, and by
demonstrating that efficient hardware DCAS is practical
for RISC processors. This thesis presents
high-performance non-blocking implementations of common
data-structures sufficient to implement an operating
system kernel. I also present more general algorithms:
non-blocking implementations of \casn\ and software
transactional memory. Both have overhead proportional
to the number of writes, support multi\--objects, and
use a DCAS-based contention-reduction technique that is
fault-tolerant and OS-independent yet performs as well
as the best previously published techniques. I
demonstrate that proposed OS implementations of DCAS
are inefficient, and propose a design for efficient
hardware DCAS specific to the R4000 but generalizable
to other RISC processors.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1624",
}
@TechReport{Iliano:1999:PPC,
author = "Iliano Cervesato and John C. Mitchell",
title = "{Pleiades Project}: Collected Work 1998--1999",
type = "Technical Report",
number = "STAN-CS-99-1625",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
month = aug,
year = "1999",
bibdate = "Thu Nov 20 12:13:32 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://www-db.stanford.edu/TR/CS-TR-99-1625.html",
abstract = "This report collects the papers that were written by
the participants of the Pleiades Project and their
collaborators from September 1998 to August 1999. Its
intent is to give the reader an overview of our
accomplishments during this central phase of the
project. Therefore, rather than including complete
publications, we chose to reproduce only the first four
pages of each paper. The papers can be integrally
retrieved from the World-Wide Web through the provided
URLs. A list of the current publications of the
Pleiades Project is accessible at the URL
http://theory.stanford.edu/muri/papers.html. Future
articles will be posted there as they become
available.",
acknowledgement = ack-nhfb,
xxnumber = "CS-TR-99-1625",
}
@TechReport{Guimbretiere:2000:FCC,
author = "Fran{\c{c}}ois Guimbreti{\`e}re and Terry Winograd",
title = "{FlowMenu}: Combining Command, Text, and Data Entry",
type = "Technical Report",
number = "CSTR 2000-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
month = "????",
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/FlowMenu/flowmenu.pdf",
abstract = "We present a new kind of marking menu that was
developed for use with a pen device on display surfaces
such as large, high resolution, wall-mounted displays.
It integrates capabilities of previously separate
mechanisms such as marking menus and Quikwriting, and
facilitates the entry of multiple commands. While using
this menu, the pen never has to leave the active
surface so that consecutive menu selections, data entry
(text and parameters) and direct manipulation tasks can
be integrated fluidly.",
acknowledgement = ack-nhfb,
keywords = "Control Menu; Interactive surface; Marking menu;
Quikwriting",
pdfpages = "4",
}
@TechReport{Johanson:2000:EHE,
author = "Brad Johanson and Armando Fox and Pat Hanrahan and
Terry Winograd",
title = "The {Event Heap}: an Enabling Infrastructure for
Interactive Workspaces",
type = "Technical Report",
number = "CSTR 2000-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = may,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://graphics.stanford.edu/papers/eheap/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Johanson:2000:PSP,
author = "Brad Johanson and Greg Hutchins and Terry Winograd",
title = "{PointRight}: a System for Pointer\slash Keyboard
Redirection Among, Multiple Displays and Machines",
type = "Technical Report",
number = "CSTR 2000-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = may,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/pointright/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ringel:2000:BIF,
author = "Meredith Ringel and Henry Berg and Yuhui Jin and Terry
Winograd",
title = "{Barehands}: Implement-Free Interaction with a
Wall-Mounted Display",
type = "Technical Report",
number = "CSTR 2000-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
month = may,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/bhlong.pdf",
abstract = "We describe Barehands, a free-handed interaction
technique, in which the user can control the invocation
of system commands and tools on a touch screen by
touching it with distinct hand postures. Using
behind-screen infrared (IR) illumination and a video
camera with an IR filter, we enable a back-projected
SMARTBoard (a commercially available, 61in $ \times $
47in touch-sensing display) to identify and respond to
several distinct hand postures. Barehands provides a
natural, quick, implement-free method of interacting
with large, wall-mounted interactive surfaces.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{Guimbretiere:2000:GWE,
author = "Fran{\c{c}}ois Guimbreti{\`e}re and Terry Winograd and
Sha Xin Wei",
title = "The {Geometer's Workbench}: an Experiment in
Interacting with a Large, High Resolution Display",
type = "Technical Report",
number = "CSTR 2000-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
month = jun,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/%7Efrancois/Papers/UIST2000/geometerworkbench.pdf",
abstract = "We describe the Geometer's Workbench, a graphical
front end for Mathematica running on the Interactive
Mural, a large high resolution display. Our system
bridges the gap between casual whiteboard interaction
and the more formal use of a tool like Mathematica. We
anticipate that the experience gained from designing
and testing such a tool can be generalized to a large
class of technical and scientific applications that use
large, high resolution displays.",
acknowledgement = ack-nhfb,
keywords = "Ebeam; geometry; Interactive display; Mathematica;
whiteboard",
pdfpages = "7",
}
@TechReport{Chen:2000:LMU,
author = "Xing Chen and James Davis",
title = "{LumiPoint}: Multi-User Laser-Based Interaction on
Large Tiled Displays",
type = "Technical Report",
number = "CSTR 2000-06",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = jun,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/multiuser",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chen:2000:CPC,
author = "Xing Chen and James Davis",
title = "Camera Placement Considering Occlusion for Robust
Motion Capture",
type = "Technical Report",
number = "CSTR 2000-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = dec,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/OcclusionMetric/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Davis:2000:MSM,
author = "James Davis and Xing Chen",
title = "Mixed Scale Motion Recovery Using Guidable Cameras",
type = "Technical Report",
number = "CSTR 2000-08",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = dec,
year = "2000",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/GuidableCameras/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Johanson:2001:SSI,
author = "Brad Johanson and Shankar Ponnekanti and Emre Kiciman
and Caesar Sengupta and Armando Fox",
title = "System Support for Interactive Workspaces",
type = "Technical Report",
number = "CSTR 2001-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = mar,
year = "2001",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/iwork-sosp18/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Marschner:2001:FHC,
author = "Stephen R. Marschner and James Davis and Matt Garr and
Marc Levoy",
title = "Filling holes in complex surfaces using volumetric
diffusion",
type = "Technical Report",
number = "CSTR 2001-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = jan,
year = "2001",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://graphics.stanford.edu/papers/holefill-tr-2001-07/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Davis:2001:FHC,
author = "James Davis and Stephen R. Marschner and Matt Garr and
Marc Levoy",
title = "Filling holes in complex surfaces using volumetric
diffusion",
type = "Technical Report",
number = "CSTR 2001-08",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = dec,
year = "2001",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://graphics.stanford.edu/papers/holefill-tr-2001-08/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wei:2002:OIT,
author = "Li-Yi Wei and Marc Levoy",
title = "Order-Independent Texture Synthesis",
type = "Technical Report",
number = "CSTR 2002-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = jan,
year = "2002",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/texture-synthesis-tr-2002-01/",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Chuang:2002:PDF,
author = "Erica Chuang and Chris Bregler",
title = "Performance Driven Facial Animation using Blendshape
Interpolation",
type = "Technical Report",
number = "CSTR 2002-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "",
month = apr,
year = "2002",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/%7Eechuang/face",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Ionescu:2002:WCR,
author = "Arna Ionescu and Maureen Stone and Terry Winograd",
title = "{WorkspaceNavigator}: Capture, Recall and Reuse using
Spatial Cues in an Interactive Workspace",
type = "Technical Report",
number = "CSTR 2002-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
month = may,
year = "2002",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://hci.stanford.edu/research/wkspcNavTR.pdf",
abstract = "This paper describes the WorkspaceNavigator, a suite
of tools to support the capture, recall and reuse of
material and ideas generated by a group working in an
interactive workspace in an unstructured manner. Our
focus is on the capture of digital information,
including screenshots, files, and URLs. These are
stored as a sequence of timeslices, integrated by an
overview image of the physical space at the time of the
capture. The overview image provides spatial cues for
accessing the captured information. We conducted two
user studies of the WorkspaceNavigator tools and
present a number of observations on the design of the
interaction and the ways in which users understood and
adapted our tools. We show that capturing coordinated
slices of digital information is useful for recall and
summarization activities, and that coordinating access
through the visual metaphor of the overview image is
understandable and effective.",
acknowledgement = ack-nhfb,
pdfpages = "16",
}
@TechReport{Ikemoto:2003:HMA,
author = "Leslie Ikemoto",
title = "A Hierarchical Method for Aligning Warped Meshes",
type = "Technical Report",
number = "CSTR 2003-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "23",
month = jun,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Master's with Distinction in Research Report.",
URL = "https://hci.stanford.edu/cstr/reports/2003-01.pdf",
abstract = "Current alignment algorithms for registering range
data captured from a 3D scanner assume that the range
data depicts identical geometry taken from different
views. However, in the presence of scanner calibration
errors, the data will be slightly warped. These warps
often cause current alignment algorithms to converge
slowly, find the wrong alignment, or even diverge. In
this research report, we present a method for aligning
warped range data represented by polygon meshes. Our
strategy can be characterized as a coarse-to-fine
hierarchical approach, where we assume that since the
warp is global, we can compensate for it by treating
each mesh as a collection of smaller piecewise rigid
sections, which can translate and rotate with respect
to each other. We split the meshes subject to several
constraints, in order to ensure that the resulting
sections converge",
acknowledgement = ack-nhfb,
pdfpages = "23",
}
@TechReport{Chang:2003:HE,
author = "Erica Chang and Chris Bregler",
title = "Head Emotion",
type = "Technical Report",
number = "CSTR 2003-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "7",
month = apr,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/%7Eechuang/heademotion/index.html",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Buck:2003:DPC,
author = "Ian Buck and Pat Hanrahan",
title = "Data Parallel Computation on Graphics Hardware",
type = "Technical Report",
number = "CSTR 2003-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "22",
month = jan,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/abstracts/2003-03.html",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Abstract:2003:BSV,
author = "Ian Buck",
title = "{Brook} Specification v0.2",
type = "Technical Report",
number = "CSTR 2003-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "31",
month = oct,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/abstracts/2003-04.html",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Grant:2003:BSB,
author = "Karen D. Grant and Adrian Graham and Tom Nguyen and
Andreas Paepcke and Terry Winograd",
title = "Beyond the Shoe Box: Foundations for Flexibly
Organizing Photographs on a Computer",
type = "Technical Report",
number = "CSTR 2003-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "15",
month = jan,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2003-05.pdf",
abstract = "As a foundation for designing computer-supported
photograph management tools, we have been conducting
focused experiments. Here, we describe our analysis of
how people initially organize collections of familiar
images. We asked 26 subjects in pairs to organize 50
images on a common horizontal table. Each pair then
organized a different 50-image set on a computer table
of identical surface area. The bottom-projected
computer tabletop displayed our interface to several
online, pile-based affordances we wished to evaluate.
Subjects used pens to interact with the system. We
highlight aspects of the computer environment that were
notably important to subjects and others that they
cared about less than we had hypothesized. For example,
a strong majority preferred computer-generated
representations of piles to be grid-shaped over several
alternatives, some of which mimicked the physical world
closely and others that used transparency to save
space.",
acknowledgement = ack-nhfb,
keywords = "clusters; collaboration; digital photographs;
interaction design; personal digital library; pile
manipulation; pile representations; piles interface;
spatial organization system; tabletop display; user
study",
}
@TechReport{Song:2003:ISF,
author = "Yee Jiun Song and Wendy Tobagus and Der Yao Leong and
Brad Johanson and Armando Fox",
title = "{iSecurity}: a Security Framework for Interactive
Workspaces",
type = "Technical Report",
number = "CSTR 2004-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "3",
month = sep,
year = "2003",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/abstracts/2004-03.html",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{Wilburn:2004:SSI,
author = "Bennett Wilburn and Neel Joshi and Katherine Chou and
Marc Levoy and Mark Horowitz",
title = "Spatiotemporal Sampling and Interpolation for Dense
Camera Arrays",
type = "Technical Report",
number = "CSTR 2004-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "21",
month = jan,
year = "2004",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/abstracts/2004-01.html",
abstract = "",
acknowledgement = ack-nhfb,
}
@TechReport{and:2004:CCA,
author = "Neel Joshi",
title = "Color Calibration for Arrays of Inexpensive Image
Sensors",
type = "Technical Report",
number = "CSTR 2004-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "iv + 26",
day = "31",
month = mar,
year = "2004",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Master's with Distinction in Research Report.",
URL = "https://hci.stanford.edu/cstr/reports/2004-02.pdf",
abstract = "The recent emergence of inexpensive image sensors has
enabled the construction of large arrays of cameras for
computer graphics and computer vision applications.
These inexpensive image sensors have inconsistent color
responses. These inconsistencies can cause significant
errors in color sensitive multi-camera applications. We
present an automated, robust system for calibrating
large arrays of image sensors to achieve significantly
improved color consistency. We acquire images of a
Macbeth color checker placed in the scene and perform
gain and offset calibration on each individual sensor.
This process combined with a global correction step
maximizes the response range by maximizing contrast and
minimizing the black level and ensures linear response
that is white balanced for the scene. We present
results with data acquired from 45, 52, and 95-camera
arrays calibrated both indoors and outdoors for a
variety of color-sensitive applications including
high-speed video, matted synthetic aperture
photography, and multi-camera optical flow.",
acknowledgement = ack-nhfb,
pdfpages = "30",
}
@TechReport{Yeh:2004:FNF,
author = "Ron B. Yeh and Scott Klemmer",
title = "Field Notes on Field Notes: Informing Technology
Support for Biologists",
type = "Technical Report",
number = "CSTR 2004-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "13",
month = dec,
year = "2004",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://hci.stanford.edu/publications/techreports/CHI2005-Biology.pdf",
acknowledgement = ack-nhfb,
}
@TechReport{Johanson:2004:SIW,
author = "Brad Johanson and Armando Fox and Terry Winograd",
title = "The {Stanford Interactive Workspaces Project}",
type = "Technical Report",
number = "CSTR 2004-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "30",
day = "9",
month = aug,
year = "2004",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2004-05.pdf",
abstract = "The Stanford Interactive Workspaces Project has
created and studied new technologies for integrated
multi-person, multi-device collaborative work settings.
In addition to our primary testbed, the iRoom, we have
deployed a number of interactive workspaces at Stanford
and at other institutions and evaluated their use in
educational settings. The core technologies in these
spaces are built around our software infrastructure,
iROS, which provides a suite of tools for integration
and interaction.",
acknowledgement = ack-nhfb,
pdfpages = "30",
}
@TechReport{and:2005:SBX,
author = "Jan Chong",
title = "Social Behaviors on {XP} Teams and non-{XP} teams: a
Comparative Study",
type = "Technical Report",
number = "CSTR 2005-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "15",
month = mar,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-01.pdf",
abstract = "This is an ethnographic study of two software
development teams within the same organization, one
which utilizes the Extreme Programming (XP) methodology
and one which does not. This study compares the work
routines and work practices of the software developers
on the XP team and the non-XP team. Observed behavior
suggests that certain features of the XP methodology
lead to greater uniformity in work routine and work
practice across individual team members. The data also
suggest that the XP methodology makes awareness
development and maintenance less effortful on a
software development team.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Ng:2005:LFP,
author = "Ren Ng and Marc Levoy and Mathieu Br{\'e}dif and Gene
Duval and Mark Horowitz and Pat Hanrahan",
title = "Light Field Photography with a Hand-Held Plenoptic
Camera",
type = "Technical Report",
number = "CSTR 2005-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
day = "20",
month = apr,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/lfcamera/",
abstract = "This paper presents a camera that samples the 4D light
field on its sensor in a single photographic exposure.
This is achieved by inserting a microlens array between
the sensor and main lens, creating a plenoptic camera.
Each microlens measures not just the total amount of
light deposited at that location, but how much light
arrives along each ray. By re-sorting the measured rays
of light to where they would have terminated in
slightly different, synthetic cameras, we can compute
sharp photographs focused at different depths. We show
that a linear increase in the resolution of images
under each microlens results in a linear increase in
the sharpness of the refocused photographs. This
property allows us to extend the depth of field of the
camera without reducing the aperture, enabling shorter
exposures and lower image noise. Especially in the
macrophotography regime, we demonstrate that we can
also compute synthetic photographs from a range of
different viewpoints. These capabilities argue for a
different strategy in designing photographic imaging
systems.\par
To the photographer, the plenoptic camera operates
exactly like an ordinary hand-held camera. We have used
our prototype to take hundreds of light field
photographs, and we present examples of portraits,
high-speed action and macro close-ups.",
acknowledgement = ack-nhfb,
keywords = "Digital photography; light field; microlens array;
refocusing; synthetic photography",
pdfpages = "11",
}
@TechReport{Pauly:2005:EBS,
author = "Mark Pauly and Niloy J. Mitra and Joachim Giesen and
Leonidas Guibas and Markus Gross",
title = "Example-Based {3D} Scan Completion",
type = "Technical Report",
number = "CSTR 2005-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "29",
month = apr,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-03.pdf",
abstract = "Optical acquisition devices often produce noisy and
incomplete data sets, due to occlusion, unfavorable
surface reflectance properties, or geometric
restrictions in the scanner setup. We present a novel
approach for obtaining a complete and consistent 3D
model representation from such incomplete surface
scans, using a database of 3D shapes to provide
geometric priors for regions of missing data. Our
method retrieves suitable context models from the
database, warps the retrieved models to conform with
the input data, and consistently blends the warped
models to obtain the final consolidated 3D shape. We
define a shape matching penalty function and
corresponding optimization scheme for computing the
non-rigid alignment of the context models with the
input data. This allows a quantitative evaluation and
comparison of the quality of the shape extrapolation
provided by each model. Our algorithms are explicitly
designed to accommodate uncertain data and can thus be
applied directly to raw scanner output. We show on a
variety of real data sets how consistent models can be
obtained from highly incomplete input. The information
gained during the shape completion process can be
utilized for future scans, thus continuously
simplifying the creation of complex 3D models.",
acknowledgement = ack-nhfb,
keywords = "3D acquisition; hole filling; non-rigid alignment;
shape completion; surface reconstruction",
}
@TechReport{Cadar:2005:EGT,
author = "Cristian Cadar and Dawson Engler",
title = "Execution Generated Test Cases: How to Make Systems
Code Crash Itself",
type = "Technical Report",
number = "CSTR 2005-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
day = "25",
month = mar,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-04.pdf",
abstract = "This paper presents a technique that uses code to
automatically generate its own test cases at run-time
by using a combination of symbolic and concrete (i.e.,
regular) execution. The input values to a program (or
software component) provide the standard interface of
any testing framework with the program it is testing,
and generating input values that will explore all the
``interesting'' behavior in the tested program remains
an important open problem in software testing research.
Our approach works by turning the problem on its head:
we lazily generate, from within the program itself, the
input values to the program (and values derived from
input values) as needed. We applied the technique to
real code and found numerous corner-case errors ranging
from simple memory overflows and infinite loops to
subtle issues in the interpretation of language
standards.",
acknowledgement = ack-nhfb,
pdfpages = "14",
}
@TechReport{Houston:2005:HFB,
author = "Mike Houston and Arcot Preetham and Mark Segal",
title = "A Hardware {F}-Buffer Implementation",
type = "Technical Report",
number = "CSTR 2005-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
day = "11",
month = apr,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-05.pdf",
abstract = "This paper describes the hardware F-Buffer
implementation featured in the latest ATI graphics
processors. We discuss the implementation choices made
in each chip and the various implementation challenges
faced like overflow handling. The F-Buffer was
originally intended as a solution for multi-pass
shading. We demonstrate this functionality, comparing
it to traditional multi-pass rendering techniques, and
show performance results. Given hardware F-Buffer
support, we describe extended uses like order
independent blending. We also show how a future
F-Buffer implementation might be extended to allow more
advanced operations like data filtering.",
acknowledgement = ack-nhfb,
pdfpages = "6",
}
@TechReport{Hartmann:2005:DTI,
author = "Bj{\"o}rn Hartmann and Scott R. Klemmer and Michael
Bernstein",
title = "{d.tools}: Integrated Prototyping for Physical
Interaction Design",
type = "Technical Report",
number = "CSTR 2005-06",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "22",
month = sep,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-06.pdf",
abstract = "Designers tasked with imagining future information
appliances currently employ separate tools for rapidly
prototyping the form (the atoms) and the interaction
model (the bits) because integrated prototyping of bits
and atoms requires resources and knowledge outside the
reach of design generalists. Based on interviews with
product designers, we created d.tools, a system
enabling non-programmers to prototype the bits and the
atoms of physical user interfaces in concert. d.tools
lowers the threshold to prototyping functional physical
interfaces through plug-and-play hardware that is
closely coupled with a visual authoring environment. We
evaluated the d.tools use threshold through a first-use
study with thirteen participants; the study showed that
the tool is accessible and encourages reflective design
practice. We tested the d.tools range of design support
by recreating existing research and commercial devices;
this demonstrated that the visual language was
sufficiently expressive for existing and emerging
real-world designs.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Piper:2005:SCT,
author = "Anne Marie Piper and Eileen O'Brien and Meredith
{Ringel Morris} and Terry Winograd",
title = "{SIDES}: a Cooperative Tabletop Computer Game for
Social Skills Development",
type = "Technical Report",
number = "CSTR 2005-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "??",
day = "22",
month = sep,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-07.pdf",
abstract = "This paper presents a design case study of SIDES:
Shared Interfaces to Develop Effective Social Skills.
SIDES is a tool designed to help adolescents in social
group therapy, specifically individuals with Asperger's
Syndrome, practice effective group work skills using a
four-player cooperative computer game that runs on
tabletop technology. We present the design process and
evaluation of SIDES conducted over a period of six
months with a middle school social group therapy class.
Our findings indicate that tabletop computer games
provide a motivating experience to help our target
audience learn effective group work skills in a
supportive environment.",
acknowledgement = ack-nhfb,
}
@TechReport{RingelMorris:2005:SCL,
author = "Meredith {Ringel Morris} and Anne Marie Piper and
Anthony Cassanego and Terry Winograd",
title = "Supporting Cooperative Language Learning: Issues in
Interface Design for an Interactive Table",
type = "Technical Report",
number = "CSTR 2005-08",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
day = "22",
month = sep,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-08.pdf",
abstract = "The recent introduction of computationally-enhanced
tables that support simultaneous, multi-user input has
important implications for co-located, face-to-face
activity. Educational applications particularly stand
to benefit from this new technology, which can combine
the benefits of small group work with the enhancements
offered by digital media. In this paper, we explore how
the unique affordances of interactive tables provide a
match for the needs of foreign language education, and
how the design of tabletop software can be subtly
altered to encourage desired educational outcomes. We
present three prototype applications, and explore four
design variations (feedback modality, feedback privacy,
spatial configuration, and interaction visualizations)
to assess their impact on student participation and
self-assessment. We present observations of the use of
our prototypes in two settings: (1) a controlled
laboratory study and (2) authentic use by students as
part of a language course at our university, and
discuss our preliminary findings and avenues for future
exploration.",
acknowledgement = ack-nhfb,
keywords = "co-located groupware; computer- supported cooperative
learning; computer-supported cooperative work;
Educational interfaces; tabletop interfaces",
pdfpages = "9",
}
@TechReport{Wang:2005:MUP,
author = "QianYing Wang and Tony Hsieh and Meredith {Ringel
Morris} and Andreas Paepcke",
title = "Multi-User Piles Across Space",
type = "Technical Report",
number = "CSTR 2005-09",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "22",
month = sep,
year = "2005",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2005-09.pdf",
abstract = "We introduce Multi-User Piles Across Space, a
technique that allows co-located individuals with PDAs
to share and organize information items (e.g., photos,
text, sound clips, etc.) by placing these items in
shared, imaginary off-screen piles. This technique
relies on human capacities to remember spatial layouts,
and allows small co-located groups with limited screen
real estate to collaboratively manage information. Each
participant can use their PDA's stylus to flick
information to shared off-screen piles and view their
contents. Connections are implemented through ad hoc
WiFi. Optimistic concurrency control provides long term
data consistency. We also describe an extension that
allows PDA owners to transfer information items and
piles to and from a tabletop display",
acknowledgement = ack-nhfb,
keywords = "information management; information sharing; mobile
computing; PDA; piles; screen real-estate",
pdfpages = "5",
}
@TechReport{Cadar:2006:ESA,
author = "Cristian Cadar and Paul Twohey and Vijay Ganesh and
Dawson Engler",
title = "{EXE}: a System for Automatically Generating Inputs of
Death Using Symbolic Execution",
type = "Technical Report",
number = "CSTR 2006-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "20",
day = "1",
month = feb,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-01.pdf",
abstract = "Systems code defines an error-prone execution state
space built from deeply nested conditionals and
function call chains, massive amounts of code, and
enthusiastic use of casting and pointer operations.
Such code is hard to test and difficult to inspect, yet
a single error can crash a machine or form the basis of
a security breach.\par
This paper presents EXE, a system designed to
automatically find bugs in such code using symbolic
execution. At a high level, rather than running the
code on manually-constructed concrete input, EXE
instead runs it on symbolic input that is initially
allowed to be ``anything.'' As input (and derived)
values are observed through conditional statements and
other checks, symbolic constraints are incrementally
added to those values. EXE then generates concrete test
cases by solving these symbolic constraints for
concrete values with bit-level precision.\par
EXE has several novel features. First, it implements a
complete, precise symbolic pointer theory that
correctly handles both pointer arithmetic expressions
and reads and writes to memory locations referenced by
pointers with symbolic values. Second, it handles all
of the C language with bit-level precision. Third, EXE
greatly amplifies the effect of running a single code
path since it uses a powerful constraint solver to
reason about all possible values that the path could be
run with, rather than a single set of concrete values
from an individual test case.\par
EXE has been successfully applied to applications
ranging from running the Linux kernel symbolically in
order to find numerous security holes in the ext2,
ext3, and JFS file systems [26] to detecting invalid
memory reads and writes in a DHCPD server
implementation to finding buffer overflow attacks in
the BSD and Linux packet filter implementations.",
acknowledgement = ack-nhfb,
pdfpages = "20",
}
@TechReport{Hartmann:2006:RPP,
author = "Bj{\"o}rn Hartmann and Scott R. Klemmer and Michael
Bernstein and Leith Abdulla and Brandon Burr and Avi
Robinson-Mosher and Jennifer Gee",
title = "Reflective physical prototyping through integrated
design, test, and analysis",
type = "Technical Report",
number = "CSTR 2006-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "7",
month = apr,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-02.pdf",
abstract = "Prototyping is the pivotal activity that structures
innovation, collaboration, and creativity in design.
Prototypes embody design hypotheses and enable
designers to test them. Framing design as a
thinking-by-doing activity foregrounds iteration as a
central concern. This paper presents d.tools, a toolkit
that embodies an iterative-design-centered approach to
prototyping information appliances. This work offers
contributions in three areas. First, d.tools introduces
a statechart-based visual design tool that provides a
low threshold for early-stage prototyping, extensible
through code for higher-fidelity prototypes. Second,
our research introduces three important types of
hardware extensibility --- at the hardware-to-PC
interface, the intra-hardware communication level, and
the circuit level. Third, d.tools integrates design,
test, and analysis of information appliances. We have
evaluated d.tools through three studies: a laboratory
study with thirteen participants; rebuilding prototypes
of existing and emerging devices; and by observing
seven student teams who built prototypes with
d.tools.",
acknowledgement = ack-nhfb,
keywords = "design thinking; design tools; information appliances;
integrating physical and digital; prototyping;
Toolkits",
pdfpages = "10",
}
@TechReport{Yeh:2006:IGP,
author = "Ron B. Yeh and Joel Brandt and Jonas Boli and Scott R.
Klemmer",
title = "Interactive Gigapixel Prints: Large, Paper-Based
Interfaces for Visual Context and Collaboration",
type = "Technical Report",
number = "CSTR 2006-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "7",
month = apr,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-03.pdf",
abstract = "For centuries, large paper information graphics such
as maps have been important cognitive artifacts in
navigation, architecture, design, engineering, and
scientific work. Paper-based work practices leverage
the high resolution, low cost, reliability, mobility,
and flexibility of paper --- yet lack the interactivity
afforded by digital technologies. This paper introduces
Interactive Gigapixel Prints ( GIGA prints), computer
controlled large-scale paper displays that afford
direct pen-based input. These paper prints are
augmented with digital displays, integrating the high
spatial resolution but low temporal resolution of
wide-format printing with the lower spatial resolution
but higher temporal resolution of digital displays.
Using large paper displays and digital devices together
as an ensemble leverages the relative benefits of each
medium; GIGA prints afford both ambient awareness and
simultaneous viewing and input from multiple users. The
pen-based interaction includes selection, progressive
information disclosure, filtering, and annotation. This
paper contributes a design space for integrated paper
and digital interactions, an infrastructure for
creating interactive ensembles of large paper displays
and digital devices, and four applications built using
our infrastructure, each illustrating points in the
design space.",
acknowledgement = ack-nhfb,
keywords = "augmented paper; device ensembles; large displays",
pdfpages = "10",
}
@TechReport{Morris:2006:HRI,
author = "Dan Morris and Neel Joshi",
title = "Hybrid Rendering for Interactive Virtual Scenes",
type = "Technical Report",
number = "CSTR 2006-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "23",
month = may,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-04.pdf",
abstract = "Interactive virtual environments used in conjunction
with haptic displays are often static-viewpoint scenes
that contain a mixture of static and dynamic virtual
objects. The immersive realism of these environments is
often limited by the graphical rendering system,
typically OpenGL or Direct3D. In order to present more
realistic scenes for haptic interaction without
requiring additional modeling complexity, we have
developed a technique for co-locating a pre-rendered,
raytraced scene with objects rendered graphically and
haptically in real-time. We describe the
depth-buffering and perspective techniques that were
necessary to achieve colocation among representations,
and we demonstrate real-time haptic interaction with a
scene rendered using photon-mapping.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{RingelMorris:2006:SEI,
author = "Meredith {Ringel Morris}",
title = "Supporting Effective Interaction with Tabletop
Groupware",
type = "Technical Report",
number = "CSTR 2006-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "xviii + 233",
day = "7",
month = apr,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-05.pdf",
abstract = "We encounter tables in a variety of situations in our
everyday lives --- at work, at school, at home, and in
restaurants, libraries, and other public venues. The
ubiquity of this furniture results from the utility of
its affordances: tables' horizontal surfaces afford the
placement of objects, and their large surface area
affords the spreading, piling, and organization of
these items; chairs afford sitting and relaxing, making
work around tables leisurely and comfortable; and,
perhaps most importantly, tables afford face-to-face
collaboration amongst a small group of co-located
individuals.\par
Enhancing traditional tables by adding computational
functionality combines the collaborative and
organizational benefits of horizontal surfaces, as well
as their ability to hold tangible interaction objects,
with the power and adaptability of digital technology,
including the ability to archive, search, and share
digital documents and the ability to quickly access
related information. Combining the productivity
benefits of computing with the social benefits of
around-the-table interaction has value for many
commonplace activities, such as business, education,
and entertainment. The recent introduction of hardware
that detects touch input from multiple, simultaneous
users has made computationally-augmented tables, or
``interactive tables,'' practical.\par
This dissertation contributes a sequence of novel
prototypes that explore the properties of group
interaction with interactive tables. It presents the
results of user experiments on the ways people share
information and control in the unique setting of
interactive face-to-face shared computer use. On the
basis of these it proposes design principles that will
produce tabletop groupware that better facilitates
human-computer interaction and cooperative processes.
These principles relate to appropriate uses for
different regions of the table's surface, techniques
for reducing visual clutter, the utility and visibility
of access permissions for virtual objects, methods for
influencing users' social interactions via tabletop
interface design, consideration of how tabletop
interface design influences and facilitates different
work styles, and appropriate usability metrics for
evaluating this class of software.\par
Considering tabletop design holistically, including
both the human-computer and human-human interactions
that take place during tabletop activities, can lead to
the development of more usable and useful tabletop
groupware.",
acknowledgement = ack-nhfb,
pdfpages = "251",
remark = "This is the author's Ph.D. dissertation.",
}
@TechReport{and:2006:ADS,
author = "Dan Morris",
title = "Algorithms and Data Structures for Haptic Rendering:
Curve Constraints, Distance Maps, and Data Logging",
type = "Technical Report",
number = "CSTR 2006-06",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
day = "11",
month = jun,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-06.pdf",
abstract = "In this paper, we describe three novel data processing
techniques used for haptic rendering and
simulation:\par
* We present an approach to constraining a haptic
device to travel along a discretely-sampled
curve.\par
* We present an approach to generating distance maps
from surface meshes using axis-aligned bounding box
(AABB) trees. Our method exploits spatial coherence
among neighboring points.\par
* We present a data structure that allows thread-safe,
lock-free streaming of data from a high-priority haptic
rendering thread to a lower-priority data-logging
thread.\par
We provide performance metrics and example applications
for each of these techniques. C++-style pseudocode is
provided wherever possible and is used as the basis for
presenting our approaches. Links to actual
implementations are also provided for each section.",
acknowledgement = ack-nhfb,
keywords = "curve constraints; distance maps; flood-filling;
haptic rendering; Haptics; kd-tree; synchronization;
threads; virtual fixtures; voxelization",
pdfpages = "12",
}
@TechReport{and:2006:APC,
author = "Dan Morris",
title = "Automatic Preparation, Calibration, and Simulation of
Deformable Objects",
type = "Technical Report",
number = "CSTR 2006-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
day = "24",
month = jul,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-07.pdf",
abstract = "Many simulation environments --- particularly those
intended for medical simulation --- require solid
objects to deform at interactive rates, with
deformation properties that correspond to real
materials. Furthermore, new objects may be created
frequently (for example, each time a new patient's data
is processed), prohibiting manual intervention in the
model preparation process. This paper provides a
pipeline for rapid preparation of deformable objects
with no manual intervention, specifically focusing on
mesh generation (preparing solid meshes from surface
models), automated calibration of models to finite
element reference analyses (including a novel approach
to reducing the complexity of calibrating
nonhomogeneous objects), and automated skinning of
meshes for interactive simulation.",
acknowledgement = ack-nhfb,
pdfpages = "15",
}
@TechReport{and:2006:RCE,
author = "Manu Kumar",
title = "Reducing the Cost of Eye Tracking Systems",
type = "Technical Report",
number = "CSTR 2006-08",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "4",
month = apr,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-08.pdf",
abstract = "Tracking the user's eye-gaze information has been
technologically possible for several decades. However,
systems that track eye-gaze are still very expensive.
The exorbitant price tag on commercial systems has
resulted in limited use of eye-tracking technology. In
this paper we examine the factors which contribute to
the high costs of eye-tracking systems. We then propose
several techniques and strategies which can be used to
reduce the cost of these systems, ultimately resulting
in more widespread use of the technology.",
acknowledgement = ack-nhfb,
keywords = "Corneal Reflection Eye Tracker; Eye Tracking; Low-Cost
Eye-Tracking",
pdfpages = "4",
}
@TechReport{Lee:2006:EAI,
author = "Brian Lee and Heidy Maldonado and Scott R. Klemmer",
title = "Evaluating Augmented Idea Logs for Design Education",
type = "Technical Report",
number = "CSTR 2006-09",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "28",
month = may,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-09.pdf",
abstract = "Design students use a variety of physical and digital
content in the course of their studies. Augmented paper
interactions promise to address this tension, yet there
have been few real-world evaluations of these systems.
In this paper, we present results from the first
longitudinal study of augmented paper interactions for
student design teams. We describe our experiences with
developing and deploying the iDeas learning ecology, a
system that integrates digital pens and cameras into
design practice. Across two quarter-long studies,
fifty-eight design students used iDeas, authoring over
4,000 pages of content in the course of their
classwork. We report on their design habits, the when,
what and how of their notebook usage, and pinpoint
further avenues of study, including device ensembles.
Through observation and analysis, we discovered that
integrated paper and digital interactions enable new
practices, including the ability to instrument and
study design activity itself. We then observe
limitations of current form factor and maintenance that
inhibit longitudinal use. We conclude by identifying
guidelines for development and potential directions for
future research into hybrid technology systems for
creative work.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Lee:2006:AID,
author = "Brian Lee and Scott R. Klemmer and Ronen Brafman",
title = "Adaptive Interfaces for Declarative Presentation of
Heterogeneous Content",
type = "Technical Report",
number = "CSTR 2006-10",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "29",
month = sep,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-10.pdf",
abstract = "Visibility of work practice is important because it
enables peripheral participation of and facilitates
coordination between colleagues. Moving activities from
the physical world onto the digital desktop has
diminished visibility by consigning the artifacts of
work practice to the computer screen; the serendipity
of stumbling across physical artifacts is lost. One
method of reintroducing visibility is the proactive
display of colleagues' digital work artifacts. This
paper introduces an adaptive content presentation
technique designed to improve the visibility of content
for both ambient awareness and interactive browsing. In
this work, we define the information presentation
problem to be dynamically focusing user attention to a
maximally useful subset of available information. Our
technique takes a decision-theoretic approach to
interface generation, using content metadata as inputs
to our algorithm. The data view is generated
dynamically, based on high-level attributes of the
current state and a declarative relationship between
the user's input and the resulting view. We have
evaluated the technical efficacy of this algorithm by
implementing it in the context of the ButterflyNet
browser",
acknowledgement = ack-nhfb,
keywords = "Adaptive interfaces; awareness; decision theory;
model-based UIs",
pdfpages = "10",
}
@TechReport{Lee:2006:LSA,
author = "Brian Lee and Heidy Maldonado and Scott R. Klemmer and
Isabelle Kim and Paz Hilfinger-Pardo",
title = "Longitudinal Studies of Augmented Notebook Usage
Informing the Design of Sharing Mechanisms",
type = "Technical Report",
number = "CSTR 2006-11",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
day = "29",
month = sep,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-11.pdf",
abstract = "Designers today use a variety of artifacts --- both
physical and digital --- in the course of documenting
their work. A resulting tension is that physical and
digital media have significantly different affordances
and organizing metaphors. Augmented paper interactions
promise to mitigate some of this tension, yet there
have been few real-world evaluations of these systems.
To investigate their potential value for de sign, we
studied two longitudinal deployments of augmented paper
interactions with student design teams. Across two
ten-week-long studies, 56 design students used the
system, authoring over 4,000 pages of content in the
course of their class work; this paper reports on their
design habits and adoption patterns. We discuss the
salient benefits (integrated digital repository for
sketches and photographs), shortcomings that led to
research insights (support for sharing physical and
digital content), and barriers that persisted across
both studies (perceived and actual costs of adoption
discourage use).",
acknowledgement = ack-nhfb,
keywords = "augmented paper; Design education; Idea Log",
pdfpages = "11",
}
@TechReport{Ju:2006:REI,
author = "Wendy Ju and Brian Lee and Scott R. Klemmer",
title = "{Range}: Exploring Implicit Interaction through
Electronic Whiteboard Design",
type = "Technical Report",
number = "CSTR 2006-12",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "29",
month = sep,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-12.pdf",
abstract = "An important challenge in designing ubiquitous
computing experiences is negotiating the transition
between explicit and implicit interaction, such as how
and when to provide users with notifications. While the
paradigm of implicit interaction has important
benefits, it is also susceptible to difficulties with
hidden modes, unexpected action, and misunderstood
intent. To address these issues, this work presents a
framework for implicit interaction and applies it to
the design of an interactive whiteboard application
called Range. Range is a public interactive whiteboard
designed to support collocated, ad-hoc meetings. It
employs proximity sensing capability to proactively
transition between display and authoring modes, clear
space for writing, and cluster ink strokes. We show how
the implicit interaction techniques of user
presentation (how users implicitly indicate what they
are doing), system presentation (how systems indicate
what they are doing), and override (how users can
interrupt or stop a proactive system action) can
prevent, mitigate, and correct errors in the
whiteboard's proactive behaviors. These techniques can
be generalized to improve the designs of a wide array
of ubiquitous computing experiences.",
acknowledgement = ack-nhfb,
keywords = "ambient proactive; foreground\slash background;
Implicit interaction",
pdfpages = "10",
}
@TechReport{Morris:2006:VSB,
author = "Dan Morris and Christopher Sewell and Federico
Barbagli and Nikolas Blevins and Sabine Girod and
Kenneth Salisbury",
title = "Visuohaptic Simulation of Bone Surgery",
type = "Technical Report",
number = "CSTR 2006-13",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
day = "7",
month = nov,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-13.pdf",
abstract = "We present techniques for the visual and haptic
simulation of bone surgery, with a specific focus on
procedures involving the temporal bone and the
mandible. We discuss our approaches to graphic and
haptic rendering and interactive modification of
volumetric data, specifically focusing on generating
force-feedback effects that are relevant to bone
drilling. We then discuss how our rendering primitives
and simulation architecture can be used to build
surgical training techniques that are not available in
traditional cadaver-based training labs, offering new
possibilities for surgical education. In particular, we
discuss the automatic computation of performance
metrics that can provide real-time feedback about a
trainee's performance in our simulator. We also present
results from an experimental study evaluating the
construct validity of our simulation and the validity
of our performance metrics.",
acknowledgement = ack-nhfb,
keywords = "haptics; input devices; simulation; simulator
evaluation, simulator validity; surgery; Virtual
reality; volume visualization",
pdfpages = "12",
remark = "This technical report is a more detailed version of
the following paper: Morris D, Sewell C, Barbagli F,
Blevins N, Girod S, Salisbury K. Visuohaptic Simulation
of Bone Surgery for Training and Evaluation. IEEE
Computer Graphics and Applications, Vol. {\bf 26}, No.
4, November 2006, p48--57.",
}
@TechReport{Hartmann:2006:HMG,
author = "Bj{\"o}rn Hartmann and Scott Doorley and Scott R.
Klemmer",
title = "Hacking, Mashing, Gluing: a Study of Opportunistic
Design",
type = "Technical Report",
number = "CSTR 2006-14",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "29",
month = sep,
year = "2006",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2006-14.pdf",
abstract = "This paper is about opportunistic practices in
interactive system design: about copying and pasting
source code from public online forums into one's own
scripts; about taking apart consumer electronics and
reappropriating their components for design prototypes;
about ``Frankensteining'' software and hardware
artifacts together by joining them with physical and
digital hot glue and duct tape. It is about the hacks
and prototypes of lowbrow experimentation, as opposed
to highbrow design and engineering from the ground up.
We combine these opportunistic practices under the
moniker of ``mash-up design.'' This paper presents
results from an interview study with 14 professional
and hobbyist ``mashers'' from three different design
disciplines: Web 2.0 programmers, hardware hackers, and
designers of interactive ubicomp systems. The paper
analyzes commonalities and distills themes in
opportunistic design through three lenses: first, the
way mash-ups modify and combine pre-existing elements;
second, the unique characteristics of opportunistic
design as an activity; and third, looking at mash-ups
as novel kinds of artifacts.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Brandt:2007:TLL,
author = "Joel Brandt and Noah Weiss and Scott R. Klemmer",
title = "{txt 4 l8r}: Lowering the Burden for Diary Studies
Under Mobile Conditions",
type = "Technical Report",
number = "CSTR 2007-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "6",
day = "12",
month = jan,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-01.pdf",
abstract = "We present and evaluate a new technique for performing
diary studies under mobile or active conditions. Diary
studies play an important role as a means for
ecologically valid participant data capture.
Unfortunately, when participants are asked to capture
data while mobile or active, they are often unwilling
or unable to invest time in thorough, reflective
entries. Ultimately, this leads to lowered entry
quality and quantity. The technique presented here
suggests the capture of only small snippets of
information in the field. These snippets then serve as
prompts for participants when completing full diary
entries at a convenient time. We describe how our
system automates collection of snippets via SMS (text),
MMS (picture) and voicemail messages and later presents
these snippets for full entry elicitation. We then
present results from a preliminary evaluation of this
technique.",
acknowledgement = ack-nhfb,
keywords = "Diary study; field work; mobile computing; mobile data
capture; text messaging",
pdfpages = "6",
}
@TechReport{Kumar:2007:ESA,
author = "Manu Kumar and Andreas Paepcke and Terry Winograd",
title = "{EyeExpos{\'e}}: Switching Applications with Your
Eyes",
type = "Technical Report",
number = "CSTR 2007-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "15",
month = feb,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-02.pdf",
abstract = "We present a technique for switching between active
applications by using a combination of keyboard (or any
other trigger) and eye gaze. In particular, our
approach combines the use of a two-dimensional layout
visualization for showing the user all open
applications and the use of eye gaze tracking for
selecting the desired window. Our studies show that
this combination of gaze and the visual representation
of active tasks allows users to switch between
applications quickly and naturally. Users strongly
preferred this technique of switching between
applications compared to other alternatives.",
acknowledgement = ack-nhfb,
keywords = "application switching; eye tracking; gaze-enhanced
user interface design; task switching",
pdfpages = "7",
}
@TechReport{and:2007:GSD,
author = "Manu Kumar",
title = "{GUIDe} Saccade Detection and Smoothing Algorithm",
type = "Technical Report",
number = "CSTR 2007-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "2",
day = "15",
month = feb,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-03.pdf",
abstract = "Data from an eye tracker is noisy and includes jitter
due to errors in tracking and because of the physiology
of the eye. To smooth the data from the eye tracker, it
is necessary to determine whether the most recent data
point is the beginning of a saccade or whether it is an
aberration relative to the current fixation. Before
returning a data point, our algorithm looks at the
subsequent data point to make decisions about whether
the current data point was the beginning of a saccade
or an aberration, in which case it is adjusted.",
acknowledgement = ack-nhfb,
pdfpages = "2",
}
@TechReport{Ganesh:2007:CRM,
author = "Vijay Ganesh and Sergey Berezin and Cesare Tinelli and
David L. Dill",
title = "Combination Results for Many-Sorted Theories with
Overlapping Signatures",
type = "Technical Report",
number = "CSTR 2007-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "58",
day = "12",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-04.pdf",
abstract = "We present a combination result for many-sorted
first-order theories whose signatures may share common
symbols (i.e. overlapping or non-disjoint signatures),
extending the recent results by Ghilardi for the
unsorted case. Furthermore, we give practical
conditions un- der which the combination method becomes
a semi-decision procedure, and additional sufficient
conditions which turn it into a decision
procedure.\par
Several theories which are practically useful in formal
verification have overlapping signatures (e.g. linear
arithmetic and bit-vectors). We demonstrate how their
decision procedures can be combined using our results.
In addition, we obtain a many-sorted version of the
Nelson- Oppen method as a special case of our
combination result.",
acknowledgement = ack-nhfb,
pdfpages = "58",
remark = "Report is dated 21 April 2004 (not 2007!)",
}
@TechReport{Kumar:2007:RSS,
author = "Manu Kumar and Tal Garfinkel and Dan Boneh and Terry
Winograd",
title = "Reducing Shoulder-surfing by Using Gaze-based Password
Entry",
type = "Technical Report",
number = "CSTR 2007-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "19",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-05.pdf",
abstract = "Shoulder-surfing --- using direct observation
techniques, such as looking over someone's shoulder, to
get passwords, PINs and other sensitive personal
information --- is a problem that has been difficult to
overcome. When a user enters information using a
keyboard, mouse, touch screen or any traditional input
device, a malicious observer may be able to acquire the
user's password credentials. We present EyePassword, a
system that mitigates the issues of shoulder surfing
via a novel approach to user input. With EyePassword, a
user enters sensitive input (password, PIN, etc.) by
selecting from an on-screen keyboard using only the
orientation of their pupils (i.e. the position of their
gaze on screen), making eavesdropping by a malicious
observer largely impractical. We present a number of
design choices and discuss their effect on usability
and security. We conducted user studies to evaluate the
speed, accuracy and user acceptance of our approach.
Our results demonstrate that gaze-based password entry
requires marginal additional time over using a
keyboard, error rates are similar to those of using a
keyboard and subjects preferred the gaze-based password
entry approach over traditional methods.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{Ganesh:2007:DPF,
author = "Vijay Ganesh and Sergey Berezin and David L. Dill",
title = "A Decision Procedure for Fixed-Width Bit-Vectors",
type = "Technical Report",
number = "CSTR 2007-06",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "27",
day = "24",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-06.pdf",
abstract = "We report the design, implementation and performance
of an efficient decision procedure for the equational
theory of fixed-width bit-vectors. The input language
supports word-level bit-vector operations
(concatenation and extraction), bit-vector arithmetic
operations (addition, subtraction and constant
multiplication), bitwise boolean operations
(conjunction, disjunction, negation, bitwise XOR,
etc.), multiplexors (if-then-else operator) and
predicates like comparators (``less than''). Other
common functions such as right shift, sign/zero
extension can be easily supported through suitable
translation.\par
The decision procedure is implemented as part of the
CVC Lite tool |IBB04|, a theorem prover based on
combination of decision procedures in the Nelson-Oppen
style. The design is novel, the decision procedure
complete, and the implementation is efficient for a
large class of practical examples. Our implementation
also supports concrete counterexample generation.",
acknowledgement = ack-nhfb,
pdfpages = "27",
}
@TechReport{Berezin:2007:OPP,
author = "Sergey Berezin and Vijay Ganesh and David L. Dill",
title = "Online Proof-Producing Decision Procedure for
Mixed-Integer Linear Arithmetic",
type = "Technical Report",
number = "CSTR 2007-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
day = "24",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-07.pdf",
abstract = "Efficient decision procedures for arithmetic play a
very important role in formal verification. In
practical examples, however, arithmetic constraints are
often mixed with constraints from other theories like
the theory of arrays, Boolean satisfiability (SAT),
bit-vectors, etc. Therefore, decision procedures for
arithmetic are especially useful in combination with
other decision procedures. The framework for such a
combination is implemented at Stanford in the tool
called Cooperating Validity Checker (CVC)
[SBD02].\par
This work augments CVC with a decision procedure for
the theory of mixed integer linear arithmetic based on
the Omega-test [Pug91] extended to be online and proof
producing. These extensions are the most important and
challenging part of the work, and are necessary to make
the combination efficient in practice.",
acknowledgement = ack-nhfb,
pdfpages = "16",
}
@TechReport{Ganesh:2007:SS,
author = "Vijay Ganesh and Hassan Saidi and Natarajan Shankar",
title = "Slicing {SAL}",
type = "Technical Report",
number = "CSTR 2007-08",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "16",
day = "24",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "The report is dated 7 October 1999.",
URL = "https://hci.stanford.edu/cstr/reports/2007-08.pdf",
abstract = "Model checking has been successfully applied to verity
finite-state systems albeit ones with small
state-space. But most interesting systems have very
large or infinite state-spaces. Automatic Abstraction
techniques can help alleviate the state-space explosion
problem to some extent. Another complementary approach
is the use of program slicing to automatically remove
portions of the input transition system irrelevant to
the property being verified. This may result in
state-space reduction. The reduced state system, if
finite, may then be more amenable to model
checking.\par
In this paper we discuss application of slicing to the
SAL intermediate language. SAL intermediate language
(or just SAL) is a concurrent language designed so that
popular programming languages can be converted to SAL
and whole set of Abstraction, Program Analysis, Theorem
Proving and Model Checking tools/techniques can be
combined and methodologies defined to verify large
state systems. We describe a novel algorithm for
slicing SAL and report on its implementation. It is one
of the few slicing algorithms which deal with
concurrency. We also discuss methodologies for
combining slicing and other techniques to enable
verification of larger state systems, use of theorem
proving techniques to refine slicing, and techniques to
convert temporal formulae into slicing criteria.",
acknowledgement = ack-nhfb,
pdfpages = "16",
}
@TechReport{Hartmann:2007:PSR,
author = "Bj{\"o}rn Hartmann and Leslie Wu and Kevin Collins and
Scott R. Klemmer",
title = "Programming by a Sample: Rapidly Prototyping Web
Applications with {d.mix}",
type = "Technical Report",
number = "CSTR 2007-09",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "30",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-09.pdf",
abstract = "As an increasing number of web sites provide APIs,
significant latent value for supporting developers' use
of these APIs lies in the site-service correspondence:
the site and its API offer complementary
representations of equivalent functionality. We
introduce d.mix, a tool that realizes this latent
value, lowering the threshold for creating web
mash-ups. With d.mix, users browse annotated web sites
and perform a parametric copy of elements of interest.
While a traditional copy contains web page elements, a
parametric copy performs proxy-based rewriting of pages
to select the underlying programmatic calls that yield
those elements. Developers can paste this code and
edit, execute, and share scripts on d.mix's wiki-based
authoring environment. This approach speeds the
creation of web applications while preserving the
flexibility and high ceiling of script-based
programming. An initial study with eight participants
found d.mix to enable rapid experimentation, and
suggested avenues for improving its annotation
mechanism.",
acknowledgement = ack-nhfb,
keywords = "mash-ups; programming by example modification;
prototyping; web services",
pdfpages = "10",
}
@TechReport{Yeh:2007:IDP,
author = "Ron B. Yeh and Scott R. Klemmer and Andreas Paepcke
and Marcello Bast{\'e}a-Forte and Joel Brandt and Jonas
Boli",
title = "Iterative Design of a Paper + Digital Toolkit:
Supporting Designing, Developing, and Debugging",
type = "Technical Report",
number = "CSTR 2007-10",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "30",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-10.pdf",
abstract = "With advances in digital pens, there has been recent
interest in supporting augmented paper in both research
and commercial applications. This paper introduces the
iterative design of a toolkit for event-driven
programming of augmented paper applications. We
evaluated the toolkit with 69 students (17 teams) in an
external university class, gathering feedback through
e-mail, in-person discussions, and analysis of 51,000
lines of source code produced by the teams. This paper
describes successes and challenges we discovered in
providing an event-driven architecture as the
programming model for paper interaction. Informed by
this evaluation, we extended the toolkit with visual
tools for designing, developing, and debugging, thereby
lowering the threshold for exploring paper UI designs,
providing informal techniques for specifying UI
layouts, and introducing visualizations for event
handlers and programming interfaces. These results have
implications beyond paper applications --- R3 takes
steps toward supporting programming by example
modification, exploring APIs, and improved
visualization of event flow.",
acknowledgement = ack-nhfb,
keywords = "augmented paper; design tools; device ensembles;
toolkits",
pdfpages = "10",
}
@TechReport{Kumar:2007:GES,
author = "Manu Kumar and Terry Winograd",
title = "Gaze-enhanced Scrolling Techniques",
type = "Technical Report",
number = "CSTR 2007-11",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "30",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-11.pdf",
abstract = "Scrolling is an inherent part of our everyday
computing experience. Contemporary scrolling techniques
rely on the explicit initiation of scrolling by the
user. However, the act of scrolling is tightly coupled
with the user's ability to absorb information via the
visual channel. The use of eye gaze information is
therefore a natural choice for enhancing scrolling
techniques. We present several gaze-enhanced scrolling
techniques for manual and automatic scrolling which use
gaze information as a primary input or as an augmented
input. We also introduce the use off-screen
gaze-actuated buttons for document navigation and
control.",
acknowledgement = ack-nhfb,
keywords = "Automatic Scrolling; Eye Tracking; Gaze-enhanced Page
Down; Gaze-enhanced Scrolling; Off-screen Targets; Page
Down; Scrolling",
pdfpages = "4",
}
@TechReport{Kumar:2007:IAG,
author = "Manu Kumar and Jeff Klingner and Rohan Puranik and
Terry Winograd and Andreas Paepcke",
title = "Improving the Accuracy of Gaze Input",
type = "Technical Report",
number = "CSTR 2007-12",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "30",
month = mar,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-12.pdf",
abstract = "Using gaze information as a form of input poses
challenges based on the nature of eye movements and how
we humans use our eyes in conjunction with other motor
actions. In this paper, we present three techniques for
improving the feasibility of using gaze as a form of
input. We first present a saccade detection and
smoothing algorithm that works on real-time streaming
gaze information. We then present a study which
explores some of the timing issues of using gaze in
conjunction with a trigger (key press or other motor
action) and propose a solution for resolving these
issues. Finally, we present the concept of Focus
Points, which makes it easier for users to focus their
gaze when using gaze-based interaction techniques.
Though these techniques were developed for improving
the performance of gaze-based pointing, their use is
applicable in general to using gaze as a practical form
of input.",
acknowledgement = ack-nhfb,
keywords = "Eye Tracking; Eye-hand coordination; Fixation
Smoothing; Focus Points.; Gaze Input; Gaze-enhanced
User Interface Design; GUIDe",
pdfpages = "4",
}
@TechReport{Brandt:2007:DLA,
author = "Joel Brandt and Noah Weiss and Scott R. Klemmer",
title = "Designing for Limited Attention",
type = "Technical Report",
number = "CSTR 2007-13",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
day = "3",
month = oct,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-13.pdf",
abstract = "Not all time is created equal: in the course of a day,
the resources at hand vary dramatically. Activities
often span multiple differing use contexts --- riding a
train, talking with a colleague, attending a meeting,
engaging in focused work at the desktop --- and these
different contexts imply different constraints on
action. To work effectively within these constraints,
people often divide tasks into multiple phases. For
example, jotting a re- minder of a future task has
little intrinsic value; it serves to distribute one's
cognition in service of structuring future action.
Similarly, the value of preparing a route map lies in
its affordance for rapid consultation while traveling.
This case study draws on interviews with developers and
on our own research to present considerations for
designing interactions spanning times of varying
attention.",
acknowledgement = ack-nhfb,
keywords = "attention; distributed cognition; mobile computing",
pdfpages = "8",
}
@TechReport{and:2007:SVI,
author = "Leslie Wu",
title = "Social Values at the Interface: Toward {``Just''}
Human-Computer Ranking Designs at Scale",
type = "Technical Report",
number = "CSTR 2007-14",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "3",
day = "3",
month = oct,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-14.pdf",
abstract = "In the design of human-computer ranking systems for
the adaptive display of information, designers often
define a domain-specific scoring function which maps
items such as people or information search results to
numeric scores. Classic ranking systems typically
display these items in a linear fashion, sorted by
score. There are shortcomings to this approach: such
ranking systems do not provide a diversity of results,
and in aggregate the distribution of collective user
attention is biased by the users' trust in the quality
of these orderings. Furthermore, ranking systems based
on sorted orders embody a property of chaotic systems,
namely that small perturbations in the input --- the
underlying scoring functions --- may have large effects
in the output --- the distribution of collective user
attention. Thus, we propose an alternative
human-computer ranking system called donkey sort, which
strikes a balance between complete order and uniform
randomness, performing probability sampling of the
display permutations found in a Latin square design",
acknowledgement = ack-nhfb,
keywords = "ranking; sorting; values",
pdfpages = "3",
}
@TechReport{Wu:2007:RWT,
author = "Leslie Wu and Joel Brandt and Scott Klemmer",
title = "Remixing the {Web}: Tailoring Applications using
Programmable Proxies inside {Web} Browsers",
type = "Technical Report",
number = "CSTR 2007-15",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "3",
month = oct,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-15.pdf",
abstract = "This note reports on the motivation for and design of
an infrastructure for presenting tailored web
applications as services. We conducted a diary study of
mobile information needs, finding that a significant
majority of participants' desired information was
available on the web, just not in a mobile-friendly
format. This suggests there is latent value in
lightweight tools that tailor web applications for
mobile use. Browser extensions have emerged as perhaps
the most lightweight and intuitive method for enabling
end-users to tailor web applications, likely because
browser-side approaches work fluidly with the logged-in
web and because it most effectively leverages a diverse
ecology of existing web development tools. However,
client-side extensions are, well, client-side ---
inhibiting their portability, especially to the
stripped-down browsers common to the mobile web. This
note introduces re:mix, an architecture that delivers
both the development benefits of browser-based
application tailoring and the server-side benefits of
proxy-based rewriting.",
acknowledgement = ack-nhfb,
keywords = "end-user programming; mobile web; Software tailoring",
pdfpages = "4",
}
@TechReport{Lee:2007:AIS,
author = "Brian Lee and Scott R. Klemmer and Savil Srivastava
and Ronen Brafman",
title = "Adaptive Interfaces for Supporting Design by Example",
type = "Technical Report",
number = "CSTR 2007-16",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "9",
month = oct,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-16.pdf",
abstract = "Analogy plays an important cognitive role in reasoning
and problem solving. One illustration of analogical
cognition can be found in design practice, where
viewing examples is an established technique for
inspiration and learning. While digital information
technologies have made it easier for designers to
access examples of other designers' work, significant
opportunities exist for selecting and presenting
examples in a proactive fashion. In this paper, we
introduce techniques for dynamically deriving
interfaces for example-based design tools using
decision-theoretic selection, designer specification,
and end-user preference as inputs. This paper describes
a manifestation of these techniques in the Adaptive
Ideas web page builder, an HTML-based display platform
for web page designers that leverages content metadata
to automatically generate displays of examples. We
present an evaluation of these techniques through a
first-use study.",
acknowledgement = ack-nhfb,
keywords = "Adaptive interfaces; decision theory; design by
example; model-based UIs",
pdfpages = "10",
}
@TechReport{Lee:2007:CSA,
author = "Brian Lee and Heidy Maldonado and Isabelle Kim and Paz
Hilfinger-Pardo and Scott R. Klemmer",
title = "Classroom Studies of Augmented Notebook Usage
Informing the Design of Sharing Mechanisms",
type = "Technical Report",
number = "CSTR 2007-17",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
day = "9",
month = oct,
year = "2007",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2007-17.pdf",
abstract = "Designers today use a variety of artifacts --- both
physical and digital --- in the course of documenting
their work. Physical and digital media have
significantly different affordances and organizing
metaphors: most notably, paper remains the preferable
medium for sketching but lacks the sharing affordances
of digital media. Augmented paper interactions promise
to mitigate some of this difference, yet there have
been few real-world evaluations of augmented paper
systems. To investigate their potential value for
design, we conducted two studies of augmented paper
interactions with student design teams. Across two
ten-week-long studies, 56 design students used the
system, authoring over 4,000 pages of content in the
course of their class work. We discuss the impacts of
augmented paper technology on design practice,
including salient benefits (ease of integrating
physical media into digital practices), shortcomings
(insufficiency of na{\"\i}ve sharing mechanisms,
barriers to adoption), and other emergent behaviors
(changes in how physical and digital content
coexist).",
acknowledgement = ack-nhfb,
pdfpages = "8",
}
@TechReport{Chen:2008:VCE,
author = "Xing Chen and Lucas Pereira and Pat Hanrahan",
title = "Viewing Complex Environments using Hierarchical Light
Fields",
type = "Technical Report",
number = "CSTR 2002-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "",
day = "",
month = jan,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://graphics.stanford.edu/papers/hierarchical_lf/",
abstract = "",
acknowledgement = ack-nhfb,
pdfpages = "",
}
@TechReport{Talton:2008:CMP,
author = "Jerry Talton and Daniel Gibson and Pat Hanrahan and
Vladlen Koltun",
title = "Collaborative Mapping of a Parametric Design Space",
type = "Technical Report",
number = "CSTR 2008-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "28",
month = jan,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2008-01.pdf",
abstract = "We utilize a high-dimensional parametric design space
to support a novel and intuitive method for 3D
modeling. Users visually explore the design space and
pick models using a continuous, map-like interface. We
leverage models created by the user community to learn
underlying structure in the space via kernel density
estimation. This mapping of the space is maintained by
a server that synchronizes all the deployed design
tools. The tools leverage the mapping to allow users
with no prior modeling experience to easily create
unique designs by interpolating between and
extrapolating from landmark models. The result is a
self-reinforcing design system that becomes easier to
use as more people participate.\par
Our prototype tree modeling tool was downloaded by over
six thousand users from more than eighty countries in
the month following its release. Over fifteen hundred
trees were voluntarily picked from the roughly hundred
dimensional tree space. We report on usage patterns
gathered through this deployment and on subsequent user
surveys.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Chaudhuri:2008:DRV,
author = "Siddhartha Chaudhuri and Daniel Horn and Pat Hanrahan
and Vladlen Koltun",
title = "Distributed Rendering of Virtual Worlds",
type = "Technical Report",
number = "CSTR 2008-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
day = "28",
month = jan,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2008-02.pdf",
abstract = "We present a system for distributed rendering of large
and detailed virtual worlds. A cluster of servers
create and maintain a hierarchical representation of
the world that can be propagated to an unlimited number
of clients through a content-distribution network. The
preprocessing is easy to parallelize and storage
requirements are minimal. Using a small subset of the
representation, a client can explore a large and
detailed world in real time on consumer hardware over a
commodity Internet connection. The required bandwidth
is independent of the size of the world. We report
extensive performance measurements with a 2,500 square
kilometer world, densely populated with objects
comprising 10 billion polygons.",
acknowledgement = ack-nhfb,
pdfpages = "9",
}
@TechReport{Cadar:2008:KUA,
author = "Cristian Cadar and Daniel Dunbar and Dawson Engler",
title = "{KLEE}: Unassisted and Automatic Generation of
High-Coverage Tests for Complex Systems Programs",
type = "Technical Report",
number = "CSTR 2008-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
day = "8",
month = may,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2008-03.pdf",
abstract = "We present a new symbolic execution tool, KLEE,
capable of automatically generating tests that achieve
high coverage on a diverse set of complex and
environmentally-intensive programs. We applied KLEE to
all 90 programs in the GNU Coreutils utility suite,
which form the core user-level environment installed on
almost all Unix systems and, as such, represent some of
the most heavily used and tested open-source programs
in existence. For 84\% of these utilities, KLEE's
automatically generated tests covered 80--100\% of
executable statements and, in aggregate, significantly
beat the coverage of the developers' own hand-written
test suites. KLEE also found nine serious bugs
(including three that had been missed for over 15
years!) and produced concrete inputs that triggered the
errors when run on the uninstrumented code. When
applied to Minix's versions of a small selection of the
same applications, KLEE achieved similar coverage
(along with two bugs). In addition, we also used KLEE
to automatically find numerous incorrect differences
between several Minix and Coreutils tools. Finally, we
checked the kernel of the HiStar operating system,
generating tests that achieved 76.4\% (without paging
enabled) and 67.1\% coverage (with paging) and found
one important security bug.",
acknowledgement = ack-nhfb,
pdfpages = "14",
}
@TechReport{and:2008:ULR,
author = "Philip J. Guo",
title = "Using logistic regression to predict developer
responses to {Coverity Scan} bug reports",
type = "Technical Report",
number = "CSTR 2008-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "52",
day = "6",
month = jul,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2008-04.pdf",
abstract = "This report presents the state of my ongoing work to
create statistical models that can be used to make
predictions about how developers will respond to bug
reports issued by the Coverity tool in the Open Source
Scan project. I present models that can predict the
following probabilities for a given report based on
properties of the report itself and especially on the
development history of the file/module where the report
indicates a possible bug: 1. Probability that a report
is inspected (triaged); 2. Probability that an
inspected report is actually resolved (bugfix patch
submitted)",
acknowledgement = ack-nhfb,
pdfpages = "53",
}
@TechReport{Brandt:2008:EIO,
author = "Joel Brandt and Philip J. Guo and Joel Lewenstein and
Mira Dontcheva and Scott R. Klemmer",
title = "An Empirical Investigation of Opportunistic
Programming: Interleaving Web Foraging, Learning, and
Writing Code",
type = "Technical Report",
number = "CSTR 2008-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "19>",
month = sep,
year = "2008",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2008-05.pdf",
abstract = "This paper investigates the role of online resources
in problem solving. We look specifically at how
programmers --- an exemplar form of knowledge workers
--- opportunistically interleave Web foraging,
learning, and writing code. We describe two studies of
how programmers use online resources. The first study,
conducted in the lab, found that programmers leverage
the Web with three distinct intentions: They engage in
just-in-time learning of new skills and approaches,
they extend their skills, and they strategically
delegate their memory to online resources. The results
also suggest that queries for different purposes have
different styles and durations. Do query styles
robustly vary with intent, or is this result an
artifact of the particular lab setting? To address this
question, we analyzed a month-long set of Web queries
to a commercial programming framework's online
information sources. In this dataset, query style also
corresponded to intent. These results contribute to a
theory of online resource usage in programming, and
suggest opportunities for tools to facilitate
opportunistic programming.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Brandt:2009:ECP,
author = "Joel Brandt and Mira Dontcheva and Marcos Weskamp and
Scott R. Klemmer",
title = "Example-Centric Programming: Integrating Web Search
into the Development Environment",
type = "Technical Report",
number = "CSTR 2009-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
day = "31",
month = mar,
year = "2009",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2009-01.pdf",
abstract = "The ready availability of online source code examples
has changed the cost structure of programming by
example modification. However, current search tools are
wholly separate from editing tools. What benefits might
be realized by integrating them? This paper describes
the design, implementation, and evaluation of
Blueprint, a tool that integrates Web search into the
Adobe Flex Builder development environment. Blueprint
automatically augments queries with code context,
presents an example-centric view of search results, and
retains a link between copied code and its source. This
paper introduces a technique for retrieving relevant
example code, descriptions, and running examples for a
user's query. A between-subjects study found that
Blueprint enables participants to search for and select
example code significantly faster than with a standard
Web browser.",
acknowledgement = ack-nhfb,
keywords = "Example-centric development; opportunistic
programming; prototyping; Web search",
pdfpages = "9",
}
@TechReport{Chaudhuri:2009:IBE,
author = "Siddhartha Chaudhuri and Daniel Horn and Pat Hanrahan
and Vladlen Koltun",
key = "network graphics; image-based rendering; depth images;
orthoviews; splatting; massive virtual environments",
title = "Image-Based Exploration of Massive Online
Environments",
type = "Technical Report",
number = "CSTR 2009-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
day = "15",
month = dec,
year = "2009",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2009-02.pdf",
abstract = "This paper presents a system for interactive
exploration of massive, detailed virtual environments
over a broadband network. We build upon the
hierarchical image-based framework pioneered by Shade
et al. [1996] and Schaufler and St{\"u}rzlinger [1996],
introducing key adaptations for scalability. A cluster
of servers maintain a hierarchy of depth images of
bounded regions of the scene. A client displays the
scene using a logarithmic set of depth images that can
be maintained under constant bandwidth independent of
scene size. We report on techniques used to overcome
the daunting visual quality issues encountered with
image-based rendering of general unstructured scenes
with billions of polygons on commodity hardware over a
wide-area network. Experimental results are reported on
scenes that exemplify the extreme demands of
large-scale online worlds.",
acknowledgement = ack-nhfb,
pdfpages = "8",
}
@TechReport{Dow:2009:EPP,
author = "Steven P. Dow and Alana Glassco and Jonathan Kass and
Melissa Schwarz and Scott R. Klemmer",
title = "The Effect of Parallel Prototyping on Design
Performance, Learning, and Self-Efficacy",
type = "Technical Report",
number = "CSTR 2009-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "",
day = "16",
month = dec,
year = "2009",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "http://hci.stanford.edu/publications/2009/EffectOfParallelPrototyping.pdf",
abstract = "",
acknowledgement = ack-nhfb,
pdfpages = "",
}
@TechReport{Horn:2009:IBS,
author = "Daniel Horn and Ewen Cheslack-Postava and Behram F. T.
Mistree and Tahir Azim and Jeff Terrace and Michael J.
Freedman and Philip Levis",
title = "To Infinity and Not Beyond: Scaling Communication in
Virtual Worlds with Meru",
type = "Technical Report",
number = "CSTR 2010-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
day = "11",
month = may,
year = "2009",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2010-01.pdf",
abstract = "Virtual worlds seek to provide an online setting where
users can interact in a shared environment. Popular
virtual worlds such as Second Life and World of
Warcraft, however, rely on share-nothing data and
strict partitioning as much as possible. They translate
a large world into many tiny worlds. This partitioning
conflicts with the intended goal of a virtual world by
greatly limiting interaction and reducing the shared
experience.\par
We present Meru, an architecture for scalable,
federated virtual worlds. Meru's key insight is that,
compared to traditional distributed object systems,
virtual world objects have the additional property of
being embedded in a three-dimensional geometry. By
leveraging this geometric information in messaging and
caching, Meru can allow uncongested virtual world
objects to pass messages with 800 times the throughput
as Second Life while also gracefully scaling to handle
the congestion of ten thousand active senders. Unlike
virtual worlds today, Meru achieves this performance
without any partitioning, maintaining a single,
seamless world.",
acknowledgement = ack-nhfb,
pdfpages = "13",
}
@TechReport{Roy:2010:EMM,
author = "Arjun Roy and Stephen M. Rumble and Ryan Stutsman and
Philip Levis and David Mazi{\`e}res and Nickolai
Zeldovich",
title = "Energy Management in Mobile Devices with the Cinder
Operating System",
type = "Technical Report",
number = "CSTR 2010-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
day = "3",
month = jun,
year = "2010",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2010-02.pdf",
abstract = "We present Cinder, an operating system for mobile
phones and devices, which allows users and applications
to control and manage limited device resources such as
energy. Cinder introduces two new abstractions,
reserves and taps. Unlike prior approaches, Cinder
accurately tracks principals responsible for resource
consumption even across interprocess communication, and
allows applications to delegate their resources either
in terms of rates or quantities. Rates can enforce
system lifetime, while quantities can enforce dataplan
or talk time limits. Proportional taps allow threads to
prevent their descendants from hoarding unused energy.
Cinder additionally institutes a global half-life to
prevent malicious applications from starving the rest
of the system.\par
We explore these abstractions, demonstrating their
usefulness in a variety of applications running on the
HTC Dream (a.k.a. Google G1). We show how Cinder
maintains system lifetime in the presence of malicious
applications, reserves energy for critical functions
such as 911, supports energy-aware applications, easily
augments existing Unix applications with energy
polices, properly amortizes costs across multiple
principals, and allows applications to sandbox
untrusted subcomponents (such as browser plugins).",
acknowledgement = ack-nhfb,
pdfpages = "15",
}
@TechReport{Kazandjieva:2010:IEW,
author = "Maria Kazandjieva and Omprakash Gnawali and Brandon
Heller and Philip Levis and Christos Kozyrakis",
title = "Identifying Energy Waste through Dense Power Sensing
and Utilization Monitoring",
type = "Technical Report",
number = "CSTR 2010-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
day = "25",
month = aug,
year = "2010",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2010-03.pdf",
abstract = "PowerNet is a hybrid sensor network for monitoring the
power and utilization of computing systems in a large
academic building. PowerNet comprises approximately 140
single-plug wired and wireless hardware power meters
and 23 software sensors that monitor PCs, laptops,
network switches, servers, LCD screens, and other
office equipment. PowerNet has been operational for 14
months, and the wireless meters for three
months.\par
This dense, long-term monitoring allows us to
extrapolate the energy consumption breakdown of the
whole building. Using our measurements together with
device inventory we find that approximately 56\% of the
total building energy budget goes toward computing
systems, at a cost of $ \approx $ \$22,000 per month.
PowerNet's measurements of CPU activity and network
traffic reveal that a large fraction of this power is
wasted and shows where there are savings
opportunities.\par
In addition to these sensor data results, we present
our experiences designing, deploying, and maintaining
PowerNet. We include a longterm characterization of
CTP, the standard TinyOS collection protocol.\par
The paper concludes with a discussion of possible
alternatives to computing system design that can save
energy while satisfying user workloads.",
acknowledgement = ack-nhfb,
pdfpages = "14",
}
@TechReport{Kumar:2010:BSP,
author = "Ranjitha Kumar and Jerry O. Talton and Salman Ahmad
and Scott R. Klemmer",
title = "{Bricolage}: a Structured-Prediction Algorithm for
Example-Based Web Design",
type = "Technical Report",
number = "CSTR 2010-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "9",
day = "29",
month = sep,
year = "2010",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2010-04.pdf",
abstract = "The Web today provides a corpus of design examples
unparalleled in human history. However, leveraging
existing designs to produce new pages is currently
difficult. This paper introduces the Bricolage
algorithm for automatically transferring design and
content between Web pages. Bricolage introduces a novel
structured prediction technique that learns to create
coherent mappings between pages by training on
human-generated exemplars. The produced mappings can
then be used to automatically transfer the content from
one page into the style and layout of another. We show
that Bricolage can learn to accurately reproduce human
page mappings, and that it provides a general,
efficient, and automatic technique for retargeting
content between a variety of real Web pages.",
acknowledgement = ack-nhfb,
pdfpages = "9",
}
@TechReport{Brandt:2010:RHP,
author = "Joel Brandt and Vignan Pattamatta and William Choi and
Ben Hsieh and Scott R. Klemmer",
title = "{Rehearse}: Helping Programmers Adapt Examples by
Visualizing Execution and Highlighting Related Code",
type = "Technical Report",
number = "CSTR 2010-05",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "7",
month = oct,
year = "2010",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2010-05.pdf",
abstract = "Instructive example code is a central part of
programming. Web search enables programmers to quickly
locate relevant examples. However, existing code
editors offer little support for helping users
interactively explore examples. This paper proposes
that effective use of examples hinges on the
programmer's ability to quickly identify a small number
of relevant lines interleaved among a larger body of
boilerplate code. This insight is manifest in Rehearse,
a code editing environment with two unique features:
First, Rehearse links program execution to source code
by highlighting each line of code as it is executed.
This enables programmers to quickly determine which
lines of code are involved in producing a particular
interaction. Second, after a programmer has found a
single line applicable to her task, Rehearse
automatically identifies other lines that are also
likely to be relevant. In a controlled experiment,
participants using visualization and highlighting
adapted example code significantly faster than those
using an identical editor without these features.",
acknowledgement = ack-nhfb,
keywords = "Example-centric programming",
pdfpages = "4",
}
@TechReport{Guo:2011:CUS,
author = "Philip J. Guo and Dawson Engler",
title = "{CDE}: Using System Call Interposition to
Automatically Create Portable Software Packages",
type = "Technical Report",
number = "CSTR 2011-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "15",
day = "5",
month = apr,
year = "2011",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
URL = "https://hci.stanford.edu/cstr/reports/2011-01.pdf",
abstract = "It can be painfully difficult to take software that
runs on one person's machine and get it to run on
another machine. Online forums and mailing lists are
filled with discussions of users' troubles with
compiling, installing, and configuring software and
their myriad of dependencies. To eliminate this
dependency problem, we created a system called CDE that
uses system call interposition to monitor the execution
of x86-Linux programs and package up the Code, Data,
and Environment required to run them on other x86-Linux
machines. The main benefits of CDE are that creating a
package is completely automatic, and that running
programs within a package requires no installation,
configuration, or root permissions. Hundreds of people
throughout both academia and industry have used CDE to
distribute software, demo prototypes, make their
scientific experiments reproducible, run software
natively on older Linux distributions, and deploy
experiments to compute clusters",
acknowledgement = ack-nhfb,
pdfpages = "15",
}
@TechReport{Kazandjieva:2011:SHF,
author = "Maria Kazandjieva and Brandon Heller and Omprakash
Gnawali and Wanja Hofer and Philip Levis and Christos
Kozyrakis",
title = "Software or Hardware: The Future of Green Enterprise
Computing",
type = "Technical Report",
number = "CSTR 2011-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
day = "7",
month = jul,
year = "2011",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2011-02.pdf",
abstract = "Over the last few years, interest in ``green
computing'' has motivated research into energy-saving
techniques for enterprise systems, from network proxies
and virtual machine migration to the return of thin
clients. This paper tries to answer a possibly
contentious question: would we be better served by the
embarrassingly simple approach of replacing every
desktop with a laptop? To answer this question, we use
power and utilization data collected from more than 100
devices over durations up to 15 months. We find that
choosing the right computing systems --- laptops ---
would save more energy than state-of-the-art power
management software or thin clients. Furthermore, the
marginal savings of applying software techniques on top
of laptops is so small that it is probably not worth
the trouble.\par
When selecting computers, there are many other
considerations than just energy, such as computational
resources, and price. We find that these factors
generally do not reduce the attractiveness of a
laptop-based enterprise. We discuss current trends in
enterprises today, and how our conclusions might affect
their directions, sketching a future of how a
cost-efficient enterprise might become a hybrid system
entwining laptops and tablets with a computing cloud.",
acknowledgement = ack-nhfb,
pdfpages = "13",
}
@TechReport{Karpenko:2011:DVS,
author = "Alexandre Karpenko and David Jacobs and Jongmin Baek
and Marc Levoy",
title = "Digital Video Stabilization and Rolling Shutter
Correction using Gyroscopes",
type = "Technical Report",
number = "CSTR 2011-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "1",
month = oct,
year = "2011",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2011-03.pdf",
abstract = "In this paper we present a robust, real-time video
stabilization and rolling shutter correction technique
based on commodity gyroscopes. First, we develop a
unified algorithm for modeling camera motion and
rolling shutter warping. We then present a novel
framework for automatically calibrating the gyroscope
and camera outputs from a single video capture. This
calibration allows us to use only gyroscope data to
effectively correct rolling shutter warping and to
stabilize the video. Using our algorithm, we show
results for videos featuring large moving foreground
objects, parallax, and low-illumination. We also
compare our method with commercial image-based
stabilization algorithms. We find that our solution is
more robust and computationally inexpensive. Finally,
we implement our algorithm directly on a mobile phone.
We demonstrate that by using the phone's inbuilt
gyroscope and GPU, we can remove camera shake and
rolling shutter artifacts in real-time.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{Kokkalis:2011:PAP,
author = "Nicolas Kokkalis and Johannes Huebner and Moontae Lee
and Steven Diamond and Michael Chang and Dominic Becker
and Binna Kim and Scott Klemmer",
title = "Providing action plans helps people complete tasks",
type = "Technical Report",
number = "CSTR 2011-09",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "1",
day = "24",
month = sep,
year = "2011",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2011-04.pdf",
abstract = "People complete tasks more quickly when they have
concrete plans. However, task lists place the burden of
developing plans on the user. This paper investigates
the effects of providing people with action plans
created by online crowds. A between-subjects experiment
found that people who received action plans from the
crowd completed more tasks than a control group that
did not. This paper also introduces two techniques for
scaling the provision of action plans. First, we
created a social variant where participants both used
the task lists and provided action plans for others. In
a between-subjects experiment, participants using this
social approach completed more tasks than those who
maintained a conventional task list. Second, we
developed a natural language processing technique that
uses WordNet and synonym detection to group similar
tasks and reuse action plans across them. Running this
technique on a corpus of 2872 tasks with two human
auditors of the results found that 69.4\% tasks had at
least one match. This suggests automatically providing
action plans is quite scalable. We have incorporated
these principles into a system, the TaskGenies
Community.",
acknowledgement = ack-nhfb,
pdfpages = "1",
}
@TechReport{Kim:2012:AIE,
author = "Young Min Kim and Niloy Mitra and Dongming Yan and
Leonidas Guibas",
title = "Acquisition of {3D} Indoor Environments with
Variability and Repetition",
type = "Technical Report",
number = "CSTR 2012-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
day = "3",
month = apr,
year = "2012",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2012-01.pdf",
abstract = "Large-scale acquisition of exterior urban environments
is by now a well-established technology, supporting
many applications in search, navigation, and commerce.
The same is not true for indoor environments, however:
access is often restricted and the spaces may be
cluttered. In addition, such environments typically
contain a high density of repeated objects (e.g.,
tables, chairs, monitors, etc.) in regular or
non-regular arrangements with significant pose
variations and articulations. In this paper, we exploit
the special structure of indoor environments to
accelerate their 3D acquisition and recognition with a
low-end handheld scanner. Our approach runs in two
phases: (i) a learning phase, where we acquire 3D
models of frequently occurring objects and capture
their variability modes from only a few scans, and (ii)
a recognition phase, where from a single scan of new
areas, we identify previously seen objects, but in
varying poses and locations. This greatly accelerates
the capture process (average recognition time of
200ms/model). We demonstrate our framework with the
acquisition of typical areas of a university building
including cubicle or desk areas, auditoriums, etc.,
using a Microsoft Kinect sensor.",
acknowledgement = ack-nhfb,
pdfpages = "8",
}
@TechReport{Handigol:2012:MPF,
author = "Nikhil Handigol and Brandon Heller and Vimalkumar
Jeyakumar and Bob Lantz and Nick McKeown",
title = "{Mininet} Performance Fidelity Benchmarks",
type = "Technical Report",
number = "CSTR 2012-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
day = "21",
month = oct,
year = "2012",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2012-02.pdf",
abstract = "This initial Mininet technical report evaluates the
performance fidelity of the Mininet/Mininet-HiFi system
by examining results from two classes of experiments:
link tests (section 2) and microbenchmarks (section
3.)",
acknowledgement = ack-nhfb,
pdfpages = "11",
}
@TechReport{Lim:2012:LSS,
author = "Maxine Lim and Ranjitha Kumar and Arvind Satyanarayan
and Cesar Torres and Jerry O. Talton and Scott R.
Klemmer",
title = "Learning Structural Semantics for the {Web}",
type = "Technical Report",
number = "CSTR 2012-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "8",
day = "15",
month = nov,
year = "2012",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2012-03.pdf",
abstract = "Researchers have long envisioned a Semantic Web, where
unstructured Web content is replaced by documents with
rich semantic annotations. Unfortunately, this vision
has been hampered by the difficulty of acquiring
semantic metadata for Web pages. This paper introduces
a method for automatically ``semantifying'' structural
page elements: using machine learning to train
classifiers that can be applied in a post-hoc fashion.
We focus on one popular class of semantic identifiers:
those concerned with the structure --- or information
architecture --- of a page. To determine the set of
structural semantics to learn and to collect training
data for the learning, we gather a large corpus of
labeled page elements from a set of online workers. We
discuss the results from this collection and
demonstrate that our classifiers learn structural
semantics in a general way.",
acknowledgement = ack-nhfb,
pdfpages = "8",
}
@TechReport{Kulkarni:2012:LDW,
author = "Chinmay Kulkarni and Scott R. Klemmer",
title = "Learning design wisdom by augmenting physical studio
critique with online self-assessment",
type = "Technical Report",
number = "CSTR 2012-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "10",
day = "2",
month = jul,
year = "2012",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2012-04.pdf",
abstract = "Rich, large-scale user-generated virtual worlds have
been imagined in the realm of fiction for decades. Such
worlds, however, present significant technical
challenges due to the limitations of available network
and graphics resources. Since the world is
user-generated, its content has to be stored in a
shared, networked resource such as the cloud. Further,
user-generated content is not optimized for efficient
rendering, so additional processing is needed to
display it efficiently in the presence of limited
graphical resources.\par
This paper presents an approach to efficiently display
a complete view of a user-generated world at scale. The
key insight is that such worlds have a high degree of
coherence, which enables us to deduplicate many 3D
models. This greatly reduces the amount of data that
needs to be transferred over the network to display the
world. The deduplicated models also lend themselves to
a new method of simplification, called instance-aware
simplification, which efficiently simplifies 3D models
consisting of many instances of the same geometry.",
acknowledgement = ack-nhfb,
pdfpages = "10",
}
@TechReport{Azim:2013:DLU,
author = "Tahir Azim and Ewen Cheslack-Postava and Philip
Levis",
title = "Displaying Large User-Generated Virtual Worlds from
the Cloud",
type = "Technical Report",
number = "CSTR 2013-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "",
day = "25",
month = may,
year = "2013",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2013-01.pdf",
abstract = "",
acknowledgement = ack-nhfb,
pdfpages = "",
}
@TechReport{Kim:2013:JNM,
author = "Jae Young Kim and Omid Mashayekhi and Hang Qu and
Maria Kazandjieva and Philip Levis",
title = "{Janus}: a Novel {MAC} Protocol for Full Duplex
Radio",
type = "Technical Report",
number = "CSTR 2013-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "12",
day = "23",
month = jul,
year = "2013",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2013-02.pdf",
abstract = "This paper presents Janus, a novel MAC protocol for
full-duplex wireless networks. Unlike other full-duplex
MACs, Janus allows partially interfering nodes to
cooperate by finding the appropriate transmission rates
based on interference levels, making better use of the
channel. Computing the optimal schedule and
transmission rates is NPComplete, so Janus uses a
cheaper heuristic approach. Janus also ensures that
channel access time is shared fairly between all nodes.
Janus has lower per-packet overhead compared to
CSMA\slash CA because it eliminates random back-off and
lets nodes transmit multiple packets with a single set
of control packets. We show that for a setup with one
access point and three nodes, Janus achieves $ 2.5
\times $ the throughput of half-duplex system based on
CSMA\slash CA.",
acknowledgement = ack-nhfb,
pdfpages = "12",
}
@TechReport{Wu:2013:SCR,
author = "Leslie Wu and Jesse Cirimele and Kristen Leach and
Stuart Card and Larry Chu and Kyle Harrison and Scott
Klemmer",
title = "Supporting Crisis Response with Dynamic Procedure
Aids",
type = "Technical Report",
number = "CSTR 2013-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "29",
day = "17",
month = sep,
year = "2013",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2013-03.pdf",
abstract = "Checklist usage can increase performance in complex,
perilous domains. While paper checklists are valuable,
they are static, slow to access, and show both too much
and too little information. In response, we introduce
the Dynamic Procedure Aids approach. Dynamic Procedure
Aids address four key problems in checklist usage:
ready access to the aids, rapid assimilation of their
content, professional acceptance of their use in
medical procedures, and the limited attention available
to their users. To understand the efficacy of Dynamic
Procedure Aids for crisis response, we created dpAid, a
software system for crisis medicine. dpAid's design was
based on more than a year of observing medical teams
responding to simulated crises. We assess our Dynamic
Procedure Aids with narrative simulation. A study
compared Dynamic Procedure Aids, paper, and no aid
conditions, finding that participants with Dynamic
Procedure Aids performed significantly better than with
paper or no aid.",
acknowledgement = ack-nhfb,
pdfpages = "29",
}
@TechReport{Mistree:2014:RAN,
author = "Behram F. T. Mistree and Jay Thomason and Gabriel Kho
and Harrison Ho and Edric Kyauk and Philip Levis",
title = "Rethinking Application Networking as Transactional
Scripting",
type = "Technical Report",
number = "CSTR 2014-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
day = "4",
month = feb,
year = "2014",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2014-01.pdf",
abstract = "We describe Waldo, a scripting language for
application networking. Waldo allows programmers to
describe complex network interactions between many
hosts as transactional operations with atomicity,
consistency, and isolation. Waldo is able to provide
these transactional semantics starvation-free without
assuming global clocks, without centralized scheduling,
and under arbitrary transaction conflicts. This allows
programmers to write application networking as short
transactional scripts that will never starve. Waldo
achieves these results with a novel distributed
transaction scheduling algorithm that combines the
wound-wait algorithm and Lamport clocks with two
transaction priority levels. Experimental results show
that using the primary algorithm Waldo can perform up
to 10,000 transactions per second between two endpoints
connected across the wide area network.",
acknowledgement = ack-nhfb,
pdfpages = "14",
}
@TechReport{Chang:2014:TDC,
author = "Angel X. Chang and Christopher D. Manning",
title = "{TokensRegex}: Defining cascaded regular expressions
over tokens",
type = "Technical Report",
number = "CSTR 2014-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "4",
day = "9",
month = apr,
year = "2014",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "https://hci.stanford.edu/cstr/reports/2014-02.pdf",
abstract = "We describe TokensRegex, a framework for defining
cascaded regular expressions over token sequences.
TokensRegex is available as part of the Stanford
CoreNLP software package and can be used for various
tasks which require reasoning over tokenized text. It
has been used to build SUTime, a state-of-the-art
temporal tagger, and can be helpful in a variety of
scenarios such as named entity recognition (NER) and
information extraction from tokens",
acknowledgement = ack-nhfb,
pdfpages = "",
}
@TechReport{Chang:2014:LSK,
author = "Angel X. Chang and Manolis Savva and Christopher D.
Manning",
title = "Learning Spatial Knowledge for Text to {3D} Scene
Generation",
type = "Technical Report",
number = "CSTR 2014-03",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "11",
day = "9",
month = apr,
year = "2014",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2014-03.pdf;
https://nlp.stanford.edu/pubs/spatial-emnlp2014.pdf",
abstract = "We address the grounding of natural language to
concrete spatial constraints, and inference of implicit
pragmatics in 3D environments. We apply our approach to
the task of text-to-3D scene generation. We present a
representation for common sense spatial knowledge and
an approach to extract it from 3D scene data. In
text-to-3D scene generation, a user provides as input
natural language text from which we extract explicit
constraints on the objects that should appear in the
scene. The main innovation of this work is to show how
to augment these explicit constraints with learned
spatial knowledge to infer missing objects and likely
layouts for the objects in the scene. We demonstrate
that spatial knowledge is useful for interpreting
natural language and show examples of learned knowledge
and generated 3D scenes.",
acknowledgement = ack-nhfb,
pdfpages = "11",
xxauthor = "Manolis Savva and Angel X. Chang and Christopher D.
Manning",
}
@TechReport{Nayak:2014:DNA,
author = "Neha Nayak and Mark Kowarsky and Gabor Angeli and
Christopher D. Manning",
title = "A Dictionary of Nonsubsective Adjectives",
type = "Technical Report",
number = "CSTR 2014-04",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "22",
month = oct,
year = "2014",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2014-04.pdf",
abstract = "Computational approaches to inference and information
extraction often assume that adjective--noun compounds
maintain all the relevant properties of the unmodified
noun. A significant portion of nonsubsective adjectives
violate this assumption. We present preliminary work
towards a classifier for these adjectives. We also
compile a comprehensive list of 60 nonsubsective
adjectives including those used for training and those
found by the classifiers.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{Mashayekhi:2015:DGS,
author = "Omid Mashayekhi and Chinmayee Shah and Hang Qu and
Andrew Lim and Philip Levis",
title = "Distributed Graphical Simulation in the Cloud",
type = "Technical Report",
number = "CSTR 2015-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "24",
month = apr,
year = "2015",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2015-01.pdf",
abstract = "Graphical simulations are a cornerstone of modern
media and films. But existing software packages are
designed to run on HPC nodes, and perform poorly in the
computing cloud. These simulations have complex data
access patterns over complex data structures, and
mutate data arbitrarily, and so are a poor fit for
existing cloud computing systems. We describe a
software architecture for running graphical simulations
in the cloud that decouples control logic, computations
and data exchanges. This allows a central controller to
balance load by redistributing computations, and
recover from failures. Evaluations show that the
architecture can run existing, state-of-the-art
simulations in the presence of stragglers and failures,
thereby enabling this large class of applications to
use the computing cloud for the first time.",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@TechReport{Qu:2016:CSA,
author = "Hang Qu and Omid Mashayekhi and David Terei and Philip
Levis",
title = "{Canary}: a Scheduling Architecture for High
Performance Cloud Computing",
type = "Technical Report",
number = "CSTR 2016-01",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "13",
day = "1",
month = feb,
year = "2016",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2016-01.pdf",
abstract = "We present Canary, a scheduling architecture that
allows high performance analytics workloads to scale
out to run on thousands of cores. Canary is motivated
by the observation that a central scheduler is a
bottleneck for high performance codes: a handful of
multicore workers can execute tasks faster than a
controller can schedule them.\par
The key insight in Canary is to reverse the
responsibilities between controllers and workers.
Rather than dispatch tasks to workers, which then fetch
data as necessary, in Canary the controller assigns
data partitions to workers, which then spawn and
schedule tasks locally.\par
We evaluate three benchmark applications in Canary on
up to 64 servers and 1, 152 cores on Amazon EC2. Canary
achieves up to 9--90$ \times $ speedup over Spark and
up to 4$ \times $ speedup over GraphX, a highly
optimized graph analytics engine. While current
centralized schedulers can schedule 2,500 tasks/second,
each Canary worker can schedule 136,000 tasks/second
per core and experiments show this scales out linearly,
with 64 workers scheduling over 120 million tasks per
second, allowing Canary to support optimized jobs
running on thousands of core",
acknowledgement = ack-nhfb,
pdfpages = "13",
}
@TechReport{Mashayekhi:2016:SFC,
author = "Omid Mashayekhi and Hang Qu and Chinmayee Shah and
Philip Levis",
title = "Scalable, Fast Cloud Computing with Execution
Templates",
type = "Technical Report",
number = "CSTR 2016-02",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "14",
day = "10",
month = may,
year = "2016",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2016-02.pdf",
abstract = "Large scale cloud data analytics applications are
often CPU bound. Most of these cycles are wasted:
benchmarks written in C++ run 10--51 times faster than
frameworks such as Naiad and Spark. However, calling
faster implementations from those frameworks only sees
moderate (3--5$ \times $) speedups because their
control planes cannot schedule work fast
enough.\par
This paper presents execution templates, a control
plane abstraction for CPU-bound cloud applications,
such as machine learning. Execution templates leverage
highly repetitive control flow to cache scheduling
decisions as templates. Rather than reschedule hundreds
of thousands of tasks on every loop execution, nodes
instantiate these templates. A controller's template
specifies the execution across all worker nodes, which
it partitions into per-worker templates. To ensure that
templates execute correctly, controllers dynamically
patch templates to match program control flow. We have
implemented execution templates in Nimbus, a C++ cloud
computing framework. Running in Nimbus, analytics
benchmarks can run 16--43 times faster than in Naiad
and Spark. Nimbus's control plane can scale out to run
these faster benchmarks on up to 100 nodes (800
cores).",
acknowledgement = ack-nhfb,
pdfpages = "14",
}
@TechReport{Subhraveti:2017:ARA,
author = "Dinesh Subhraveti and Sri Goli and Serge Hallyn and
Ravi Chamarthy and Christos Kozyrakis",
title = "{AppSwitch}: Resolving the Application Identity
Crisis",
type = "Technical Report",
number = "CSTR 2017-07",
institution = inst-STAN-CS,
address = inst-STAN-CS:adr,
pages = "7",
day = "5",
month = nov,
year = "2017",
bibdate = "Fri Nov 21 07:40:47 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
URL = "https://hci.stanford.edu/cstr/reports/2017-01.pdf",
abstract = "Networked applications traditionally derive their
identity from the identity of the host on which they
run. The default application identity acquired from the
host results in subtle and substantial problems related
to application deployment, discovery and access,
especially for modern distributed applications. A
number of mechanisms and workarounds, often quite
elaborate, are used to address those problems but they
only address them indirectly and incompletely.\par
This paper presents AppSwitch, a novel transport layer
network element that decouples applications from
underlying network at the system call layer and enables
them to be identified independently of the network.
Without requiring changes to existing applications or
infrastructure, it removes the cost and complexity
associated with operating distributed applications
while offering a number of benefits including an
efficient implementation of common network functions
such as application firewall and load balancer.
Experiments with our implementation show that AppSwitch
model also effectively removes the performance penalty
associated with unnecessary data path processing that
is typical in those application environments",
acknowledgement = ack-nhfb,
pdfpages = "7",
}
@Article{Wilkinson:1968:ADM,
author = "James H. Wilkinson",
title = "Almost Diagonal Matrices with Multiple or Close
Eigenvalues",
journal = j-LINEAR-ALGEBRA-APPL,
volume = "1",
pages = "1--12",
year = "1968",
CODEN = "LAAPAW",
ISSN = "0024-3795 (print), 1873-1856 (electronic)",
ISSN-L = "0024-3795",
MRclass = "15.25 (65.00)",
MRnumber = "MR0225794 (37 \#1386)",
MRreviewer = "John Todd",
bibdate = "Fri Nov 21 09:13:48 2025",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
fjournal = "Linear Algebra and its Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/00243795",
}
@Article{Golub:1976:ICE,
author = "Gene H. Golub and James H. Wilkinson",
title = "Ill-Conditioned Eigensystems and the Computation of
the {Jordan} Canonical Form",
journal = j-SIAM-REVIEW,
volume = "18",
number = "4",
pages = "578--619",
month = "????",
year = "1976",
CODEN = "SIREAD",
DOI = "https://doi.org/10.1137/1018113",
ISSN = "0036-1445 (print), 1095-7200 (electronic)",
ISSN-L = "0036-1445",
MRclass = "65F15 (15A21)",
MRnumber = "54 \#1570",
MRreviewer = "Robert Todd Gregory",
bibdate = "Fri Dec 20 17:05:12 1996",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/tex/bib/gvl.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib",
note = "Reprinted in \cite{Chan:2007:MMC}.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007)",
fjournal = "SIAM Review",
journal-URL = "http://epubs.siam.org/sirev",
keywords = "nla, eig, Jordan form, condition, pert,
ill-conditioned problem",
}
@Article{Symm:1980:REBb,
author = "H. J. Symm and James H. Wilkinson",
title = "Realistic error bounds for a simple eigenvalue and its
associated eigenvector",
journal = j-NUM-MATH,
volume = "35",
number = "2",
pages = "113--126",
month = jun,
year = "1980",
CODEN = "NUMMA7",
DOI = "https://doi.org/10.1007/BF01396310",
ISSN = "0029-599X (print), 0945-3245 (electronic)",
ISSN-L = "0029-599X",
MRclass = "65F15",
MRnumber = "83b:65037",
MRreviewer = "Alan L. Andrew",
bibdate = "Mon May 26 11:49:34 MDT 1997",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
Theory/Matrix.bib",
acknowledgement = ack-nhfb,
annote = "Cited in \cite{govl:89}.",
author-dates = "James H. Wilkinson (27 September 1919--5 October
1986)",
classification = "C1100 (Mathematical techniques); C4110 (Error
analysis in numerical methods)",
corpsource = "Div. of Numerical Analysis and Computer Sci., Nat.
Phys. Lab., Teddington, UK",
fjournal = "Numerische Mathematik",
journal-URL = "http://link.springer.com/journal/211",
keywords = "eig; eigenvalue; eigenvalues and eigenfunctions;
eigenvector; error analysis; error bounds; error
estimates; la; pert",
treatment = "T Theoretical or Mathematical",
}
@Book{Nourbakhsh:1997:IPEb,
author = "Illah Reza Nourbakhsh",
title = "Interleaving Planning and Execution for Autonomous
Robots",
volume = "SECS 385",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xvi + 145",
year = "1997",
ISBN = "0-7923-9828-9",
ISBN-13 = "978-0-7923-9828-8",
LCCN = "TJ211.415 .N68 1997",
bibdate = "Thu Nov 27 20:11:31 MST 2025",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
z3950.loc.gov:7090/Voyager",
series = "Kluwer international series in engineering and
computer science; Robotics",
acknowledgement = ack-nhfb,
author-dates = "1970--",
subject = "Autonomous robots; Robots; Control systems; Artificial
intelligence; Uncertainty; Mathematical models",
}
@Book{Chan:2007:MMC,
editor = "Raymond H. Chan and Chen Greif and Dianne P. O'Leary",
booktitle = "Milestones in Matrix Computation: the Selected Works
of {Gene H. Golub} with Commentaries",
title = "Milestones in Matrix Computation: the Selected Works
of {Gene H. Golub} with Commentaries",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xi + 565 + 3",
year = "2007",
ISBN = "0-19-920681-3",
ISBN-13 = "978-0-19-920681-0",
LCCN = "QA188 .G67 2007",
MRclass = "65-06 (01A75 65Fxx)",
MRnumber = "MR2281939 (2008b:65004)",
MRreviewer = "David Scott Watkins",
bibdate = "Sat Apr 07 10:23:33 2007",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/g/golub-gene-h.bib;
https://www.math.utah.edu/pub/bibnet/authors/h/higham-nicholas-john.bib;
https://www.math.utah.edu/pub/bibnet/authors/l/lanczos-cornelius.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/numana2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamjnumeranal.bib;
https://www.math.utah.edu/pub/tex/bib/siamreview.bib;
https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
https://www.math.utah.edu/pub/tex/bib/technometrics1970.bib",
URL = "http://www.loc.gov/catdir/enhancements/fy0737/2007276086-d.html",
abstract = "The text presents and discusses some of the most
influential papers in Matrix Computation authored by
Gene H. Golub, one of the founding fathers of the
field. The collection of 21 papers in divided into five
main areas: iterative methods for linear systems,
solution of least squares problems, matrix
factorizations and applications, orthogonal polynomials
and quadrature, and eigenvalue problems an commentaries
for each area are provided by leading experts: Anne
Greenbaum, {\AA}ke Bj{\"o}rck, Nicholas Higham, Walter
Gautschi, and G. W. (Pete) Stewart. Comments on each
paper are also provided by the original authors,
providing the reader with historical information on how
the paper came to be written and under what
circumstances the collaboration was undertaken.
Including a brief biography and facsimiles of the
original papers, this text will be of great interest to
students and researchers in numerical analysis and
scientific computation.",
acknowledgement = ack-nhfb,
author-dates = "Gene Howard Golub (February 29, 1932--November 16,
2007); Nicholas John Higham (25 December 1961--20
January 2024); Christian H. Reinsch (?? ?? 1932--8
October 2022); James H. Wilkinson (27 September 1919--5
October 1986)",
tableofcontents = "List of Plates / x \\
I: Gene H. Golub \\
1 Gene H. Golub Biography, by Chen Greif / 3 \\
2 Publications of Gene H. Golub / 13 \\
3 Major Awards / 30 \\
4 Students of Gene H. Golub / 32 \\
II: Iterative Methods for Linear Systems \\
5 Commentary, by Anne Greenbaum / 35 \\
References / 43 \\
6 Chebyshev semi-iterative methods, successive
over-relaxation iterative methods, and second-order
Richardson iterative methods, Parts I and II (with R.
S. Varga) / 45 \\
7 A generalized conjugate gradient method for
non-symmetric systems of linear equations (with Paul
Concus) / 68 \\
8 A generalized conjugate gradient method for the
numerical solution of elliptic partial differential
equations (with Paul Concus and Dianne P. O'Leary) / 79
\\
9 Hermitian and Skew-Hermitian Splitting Methods for
Non-Hermitian Positive Definite Linear Systems (with
Zhong-Zhi Bai and Michael K. Ng) / 102 \\
III: Solution of Least Squares Problems \\
10 Commentary, by {\AA}ke Bj{\"o}rck / 129 \\
References / 141 \\
11 Numerical methods for solving linear least squares
problems / 148 \\
12 Singular value decomposition and least squares
solutions (with C. Reinsch) / 160 \\
13 The differentiation of pseudo-inverses and
non-linear least squares problems whose variables
separate (with V. Pereyra) / 181 \\
14 Generalized cross-validation as a method for
choosing a good ridge parameter (with M. Heath and G.
Wahba) / 202 \\
15 An analysis of the total least squares problem (with
C. Van Loan) / 213 \\
IV: Matrix Factorizations and Applications \\
16 Commentary, by Nicholas Higham / 227 \\
References / 233 \\
17 Calculating the singular values and pseudo-inverse
of a matrix (with W. Kahan) / 236 \\
18 The simplex method of linear programming using $ L U
$ decomposition (with R. H. Bartels) / 257 \\
19 On direct methods for solving Poisson's equation
(with B. L. Buzbee and C. W. Nielson) / 261 \\
20 Numerical methods for computing angles between
linear subspaces (with {\AA}. Bj{\"o}rck) / 292 \\
21 Methods for modifying matrix factorizations (with P.
E. Gill, W. Murray and M. A. Saunders) / 309 \\
V: Orthogonal Polynomials and Quadrature \\
22 Commentary, by Walter Gautschi / 345 \\
References / 354 \\
23 Calculation of Gauss quadrature rules (with J. H.
Welsch) / 359 \\
24 Matrices, moments, and quadrature (with G{\'e}rard
Meurant) / 380 \\
25 Computation of Gauss--Kronrod Quadrature Rules (with
D. Calvetti, W. B. Gragg and L. Reichel) / 434 \\
VI: Eigenvalue Problems \\
26 Commentary, by G. W. Stewart / 457 \\
References / 465 \\
27 Some modified matrix eigenvalue problems / 467 \\
28 Ill-conditioned eigensystems and the computation of
the Jordan canonical form (with James H. Wilkinson) /
485 \\
29 The block Lanczos method for computing eigenvalues
(with R. Underwood) / 528 \\
30 The numerically stable reconstruction of a Jacobi
matrix from spectral data (with C. de Boor) / 546 \\
Index / 563",
}
@Book{Knuth:1979:TMN,
author = "Donald E. Knuth",
title = "{\TeX} and {\METAFONT}: New Directions in
Typesetting",
publisher = pub-DP # " and " # pub-AMS,
address = pub-DP:adr # " and " # pub-AMS:adr,
pages = "xi + 45 + 201 + 105",
year = "1979",
ISBN = "0-932376-02-9, 0-8218-0209-7",
ISBN-13 = "978-0-932376-02-2, 978-0-8218-0209-0",
LCCN = "Z253.3 .K58 1979",
MRclass = "00A05",
MRnumber = "80i:00002",
bibdate = "Fri Mar 22 18:03:29 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib;
MathSciNet database;",
note = "Revised version of Stanford computer science report
number STAN-CS-78-675, originally published in
September, 1978 \cite{Knuth:1978:TEC}.",
acknowledgement = ack-nhfb,
keywords = "computerized typesetting",
}
