Number | Abstract | Report | ||
| dcs-tr-1 | Full Report | CODES FOR ERROR CORRECTION IN HIGH SPEED MEMORY SYSTEMS | C. V. Srinivasan | |
| dcs-tr-2 | Full Report | COMPUTER SCIENCE: A CONCEPTUAL FRAMEWORK FOR CURRICULUM PLANNING | Saul Amarel | |
| dcs-tr-5 | Full Report | REPRESENTATIONS AND MODELING IN PROBLEMS OF PROGRAM FORMATION | Saul Amarel | |
| dcs-tr-6 | Full Report | OBTAINING A GRAMMAR FROM A LESS FORMAL LANGUAGE DESCRIPTION | Marvin C. Paull | |
| dcs-tr-7 | Full Report | EQUIVALENCE OF SOME CLASSES OF ALGORITHMS | Marvin C. Paull | |
| dcs-tr-8 | Full Report | SETS OF SET-EQUATIONS EQUIVALENT TO CONTEXT-FREE GRAMMARS AND THEIR SOLUTION IN SOME CASES | Marvin C. Paull | |
| dcs-tr-9 | Full Report | NOTES ON THE MINILOGO INTERPRETER | Charlene Paull | |
| dcs-tr-10 | Full Report | A SET OF GOALS AND APPROACHES FOR EDUCATION IN COMPUTER SCIENCE | Saul Amarel | |
| dcs-tr-11 | Full Report | ON THE PRACTICALITY OF MANNA'S METHOD OF VERIFYING THE TERMINATION AND CORRECTNESS OF PROGRAMS | S.R.SRINIVASAN | |
| dcs-tr-12 | Full Report | ROOTS OF POLYNOMIALS BY NEWTON'S ITERATION | David R. Beaucage | |
| dcs-tr-13 | Full Report | Numerical Stability of Methods of Lines For Partial Differential Equations | R. Vichnevetsky | |
| dcs-tr-14 | Full Report | ERRORS PROPAGATION AND THE NUMERICAL SOLUTION OF OPTIMIZATION PROBLEMS | Robert Vichnevetsky | |
| dcs-tr-15 | Full Report | MACHINE MEMORY REQUIREMENTS - LOWER BOUNDS | Marvin C. Paull | |
| dcs-tr-16 | Full Report | A FRAMEWORK FOR A THEORY OF PROTECTION | C.V. Srinivasan | |
| dcs-tr-17 | Full Report | PROPERTY PRESERVATION BY TESSELLATION AUTOMATA | Thomas J. Ostrand | |
| dcs-tr-18 | Full Report | A MIX/MIXAL SYSTEM ON THE 360 | Frank Brice & Irving N. Rabinowitz | |
| dcs-tr-19 | Full Report | Extended Basic Logic and Ordinal Numbers | Richard J. Orgass | |
| dcs-tr-20 | Full Report | ON THE NUMERICAL METHOD OF LINES FOR ONE DIMENSIONAL WATER QUALITY EQUATIONS. | R. Vichnevetsky and Y. S. Shieh * | |
| dcs-tr-21 | Full Report | ON SORTING NETWORKS | Marvin Paull and Saul Levy | |
| dcs-tr-22 | Full Report | MINIMAL LOGIC AND COMPUTERS Chapter IV Theory of Numbers in the System R | Frederic B. Fitch, Richard J. Orgass | |
| dcs-tr-23 | Full Report | MINIMAL LOGIC AND COMPUTERS The Method of Subordinate Proofs | F.B.Fitch and R.J.Orgass | |
| dcs-tr-24 | Full Report | ON THE NUMBER OF MAXIMAL COMPATIBLES | Marvin Paull | |
| dcs-tr-25 | Full Report | A Class of Variable Mesh Multistep Methods For Solving Simultaneous Nonlinear Equations | Kai-Wen Tu | |
| dcs-tr-26 | Full Report | TESSELLATION AUTOMATA WITH GROUP TRANSFORMATIONS | Thomas J. Ostrand, Elaine J. Weyuker | |
| dcs-tr-27 | Full Report | A Class of Variable Mesh Multistep Methods For Solving Simultaneous Nonlinear Equations | Kai-Wen Tu | |
| dcs-tr-28 | Full Report | QUANTITATIVE ERROR ANALYSIS OF NUMERICAL METHODS FOR PARTIAL DIFFERENTIAL EQUATIONS | R. Vichnevetsky, K. W. Tu, J. A. Steen | |
| dcs-tr-29 | Full Report | ON SOME NUMERICAL INTEGRATION METHODS FOR SOLVING ALGEBRAIC EQUATIONS | Kai-Wen Tu | |
| dcs-tr-30 | Full Report | PROGRAMMING LANGUAGE DATA STRUCTURES: A COMPARATIVE STUDY | Bobbie Ann Othmer | |
| dcs-tr-31 | Full Report | ESTIMATING LINEAR RELATIONSHIPS FOR MODELS BASED ON RANDOM VARIABLES WITH INFINITE VARIANCE | Marek Kanter, William L. Steiger | |
| dcs-tr-32 | Full Report | MODELING, SIMULATION AND INTERDISCIPLINARY RESEARCH | R. Vichnevetsky | |
| dcs-tr-33 | Full Report | THE REPRESENTATION OF FUZZY KNOWLEDGE | Rick LeFaivre | |
| dcs-tr-34 | Full Report | TCHEBYCHEFF'S INEQUALITY IS BEST-POSSIBLE | W. L. Steiger | |
| dcs-tr-35 | Full Report | ERROR WAVES IN FINITE ELEMENT AND FINITE DIFFERENCE METHODS FOR HYPERBOLIC EQUATIONS. | R. Vichnevetsky and B. Peiffer | |
| dcs-tr-36 | Full Report | A FREQUENCY ANALYSIS OF FINITE DIFFERENCE AND FINITE ELEMENT METHODS FOR INITIAL VALUE PROBLEMS | R. Vichnevetsky and F. De Schutter | |
| dcs-tr-37 | Full Report | COMPUTER-CONTROLLED DISPLAY DEMONSTRATIONS OF DYNAMIC CONCEPTS IN COMPUTER SCIENCE | David R. Levine | |
| dcs-tr-39 | Full Report | NUMERICAL SOLUTION OF INTEGRA EQUATIONS OF THE FIRST KIND | G. R. Richter | |
| dcs-tr-40 | Full Report | GOOD PROGRAMS IN BAD LANGUAGES | Irving N. Rabinowitz | |
| dcs-tr-41 | Full Report | LEXICAL & SYNTACTIC CONVENTIONS FOR STRUCTURING PROGRAMS | Irving N. Rabinowitz | |
| dcs-tr-43 | Full Report | AN ARTIFICIAL INTELLIGENCE SYSTEM TO MODEL AND GUIDE CHEMICAL SYNTHESIS PLANNING BY COMPUTER: A Proposal | N.S. Sridharan | |
| dcs-tr-44 | Full Report | THE SHAPE OF UNSTABLE NUMERICAL SOLUTIONS OF INITIAL VALUE PROBLEMS | R. Vichnevetsky, H. Sandusky ** | |
| dcs-tr-45 | Full Report | ON GALERKINIS METHOD FOR THE APPROXIMATE SOLUTION OF LINEAR OPERATOR EQUATIONS | G.R. Richter | |
| dcs-tr-46 | Full Report | THE MACRO LANGUAGE FOR THE IBM 360/370. | John Cox | |
| dcs-tr-47 | Full Report | POLYNOMIAL LEAST SQUARES APPROXIMATIONS WITH ILL-CONDITIONED BASES | G.R. Richter and W.L. Steiger | |
| dcs-tr-49 | Full Report | THE IMPACT OF COMPUTER SIMULATION ON APPLIED SCIENCE | ROBERT VICHNEVETSKY | |
| dcs-tr-50 | Full Report | NUMERICAL SOLUTION OF LAPLACE'S EQUATION AS AN INTEGRAL EQUATION OF THE FIRST KIND. | ABSTRACT: | |
| dcs-tr-51 | Full Report | LEAST ABSOLUTE DEVIATION ESTIMATES IN STABLE AUTOREGRESSION | S. Gross, W. Steiger | |
| dcs-tr-52 | Full Report | The Undecidability of Deriving Atomic Formulas from Horn Formulas | Ann and Mitsuru Yasuhara | |
| dcs-tr-53 | Full Report | REACHABLE AND SEMIFREE SCHEMAS. | Elaine J. Weyuker | |
| dcs-tr-55 | Full Report | SUPERCONVERGENCE OF PIECEWISE POLYNOMIAL GALERKIN APPROXIMATIONS FOR INTEGRAL EQUATIONS OF THE SECOND KIND. | G. R. Richter | |
| dcs-tr-56 | Full Report | RELATIONS BETWEEN RECURSIVE DEFINITIONS AND THEIR MEMORY EFFICIENT IMPLEMENTATIONS. | M. C. Paull | |
| dcs-tr-57 | Full Report | RELATIONS BETWEEN RECURSIVE DEFINITIONS AND THEIR EFFICIENT IMPLEMENTATIONS. | M.C.Paull | |
| dcs-tr-58 | Full Report | COMPUTER GRAPHICS FOR METEROROLOGICAL DATA | Ronald Lusen | |
| dcs-tr-59 | Full Report | COMPUTER ANIMATION OF METEOROLOGICAL DATA | Ronald Lusen | |
| dcs-tr-60 | Full Report | PROGRAM SCHEMAS WITH SEMANTI RESTRICTIONS | Elaine Jessica Weyuker | |
| dcs-tr-61 | Full Report | AXIOMATIC ANALYSIS OF PROGRAMS AND PROGRAM SCHEMES | THOMAS J. OSTRAND | |
| dcs-tr-62 | Full Report | LEAST ABSOLUTE DEVIATION ESTIMATES IN AUTOREGRESSION WITH INFINITE VARIANCE | S. GROSS AND W.L. STIEGER | |
| dcs-tr-63 | Full Report | PARTIAL DIFFERENTIAL EQUATIONS IN MATHEMATICAL MODELING | Robert Vichnevetsky | |
| dcs-tr-64 | Full Report | A SET OF GOALS AND APPROACHES FOR EDUCATION IN COMPUTER SCIENCE | Saul Amarel | |
| dcs-tr-65 | Full Report | ON THE DEVELOPMENT OF AN INSTRUCTIONAL OPERATING SYSTEM PROJECT | MANFRED RUSCHITZKA | |
| dcs-tr-66 | Full Report | FIXED POINT LANGUAGES OF DETERMINISTIC GENERALIZED SEQUENTIAL MACHINES ARE CONTEXT SENSITIVE | A.Van der Mude and Adrian Walker | |
| dcs-tr-67 | Full Report | LEAST ABSOLUTE DEVIATIONS CURVE-FITTING | PETER BLOONFIELD* | |
| dcs-tr-69 | Full Report | A PROBLEM IN OPTIMAL MERGING | Paul E. Murphy | |
| dcs-tr-70 | Full Report | HOW SAIL RELATES TO A.I | John Franco | |
| dcs-tr-71 | Full Report | PARSING REGULAR GRAMMARS WITH FINITE LOOKAHEAD | Thomas J. Ostrand,* Marvin C. Paull and Elaine J. Weyuker** | |
| dcs-tr-72 | Full Report | Minimum Comparison Merging of Sets Of Approximately Equal Size | PaulE. Murphy And Marvin C. Paull | |
| dcs-tr-73 | Full Report | A NUMERICAL METHOD FOR THE INVERSE STEADY STATE DIFFUSION PROBLEM | Gerard R. Richter | |
| dcs-tr-74 | Full Report | A NUMERICAL METHOD FOR THE INVERSE STEADY STATE DIFFUSION PROBLEM | Gerard R. Richter | |
| dcs-tr-77 | Full Report | A MECHANISM FOR RESOLUTION REFINEMENTS BASED ON BACK SUBSTITUTIONS | David M. Sandford | |
| dcs-tr-78 | Full Report | An Analysis of Generalization as Search Problem | Tom M. Mitchell | |
| dcs-tr-79 | COMPUTABILITY ON TERM ALGEBRAS | Ann Yasuhara | ||
| dcs-tr-80a | Full Report | SYNCHRONIZATION ALGORITHMS THEIR EVALUATION | Manfred Ruschitzka | |
| dcs-tr-81 | Full Report | HL--RESOLUTION: A SEMANTIC REFINEMENT OF RESOLUTION AND A THEORY OF MODEL SPECIFICATION | David M. Sandford | |
| dcs-tr-83 | Full Report | RETRIEVAL OF RECORDS IN KEY SEQUENCE FROM DIRECT ACCESS HASH FILES | Matthew Morgenstern | |
| dcs-tr-84 | Full Report | PROPAGATION PROPERTIES OF SEMI-DISCRETIZATIONS OF HYPERBOLIC EQUATIONS | R. Vichnevetsky | |
| dcs-tr-85 | Full Report | A SURVEY OF INTERPROCEDURAL DATA FLOW ANALYSIS TECHNIQUES | Barbara Ryder | |
| dcs-tr-86 | Full Report | PRODUCT INTEGRATION METHODS FOR THE SOLUTION OF SINGULAR INTEGRAL EQUATIONS OF CAUCHY TYPE | Apostolos Gerasoulis | |
| dcs-tr-89 | Full Report | KNOWLEDGE REPRESENTATION AND PROBLEM SOLVING IN MDS. | Chitoor V. Srinivasan | |
| dcs-tr-90 | Full Report | KNOWLEDGE BASED LEARNING, AN EXAMPLE | Chitoor V. Srinivasan | |
| dcs-tr-91 | Full Report | POLICY FUNCTION SCHEDULING | Manfred Ruschitzka | |
| dcs-tr-92 | Full Report | AVERAGE CASE BEHAVIOR OF THE ALPHA-BETA TREE PRUNING ALGORITHM | GEORGE SHRIER | |
| dcs-tr-94 | Full Report | ON THE EXISTENCE OF APPROXIMATE SOLUTIONS FOR SINGULAR INTEGRAL EQUATIONS OF CAUCHY TYPE DISCRETIZED BY GAUSS-CHEBYSHEV QUADRATURE FORMULAE | Apostolos Gerasoulis | |
| dcs-tr-95 | Full Report | A MIN MAX PROBLEM | W.L. STEIGER | |
| dcs-tr-96 | Full Report | A COMPARISON OF METHODS FOR DISCRETE L 1 CURVE-FITTIN | D. Anderson and W.L. Steiger | |
| dcs-tr-97 | Full Report | LINEAR PROGRAMMING VIA DISCRETE L1 CURVE FITTING | W. L. Steiger | |
| dcs-tr-99 | Full Report | NETWORK OPTIMIZATION PROBLEMS AND ALGORITHMS: AN ANNOTATED BIBLIOGRAPHY | Michael D. Grigoriadis | |
| dcs-tr-100 | Full Report | ENERGY AND GROUP VELOCITY IN SEMI DISCRETIZATIONS OF HYPERBOLIC EQUATIONS | R. Vichnevetsky | |
| dcs-tr-101 | Full Report | PROPAGATION THROUGH NUMERICAL MESH REFINEMENT FOR HYPERBOLIC EQUATIONS | R. Vichnevetsky | |
| dcs-tr-102 | Full Report | ON THE SOLVABILITY OF SINGULAR INTEGRAL EQUATIONS VIA GAUSS-JACOBI QUADRATURE | A. Gerasoulis* and R. P. Srivastav** | |
| dcs-tr-103 | Full Report | NUMERICAL UPSTREAM BOUNDARY CONDITIONS THAT REDUCE SPURIOUS REFLECTION. | R. Vichnevetsky, E. Sciubba and Y. Pak | |
| dcs-tr-104 | Full Report | A NEW LAD CURVE FITTING ALGORITHM: SLIGHTLY OVERDETERMINED EQUATION SYSTEMS IN L 1* | E. SENETA* AND W.L. STEIGER** | |
| dcs-tr-105 | Full Report | MEDIT USER MANUAL | Robert N. Goldberg | |
| dcs-tr-106 | Full Report | KNOWLEDGE REPRESENTATION AND PROBLEM SOLVING IN DDS. KNOWLEDGE REPRESENTATION AND PROBLEM SOLVING IN MDS. | Chitoor V. Srinivasan | |
| dcs-tr-107 | Full Report | NOTE CN LEARNING IN M)S WED ON PREDICATE SIMATURES | Chitoor V. Srinivasan | |
| dcs-tr-108 | Full Report | SINGULAR INTEGRAL EQUATIONS - THE CONVERGENCE OF THE NYSTROM INTERPOLANT OF THE GJAUSS-CHEBYSHEV METHOD | Apostolos Gerasoulis* | |
| dcs-tr-109 | Full Report | IMP ROVED CONSTRAINT SATISFACTION ALGORITHMS USING INTER-VARIABLE COMPATIBILITIES | Bernard Nudel | |
| dcs-tr-110 | Full Report | SOFTWARE DESIGN ISSUES IN THE ARCHITECTURE AND IMPLEMENTATION OF DISTRIBUTED TEXT EDITORS | Robert N. Goldberg | |
| dcs-tr-111 | Full Report | NYSTROM'S INTERPOLATION FORMULA IN THE SOLUTION OF SINGULAR INTEGRAL EQUATIONS DISCRETIZED BY THE GAUSS-JACOBI QUADRATURE | Apostolos Gerasoulis | |
| dcs-tr-113 | Full Report | CONSISTENT-LABELING PROBLEMS And their ALGORITHMS: PART 2 | Bernard Nudel | |
| dcs-tr-114 | Full Report | THE CONTROL OF INFERENCING IN NATURAL LANGUAGE UNDERSTANDING | Abe Lockman*, David Klapphoirw | |
| dcs-tr-115 | Full Report | A SURVEY OF RESEARCH IN STRATEGY ACUAISITION | Richard M. Keller | |
| dcs-tr-116 | Full Report | GROUP VELOCITY AND REFLECTION PHENOMENA IN NUMERICAL APPROXIMATIONS OF HYPERBOLIC EQUATIONS: A SURVEY | R. Vichnevetsky | |
| dcs-tr-117 | INCREMENTAL DATA FLOW ANALYSIS BASED ON A UNIFIED MODEL OF ELIMINATION ALGORITHMS | Barbara Gershon Ryder | ||
| dcs-tr-118 | Full Report | TRANSFORMATIONAL PROGRAMMING APPLICATIONS TO ALGORITHMS AND SYSTEMS | R. Paige | |
| dcs-tr-119 | Full Report | FAST MINIMAL DISTANCE ENUMERATION OF SMALL COMBINATIONS | W.L. Steiger1, P.M. Neuss 2 | |
| dcs-tr-120 | INCREMENTAL DATA FLOW ANALYSIS | Barbara G. Ryder | ||
| dcs-tr-121 | Full Report | FINDING THE TWO-CORE OF A TREE | Ronald 1. Becker* 1, Yehoshua Perl** | |
| dcs-tr-122 | Full Report | CIRCUIT PARTITIONING WITH SIZE AND CONNECTION CONSTRAINTS | Yehoshua Perl and Marc Snir | |
| dcs-tr-123 | Full Report | THE BITONIC AND ODD-EVEN NETWORKS ARE MORE THAN MERGING | Yehoshua Perl | |
| dcs-tr-124 | Full Report | EFFICIENT IMPLEMENTATION OF A SHIFTING ALGORITHM | Yehoshua Perl | |
| dcs-tr-125 | Full Report | OPTIMUM SPLIT TREES | Yehoshua Perl | |
| dcs-tr-126 | Full Report | HEURISTICS FOR FINDING A MAXIMUM NUMBER OF DISJOINT BOUNDED PATHS | D.Roneni and Y. Perl | |
| dcs-tr-127 | Full Report | THE BALANCED SORTING NETWORK | M. Dowd, Y. Perl , M. Saks, and L. Rudolph | |
| dcs-tr-128 | Full Report | SOLVING THE GENERAL CONSISTENT LABELING (OR CONSTRAINT SATISFACTION) PROBLEM: TWO ALGORITHMS AND THEIR EXPECTED COMPLEXITIES | Bernard Nudel | |
| dcs-tr-129 | Full Report | FOURIER METHODS IN COMPUTATIONAL FLUID AND FIELD DYNAMICS | Robert VICHNEVETSKY | |
| dcs-tr-130 | Full Report | DESIGN AND ANALYSIS OF PROTECTION SCHEMES BASED ON THE SEND-RECEIVE TRANSPORT MECHANISM | Ravinderpal Singh Sandhu | |
| dcs-tr-131 | Full Report | INCREMENTAL DATA FLOW ANALYSIS ALGORITHMS | M.C. Paull and B.G. Ryder | |
| dcs-tr-132 | Full Report | HIGH ORDER NUMERICAL SOMMERFELD BOUNDARY CONDITIONS: THEORY AND EXPERIMENTS | R. Vichnevetsky and E.C. Pariser | |
| dcs-tr-133 | Full Report | SINGULAR INTEGRAL EQUATIONS-THE SINGULAR VALUE DECOMPOSITION OF THE GAUSS- CHEBYSHEA" AND LOBATTO-CHEBYSHEV MATRICES | Apostolos Gerasoulis | |
| dcs-tr-134 | Full Report | KNOWLEDGE REPRESENTATION IN MATHEMATICS A CASE STUDY IN GRAPH THEORY | Susan Lynn Epstei | |
| dcs-tr-135 | Full Report | CLUSTERING AND DOMINATION IN PERFECT GRAPHS | D.G. Corneill and Y. Perl | |
| dcs-tr-136 | Full Report | THE ENERGY FLOW ECILIATION | R. Vichnevetsky | |
| dcs-tr-137 | Full Report | INVARIANCE THEOREMS CONCERNING REFLECTION AT NUMERICAL BOUNDARIES | R. Vichnevetsky | |
| dcs-tr-139 | Full Report | EXPLORING THE STRUCTURE OF INCREMENTAL ALGORITHMS | MARVIN C. PAULL, ARTHUR MICHAEL BERMAN, CHARLES CHING-AN CHENG | |
| dcs-tr-140 | Full Report | ELIMINATION ALGORITHMS FOR DATA FLOW ANALYSIS | B.G. Ryder and M.C. Paull | |
| dcs-tr-141 | Full Report | ON SCHEDULING THE CONSTRUCTION OF A TREELIKE COMMUNICATION NETWORK | Amos Israeli' and Yehoshua Perl | |
| dcs-tr-142 | Full Report | TOWARDS A FLEXIBLE USER INTERFACE TO RELATIONAL DATABASE SYSTEMS: PROCESSING SIMPLE SECOND ORDER QUERIES | T. Imielinski and D. Rozenshtein | |
| dcs-tr-143 | Full Report | PROPAGATION AND REFLECTION IN DISCRETE -SPACE -DISCRETE -TIME STRUCTURES | R. Vichnevetsky | |
| dcs-tr-147 | Full Report | ALGORITHM FOR LARGE-SCALE GLOBAL MINIMIZATION OF LINEARLY CONSTRAINED CONCAVE QUADRATIC FUNCTIONS | B.KALANTARI, J. B. ROSEN | |
| dcs-tr-148 | Full Report | PENALTY FORMULATION FOR ZERO-ONE NONLINEAR PROGRAMMING | B. Kalantari and J.B. Rosen | |
| dcs-tr-149 | Full Report | ALGORITHMS AND COMPLEXITY FOR A STATISTICAL PROBLEM. MINIMUM MEDIAN RESIDUAL FITTING | J.M. Steele* and W.L. Steiger | |
| dcs-tr-150 | Full Report | MODULAR VERIFICATION OF COMMUNICATING SEQUENTIAL PROCESSES | E.A. Akkoyunlu 1 and R.M. Nemes | |
| dcs-tr-153 | Full Report | CK-LOG, A CALCULUS FOR KNOWLEDGE PROCESSING IN LOGIC | C.V. Srinivasan | |
| dcs-tr-154 | Full Report | PROVING RELATIVE LOWER BOUNDS FOR INCREMENTAL ALGORITHMS | A.M. Berman, M.C. Paull and B.G. Ryder | |
| dcs-tr-158 | Full Report | INCREMENTAL ALGORITHMS FOR SOFTWARE SYSTEMS | Barbara G. Ryder | |
| dcs-tr-159 | Full Report | APPLICABILITY OF INCREMENTAL ITERATIVE ALGORITHMS | T. Marlowe, M.C. Paull and B.G. Ryder | |
| dcs-tr-160 | KNOWLEDGE PROCESSING vs PROGRAMMING: CK-LOG vs PROLOG | C.V. Srinivasan | ||
| dcs-tr-161 | Full Report | A NOTE ON UNMERGING | B. Reed*, J.S. Salowe and W.L. Steiger | |
| dcs-tr-162 | Full Report | STABLE UNMERGING IN LINEAR TIME AND CONSTANT SPACE | J.S. Salowe and W.L. Steiger | |
| dcs-tr-163 | SUBSET SIZE IN PARALLEL | L. Rudolph and W. Steiger | ||
| dcs-tr-164 | The CONSISTENT LABELING PROBLEM: BACKGROUND AND PROBLEM FORMULATION | BERNARD A. NADEL | ||
| dcs-tr-165 | The CONSISTENT LABELING PROBLEM, Part 2: SUBPROBLEMS, ENUMERATIONS And CONSTRAINT SATISFIABILITY | Prof. Bernard A. Nade | ||
| dcs-tr-166 | THE CONSISTENT LABELING PROBLEM, PART 3: THE GENERALIZED BACKTRACKING ALGORITHM | Prof. Bernard A. Nadel | ||
| dcs-tr-167 | THE CONSISTENT LABELING PROBLEM, PART 4: THE GENERALIZED FORWARD CHECKING AND WORD-WISE FORWARD CHECKING ALGORITHMS | B.A. Nadel | ||
| dcs-tr-168 | ONLY THE COMPLEMENTS OF RECURSIVELY ENUMERABLE SETS CAN BE RELIABLY IDENTIFIED IN THE LIMIT | Antony Van der Mude | ||
| dcs-tr-169 | TAXICABS AND LEAST-COST PARTITION ALGORITHMS | T.J. Marlowe, Jr. | ||
| dcs-tr-170 | THE GENERAL CONSISTENT LABELING (OR CONSTRAINT SATISFACTION) PROBLEM | B.A. Nadel | ||
| dcs-tr-171 | THREE CONSTRAINT SATISFACTION ALGORITHMS AND THEIR COMPLEXITIES: SEARCH-ORDER DEPENDENT AND EFFECTIVELY INSTANCE- SPECIFIC RESULTS | B.A. Nadel | ||
| dcs-tr-172 | INCREMENTAL UPDATING OF DEPTH-FIRST SEARCH TREES | M.G. Sackrowitz | ||
| dcs-tr-173 | SIMPLIFIED STABLE MERGING TASKS | J. Salowe and W. Steiger | ||
| dcs-tr-174 | DETERMINISTIC SELECTION IN O(LOGLOG N) PARALLEL TIME | M. Ajtai J. Komlos, W.L. Steiger and E. Szemeredi | ||
| dcs-tr-175 | FPOPT: A GLOBALLY OPTIMIZING COMPILER FOR FP | J.S. Pendergrast and B.G Ryder | ||
| dcs-tr-176 | WAVE PROPAGATION ANALYSIS OF THE BOX AND OTHER IMPLICIT APPROXIMATIONS OF HYPERBOLIC EQUATIONS | R. Vichnevetsky | ||
| dcs-tr-177 | QUERY PROCESSING IN DEDUCTIVE DATABASES WITH INCOMPLETE INFORMATION | T. Imielinski | ||
| dcs-tr-178 | ABSTRACTION IN QUERY PROCESSING | T. Imielinski | ||
| dcs-tr-179 | RESULTS ON TRANSLATING DEFAULTS TO CIRCUMSCRIPTION | T. Imielinski | ||
| dcs-tr-180 | TRANSFORMING LOGICAL RULES BY RELATIONAL ALGEBRA | T. Imielinski | ||
| dcs-tr-181 | AUTOMATED DEDUCTION IN DATABASES WITH INCOMPLETE INFORMATION | T. Imielinski | ||
| dcs-tr-182 | REP RESE NTATIO N-SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE STUDY USING n-QUEENS1 | Prof. Bernard A. Nadel | ||
| dcs-tr-183 | THEORY-BASED SEARCH-ORDER SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS' | Prof. Bernard A. Nadel | ||
| dcs-tr-184 | THE COMPLEXITY OF SPARSE SETS IN P | E.W. Allender | ||
| dcs-tr-185 | WEAKLY TRIANGULATED GRAPHS ARE STRICT QUASI-PARITY GRAPHS | C.T. Hoang and F. Maffray | ||
| dcs-tr-186 | CK-LOG's PROBLEM SOLVING SYSTEM, PART 1: THE NATURAL DEDUCTION PROOF SYSTEM FOR FIRST ORDER LOGIC | C-V. Srinivasan | ||
| dcs-tr-187 | PROBLEMS, CHALLENGES AND OPPORTUNITIES IN NAVAL OPERATIONAL PLANNING | C.V. Srinivasan | ||
| dcs-tr-188 | PROBLEM SOLVING | S. Amarel | ||
| dcs-tr-189 | ALTERNATING ORIENTATION AND ALTERNATING COLOURATION OF PERFECT GRAPHS | C.T. Hoang | ||
| dcs-tr-190 | CONDITIONS FOR INCREMENTAL ITERATION EXAMPLES AND COUNTEREXAMPLES | T. Marlowe, M.C. Paull and B.G. Ryder | ||
| dcs-tr-191 | ON A CONJECTURE OF MEYNIEL | C.T. Ho-Lng | ||
| dcs-tr-192 | ON BRITTLE GRAPHS II. GRAPHS WITH DILWORTH NUMBER AT MOST THREE | C.T. Hoang | ||
| dcs-tr-193 | ON BRITTLE GRAPHS II. GRAPHS WITH DILWORTH NUMBER AT MOST THREE | C.T. Hoang | ||
| dcs-tr-194 | EVALUATING THE SIZE OF A VERSION SPACE | I. Nelken | ||
| dcs-tr-195 | LOWER BOUNDS FOR THE QUADRATIC SEMI-ASSIGNMENT PROBLEM | G. Gallo, E.M. Tomasin and A.M. Sorato | ||
| dcs-tr-197 | ADVANCED PLANNING SYSTEMSAND DEVELOPMENT OF PLANNING CONSULTANT FOR NAVAL OPERATIONAL PLANNING | C.V. Srinivasan | ||
| dcs-tr-198 | P-UNIFORM CIRCUIT COMPLEXITY | E.W. Allender | ||
| dcs-tr-199 | ISOMORPHISMS AND 1-L REDUCTIONS | E.W. Allender | ||
| dcs-tr-200 | INTELLIGENT QUERY ANSWERING IN RULE BASED SYSTEMS | T. Imielinski | ||
| dcs-tr-201 | SOME FORMAL PROPERTIES OF VERSION SPACES | A. Van der Mude | ||
| dcs-tr-202 | ON THE SUPERMODULAR KNAPSACK PROBLEM | G. Gallo and B. Simeone | ||
| dcs-tr-203 | SELECTING SLOPES | R. Cole, J. Salowe and W.L. Steiger | ||
| dcs-tr-204 | OPTIMAL PARALLEL SELECTION HAS COMPLEXITY O(LOGLOG N) | Ajtai J. Komlos, W.L. Steiger , E. Szemeredi | ||
| dcs-tr-205 | RELATIVE KNOWLEDGE IN A DISTRIBUTED DATABASE | T. Imielinski | ||
| dcs-tr-206 | COMPLEXITY OF QUERY PROCESSING IN THE DEDUCTIVE DATABASES WITH | T. Imielinski | ||
| dcs-tr-207 | DOMAIN ABSTRACTION AND LIMITED REASONING | T. Imielinski | ||
| dcs-tr-208 | REPRESENTATION SELECTION FOR CONSTRAINT SATISFACTION PROBLEMS: A CASE STUDY USING n-QUEENS - | B.A. Nadel | ||
| dcs-tr-209 | EXPERIMENTS IN OPTIMIZING FP | B.G. Ryder and J.S. Pendergrast | ||
| dcs-tr-210 | RECENT RESULTS ON PERFECT GRAPHS | V. Chvatal | ||
| dcs-tr-211 | LEARNING CONCEPTS WITH A PROTOTYPE-BASED MODEL FOR CONCEPT REPRESENTATION | Donna Jo Nagel | ||
| dcs-tr-212 | ALMOST SORTING IN ONE ROUND | M. Ajtai, J. Komlos, W.L. Steiger, E.Szemeredi | ||
| dcs-tr-213 | ON SETS OF NATURAL NUMBERS WHOSE DIFFERENCE SET CONTAINS NO SQUARES | J.Pintz, W.L. Steiger, And E. Szemeredi | ||
| dcs-tr-214 | THE PARALLEL COMPLEXITY OF ELEMENT DISTINCTNESS IS a (LOG n) 1/2 | P. Ragde, W.L. Steiger, E. Szerneredi and A. Wigderson | ||
| dcs-tr-216 | OPTIMAL SLOPE SELECTION | R. Cole, J. Salowe, W.L. Steiger, And E. Szemeredi | ||
| dcs-tr-217 | FIXED POINT COMPUTATION AND TRANSFORMATIONAL PROGRAMMING | Jiazhen Cai | ||
| dcs-tr-218 | MANY HARD EXAMPLES FOR RESOLUTION | V. Chvatal and E. Szerneredi | ||
| dcs-tr-219 | AN ALGORITHM FOR FINDING CANONICAL SETS OF GROUND REWRITE RULES IN POLYNOMIAL TIME | J. Gallier, P. Narendran, D. Plaisted , S. Raat and W. Snyder | ||
| dcs-tr-220 | OPPOSITION GRAPHS ARE QUASI-PARITY GRAPHS | C.T. Hoang and F. Maffray | ||
| dcs-tr-222 | UPDATES IN PROPOSITIONAL DATABASES | M. Dalal | ||
| dcs-tr-223 | THE ANALOGY BETWEEN NUMERICAL WAVE PROPAGATION AND QUANTUM MECHANICS | R. Vichnevetsky | ||
| dcs-tr-224 | MURKY GRAPHS (UNEXPURGATED) | R.B. Hayward | ||
| dcs-tr-225 | KOLMOGOROV COMPLEXITY AND DEGREES OF TALLY SETS | E.W. Allender and 0. Watanabe | ||
| dcs-tr-226 | SOME CONSEQUENCES OF THE EYJSTENCE OF PSEUDORANDOM GENERATORS | E. Allender | ||
| dcs-tr-227 | P-PRINTABLE SETS | E.W. Allender and R.S. Rubinstein | ||
| dcs-tr-228 | TWO CLASSES OF PERFECT GRAPHS | Liping Sun | ||
| dcs-tr-229 | MODELING CLASS HIERARCHIES WITH CONTRADICTIONS | A. Borgida | ||
| dcs-tr-230 | A LOGIC FOR HYPOTHETICAL REASONING | A.J. Bonner | ||
| dcs-tr-231 | HYPOTHETICAL DATALOG: COMPLEXITY AND EXPRESSIBILITY | A.J. Bonner | ||
| dcs-tr-234 | ARBITRARY SPLITTING IN SPLAY TREES | J.M. Lucas | ||
| dcs-tr-235 | INFINITE SETS OF PRIMES WITH FAST PRIMALITY TESTS AND QUICK GENERATION OF LARGE PRIMES | J. Pintz, W.L. Steiger, and E. Szemeredi | ||
| dcs-tr-236 | SMALL TRANSVERSALS IN HYPERGRAPHS | V. Chvatal and C. McDlarmid | ||
| dcs-tr-237 | PACKING PATHS PERFECTLY | J. Akiyama and V. Chvatal | ||
| dcs-tr-238 | ON CUTTING-PLANE PROOFS IN COMBINATORIAL OPTIMIZATION [RUNNING TITLE: CUTTING-PLANE PROOFS] | V. Chvatal, W. Cook and M. Hartmann | ||
| dcs-tr-241 | ASPECTS OF A GRAPH-BASED PROOF PROCEDURE FOR HORN CLAUSES | S. Raatz | ||
| dcs-tr-242 | SMALLEST TRANSVERSALS OF SMALL 3-GRAPHS | R.B. Hayward | ||
| dcs-tr-243 | THEOREM PROVING USING EQUATIONAL MATINGS AND RIGID &UNIFICATION | J. GaIlier, P. Narendran, S. Raatz and W. Snyder | ||
| dcs-tr-244 | AN ANALOGY BETWEEN DISPERSIVE WAVE PROPAGATION AND SPECIAL RELATIVITY | R. Vichnevetsky | ||
| dcs-tr-245 | ON THE SIBLING-STRUCTURE OF PERFECT GRAPHS | C.T. Hoang | ||
| dcs-tr-246 | AVERAGE CASE ANALYSIS OF HEAP BUILDING BY REPEATED INSERTION | R. Hayward and C. McDiarmid | ||
| dcs-tr-247 | ON SLIM GRAPHS, EVEN PAIRS,AND STAR-CLITSETS | C.T. Hoang and F. Maff ray | ||
| dcs-tr-248 | EMPIRICAL RESULTS ON LEARNING IN AN ABSTRACTION SPACE | G. Drastal and S. Raatz | ||
| dcs-tr-249 | SOME CLASSES OF PERFECTLY ORDERABLE GRAPHS | C.T. Hoang* and B.A. Reed | ||
| dcs-tr-251 | TYPE SYSTEMS FOR QUERYING CLASS HIERARCHIES WITH NON-STRICT INHERITANCE | A. Borgida | ||
| dcs-tr-252 | THE GENERALIZED KOLMOGOROV COMPLEXITY OF SETS | E. Allender | ||
| dcs-tr-253 | QUANTUM PHENOMENA IN NUMERICAL WAVE PROPAGATION | R. Vichnevetsky | ||
| dcs-tr-254 | SOLUTION PATH CACHING MECHANISMS WHICH PROVABLY IMPROVEPERFORMANCE | W.W. Cohen | ||
| dcs-tr-255 | DATA FLOW ANALYSIS AND INCREMENTAL ITERATION | T.J. Marlowe | ||
| dcs-tr-256 | A NOTE ON THE POWER OF THRESHOLD CIRCUITS | E. Allender | ||
| dcs-tr-257 | CLAMPING OF POLYGONAL OBJECTS | V. Capoyleas | ||
| dcs-tr-258 | DOWNWARD TRANSLATIONS OF EQUALITY | E. Allender and C. Wilson | ||
| dcs-tr-259 | RECOGNIZING DART-FREE PERFECT GRAPHS | V. Chvatal, and L. Sun | ||
| dcs-tr-260 | LOWER BOUNDS FOR THE LOW HIERARCHY | E. Allender and L.A. Hemachandra | ||
| dcs-tr-261 | PERFORMANCE EVALUATION OF SEMANTICS-BASED MULTILEVEL CONCURRENCY CONTROL PROTOCOLS | B.R. Badrinath and K. Ramamritham | ||
| dcs-tr-262 | THE OCCURRENCE AND ANALYSIS OF SPURIOUS WAVELIKE SOLUTIONS IN COMPUTATIONAL FLUID DYNAMICS AND ACOUSTICS | R. Vichnevetsky | ||
| dcs-tr-263 | AN UPPER BOUND ON THE NUMBER OF PLANAR K-SETS | J. Pachl, W. Stelger and E. Szemerdei | ||
| dcs-tr-264 | TWO NEW CLASSES OF PERFECT GRAPHS | L. Sun | ||
| dcs-tr-266 | ON THE CONDUCTANCE OF ORDER MARKOV CHAINS | A. Karzanov and L. Khachiyan | ||
| dcs-tr-266a | A STATE TRANSITION MODEL FOR RULE-BASED EXPERT SYSTEMS | R. Dube | ||
| dcs-tr-269 | NEURAL NETWORK MODELS AND OPTIMIZATION METHODS FOR DIGITAL TESTING | S.T. Chakradhar | ||
| dcs-tr-270 | COMPLEXITY OF POLYTOPE VOLUME COMPUTATION | L. Khachlyan | ||
| dcs-tr-271 | CONCEPT LEARNING USING EXPLANATION BASED GENERALIZATION AS AN ABSTRACTION | W. W. Cohen | ||
| dcs-tr-272 | FUNCTIONAL EQUIVALENCE OF MULTISTAGE NETWORKS | S.P. Chaudhur | ||
| dcs-tr-273 | FAST APPROXIMATION SCHEMES FOR CONVEX PROGRAMS WITH MANY BLOCKS AND COUPLING CONSTRAINTS | M. D. Grigoriadis and L. G. Khachiyan | ||
| dcs-tr-274 | AUTOMATIC REORGANIZATION OF LOOPS TO REDUCE CACHE CONFLICTS | S.Venugopal | ||
| dcs-tr-275 | SPURIOUS SCATTERING FROM DISCONTINUOUSLY STRETCHING GRIDS IN COMPUTATIONAL FLUID DYNAMICS | R. Vichnevetsky AND L.H. Turner | ||
| dcs-tr-277 | MONTE-CARLO SIMULATION-BASED EVALUATION AND REFINEMENT OF RULE-BASED SYSTEMS | N. Indurkhya | ||
| dcs-tr-278 | KNOWLEDGE REPRESENTATION, SEMANTIC MODELING: SIMILARITIES AND DIFFERENCES | A. Borgida | ||
| dcs-tr-279 | HEURISTIC CONFIGURATION OF HIDDEN UNITS FOR NEURAL NETWORK CLASSIFIERS | N. Indurkhya and S.M. Weiss | ||
| dcs-tr-280 | TERMINOLOGIC FRAMES AS TYPES: INFERENCE RULES AND PROSPECTIVE APPLICATIONS | A. Borgida | ||
| dcs-tr-281 | APPROXIMATE SOLUTION OF MATRIX GAMES IN PARALLEL | M. D. Grigoriadis and L. G. Khachiyan | ||
| dcs-tr-370 | Halley's Method as the First Member of an Infinite Family of Cubic Order Rootfinding Methods | Bahman Kalantari | ||
| hpcd-tm-1 | Notes on the Technical Sessions of the First HPCD Workshop | M. Schwabacher and J. Keane | ||
| hpcd-tr-2 | 1st Quarterly R&D Status Report | Saul Amarel | ||
| hpcd-tr-4 | Scheduling of Structured and Unstructured Computation | A. Gerasoulis, J. Jiao, T. Yang | ||
| hpcd-tr-5 | 2ND QUARTERLY R&D STATUS REPORT | Saul Amarel | ||
| hpcd-tr-6 | A Navier-Stokes Algorithm for Turbulent Flows Using an Unstructured Grid and Flux Difference Splitting | F. Jacon and D. Knight | ||
| hpcd-tr-7 | Third Quarterly R&D Status Report | Saul Amarel | ||
| hpcd-tr-8 | DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors | T. Yang and A. Gerasoulis | ||
| hpcd-tr-9 | 1st Annual Project Summary | Saul Amarel | ||
| hpcd-tr-10 | A 2-D Compressible Navier-Stokes Algorithm Using an Adaptive Unstructured Grid | H.F. Lau and D. Knight | ||
| hpcd-tr-11 | Differences in Algorithmic Parallelism in Control Flow and Call Multigraphs | V. Sgro and B. Ryder | ||
| hpcd-tr-12 | Automated Modeling of Distributed and Lumped Phenomena in Heat Transfer (THESIS) | Sui-Ky Ringo Ling | ||
| hpcd-tr-18 | Computing and Problems of Complex Mechanical System Design | Saul Amarel | ||
| hpcd-tr-19 | 4th Quarterly R&D Status Report | Saul Amarel | ||
| hpcd-tr-24 | 5th Quarterly R&D Status Report | Saul Amarel | ||
| hpcd-tr-30 | Sixth R&D Status Report | Saul Amarel | ||
| hpcd-tr-31 | Summary Technical Report on Year 1 of the Hypercomputing and Dessign (HPCD) Project | Saul Amarel | ||
| hpcd-tr-32 | Seventh R&D Status Report | Saul Amarel | ||
| hpcd-tr-35 | Eighth R&D Status Report | Saul Amarel |