perm filename FICHE.ORD[BIB,CSR]6 blob
sn#601608 filedate 1981-07-21 generic text, type C, neo UTF8
COMMENT ā VALID 00003 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 MICROFICHE ORDER July 20, 1981
C00013 00003 --------------------------------------------------------------------------------
C00028 ENDMK
Cā;
MICROFICHE ORDER July 20, 1981
TO: Western Microfilm, Inc. FROM: Department of Computer Science
1 South Park Avenue Stanford University
San Francisco, CA 94107 Attn: Dawn Yolton
Building 460, Room 206
Stanford, CA 94305
Collate the fiche if there are more than one of each document. Please put in
glassine envelopes.(NOTE: this is a deviation from previous requests). Return
the microfilm masters as well as the document originals.
Please put the taxable items and the non-taxable items on SEPARATE invoices and
return a copy of each order with the invoice when sent.
If you have any questions concerning this order, please call Dawn Yolton at
(415) 497-4776.
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 11
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-828 BREAKING PARAGRAPHS INTO LINES (CARD x OF x)
BY DONALD E. KNUTH & MICHAEL F. PLASS NOVEMBER 1980
---------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 66
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-827 ON THE PARALLEL COMPUTATION FOR THE KNAPSACK PROBLEM (CARD x OF x)
BY ANDREW CHI-CHIH YAO NOVEMBER l980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 14
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-829 THE DINNER TABLE PROBLEM (CARD x OF x)
BY BENGT ASPVALL & FRANK LIANG DECEMBER 1980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 23
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-830 TWO LINEAR-TIME ALGORITHMS FOR FIVE-COLORING (CARD x OF x)
A PLANAR GRAPH
BY D. MATULA, Y. SHILOACH & R. TARJAN NOVEMBER 1980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 81
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-831 AN O(nmlogn) ALGORITHM FOR MAXIMUM NETWORK FLOW (CARD x OF x)
BY DANIEL D. K. SLEATOR DECEMBER 1980
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 26
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-846 THE BYZANTINE GENERALS STRIKE AGAIN (CARD x OF x)
BY DANNY DOLEV MARCH 1981
---------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 6
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-847 THE OPTIMAL LOCKING PROBLEM (CARD x OF x)
IN A DIRECTED ACYCLIC GRAPH
BY HENRY F. KORTH MARCH 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 9
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-848 ON THE PROBLEM OF INPUTTING CHINESE CHARACTERS (CARD x OF x)
BY CHIH-SUNG TANG APRIL 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 28
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-849 EXPERIMENTS ON THE KNEE CRITERION (CARD x OF x)
IN A MULTIPROGRAMMED COMPUTER SYSTEM
BY TOHRU NISHIGAKI MARCH 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 43
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-832 SCHEDULING WIDE GRAPHS (CARD X OF X)
BY DANNY DOLEV DECEMBER 1980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 104
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-833 GRAPH SEPARATOR THEOREMS AND SPARSE GAUSSIAN (CARD X OF X)
ELIMINATION
BY JOHN RUSSELL GILBERT DECEMBER 1980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: U4BD-173798
TAXABLE: NO
NUMBER OF ORIGINALS: 37
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-837 RESEARCH ON EXPERT SYSTEMS (CARD X OF X)
BY BRUCE G. BUCHANAN FEBRUARY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 13
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-838 DYNAMIC PROGRAM BUILDING (CARD X OF X)
BY PETER BROWN FEBRUARY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 6
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-840 VERIFICATION OF LINK-LEVEL PROTOCOLS (CARD X OF X)
BY DONALD E. KNUTH JANUARY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 6
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-841 HUFFMAN'S ALGORITHM VIA ALGEBRA (CARD X OF X)
BY DONALD E. KNUTH MARCH 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: U4BD-173798
TAXABLE: NO
NUMBER OF ORIGINALS: 23
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-80-850 PERFORMING REMOTE OPERATINS EFFICIENTLY ON A (CARD X OF X)
LOCAL COMPUTER NETWORK
BY ALFRED SPECTOR DECEMBER 1980
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: U4BD-173798
TAXABLE: no
NUMBER OF ORIGINALS: 41
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-851 BINDING IN INFORMATION PROCESSING (CARD X OF X)
BY GIO WIEDERHOLD MAY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 9
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-852 A VIEW OF DIRECTIONS IN RELATIONAL (CARD X OF X)
DATABASE THEORY
BY JEFFREY D. ULLMAN MAY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 10
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-853 CONNECTIONS IN ACYCLIC HYPERGRAPHS (CARD X OF X)
BY DAVID MAIER & JEFFREY D. ULLMAN MAY 1981
--------------------------------------------------------------------------------
BLANKET ORDER NUMBER: C4BD-173797
TAXABLE: yes
NUMBER OF ORIGINALS: 22
NUMBER COPIES REQUIRED: 400
HEADER COLOR: red
12345678901234567890123456789012345678901234567890123456789012345678901234567890
HEADER TO READ:
STAN-CS-81-854 ON THE SECURITY OF PUBLIC KEY PROTOCOLS (CARD X OF X)
BY D. DOLEV & A.C. YAO MAY 1981
--------------------------------------------------------------------------------