Publications

Export 326 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is P  [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 
P
Putt ME, Hannenhalli S, Lu Y, Haines P, Chandrupatla HR, Morrisey EE, Margulies KB, Cappola TP.  2009.  Evidence for Coregulation of Myocardial Gene Expression by MEF2 and NFAT in Human Heart Failure / CLINICAL PERSPECTIVE. Circulation: Cardiovascular Genetics. 2(3):212-219.
Puthenpurayil S, Gu R, Bhattacharyya SS.  2007.  Energy-aware data compression for wireless sensor networks. Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on. 2:II–45-II–45.
Puthenpurayil S, Gu R, Bhattacharyya SS.  2006.  Compression techniques for minimum energy consumption. 25th Army Science Conference.
Purdy AE, Balch D, Lizárraga‐Partida M L, Islam M S, Martinez‐Urtaza J, Huq A, Colwell RR, Bartlett DH.  2010.  Diversity and distribution of cholix toxin, a novel ADP‐ribosylating factor from Vibrio cholerae. Environmental Microbiology Reports. 2(1):198-207.
Purang K, Purushothaman D, Traum D, Andersen C, Perlis D.  1999.  Practical reasoning and plan execution with active logic. Proceedings of the IJCAI-99 Workshop on Practical Reasoning and Rationality. :30-38.
Purang K, Traum D, Purushothaman D, Chong W, Okamato Y, Perlis D.  2000.  Meta-reasoning for intelligent dialog repair.
Punch WF, Rand W.  2000.  GP+ echo+ subsumption= improved problem solving. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000). :411-418.
Pujara J, Daumé H, Getoor L.  2011.  Using classifier cascades for scalable e-mail classification. Collaboration, Electronic Messaging, Anti-Abuse and Spam Conference, ACM International Conference Proceedings Series.
Pugliese A, Udrea O, V.S. Subrahmanian.  2008.  Scaling RDF with Time. Proceedings of the 17th international conference on World Wide Web. :605-614.
Pugh W, Teitelbaum T.  1989.  Incremental computation via function caching. Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. :315-328.
Pugh W.  1999.  Fixing the Java memory model. Proceedings of the ACM 1999 conference on Java Grande. :89-98.
Pugh W.  1991.  Uniform techniques for loop optimization. Proceedings of the 5th international conference on Supercomputing. :341-352.
Pugh W.  1988.  An improved replacement strategy for function caching. Proceedings of the 1988 ACM conference on LISP and functional programming - LFP '88. :269-276.
Pugh W.  1992.  The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM. 8(102-114):2-6.
Pugh W.  1992.  Definitions of dependence distance. ACM Letters on Programming Languages and SystemsACM Lett. Program. Lang. Syst.. 1(3):261-265.
Pugh W.  1999.  Compressing Java class files. ACM SIGPLAN Notices. 34:247-258.
Pugh W.  2000.  The Java memory model is fatally flawed. Concurrency - Practice and Experience. 12(6):445-455.
Pugh W.  1990.  Skip lists: a probabilistic alternative to balanced trees. Communications of the ACMCommun. ACM. 33(6):668-676.
Pugh W, Wonnacott D.  1995.  Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Transactions on Parallel and Distributed Systems. 6(2):204-211.
Pugh W, Wonnacott D.  1998.  Constraint-based array dependence analysis. ACM Transactions on Programming Languages and SystemsACM Trans. Program. Lang. Syst.. 20(3):635-678.
Pugh W, Spacco J.  2004.  Mpjava: High-performance message passing in java using java. nio. Languages and Compilers for Parallel Computing. :323-339.
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.
Pugh W, Kelly W.  1995.  Finding Legal Reordering Transformations using Mappings. Languages and compilers for parallel computing: 7th International Workshop, Ithaca, NY, USA, August 8-10, 1994: proceedings. 7:107-107.
Pugh W.  1994.  Counting solutions to Presburger formulas: how and why. ACM SIGPLAN Notices. 29(6):121-134.
Pugh W, Shpeisman T.  1999.  SIPR: A new framework for generating efficient code for sparse matrix computations. Languages and Compilers for Parallel Computing. :213-229.

Pages