Publications

Found 238 results
Author [ Title(Asc)] Type Year
Filters: Author is Richard M. Karp  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
G
Alon, N., Karp R. M., Peleg D., & West D. (1991).  A Graph-Theoretic Game and its Application to the k-Server Problem.
Alon, N., Karp R. M., Peleg D., & West D. (1995).  A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing. 24(1), 78-100.
Gusfield, D., Karp R. M., Lusheng W.., & Stelling P. (1996).  Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. 304-319.
Gusfield, D., Karp R. M., Wang L., & Stelling P. (1998).  Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 88,
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.
Karp, R. M., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1983).  Global Wire Routing in Two-Dimensional Arrays. Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 453-459.
Elson, J.., Karp R. M., Papadimitriou C. H., & Shenker S. (2004).  Global Synchronization in Sensornets. Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN '04). 2976, 609-624.
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
Hannum, G., Srivas R., Guénolé A., van Attikum H., Krogan N. J., Karp R. M., et al. (2009).  Genome-Wide Association Data Reveal a Global Map of Genetic Interaction Among Protein Complexes. PLoS Genetics. 5(12), 
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. (1993).  A generalization of binary search. Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
Karp, R. M., & Kenyon C. (2003).  A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding.
F
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes. Proceedings of International Symposium on Information Theory (ISIT).
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes.
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
Floyd, S., & Karp R. M. (1991).  FFD bin packing for item sizes with uniform distributions on (0, 1/2). 6(2), 222-240.
Floyd, S., & Karp R. M. (1986).  FED bin packing for item sizes with distributions on (0,1/2). Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 322-330.
Xing, E. P., Jordan M. I., & Karp R. M. (2001).  Feature Selection for High-Dimensional Genomic Microarray Data. Proceedings of the 18th International Conference on Machine Learning (ICML 2001). 601-608.
Zaharia, M., Bolosky W. J., Curtis K., Fox A., Patterson D., Shenker S., et al. (2011).  Faster and More Accurate Sequence Alignment with SNAP.
Karp, R. M., & Wigderson A. (1985).  A fast parallel algorithm for the maximal independent set problem. Journal of the Association for Computing Machinery. 32(4), 762-773.
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.
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Karp, R. M. (2006).  Fair Bandwidth Allocation Without Per-Flow State. 88-110.

Pages