Publications

Found 4228 results
[ Author(Desc)] 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., & 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. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
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., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes. Proceedings of International Symposium on Information Theory (ISIT).
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
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.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
Karp, R. M., & Zhang Y. (1993).  Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery. 40(3), 765-789.
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
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., & 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. (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, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, B., & Kung H.. T. (2001).  GPSR: Greedy Perimeter Stateless Routing for Wireless networks.
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. (2005).  Optimization Problems Related to Internet Congestion Control.
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. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M., & Kenyon C. (2003).  A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding.
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., 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.

Pages