Publications

Found 238 results
Author Title Type [ Year(Desc)]
Filters: Author is Richard M. Karp  [Clear All Filters]
1995
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1995).  Physical Mapping of Chromosomes Using Unique Probes.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling parallel communication: the h-relation problem. Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Frieze, A., Karp R. M., & Reed B. (1995).  When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM Journal on Computing. 24(3), 484-493.
Blömer, J., Kalfane M., Karpinski M., Karp R. M., Luby M., & Zuckerman D. (1995).  An XOR-Based Erasure-Resilient Coding Scheme.
1996
Etzioni, O., Hanks S., Jiang T., & Karp R. M. (1996).  Efficient Information Gathering on the Internet. Proceedings. Thirty-Seventh Annual Symposium Foundations of Computer Science. 234-243.
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.
Gusfield, D., Karp R. M., Lusheng W.., & Stelling P. (1996).  Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. 304-319.
Culler, D. E., Karp R. M., Patterson D., & Sahay A. (1996).  LogP: A Practical Model of Parallel Computation. Communications of the ACM. 39(11), 78-85.
Alt, H., Guibas L. J., Mehlhorn K., & Karp R. M. (1996).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica. 16(4-5), 543-547.
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
1997
Aho, A. V., Johnson D. S., Karp R. M., & S. Kosaraju R. (1997).  Emerging Opportunities for Theoretical Computer Science. 28,
Zamir, O.., Etzioni O., Madani O.., & Karp R. M. (1997).  Fast and Intuitive Clustering of Web Documents. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 287-290.
Jiang, T., & Karp R. M. (1997).  Mapping Clones with a Given Ordering or Interleaving. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. 400-409.
El-Yaniv, R., & Karp R. M. (1997).  Nearly Optimal Competitive Online Replacement Policies. 22,
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
1998
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Fasulo, D., Jiang T., Karp R. M., & Sharma N. (1998).  Constructing Maps Using the Span and Inclusion Relations. RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 64-73.
Gusfield, D., Karp R. M., Wang L., & Stelling P. (1998).  Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. 88,
Jiang, T., & Karp R. M. (1998).  Mapping Clones with a Given Ordering or Interleaving. 21,
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.

Pages