| 1991 | An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. | Stephan Olariu, C. Michael Overstreet, Zhaofang Wen |
| 1991 | On Designing Relational Database Schemes for Efficient Query Processing. | Michio Nakanishi, Yoshiki Katsuyama, Minoru Ito, Akihiro Hashimoto |
| 1991 | A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. | Jean Frdric Myoupo |
| 1991 | Subtree Availability in Binary Tree Architectures. | Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney |
| 1991 | Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information. | Piyush Maheshwari |
| 1991 | Increasing Communication Bandwidth on Hypercube. | Zhiyong Liu, Jia-Huai You |
| 1991 | A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. | Rong Lin, Stephan Olariu |
| 1991 | Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. | Christos Levcopoulos, Andrzej Lingas |
| 1991 | Partial Document Ranking by Heuristic Methods. | Dik Lun Lee, Wai Yee Peter Wong |
| 1991 | A Relationship Between Self-Organizing Lists and Binary Search Trees. | Tony W. Lai, Derick Wood |
| 1991 | A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array. | Danny Krizanc |
| 1991 | Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. | Ali A. Kooshesh, Bernard M. E. Moret |
| 1991 | Practical Parallel Algorithms for Chordal Graphs. | Eric S. Kirsch, Jean R. S. Blair |
| 1991 | Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. | Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas |
| 1991 | On the Quickest Path Problem. | Yung-Chen Hung, Gen-Huey Chen |
| 1991 | Undordered Tree Contraction. | Lih-Hsing Hsu, Jones J. J. Wang |
| 1991 | A Modeling Technique for Generating Causal Explanations of Physical Systems. | Rattikorn Hewett |
| 1991 | Programming a Parallel Sort Using Distributed Procedure Calls. | Daniel Herman, Laurent Trilling |
| 1991 | What's Wrong With Formal Programming Methods? | Eric C. R. Hehner |
| 1991 | Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. | James Haralambides, Fillia Makedon |
| 1991 | On the Power of Query-Independent Compilation. | Jiawei Han |
| 1991 | A Formal Description of the IC | B. Gopinath, Ambuj K. Singh, Prem Uppaluru |
| 1991 | Practical Adaptive Sorting. | Vladimir Estivill-Castro, Derick Wood |
| 1991 | The Mean Value Approach to Performance Evaluation of Time-Stamp Ordering Algorithms. | Mohamed Eltoweissy, Nagwa M. El-Makky, M. Abougabal, Souheir A. Fouad |
| 1991 | Neural Network Processing Elements as a New Generation of "Flip-Flops". | Eugeniusz Eberbach |