Publications

Found 364 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 
K
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Karpinski, M., & Werther T. (1991).  VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Karp, R. M., Schindelhauer C., Shenker S. J., & 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., & 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. (1991).  Parallel Combinatorial Computing.
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. (2002).  Mathematical Challenges from Genomics and Molecular Biology. 49(5), 544-553.
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. (1995).  Modeling parallel communication. Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95). 2.
Karp, R. M., & Glassey C.. R. (1976).  On the Optimality of Huffman Trees. SIAM Journal on Applied Mathematics. 31(2), 368-378.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1996).  Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica. 16(4-5), 517-542.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
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., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
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.

Pages