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 1986
Finding the Convex Hull of a Sorted Point Set in Parallel, Michael T. Goodrich (86-655)
A Unifying Framework for Systolic Designs, Concettina Guerra (86-595)
Synthesizing Non-Uniform Systolic Designs, Concettina Guerra and Rami Melhem (86-621)
Optimal Three-Dimensional Layouts of Complete Binary Trees, Ajay K. Gupta and Susanne E. Hambrusch (86-605)
Simulation of Physical Systems from Geometric Models, Christoph M. Hoffmann and John E. Hopfcroft (86-635)
Partitioning PDE Computations: Methods and Performance Evaluation, Catherine E. Houstis, Elias N. Houstis, and John R. Rice (86-614)
Performance Evaluation Modeling for Distributed Computing, Catherine E. Houstis, Elias N. Houstis, and John R. Rice (86-576)
Quadratic-Spline Collocation Methods for Two Point Boundary Value Problems, Elias N. Houstis, C. C. Christara, and John R. Rice (86-584)
Convergence of O(h**4) Cubic Spline Collocation Methods for Elliptic Partial Differential Equations, Elias N. Houstis, E. A. Vavalis, and John R. Rice (86-596)
A Logarithmic Time Parallel Algorithm for Partitioning, Costas S. Iliopoulos (86-603)
Optimal Cost Parallel Algorithms for Lexicographical Ordering, Costas S. Iliopoulos (86-602)
An O(h**6) Quintic Spline Collocation Method for Fourth Order Two-Point Boundary Value Problems, M. Irodotou-Ellina and Elias N. Houstis (86-618)
Cache Coherence in Distributed Systems (Thesis), Christopher Angel Kent (86-630)
Command Execution in a Heterogeneous Environment, John T. Korb and Craig E. Wills (86-593)
Omicron: Events => Action, Balachander Krishnamurthy and Craig E. Wills (86-594)
A Counterexample to Perception of Structure from Motions, Chia-Hoang Lee (86-610)
Matching and Motion of Four Points in Two Views, Chia-Hoang Lee (86-611)
On Correspondence, Motion, Scale and Structure of Two Views of a Scene, Chia-Hoang Lee (86-591)
Structure from Motion: An Augmented Problem and a New Algorithm, Chia-Hoang Lee (86-624)
Application of Modified Predicate Transition Nets to Modeling and Simulation of Communication Protocols, Chuang Lin and Dana Cristian Marinescu (86-599)
Stochastic High-Level Petri Nets and Applications, Chuang Lin and Dana Cristian Marinescu (86-613)
On the Behavior of Programs with Remote Procedures, Dan C. Marinescu (86-636)
Modeling of an Availability Driven Computer Network Architecture, Dan C. Marinescu, Vernon J. Rego, and Wojciech Szpankowski (86-626)
Domain Oriented Analysis of PDE Splitting Algorithms, Dan C. Marinescu and John R. Rice (86-627)
Analysis of a Class of Real-Time Control Systems, Dan Cristian Marinescu (86-572)
Scheduling Protocols Based Upon Limited Contention Multiple Access, Dan Cristian Marinescu (86-571)
An Architecture for a Local Network Providing Multiple Supercomputer Access, Dan Cristian Marinescu, Vernon J. Rego, and Wojciech Szpankowski (86-573)
Availability Driven Multiple Access Network Architecture, Dan Cristian Marinescu, Vernon J. Rego, and Wojciech Szpankowski (86-645)
The Application of a Sequence Notation to the Design of Systolic Computations, Rami Melhem and Conceltina Guerra (86-568)
Evaluating Storage Management Schemes for Block Structured Languages, Thomas P. Murtagh (86-570)
Characterisations of Equilibrium Queue Length Distributions in M/cd/1 Queues, Vernon J. Rego (86-616)
On Distributions of Run-Times in Distributed Systems, Vernon J. Rego (86-607)
Some Explicit Formulas for Mixed Exponential Service Systems, Vernon J. Rego (86-644)
Analytic Modelling of Cyclic Service Systems and Their Application to Token-Passing Local Networks, Vernon J. Rego and Lionel M. Ni (86-597)
The Presence of Exponentiality in Entropy Maximised M/GI/1 Queues, Vernon J. Rego and Wojciech Szpankowski (86-620)
Design of a Tensor Product Population of PDE Problems, John R. Rice (86-628)
Language Independent PROTRAN, John R. Rice (86-633)
Multi-Flex Machines Preliminary Report, John R. Rice (86-612)
Parallelism in Solving PDEs, John R. Rice (86-604)
Parallel Methods for PDES, John R. Rice (86-587)
Ellpack Project Status Report, John R. Rice, Wayne R. Dyksen, Elias N. Houstis, and Calvin J. Ribbens (86-579)
Realistic PDE Solutions for Non-Rectangular Domains, Calvin J. Riobbens and John R. Rice (86-639)
Parallel Independent Set Algorithms for Sparse Graphs, Gregory Shannon (86-634)
Verification of loops and exceptions, Ryan Stansifer (86-631)
On the Analysis of the Average Height of a Digital Trie: Another Approach, Wojciech Szpankowski (86-646)
Patricia Tries Again Revisited, Wojciech Szpankowski (86-625)
Some Remarks on Uniformly Bounded Markov Chains: Stability Analysis, Wojciech Szpankowski (86-600)
Some Results on V-ary Asymmetric Tries, Wojciech Szpankowski (86-582)
Stability Conditions for Multidimensional Queueing Systems and Applications to Analysis of Computer Systems, Wojciech Szpankowski (86-601)
Instability Conditions Arising in Analysis of Some Multiaccess Protocols, Wojciech Szpankowski and Vernon J. Rego (86-577)
Methods of Factoring Large Integers, Samuel S. Wagstaff Jr and J. W. Smith (86-585)
The Use of Services in the TILDE Environment, Craig E. Wills (86-656)
Submissions from 1985
The Boyer-Moore-Galil String Searching Strategies Revisited, Alberto Apostolicao and Raffaele Giancarlo (85-539)
Remark on Hsu-Du New Algorithm for the LCS Problem, A. Apostolico (85-544)
The Longest Common Subsequence Problem Revisited, A. Apostolico and C. Guerra (85-543)
Improving the Worst Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings, Alberto Apostolico (85-542)
The Myriad Virtues of Subword Trees, Alberto Apostolico (85-540)
Robust Transmission of Unbounded Strings Using Fibonacci Representations, Alberto Apostolico and Aviezri S. Fraenkel (85-545)
Data Structures and Algorithms for the String Statistics Problem, A. Apostolico and F. P. Preparata (85-547)
Structural Properties of the String Statistics Problem, A. Apostolico and F. P. Preparata (85-541)
A Fast Linear Space Algorithm for Computing Longest Common Subsequences, A. Apostolio and C. Guerra (85-546)
On Multidimensional Arrays of Processors, Mikhail J. Atallah (85-528)
Efficient Algorithms for Common Transversals, Mikhail J. Atallah and Chanderjit Bajaj (85-549)
Efficient Parallel Solutions to Some Geometric Problems, Mikhail J. Atallah and Michael T. Goodrich (85-504)
Efficient Plane Sweeping in Parallel, Mikhail J. Atallah and Michael T. Goodrich (85-563)
Solving Tree Problems on a Mesh-Connected Processor Array, Mikhail J. Atallah and Susanne E. Hambrusch (85-518)
Finding a Minimum Independent Dominating Set in a Permutation Graph, Mikhail J. Atallah, Glenn Manacher, and J. Urritia (85-514)
An Efficient Parallel Solution for Euclidean Shortest Paths in Three Dimensions, Chanderjit Bajaj (85-530)
The Algebraic Complexity of Shortest Paths in Polyhedral Spaces, Chanderjit Bajaj (85-523)
Generation of Configuration Space Obstacles I: The Case of A Moving Sphere, Chanderjit Bajaj and Myung-Soo Kim (85-565)
Generalized Unfoldings for Shortest Paths in Euclidean 3-Space, C. Bajaj and T. T. Moh (85-526)
Representing Graph Families with Edge Grammars, Francine Berman and Gregory Shannon (85-517)
Site Recovery in Replicated Distributed Database Systems, Bharat Bhargava (85-564)
Overloading of Names in Distributed Systems, Douglas E. Comer and Ralph E. Droms (85-531)
TILDE Trees in the UNIX Environment, Douglas E. Comer and Ralph E. Droms (85-503)
The TILDE File Naming Scheme, Douglas E. Comer and Thomas P. Murtagh (85-507)
A Distributed Shortest Path Algorithm for a Planar Network, Greg N. Frederickson (85-527)
Electing a Leader in a Synchronous Ring, Greg N. Frederickson and Nancy A. Lynch (85-512)
Fast Parallel Algorithms for Voronoi Diagrams, Micahel T. Goodrich, Colm O'Dunlaing, and Chee Yap (85-538)
An Optimal Parallel Algorithm For the All Nearest -- Neighbor Problem for a Convex Polygon, Michael T. Goodrich (85-533)
Order Statistics and Other Complex Data Operations On Tree-Structured Dictionary Machines, Michael T. Goodrich and Mikhail J. Atallah (85-532)
Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes, Susanne E. Hambrusch (85-506)
Optimal Simulations Between Mesh-Connected Arrays of Processors, S. Rao Kosaraju and Mikhail J. Atallah (85-561)
Some Thoughts on a Uniform Generic Command Interface, Balachander Krishnamurthy (85-513)
Display Oriented Front End Interfaces, Balachander Krishnamurthy, Francie J. Newbery, and Craig E. Wills (85-524)
Structure of a Rigid Smooth Space Curve, Chia-Hoang Lee (85-566)
Structure and Motion of a Rigid Object Having Unknown Constant Motion, Chia-Hoang Lee and Azriel Rosenfeld (85-548)
Multidimensional Timestamp Protocols for Concurrency Control, Pei-Jyun Leu and Bharat Bhargava (85-521)
Fast Detection and Display of Symmetry in Trees, Joseph Manning and Mikhail J. Atallah (85-562)
A Communication Sub-System for MVS/XA, Dan C. Marinescu (85-555)
On the Existence of Analytical Proofs for VLSI Computational Networks, Rami Melhem (85-509)
A Study of Data Interlock in VLSI Computational Networks for Sparse Matrix Multiplication, Rami G. Melhem (85-505)
Eliminating Proofs of Interference-freedom from Levin-Gries CSP Program Proofs, Thomas P. Murtagh (85-525)
A Survey of Program Design Languages (PDLs), Brian A. Nejmeh and Herbert E. Dunsmore (85-510)
Cycle-Time Distributions and Stability of Adaptive Token-Passing Bus Networks, Vernon J. Rego and Herman D. Hughes (85-560)
A Queueing Model for Token-Passing Computer Networks, Vernon J. Rego and Lionel M. Ni (85-559)
Adaptive Tensor Product Grids for Singular Problems, John R. Rice (85-536)
The Aspect Ratio Significant for Finite Element Problems, John R. Rice (85-535)
Using Supercomputers Today and Tomorrow, John R. Rice (85-529)
An Analysis of a Contention Resolution Algorithm --- Another Approach, Wojciech Szpankowski (85-551)