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 
Karpinski, M., & Werther T. (1989).  VC Dimension and Learnability of Sparse Polynomials and Rational Functions.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Karp, R. M., Nierhoff T., & Tantau T. (2006).  Optimal Flow Distribution Among Multiple Channels with Unknown Capacities. 3895, 111-128.
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. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Karp, R. M. (1982).  Dynamic Programming Meets the Principle of Inclusion and Exclusion. Operations Research Letters. 1(2), 49-51.
Karp, B., Ratnasamy S., Rhea S., & Shenker S. (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).  Report of the SIGACT Committee on funding for Theoretical Computer Science.
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.
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. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
Karp, R. M., & Kenyon C. (2003).  A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
Karp, R. M., & Pearl J.. (1983).  Searching for an optimal path in a tree with random costs. Artificial Intelligence. 21(1-2), 99-116.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
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., & Shamir R. (2000).  Algorithms for Optical Mapping.
Karp, R. M., & Papadimitriou C. H. (1980).  On Linear Characterizations of Combinatorial Optimization Problems. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.