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 1989
Solving Linear Systems with Sparse Matrices on Hypercubes, Mo Mu and John R. Rice (89-870)
Curvature Adjusted Parameterization of Curves, Richard R. Patterson and Chanderjit Bajaj (89-907)
Naive Asymptotics for Hitting Time Bounds in Markov Chains, Vernon J. Rego (89-896)
Composition of Libraries, Software Parts and Problem Solving Environments, John R. Rice (89-852)
On the Analysis of the Tail Queue Length and Waiting Time Distributions of a GI/GI/c Queue, John S. Sadowsky and Wojciech Szpankowski (89-937)
DEX: A High Level Tool for Distributed System Experiments, Niraj K. Sharma and Jagannathan Srinivasan (89-849)
Computer Vandalism and the Law, Eugene H. Spafford (89-936)
The Internet Worm Incident, Eugene H. Spafford (89-933)
A Computer Virus Primer, Eugene H. Spafford, Kathleen A. Heaphy, and David J. Ferbrache (89-935)
Description of SEMILOG, Ryan Stanisfer, Chul Hung, Andrew B. Whinston, and Parthasarathy Bhasker (89-868)
On the Height of Digital Trees and Related Problems, Wojciech Szpankowski (88-816)
(Probably) Optimal Solution to Some Problems Not Only on Graphs, Wojciech Szpankowski (89-872)
Some Thoughts on Ultimate Stability Condition for G|G|1 Queue, Wojciech Szpankowski (89-876)
Towards Computable Stability Criteria for Some Multidimensional Stochastic Processes Arising in Queueing Models, Wojciech Szpankowski (89-879)
Efficient Heap Implementation with a Fixed-Size Linear Systolic Array, Jyh-Jong Tsay (89-911)
Obtaining Boundaries with Respect: A Simple Approach to Performing Set Operations on Polyhedra, George Vanecek (89-920)
Protosolid: An inside look, George Vanecek (89-921)
An Architecture for High-Speed Packet Switched Networks (Thesis), Rajendra Shirvaram Yavatkar (89-898)
Submissions from 1988
Computations with Algebraic Curves, Shreeram S. Abhyankar and Chandrajit L. Bajaj (88-806)
On Computing Longest Common Subsequences in Linear Space, A. Apostolico, S. Browne, and C. Guerra (88-819)
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point, Mikhail J. Atallah, Danny Z. Chen, and Hubert Wagner (88-759)
Output-Sensitive Hidden Surface Elimination for Rectangles, Mikhail J. Atallah and Michael T. Goodrich (88-804)
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations, Mikhail J. Atallah, Michael T. Goodrich, and S. Rao Kosaraju (88-814)
Topological Numbering of Features on a Mesh (CC-88-18), Mikhail J. Atallah, Susanne E. Hambrusch, and Lynn E. TeWinkel (88-779)
Convex Decompositions of Simple Polyhedra, Chanderjit Bajaj and Tamal K. Dey (88-833)
On the Applications of Multi-Equational Resultants, Chanderjit Bajaj, Thomas Garrity, and Joe Warren (88-826)
Hermite Interpolation of Rational Space Curves Using Real Algebraic Surfaces, Chanderjit Bajaj and Insung Ihm (88-838)
Algorithms for Planar Geometric Models, Chanderjit Bajaj and Myung-Soo Kim (88-755)
Geometric Modeling with Algebraic Surfaces, Chanderjit L. Bajaj (88-825)
Interface Structures I: Abstract Structures for Computing About Physical Objects, Chandrajit Bajaj, Dayne Dyksen, Christoph M. Hoffmann, Elias N. Houstis, and John T. Korb (88-792)
Approximation Methods for Algebraic Curves and Surfaces, Chandrajit L. Bajaj (88-822)
A Generic Algorithm for Transaction Processing During Network Partitioning, Bharat Bhargava and Shirley Browne (88-787)
Engineering the Object-Relation Database Model in O-Raid, Bharat Bhargava, Prasun Dewan, and Stephen Leung (88-781)
SETH: A Quorum-Based Replicated Database System for Experimentation with Failures, Bharat Bhargava, Abdelsalam Helal, and Jagannathan Srinivasan (88-784)
Three Experiments in Reliable Transaction Processing in RAID, Bharat Bhargava, Fady Lamaa, Pei-Jyun Leu, and John Riedl (88-782)
Experimenal Evaluation of Concurrent Checkpointing and Rollback-Recovery Algorithms, Bharat Bhargava, Pei-Jyun Leu, and Shy-Renn Lian (88-790)
Implementation of RAID, Bharat Bhargava and John Riedl (88-775)
A "Generalization" of the Patel-Jordan Parallel Iterative Technique, John P. Bonomo and Wayne R. Dyksen (88-811)
XELLPACK: An Interactive Problem Solving Environment for Elliptic Partial Differential Equations, Jophn P. Bonomo and Wayne R. Dyksen (88-839)
On the Geometry of Dupin Cyclides, V. Chandru, D. Dutta, and Christoph M. Hoffmann (88-818)
Dynamics of Knowledge Processing in Parallel Systems, Abhijit Chaundhury, Dan C. Marinescu, and Andrew Whinston (88-776)
A Parallel Spline Collocation-Capacitance Method for Elliptic Parallel Differential Equations, C. C. Christara, Elias N. Houstis, and John R. Rice (88-735)
On Local Implicit Approximation and Its Applications, Jung Hong Chuang and Christoph M. Hoffmann (88-812)
Efficient Interprocess Communication Using Shared Memory, Douglas E. Comer and Steven B. Munson (88-744)
A White Paper on High-Speed Network Architecture, Douglas E. Comer, John M. Steele, and Raj Yavatkar (88-829)
Estimating Lower Bounds on Buffer Sizes for a Packet Switch, Douglas E. Comer and Rajendra Yavatkar (88-778)
FLOWS: Performance Guarantees in Best Effort Delivery Systems, Douglas E. Comer and Rajendra Yavatkar (88-791)
MACHINE LEARNING: A Critique of Research Efforts and Suggested Research Strategy, William S. Davis and David B. Murrell (88-774)
Integrating Editing in a Monolingual Environment, Prasun Dewan (88-763)
Supporting Objects in a Conventional Operating System, Prasun Dewan (88-762)
An Approach to Support Automatic Generation of User Interfaces, Prasun Dewan and Marvin Solomon (88-761)
Software Engineering Team Project Group Member Evaluations: Some Empirical Results, Herbert E. Dunsmore, David P. Moffett, and Steven T. Ward (88-740)
Effects of Autonomy on Maintaining Global Serializability in Heterogeneous Database Systems, W. Du, Ahmed K. Elmagarmid, Y. Leu, and S. F. Ostermann (88-835)
Elliptic Expert: The Design of an Expert System for Elliptic Partial Differential Equations, Wayne R. Dyksen and Carl R. Gritter (88-840)
Quasi Serializability: A Correctness Criterion for InterBase, Ahmed K. Elmagarmid (88-836)
A Note on the Complexity of a Simple Transportation Problem, Greg N. Frederickson (88-809)
Distributed Algorithms for Selection in Sets, Greg N. Frederickson (84-471)
Planar Graph Decomposition and All Pairs Shortest Paths, Greg N. Frederickson (88-788)
On an SSOR Matari Relationship and its Consequences, S. Galanis, A. Hadjidimos, and D. Noutsos (88-815)
A Lower Bound on Embedding Tree Machines with Balanced Processor Utilization, Ajay K. Gupta and Susanne E. Hambrusch (88-794)
Embedding Complete Binary Trees into Butterfly Networks, Ajay K. Gupta and Susanne E. Hambrusch (88-821)
The Young-Eidson Algorithm: Applications and Extensions, A. Hadjidimos and D. Noutsos (88-828)
A Study of Connected Component Labeling Algorithms on the MPP, Susanne E. Hambrusch and Lynn TeWinkel (87-721)
Comments on Mohr and Henderson's Path Consistency, Ching-Chih Han and Chia-Hoang Lee (88-733)
Applying Algebraic Geometry to Surface Intersection Evaluation, Christoph M. Hoffmann (88-772)
A Dimensionality Paradigm for Surface Interrogations, Christoph M. Hoffmann (88-837)
The Problem of Accuracy and Robustness in Geometric Computation, Christoph M. Hoffmann (88-771)
Model Generation and Modification for Dynamic Systems from Geometric Data, Christoph M. Hoffmann and John E. Hopcroft (88-767)
A User Guide to the algorithm mapper: A system for modeling and evaluating parallel applications/architecture pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartizis, and D.L. Alexandrakis (88-793)
IMACS Conference on Expert Systems for Numerical Computing, Elias N. Houstis (88-827)
Parallel (//) ELLPACK: An Expert System for Parallel Processing of Partial Differential Equations, Elias N. Houstis, John R. Rice, and T. S. Papatheodorou (88-831)
A Schwarz Splitting Variant of Cubic Spline Collocation Methods for Elliptic PDEs, Elias N. Houstis, John R. Rice, and E.A. Vavalis (88-745)
On the Sorting of Points along an Algebraic Curve, John K. Johnstone and Chanderjit Bajaj (88-824)
A Formalism for Describing Data Distribution, Charles Koelbel (88-803)
Semi-automatic Process Decomposition for Non-shared Memory Machines, Charles Koelbel and Piyush Mehrotra (88-802)
Efficient Algorithms for Hybrid Data/Voice Transmissions, Andrzej Kusiuk and Wojciech Szpankowski (88-805)
Motion Estimation of a Rigid Planar Patch: A Robust Computational Technique, Chia-Hoang Lee (88-746)
Structure and Motion from Two Perspective Views Via Planar Patch, Chia-Hoang Lee (88-734)
Time-Varying Images: The Effect of Finite Resolution on Uniqueness, Chia-Hoang Lee (88-801)
Towards Implementing Robust Visual Motion Computations: Generate and Test Approach, Chia-Hoang Lee (88-756)
An Event-Action Model and Associated Architecture for Monitoring Parallel and Distributed Systems, Dan C. Marinescu, James E. Lumpp, Thomas L. Casavant, and Howard Jhay Siegel (88-817)
Multilevel Asynchronous Iteration for PDEs, Dan C. Marinescu and John R. Rice (88-820)
Non-Algorithmic Load Imbalance Effects for Domain Decomposition Methods on a Hypercube, Dan C. Marinescu and John R. Rice (88-832)
On the Effects of Synchronization in Parallel Computing, Dan C. Marinescu and John R. Rice (88-750)
On the Analysis of Request-Response Communication in a Token Passing Ring, Dan Cristian Marinescu (88-760)
An Experimental Performance Analysis for the Rate of Convergence on Collocation on General Domains, Mo Mu and John R. Rice (88-738)
A Band and Bound Technique for Simple Random Algorithms, Vernon J. Rego (88-844)
A Note on Two Simulation Benchmarks, Vernon J. Rego (88-741)
Concurrency Enhancement Through Program Unification: A Performance Analysis, Vernon J. Rego and Aditya P. Mathur (88-739)
Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis, Vernon J. Rego and Aditya P. Mathur (88-751)
Potential Evaluation Directions for ELLPACK, John R. Rice (88-752)
Analysis of a Two Level Asynchronous Algorithm for PDEs, John R. Rice and Dan C. Marineseu (88-800)
An Experimental Performance Analysis for the Rate of Convergence of 5-Point Star on General Domains, John R. Rice and Mo Mu (88-747)
An Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness, Susan Rodger (88-798)
Distributed Operation Language for Specification and Processing of Multidatabase Applications, Marek Rusinkiewicz, Kanchei Loa, and Ahmed K. Elmagarmid (88-834)
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs, Gregory E. Shannon (88-737)
Robust Replication Control Using Primary Copy Method, Niraj K. Sharma (88-773)
The Internet Worm Program: An Analysis, Eugene H. Spafford (88-823)
On The Bottleneck and Capacity Assignment Problems, Wojciech Szpankowski (88-841)
On the Maximum Queue Length with Applications to Data Structures: A Simple But Yet Asymptotically Exact Approach, Wojciech Szpankowski (88-785)