## 1991 ACM Computer Science Conference: March 5-7, 1991, San Antonio Convention Center, San Antonio, Texas : Proceedings : Preparing for the 21st Century, Volume 19 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PARALLEL ALGORITHMS | 1 |

Massively Parallel Hash Algorithms and Performance | 21 |

GRAPH THEORY | 29 |

Copyright | |

58 other sections not shown

### Common terms and phrases

abstraction ACM copyright notice algorithm allocation and/or specific permission application architecture array attribute grammars attributes binary tree cache called case-based reasoning complex objects components Computer Science concurrency condition constraint logic programming constraints copy without fee data structures defined definition denote direct commercial advantage domain indices domain sets dynamic object edge elements Engineering entailment logic evaluation example execution fee and/or specific function given that copying graph hash hash table IEEE implementation initial input integer interval iteration join indices literate programming material implication mathematical logic method module NNF models NNF relations node object-oriented operations optimal packets parallel partial evaluator performance predicate problem Proc processor programming language prototyping query queues reasoning recursive relational algebra representation represented retrieval routing rule Section semantics sequence simulation solving step systolic array temporal Theorem tion transitive closure tuple update user interface values variables vector