Publications

1992

Pugh W, Wonnacott D. 1992. Eliminating false data dependences using the Omega test. Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation. :140-151.

Varshney A, Prins JF. 1992. An environment projection approach to radiosity for meshconnected computers. Third Eurographics Workshop on Rendering. :271-281.

Delis A, Raschid L, Sellis T. 1992. Experiments on the concurrent rule execution in database systems. Tools with Artificial Intelligence, 1992. TAI'92, Proceedings., Fourth International Conference on. :405-412.

Herve J-Y, Aloimonos Y. 1992. Exploratory active vision: theory. Proceedings of 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1992. :10-15.

1991

Shneiderman B, Kreitzberg C, Berk E. 1991. Editing to structure a reader's experience. Hypertext/hypermedia handbookHypertext/hypermedia handbook. :143-164.

Srinivasan A, Pandu Rangan C. 1991. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.

Zweben S, Curtis B, Shneiderman B. 1991. ESP'91 Panel on The Best of ESP. Empirical studies of programmers: fourth workshop. :1-1.

Tuhrim S, Reggia JA, Goodall S. 1991. An experimental study of criteria for hypothesis plausibility. Journal of Experimental & Theoretical Artificial Intelligence. 3(2):129-144.

1990

Ryu KW, JaJa JF. 1990. Efficient algorithms for list ranking and for solving graph problems on the hypercube. Parallel and Distributed Systems, IEEE Transactions on. 1(1):83-90.

Sellis TK, Roussopoulos N, Ng RT. 1990. Efficient compilation of large rule bases using logical access paths. Information Systems. 15(1):73-84.

Krishnamurthy S, JaJa JF. 1990. An efficient parallel algorithm for channel routing. Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings., 1990 IEEE International Conference on. :400-403.

Porter A, Selby RW. 1990. Empirically guided software development using metric-based classification trees. IEEE Software. 7(2):46-54.

Ehrlich K, Microsytems S, Marchionini G, Nielsen J, Shneiderman B. 1990. EVALUATING HYPERMEDIA SYSTEMS. Human factors in computing systems: CHI'90 Conference proceedings, April 1-5, Seattle. :387-387.

Porter A, Selby RW. 1990. Evaluating techniques for generating metric-based classification trees. Journal of Systems and Software. 12(3):209-218.

Cardenas S, Zelkowitz MV. 1990. Evaluation criteria for functional specifications. Proceedings of the 12th international conference on Software engineering. :26-33.

Furnier GR, Cummings MP, Clegg MT. 1990. Evolution of avocados as revealed by DNA restriction fragment variation. J Hered. 81(3):183-188.

Jones T, Shneiderman B. 1990. Examining usability for a training-oriented hypertext: Can hyper-activity be good? Electronic Publishing. 3(4):207-225.

Khuller S. 1990. Extending planar graph algorithms to K3,3-free graphs. Information and Computation. 84(1):13-25.

1989

Khuller S, Schieber B. 1989. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. Foundations of Computer Science, 1989., 30th Annual Symposium on. :288-293.

JaJa JF, Ryu KW. 1989. Efficient Techniques for Routing and for Solving Graph Problems on the Hypercube.

Zelkowitz MV, Kowalchack B, Itkin D, Herman L. 1989. Experiences building a syntax-directed editor. Software Engineering Journal. 4(6):294-294.

Potter R, Berman M, Shneiderman B. 1989. An experimental evaluation of three touch screen strategies within a hypertext database. International Journal of Human-Computer Interaction. 1(1):41-52.

Gordon D, Perlis D. 1989. Explicitly biased generalization. Computational Intelligence. 5(2):67-81.

1988

Shneiderman B, Carroll JM. 1988. Ecological studies of professional programmers. Commun. ACM. 31(11):1256-1258.

Ramachandran V, Vishkin U. 1988. Efficient parallel triconnectivity in logarithmic time. VLSI Algorithms and Architectures. :33-42.

Pages

Publications