*CS4|STAN-CS-64-004*BERGMAN,HERRIOT,NUMER SOLN BDRY VALUE BY INT OPERS|2|0|$ 2.40
*CS5|STAN-CS-64-005*ROSEN,EQUIL PTS FOR CONCAVE N-PERSON GAMES|2|0|$ 2.55
*CS7|STAN-CS-64-007*ROSEN,SUFF.COND.OPT.CONTROL CONVEX PROC.|1|0|$ 2.60
*CS11|STAN-CS-64-011*NAKAMURA,ROSEN,ELASTIC-PLASTIC ANAL OF TRUSSES|2|0|$ 2.65
*CS13|STAN-CS-64-013*PEREYRA,ROSEN,COMPUT.OF PSEUDOINVERSE|1|0|$ 2.55
*CS14|STAN-CS-64-014*EFIMENKO,EIGENVALUES AND EIGENFUNCTIONS IN PDE|1|0|$ 2.30
*CS15|STAN-CS-65-015*GRACE,NON-ISOMORPHIC CONVEX POLYHEDRA|1|0|$ 5.80
*CS17|STAN-CS-65-017*FORSYTHE,WIRTH,AUTOMATIC GRADING PROGRAMS|1|0|$ 2.20
*CS19|STAN-CS-65-019*AGEEV,MACLAREN,RUSSIAN ALGOL IN ENGLISH|1|0|$ 1.90
*CS23|STAN-CS-65-023*RUDIN,CONVEX POLYNOMIAL APPROXIMATION|3|0|$ 3.00
*CS25|STAN-CS-65-025*HODGE,YIELD-PT LOAD BY NONLINEAR PROGRAMMING|3|0|$ 2.40
*CS27|STAN-CS-65-027*VOLKOV,METHOD OF NETS FOR POISSON EQUATION|1|0|$ 2.60
*CS28|STAN-CS-65-028*MILLER,STRANG,MATRIX THMS FOR PDE'S|1|0|$ 2.70
*CS31|STAN-CS-65-031*RAVIART,WEAK SOLS LINEAR PARABOLIC EQNS|2|0|$ 3.35
*CS32|STAN-CS-65-032*HOCKNEY,MINIMUM MULTIPLICATION FOURIER ANAL|1|0|$ 3.30
*CS37|STAN-CS-66-037*REYNOLDS,COGENT 1.2 OPERATIONS MANUAL|5|0|$ 2.70
*CS38|STAN-CS-66-038*MCCARTHY,PAINTER,CORRECTNESS OF A COMPILER|0|298|$ 2.10
*AIM40|SAME
*CS42|STAN-CS-66-042*KAHAN,WHEN NEGLECT OFF-DIAG ELTS SYMM TRI-DIAG MTX|3|0|$ 2.00
*CS49|STAN-CS-66-049*REDDY,COMPUTER SPEECH RECOGNITION|0|300|$ 6.00
*AIM43|SAME
*CS50|STAN-CS-66-050*PERSSON,SEQUENCE EXTRAPOLATING PROGRAMS|0|300|$ 7.00
*AIM46|SAME
*CS51|STAN-CS-66-051*BERGMAN,HERRIOT,KURTZ,TRANSONIC FLOW PATTERNS|5|0|$ 2.75
*CS55|STAN-CS-67-055*ADAMS,STOPPING CRITERION FOR POLYN.ROOT-FINDING|4|0|$ 2.05
*CS56|STAN-CS-67-056*BAUER,QD-METHOD WITH NEWTON SHIFT|3|0|$ 1.90
*CS62|STAN-CS-67-062*TIENARI,VARYING LENGTH FLOATING-PT ARITH|1|0|$ 2.85
*CS64|STAN-CS-67-064*RICHMAN,FLOATING-PT NUMBER REPRESENTATIONS|2|0|$ 2.65
*CS71|STAN-CS-67-071*JENKINS,TRAUB,AUTOMATIC POLYNOMIAL SOLVER|3|0|$ 2.85
*CS72|STAN-CS-67-072*GOLUB,SMITH,CHEBYSHEV APPROX BY CHEBYSHEV SYSTS|3|0|$ 3.30
*CS74|STAN-CS-67-074*FORSYTHE,WHAT IS SATISFACTORY QUAD-EQ SOLVER?|5|0|$ 2.00
*CS76|STAN-CS-67-076*ANSELONE,COLLECTIVELY COMPACT OPERATOR APPROX.|2|0|$ 3.50
*CS81|STAN-CS-67-081*GOLUB,WELSCH,GAUSS QUADRATURE RULES|5|0|$ 2.55
*CS82|STAN-CS-67-082*TESLER,ENEA,COLBY,DIGRAPH REPR BELIEF SYSTEMS|1|0|$ 2.65
*CS84|STAN-CS-68-084*FRIEDMAN,SYSTEM FOR TRANSFORMATIONAL GRAMMAR|4|0|$ 2.65
*CS94|STAN-CS-68-094*SHAW,FORMAL DESCR & PARSING OF PICTURES|1|0|$ 7.85
*SLACR84|SAME
*CS96|STAN-CS-68-096*SMITH,INTERVAL ARITH DET EVAL AND TESTING CHEB SYST|3|0|$ 2.50
*CS100|STAN-CS-68-100*BREDT,MODEL OF INFORM. PROC. IN CHILDREN|1|0|$ 3.50
*CS101|STAN-CS-68-101*KAPLAN,FORMAL STRONG EQUIV FOR ELEMENTAL PGMS|0|300|$ 9.60
*CS106|STAN-CS-68-106*HUBERMAN, PROGRAM TO PLAY CHESS END GAMES-THESIS|0|0|$ 9.60
*AIM65|SAME
*CS102|STAN-CS-68-102*PNUELI,INTEGER PROGRAMMING OVER A CONE|5|0|$ 2.60
*CS105|STAN-CS-68-105*RICHMAN, EPSILON CALCULUS|0|0|$ 5.85
*CS121|STAN-CS-69-121*MOLER,EIGENVALUES OF LAPLACIAN,RHOMBICAL DOM|5|0|$ 2.20
*AIM281|AIM-281*MANNA,WALDINGER,IS `SOMETIME' SOMETIMES BETTER?|315|177|$ 2.85
*AIM283|AIM-283*DAVIS,APPL OF META KNOWLEDGE TO LARGE KNOWLG BASES(THESIS)|0|331|$ .00
*AIM280|AIM-280*GROSSMAN,TOLERANCING IN DISCR PARTS MFG & ASSEMBLY|367|249|$ 2.40
*CS557|STAN-CS-76-557*PATERSON,INTRO TO BOOLEAN FUNCTION COMPLEXITY|249|18|$ 2.25
*CS559|STAN-CS-76-559*GOLUB ET AL,RANK DEGENERACY AND LEAST SQUARES|0|21|$ 2.75
*AIM282|AIM-282*TAYLOR,SYNTHESIS OF MANIPULATOR CNTRL PROGRMS(THESIS)|152|488|$ 8.10
*CS561|STAN-CS-76-561*WOODS,MATH PROG LANGUAGE: USER'S GUIDE|21|19|$ .00
*CS562|STAN-CS-76-562*KNUTH,TRABB PARDO,EARLY DEVEL OF PROG LANGUAGES|200|0|$ 3.50
*CS556|STAN-CS-76-556*GUIBAS,ANALYSIS OF HASHING ALGORITHMS(THESIS)|237|0|$ 5.55
*AIM237|AIM-237*WILKS,NATURAL LANGUAGE UNDERSTANDING SYSTEMS..PARADIGM|29|299|$ 2.85
*AIM14|AIM-14*MCCARTHY,COMPUTER CONTROL OF A MACHINE FOR EXPLORING MARS|63|0|$ 1.85
*AIM149|AIM-149*SCHMIDT,REAL-TIME CONTROL OF A COMPUTER DRIVEN VEHICLE|108|0|$ 6.75
*AIM220|AIM-220*BOLLES & PAUL,THE USE OF SENSORY FEEDBACK...SYSTEMS|41|0|$ 2.45
*CS538|STAN-CS-75-538*KNUTH & TRABB PARDO,ANALYSIS OF FACTORIZATION ALGORITHM|44|0|$ 3.00
*CS198|STAN-CS-71-198*BRENT,ALGORITHMS FOR FINDING ZEROS|0|0|$ .00
*CS405|STAN-CS-76-405*DAVIS & WRIGHT,STANFORD CSD RESEARCH REPORT|0|0|$ .00
*CS541|STAN-CS-76-541*KNUTH,MATH & COMPUTER SCIENCE:COPING WITH FINITENESS|0|0|$ .00
*CS547|STAN-CS-76-547*TARJAN,ITERATIVE ALGORITHMS FOR GLOBAL FLOW ANALYSIS|51|0|$ 2.60
*CS510|STAN-CS-75-510*YAO & KNUTH,ANALYSIS OF SUBTRACTIVE ALGORITHMS|85|0|$ 2.00
*CS528|STAN-CS-75-528*TARJAN,SOLVING PATH PROBLEMS ON DIRECTED GRAPHS|0|0|$ .00
*CS292|STAN-CS-72-292*CHVATAL ET AL,SELECTED COMBINATORIAL RESEARCH PROBLEMS|0|0|$ .00
*CS418|STAN-CS-74-418*SITES,PROVING COMPUTER PROGRAMS TERMINATE CLEANLY|0|0|$ .00
*CS482|STAN-CS-75-482*FRIEDMAN ET AL,ALGORITHM FOR FINDING BEST MATCHES|0|0|$ .00
*CS516|STAN-CS-75-516*STOER,QUADRATIC TERMINATION & CONVERGENCE PROPERTIES|0|0|$ .00
*CS147|STAN-CS-70-147*FORSYTHE,PITFALLS IN COMPUTATION|0|0|$ .00
*CS117|STAN-CS-68-117*ADAMS,COMP MODEL DATA-FLOW SEQUENCING|0|0|$ .00
*CS106|STAN-CS-68-106*HUBERMAN,PROGRAM TO PLAY CHESS END GAMES|0|0|$ .00
*AIM1|AIM-1*MCCARTHY, PREDICATE CALCULUS WITH UNDEFINED AS A TRUTH-VALUE|2|0|$ 1.85
*AIM2|AIM-2*MCCARTHY, SITUATIONS, ACTIONS, AND CAUSAL LAWS|19|0|$ 2.00
*AIM3|AIM-3*SAFIER, THE MIKADO AN AN ADVICE TAKER PROBLEM|4|0|$ 1.80
*AIM4|AIM-4*ENEA, CLOCK FUNCTION FOR LISP 1.5|0|0|$ .00
*AIM5|AIM-5*ENEA, WOOLDRIDGE, ALGEBRAIC SIMPLICATION|17|0|$ 1.75
*AIM6|AIM-6*WOOLDRIDGE, NON-PRINTING COMPILER|0|0|$ .00
*AIM7|AIM-7*MCCARTHY, PROGRAMS WITH COMMON SENSE|5|0|$ 1.90
*AIM8|AIM-8*MCCARTHY, STORAGE CONVENTIONS IN LISP 2|0|0|$ .00
*AIM9|AIM-9*WILLIAMS, COMPT EST FOR NO OF BISECTION OF AN NXN CHECKBD FOR N EVEN|0|0|$ .00
*AIM10|AIM-10*RUSSELL, IMPROVEMENTS IN LISP DEBUGGING|17|0|$ 1.80
*CS550|STAN-CS-76-550*TARJAN & TROJANOWSKI,FINDING MAX INDEPENDENT SET|33|0|$ 2.35
*CS551|STAN-CS-76-551*KNUTH,STATE OF ART OF COMPUTER PROGRAMMING|0|0|$ 3.40
*CS553|STAN-CS-76-553*TARJAN,COMPLEXITY OF MONOTONE NETWORKS|15|0|$ 2.35
*CS544|STAN-CS-76-544*MONT-REYNAUD,REMOVING TRIVIAL ASSIGNMENTS|0|0|$ .00
*CS554|STAN-CS-76-554*YU,MODELING WRITE BEHAVIOR(THESIS)|10|0|$ 7.25
*CS543|STAN-CS-76-543*ZAVE,OPTIMAL POLYPHASE SORTING|0|0|$ .00
*CS309|STAN-CS-72-309*LESSER,DYNAMIC CONTROL STRUCTURES|18|0|$ .00
*AIM11|AIM-11*WOOLDRIDGE, AN ALGEBRAIC SIMPLIFY PROGRAM IN LISP|0|0|$ .00
*AIM12|AIM-12*FELDMAN, DOCUMENTATION OF THE MACMAHON SQUARES PROBLEM|0|0|$ .00
*AIM13|AIM-13*WOOLDRIDGE, THE NEW LISP SYSTEM (LISP 1.55)|64|0|$ 1.80
*AIM15|AIM-15*FINKELSTEIN, SAFIER, AXIOMATIZATION & IMPLEMENTATION|9|0|$ 1.85
*AIM16|AIM-16*MCCARTHY, A TOUGH NUT FOR PROOF PROCEDURES|26|0|$ 1.80
*AIM17|AIM-17*MCCARTHY, FOR DESCRIP. OF THE GAME OF PANG-KE|26|0|$ 1.75
*AIM18|AIM-18*HEXT, AN EXPRESSION INPUT ROUTINE FOR LISP|8|0|$ 1.85
*AIM19|AIM-19*HEXT, PROGRAMMING LANGUAGES & TRANSLATION|3|0|$ 2.10
*AIM20|AIM-20*REDDY, SOURCE LANGUAGE OPTIMIZATION OF FOR-LOOPS|1|0|$ 2.40
*AIM21|AIM-21*MITCHELL, LISP 2 SPECIFICATIONS PROPOSAL|68|0|$ 2.05
*AIM22|AIM-22*RUSSELL, KALAH-THE GAME & THE PROGRAM|26|0|$ 2.05
*AIM23|AIM-23*RUSSELL, IMPROVEMENTS TO THE KALAH PROGRAM|51|0|$ 2.05
*AIM24|AIM-24*MCCARTHY, A FORMAL DESCRIPTION OF A SUBSET OF ALGOL|56|0|$ 2.90
*AIM25|AIM-25*MANSFIELD, A FORMAL SYSTEM OF COMPUTATION|41|0|$ 1.90
*AIM26|AIM-26*REDDY, EXPERIM.ON AUTO.SPEECH RECOGN.BY A DIGITAL COMPUTER|28|0|$ 2.25
*AIM27|AIM-27*MCCARTHY, PROOF-CHECKER FOR PREDICATE CALCULUS|54|0|$ 1.90
*AIM28|AIM-28*MCCARTHY|0|6|$ 1.90
*AIM29|AIM-29*WILLIAMS, ISOLATION IMPRTNT FEATURES OF MULTITONED PICTURE|1|0|$ 2.00
*AIM30|AIM-30*FEIGENBAUM,WATSON,INIT.PROB.STATEM.FOR MACHINE INDUCT.RES.|23|0|$ 1.95
*AIM31|AIM-31*MCCARTHY, PLANS FOR THE STANFORD A.I. PROJECT|6|0|$ 2.20
*AIM32|AIM-32*RATCHFORD, THE 138 ANALOG DIGITAL CONVERTER|5|0|$ 1.95
*AIM33|AIM-33*HUBERMAN, THE ADVICE TAKER & GPS|15|0|$ 1.95
*AIM34|AIM-34*CARAH, A TV CAMERA INTERFACE FOR THE PDP-1|86|0|$ 1.95
*AIM35|AIM-35*SAFIER, SIMPLE SIMON|0|0|$ .00
*AIM36|AIM-36*PAINTER, UTILIZATION OF A TV CAMERA ON THE PDP-1|69|0|$ 1.85
*AIM37|AIM-37*KORSVOLD, AN ON LINE ALGEBRAIC SIMPLIFICATION PROGRAM|0|0|$ .00
*AIM38|AIM-38*WATERMAN, A FILTER FOR A MACHINE INDUCTION SYSTEM|61|0|$ 2.25
*AIM39|AIM-39*PINGLE, PROGRAM TO FIND OBJECTS IN A PICTURE|33|0|$ 2.30
*AIM41|AIM-41*ABRAMS, RODE, PROP.FOR PROOF-CHECK.FOR CERTAIN AXIOM SYS.|0|0|$ .00
*AIM42|AIM-42*PINGLE, PROPOSAL FOR A VISUAL INPUT ROUTINE|70|0|$ 2.00
*AIM44|AIM-44*PAINTER, SEM.CORRECT COMPLR FOR ALGOL-LIKE LANG(THESIS)|0|0|$ .00
*AIM45|AIM-45*KAPLAN, SOME COMPLET.RESULT IN MATH. THEORY OF COMP.|68|0|$ 2.30
*AIM47|AIM-47*BUCHANAN, LOGICS OF SCIENTIFIC DISCOVERY|0|0|$ .00
*AIM48|AIM-48*KAPLAN, CORRECTNESS OF COMPILER FOR ALGOL-LIKE PROGRAMS|25|0|$ 3.00
*AIM49|AIM-49*SUTHERLAND, DENDRAL-COMP.PROG.FOR GENER. & FILTER CHEMICAL|28|0|$ 2.65
*AIM50|AIM-50*HEARN, REDUCE USERS' MANUAL|1|0|$ 3.20
*AIM51|AIM-51*EARNEST, CHOOSING AN EYE FOR A COMPUTER|43|0|$ 6.00
*AIM52|AIM-52*SAMUEL, STUDIES IN MACHINE LEARN USING GAME CHECKERS II|14|0|$ 3.05
*AIM53|AIM-53*WEIHER, THE PDP-6 PROOF CHECKER|16|0|$ 3.00
*AIM54|AIM-54*LEDERBERG, FEIGENBAUM, MECH.OF INDUCT.INFER.ORGANIC CHEM|1|0|$ 2.60
*AIM55|AIM-55*FELDMAN, FIRST THOUGHTS OF GRAMMATICAL INFERENCE|0|0|$ 2.20
*AIM56|AIM-56*WICHMAN, OPTICAL FEEDBACK IN COMP.CONT. OF ARM-THESIS|83|0|$ 3.65
*AIM57|AIM-57*HEARN, REDUCE,USER-ORIENT INTERACT.SYS.ALGEBRA SIMP.|58|0|$ 3.65
*AIM58|AIM-58*CALLERO, ADAPT.COMMAND & CONT.SYS.UTIL.HEUR.LEARN(THESIS)|0|0|$ .00
*AIM59|AIM-59*KAPLAN, FORMAL THEORY CONCERN THE EQUIVALENCE OF ALGORITHMS|1|0|$ 2.30
*AIM60|AIM-60*KAPLAN, FORMAL THEORY ANLSIS STRNG EQUIV ELEMT PROG-THESIS|13|0|$ 9.05
*AIM61|AIM-61*ITO, NOTES ON THEORY COMPUTATION & PATTERN RECOGN|5|0|$ 5.75
*AIM62|AIM-62*BUCHANAN, SUTHERLAND, HEURISTIC DENDRAL|0|0|$ .00
*AIM63|AIM-63*KAPLAN, REG. EXPRESS. & THE EQUIVALANCE OF PROGRAMS|31|0|$ 2.90
*AIM64|AIM-64*MANNA, FORMALIZATION OF PROPERTIES OF PROGRAMS|0|0|$ .00
*AIM66|AIM-66*FELDMAN, ROVNER, AN ALGOL-BASED ASSOCIATIVE LANGUAGE|0|0|$ .00
*AIM67|AIM-67*FEIGENBAUM, A.I.: THEMES IN THE SECOND DECADE|0|0|$ .00
*AIM68|AIM-68*MANNA, PNUELI, VALIDITY PROBLEM OF 91-FUNCTION|17|0|$ 2.25
*AIM69|AIM-69*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|1|0|$ 4.40
*AIM70|AIM-70*HEARN, THE PROBLEM OF SUBSTITUTION|26|0|$ 2.10
*AIM71|AIM-71*VICENS, PREPROCESSING FOR SPEECH ANALYSIS|1|0|$ 2.70
*CS116|STAN-CS-68-116*PIEPER, KINEMATICS OF MANIP.UNDER COMP.CONTRL.|0|0|$ .00
*AIM72|SAME
*AIM73|AIM-73*MCCARTHY, HAYES, PHILOSPCL.PROB.FROM STANDPT. OF A.I.|1|0|$ 3.25
*CS118|STAN-CS-68-118*WATERMAN, MACHINE LEARNING OF HEURISTICS-THESIS|0|0|$ .00
*AIM74|SAME
*AIM75|AIM-75*SCHANK, NOTION LING CONCEPT:PRELUDE TO MECH TRANSLATION|0|0|$ .00
*AIM76|AIM-76*SCHANK, CONCEPTUAL PARSER FOR NATURAL LANGUAGE|0|0|$ .00
*AIM77|AIM-77*BECKER, MDL SMPL ANAL & INDCTVE PROCES SEMANTIC MEMORY SYS|5|0|$ 2.30
*AIM78|AIM-78*REDDY, USE ENVRMTL SNTC & PRBLSTC CONSTRNT IN VSN & SPEECH|12|0|$ 2.35
*AIM79|AIM-79*REDDY, NEELY, CONTXTAL ANALYSIS OF PHONEMES OF ENGLISH|14|0|$ 3.70
*AIM80|AIM-80*SUTHERLAND, HEURISTIC DENDRAL: A FAMILY OF LISP PROGRAMS|0|0|$ .00
*AIM81|AIM-81*LUCKHAM, REFINEMENT THEOREMS IN RESOLUTION THEORY|0|0|$ .00
*AIM82|AIM-82*MANNA, FRMLZTN PROPERTIES OF RECURSVLY DEFINED FUNCTIONS|0|0|$ .00
*CS130|STAN-CS-69-130*SCHANK, REPR FOR COMPUTER-ORIENTED SEMANTICS(THESIS)|0|0|$ .00
*AIM83|SAME
*AIM84|AIM-84*SMITH, MLISP USERS'S MANUAL|0|0|$ .00
*CS127|STAN-CS-69-127*VICENS, ASPTS OF SPEECH RECOGNTN BY COMPTR-THESIS|1|0|$ 8.00
*AIM85|SAME
*AIM86|AIM-86*HAYES, MACHINE-ORIENT FRMLTN OF EXTND FNCTNL CALCULUS|0|0|$ .00
*AIM87|AIM-87*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ .00
*AIM88|AIM-88*SCHANK, LINGUISTICS FROM A CONCEPTUAL VIEWPOINT|0|0|$ .00
*CS125|STAN-CS-69-125*FELDMAN ET AL, GRAMTCL CMPLXTY & INFERENCE|16|0|$ 4.50
*AIM89|SAME
*AIM90|AIM-90*HEARN, STANDARD LISP|0|0|$ .00
*AIM91|AIM-91*CAMPBELL, HEARN, SMBLC ANLSIS OF FEYNMAN DIAGRAMS BY CMPTR|1|0|$ 3.75
*AIM92|AIM-92*SCHEINMAN, DESIGN OF A COMPUTER CONTROLLED MANIPULATOR|0|0|$ .00
*AIM93.1|AIM-93.1*FELDMAN, DCDBLTY RSLTS ON GRMTCL INFRNCE & CMPLITY|16|0|$ 2.55
*AIM94|AIM-94*COLBY ET AL, EXPRMT W/SRCH ALGRTM ON DTA BASE HUMAN BLF STR|1|0|$ 2.50
*AIM95|AIM-95*MANNA, CORRECTNESS OF NON-DETERMINISTIC PROGRAMS|0|0|$ .00
*CS138|STAN-CS-69-138*GREEN, APLCTN THERM PROVG TO QSTN-ANSRG SYS-THESIS|0|0|$ .00
*AIM96|SAME
*AIM97|AIM-97*COLBY, SMITH, DILGS BTWN HMNS & ARTFCL BLF SYS|3|0|$ 2.50
*CS139|STAN-CS-69-139*HORNING, STUDY OF GRAMMATICAL INFRENCE-THESIS|38|0|$ 6.35
*AIM98|SAME
*AIM99|AIM-99*BUCHANAN ET AL, UNDERSTNDG INFO PROCS SCI INFR IN ORGC CHEM|0|0|$ .00
*AIM100|AIM-100*MANNA, MCCARTHY, PROP OF PROGRAMS & PARTIAL FNTN LOGIC|5|0|$ 2.30
*AIM101|AIM-101*PAUL ET AL, COMPTR RPRSNTATN OF SMPLY DSCRBD SCENES|0|0|$ .00
*AIM102|AIM-102*WATERMAN, GNRLZTN LEARN FOR AUTO LEARN OF HEURISTICS|1|0|$ 3.95
*AIM103|AIM-103*ALLEN, LUCKHAM, INTERACTIVE THEOREM-PROVE PROGRAM|24|0|$ 2.45
*AIM104|AIM-104*LEDERBERG ET AL, HRSTC PRGRM SOLV SCI INFRNCE PRBLM|23|0|$ 2.15
*AIM105|AIM-105*HEUCKEL, OPRTR WHICH LOCTS EDGES IN DGTZD PICTURES|0|0|$ .00
*AIM106|AIM-106*KAHN,NEAR-MIN-TIME CNTRL OPN-LOOP ART KINMTC CHNS-THESIS|32|0|$ 6.50
*AIM107|AIM-107*FALK, IMPLCTNS OF PLANARITY FOR MACHINE PERCEPTION|0|0|$ 2.50
*AIM108|AIM-108*KELLY, EDGE DTCTN IN PCTRS BY CMPTR USING PLNG|0|0|$ .00
*AIM109|AIM-109*SCHANK ET AL, SPINOZA II: CNCPTAL CASE-BASE NTRL LANG ANLS|0|0|$ .00
*AIM110|AIM-110*ASHCROFT, MANNA, FORMALIZATION OF PARALLEL PROG PROPS|0|0|$ .00
*AIM111|AIM-111*MANNA,SECOND-ORDER MATH THEORY OF COMPUTATION|1|0|$ 2.45
*AIM112|AIM-112*HILF ET AL, MACHINE-MEDIATED INTERVIEWING|0|0|$ .00
*AIM113|AIM-113*COLBY ET AL, MUTE PATIENT EXPERIENCE W/MACHINE INTERVIEW|0|0|$ .00
*AIM114|AIM-114*BIERMANN, FELDMAN, SYNTHESIS OF FINITE-STATE ACCEPTORS|0|0|$ .00
*AIM115|AIM-115*MONTANARI, OPTIMAL DETECTION OF CRVS IN NOISY PCTRS|36|0|$ 2.70
*AIM116|AIM-116*COLBY, MIND & BRAIN, AGAIN|0|0|$ .00
*AIM117|AIM-117*MCCARTHY ET AL, PROJECT TECHNICAL REPORT|0|0|$ 3.95
*AIM118|AIM-118*MONTANARI, HURSTCLY GUIDED SEARCH & CHROMOSOME MATCH|23|0|$ 2.50
*AIM119|AIM-119*BECKER, INFO-PROCES MODEL OF INTRMEDAT-LVL COGNITION-THESIS|0|0|$ .00
*AIM120|AIM-120*COLBY, SMITH, CPTR CTLST TREATMT OF NNSPKG AUTISTIC CHILD|8|0|$ 2.60
*AIM121|AIM-121*SOBEL, CAMERA MODELS & MACHINE PERCEPTION-THESIS|0|0|$ .00
*AIM122|AIM-122*SCHANK, `SEMANTICS' IN CONCEPTUAL ANALYSIS|0|0|$ .00
*AIM123|AIM-123*BUCHANAN ET AL, SPCLATN ABOUT A.I. & LEGAL RESNG|3|0|$ 3.20
*AIM124|AIM-124*ASTRAHAN, SPECH ANALS BY CLUSTRG, OR HYPERPHONEME MTHD|48|0|$ 2.30
*AIM125|AIM-125*COLBY ET AL, ARTIFICIAL PARANOIA|4|0|$ 2.75
*CS169|STAN-CS-70-169*KNUTH,EXAMPLES OF FORMAL SEMANTICS|4|0|$ 2.70
*AIM126|SAME
*CS174|STAN-CS-70-174*MANNA, WALDINGER, TWRDS AUTO PROGRAM SYNTHESIS|73|0|$ 3.20
*AIM127|SAME
*CS166|STAN-CS-70-166*SANDEWALL, RPRSNTG NATURAL-LNGUGE INFO PRDICT CALCULUS|0|0|$ .00
*AIM128|SAME
*CS167|STAN-CS-70-167*IGARASHI, SEMANTICS OF ALGOL-LICK STATEMENTS|0|0|$ 4.55
*AIM129|SAME
*CS168|STAN-CS-70-168*KELLY, VSUL I.D. OF PEOPLE BY COMPUTER-THESIS|0|0|$ 8.85
*AIM130|SAME
*CS176|STAN-CS-70-176*FEIGENBAUM ET AL ON GENERALITY & PROBLEM SOLVING|0|0|$ .00
*AIM131|SAME
*CS180|STAN-CS-70-180*FLAK,CMPTR INTPRT IMPRFT LINE DTA AS 3D SCNE-THESIS|0|0|$ 7.30
*AIM132|SAME
*CS181|STAN-CS-70-181*HEARN, REDUCE 2|0|0|$ .00
*AIM133|SAME
*CS182|STAN-CS-70-182*TENENBAUM, ACMDATN IN COMPUTER VISION-THESIS|0|0|$ .00
*AIM134|SAME
*CS179|STAN-CS-70-179*SMITH, MLISP|83|0|$ 4.50
*AIM135|SAME
*CS183|STAN-CS-70-183*WHITE, MCHN LEARN THRU SGNTR TREES APPLY TO HUMAN SPEECH|0|0|$ .00
*AIM136|SAME
*AIM137|AIM-137*KNUTH, AN EMPIRICAL STUDY OF FORTRAN IN USE|0|0|$ .00
*CS188|STAN-CS-71-188*ASHCROFT&MANNA,TRNSLAT OF GO-TO PRGM TO WHILE PRGM|9|0|$ 2.50
*AIM138|SAME
*CS189|STAN-CS-71-189*MANNA, MATH THEORY OF PARTIAL CORRECTNESS|123|0|$ 2.40
*AIM139|SAME
*CS193|STAN-CS-71-193*SCHANK, INTENTION MEMORY & COMPUTER UNDERSTANDING|0|0|$ .00
*AIM140|SAME
*CS203|STAN-CS-71-203*BUCHANAN ET AL, HRSTC DENDRAL PRGM FOR EXPLAIN EMPIRCL DTA|0|0|$ .00
*AIM141|SAME
*CS205|STAN-CS-71-205*MILNER, ALGBRC DEFNTN SMULTN BTWN PRGMS|22|0|$ 2.30
*AIM142|SAME
*CS209|STAN-CS-71-209*MCCARTHY ET AL, PROJECT TECH REPORT|1|0|$ 4.10
*AIM143|SAME
*CS219|STAN-CS-71-219*QUAM, COMPUTER COMPARISON OF PICTURES-THESIS|29|0|$ 5.05
*AIM144|SAME
*CS221|STAN-CS-71-221*BUCHANAN ET AL, HRSTC PRGMG STDY OF THEORY FRMTN IN SCI|0|0|$ .00
*AIM145|SAME
*CS224|STAN-CS-71-224*ERSHOV, PARALLEL PROGRAMMING|7|0|$ 2.10
*AIM146|SAME
*CS216|STAN-CS-71-216*KLING, RESNG ANGLY W/APPLY TO HRSTC PRBLM SLOVG-THESIS|0|0|$ .00
*AIM147|SAME
*CS217|STAN-CS-71-217*ASHCROFT ETAL,DCDBL PRPTS OF MONADIC FNTNL SCHEMAS|76|0|$ 2.00
*AIM148|SAME
*AIM150|AIM-150*FLOYD, TOWARD INTERACTIVE DESIGN OF CORRECT PROGRAMS|8|0|$ 2.05
*CS240|STAN-CS-71-240*LONDON, CORRECTNESS OF 2 COMPILERS FOR LISP SUBSET|0|0|$ 2.95
*AIM151|SAME
*CS241|STAN-CS-71-241*BIERMANN, INFERENCE OF TURING MACH FRM SAMP COMPUTATIONS|0|0|$ .00
*AIM152|SAME
*CS242|STAN-CS-71-242*HAYES, FRAME PRBLM & RELATE PRBLM IN A.I.|3|0|$ 2.20
*AIM153|SAME
*CS243|STAN-CS-71-243*MANNA ET AL, INDCTV METHOD FOR PROVE PROPERTIES OF PRGMS|0|0|$ .00
*AIM154|SAME
*CS245|STAN-CS-71-245*RYDER,HRSTC ANLS OF LRG TRES GNRAT GAME GO-THESIS|0|0|$ 10.10
*AIM155|SAME
*CS246|STAN-CS-71-246*COLBY ET AL, TEST VLD OF CMPTR SIMLAT PARNOD PRCES|106|0|$ 2.50
*AIM156|SAME
*CS247|STAN-CS-71-247*WILKS, ONE SMALL HEAD|0|0|$ .00
*AIM157|SAME
*CS250|STAN-CS-71-250*CHANDRA & MANNA, PROGRAM SCHEMAS WITH EQUALITY|20|0|$ 2.05
*AIM158|SAME
*CS253|STAN-CS-72-253*FELDMAN & SHIELDS, TTL CMPLX & INFRNCE OF BST PRGMS|13|0|$ 2.85
*AIM159|SAME
*CS255|STAN-CS-72-255*FELDMAN, AUTOMATIC PROGRAMMING|0|0|$ .00
*AIM160|SAME
*CS264|STAN-CS-72-264*WILKS, A.I. APPROACH TO MACHINE TRANSLATION|0|0|$ .00
*AIM161|SAME
*CS265|STAN-CS-72-265*SCHANK ET AL, PRIMTIV CNCEPTS UNDERLYING VERBS OF THOUGHT|0|0|$ .00
*AIM162|SAME
*CS266|STAN-CS-72-266*CADIOU, RCRSV DFNTNS PRTAL FNCTS & THER CMPTS-THESIS|0|0|$ 6.20
*AIM163|SAME
*CS272|STAN-CS-72-272*MANNA,VUILLEMIN, FXPT APRCH TO THEORY OF CMPUTN|11|0|$ 2.50
*AIM164|SAME
*CS280|STAN-CS-72-280*BOCHVAR, 2 PAPERS ON PARTIAL PREDICATE CALCULUS|1|0|$ 3.20
*AIM165|SAME
*CS281|STAN-CS-72-281*QUAM ET AL, CMPTR INTRACTV PICT PRCSG|63|0|$ 2.85
*AIM166|SAME
*CS282|STAN-CS-72-282*CHANDRA, EFFICIENT COMPILATION OF LNR RCRSV PRGRMS|23|0|$ 2.90
*AIM167|SAME
*CS287|STAN-CS-72-287*IGARASHI, ADMSBLY FXDPT INDCT 1ST-ODR LGC TYPD THRY|36|0|$ 2.85
*AIM168|SAME
*CS288|STAN-CS-72-288*MILNER, LOGIC FOR COMPUTABLE FUNCTIONS|0|0|$ .00
*AIM169|SAME
*CS289|STAN-CS-72-289*WILKS, LAKOFF ON LINGUISTICS & NATURAL LOGIC|0|0|$ .00
*AIM170|SAME
*CS290|STAN-CS-72-290*SCHANK, ADVERBS & BELIEF|0|0|$ .00
*AIM171|SAME
*CS299|STAN-CS-72-299*RUSSELL, SMTC CATS NMNLS CNCPTL DEPEND ANALS NAT LANG|0|0|$ .00
*AIM172|SAME
*CS305|STAN-CS-72-305*AGIN, RPRSNT & DESCRIP OF CRVD OBJECTS-THESIS|0|0|$ .00
*AIM173|SAME
*CS303|STAN-CS-72-303*MORRIS, CRTNS OF TRNSLTNS OF PROGRMG LANG-THESIS|0|0|$ .00
*AIM174|SAME
*CS307|STAN-CS-72-307*TANAKA, HADAMARD TRNSFRM SPEECH WAVE ANLS|57|0|$ 2.65
*AIM175|SAME
*CS308|STAN-CS-72-308*FELDMAN ET AL, RECENT DEVELOPMNTS IN SAIL|0|0|$ .00
*AIM176|SAME
*CS311|STAN-CS-72-311*PAUL, MDLG TRJCT CALCUL & SERVOG A CMPTR CNTRLD ARM-THESIS|0|0|$ .00
*AIM177|SAME
*CS312|STAN-CS-72-312*GILL, VSL FDBC & RLTD PRBLM CMTR CTRLD HND EYE CORD-THESIS|0|0|$ .00
*AIM178|SAME
*CS320|STAN-CS-72-320*BAUMGART, WINGED EDGE POLYHEDRON REPRESENTATION|0|0|$ .00
*AIM179|SAME
*CS321|STAN-CS-72-321*BAJCSY, CMPTR I.D. OF TXTRD VISUAL SCENES-THESIS|0|0|$ .00
*AIM180|SAME
*CS325|STAN-CS-72-325*BUCHANAN, RVU HUBERT DREYFUS' WT CMPTRS CNT DO|0|0|$ .00
*AIM181|SAME
*CS326|STAN-CS-72-326*COLBY & HILF, TRNSCPT SMULTN PARANOID PROCS|0|0|$ .00
*AIM182|SAME
*CS344|STAN-CS-73-344*SCHANK, 14 PRIMITIVE ACTIONS & THEIR INFERENCES|0|0|$ .00
*AIM183|SAME
*CS330|STAN-CS-73-330*NEWEY, AXIOMS & THRY INTGRS LSTS & FINIT SETS LCF|0|0|$ 3.30
*AIM184|SAME
*CS333|STAN-CS-73-333*CHANDRA & MANNA, ON THE POWER OF PROGRAMMING FEATURES|0|0|$ .00
*AIM185|SAME
*CS332|STAN-CS-73-332*MILNER, MODELS OF LCF|0|0|$ .00
*AIM186|SAME
*CS331|STAN-CS-73-331*COLLINS, COMPUTING TIME OF THE EUCLIDEAN ALGORITHM|0|0|$ .00
*AIM187|SAME
*CS336|STAN-CS-73-336*CHANDRA, PROPERTIES & APPLICTNS OF PRGRM SCHEMAS-THESIS|0|0|$ .00
*AIM188|SAME
*CS337|STAN-CS-73-337*GIPS & STINY, AESTHETICS SYSTEMS|0|0|$ .00
*AIM189|SAME
*CS340|STAN-CS-73-340*NEWEY, NTS ON PRBLM INVOLVG PRMUTNS AS SQUNCES|18|0|$ 2.25
*AIM190|SAME
*CS341|STAN-CS-73-341*KATZ & MANNA, HEURISTIC APPROACH TO PRGRM VERIFY|14|0|$ 2.85
*AIM191|SAME
*CS345|STAN-CS-73-345*COLLINS & HOROWITZ, MIN ROOT SEPART OF A PLYNMAL|115|0|$ 2.05
*AIM192|SAME
*CS346|STAN-CS-73-346*COLBY, CMPTR TRTMT LANG DFICLT NSPEKG AUTISTIC CHLD|0|0|$ 2.10
*AIM193|SAME
*CS347|STAN-CS-73-347*COLBY & HILF, ANALYSIS SIMULAT PARANOID THOUGHT|118|0|$ 2.00
*AIM194|SAME
*CS356|STAN-CS-73-356*SMITH & ENEA, MLISP2|4|0|$ 4.25
*AIM195|SAME
*CS357|STAN-CS-73-357*GOLDMAN & RIESBECK, CNCPTULY BASED SENTENCE PRAPHRSR|0|0|$ .00
*AIM196|SAME
*CS358|STAN-CS-73-358*SCHANK & RIEGER, INFRNCE & CMPTR UDRSTNDG NAT LANG|0|0|$ .00
*AIM197|SAME
*CS364|STAN-CS-73-364*THOSAR, ESTMA DNSTY USE SIG TABL APPLY PAT RECOG|69|0|$ 2.75
*AIM198|SAME
*CS398|STAN-CS-73-398*BAUMGART, IMAGE CONTOURING & COMPARING|32|0|$ 3.15
*AIM199|SAME
*CS365|STAN-CS-73-365*IGARASHI ET AL, AUTOMATIC PROGRAM VERIFICATION I|0|298|$ .00
*AIM200|SAME
*CS366|STAN-CS-73-366*GRAPE, MODEL BASED COMPUTER VISION-THESIS|0|0|$ .00
*AIM201|SAME
*CS368|STAN-CS-73-368*SCHANK & WILKS, GOALS OF LINGUISTIC THEORY REVISITED|0|0|$ .00
*AIM202|SAME
*CS369|STAN-CS-73-369*SCHANK, DEVELOPMENT OF CONCEPTUAL STRUCTURES IN CHILD|0|0|$ .00
*AIM203|SAME
*CS373|STAN-CS-73-373*VANLEHN, SAIL USERS MANUAL|0|0|$ 5.10
*AIM204|SAME
*CS370|STAN-CS-73-370*SRIDHARAN ET AL, HRSTC PRGRM FOR CMPLX ORGNC MLCULS|0|0|$ .00
*AIM205|SAME
*CS377|STAN-CS-73-377*WILKS, PREFERENCE SEMANTICS|51|0|$ 2.25
*AIM206|SAME
*CS378|STAN-CS-73-378*MOORER, OPTIMUM-COMB METHOD PITCH ANALYSIS|129|0|$ 2.40
*AIM207|SAME
*CS379|STAN-CS-73-379*MOORER, HETERODYNE METHOD ANALYSIS WAVEFORMS|124|0|$ 2.40
*AIM208|SAME
*CS380|STAN-CS-73-380*YAKIMOVSKY, SCNE ANAL USE SEMNTC BASE RGN GROW-THESIS|0|0|$ .00
*AIM209|SAME
*CS382|STAN-CS-73-382*MANNA & PNUELI, AXMTC APRCH TO CORRECT PRGRM|60|0|$ 2.40
*AIM210|SAME
*CS383|STAN-CS-73-383*WILKS, NATURAL LANGUAGE INFERENCE|0|0|$ .00
*AIM211|SAME
*CS384|STAN-CS-73-384*HERSKOVITS, GNRTN OF FRENCH FRM SEMANTIC REPSENT|0|0|$ .00
*AIM212|SAME
*CS385|STAN-CS-73-385*THOSAR, RECOGNITION OF CONTINUOUS SPEECH|54|0|$ 2.75
*AIM213|SAME
*CS386|STAN-CS-73-386*PERKINS & BINFORD, CRNR FNDR FOR VSAL FDBK|7|0|$ 3.35
*AIM214|SAME
*CS387|STAN-CS-73-387*BUCHANAN & SRIDHARAN, ANLS OF BEHAV OF CHEM MOLCLS|1|0|$ 2.15
*AIM215|SAME
*CS389|STAN-CS-73-389*MASINTER ET AL, APPLY OF A.I. FOR CHEM INFERENCE|0|0|$ .00
*AIM216|SAME
*CS391|STAN-CS-73-391*SRIDHARAN, SRCH STRTGES TSK ORGNC CHEM SYNTHESIS|0|0|$ .00
*AIM217|SAME
*CS393|STAN-CS-73-393*VUILLEMIN, PROOF TECHNIQUES FOR RECURSIVE PRGRM-THESIS|0|0|$ .00
*AIM218|SAME
*CS394|STAN-CS-73-394*HOARE, PARALLEL PROGRAMMING|0|0|$ .00
*AIM219|SAME
*CS447|STAN-CS-74-447*AIELLO ET AL, SEMANTICS OF PASCAL IN LCF|0|299|$ .00
*AIM221|SAME
*CS467|STAN-CS-74-467*AIELLO,WEYHRAUCH, CHK PRFS METAMATH 1STORDR LGC|90|299|$ 3.25
*AIM222|SAME
*CS400|STAN-CS-73-400*HOARE, RECURSIVE DATA STRUCTURES|0|297|$ 2.70
*AIM223|SAME
*CS403|STAN-CS-73-403*HOARE, HINTS ON PROGRAMMING LANGUAGE DESIGN|0|297|$ .00
*AIM224|SAME
*CS406|STAN-CS-74-406*PERKINS, MOMORY MODEL FOR A ROBOT|0|299|$ .00
*AIM225|SAME
*CS407|STAN-CS-74-407*WRIGHT & GORIN, FAIL|7|299|$ 3.40
*AIM226|SAME
*CS408|STAN-CS-74-408*THOMAS & BINFORD, INFO PRCSG ANALS VSUL PRECPT|32|299|$ 3.10
*AIM227|SAME
*CS409|STAN-CS-73-409*EARNEST, FINAL RPT:1ST 10YRS AI RSRCH AT STANFORD|1|298|$ 5.25
*AIM228|SAME
*CS411|STAN-CS-74-411*ANDERSON ET AL, AFTER LEIBNIZ...|0|299|$ 3.00
*AIM229|SAME
*CS412|STAN-CS-74-412*SWINEHART, COPILOT-THESIS|0|299|$ .00
*AIM230|SAME
*CS413|STAN-CS-74-413*GIPS, SHAPE GRAMMARS & THEIR USES|0|297|$ .00
*AIM231|SAME
*CS414|STAN-CS-74-414*BAUMGART, GEOMED-GEOMETRIC EDITOR|0|297|$ .00
*AIM232|SAME
*CS419|STAN-CS-74-419*RIEGER,CONCEPTUAL MEMORY-THESIS|0|293|$ .00
*AIM233|SAME
*CS431|STAN-CS-74-431*COLBY ET AL, PTRN-MTCHG RULE FOR RECOG NAT LANG EXPR|0|299|$ .00
*AIM234|SAME
*CS432|STAN-CS-74-432*WEYHRAUCH & THOMAS, FOL: PRF CHK 1ST ORDR LGC|93|299|$ 3.30
*AIM235|SAME
*CS433|STAN-CS-74-433*BUCHANAN & LUCKHAM, AUTOING CNSTRCTN OF PRGRMS|0|297|$ .00
*AIM236|SAME
*CS437|STAN-CS-74-437*RIESBECK, COMPUTATIONAL UNDERSTANDING-THESIS|1|296|$ 9.05
*AIM238|SAME
*CS438|STAN-CS-74-438*HANNAH, CMPTR MTCHG OF AREAS IN STERO IMGS-THESIS|1|299|$ 4.70
*AIM239|SAME
*CS444|STAN-CS-74-444*GREEN ET AL, PRGRS RPT ON PRGRM-UNDRSTNDG SYS|1|294|$ 3.10
*AIM240|SAME
*CS446|STAN-CS-74-446*AIELLO & WEYHRAUCH, LCFSMALL|38|299|$ 2.95
*AIM241|SAME
*CS452|STAN-CS-74-452*LOW, AUTOMATIC CODING-THESIS|0|296|$ .00
*AIM242|SAME
*CS456|STAN-CS-74-456*FINKEL ET AL, AL-PRGRMG SYS FOR AUTO|0|296|$ .00
*AIM243|SAME
*CS457|STAN-CS-77-457*COLBY, 10 CRITICISMS OF PARRY|5|299|$ 1.90
*AIM244|SAME
*CS458|STAN-CS-74-458*BUCHANAN, STUDY IN AUTOMATIC PROGRAMMING-THESIS|0|298|$ .00
*AIM245|SAME
*CS459|STAN-CS-74-459*WINOGRAD, 5 LECTURES ON A.I.|0|0|$ 2.60
*AIM246|SAME
*CS461|STAN-CS-74-461*GOLDMAN, CPTR GENR NAT LANG DEP CNCPT BAS-THESIS|1|297|$ 11.25
*AIM247|SAME
*CS462|STAN-CS-75-462*PINGLE & THOMAS, FST FETUR-DRVN STERO DPTH PRGRM|54|299|$ 2.15
*AIM248|SAME
*CS463|STAN-CS-74-463*BAUMGART, GEOMTRC MDLG FOR CMPTR VSN-THESIS|12|299|$ 5.65
*AIM249|SAME
*CS464|STAN-CS-74-464*DSCRPT CMPLX CRVD OBJTS RECOG & VSUL MMRY-THESIS|3|296|$ 5.50
*AIM250|SAME
*CS465|STAN-CS-74-465*SHORTLIFFE, MYCIN-THESIS|0|294|$ .00
*AIM251|SAME
*CS466|STAN-CS-74-466*EARNEST, RSRCH IN AI, HRSTC PRGRMG & NTWRK PRTCL|6|299|$ 3.80
*AIM252|SAME
*CS471|STAN-CS-74-471*FAUGHT ET AL, AFTS & INTNTNS IN MDL OF PARANOIA|87|299|$ 2.75
*AIM253|SAME
*CS472|STAN-CS-74-472*QUAM & HANNAH, STANFORD AUTO PHOTOGRMETRY RSRCH|84|299|$ 2.15
*AIM254|SAME
*CS473|STAN-CS-74-473*SUZUKI, AUTOMATIC PROGRAM VERIFICATION II|8|299|$ 2.50
*AIM255|SAME
*CS474|STAN-CS-74-474*V.HENKE & LUCKHAM, AUTO PROGRAM VERIFICATION III|0|298|$ .00
*AIM256|SAME
*CS475|STAN-CS-75-475*NEWEY, FRML SMNTS LISP W/APLY TO PRGRM CRT-THESIS|2|298|$ 7.25
*AIM257|SAME
*CS476|STAN-CS-75-476*GREEN & BARSTOW, HYPTCL DIAL FOR PRGRM-UDRSTDG SYS|0|299|$ .00
*AIM258|SAME
*CS498|STAN-CS-75-498*SAMET, AUTO PRVG CRCT TRNSLATNS INVLV CODE-THESIS|2|298|$ 7.70
*AIM259|SAME
*CS499|STAN-CS-75-499*SMITH, PYGMALION-THESIS|0|297|$ .00
*AIM260|SAME
*CS501|STAN-CS-75-501*PETTERSEN, PROCDRAL EVNTS AS SOFTWARE INTERRUPTS|66|298|$ 1.95
*AIM261|SAME
*CS502|STAN-CS-75-502*PETTERSEN, SYNCHRONIZATION OF CONCURRENT PROCES|59|298|$ 2.10
*AIM262|SAME
*CS503|STAN-CS-75-503*PETTERSEN, MACRO PROCESSING SYSTEM STAGE2|112|299|$ 2.25
*AIM263|SAME
*CS506|STAN-CS-75-506*GORDON, OPERATION REASON & DENOTATION SEMANTICS|106|298|$ 2.65
*AIM264|SAME
*CS507|STAN-CS-75-507*GORDON TWRDS SEMANTIC THEORY DYNAMIC BINDG|112|298|$ 2.50
*AIM265|SAME
*CS517|STAN-CS-75-517*DAVIS ET AL, RULES KNLDG-BASE CONSULT PRGRM|147|299|$ 2.75
*AIM266|SAME
*CS520|STAN-CS-75-520*V.HENKE, DATA STRUCTURES IN LCF|299|299|$ 2.85
*AIM267|SAME
*CS521|STAN-CS-75-521*THOMPSON, DEPTH PERCEPTION STEREO CMPTR VSN|232|299|$ 2.15
*AIM268|SAME
*CS522|STAN-CS-75-522*LUCKHAM ET AL, AUTO PROGRAM VERIFICATION IV|185|299|$ 2.50
*AIM269|SAME
*CS523|STAN-CS-75-523*REISER, BAIL|19|299|$ 2.45
*AIM270|SAME
*CS524|STAN-CS-75-524*DAVIS & KING, OVERVIEW OF PRODUCTION SYSTEMS|81|299|$ 2.85
*AIM271|SAME
*CS525|STAN-CS-75-525*GANAPATHY, SCENES CONTAINING POLYHEDRA-THESIS|26|299|$ 7.40
*AIM272|SAME
*CS534|STAN-CS-75-534*HEMPHILL, SPRCH TO AUTO LANG UNDRSTD & BLF-THESIS|0|298|$ .00
*AIM273|SAME
*CS536|STAN-CS-75-536*GROSSMAN & TAYLOR, GNRTN OBJCT MDLS W/MANIPLATR|223|299|$ 2.60
*AIM274|SAME
*CS537|STAN-CS-75-537*BOLLES, VSN WITHIN PRGRMBL ASSY SYS|84|299|$ 4.00
*AIM275|SAME
*CS539|STAN-CS-75-539*MANNA & SHAMIR, NEW APRCH TO RECURSIVE PRGRMS|163|299|$ 2.40
*AIM276|SAME
*CS542|STAN-CS-76-542*MANNA & SHAMIR, THEORY ASPECTS  OF OPTIMAL FXDPT|10|293|$ 2.45
*AIM277|SAME
*CS549|STAN-CS-76-549*LUCKHAM & SUZUKI, AUTO PRGRM VERIFICATION V|145|297|$ 3.05
*AIM278|SAME
*CS552|STAN-CS-76-552*SUZUKI, AUTO VRFCT PRGRM W/CMPLX DATA-THESIS|0|288|$ 7.15
*AIM279|SAME
*CS136|STAN-CS-69-136*POHL,BI-DIRECTIONAL AND HEURISTIC SEARCH|3|0|$ 6.40
*CS163|STAN-CS-70-163*MALCOLM,ALGORITHM FOR FLOATING POINT|8|0|$ 2.35
*CS504|STAN-CS-75-504*SZEMEREDI,ON SPARSE GRAPHS WITH PATHS|22|0|$ 1.85
*CS531|STAN-CS-75-531*ROSE & TARJAN,ALGORITHMIC ASPECTS VERTEX ELIMINATION|0|0|$ .00
*CS512|STAN-CS-75-512*TARJAN,APPLICATIONS PATH COMPRESSION|0|0|$ .00
*CS526|STAN-CS-75-526*TARJAN,GRAPH THEORY|0|0|$ .00
*CS415|STAN-CS-74-415*RIVEST,ASSOCIATIVE RETRIEVAL ALGORITHMS|0|0|$ .00
*CS511|STAN-CS-75-511*DUBOST & TROUSSE,SOFTWARE IMPLEMENTATION|4|0|$ 2.75
*CS252|STAN-CS-72-252*SAUNDERS,LARGE-SCALE LINEAR|0|0|$ .00
*CS110|STAN-CS-68-110*BAUER ET AL.,ALGOL W (REVISED)|1|0|$ 4.80
*CS65|STAN-CS-67-065*WIRTH,BASIC CONCEPTS PROG LANGUAGES|0|0|$ .00
*CS532|STAN-CS-75-532*JACOBS,BIBLIOGRAPHY CSD TECH REPORTS|898|0|$ .00
*CS24|STAN-CS-65-024*KLYUYEV ET AL.,LINEAR ALGEBRAIC SYSTEMS|0|0|$ .00
*CS201|STAN-CS-71-201*HOPCROFT & TARJAN*PLANARITY TESTING|4|0|$ 2.25
*CS244|STAN-CS-71-244*TARJAN,PLANARITY ALGORITHM|0|0|$ .00
*CS204|STAN-CS-71-204*INGALLS,FETE-FORTRAN TIME ESTIMATOR|0|0|$ .00
*CS481|STAN-CS-75-481*OLIGER,INITIAL-BOUNDARY VALUE PROBLEM|0|0|$ .00
*CS478|STAN-CS-75-478*GOLUB & WILKINSON,ILL-CONDITIONED EIGENSYSTEMS|0|0|$ .00
*CS479|STAN-CS-75-479*CHATELIN & LEMORDANT,ERROR BOUNDS IN EIGENVALUES|2|0|$ 2.40
*CS399|STAN-CS-73-399*PAIGE & SAUNDERS,SOLUTION SPARSE INDEF SYSTEMS|0|0|$ .00
*CS270|STAN-CS-72-270|0|0|$ .00
*CS104|STAN-CS-68-104*BARTELS,NUMERICAL INVESTIGATION SIMPLEX METHOD|0|0|$ .00
*CS159|STAN-CS-70-159*GEORGE,SOLUTION DISCRETE POISSON EQUATION|0|0|$ 1.75
*CS278|STAN-CS-72-278*CONCUS & GOLUB,SOLUTION NON-SEPARABLE EQUATIONS|0|0|$ 2.60
*CS232|STAN-CS-71-232*MOLER & STEWART,MATRIX EIGENVALUE PROBLEM|0|0|$ .00
*CS276|STAN-CS-72-276*KAUFMAN,ALGORITHM TO SOLVE AX=BX|0|0|$ .00
*CS530|STAN-CS-75-530*LENTINI & PEREYRA,DIFFERENCE SOLVER BOUNDARY PROBLEMS|0|0|$ 3.00
*CS115|STAN-CS-68-115*FRIEDMAN ET AL,PROGRAMMER'S MANUAL|0|0|$ .00
*CS508|STAN-CS-75-508*EVE,TRANSITIVE CLOSURE RELATION|3|0|$ 1.85
*CS1|STAN-CS-63-001*ROSEN,PRIMAL PARTITION PROGRAMMING|0|0|$ .00
*CS2|STAN-CS-63-002*PAVKOVICH,SSLUTION ALGEBRAIC SYSTEMS|0|0|$ .00
*CS3|STAN-CS-64-003*FORSYTHE,THEOREMS BY SAULEV|0|0|$ .00
*CS6|STAN-CS-64-006*HOCKNEY,SOLUTION POISSON'S EQUATION|0|0|$ .00
*CS8|STAN-CS-64-008*GOLUB & KAHAN,CALCULATING SINGULAR VALUES|0|0|$ .00
*CS9|STAN-CS-64-009*ANDERSON,Q-D ALGORITHM|0|0|$ .00
*CS10|STAN-CS-64-010*CAUSEY,NORMAL MATRICES(THESIS)|0|0|$ .00
*CS12|STAN-CS-64-12*GOLUB & BUSINGER,NUMERICAL METHODS|0|0|$ .00
*CS16|STAN-CS-65-016*FORSYTHE & GOLUB,MAXIMIZING 2ND DEGREE POLYNOMIAL|0|0|$ .00
*CS18|STAN-CS-65-018*PEREYRA,DIFFERENCE CORRECTION METHOD|0|0|$ .00
*CS20|STAN-CS-65-020*WIRTH & WEBER,EULER:ALGOL & DEFINITION|0|0|$ .00
*CS21|STAN-CS-65-021*FISHER ET AL,VECTORCARDIOGRAPHIC ANALYSIS|0|0|$ .00
*CS22|STAN-CS-65-022*MOLER,FINITE DIFFERENCE METHODS|0|0|$ .00
*CS26|STAN-CS-65-026*FORSYTHE,S.U. PROGRAM IN COMP. SCI.|0|0|$ .00
*CS29|STAN-CS-65-029*PEREYRA,IMPROVING APPROXIMATE SOLUTION|0|0|$ .00
*CS30|STAN-CS-65-030*MARCHUK,AUTOMATIC CONSTRUCTION ALGORITHMS|0|0|$ .00
*CS33|STAN-CS-65-033*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS34|STAN-CS-66-034*VARAH,EIGENVECTORS OF REAL MATRIX|0|0|$ .00
*CS35|STAN-CS-66-035*WIRTH & HOARE,DEVELOPMENT OF ALGOL|0|0|$ .00
*CS36|STAN-CS-66-036*TRAUB,CALCULATION OF ZEROS|0|0|$ .00
*CS39|STAN-CS-66-039*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS40|STAN-CS-66-040*FORSYTHE,HOW DO YOU SOLVE EQUATION?|0|0|$ .00
*CS41|STAN-CS-66-041*KAHAN,ACCURATE EIGENVALUES|0|0|$ .00
*CS43|STAN-CS-66-043*VARAH & KAHAN,TWO WORKING ALGORITHMS|0|0|$ .00
*CS44|STAN-CS-66-44*KAHAN,RELAXATION METHODS|0|0|$ .00
*CS45|STAN-CS-66-045*KAHAN, RELAXATION METHODS SEMI-DEFINITE|0|0|$ .00
*CS46|STAN-CS-66-046*FORSYTHE,COMPUTATIONAL METHODS|0|0|$ .00
*CS47|STAN-CS-66-047*ABRAMS,"IVERSON NOTATION"|0|0|$ .00
*CS48|STAN-CS-66-048*MCKEEMAN,COMPUTER LANG DESIGN(THESIS)|0|0|$ .00
*CS52|STAN-CS-66-052*SHAW,SYSTEMS PROGRAMMING|0|0|$ .00
*CS53|STAN-CS-66-053*WIRTH,PROG LANG FOR 360 COMPUTERS|0|0|$ .00
*CS54|STAN-CS-67-054*GOLUB & ROBERTSON,BAIRSTOW ALGORITHM|0|0|$ .00
*CS57|STAN-CS-67-057*GRIES,TRANSITION MATRICES|0|0|$ .00
*CS58|STAN-CS-67-058*TIXIER,RECURSIVE FUNCTIONS(THESIS)|0|0|$ .00
*CS59|STAN-CS-67-059*WILKINSON,ALMOST DIAGONAL MATRICES|0|0|$ .00
*CS60|STAN-CS-67-060*WILKINSON,TWO ALGORITHMS LINEAR INTERPOLATION|0|0|$ .00
*CS61|STAN-CS-67-061*FORSYTHE,ASYMPTOTIC DIRECTIONS S-DIMENSIONAL|0|0|$ .00
*CS63|STAN-CS-67-063*POLYA,GRAEFE'S METHOD EIGENVALUES|0|0|$ .00
*CS66|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS68|STAN-CS-67-068*WIRTH,PL 360 SYSTEM|0|0|$ .00
*CS67|STAN-CS-67-067*BARTELS & GOLUB,CHEBYSHEV SOLUTIONS LINEAR EQUATIONS|0|0|$ .00
*CS69|STAN-CS-67-070*FELDMAN & GRIES,TRANSLATOR WRITING SYSTEMS|0|0|$ .00
*CS70|STAN-CS-67-70*BERGMAN ET AL,COMPUTATION FLOW PATTERNS|0|0|$ .00
*AIM285|AIM-285*BINFORD ET AL, EXPLORE STUDY ASSY SYSTEMS, PROGRESS REPORT 3|0|101|$ .00
*AIM286|AIM-286*LENAT, AM: A.I. APPROACH TO DISCOVERY IN MATH-THESIS|0|333|$ .00
*AIM287|AIM-287*RODERICK, DISCRETE CONTROL OF A ROBOT ARM-THESIS|114|208|$ 4.45
*AIM284|AIM-284*FINKEL, CONSTRUCT & DEBUG MANIPULATOR PROGRAMS-THESIS|0|265|$ .00
*AIM288|AIM-288*FILMAN, WEYHRAUCH, FOL PRIMER|121|179|$ 2.70
*AIM290|AIM-290*SMITH, SAIL TUTORIAL|551|142|$ 3.20
*AIM289|AIM-289*REISER, SAIL|365|130|$ 6.70
*CS492|STAN-CS-75-492*SEDGEWICK,QUICKSORT|0|0|$ .00
*CS494|STAN-CS-75-494*SATTERTHWAITE,SOURCE LANG DEBUGGING TOOLS|0|98|$ .00
*CS164|STAN-CS-70-164*KAUFMAN,ESTIMATES ROUNDOFF ERROR|16|0|$ 2.20
*CS158|STAN-CS-70-158*STONE,PARALLEL PROCESSING|5|0|$ 2.80
*CS157|STAN-CS-70-157*BRENT,ALGORITHMS MATRIX MULTIPLICATON|0|0|$ .00
*CS565|STAN-CS-76-565*STRIKWERDA,BOUNDARY VALUE PROBLEMS(THESIS)|0|521|$ .00
*CS566|STAN-CS-76-566*WRIGHT,NUMERICAL METHODS(THESIS)|0|465|$ .00
*CS569|STAN-CS-76-569*HERRIOT,INTERPOLATING NATURAL SPLINE FUNCTIONS|148|217|$ 3.10
*CS573|STAN-CS-76-573*JONASSEN,STATIONARY P-TREE FOREST|113|230|$ 4.40
*CS545|STAN-CS-76-545*PAUL,TARJAN & CELONI,SPACE BOUNDS|40|0|$ 2.35
*CS440|STAN-CS-74-440*MORRIS ET AL,FAST PATTERN MATCHING|0|0|$ .00
*CS548|STAN-CS-76-548*O'LEARY,HYBRID CONJUGATE GRAD ALGORITHMS|0|0|$ .00
*CS208|STAN-CS-71-208*GEORGE,FINITE ELEMENT METHOD(THESIS)|0|0|$ .00
*AIM291|AIM-291*BUCHANAN ET AL, 3 REVIEWS WEIZENBAUM'S CMPTR PWR & REASON|4|125|$ 2.50
*AIM292|AIM-292*WINOGRAD, TOWARDS PROCEDURAL UNDERSTANDING OF SEMANTICS|207|90|$ 2.55
*AIM293|AIM-293*BOBROW & WINOGRAD, OVERVIEW OF KRL|0|104|$ 2.85
*CS98|STAN-CS-68-098*BAUER ET AL.,ALGOL W IMPLEMENTATION|0|0|$ .00
*CS215|STAN-CS-71-215*MALCOLM,PL360|0|0|$ .00
*CS200|STAN-CS-71-200*HERRIOT,ALGOL 60 PROCEDURES|0|0|$ .00
*CS579|STAN-CS-76-579*BASKETT & RAFII,A0 INVERSION MODEL|208|218|$ 2.60
*CS194|STAN-CS-70-194*KNUTH,ERRATA & ADDENDA|0|0|$ .00
*CS271|STAN-CS-72-271*RIDDLE,SUPERVISORY SYSTEMS(THESIS)|0|0|$ .00
*CS578|STAN-CS-76-578*OLIGER & SUNDSTROM,INITIAL-BOUNDARY PROBLEMS|0|506|$ .00
*CS495|STAN-CS-75-495*KROGDAHL,DEPENDENCE GRAPH|27|0|$ 2.60
*CS468|STAN-CS-74-468*KROGDAHL,COMBINATORIAL BASE|32|0|$ 2.45
*CS576|STAN-CS-76-576*MCDIARMID,CHROMATIC NUMBER OF A GRAPH|103|218|$ 3.55
*CS77|STAN-CS-67-77*FORSYTHE,WHAT TO DO  TILL|0|0|$ .00
*CS178|STAN-CS-70-178*FORSYTHE & MILLER,RESEACH REVIEW|0|0|$ .00
*CS93|STAN-CS-68-93*FORSYTHE, CS & EDUCATION|0|0|$ .00
*CS131|STAN-CS-69-131*SMITH,MAN-MACHINE INTERACTION(THESIS)|0|0|$ .00
*CS140|STAN-CS-69-140*FORSYTHE,DESIGN-THEN & NOW|0|0|$ .00
*CS141|STAN-CS-69-141*DAHLQUIST ET AL., BOUNDS FOR ERROR|4|0|$ 2.50
*CS210|STAN-CS-71-210*PURDY, ACCESS,PROG FOR CATALOG|2|0|$ 2.55
*CS150|STAN-CS-70-150*WILKINSON,ELEMENTARY PROOF|14|0|$ 2.50
*CS434|STAN-CS-74-434*RUHE & WEDIN,SEPARABLE NONLINEAR LEAST SQUARES|0|0|$ .00
*CS143|STAN-CS-69-143*JENKINS,THREE-STAGE VARIABLE-SHIFT|0|0|$ .00
*CS363|STAN-CS-73-363*KAUFMAN,LZ ALGORITHM(THESIS)|0|0|$ .00
*CS248|STAN-CS-71-248*FREDMAN & KNUTH,RECURRENCE RELATIONS|0|0|$ 2.75