Publications

Found 364 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name is K  [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 
K
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
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., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1987).  Global wire routing in two-dimensional arrays. 2(1), 113-129.
Karp, R. M. (2010).  Understanding Science Through the Lens of Computation.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
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., 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., Shenker S. J., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Karp, R. M., Motwani R., & Nisan N. (1993).  Probabilistic analysis of network flow algorithms. Mathematics of Operations Research. 18(1), 71-97.
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
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., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,
Karp, R. M. (2010).  Implicit Hitting Set Problems and Multi-Genome Alignment.
Karp, R. M., Saks M., & Wigderson A. (1986).  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
Karp, R. M. (2011).  Effective Heuristics for NP-Hard Problems.
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., & 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., Shenker S. J., & Papadimitriou C. H. (2003).  A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems. 28(1), 51-55.
Karp, R. M. (2006).  Fair Bandwidth Allocation Without Per-Flow State. 88-110.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1992).  Efficient PRAM simulation on a distributed memory machine. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. 318-326.
Karp, R. M. (1979).  Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms. 338-339.
Karp, R. M., & Glassey C.. R. (1974).  On the Optimality of Huffman Trees.
Karp, B., & Kung H.. T. (2001).  GPSR: Greedy Perimeter Stateless Routing for Wireless networks.

Pages