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 1981
The Flat File Database Generator Ffg, Douglas E. Comer (81-379)
The Purdue Multimachine Pipeline: A High Bandwidth Machine Network and Programming Environment for Research in Large Scale Computation, Douglas E. Comer, Peter J. Denning, John R. Rice, and Lawrence Snyder (81-378)
The Software Science Language Level Metric, S. D. Conte (81-373)
Conversion from Data-Flow to Synchronous Execution in Loop Programs, Janice D. Cuny and Lawrence Synder (81-392)
Testing the Coordination Predicate, Janice D. Cuny and Lawrence Synder (81-391)
Performance Evaluation: Experimental Computer Science at its Best, Peter J. Denning (80-368)
The Notation of Operational Analysis, Peter J. Denning (81-408A)
Progress Report Operational Analysis of Queueing Phenomena, Peter J. Denning and Jeffrey P. Buzen (81-370)
The CSNET User Environment, Peter J. Denning and Douglas E. Comer (83-456)
History and Overview of CSNET, Peter J. Denning, Anthony Hearn, and C. William Kern (81-424)
Processor Displacement: An Area-Time Trade-Off Method for VLSI Design, David M. DeRuyck, Lawrence Snyder, and John D. Unruh (81-394)
Some Results on Perfect, Static-Key Hashing, Eric Dittert and Michael J. O'Donnell (81-390)
A New Ordering Scheme for the Hermite Bicubic Collocation Equations, Wayne R. Dyksen (80-364)
A New Ordering Scheme for the Hermite Bicubic Collocation Equations, Wayne R. Dyksen and John R. Rice (81-425)
Wafer Scale Integration of Parallel Processors, Kye Sherrick Hedlund (81-401)
VLSI Algorithms for Relational Database Operations, Ching C. Hsiao and Lawrence Snyder (81-375)
Improving Virtual Memory Performance by Off-Line Page Clustering, Jehan-Francois Paris (81-399)
An Analytical Study of Strategy-Oriented Restructuring Algorithms, Jehan-François Päris and Domenico Ferrari (81-395)
Cost-Performance Bounds for Multi-Microcomputer Networks, Daniel A. Reed and Herbert D. Schwetman (81-382)
Array Facilities in Programming Languages, John R. Rice (81-380)
ELLPACK User's Guide Supplement, John R. Rice (80-363)
Performance Analysis of 13 Methods to Solve the Galerkin Method Equations, John R. Rice (81-369)
A Model for Representing Families of Programmed System, Walter F. Richy (80-356)
Software Science Revisited: A Critical Analysis of the Theory and Its Empirical Support, V. Y. Shen, S. D. Conte, and Herbert E. Dunsmore (81-376)
A General Theory of Automatic Program Synthesis, Carl H. Smith (80-360)
Overview of the Blue CHiP Computer, Lawrence Snyder (81-377)
Programming Processor Interconnection Structures, Lawrence Snyder (81-381)
The Configurable, Highly Parallel (CHiP) Approach for Signal Processing Applications, Lawrence Snyder (81-402)
Problems with COBOL--Some Empirical Evidence, D. M. Volpano and Herbert E. Dunsmore (81-371)
An Investigation of the Relationship between Initial and Final Programming Effort Estimates, Andrew S. Wang (80-365)
Software Metrics Data Collection, T. J. Yu and Brian A. Nejmeh (81-421)
Submissions from 1980
A Note on the Semantics of Looping Programs in Propositional Dynamic Logic, Francine Berman (80-346)
Models for Verifiers, Francine Berman (80-343)
Using the Purdue PROCSY Terminal System (Fortran), Bob Brown (80-325)
Using the Purdue PROCSY Terminal System (Pascal), Bob Brown (80-326)
Principles of Program Design Induced From Experience With Small, Public Programs, Douglas E. Comer (80-337)
Automatic, Remote Status Lights for VAX UNIX, Douglas E. Comer and Robert L. Brown (80-345)
Experience with Transporting Pascal to an Interactive Environment, Douglas E. Comer and John Garney (80-340)
Effort Minimization Based on Hierarchical Modularization, S. D. Conte (80-347)
Research in Secure Computing (Final Report), Dorothy E. Denning and Peter J. Denning (80-349)
Personal Key, Group Keys, and Master Keys, Dorothy E. Denning and Fred B. Schneider (80-327)
A Tale of Two Islands (A Fable), Peter J. Denning (80-342)
On Increasing Confidence in Confidence Intervals, Peter J. Denning (80-324)
Operating Systems Articles, Peter J. Denning and Dorothy E. Denning (80-336)
Low Contention Semaphores and Ready Lists, Peter J. Denning, T. Don Dennis, and Jeffrey Brumfield (80-332)
High Order Methods for Elliptic Partial Differential Equations with Singularities, Elias N. Houstis and John R. Rice (80-341)
Principles, Preferences and Ideals for Computer Arithmetic, Thomas E. Hull, Christian H. Reinsch, and John R. Rice (80-339)
Independence Results in Computer Science, Deborah Joseph and Paul Young (80-335)
A Critique of the Foundations of Hoare-Style Programming Logics, Michael O'Donnell (80-338)
A Combinatorial Problem Concerning Processor Interconnection Networks, Michael J. O'Donnell and Carl H. Smith (80-352)
Program Restructuring in Segmenting Environments, Jehan-François Päris (80-344)
Is Mathematical Software a Legitimate Research Area?, John R. Rice (80-362)
On the Effectiveness of Iteration for the Galerkin Method Equations, John R. Rice (80-353)
Validating System Models: A Case Study, H. D. Schwetman (80-333)
Implementing the Mean Value Algorithm for the Solution of Queueing Network Models, Herb Schwetman (80-355)
Modeling Performance of the B6700: A Case Study, Herb Schwetman (80-329)
Operational Analysis - An Aid to Interpretation of Measurement Data, Herb Schwetman (80-328)
Operational Analysis Based on Minimal Information: A Hypothetical Case Study, Herb Schwetman (80-334)
Some Computational Aspects of Queueing Network Models, Herb Schwetman (80-354)
Testing Network-of-Queues Software, Herb Schwetman (80-330)
A Software Science Analysis of COBOL Programs, V. Y. Shen and Herbert E. Dunsmore (80-348)
Programming With Recursion, Dirk Siefkes (80-331)
The Power of Parallelism Automatic Program Synthesis, Carl H. Smith (80-350)
Introduction to the Configurable, Highly Parallel (CHiP) Computer), Lawrence Snyder (80-351)
Theft and Conspiracy in the Take-Grant Protection Model, Lawrence Snyder (80-361)
Submissions from 1979
ELLPACK Control Card Procedures: XEQ ELLPACK, XEQ GETELL, Ronald F. Boisvert (79-310)
ELLPACK Network Documentation Preliminary Version, Ron Boisvert, John R. Rice, and John Warner (79-308)
Alternative Parameterizations of Product-Form Queueing Networks, James P. Bouhana (79-320)
Measuring and Calculating Queue Length Distributions, Jeffrey P. Buzen and Peter J. Denning (79-317)
Operational Treatment of Queue Distribution and Mean Value Analysis, Jevvrey P. Buzen and Peter J. Denning (79-309)
Hash-Binary Search: A Fast Technique for Searching an English Spelling Dictionary, Douglas E. Comer and Vincent Y. Shen (79-304)
Secure Statistical Databases with Random Sample Queries, Dorothy E. Denning (79-302)
1979 ELLPACK Workshop, Progress Report and a Proposal for a 2-Year Program, John R. Rice (79-315)
ELLPACK '78 User's Guide-Preliminary Version, John R. Rice (79-306)
Fast LP(k) Analysis, Giovanni Maria Sacco (79-300)
Handshakes Are Shaky, Giovanni Maria Sacco and Dorothy E. Denning (79-322)
Solution of General Queueing Networks Using Norton's Theorem, Stephen Tolopka (79-314)
Submissions from 1978
Homogeneous Approximations of General Queueing Networks, Gianfranco Balbo and Peter J. Dennins (78-290)
A System for Performance Evaluation of Partial Differential Equations Software, R. F. Boisvert, Elias N. Houstis, and John R. Rice (78-278)
High Order Discretizations of the Helmholtz Problem Which Admit Interactive Solution Techniques, Ronald F. Boisvert (78-296)
The Effect on Accuracy of the Placement of Auxiliary Points in the Hodie Method for the Helmholtz Problem, Ronald F. Boisvert (78-266)
ELLPACK Network User's Guide, Ron Boisvert, John Brophy, John R. Rice, and John Warner (79-319)
The Data Management Subsystem of the System for Performance Evaluation of PDE Software, J. M. Bonnet and R. F. Boisvert (78-286)
A Note on Structure and Looking Back Applied to the Relative Complexity of Computable Function, Paul Chew and Michale Machtey (79-312)
MAP: A Pascal Macro Preprocessor for Large Program Development, Douglas E. Comer (78-262)
A Simple Experiment in Top-Down Design, Douglas E. Comer and M. H. Halstead (78-292)
Geometric Problems with Application to Hashing, Douglas E. Comer and Michael J. O'Donnell (79-303)
Historical Development of Computer Science at Purdue University, S. D. Conte (78-297)
SBOPT: A Simulation Based Optimization Algorithm, B. A. Dendrou, S. A. Dendrou, and Elias N. Houstis (78-274)
ESCORT: Engineering Systems Classification and Ordering Technique, B. A. Dendrou, S. A. Dendrou, Elias N. Houstis, and T. Papatheodorou (78-273)
DNYCOR: An Uncertainty Dynamic Modal Analysis Program, B. A. Dendrou and Elias N. Houstis (78-272)
Uncertainty Finite Element Dynamic Analysis, B. A. Dendrou and Elias N. Houstis (78-271)
Numerical Methods for Flood Routing Problems, B. A. Dendrou, Elias N. Houstis, T. S. Papathedorou, and S. A. Dendrou (78-279)
Secure Personal Computing in an Insecure Network, Dorothy E. Denning (78-270)
Data Security, Dorothy E. Denning and Peter J. Denning (79-301)
A Study of Publication Delays, Peter J. Denning (78-298)
On Learning How to Predict, Peter J. Denning (79-316)
Working Sets Past and Present, Peter J. Denning (78-276)
Working Sets Today, Peter J. Denning (78-287)
A Qualitative Justification for a Measure of Program Clarity, Ronald D. Gordon (78-269)