Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Conference Paper
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive analysis of financial games. Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
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.
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.
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).
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution.
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Chandrasekaran, K.., Karp R. M., Moreno-Centeno E.., & Vempala S.. (2011).  Algorithms for Implicit Hitting Set Problems. 614-629.