Publications

Found 238 results
Author Title [ Type(Asc)] Year
Filters: Author is Richard M. Karp  [Clear All Filters]
Conference Paper
Karp, R. M., Vazirani U. V., & Vazirani V. V. (1990).  An optimal algorithm for on-line bipartite matching. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
Dagum, P., Karp R. M., Luby M., & Ross S. (1995).  An optimal algorithm for Monte Carlo estimation. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
Karp, R. M. (1992).  On-line algorithms versus off-line algorithms: how much is it worth to know the future?. Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92. 416-429.
Karp, R. M., & Kleinberg R.. (2007).  Noisy Binary Search. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
Xing, E. P., & Karp R. M. (2004).  MotifPrototyper: A Bayesian Profile Model for Motif Families. Proceedings of the National Academy of Sciences of the United States of America. 101(29), 10523-10528.
El-Yaniv, R., & Karp R. M. (1993).  The mortgage problem. Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
Karp, R. M., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Proceedings of the Symposium on the Complexity of Approximately Solved Problems. 45-64.
Karp, R. M., & Luby M. (1983).  Monte-Carlo Algorithms for Enumeration and Reliability Problems. Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 56-64.
Karp, R. M. (1995).  Modeling parallel communication. Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
Halperin, E., & Karp R. M. (2004).  The Minimum-Entropy Set Cover Problem. Proceedings of ICALP.
Horn, G.. B., & Karp R. M. (2001).  A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors. Proceedings of International Symposium on Information Theory.
Karp, R. M., & Sipser M.. (1981).  Maximum Matchings in Sparse Random Graphs. Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
Karp, R. M. (1993).  Mapping the Genome: some combinatorial problems arising in molecular biology. Proceedings of 25th Annual Symposium on the Theory of Computing. 278-285.
Jiang, T., & Karp R. M. (1997).  Mapping Clones with a Given Ordering or Interleaving. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
Culler, D. E., Karp R. M., Patterson D., Sahay A., Schauser K. Erik, Santos E. E., et al. (1993).  LogP: towards a realistic model of parallel computation. Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1-12.
Xing, E. P., Wu W.., Jordan M. I., & Karp R. M. (2003).  LOGOS: A Modular Bayesian Model for de Novo Motif Detection. Proceedings of IEEE Computer Society Bioinformatic Conference IPTPS.
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03).
Rao, A., Lakshminarayanan K., Surana S., Karp R. M., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Second International Workshop on Peer-to-Peer Systems.
Karp, R. M., Rao A., Lakshminarayanan K., Surana S., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems.
P. Godfrey, B., Karp R. M., Lakshminarayanan K., Surana S., & Stoica I. (2004).  Load Balancing in Dynamic Structured P2P Systems. Proceedings of INFOCOMM.
P. Godfrey, B., Karp R. M., Lakshminarayanan K., Surana S., & Stoica I. (2004).  Load Balancing in Dynamic Structured P2P Systems. Proceedings of INFOCOMM.
Lin, H.., Amanatidis C.., Sideri M.., Karp R. M., & Papadimitriou C. H. (2008).  Linked Decomposition of Networks and the Power of Choice in Polya Urns. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2008). 993-1002.
Karp, R. M., & Papadimitriou C. H. (1980).  On Linear Characterizations of Combinatorial Optimization Problems. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
Eskin, E., Halperin E., & Karp R. M. (2003).  Large Scale Reconstruction of Haplotypes from Genotype Data. Proceedings of the Seventh Conference on Research in Computational Biology (RECOMB).
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science. 165-201.

Pages