COMMENT ⊗   VALID 00007 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.require "setup.abs[bib,csr]" source file
C00003 00003	.begin center
C00006 00004	.begin nofill <<CS-760>>
C00007 00005	.begin nofill <<CS-761>>
C00008 00006	.begin nofill <<CS-762>>
C00009 00007	.begin nofill <<CS-763>>
C00010 ENDMK
C⊗;
.require "setup.abs[bib,csr]" source file;
.at "⊗" ⊂"%5αQ%*"⊃
.at "!!" txt ";"	⊂
.(""∩[%2"&"txt"[1]&"]&∪[ "&"txt"[2]&"]");
.  ⊃
.begin center
S T A N F O R D   U N I V E R S I T Y
MOST RECENT COMPUTER SCIENCE REPORTS - 1979
.end

No. 6↔October

@Listed here are abstracts of the most recent reports published by the
Department of Computer Science at Stanford University.

@TO REQUEST REPORTS:  Check the appropriate places on the enclosed order
form, and return the entire order form page (including mailing label) by
December 28, 1979.  In many cases we can print only a limited number of copies,
and requests will be filled on a first come, first served basis.  If the code
(FREE) is printed on your mailing label, you will not be charged for hardcopy.
This exemption from payment is limited primarily to libraries.  (The costs
shown include all applicable sales taxes.  PLEASE SEND NO MONEY NOW, WAIT UNTIL 
YOU GET AN INVOICE.)

@ALTERNATIVELY:  Copies of most Stanford CS Reports may be obtained by writing
(about 2 months after the MOST RECENT CS REPORTS listing) to NATIONAL TECHNICAL
INFORMATION SERVICE, 5285 Port Royal Road, Springfield, Virginia 22161.
Stanford Ph.D. theses are available from UNIVERSITY MICROFILMS, 300 North
Zeeb Road, Ann Arbor, Michigan 48106.
.next page
.begin nofill <<CS-760>>
STAN-CS-79-760

Author:↔(Thesis)
.end
.next page
.begin nofill <<CS-761>>
STAN-CS-79-761
@"Gossiping Without Duplicate Transmissions"
Author:  Douglas B. West
7 pages↔Cost:  $1.90
.end

@%2n%1 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 twoic.  In the case %24%1 divides
%2n, n ≥ 8%1, we provide a construction that transmits all information using
only %29n/4-6%1 calls.  Previous constructions used !!12;%2n log n%1 calls.
.next page
.begin nofill <<CS-762>>
STAN-CS-79-762
@"Metafont:  A System for Alphabet Design"
Author:  Donald E. Knuth

.end

@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.
.next page
.begin nofill <<CS-763>>
STAN-CS-79-763
@"A Symmetric Chain Decomposition of %2L(4,n)%1"
Author:  Douglas B. West
17 pages↔Cost:  $2.20
.end

@%2L(m,n)%1 is the set of integer %2m%1-tuples %2(a↓1,...,a↓m)%1 with
%20 ≤ a↓1 ≤ ... ≤ a↓m ≤ n%1, ordered by !!a_; %2≤%1 !!b_; when %2a↓i ≤ b↓i%1
for all %2i%1.  R. Stanley conjectured that %2L(m,n)%1 is a symmetric chain
order for all %2(m,n)%1.  We verify this by construction for %2m = 4%1.
.next page