Submit Technical Report
Your TR # will be assigned by an administrator after your submission is made. If a TR # is needed prior to submission, please email your request to tr-request@cs.purdue.edu. You will be notified by email as soon as your TR has been added to the site.
Submissions from 1978
Measuring Improvements in Program Clarity, Ronald D. Gordon (78-268)
Measuring Improvements in Program Clarity, Ronald D. Gordon (78-265)
Optimization of Data Access in Distributed Systems, Alan R. Hevner and S. Bing Yao (78-281)
Matching Tree Patterns, Christoph M. Hoffmann (78-291)
Collocation - A Simple, Flexible and Efficient Method for Integral and Differential Equations, Elias N. Houstis (78-258)
An Experimental Design for the Computational Evaluation of Elliptic Partial Differential Equations Solvers, Elias N. Houstis and John R. Rice (78-264)
A Population of Partial Differential Equations for Evaluating Methods, Elias N. Houstis and John R. Rice (78-263)
The Use of ELLPACK 77 for Solving the LaPlace Equation on a Region with Interior Slits, Application to a Problem in Magnetohydrodynamics, Robert E. Lynch, Paul Gherson, and Paul S. Lykoudis (78-275)
Remarks on Recursion vs. Diagonalization, Michael Machtey (79-311)
A Programming Language Theorem Which is Independent of Peano Arithmetic, Michael O'Donnell (78-299)
Quantitative Estimates of Debugging Requirements, Linda M. Ottenstein (78-282)
Adaptive Multivariate Approximation Theory and Applications, John R. Rice (78-293)
ELLPACK 77 Contributor's Guide, John R. Rice (78-267)
ELLPACK 77 User's Guide, John R. Rice (78-289)
ELLPACK Workshop, John R. Rice (78-285)
"Programming Effort" Analysis of the ELLPACK Language, John R. Rice (78-288)
The Relationship Between Student Grades and Software Science Parameters, V. Y. Shen (78-294)
A User's Introduction to the Dual-Mace Operating System, V. Y. Shen and Stephen Tolopka (78-295)
An Inductive Inference Bibliography, Carl H. Smith (79-323)
Applications of Classical Recursion Theory to Computer Science, Carl H. Smith (79-313)
On the Relative Comprehensibility of Various Control Structures by Novice FORTRAN programmers, C. H. Smith and Herbert E. Dunsmore (79-307)
Optimization of Query Evaluation Algorithms, S. B. Yao (78-283)
Evaluation of Access Paths in a Relational Database System, S. Bing Yao and David De Jong (78-280)
Submissions from 1977
Computational Aspects of Closed Queueing Networks With Different Customer Classes, G. Balbo, S. C. Bruell, and H. D. Schwetman (77-210)
ELLPACK Distribution Guide, Ronald F. Boisvert (77-254)
Effects of Updates on Optimality In Tries and Doubly-Chained Trees, Douglas E. Comer (77-256)
Heuristics for Trie Index Minimization, Douglas E. Comer (77-224)
MOUSE4: An Improved Implementation of the RATFOR Preprocessor, Douglas E. Comer (77-236)
Removing Duplicate Rows of a Bounded Degree Array Using Tries, Douglas E. Comer (77-240)
INFEM: An Inference-Finite Element Program For Flow Problems, B. Dendrou and Elias N. Houstis (77-249)
Stochastic Analysis of the Effect of Random Permeability Distributions on Confine Seepage, B. Dendrou and Elias N. Houstis (77-234)
Operational Analysis of Queueing Networks, Peter J. Denning and Jeffrey P. Buzen (77-225)
Computer Systems Modeling, Measurement and Evaluation: Project Report 1976-1977, Peter J. Denning, Saul Rosen, and Herbert D. Schwetman (77-245)
A Quantitative Connection Between Computer Programs and Technical Prose, M. H. Halstead (77-227)
A Software Science Analysis of the Writing of a Technical Paper, M. H. Halstead (77-242)
Potential Contributions of Software Science to Software Reliability, M. H. Halstead (77-229)
Potential Impacts of Software Science on Software Life Cycle Management, M. H. Halstead (77-237)
A Compiler Extension Theorem for Lucid, Christoph M. Hoffmann (77-222)
Data Base Concepts for System Analysis, Thomas I. M. Ho (77-219)
Logical Data Base Design Principles for CODASYL Data Base Management Systems, Thomas I. M. Ho and Patrick A. Blosser (77-239)
The Complexity of Numerical Methods for Elliptic Partial Differential Equations, Elias N. Houstis (77-253)
The Effect of Numerical Integration in the Finite Element Approximation of Hyperbolic Problems, Elias N. Houstis (77-233)
Comparison of Fast Direct Methods for Elliptic Problems, Elias N. Houstis and T. S. Papatheordorou (77-218)
Software for Linear Elliptic Problems on General Two Dimensional Domains, Elias N. Houstis and John R. Rice (77-220)
O(h^6) Accurate Finite Difference Approximation to Solutions of the Poisson Equation in Three Variables, Robert E. Lynch (77-221)
O(h^6) Discretization Error Finite Difference Approximation to Solutions of the Poisson Equation in Three Variables, Robert E. Lynch (77-230)
A High Order Difference Method for Differential Equation, Robert E. Lynch and John R. Rice (77-244)
High Accuracy Finite Difference Approximation to Solutions of Elliptic Partial Differential Equations, Robert E. Lynch and John R. Rice (77-223)
Further Validation of an Error Hypothesis, Linda M. Ottenstein (77-252)
Properties of LL-Regular Languages, David A. Poplawski (77-241)
NONLINEAR APPROXIMATION - Final Report for NSF Grant GP-3294OX, John R. Rice (77-235)
Software for Numerical Computation, John R. Rice (77-214)
Submissions from 1976
Analysis of a Heuristic for Full Trie Minimization, Douglas E. Comer (77-217)
Proving Protection Systems Safe, D. E. Denning, P. J. Denning, S. J. Garland, M. A. Harrison, and W.L. Ruzzo (76-209)
Certification of Programs for Secure Information Flow, Dorothy E. Denning and Peter J. Denning (76-181)
On the Derivation of Lattice Structured Information Flow Policies, Dorothy E. Denning, Peter J. Denning, and G. Scott Graham (76-180)
Real Time Generation of MIN Distance Strings, Peter J. Denning (77-211)
Generalized Working Sets for Segment Reference Strings, Peter J. Denning and Donald R. Slutz (76-178)
The QUICK Instructional System, Sharon Fletcher (76-187)
Efficient Recursive Parsing, Christoph M. Hoffmann (77-215)
Levels of Abstraction for Determining Data Requirements, Thomas I. M. Ho (76-195)
New Perspectives for Information Systems Education, Thomas I. M. Ho (77-212)
System Analysis Perspectives, Thomas I. M. Ho (76-182)
Experiments with Computer Aided Self-Paced Instruction for Mathematical Programming Education, Thomas Ho, A. Ravindran, and Arthur Sinensky (76-198)
Evaluation of Numerical Methods for Elliptic Partial Differential Equations, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, and J. R. Rice (76-204)
Piecewise Cubic Hermite Interpolation at the Gaussian Points, Elias N. Houstis and T. S. Papatheodorou (76-199)
A Collocation Method for Fredholm Integral Equations of the Second Kind, Elias N. Houstis and T. S. Papatheordorou (76-206)
The Terminal Process, Kevin E. Kolis, John B. Lohse, Peter Radtke, Robert Sedlemeyer, and Ronald D. Bedford (76-201)
Adaptive Quadrature Algorithms for Illiac IV., James M. Lemme (76-189)
Multi-Dimensional Clustering for Data Base Organizations, J. H. Liou and S. B. Yao (77-213)
The Hodie Method for Ordinary Differential Equations, Robert E. Lynch and John R. Rice (76-188)
An Algorithmic Approach to the Detection and Prevention of Plagiarism, Karl J. Ottenstein (76-200)
A Program to Count Operators and Operands for ANSI—FORTRAN Modules, Karl J. Ottenstein (76-196)
Predicting the Number of Bugs Expected in a Program Module, Linda M. Ottenstein, Victor B. Schneider, and Maurice H. Halstead (76-205)
Algorithmic Progress in Solving Partial Differential Equations, John R. Rice (76-173)
ELLPACK--A Cooperative Effort for the Study of Numerical Methods for Elliptic Partial Differential Equations, John R. Rice (76-203)
Note on the Software Design for an Elliptic PDE Solver, John R. Rice (76-193)
Numerical Computation Breakthroughs and Future Challenges, John R. Rice (76-183)
Some Data and Observation on Research Publication (A) Numerical Computation, (B) Programming Languages and Systems, John R. Rice (76-197)
Statistical Computing - The Vanguard of the Future of Education, John R. Rice (76-186)
Linear Queries in Statistical Data Bases, M. D. Swartz, D. E. Denning, and P. J. Denning (77-216)
A Hierarchical Access Model for Data Base Organizations, S. B. Yao (76-177)
Approximating the Number of Blocks Accessed in Data Base Organizations, S. B. Yao (76-184)
Submissions from 1975
Beginners Guide to PROCSY, C. Anderson, K. Apeland, L. Breisacher, C. Canfield, and T. Reiter (75-141)
Skolem Rings and Their Varieties, J. R. Buchi and T. M. Owens (75-140)
The Difficulty of Optimum Index Solution, Douglas E. Comer (77-248)
Reorganization Points for File Designs with Nonlinear Processing Costs, K. Sundar Das, T. J. Teorey, and S. B. Yao (75-160)
The Computation and Use of Optimal Paging Curves, Peter J. Denning (75-154)
An L=S Criterion for Optimal Multiprogramming, Peter J. Denning and Kevin C. Kahn (75-162)
A Study of Program Locality and Lifetime Functions, Peter J. Denning and Kevin C. Kahn (75-148)
Some Distribution-Free Properties of Throughput and Response Time, Peter J. Denning and Kevin C. Kahn (75-159)
The Dependence of Operating System Size Upon Allocatable Resources, Atilla Elci (75-172)
A Software Physics Analysis of Akiyama's Debugging Data, Yasao Funami and M. H. Halstead (75-144)
An Experiment Comparing Fortran Programming Times with the Software Physics Hypothesis, R. D. Gordon and M. H. Halstead (75-167)
The Essential Design Criterion for Computer Languages: Software Science, M. H. Halstead (76-191)
Toward a Theoretical Basis for Estimating Programming Efforts, M. H. Halstead (75-143)
Using the Methodology of Natural Science to Understand Software, M. H. Halstead (76-190)
Development, Evaluation & Selection of Methods for Elliptic Partial Differential Equations, E. N. Hnoustis, Robert E. Lynch, T. S. Papatheodorou, and John R. Rice (75-134)
A Teaching Aid to Simulate the Requirements Statement Process, Thomas I. M. Ho, Benn Konsynski, and J. F. Nunamaker (75-142)
Collocation Methods for Linear Elliptic Problems, Elias N. Houstis (77-255)