| 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 | |
| Forecasting the Economy with Neural Nets: A Survey of Challenges and Solutions | J. Moody | Neural Networks: Tricks of the Trade, Genevieve B. Orr and Klaus-Robert Muller, eds., Springer Verlag, pp. 347-371, 1998. | 1998 | Algorithms | |
| Reinforcement Learning for Trading: Immediate vs. Future Rewards | J. Moody and M. Saffell | Knowledge Discovery and Datamining, Proceedings of the 1998 New York Conference, AAAI Press, 1998. | 1998 | Algorithms | |
| Reinforcement Learning for Trading Systems and Portfolios | J. Moody, M. Saffell, Y. Liao, and L. Wu | Decision Technologies for Computational Finance, Proceedings of the London Conference, A.N. Refenes, N. Burgess and J. Moody, eds., Kluwer Financial Publishing, 1998. | 1998 | Algorithms | |
| Performance Functions and Reinforcement Learning for Trading Systems and Portfolios | J. Moody, L. Wu, Y. Liao, and M. Saffell | Journal of Forecasting, vol. 17, pp. 441-470, 1998. | 1998 | Algorithms | |
| High Frequency Foreign Exchange Rates: Price Behavior Analysis and `True Price' Models | J. Moody and L. Wu | Chapter 2 of Nonlinear Modelling of High Frequency Financial Data, Christian Dunis and Bin Zhou, editors, Wiley Financial Publishing, London, 1998. | 1998 | Algorithms | |
| Decision Technologies for Computational Finance, Proceedings of the London Conference | A. Refenes, N. Burgess, and J. Moody, editors. | Kluwer Financial Publishing, The Netherlands, 1998. | 1998 | Algorithms | |
| Emerging Opportunities for Theoretical Computer Science | A.V. Aho, D.S. Johnson, R.M. Karp, S.R. Kosaraju, and others | SIGACT News, Sept. 1997, vol.28, (no.3):65-74. | 1997 | 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 | |
| Nearly Optimal Competitive Online Replacement Policies | R. El-Yaniv and R.M. Karp | Mathematics of Operations Research, Nov. 1997, vol.22, (no.4):814-39. | 1997 | Algorithms | |
| Mapping Clones with a Given Ordering or Interleaving | T. Jiang and R.M. Karp | Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Jan. 1997. New York, NY, USA: ACM, 1997. p. 400-9. | January 1997 | Algorithms | |
| Stochastic Manhattan Learning: Time-Evolution Operator for the Ensemble Dynamics | T. Leen and J. Moody | Physical Review E, 1997. | 1997 | Algorithms | |
| Smoothing Regularizers for Projective Basis Function Networks | J. Moody and T. Rognvaldsson | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| Optimization of Trading Systems and Portfolios | 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 | |
| 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 | |
| Multi-Effect Decompositions for Financial Data Modeling | L. Wu and J. Moody | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| Fast and Intuitive Clustering of Web Documents | O. Zamir, O. Etzioni, O. Madani, and R.M. Karp | Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 14-17 Aug. 1997. Edited by: Heckerman, D.; Mannila, H.; Pregibon, D.; Uthurusamy, R. Menlo Park, CA, USA: AAAI Press, 1997. p. 287-90. | August 1997 | Algorithms | |
| A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | H. Alt, L. Guibas, K. Mehlhorn, R. M. Karp, et al. | Algorithmica, Vol. 16, No. 4-5, pp. 543-547 | October 1996 | Algorithms | |
| LogP: A Practical Model of Parallel Computation | D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, and others | Communications of the ACM, Vol. 39, No. 11, pp. 78-85 | November 1996 | Algorithms | |
| Efficient Information Gathering on the Internet | O. Etzioni, S. Hanks, T. Jiang, R.M. Karp, and others | Proceedings. Thirty-Seventh Annual Symposium Foundations of Computer Science, 14-16 Oct. 1996. Los Alamitos, California, USA: IEEE Comput. Soc. Press, 1996. p. 234-43. | October 1996 | Algorithms | |
| Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem | D. Gusfield, R.M. Karp, W. Lusheng, and P. Stelling | Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. Proceedings. 10-12 June 1996. Berlin, Germany: Springer-Verlag, 1996. p. 304-19. | June 1996 | Algorithms | |
| Efficient PRAM Simulation on a Distributed Memory Machine | R.M. Karp, M. Luby, and F. Meyer auf der Heide | Algorithmica, Vol. 16, No. 4-5, pp. 517-42 | October 1996 | Algorithms | |
| A Neural Network Visualization and Sensitivity Analysis Toolkit | Y. Liao and J. Moody | Proceedings of the International Conference on Neural Information Processing, Hong Kong, Sun-ichi Amari, Lei Xu, Laiwan Chan, Irwin King, and Kwong-Sak Leung, eds. Springer Verlag Singapore Pte. Ltd. pp. 1069-74, Sept. 1996. | September 1996 | Algorithms | |
| Improved Estimates for the Rescaled Range and Hurst Exponents | J. Moody and L. Wu | Proceedings of the Third International Conference on Neural Networks in Financial Engineering, London, pp. 537-553 | October 1996 | 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 | |
| A Smoothing Regularizer for Feedforward and Recurrent Neural Networks | L. Wu and J. Moody | Neural Computation, Vol. 8, Issue 3 | 1996 | Algorithms | |
| Scheduling parallel communication: the h-relation problem | M. Adler, J.W. Byers, and R. M. Karp | Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). Edited by: Wiedermann, J.; Hajek, P. Berlin, Germany: Springer-Verlag, pp. 1-20 | August 1995 | Algorithms | |
| Parallel sorting with limited bandwidth | M. Adler, J.W. Byers, and R. M. Karp | Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95), New York, New York, pp. 129-36 | July 1995 | Algorithms | |
| A graph-theoretic game and its application to the k-server problem | N. Alon, R. M. Karp, D Peleg, and D. West | SIAM Journal on Computing, Vol. 24, No. 1, pp. 78-100 | February 1995 | Algorithms | |
| An optimal algorithm for Monte Carlo estimation | P. Dagum, R. M. Karp, M. Luby, and S. Ross | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 142-9 | October 1995 | Algorithms | |
| 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 | |
| Bounded branching process and AND/OR tree evaluation | R. M. Karp and Y. Zhang | Random Structures & Algorithms, Vol. 7, No. 2, pp. 97-116 | September 1995 | 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 | |
| Modeling parallel communication | R. M. Karp | Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95), Santa Barbara, California, p. 2 | April 1995 | Algorithms | |
