Publications

Found 238 results
Author [ Title(Desc)] 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 
M
Karp, R. M. (1995).  Modeling parallel communication. Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1993).  A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing. 22(2), 284-293.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1990).  A Monte-Carlo Algorithm for Estimating the Permanent.
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., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
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., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
El-Yaniv, R., & Karp R. M. (1993).  The mortgage problem. Proceedings of the Second Israel Symposium on Theory and Computing Systems . 304-312.
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.
N
Karp, R. M., & Hopcroft J.. E. (1973).  An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing. 2(4), 225-231.
El-Yaniv, R., & Karp R. M. (1997).  Nearly Optimal Competitive Online Replacement Policies. 22,
Karp, R. M., McKellar A.. C., & Wong C.. K. (1975).  Near-optimal Solutions to a 2-dimensional Placement Problem. SIAM Journal on Computing. 4(3), 271-286.
Karp, R. M., & Kleinberg R.. (2007).  Noisy Binary Search. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
O
Karp, R. M. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
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.
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.
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.
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.
Karp, R. M., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.
Karp, R. M., Nierhoff T., & Tantau T. (2005).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005). 225-231.
Karp, R. M., & Glassey C.. R. (1974).  On the Optimality of Huffman Trees.
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
Karp, R. M., Koutsoupias E.., Papadimitriou C. H., & Shenker S. J. (2000).  Optimization Problems in Congestion Control. Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
Karp, R. M. (2005).  Optimization Problems Related to Internet Congestion Control.

Pages