Publications
Export 1435 results:
Author Title [ Type] Year Filters: First Letter Of Last Name is K [Clear All Filters]
1998. Providing Advisory Notices for UNIX Command Users: Design, Implementation, and Empirical Evaluations. Technical Reports of the Computer Science Department.
2007. Provable algorithms for joint optimization of transport, routing and MAC layers in wireless ad hoc networks. Proc. DialM-POMC Workshop on Foundations of Mobile Computing.
2009. Protein quantification across hundreds of experimental conditions. Proceedings of the National Academy of Sciences. 106(37):15544-15548.
2009. Protein quantification across hundreds of experimental conditions. Proceedings of the National Academy of Sciences. 106(37):15544-15548.
2009. Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
2009. Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
1992. Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
2002. Processing large-scale multi-dimensional data in parallel and distributed environments. Parallel Computing. 28(5):827-859.
2006. Processing approximate aggregate queries in wireless sensor networks. Information Systems. 31(8):770-792.
2003. Probabilistic recognition of human faces from video. Computer Vision and Image Understanding. 91(1–2):214-245.
2001. Probabilistic models of text and link structure for hypertext classification. IJCAI workshop on text learning: beyond supervision. :24-29.
2009. Probabilistic graphical models. IEEE transactions on pattern analysis and machine intelligence. 31(10):1775-1789.
2011. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? 19th Network and Distributed Security Symposium.
2007. Principles for designing data-/compute-intensive distributed applications and middleware systems for heterogeneous environments. Journal of Parallel and Distributed Computing. 67(7):755-771.
1986. Principles and techniques in the design of ADMS+((advanced data-base management system)). Computer. 19:19-23.
2013. Primate Transcript and Protein Expression Levels Evolve Under Compensatory Selection Pressures. Science. 342(6162):1100-1104.
1994. A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
2004. Preserving distributed systems critical properties: a model-driven approach. Software, IEEE. 21(6):32-40.
2009. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics. 25(13):1609-1616.
2009. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics. 25(13):1609-1616.
2010. The power of protein interaction networks for associating genes with diseases. Bioinformatics. 26(8):1057-1057.
1991. Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.