- Eric C. R. Hehner:
What's Wrong With Formal Programming Methods? ICCI 1991: 2-23 - Daniel Herman, Laurent Trilling:
Programming a Parallel Sort Using Distributed Procedure Calls. ICCI 1991: 415-417 - Rattikorn Hewett:
A Modeling Technique for Generating Causal Explanations of Physical Systems. ICCI 1991: 657-668 - Lih-Hsing Hsu, Jones J. J. Wang:
Undordered Tree Contraction. ICCI 1991: 347-349 - Yung-Chen Hung, Gen-Huey Chen:
On the Quickest Path Problem. ICCI 1991: 44-46 - Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas:
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. ICCI 1991: 582-587 - Eric S. Kirsch, Jean R. S. Blair:
Practical Parallel Algorithms for Chordal Graphs. ICCI 1991: 372-382 - Ali A. Kooshesh, Bernard M. E. Moret:
Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. ICCI 1991: 102-110 - Danny Krizanc:
A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array. ICCI 1991: 418-420 - Tony W. Lai, Derick Wood:
A Relationship Between Self-Organizing Lists and Binary Search Trees. ICCI 1991: 111-116 - Dik Lun Lee, Wai Yee Peter Wong:
Partial Document Ranking by Heuristic Methods. ICCI 1991: 231-239 - Christos Levcopoulos, Andrzej Lingas:
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148 - Rong Lin, Stephan Olariu:
A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. ICCI 1991: 455-461 - Zhiyong Liu, Jia-Huai You:
Increasing Communication Bandwidth on Hypercube. ICCI 1991: 403-414 - Piyush Maheshwari:
Partitioning and Scheduling of Parallel Functional Programs Using Complexity Information. ICCI 1991: 300-311 - Ravi Mittal, Bijendra N. Jain, Rakesh K. Patney:
Subtree Availability in Binary Tree Architectures. ICCI 1991: 312-322 - Jean Frédéric Myoupo:
A Fully-Pipelined Solutions Constructor for Dynamic Programming Problems. ICCI 1991: 421-430 - Michio Nakanishi, Yoshiki Katsuyama, Minoru Ito, Akihiro Hashimoto:
On Designing Relational Database Schemes for Efficient Query Processing. ICCI 1991: 264-275 - Stephan Olariu, C. Michael Overstreet, Zhaofang Wen:
An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. ICCI 1991: 484-495 - Aris M. Ouksel, Anan Yaagoub:
The Interpolation-Based Bintree and its Application to Graphics. ICCI 1991: 78-89 - Robert L. Probert:
Computer Science and Communications Protocols: Research Relationships. ICCI 1991: 24-32 - Ke Qiu, Henk Meijer, Selim G. Akl:
Parallel Routing and Sorting of the Pancake Network. ICCI 1991: 360-371 - Rajeev Raman:
Generating Random Graphs Efficiently. ICCI 1991: 149-160 - Satyendra P. Rana:
An Efficient Algorithm for Quiescence Detection in a Distributed System. ICCI 1991: 532-534 - Michel Raynal:
A Distributed Solution to the k-out of-M Resources Allocation Problem. ICCI 1991: 599-609 - Ivan Rival, Siming Zhan:
Linear Extensions with Backtracking. ICCI 1991: 161-168 - J. Ben Rosen, Guoliang Xue:
Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem. ICCI 1991: 471-473 - Stephen J. Smith:
Reaping the Benefits of Mass Production with Massively Parallel Computing - Four Example Applications. ICCI 1991: 33-42 - Pradip K. Srimani:
Generalized Fault Tolerance Properties of Star Graphs. ICCI 1991: 510-519 - V. Sundararajan, Hitesh N. Dholakia, N. Parameswaran:
An RMS for Temporal Reasoning with Abstraction. ICCI 1991: 733-744