Search
Now showing items 1-9 of 9
Locating Faults in a Constant Number of Parallel Testing Rounds (Preliminary Version)
(Department of Computer Science, The Johns Hopkins University, 1989)
Algorithms for Computing the Center of Area of a Convex Polygon
(Department of Computer Science, The Johns Hopkins University, 1988-10-17)
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
(Department of Computer Science, The Johns Hopkins University, 1988)
Some Results on the Computational Complexity of Symmetric Computational Networks
(Department of Computer Science, The Johns Hopkins University, 1989)
Using Certification Trails to Achieve Software Fault Tolerance
(Department of Computer Science, The Johns Hopkins University, 1989)
On the Power of Probabilistic Polynomial Time: (extended abstract)
(Department of Computer Science, The Johns Hopkins University, 1989-06)
A Note on the Computational Complexity of Symmetric Connectionist Networks
(Department of Computer Science, The Johns Hopkins University, 1988-01)
A Study of Dynamic Load Balancing in a Distributed System
(Department of Computer Science, The Johns Hopkins University, 1985)
Efficient Parallel Term Matching
(Department of Computer Science, The Johns Hopkins University, 1988-01)