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 1975
High Order Fast Elliptic Equation Solver, Elias N. Houstis and T. S. Papatheordorou (77-246)
An Endogenous Priority Model for Load Control in Combined Batch—Interactive Computer Systems, Carl E. Landwehr (75-157)
Speedup in Parallel Algorithms for Adaptive Quadratures, James M. Lemme and John R. Rice (76-192)
Corrections to Some Errors in a Version of TSP: (Time Series Processor), Robert E. Lynch (75-153)
The Hodie Method: A Brief Introduction with Summary of Computational Properties, Robert E. Lynch and John R. Rice (75-170)
Estimating Response Time for Auxiliary Memory Configurations with Multiple Movable-Head Disk Modules, K. Omahen (75-158)
Some Insights Into Deterministic Scheduling Problems Involving Multiple Resources and Preemption, K. Omahen (75-155)
Capacity Bounds for Multi-Resource Queues, K. J. Omahen (75-137)
Analysis & Applications of the Delay Cycle for the M/M/c Queueing System, K. Omahen and V. Marathe (75-165)
A Queueing Model for A Multiprocessor System with Partitioned Memory, K. Omahen and V. Marathe (75-132)
Equational Logic and Equational Theories of Algebras, Don Pigozzi (75-135)
Algorithm - Adapt, Adaptive Smooth Curve Fitting, John R. Rice (75-166)
On the Computational Complexity of Approximation Operators II, John R. Rice (75-136)
Remarks on Piecewise Polynomial Approximation, John R. Rice (75-163)
The Algorithm Selection Problem, John R. Rice (75-152)
Optimal Compression of Parsing Tables in a Parsergenerating System, V. B. Schneider and M. D. Mickunas (75-150)
One Address Computers are Faster and Use Less Memory Space to Execute Arithmetic Assignment Statements, Victor Schneider and Bradford Wade (75-149)
Using a Programmable Calculator to Introduce Fundamental Concepts of Assembly Language Programming, H. D. Schwetman (75-171)
Characterizing the Orders Changes by Program Translators, Margaret Shay and Paul Young (75-161)
On the Limits of Text File Compression, V. Y. Shen and M. H. Halstead (77-257)
Modeling and Performance Evaluation of Physical Data Base Structures, S. B. Yao (76-179)
Selection of File Organization Using An Analytic Model, S. B. Yao and A. G. Merten (75-151)
Optimization Among Provably Equivalent Programs, Paul Young (75-156)
Submissions from 1974
Impurities Found in Algorithm Implementations, Necdet Bulnut and Maurice H. Halstead (74-111)
Experimental Validation of a Structural Property of Fortran Algorithms, Necdet Bulnut, Maurice H. Halstead, and Rudolf Bayer (74-115)
Linear Bounded Tree Automata, Carol Chrisman (74-109)
Selectively Defined Subsystems, Dorothy E. Denning, Peter J. Denning, and G. Scott Graham (74-124)
Comments on a Linear Paging Model, Peter J. Denning (74-123)
Multiprogrammed Memory Management, Peter J. Denning and G. Scott Graham (74-122)
Requirements Statement Language Principles for Automatic Programming, Thomas I. M. Ho and J. F. Nunamaker (74-125)
Algorithms for Elliptic Partial Differential Equations: Metalgorithms and Selection, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, and John R. Rice (74-121)
A Non-Procedural High-Level Language for Automated Design of Application Systems, J. F. Nunamaker (74-127)
Adaptive Approximation, John R. Rice (74-120)
Parallel Algorithms for Adaptive Quadrature III - Program Correctness, John R. Rice (74-112)
The Algorithm Selection Problem—Abstract Models, John R. Rice (74-116)
The Algorithm Selection Problem III - Approximation Theory Machinery, John R. Rice (74-130)
The Algorithm Selection Problem II—Two Concrete Problems: Numerical Analysis Quadrature—Algorithms, Operating Systems—Scheduling Design, John R. Rice (74-117)
A Measure of Structural Complexity for Context-free Grammars, D. A. Workman (74-129)
Abstract Families of Context-Free Grammars, David Workman (74-114)
Tree Structures Construction Using Hit Ratios, S. B. Yao (75-133)
Semantic Decomposition of Computer Programs: An Aid to Program Testing, Paul M. Zeslis (74-110)
Submissions from 1973
On Program Volume and Program Modularization, Rudolf Bayer (73-105)
The Monadic Second-Order Theory of Ordinals w sub 2, J. Richard Buchi and Charles Zaiontz (73-113)
A Study of Decompiling Machine Language into High-Level Machine Independent Languages, Barron Cornelius Housel (73-100)
Magnetic Tape Portability, James Alf Iverson (73-101)
Prefix Codes, Trees and Automata, Jean-Louis Lassez (73-106)
Specification and Design of an Information System Using Computer Aided Analysis, J. F. Nunamaker (74-126)
Modeling A Large Online File System, John Pomeranz (73-108)
Parallel Algorithms for Adaptive Quadrature - Convergence, John R. Rice (73-104)
Parallel Algorithms For Adaptive Quadrature II - Metalgorithm Correctness, John R. Rice (73-107)
Submissions from 1972
A Note on Orders of Enumeration, John Helm, Albert Meyer, and Paul Young (72-050)
A Methodology for the Design and Optimization of Information Processing Systems, J. F. Nunamaker (72-051)
A Planning and Cost Allocation Procedure for Computer System Management, J. Nunamaker and A. Whinston (72-052)
Submissions from 1971
Symmetric Binary B-Trees: Data Structure and Algorithms for Random and Sequential Information Processing, Rudolf Bayer (71-054)
A Simplex Algorithm - Gradient Projection Method for Nonlinear Programming, L. Duane Pyle (71-055)
An Axiom System For the Weak Monadic Second Order Theory of Two Successors, Dirk Siefkes (71-056)
Submissions from 1970
Numerical Analysis - Final Report, John R. Rice (70-049)
On the Number of Registers Needed to Evaluate Arithmetic Expressions, Victor Schneider (70-047)
A One Pass Algorithm for Compiling ALGOL 68 Declarations, Victor B. Schneider (70-053)
A Note on "Axioms" for Computational Complexity and Computation of Finite Functions, Paul R. Young (69-039)
Submissions from 1969
Smoothing and Estimation Derivatives of Equispaced Data, J. J. Casaletto and John R. Rice (69-035)
A Comparison of Some Numerical Integration Programs, J. Casaletto, M. Pickett, and John R. Rice (69-037)
A Polyalgorithm for the Automatic Solution of Nonlinear Equations, John R. Rice (69-032)
A Set of 74 Test Functions for Nonlinear Equation Solvers, John R. Rice (69-034)
The Degree of Convergence for Entire Functions, John R. Rice (69-036)
A Translation Grammar for ALGOL 68, Victor B. Schneider (69-042)
A Mathematical Problem Solving Language and its Interpreter, Lawrence R. Symes (69-044)
Evaluation of NAPSS Expression Involving Polyalgorithms, Functions, Recursion, and Untyped Variables, Lawrence R. Symes (69-033)
Manipulation of Data Structure in a Numerical Analysis Problem Solving Systems, Lawrence R. Symes (69-045)
A Note on Dense and Nondense Families of Complexity Classes, Paul R. Young (69-040)
Submissions from 1968
Least Squares Cubic Spline Approximation I - Fixed Knots, Carl de Boor and John R. Rice (68-020)
Least Squares Cubic Spline Approximation, II - Variable Knots, Carl de Boor and John R. Rice (68-021)
PTSS User's Manual, E. J. Desautels (68-027)
An Evaluation of Five Polynomial Zero Finders, David S. Dodson, Phillip A. Miller, William C. Nylin, and John R. Rice (68-024)
Numerical Analysis for the Consumer, D. Dodson, J. Ewing, P. Miller, W. Nylin, E. Petarik, and S. Prues (68-026)
Electronic Computers - A Historical Survey in Print, Saul Rosen (68-025)
ORTNRM - A Fortran Subroutine Package for the Solution of Linear Two-Point Boundary Value Problems, S. Silverston (68-018)
QSLIN - A Fortran Subroutine Package for the Solution of Non-Linear Two-Point Boundary Value Problems, S. Silverston (68-017)
Submissions from 1967
Definability in the Monadic Second-Order Theory of Successor, J. Richard Buchi and Lawrence H. Landweber (67-015)
Solving Sequential Conditions by Finite State Strategies, J. Richard Buchi and Lawrence H. Landweber (67-014)
The Generalized Inverse in Linear Programming: An Intersection Projection Method, L. Duane Pyle (67-013)
Structure of a Language for a Numerical Analysis Problem Solving Systems, Lawrence R. Symes and Roger V. Roman (67-012)
Submissions from 1965
The Generalized Inverse in Linear Programming Basic Theory, L. Duane Pyle (65-001)