Found 358 results
[ Author(Asc)] 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 
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M. (2007).  Streaming Algorithms for Selection and Approximate Sorting. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. 9-20.
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.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (2011).  Heuristic Algorithms in Computations Molecular Biology. Journal of Computer and System Sciences. 77(1), 122-128.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Karp, R. M. (2009).  Three Combinatorial Problems in Computational and Genomic Biology.
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. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
Karp, R. M. (1993).  A generalization of binary search. Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93). 27-34.
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
Karp, R. M., Kenyon C., & Waarts O. (1999).  Error-Resilient DNA Computation. 15,
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., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
Karp, R. M., Schindelhauer C., Shenker S., & Vocking B.. (2000).  Randomized Rumor Spreading. Proceedings of the IEEE 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 565-574.
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. (1991).  Parallel Combinatorial Computing.
Karp, R. M. (2005).  Optimization Problems Related to Internet Congestion Control.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Discrete Applied Mathematics. 34,