Publications

Export 480 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title 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 
K
Katz J.  2010.  Public-Key Cryptography. Handbook of Information and Communication Security. :21-34.
Katz J, Sahai A, Waters B.  2008.  Predicate encryption supporting disjunctions, polynomial equations, and inner products. Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology. :146-162.
Khan Z, Bloom JS, Garcia BA, Singh M, Kruglyak L.  2009.  Protein quantification across hundreds of experimental conditions. Proceedings of the National Academy of Sciences. 106(37):15544-15548.
Khan Z, Ford MJ, Cusanovich DA, Mitrano A, Pritchard JK, Gilad Y.  2013.  Primate Transcript and Protein Expression Levels Evolve Under Compensatory Selection Pressures. Science. 342(6162):1100-1104.
Khan Z, Bloom JS, Kruglyak L, Singh M.  2009.  A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Bioinformatics. 25(13):1609-1616.
Khella A, Bederson BB.  2004.  Pocket PhotoMesa: a Zoomable image browser for PDAs. Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia. :19-24.
Khoo Y P, Foster JS, Hicks MW, Sazawal V.  2008.  Path projection for user-centered static analysis tools. Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. :57-63.
Khuller S, Vishkin U, Young N.  1994.  A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal Algorithms. 17(2):280-289.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Khuller S, Vishkin U.  1994.  On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
Kilmer ME, O'Leary DP.  1999.  Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems. SIAM Journal on Scientific Computing. 21:88-110.
Kim K, Chalidabhongse TH, Harwood D, Davis LS.  2006.  PDR: A Performance Evaluation Method for Foreground-Background Segmentation Algorithms. EURASIP Journal on Applied Signal Processing.
Kim J-S, Andrade H, Sussman A.  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.
Kim Y, Varshney A.  2008.  Persuading Visual Attention through Geometry. Visualization and Computer Graphics, IEEE Transactions on. 14(4):772-782.
Ko M-Y, Zissulescu C, Puthenpurayil S, Bhattacharyya SS, Kienhuis B, Deprettere EF.  2007.  Parameterized Looped Schedules for Compact Representation of Execution Sequences in DSP Hardware and Software Implementation. IEEE Transactions on Signal Processing. 55(6):3126-3138.
Kraus S, V.S. Subrahmanian, Tas NC.  2003.  Probabilistically survivable mass. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 18:789-795.
Krishnamurthy S, Sanders WH, Cukier M.  2002.  Performance evaluation of a QoS-aware framework for providing tunable consistency and timeliness. :214-223.
Krishnamurthy S, Sanders WH, Cukier M.  2002.  Performance evaluation of a probabilistic replica selection algorithm. :119-127.
Kuah B-T, Shneiderman B.  1998.  Providing Advisory Notices for UNIX Command Users: Design, Implementation, and Empirical Evaluations. Technical Reports of the Computer Science Department.
Kumar VSA, Marathe MV, Parthasarathy S, Srinivasan A.  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.
Kurkulos M, Weinberg JM, Roy D, Mount SM.  1994.  P element-mediated in vivo deletion analysis of white-apricot: deletions between direct repeats are strongly favored.. GeneticsGenetics. 136(3):1001-1011.
Kurkulos M, Weinberg JM, Pepling ME, Mount SM.  1991.  Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
L
Landau GM, Vishkin U.  1994.  Pattern matching in a digitized image. Algorithmica. 12(4):375-408.
Landau G, Schieber B, Vishkin U.  1987.  Parallel construction of a suffix tree. Automata, Languages and Programming. :314-325.

Pages