| Discovering Local Structure in Gene Expression Data: The Order Preserving Submatrix Problem | A. Ben-Dor, B. Chor, R.M. Karp, and Z. Yakhini | Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02) | 2002 | 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 | |
| Idempotents Among Partesan Games | E. Berlekamp | More Games of No Chance, MSRI Publicatons vol. 42, pp 3-23, Cambridge University Press, 2002. | 2002 | Algorithms | |
| Large-Scale Reconstruction of Haplotype Structure via Perfect Phylogeny | E. Eskin, E. Halperin, and R.M. Karp | EECS Department, UC Berkeley Technical Report No. UCB/CSD 2-1196, Berkeley, California | August 2002 | Algorithms | [PDF]
|
| Large-Scale Recovery of Haplotypes from Genotype Data Using Imperfect Phylogeny | E. Halperin and E. Eskin | EECS Department, UC Berkeley Technical Report No. UCB/CSD-1-1196, Berkeley, California | August 2002 | Algorithms | [PDF]
|
| Improved Approximation Algorithms for the Partial Vertex Cover Problem | E. Halperin and R. Srinivasan | Fifth International Workshop on Approximation Algorithms for Combinatorial Optimization, (APPROX), 185-199, Springer, 2002. | 2002 | Algorithms | |
| Mathematical Challenges from Genomics and Molecular Biology | R. M. Karp | Notices of the American Mathematical Society, Vol. 49, No. 5, pp. 544-553 | 2002 | Algorithms | |
| Hardness of Approximation for Vertex-Connectivity Network Design Problems | G. Kortsarz, R. Krauthgamer, and J.R. Lee | Fifth International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 185-199, Springer, 2002. | 2002 | Algorithms | |
| The Intrinsic Dimensionality of Graphs | R. Krauthgamer and J.R. Lee | Manuscript, 2002. | 2002 | Algorithms | |
| Online Scheduling for Sorting Buffers | H. Racke, C. Sohler, and M. Westermann | European Symposium on Algorithms, 820-832, 2002. | 2002 | Algorithms | |
| Go Thermography: The 4/12/98 Jiang-Rui Environmental Endgame | B. Spight | More Games of No Chance, MSRI Publictations vo. 42, Cambridge University Press, 2002. | 2002 | Algorithms | |
| Distributed Caching Independent of the Network Size | M. Westermann | Symposium on Parallel Algorithms and Archiectures, 31-40, 2002. | 2002 | Algorithms | |
| Distance Metric Learning, with Application to Clustering with Side-Information | E.P. Xing, A.Y. Ng, M.I. Jordan, and S. Russell | Neural Information Processing Systems, 2002. | 2002 | Algorithms | |
| A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences | E.P. Xing, M.I. Jordan, R.M. Karp, and S. Russell | Neural Information Processing Systems, 2002. | 2002 | Algorithms | |
| Curve Reconstruction and the Traveling Salsman Problem. | E. Althaus | Ph.D. Thesis, Universitat des Saarlandes. 2001. | 2001 | Algorithms | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | SIAM Journal of Computing 31(1), 2001. | 2001 | Algorithms | |
| Developments in Forecast Combination and Portfolio Choice | C. Dunis, A. Timmermann, and J. Moody, editors | Wiley Financial Economics, London, 2001. | 2001 | Algorithms | |
| A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors | G.B. Horn and R.M. Karp | Proceedings of International Symposium on Information Theory | 2001 | Algorithms | |
| Approximation Algorithms for Data Management in Networks | C. Krick, H. Racke, and M. Westermann | Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA) pp. 237-246, 2001. | 2001 | Algorithms | |
| Approximation Algorithms for Data Management in Networks | C. Krick, H. Racke, and M. Westermann | Theory of Computing Systems, 2001. | 2001 | Algorithms | |
| Neural Networks for Time Series Analysis | Y Liao, J. Moody, and L. Wu | Handbook on Neural Network Signal Processing, edited by Y-H Hu and J-N Hwang, CRC Press 2001. | 2002 | Algorithms | |
| Learning to Trade via Direct Reinforcement | J. Moody and M. Saffell | IEEE Transactions on Neural Networks, Vol. 12, No. 4, July 2001. | July 2001 | Algorithms | |
| On Approximating Optimal Auctions | A. Ronen | The Third ACM Conference on Electronic Commerce (EC01), 11-17, 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 | |
| Experiments on Curve Reconstruction | E. Althaus, K. Melhorn. S Naher, and S. Schirra | Proceedings of the Second Workshop Algorithm Engineering and Experiments (ALENEX00). Lecture Notes in Computer Science, Springer-Verlag, 2000. | 2000 | Algorithms | |
| A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. | 2000 | Algorithms | |
| A Combinatorial Approach to Protein Docking with Flexible Side-Chains | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, 2000. | 2000 | Algorithms | |
| Universal DNA Tag Systems: A Combinatorial Design Scheme | A. Ben-Dor, R. Karp, B. Schwikowski, and Z. Yakhini | Proceedings of RECOMB 2000. | 2000 | Algorithms | |
| An Optimal Algorithm for Monte Carlo Estimation | P. Dagum, R.M. Karp, M. Luby, and S. Ross | SIAM Journal on Computing, SIAM J. Comput. (USA), vol.29, (no.5), SIAM, 2000. p.1484-96. | 2000 | Algorithms | |
| Topologically-Aware Overlay Construction and Server Selection | M. Handley, R.M. Karp, S. Ratnasamy, and S. Shenker | Proceedings, INFOCOM 2000. | 2000 | Algorithms | |
| Discovery of Regulatory Interactions Through Perturbation: Inference and Experimental Design | T.E. Ideker, V. Thorsson, and R.M. Karp | Proceedings of Pacific Symposium on Biocomputing (PSB 2000), Oahu, Hawaii, pp. 302-313 | January 2000 | Algorithms | [PDF]
|
| Constructing Heterogeneous Committees via Input Feature Grouping | Y. Liao and J. Moody | Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.-R. Muller (eds.),MIT Press, 2000. | 2000 | Algorithms | |
| Minimizing Downside Risk via Stochastic Dynamic Programming | J. Moody and M. Saffell | 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 | |
| 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 | |
| Discrete Prediction Games with Arbitrary Feedback and Loss | A. Piccolboni and C. Schindelhauer | Universitat zu Lubeck Technical Report No. AIIM-TR-A-00-18 | November 2000 | Algorithms | |
| Data Visualization and Feature Selection: New Algorithms for Nongaussian Data | H. Yang and J. Moody | Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.R. Muller (eds.), MIT Press, 2000. | 2000 | Algorithms | |
| Challenges for Theory of Computing | A. Condon, H. Edelsbrunner, E.A. Emerson, L. Fortnow, et.al. | SIGACT News, June 1999, vol.30, (no.2):62-76. | June 1999 | Algorithms | |
| Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.) | A. Condon and R.M. Karp | Edited by: Hochbaum, D., Jansen, K., Rolim, J.D.P., Sinclair, A. Berlin, Germany: Springer-Verlag, 1999. pp. 221-32, ix+287 pp. 14 | 1999 | Algorithms | |
| Error-Resilient DNA Computation. Random Structures & Algorithms, Random Struct | R.M. Karp, C. Kenyon, and O. Waarts | Algorithms (USA), vol.15, (no.3-4), Wiley, Oct.-Dec. 1999. p.450-66. 19 | October 1999 | Algorithms | |
| Reinforcement Learning for Trading, Advances in Neural Information Processing Systems 11 | M.S. Kearns, S.A. Solla, and D.A. Cohn, eds. | MIT Press, Cambridge, Massachusetts 1999. | 1999 | Algorithms | |
| Predicting Blood Glucose Metabolism in Diabetics -- A Machine Learning Solution | V. Tresp, T. Briegel, and J. Moody | IEEE Transactions on Neural Networks, v. 10, n. 5, pp. 1204--1213, 1999. | 1999 | Algorithms | |
| Feature Selection Based on Joint Mutual Information | H. Yang and J. Moody | Advances in Intelligent Data Analysis (AIDA), Computational Intelligence Methods and Applications (CIMA), International Computer Science Conventions, Rochester, New York, June 22-25, 1999. | June 1999 | Algorithms | |
| On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas | P. Beame, R.M. Karp, T. Pitassi, and M. Saks | Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71. | May 1998 | Algorithms | |
| Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming | A. Bockmayr and T. Kasper | INFORMS Journal on Computing, 10(3): 287-300, 1998. | 1998 | Algorithms | |
| Constructing Maps Using the Span and Inclusion Relations | D. Fasulo, T. Jiang, R.M. Karp, and N. Sharma | RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 64-73. | 1998 | Algorithms | |
| Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. | D. Gusfield, R.M. Karp, L. Wang, and P. Stelling | Discrete Applied Mathematics, 9 Nov. 1998, vol.88, (no.1-3):167-80. | 1998 | Algorithms | |
| Mapping Clones with a Given Ordering or Interleaving | T. Jiang and R.M. Karp | Algorithmica, July 1998, vol.21, (no.3):262-84. | 1998 | 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 | |
| Algorithms for Optical Mapping | R.M. Karp and R. Shamir | RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 22-25 March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 117-24. | 1998 | Algorithms | |
| On Parallel Evaluation of Game Trees | R.M. Karp and Y. Zhang | Journal of the ACM, Nov. 1998, vol.45, (no.6):1050-75. | 1998 | Algorithms | |
