Found 238 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is K and 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 
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.
Chandrasekaran, K.., Karp R. M., Moreno-Centeno E.., & Vempala S.. (2011).  Algorithms for Implicit Hitting Set Problems. 614-629.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multi-Protein Modularity Conserved During Evolution.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution. IEEE/ACM Transactions on Computational Biology and Bioinformatics.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2001).  Application-Level Multicast Using Content-Addressable Networks. 2233, 14-29.
Kimmel, G., Karp R. M., Jordan M.. A., & Halperin E. (2008).  Association Mapping and Significance Estimation via the Coalescent. Journal of Human Genetics. 83(6), 675-683.
Karp, R. M., Kan A.. H. G. Rinn, & Vohra R.. V. (1994).  Average case analysis of a heuristic for the assignment problem. Mathematics of Operations Research. 19(3), 513-522.
Popa, L., Rostami A.., Karp R. M., Papadimitriou C. H., & Stoica I. (2007).  Balancing the Traffic Load in Wireless Networks with Curveball Routing. Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2007).
Karp, R. M., Waarts O., & Zweig G. (1995).  The bit vector intersection problem. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
Frankle, J.., & Karp R. M. (1986).  Circuit placements and costs bounds by eigenvector decomposition. Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-86), A Conference for the EE CAD Professional. 414-417.
Xing, E. P., & Karp R. M. (2001).  CLIFF: Clustering of High-Dimensional Microarray Data via Iterative Feature Filtering Using Normalized Cuts. 17, S306-S315.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Hellerstein, L., Gibson G. A., Karp R. M., Katz R.. M., & Patterson D. (1994).  Coding techniques for handling failures in large disk arrays. Algorithmica. 12(2-3), 182-208.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Kirkpatrick, B., Reshef Y., Finucane H., Jiang H., Zhu B., & Karp R. M. (2012).  Comparing Pedigree Graphs. Journal of Computational Biology. 19(9), 998-1014.
Narayanan, M.., & Karp R. M. (2007).  Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology. 14(7), 892-907.