Salim Hariri, P. Bruce Berra (Eds.): Proceedings of the 1993 International Conference on Parallel Processing, August 16-20, 1993, Syracuse University, NY, USA. Volume III: Algorithms & Applications. CRC Press, ISBN 0-8493-8986-0

Numerical Algorithms

• 
  Efstathios D. Kyriakis-Bitzaros, Odysseas G. Koufopavlou, Constantinos E. Goutis: Space-Time Representation of Iterative Algorithms and The Design of Regular Processor Arrays. 2-9
• 
  Xian-He Sun: On the Parallel Diagonal Dominant Algorithm. 10-17
• 
  Kalluri Eswar, P. Sadayappan, Chua-Huang Huang, V. Visvanathan: Supernodal Sparse Cholesky Facotrization on Distributed-Memory Multiprocessors. 18-22
• 
  Akhilesh Kumar, Laxmi N. Bhuyan: Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors. 23-27

Parallel Algorithms

• 
  Thomas J. Sheffler, Randal E. Bryant: An Analysis of Hashing on Parallel and Vector Computers. 29-36
• 
  Mu-Cheng Wang, Wayne G. Nation, James B. Armstrong, Howard Jay Siegel, Shin-Dug Kim, Mark A. Nichols, Michael Gherrity: Multiple Quadratic Forms: A Case Study in the Design of Scalable Algorithms. 37-46
• 
  Erik G. Hoel, Hanan Samet: Data-Parallel R-Tree Algorithms. 47-50
• 
  Amir Fijany: Time Parallel Algorihts for Solution of Linear Parabolic PDEs. 51-55

Graph Algorithms (I)

• 
  Tzong-Wann Kao, Shi-Jinn Horng, Horng-Ren Tsai: Computing Connected Components and Some Related Applications on a RAP. 57-64
• 
  Khaled Day, Anand R. Tripathi: Embedding Grids, Hypercubes, and Trees in Arrangement Graphs. 65-72
• 
  Shou-Hsuan Stephen Huang, Hongfei Liu, Rakesh M. Verma: On Embeddings of Rectangles into Optimal Squares. 73-76
• 
  Oscar H. Ibarra, Qi Zheng: Finding Articulation Points and Bridges of Permutation Graphs. 77-80

Image Processing

• 
  David W. N. Sharp, R. Lyndon While: Pattern Recognition Using Fractals. 82-89
• 
  David R. Helman, Joseph JáJá: Efficient Image Processing Algorithms on the Scan Line Array Processor. 90-93
• 
  S. K. Nandy, Ranjani Narayan, V. Visvanathan, P. Sadayappan, Prashant S. Chauhan: A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array. 94-97
• 
  Hongchi Shi, Gerhard X. Ritter: O(n)-Time and O(log n)-Space Image Component Labeling with Local Operators on SIMD Mesh Connected Computers. 98-101
• 
  Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. Shankar: Solving the Region Growing Problem on the Connection Machine. 102-105

Numerical Analysis

• 
  Wen-Yang Lin, Chuen-Liang Chen: Minimum Completion Time Criterion for Parallel Sparse Cholesky Factorization. 107-114
• 
  Anshul Gupta, Vipin Kumar: Scalability of Parallel Algorithms for Matrix Multiplication. 115-123
• 
  Lujuan Chen, E. V. Krishnamurthy, Iain MacLeod: Generalised Matrix Inversion by Successive Matrix Squaring. 124-127
• 
  Bing Bing Zhou, Richard P. Brent: Parallel Computation of the Singular Value Decomposition on Tree Architectures. 128-131

Fault-Tolerance

• 
  Amber Roy-Chowdhury, Prithviraj Banerjee: A Fault-Tolerant Parallel Algorithm for Iterative Solution of the Laplace Equation. 133-140
• 
  José Salinas, Fabrizio Lombardi: Emulating Reconfigurable Arrays for Image Processing Using the MasPar Architecture. 141-148
• 
  Yu-Chee Tseng, Ten-Hwang Lai: Ring Embedding in an Injured Hypercube. 149-152
• 
  Chao Feng, Laxmi N. Bhuyan, Fabrizio Lombardi: An Adaptive System-Level Diagnosis Approach for Mesh Connected Multiprocessors. 153-157

Routing Algorithms

• 
  Ching-Yi Lee, A. Yavuz Oruç: Fast Parallle Algorithms for Routing One-To-One Assignments in Benes Networks. 159-166
• 
  Guoping Liu, Kyungsook Y. Lee: Optimal Routing Algorithms for Generalized de Bruijn Digraphs. 167-174
• 
  Younes M. Boura, Chita R. Das: A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes. 175-182

Sorting/Searching

• 
  Yen-Chun Lin, Horng-Yi Lai: Generation of Long Sorted Runs on a Unidirectional Array. 184-191
• 
  Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson, Jingyuan Zhang: Time- and VLSI-Optimal Sorting on Meshes with Multiple Broadcasting. 192-195
• 
  Laxmikant V. Kalé, Sanjeev Krishnan: A Comparison Based Parallel Sorting Algorithm. 196-200
• 
  David T. Blackston, Abhiram G. Ranade: SnakeSort: A Family of Simle Optimal Randomized Sorting Algorithms. 201-204
• 
  Zhaofang Wen: Merging Multiple Lists in O(log n) Time. 205-208
• 
  Majed Z. Al-Hajery, Kenneth E. Batcher: On the Bit-Level Complexity of Bitonic Sorting Networks. 209-213

Graph Algorithms (II)

• 
  Hwang-Cheng Wang, Kai Hwang: Multicoloring for Fast Sparse Matrix-Vector Multiplication in Solving PDE Problems. 215-222
• 
  Yijie Han, Yoshihide Igarashi: Efficient Parallel Shortest Path Algorithms for Banded Matrices. 223-226
• 
  Wei-Ming Lin, Zhenhong Lu: Parallel Implementations of a Scalable Consistent Labeling Technique on Distributed Memory Multi-Processor Systems. 227-230
• 
  Pradip K. Srimani: Maximally Fault Tolerant Directed Network Graph With Sublogarithmic Diameter For Arbitrary Number of Nodes. 231-234

Reconfigurable Architecture and Database Applications

• 
  Heonchul Park, Viktor K. Prasanna, Ju-wook Jang: Fast Arithmetic on Reconfigurable Meshes. 236-243
• 
  Chittur Subbaraman, Jerry L. Trahan, Ramachandran Vaidyanathan: List Ranking and Graph Algorithms on the Reconfigurable Multiple Bus Machine. 244-247
• 
  Gene Saghi, Howard Jay Siegel, José A. B. Fortes: On the Practical Application of a Quantitative Model of System Reconfiguration Due to a Fault. 248-252
• 
  Arun N. Swami, Honesty C. Young: Online Algorithms for Handling Skew in Parallel Joins. 253-257
• 
  Abdelkader Hameurlain, Franck Morvan: A Parallel Scheduling Method for Efficient Query Processing. 258-262

Resource Allocation and Fault Tolerance

• 
  Pankaj Mehra, Benjamin W. Wah: Automated Learning of Workload Measures for Load Balancing on a Distributed System. 263-270
• 
  John D. Evans, Robert R. Kessler: Allocation of Parallel Programs With Time Variant Resource Requirements. 271-275
• 
  J. Bartlett Sinclair, J. Tang, Peter J. Varman, Balakrishna R. Iyer: Impact of Data Placement on Parallel I/O Systems. 276-279
• 
  C. S. Raghavendra, M. A. Sridhar, S. Harikumar: Prefix Computation On a Faulty Hypercube. 280-283
• 
  Teresa A. Dahlberg, Dharma P. Agrawal: Task Based Reliability for Large Systems: A Hierarchical Modeling Approach. 284-287

Simulation/Optimization

• 
  Gregory D. Peterson, Roger D. Chamberlain: Performance of a Globally-Clocked Parallel Simulator. 289-298
• 
  Christine Eisenbeis, Olivier Temam, Harry A. G. Wijshoff: Fast Enumeration of Solutions for Data Dependence Analysis and Data Locality Optimization. 299-306
• 
  Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, Rong Lin, James L. Schwing, Jingyuan Zhang: Square Meshes Are Not Optimal For Convex Hull Computation. 307-310
• 
  Kemal Efe: Embedding Large Mesh of Trees and Related Networks in the Hypercube With Load Balancing. 311-315