Computing in the 90's

Computational complexity of geometric symmetry detection in graphs.- Low dimensional middle cubes are Hamiltonian.- Approximation algorithms for the chromatic sum.- A color-exchange algorithm for exact graph coloring.- S-distance in trees.- Algorithms on block-complete graphs.- Heuristic-based learning.- A template-based approach for recognition of intermittent sounds.- A mathematical model of uncertain information.- A word to phoneme translator.- Performance evaluation of medical expert systems.- Spelling correction for an intelligent tutoring system.- An informational network for a natural talking system.- Formation of categories in document classification systems.- An expert system for creativity management.- A more flexible method for recognizing signals using back propagation: Piecewise linear regression vectors.- A cooperative algorithm for the dynamic stereo problem.- Design of hierarchical classifiers.- Designing and implementing parallel constructs.- Performance of parallel consistency algorithms.- Delay analysis of the N-cube network.- A note on Conway's parallel sorting algorithm.- Visualization of program performance on concurrent computers.- Minimum odd neighbourhood covers for trees.- Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm.- Dendrograms and irreducible prefix codes.- Massively parallel implementations of adaptively subdividing fractal generating algorithms with parameter extensions.- A simple and powerful representation of binary search trees.- Random permutations from logarithmic signatures.- Novel design techniques for RNS systolic VLSI arrays.- A compound decision theory approach to digital signal reconstruction.- Real-time parameter control in space vehicles: A parallel architecture and the protocols.- A microinstruction based procedure to diagnose hardware failures in industrial robots.- A specification and verification tool for communication protocols.- Structured on-line directory and