Publications

Found 238 results
Author [ Title(Desc)] Type Year
Filters: Author is Richard M. Karp  [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 
I
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.
L
Eskin, E., Halperin E., & Karp R. M. (2003).  Large Scale Reconstruction of Haplotypes from Genotype Data. Proceedings of the Seventh Conference on Research in Computational Biology (RECOMB).
Eskin, E., Halperin E., & Karp R. M. (2002).  Large-Scale Reconstruction of Haplotype Structure via Perfect Phylogeny.
Karp, R. M., & Papadimitriou C. H. (1982).  On Linear Characterizations of Combinatorial Optimization Problems. SIAM Journal on Computing. 11(4), 620-632.
Karp, R. M., & Papadimitriou C. H. (1980).  On Linear Characterizations of Combinatorial Optimization Problems. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
Lin, H.., Amanatidis C.., Sideri M.., Karp R. M., & Papadimitriou C. H. (2008).  Linked Decomposition of Networks and the Power of Choice in Polya Urns. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 993-1002.
P. Godfrey, B., Karp R. M., Lakshminarayanan K., Surana S., & Stoica I. (2004).  Load Balancing in Dynamic Structured P2P Systems. Proceedings of INFOCOMM.
P. Godfrey, B., Karp R. M., Lakshminarayanan K., Surana S., & Stoica I. (2004).  Load Balancing in Dynamic Structured P2P Systems. Proceedings of INFOCOMM.
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03).
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Second International Workshop on Peer-to-Peer Systems.
Karp, R. M., Rao A., Lakshminarayanan K., Surana S., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems.
Xing, E. P., Wu W.., Jordan M. I., & Karp R. M. (2003).  LOGOS: A Modular Bayesian Model for de Novo Motif Detection. Proceedings of IEEE Computer Society Bioinformatic Conference IPTPS.
Culler, D. E., Karp R. M., Patterson D., & Sahay A. (1996).  LogP: A Practical Model of Parallel Computation. Communications of the ACM. 39(11), 78-85.
Culler, D. E., Karp R. M., Patterson D., Sahay A., Schauser K. Erik, Santos E. E., et al. (1993).  LogP: towards a realistic model of parallel computation. Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1-12.
Culler, D. E., Karp R. M., Patterson D., Sahay A., Schauser K. Erik, Santos E. E., et al. (1993).  LogP: towards a realistic model of parallel computation. SIGPLAN Notices. 28,
M
Jiang, T., & Karp R. M. (1997).  Mapping Clones with a Given Ordering or Interleaving. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
Jiang, T., & Karp R. M. (1998).  Mapping Clones with a Given Ordering or Interleaving. 21,
Karp, R. M. (1993).  Mapping the Genome: some combinatorial problems arising in molecular biology. Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
Karp, R. M. (2002).  Mathematical Challenges from Genomics and Molecular Biology. 49(5), 544-553.
Karp, R. M., & Sipser M.. (1981).  Maximum Matchings in Sparse Random Graphs. Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
Horn, G.. B., & Karp R. M. (2001).  A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors. Proceedings of International Symposium on Information Theory.
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Alt, H., Guibas L. J., Mehlhorn K., & Karp R. M. (1996).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica. 16(4-5), 543-547.
Halperin, E., & Karp R. M. (2005).  The Minimum-Entropy Set Cover Problem. Theoretical Computer Science. 348(2), 240-250.
Halperin, E., & Karp R. M. (2004).  The Minimum-Entropy Set Cover Problem. Proceedings of ICALP.

Pages