Publications

Found 238 results
Author Title Type [ Year(Asc)]
Filters: Author is Richard M. Karp  [Clear All Filters]
2000
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Ideker, T. E., Thorsson V., & Karp R. M. (2000).  Discovery of Regulatory Interactions Through Perturbation: Inference and Experimental Design. Proceedings of Pacific Symposium on Biocomputing (PSB 2000). 302-313.
Ideker, T. E., Thorsson V., & Karp R. M. (2000).  Discovery of Rgulatory Interactions Through Perturbation: Inference and Experimental Design.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.
Karp, R. M., Koutsoupias E.., Papadimitriou C. H., & Shenker S. J. (2000).  Optimization Problems in Congestion Control. Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
Karp, R. M., Schindelhauer C., Shenker S. J., & Vocking B.. (2000).  Randomized Rumor Spreading. Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. J. (2000).  A Scalable Content Addressable Network.
Ben-Dor, A., Karp R. M., Schwikowski B., & Yakhini Z. (2000).  Universal DNA Tag Systems: A Combinatorial Design Scheme. Proceedings of RECOMB 2000.
Ben-Dor, A., Karp R. M., Schwikowski B., & Yakhini Z. (2000).  Universal DNA Tag Systems: A Combinatorial Design Scheme.
1999
Condon, A., & Karp R. M. (1999).  Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.). 221-232.
Karp, R. M., Kenyon C., & Waarts O. (1999).  Error-Resilient DNA Computation. 15,
1998
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Fasulo, D., Jiang T., Karp R. M., & Sharma N. (1998).  Constructing Maps Using the Span and Inclusion Relations. RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 64-73.
Gusfield, D., Karp R. M., Wang L., & Stelling P. (1998).  Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 88,
Jiang, T., & Karp R. M. (1998).  Mapping Clones with a Given Ordering or Interleaving. 21,
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
1997
Aho, A. V., Johnson D. S., Karp R. M., & S. Kosaraju R. (1997).  Emerging Opportunities for Theoretical Computer Science. 28,
Zamir, O.., Etzioni O., Madani O.., & Karp R. M. (1997).  Fast and Intuitive Clustering of Web Documents. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 287-290.
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.
El-Yaniv, R., & Karp R. M. (1997).  Nearly Optimal Competitive Online Replacement Policies. 22,
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,

Pages