Publications

Export 337 results:
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is T  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
T
Perlis D.  2006.  Theory and Application of Self-Reference: Logic and Beyond. Self-reference. 178:121-121.
Rivlin E, Doermann D, Rosenfeld A.  1996.  A Theory of Document Functionality. Proceedings in FLAIRS. :429-433.
Bernardo M, Cleaveland R.  1999.  A Theory of Efficiency for Markovian Processes. University of Bologna.
Cleaveland R, Zwarico AE.  1991.  A theory of testing for real-time. , Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS '91. :110-119.
Stewart G.W.  1995.  Theory of the Combination of Observations Least Subject to Errors. SIAM, Philadelphia.[Translation of Gauss (1821, 1823, 1826).].
Foster JS, Fähndrich M, Aiken A.  1999.  A theory of type qualifiers. ACM SIGPLAN Notices. 34:192-203.
Swamy N, Hicks MW, Bierman GM.  2009.  A theory of typed coercions and its applications. Proceedings of the 14th ACM SIGPLAN international conference on Functional programming. :329-340.
Lathan C, Vice J M, Tracey M, Plaisant C, Druin A, Edward K, Montemayor J.  2001.  Therapeutic play with a storytelling robot. CHI '01 extended abstracts on Human factors in computing systems. :27-28.
Piatetsky-Shapiro G, Grossman R, Djeraba C, Feldman R, Getoor L, Zaki M.  2006.  Is there a grand challenge or X-prize for data mining? Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. :954-956.
Perlis D.  1990.  Thing and Thought. Knowledge Representation and Defeasible Reasoning. Kluwer.
Vishkin U.  2007.  Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
Nirkhe M, Kraus S, Perlis D.  1995.  Thinking takes time: a modal active-logic for reasoning in time. Proc. of BISFAI-95.
Zelkowitz MV.  1975.  Third generation compiler design. Proceedings of the 1975 annual conference. :253-258.
Abd-Almageed W, Blace RE, Eltoweissy M.  2011.  Threat-Aware Clustering in Wireless Sensor Networks. IFIP Advances in Information and Communication Technology (AICT). 264(264):1-12.
Seydou F, Duraiswami R, Seppanen T.  2003.  Three dimensional acoustic scattering from an M multilayered domain via an integral equation approach. Antennas and Propagation Society International Symposium, 2003. IEEE. 1:669-672vol.1-669-672vol.1.
Ward NL, Challacombe JF, Janssen PH, Henrissat B, Coutinho PM, Wu M, Xie G, Haft DH, Sait M, Badger J et al..  2009.  Three genomes from the phylum Acidobacteria provide insight into the lifestyles of these microorganisms in soils.. Appl Environ Microbiol. 75(7):2046-56.
Kerr DC, Goldsman N, Mayergoyz ID.  1998.  Three-Dimensional Hydrodynamic Modeling of MOSFET Devices. VLSI Design. 6(1-4):261-265.
Madabhushi R, Korman CE, Mayergoyz ID.  1996.  A three-dimensional MOSFET solver implementing the fixed point iteration technique. Solid-State Electronics. 39(1):147-157.
Kundu K, Sessions C, desJardins M, Rheingans P.  2002.  Three-dimensional visualization of hierarchical task network plans. In Proceedings of the 3rd International NASA Workshop on Planning and Scheduling for.
Katz J, Yung M.  2002.  Threshold cryptosystems based on factoring. Advances in Cryptology—ASIACRYPT 2002. :139-147.
Mundur P, Sood A, Simon R.  1998.  Threshold-based admission control for multi-class video-on-demand systems. Performance, Computing and Communications, 1998. IPCCC '98., IEEE International. :154-160.
Karlson AK, Bederson BB.  2007.  Thumbspace: Generalized one-handed input for touchscreen-based mobile devices. Proceedings of the 11th IFIP TC 13 international conference on Human-computer interaction. :324-338.
Feamster N, Balazinska M, Wang W, Balakrishnan H, Karger D.  2003.  Thwarting Web Censorship with Untrusted Messenger Discovery. Privacy Enhancing TechnologiesPrivacy Enhancing Technologies. 2760:125-140.
Azar Y, Vishkin U.  1987.  Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
Alon N, Azar Y, Vishkin U.  1986.  Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.

Pages