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. (1977).  Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane. Mathematics of Operations Research. 2(3), 209-224.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
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., & 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., 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. (2010).  Understanding Science Through the Lens of Computation.
Karp, R. M., & Papadimitriou C. H. (1982).  On Linear Characterizations of Combinatorial Optimization Problems. SIAM Journal on Computing. 11(4), 620-632.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Karp, R. M. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
Karp, R. M. (1991).  An Introduction to Randomized Algorithms. Discrete Applied Mathematics. 34,
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
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., & Luby M. (1985).  Monte-Carlo Algorithms for the Planar Multiterminal Network Reliability Problem. Journal of Complexity. 1,
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.
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
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.
Karpinski, M., Larmore L. L., & Rytter W. (1996).  Correctness of Constructing Optimal Alphabetic Trees Revisited.
Karpinski, M., & Zelikovsky A. (1995).  New Approximation Algorithms for the Steiner Tree Problems.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karpinski, M., & Rytter W. (1993).  An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns.
Karpinski, M., & Shparlinski I. (1994).  Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Karpinski, M., & Rytter W. (1993).  On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Karpinski, M., & Werther T. (1991).  VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions.

Pages