Publications
1995. On a Technique for Parsing a String (Invited Lecture). Lecture Notes in Computer Science. 937:386-386.
1995. Techniques for performance measurement of parallel programs. Parallel computers: theory and practice. :225-240.
1995. Theory of the Combination of Observations Least Subject to Errors. SIAM, Philadelphia.[Translation of Gauss (1821, 1823, 1826).].
1995. Towards a computational theory of genome rearrangements. Computer Science TodayComputer Science Today. 1000:184-202.
1995. Tracking and recognizing rigid and non-rigid facial motions using local parametric models of image motion. Computer Vision, 1995. Proceedings., Fifth International Conference on. :374-381.
1995. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :178-189.
1995. Transforming men into mice (polynomial algorithm for genomic distance problem). Foundations of Computer Science, Annual IEEE Symposium on. :581-581.
1995. A unifying framework for iteration reordering transformations. Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on. 1:153-162.
1995. Use of linear algebra kernels to build an efficient finite element solver. Parallel Computing. 21(1):161-173.
1995. Using information content to evaluate semantic similarity in a taxonomy. Arxiv preprint cmp-lg/9511007.
1995. Using synthetic perturbations and statistical screening to assay shared-memory programs. Information processing letters. 54(3):147-153.
1995. Using Treemaps to Visualize the Analytic Hierarchy Process. Information Systems ResearchInformation Systems Research. 6(4):357-375.
1995. Vision, Graphic Design, and Visual Display. Readings in human-computer interaction: toward the year 2000. :411-411.
1995. Visual decision-making: using treemaps for the analytic hierarchy process. Conference companion on Human factors in computing systems. :405-406.
1995. Voxel based object simplification. Proceedings of the 6th conference on Visualization '95. :296–-296–.
1995. What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses. Proceedings of the Second International Workshop on Markov ChainsProceedings of the Second International Workshop on Markov Chains. :151-161.
1995. Why Broyden's Nonsymmetric Method Terminates on Linear Equations. SIAM Journal on Optimization. 5:231-235.
1994. Adaptation of noncompetitive and competitive neural networks to focal lesions. Journal of Artificial Neural Networks. 1:51-60.