Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
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,
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., Motwani R., & Nisan N. (1993).  Probabilistic analysis of network flow algorithms. Mathematics of Operations Research. 18(1), 71-97.
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.
P. Godfrey, B., & Karp R. M. (2009).  On the Price of Heterogeneity in Parallel Systems. Theory of Computing Systems. 45(2), 280-301.
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.
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.
Gale, D.., & Karp R. M. (1972).  A Phenomenon in the Theory of Sorting. Journal of Computer and System Sciences. 6(2), 103-115.
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.
Karp, R. M. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
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.
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Karp, R. M., McKellar A.. C., & Wong C.. K. (1975).  Near-optimal Solutions to a 2-dimensional Placement Problem. SIAM Journal on Computing. 4(3), 271-286.
Karp, R. M., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
Karp, R. M., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1993).  A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing. 22(2), 284-293.
Halperin, E., & Karp R. M. (2005).  The Minimum-Entropy Set Cover Problem. Theoretical Computer Science. 348(2), 240-250.
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.
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,
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.