Publications

Found 30 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Title is P and Author is Richard M. Karp  [Clear All Filters]
Conference Paper
Karp, R. M., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Kirkpatrick, B., Li S. Cheng, Karp R. M., & Halperin E. (2011).  Pedigree Reconstruction Using Identity by Descent. 136-152.
Halperin, E., & Karp R. M. (2004).  Perfect Phylogeny and Haplotype Assignment. Proceedings of RECOMB.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1994).  Physical mapping of chromosomes using unique probes. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 489-500.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Conference Proceedings
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Journal Article
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
Karp, R. M., & Orlin J.. B. (1981).  Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
Karp, R. M. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
Kirkpatrick, B., Li S. Cheng, Karp R. M., & Halperin E. (2011).  Pedigree Reconstruction Using Identity by Descent. Journal of Computational Biology. 18(11), 1481-1493.
Gale, D.., & Karp R. M. (1972).  A Phenomenon in the Theory of Sorting. Journal of Computer and System Sciences. 6(2), 103-115.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1994).  On the power of randomization in on-line algorithms. Algorithmica. 11(1), 2-14.
Yosef, N.., Gramm J., Wang Q.-F.., Noble W.. S., Karp R. M., & Sharan R. (2010).  Prediction of Phenotype Information from Genotype Data. Communications in Information and Systems. 10(2), 99-114.
P. Godfrey, B., & Karp R. M. (2009).  On the Price of Heterogeneity in Parallel Systems. Theory of Computing Systems. 45(2), 280-301.
Daskalakis, C., Dimakis A.. G., Karp R. M., & Wainwright M.. J. (2008).  Probabilistic Analysis of Linear Programming Decoding. IEEE Transactions on Information Theory. 54(8), 3565-3578.
Karp, R. M., Motwani R., & Nisan N. (1993).  Probabilistic analysis of network flow algorithms. Mathematics of Operations Research. 18(1), 71-97.
Karp, R. M. (1977).  Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane. Mathematics of Operations Research. 2(3), 209-224.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,
Adler, I., Ahn H-S., Karp R. M., & Ross S. M. (2005).  A Probabilistic Model for the Survivability of Cells. Journal of Applied Probability. 42(4), 919-931.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
Technical Report
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.

Pages