| Whole-Genome Patterns of Common DNA Variation in Three Human Populations | D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, and D. R. Cox | Science, Vol. 307, No. 5712, pp. 1072-1079. DOI:10.1126/science.1105436 | February 2005 | Algorithms | [PDF]
|
| When to Use Bit-Wise Neutrality | T. Friedrich and F. Neumann | Natural Computing, Vol. 9, No. 1, pp. 283-294 | March 2010 | Algorithms | [PDF]
|
| When is the assignment bound tight for the asymmetric traveling-salesman problem? | A. Frieze, R. M. Karp, and B. Reed | SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93 | June 1995 | Algorithms | |
| What is the True Price? -- State Space Models for High Frequency FX Rates | J. Moody and L. Wu | Decision Technologies for Financial Engineering, Y. Abu-Mostafa, A. N. Refenes, and A. S. Weigend, eds., World Scientific, London, 1997. | 1997 | Algorithms | |
| Weight-Space Probability Densities and Equilibria in Stochastic Learning | T.K. Leen and J. Moody | Advances in Neural Information Processing Systems 5, Hanson, Cowan, and Giles (eds), Morgan Kaufmann Publishers, San Mateo, California | 1993 | Algorithms | |
| Variations on the Theme of "Twenty Questions" | R.M. Karp | Proceedings of the 1998 IEEE International Symposium on Information Theory, Aug. 1998. New York, NY, USA: IEEE, 1998. p. 3. | August 1998 | Algorithms | |
| Using Markov-Chain Mixing Time Estimates for the Analysis of Ant Colony Optimization | D. Sudholt | Proceedings of the 11th Foundations of Genetic Algorithms Workshop (FOGA XI), pp. 139-150, Schwarzenberg, Austria | January 2011 | Algorithms | [PDF]
|
| Using DNA Pools for Genotyping Trios | K.B. Beckman, K.A. Abel, A. Braun, and E. Halperin | Nucleic Acids Research, Vol. 34, No. 19, electronic article no. 129 | November 2006 | Algorithms | [PDF]
|
| Using Contiguous Bi-Clustering for Data Driven Temporal Analysis of fMRI Based Functional Connectivity | A. Maron-Katz, E. B. Simon, Y. Jacob, K. Rosenberg, R. M. Karp, T. Hendler, and R. Shamir | Proceedings of the 4th Annual INCF Neuroinformatics Congress, Boston, Massachusetts | September 2011 | Algorithms | [PDF]
|
| Universal DNA Tag Systems: A Combinatorial Design Scheme | A. Ben-Dor, R. Karp, B. Schwikowski, and Z. Yakhini | Proceedings of RECOMB 2000. | 2000 | Algorithms | |
| Understanding Science Through the Lens of Computation | R. Karp | Presented at the Symposium on Transformational Information Engineering and Science, Singapore | January 2010 | Algorithms | |
| UbiMASS - Ubiquitous Mobile Agent System for Wireless Sensor Networks | F. Bagci, J. Wolf, B. Satzger, and T. Ungerer | Proceedings of the Third IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC2010), Newport Beach, California, pp. 245-252 | June 2010 | Algorithms | [PDF]
|
| Two Special Cases of the Assignment Problem | R. M. Karp and S. Li | Discrete Mathematics (Netherlands), Vol. 13, No. 2, pp. 129-42 | October 1975 | Algorithms | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | SIAM Journal of Computing 31(1), 2001. | 2001 | Algorithms | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | Proceedings of the Eleventh Symposium on Discrete Algorithms, pp. 686-695, 2000. | 2000 | Algorithms | |
| Transitive Compaction in Parallel via Branchings | P. Gibbons, R. M. Karp, V. Ramachandran, D. Soroker, and R. Tarjan | Journal of Algorithms, Vol. 12, No. 1, pp. 110-25 | March 1991 | Algorithms | |
| Trading with Committees: A Comparative Study | S. Rehfuss, L. Wu, and J. Moody | Proceedings of the Third International Conference on Neural Networks in the Capital Markets, London, United Kingdom | October 1996 | Algorithms | |
| Towards the Integrated Analysis, Visualization, and Reconstruction of Microbial Gene Regulatory Networks | J. Baumbach, S. Rahmann, and A. Tauch | Briefings in Bioinformatics, Vol. 10, Issue 1, pp. 75-83 | January 2009 | Algorithms | [PDF]
|
| Towards Optimally Multiplexed Applications of Universal DNA Tag Systems | A. Ben-Dor, T. Hartman, B. Schwikowski, R. Sharan, and Z. Yakhini | Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB'03), ACM Press, 48-56 | 2003 | Algorithms | |
| Towards Optimally Multiplexed Applications of Universal Arrays | A. Ben-Dor, T. Hartman, R. M. Karp, B. Schwikowski, R. Sharan, and Z. Yakhini | Journal of Computational Biology, Vol. 11, Nos. 2-3, pp. 477-493 | January 2004 | Algorithms | [PDF]
|
| Towards Lightweight Self-Configuration in Wireless Sensor Networks | B. Satzger, F. Bagci, F. Kluge, and T. Ungerer | Proceedings of the 25th ACM Symposium on Applied Computing (ACM SAC 2010), Sierre, Switzerland, pp. 791-792 | March 2010 | Algorithms | [PDF]
|
| Towards Faster Stochastic Gradient Search | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Total Latency in Singleton Congestion Games | M. Gairing and F. Schoppmann | Proceedings of the Third International Workshop on Internet and Network Economics (WINE 2007), San Diego, California, pp. 381-387 | December 2007 | Algorithms | |
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hueffner, R. M. Karp, R. Shamir, and R. Sharan | Nucleic Acids Research, Vol. 37, pp. 106-108 | July 2009 | Algorithms | [PDF]
|
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hüffner, R. M. Karp, R. Shamir, and R. Sharan | Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2009), Tucson, Arizona, pp. 74-89 | May 2009 | Algorithms | |
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hüffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | Algorithms | |
| Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Huffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | Algorithms | [PDF]
|
| Topologically-Aware Overlay Construction and Server Selection | M. Handley, R.M. Karp, S. Ratnasamy, and S. Shenker | Proceedings, INFOCOM 2000. | 2000 | Algorithms | |
| Tight Lower Bounds for the Asymetric k-Center Problem | J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz and S. Naor | In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04) | January 05 2004 | Algorithms | |
| Tight Bounds for the Cover Time of Multiple Random Walks | R. Elsässer and T. Sauerwald | Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426 | July 2009 | Algorithms | [PDF]
|
| Three Combinatorial Problems in Computational and Genomic Biology | R. Karp | IFORS Distinguished Lecture at the Joint International Meeting of the Canadian Operational Research Society and the Institute for Operations Research and the Management Sciences (CORS-INFORMS International), Toronto, Canada | June 2009 | Algorithms | |
| Theory of Computation as an Enabling Tool for the Sciences | R. Karp | Presented at the Turing Centennial Celebration, Princeton, New Jersey. Also presented at the 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Turing Centenary Meeting, Beijing, China | May 2012 | Algorithms | |
| Theoretical improvements in algorithmic efficiency for network flow problems | J. Edmonds and R. M. Karp | Journal of the Association for Computing Machinery, Vol. 19, No. 2, p. 248-64 | April 1972 | Algorithms | |
| The Weighted Coupon Collector's Problem and Applications | P. Berenbrink and T. Sauerwald | Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009), Niagra Falls, New York, pp. 449-458 | July 2009 | Algorithms | |
| The Restriction Scaffold Problem | A. Ben-Dor, R.M. Karp, B. Schwikowski, and R. Shamir | Journal of Computational Biology, Vol. 10, No. 3-4, pp. 385-398 | 2003 | Algorithms | |
| The Restriction Scaffold Problem | A. Ben-Dor, R.M. Karp, B Schwikowski, and R. Shamir | Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02), 2002. | 2002 | Algorithms | |
| The Rank of Sparse Random Matrices Over Finite Fields | J. Blomer, R.M. Karp, and E. Welzl | Random Structures & Algorithms, July 1997, vol.10, (no.4):407-19. | July 1997 | Algorithms | |
| The mortgage problem | R. El-Yaniv and R. M. Karp | Proceedings of the Second Israel Symposium on Theory and Computing Systems (Cat. No. 93TH0520-7), Natanya, Israel, pp. 304-12 | June 1993 | Algorithms | |
| The Minimum-Entropy Set Cover Problem | E. Halperin and R.M. Karp | Proceedings of ICALP | January 05 2004 | Algorithms | |
| The Minimum-Entropy Set Cover Problem | E. Halperin and R. M. Karp | Theoretical Computer Science, Vol. 348, Issue 2, pp. 240-250 | December 2005 | Algorithms | |
| The Intrinsic Dimensionality of Graphs | R. Krauthgamer and J.R. Lee | Manuscript, 2002. | 2002 | Algorithms | |
| The Efficiency of Resolution and Davis-Putnamn Procedures | P. Beame, R. M. Karp, T. Pitassi, and M. Saks | SIAM Journal of Computing, Vol. 31, No. 4, pp. 1048-1075 | 2002 | Algorithms | |
| The Effective Number of Parameters: an Analysis of Generalization and Regularization in Nonlinear Learning Systems | J. Moody | Advances in Neural Information Processing Systems Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto, pp. 847-854 | 1992 | Algorithms | |
| The Complexity of Testing Whether a Graph is a Superconcentrator | M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis | Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7 | 1981 | Algorithms | |
| The complexity of parallel search | R.M. Karp, E. Upfal, and A. Wigderson | Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53 | April 1988 | Algorithms | |
| The complexity of parallel computation | R. M. Karp, Edited by: C.E. Leiserson | Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI, Cambridge, Massachusetts, pp.197 | April 1986 | Algorithms | |
| The complexity of parallel computation | R. M. Karp | Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, p. 1 | October 1985 | Algorithms | |
| The bit vector intersection problem | R. M. Karp, O. Waarts and G. Zweig | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 621-30 | October 1995 | Algorithms | |
| The Benefit of Migration in Parallel Evolutionary Algorithms | J. Laessig and D. Sudholt | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 1105-1112 | July 2010 | Algorithms | |
| Term Structure of Interactions of Foreign Exchange Rates | J. Moody and H. Yang | Computational Finance 1999, edited by Y. S. Abu-Mostafa, B. LeBaron, A. W. Lo, and A. S. Weigend, MIT Press, Cambridge, MA, 2000. | 2000 | Algorithms | |
