Publications

Found 238 results
Author Title [ Type(Desc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Journal Article
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.
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.
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.
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.
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.
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.
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
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.
Miscellaneous
Scott, J., & Karp R. M. (2004).  Achieving Fairness Through Selective Early Dropping.
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
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.
Blum, M. E., Karp R. M., Vornberger O.., Papadimitriou C. H., & Yannakakis M.. (1981).  The Complexity of Testing Whether a Graph is a Superconcentrator. 13(4-5), 164-167.
Ideker, T. E., Thorsson V., & Karp R. M. (2000).  Discovery of Rgulatory Interactions Through Perturbation: Inference and Experimental Design.
Karp, R. M. (2011).  Effective Heuristics for NP-Hard Problems.
Aho, A. V., Johnson D. S., Karp R. M., & S. Kosaraju R. (1997).  Emerging Opportunities for Theoretical Computer Science. 28,
Zaharia, M., Bolosky W. J., Curtis K., Fox A., Patterson D., Shenker S., et al. (2011).  Faster and More Accurate Sequence Alignment with SNAP.
Floyd, S., & Karp R. M. (1991).  FFD bin packing for item sizes with uniform distributions on (0, 1/2). 6(2), 222-240.
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes.
Srivas, R., Hannum G., Guénolé A., van Attikum H., Krogan N. J., Karp R. M., et al. (2010).  Genome-Wide Association Data Reveal a Global Map of Genetic Interactions among Protein Complexes.
Karp, R. M., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1987).  Global wire routing in two-dimensional arrays. 2(1), 113-129.
Xing, E. P., Jordan M. I., Karp R. M., & Russell S. (2002).  A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences.
Karp, R. M. (2010).  Implicit Hitting Set Problems and Multi-Genome Alignment.
Jiang, T., & Karp R. M. (1998).  Mapping Clones with a Given Ordering or Interleaving. 21,

Pages