Publications

Found 4228 results
[ Author(Asc)] Title Type Year
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., & 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., & Kleinberg R.. (2007).  Noisy Binary Search. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007). 881-890.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Karp, R. M., & Orlin J.. B. (1981).  Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
Karp, B., & Kung H.. T. (2001).  GPSR: Greedy Perimeter Stateless Routing for Wireless networks.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (2005).  Optimization Problems Related to Internet Congestion Control.
Karp, B., Ratnasamy S., Rhea S., & Shenker S. J. (2004).  Spurring Adoption of DHTs with OpenHash, a Public DHT Service. Proceedings of the Third International Workshop on Peer-to-Peer Systems.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karp, R. M., & Kenyon C. (2003).  A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding.
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., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1983).  Global Wire Routing in Two-Dimensional Arrays. Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 453-459.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Karp, R. M., Kan A.. H. G. Rinn, & Vohra R.. V. (1994).  Average case analysis of a heuristic for the assignment problem. Mathematics of Operations Research. 19(3), 513-522.
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., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes.
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. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
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.
Karp, R. M. (2006).  Fair Bandwidth Allocation Without Per-Flow State. 88-110.
Karp, R. M., & Glassey C.. R. (1974).  On the Optimality of Huffman Trees.
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.

Pages