Publications

Export 7151 results:
Author Title Type [ Year(Asc)]
1991
Grant J, Litwin W, Roussopoulos N, Sellis T.  1991.  An algebra and calculus for relational multidatabase systems. , First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS '91. Proceedings. :118-124.
Cole R, Vishkin U.  1991.  Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation. 92(1):1-47.
Vishkin U.  1991.  Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.
Mount D, Silverman R.  1991.  Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
Reggia JA, Sutton G, Cho S.  1991.  Competitive activation mechanisms in connectionist models. Advances in control networks and large-scale parallel distributed processing models. 1:119-119.
Lavi J, Agrawala AK, Buhr R, Jackson K, Jackson M, Lang B.  1991.  Computer based systems engineering workshop. Software Engineering Education. :149-163.
Cleaveland R, Steffen B.  1991.  Computing behavioural relations, logically. Automata, Languages and Programming. :127-138.
Kao TC, Mount D.  1991.  Computing generalized Voronoi diagrams in improved time and space bounds.
Dorr BJ.  1991.  Conceptual Basis of the Lexicon in Machine Translation. Lexical acquisition: exploiting on-line resources to build a lexiconLexical acquisition: exploiting on-line resources to build a lexicon. :263-263.
Monahemi M, Barlow J, O'Leary DP.  1991.  Considerations on Loop Transfer Recovery for Non-minimum Phase Plants. Proceedings of the AIAA Aircraft Design Systems and Operations MeetingProceedings of the AIAA Aircraft Design Systems and Operations Meeting. AIAA-91-3086
Matias Y, Vishkin U.  1991.  Converting high probability into nearly-constant time—with applications to parallel hashing. Proceedings of the twenty-third annual ACM symposium on Theory of computing. :307-316.
Darling JP, Mayergoyz ID.  1991.  Data parallel algorithms for the numerical modeling of semiconductor devices. Proceedings of the 5th SIAM Conference on Parallel Processing for Scientific Computing. :394-400.
Kraus S, Nirkhe M, Perlis D.  1991.  Deadline-coupled real-time planning. Innovative approaches to planning, scheduling and control: proceedings of a Workshop [on Innovative Approaches to Planning, Scheduling, and Control], held at San Diego, California, November 5-8, 1991. :100-100.
Myers BA, Cypher A, Maulsby D, Smith DC, Shneiderman B.  1991.  Demonstrational interfaces: Coming soon? Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology. :393-396.
Mount D.  1991.  The densest double-lattice packing of a convex polygon. Discrete and Computational Geometry: Papers from the DIMACS Special Year. 6:245-262.
Monahemi M, Barlow J, O'Leary DP.  1991.  The Design of Reduced Order Luenberger Observers with Precise LTR. Proceedings of the AIAA Meeting on Guidance, Navigation and ControlProceedings of the AIAA Meeting on Guidance, Navigation and Control. AIAA-91-2731
Sanghi D, Agrawala AK.  1991.  DTP: An Efficient Transport Protocol. In Proceedings of the IFIP TC6 Working Conference on ComACM Computing Surveys. :91-133.
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.
Mahesh R, Rangan C.P, Srinivasan A.  1991.  On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2):218-224.
Nirkhe M, Kraus S, Perlis D.  1991.  Fully deadline-coupled planning: One step at a time. Methodologies for Intelligent Systems. :589-599.
Stallmann M, Cleaveland R, Hebbar P.  1991.  Gdr: A visualization tool for graph algorithms.
Sears A, Shneiderman B.  1991.  High precision touchscreens: design strategies and comparisons with a mouse. International Journal of Man-Machine Studies. 34(4):593-613.

Pages