| A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps | I. Adler, R. M. Karp, and R. Shamir | Journal of Complexity, Vol. 3, No. 4, pp. 372-87 | December 1987 | Algorithms | |
| Learning with Localized Receptive Fields | J. Moody and C. Darken | Proceedings of the 1988 Connectionist Models Summer School, Hinton, Sejnowski, and Touretzsky, eds. Morgan Kaufmann, pp. 133-143 | 1988 | Algorithms | |
| Internal Representations for Associative Memory | E.B. Baum, J. Moody, and F. Wilczek | Biological Cybernetics, Vol. 59, pp. 217-228 | 1988 | Algorithms | |
| Associative Memories | J. Moody | Chapter II 5, DARPA Neural Network Study Final Report, Richard Lippmann, ed. | 1988 | 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 | |
| A randomized parallel branch-and-bound procedure | R. M. Karp and Y. Zhang | Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, pp. 290-300 | May 1988 | 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 | |
| Deferred Data Structuring | R. M. Karp, R. Motwani, and P. Raghaven | SIAM Journal on Computing, Vol. 17, No. 5, pp. 883-902 | October 1988 | Algorithms | |
| Adiabatic Effective Lagrangian | J. Moody, A. Shapere, and F. Wilczek | Geometric Phases in Physics, edited by A. Shapere and F. Wilczek, World Scientific Publishing Co. | 1989 | Algorithms | |
| Fast Learning in Multi-Resolution Hierarchies | J. Moody | Advances in Neural Information Processing Systems, D. Touretzky, editor, Morgan Kauffmann | 1989 | Algorithms | |
| Fast Learning in Networks of Locally-Tuned Processing Units | J. Moody and C. Darken | Neural Computation, Vol. 1, pp. 289-303 | 1989 | Algorithms | |
| Failure correction techniques for large disk arrays | G.A. Gibson, L. Hellerstein, R. M. Karp, R.H. Katz, and D.A. Patterson | Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III), Boston, Massachusetts, pp.123-32 | April 1989 | Algorithms | |
| On parallel evaluation of game trees | R. M. Karp and Y. Zhang | Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89), Santa Fe, New Mexico, pp. 409-20 | June 1989 | Algorithms | |
| Monte-Carlo approximation algorithms for enumeration problems | R. M. Karp, M. Luby, and N. Madras | Journal of Algorithms, Vol. 10, No.3, pp. 429-48 | September 1989 | Algorithms | |
| Spontaneous Development of Modularity in Simple Cortical Models | A. Chernjavsky and J. Moody | Neural Computation, Vol. 2, Issue 3, pp. 334-354 | 1990 | Algorithms | |
| Dynamics of Lateral Interaction Networks | J. Moody | Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 1990), San Diego, California | 1990 | Algorithms | |
| Fast, Adaptive K-Means Clustering: Some Empirical Results | C. Darken and J. Moody | Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 1990), San Diego, California | 1990 | Algorithms | |
| Note on Development of Modularity in Simple Cortical Models | A. Chernjavsky and J. Moody | Advances in Neural Information Processing Systems, Vol. 2, D. Touretzky, ed., Morgan Kaufmann, Palo Alto | 1990 | Algorithms | |
| On the power of randomization in online algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pp. 379-86 | May 1990 | Algorithms | |
| An optimal algorithm for on-line bipartite matching | R. M. Karp, U.V. Vazirani, and V.V. Vazirani | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland | May 1990 | 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 | |
| Note on Learning Rate Schedules for Stochastic Optimization | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 3, Lippmann, Moody, and Touretzky, eds. Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| FFD bin packing for item sizes with uniform distributions on (0, 1/2) | S. Floyd and R. M. Karp | Algorithmica, Vol. 6, No. 2, pp. 222-40 | 1991 | Algorithms | |
| Advances in Neural Information Processing Systems 3 | R. Lippmann, J. Moody, and D. Touretzky, eds. | Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| Note on Generalization, Regularization, and Architecture Selection in Nonlinear Learning Systems | J. Moody | Proceedings of the First IEEE-SP Workshop on Neural Networks for Signal Processing, pp. 1-10 | 1991 | 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 | |
| Selecting Neural Network Architecture via the Prediction Risk: Application to Corporate Bond Rating Prediction | J. Utans and J. Moody | Proceedings of the First International Conference on Artificial Intelligence Applications on Wall Street, New York, New York | October 1991 | Algorithms | |
| An introduction to randomized algorithms | R. M. Karp | Discrete Applied Mathematics, Vol. 34, No. 1-3. Also in the proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, D.C., pp. 165-201 | November 21 1991 | Algorithms | |
| Competitive paging algorithms | A. Fiat, R. M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young | Journal of Algorithms, Vol. 12, No. 4, pp. 685-99 | December 1991 | 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 | |
| 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 | |
| Principled Architecture Selection for Neural Networks: Application to Corporate Bond Rating Prediction | J. Moody and J. Utans | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Networks with Learned Unit Response Functions | J. Moody and N. Yarvin | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto, pp. 1048-1055 | 1992 | Algorithms | |
| On-line algorithms versus off-line algorithms: how much is it worth to know the future? | R. M. Karp | Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Madrid, Spain, pp. 416-29 | 1992 | Algorithms | |
| Advances in Neural Information Processing Systems 4 | J. Moody, S. Hanson, and R. Lippmann, eds. | Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Efficient PRAM simulation on a distributed memory machine | R. M. Karp, M. Luby, and F. Meyer auf der Heide | Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, pp. 318-26 | May 1992 | Algorithms | |
| Learning Rate Schedules for Faster Stochastic Gradient Search | C. Darken, J. Chang, and J. Moody | Neural Networks for Signal Processing, Vol. 2 - Proceedings of the 1992 IEEE Workshop | August 1992 | Algorithms | |
| Competitive analysis of financial games | R. El-Yaniv, A. Fiat, R. M. Karp, and G. Turpin | Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No. 92CH3188-0), Pittsburgh, Pennsylvania, pp. 327-33 | October 1992 | Algorithms | |
| Predicting the U.S. Index of Industrial Production | J. Moody, A. Levin, and S. Rehfuss | Proceedings of Parallel Applications in Statistics and Economics '93, M. Novak (ed), special issue of Neural Network World, Vol. 3, No. 6, pp. 791-794 | 1993 | 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 | |
| Neural Network Modeling of Physiological Processes | V. Tresp, J. Moody, and W.R. Delong | Computational Learning Theory and Natural Learning Systems, Vol. 2, T. Petsche, M. Kearns, S. Hanson, R. Rivest (eds), MIT Press, pp. 363-378 | 1993 | Algorithms | |
| A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition | L. Shastri | Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93), France, pp. 202-207 | 1993 | Algorithms | |
| Probabilistic analysis of network flow algorithms | R. M. Karp, R. Motwani, and N. Nisan | Mathematics of Operations Research, Vol. 18, No. 1, pp. 71-97 | February 1993 | Algorithms | |
| A Monte-Carlo algorithm for estimating the permanent | N. Karmarkar, R. M. Karp, R. Lipton, L. Lovasz, and M. Luby | SIAM Journal on Computing, Vol. 22, No. 2, pp. 284-93 | April 1993 | Algorithms | |
| Mapping the Genome: some combinatorial problems arising in molecular biology | R. M. Karp | Proceedings of 25th Annual Symposium on the Theory of Computing, San Diego, California, pp. 278-85 | May 1993 | 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 | |
| LogP: towards a realistic model of parallel computation | D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. | SIGPLAN Notices, Vol. 28, No. 7. Also in the proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, May 1993, pp. 1-12 | July 1993 | Algorithms | |
| Randomized parallel algorithms for backtrack search and branch-and-bound computation | R. M. Karp and Y. Zhang | Journal of the Association for Computing Machinery, Vol. 40, No.3, pp. 765-89 | July 1993 | Algorithms | |
| A generalization of binary search | R. M. Karp. Edited by: F. Dehne, J.R. Sack, N. Santoro, and S. Whitesides | Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93), Montreal, Quebec, Canada, pp. 27-34 | August 1993 | Algorithms | |
| Fast Pruning Using Principal Components | A.U. Levin, T.K. Leen, and J.E. Moody | Advances in Neural Information Processing Systems, Vol. 6, Cowan, Tesauro, and Alspector (eds), Morgan Kaufmann Publishers, San Mateo, California | 1994 | Algorithms | |
