| Spontaneous Development of Modularity in Simple Cortical Models | A. Chernjavsky and J. Moody | Neural Computation, Vol. 2, Issue 3, pp. 334-354 | 1990 | Algorithms | |
| Statistical Analysis and Forecasting of High Frequency Foreign Exchange Rates | J. Moody and L. Wu | Proceedings of the Neural Networks in the Capital Markets Conference, Caltech University, California | 1994 | Algorithms | |
| Statistical Analysis of Tick-by-tick Foreign Exchange Data | J. Moody and L. Wu | Proceedings of the High Frequency Data in Finance Conference, Zurich, Switzerland | 1995 | Algorithms | |
| Stochastic Direct Reinforcement: Application to Simple Games with Recurrence | J. Moody, Y. Liu, M. Saffell, and K. Youn | Proceedings of the 2004 AAAI Fall Symposium on Artificial Multiagent Learning, Arlington, Virginia, pp. 23-34 | October 2004 | Algorithms | [PDF]
|
| Stochastic Manhattan Learning: Time-Evolution Operator for the Ensemble Dynamics | T. Leen and J. Moody | Physical Review E, 1997. | 1997 | Algorithms | |
| Stock Returns: Momentum, Volatility and Interest Rates | Y. Fang, S. Wada, and J. Moody | Proceedings of Computational Intelligence in Financial Engineering, IEEE Press | 2003 | Algorithms | |
| Streaming Algorithms for Selection and Approximate Sorting | R. M. Karp | Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, pp. 9-20 | December 2007 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker | Discrete Applied Mathematics, Vol. 29, No. 1, pp. 35-62 | November 1990 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker. Edited by J.H. Reif | Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88), Corfu, Greece, pp. 43-52 | July 1988 | Algorithms | |
| Tag SNP Selection in Genotype Data for Maximizing SNP Prediction Accuracy | E. Halperin, G. Kimmel, and R. Shamir | Proceedings of the 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005), Detroit, Michigan, pp. 195-203 | June 2005 | Algorithms | [PDF]
|
| Temperature Profiles Induced by a Scanning CW Laser Beam | J. Moody and R.H. Hendel | Journal of Applied Physics, Vol. 53, Issue 6, pp. 4364-4371 | 1982 | 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 | |
| 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 | |
| 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 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 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 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 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 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 Intrinsic Dimensionality of Graphs | R. Krauthgamer and J.R. Lee | Manuscript, 2002. | 2002 | 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 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 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 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 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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]
|
| 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 | |
| Topologically-Aware Overlay Construction and Server Selection | M. Handley, R.M. Karp, S. Ratnasamy, and S. Shenker | Proceedings, INFOCOM 2000. | 2000 | 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]
|
| 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 | |
| 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 | |
| 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 | |
| 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 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 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 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]
|
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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]
|