Publications

Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
Frieze, A., Karp R. M., & Reed B. (1995).  When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM Journal on Computing. 24(3), 484-493.
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
Gibbons, P. B., Karp R. M., Ramachandran V., Soroker D., & Tarjan R.. (1991).  Transitive Compaction in Parallel via Branchings. Journal of Algorithms. 12(1), 110-125.
Ben-Dor, A., Hartman T., Karp R. M., Schwikowski B., Sharan R., & Yakhini Z. (2004).  Towards Optimally Multiplexed Applications of Universal Arrays. Journal of Computational Biology. 11, 477-493.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. Nucleic Acids Research. 37, 106-108.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Torque: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Edmonds, J., & Karp R. M. (1972).  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the Association for Computing Machinery. 19(2), 248-264.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1990).  Subtree isomorphism is in random NC. Discrete Applied Mathematics. 29(1), 35-62.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
Karp, R. M., Shenker S., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Karp, R. M., Shenker S., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Akella, A., Karp R. M., Papadimitriou C. H., Seshan S., & Shenker S. (2002).  Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP. ACM SIGCOMM Computer Communication Review. 32(4), 117-130.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Ratnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S. (2001).  A Scalable Content-Addressable Network. ACM SIGCOMM Computer Communication Review. 31(4), 161-172.
Ben-Dor, A., Karp R. M., Schwikowski B., & Shamir R. (2003).  The Restriction Scaffold Problem. Journal of Computational Biology. 10(3-4), 385-398.
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
Karp, R. M., & Zhang Y. (1993).  Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery. 40(3), 765-789.
Kimmel, G., Jordan M. I., Halperin E., Shamir R., & Karp R. M. (2007).  A Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies. American Journal of Human Genetics. 81(5), 895-905.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
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.

Pages