Publications
1991. Human values and the future of technology: a declaration of responsibility. ACM SIGCHI Bulletin. 23(1):11-16.
1991. Identifying aggregates in hypertext structures. Proceedings of the third annual ACM conference on Hypertext. :63-74.
1991. Incremental implementation model for relational databases with transaction time. IEEE Transactions on Knowledge and Data Engineering. 3(4):461-473.
1991. The integration of application and system based metrics in a parallel program performance tool. ACM Sigplan Notices. 26:189-200.
1991. Iterative methods for cyclically reduced non-self-adjoint linear systems II. Math. Comp. 56(193):215-242.
1991. Machine translation: A principle-based approach. Artificial intelligence at MIT expanding frontiers. :326-361.
1991. A management tool for evaluation of software design. Software Engineering, IEEE Transactions on. 17(9):961-971.
1991. Memory, reason and time: the Step-Logic approach. Philosophy and AI: Essays at the Interface. :79-103.
1991. Metric-driven analysis and feedback systems for enabling empirically guided software development. Proceedings of the 13th international conference on Software engineering. :288-298.
1991. Model group indexing for recognition. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :4-9.
1991. A multi-frame approach to visual motion perception. International Journal of Computer Vision. 6(3):245-255.
1991. Optimal matching of planar models in 3D scenes. Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on. :269-274.
1991. An overview of Hyperties, its user interface and data model. Hypermedia/Hypertext And Object-Oriented Databases. Chapman & Hall. :17-31.
1991. Parallel Algorithms for Channel Routing in the Knock-Knee Model. SIAM Journal on Computing. 20(2):228-245.
1991. Parallel transitive closure computations using topological sort. , Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991. :122-129.
1991. A pipeline N-way join algorithm based on the 2-way semijoin program. IEEE Transactions on Knowledge and Data Engineering. 3(4):486-495.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.