Technical Reports - Richard M. Karp

Algorithms to detect multi-protein modularity conserved during evolution (EECS-2011-7)
Luqman Hodgkinson and Richard M. Karp

On the Price of Heterogeneity in Parallel Systems (EECS-2006-81)
Philip Brighten Godfrey and Richard M. Karp

LOGOS: A Hierarchical Bayesian Markovian Motif Model Capturing Local Site-Dependencies and Global Motif Distributions (CSD-03-1225)
Eric P. Xing and Richard M. Karp

Efficient Reconstruction of Haplotype Structure via Perfect Phylogeny (CSD-02-1196)
Eleazar Eskin, Eran Halperin and Richard M. Karp

Optimal Broadcast and Summation in the LogP Model (CSD-92-721)
Richard Karp, Abhijit Sahay and Eunice Santos

LogP: Towards a Realistic Model of Parallel Computation (CSD-92-713)
David E. Culler, Richard Karp, David A. Patterson, Abhijit Sahay, Klaus Erik Schauser, Eunice Santos, Ramesh Subramonian and Thorsten von Eicken

An Optimal Algorithm for On-Line Bipartite Matching (M91/18)
Richard M. Karp, Umesh Vazirani and V.V. Vazirani

Coding Techniques for Handling Failures in Large Disk Arrays (CSD-88-477)
Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz and David A. Patterson

A Survey of Parallel Algorithms for Shared-Memory Machines (CSD-88-408)
Richard M. Karp and Vijaya Ramachandran

Probabilistic Analysis of Network Flow Algorithms (CSD-88-392)
Richard M. Karp, Rajeev Motwani and Noam Nisan

Subtree Isomorphism is in Random NC (CSD-87-389)
Phillip B. Gibbons, Richard M. Karp, Gary L. Miller and Danny Soroker

Deferred Data Structuring (CSD-87-320)
Richard M. Karp, Rajeev Motwani and Prabhakar Raghavan

The Complexity of Parallel Search (CSD-87-310)
Richard M. Karp, Eli Upfat and Avi Wigderson

A Simplex Variant Solving An m x d Linear Program in O(min(m squared, d squared)) Expected Number of Pivot Steps (CSD-83-158)
Ilan Adler, Richard Karp and Ron Shamir

A Family of Simplex Variants Solving An m x d Linear Program in Expected Number of Pivot Steps Depending on d Only (CSD-83-157)
Ilan Adler, Richard Karp and Ron Shamir

A New Monte-Carlo Method for Estimating the Failure Probability of an n-Component System (CSD-83-117)
Richard M. Karp and Michael G. Luby

The Differencing Method of Set Partitioning (CSD-83-113)
Narenda Karmarker and Richard M. Karp

Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems (M79/54)
R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz and C. Rackoff

An Algorithm to Solve the mxn Assignment Problem in Expected Time O (mn log n) (M78/67)
R.M. Karp

A Patching Algorithm For the Nonsymmetric Traveling-Salesman Problem (M78/2)
R.M. Karp

A Characterization of the Minimum Cycle Mean in a Digraph (M77/47)
R.M. Karp

Probabilistic Analysis of Partitioning Algorithms For the Traveling-Salesman Problem in the Plane (M77/31)
Richard M. Karp

The Probabilistic Analysis of some Combinational Search Algorithms (M581)
Richard M. Karp

Two Special Cases of the Assignment Problem (M429)
Richard M. Karp and Shuo-Yen R. Li