| 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 | |
| A Connectionist Model of Visual Memory | J.A. Feldman | Parallel Models of Associative Memory, pp. 65-97, G. E. Hinton and J. A. Anderson (eds.), Lawrence Erlbaum Associates, Inc., Hillsdale, New Jersey | 1981 | AI | |
| Parametric Shortest Path Algorithms with an Application to Cyclic Staffing | R. M. Karp and J.B. Orlin | Discrete Applied Mathematics (Netherlands), Vol. 3, No. 1, pp. 37-45 | February 1981 | Algorithms | |
| Computing with Connections | J.A. Feldman and D.H. Ballard | TR72, Computer Science Department, University of Rochester, New York. Also in Human and Machine Vision, A. Rosenfeld and J. Beck (eds.), 1982 | April 1981 | AI | |
| Maximum matchings in sparse random graphs | R. M. Karp and M. Sipser | Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, pp. 364-75 | October 1981 | Algorithms | |
| Memory and Change in Connection Networks | J.A. Feldman | TR96, Computer Science Department, University of Rochester, New York | December 1981 | AI | |
| 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 | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp | Information and Control, Vol. 55, No.1-3, pp. 57-68 | 1982 | Algorithms | |
| Dynamic Connections in Neural Networks | J.A. Feldman | Biological Cybernetics, Vol. 46, pp. 27-39 | 1982 | AI | |
| Four Frames Suffice: A Provisionary Model of Vision and Space | J.A. Feldman | TR99, Computer Science Department, University of Rochester, New York | 1982 | AI | |
| Connectionist Models and Their Properties | J.A. Feldman and D.H. Ballard | Cognitive Science, Vol. 6, pp. 205-254 | 1982 | AI | |
| Frame semantics | C.J. Fillmore | Linguistics in the Morning Calm, Seoul, South Korea, Hanshin Publishing Co., pp. 111-137 | 1982 | AI | |
| Rochester's Intelligent Gateway | K.A. Lantz, K.D. Gradischnig, J.A. Feldman, and R.F. Rashid | IEEE Computer, Vol. 15, Issue 10, pp. 54-68 | 1982 | AI | |
| Dynamic programming meets the principle of inclusion and exclusion | R. M. Karp | Operations Research Letters, Vol. 1, No. 2, pp. 49-51 | April 1982 | Algorithms | |
| Language Constructs and Support Systems for Distributed Computing | J.A. Feldman and C.S. Ellis | TR102, Computer Science Department, University of Rochester, New York. Also in Proceedings of Distributed Computing Symposium, Ottawa, Ontario, Canada, August 1982 | May 1982 | AI | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp. Edited by: D. Chaum, R.L. Rivest, and A.T. Sherman | Advances in Cryptology: Proceedings of Crypto 82, Santa Barbara, California, pp. 177-86 | August 1982 | Algorithms | |
| Language Constructs and Support Systems for Distributed Computing | C.S. Ellis, J.A. Feldman, and J.E. Heliotis | Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 1982), Ottawa, Canada, pp. 1-9 | August 1982 | AI | |
| Recent Results of the Rochester Image Understanding Project | J.A. Feldman | Proceedings of the DARPA Image Understanding Workshop, Palo Alto, California | September 1982 | AI | |
| Rochester's Intelligent Gateway | J.A. Feldman, K. Lantz, K. Gradischnig, and R. Rashid | Computer, Vol. 15, Issue 10 | October 1982 | AI | |
| An efficient approximation scheme for the one-dimensional bin-packing problem | N. Karmarkar and R.M. Karp | Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 312-20 | November 1982 | Algorithms | |
| On linear characterizations of combinatorial optimization problems | R. M. Karp, C.H. Papadimitriou | SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32 | November 1982 | Algorithms | |
| Recent Results of the Rochester Image Understanding Project | J.A. Feldman, D.H. Ballard, and C.M. Brown | Proceedings of the DARPA Image Understanding Workshop, Arlington, Virginia, pp. 43-46 | 1983 | AI | |
| Searching for an optimal path in a tree with random costs | R. M. Karp and J. Pearl | Artificial Intelligence, Vol. 21, No.1-2, pp. 99-116 | March 1983 | Algorithms | |
| Massively Parallel Computational Models of Biological Systems | J.A. Feldman | Proceedings of the Fourth International Conference on Mathematical Modeling, Zurich, Switzerland | August 1983 | AI | |
| Filamentary Galaxy Clustering: A Mapping Algorithm | J. Moody, E.L. Turner, and J.R. Gott III | Astrophysical Journal, Vol. 273, pp. 16-23 | October 1983 | Algorithms | |
| R. M. Karp and M. Luby | Monte-Carlo algorithms for enumeration and reliability problems | Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp. 56-64 | November 1983 | Algorithms | |
| Global wire routing in two-dimensional arrays | R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani | Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp.453-9 | November 1983 | Algorithms | |
| A Stellar Energy Loss Mechanism Involving Axions | L.M. Krauss, J. Moody, and F. Wilczek | Physics Letters, Vol. 144B, pp. 391 | 1984 | Algorithms | |
| Brains and Robots, Two Weak Attempts at the Grand Synthesis | J.A. Feldman | Review for Cognition and Brain Theory | 1984 | AI | |
| Review of The Architecture of Cognition, by John R. Anderson | J.A. Feldman | Cognition and Brain Theory | 1984 | AI | |
| Evidential Inference in Activation Networks | J.A. Feldman and L. Shastri | Proceedings of the 6th Cognitive Science Conference, Boulder, Colorado | 1984 | AI | |
| Recent Results of the Rochester Image Understanding Project | J.A. Feldman, D.H. Ballard, and C.M. Brown | Proceedings of the DARPA Image Understanding Workshop | 1984 | AI | |
| Semantic Networks and Neural Nets | J.A. Feldman and L. Shastri | TR131, Computer Science Department, University of Rochester, New York | June 1984 | AI | |
| Rochester Connectionist Papers 1979-84 | J.A. Feldman, D.H. Ballard, C.M. Brown, and S.L. Small | TR124, Computer Science Department, University of Rochester, New York, Revised | June 1984 | AI | |
| Calculations for Cosmic Axion Detection | L. Krauss, J. Moody, F. Wilczek, and D. Morris | Physical Review Letters, Vol. 55, Issue 17, pp. 1797-1800 | 1985 | Algorithms | |
| Connectionist Models and Parallelism in High Level Vision | J.A. Feldman | CVGIP, Special Issue on in Human and Machine Vision, Vol. 31, pp. 178-200. Also TR146, Computer Science Department, University of Rochester, New York | 1985 | AI | |
| Evidential Reasoning in Semantic Networks: A Formal Theory | L. Shastri and J.A. Feldman | Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 465-474 | 1985 | AI | |
| Connectionist Models and Their Applications | J.A. Feldman | Introduction to Special Issue in Cognitive Science, Vol. 9, No. 1, pp. 1-2 | January 1985 | AI | |
| Connections: Massive Parallelism in Natural and Artificial Intelligence | J.A. Feldman | BYTE Magazine, pp. 277-284 | April 1985 | AI | |
| Research with the Butterfly Multicomputer | J.A. Feldman, C.M. Brown, C.S. Ellis, T.J. LeBlanc, and G.L. Peterson | 1984-85 Computer Science and Engineering Research Review, pp. 3-23. Also appears as "Artificial Intelligence Research on the Butterfly Multiprocessor,'' in the proceedings of the Workshop on Artificial Intelligence and Distributed Problem Solving, National Academy of Sciences, Washington, DC, pp. 109-118 | May 1985 | AI | |
| Prospects for Axion Detection | J. Moody | Dark Matter in the Universe: Proceedings of IAU Symposium 117, Princeton, New Jersey | June 1985 | Algorithms | |
| Four Frames Suffice: A Provisional Model of Vision and Space | J.A. Feldman | Behavioral and Brain Sciences, Vol. 8, pp. 265-289 | June 1985 | AI | |
| Monte-Carlo algorithms for the planar multiterminal network reliability problem | R. M. Karp and M. Luby | Journal of Complexity, Vol. 1, No. 1. Also in the Proceedings of the Symposium on the Complexity of Approximately Solved Problems, New York, New York, pp. 45-64, April 1985 | October 1985 | Algorithms | |
| A fast parallel algorithm for the maximal independent set problem | R. M. Karp and A. Wigderson | Journal of the Association for Computing Machinery, Vol. 32, No. 4, pp. 762-73 | October 1985 | 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 | |
| Energy and the Behavior of Connectionist Models | J.A. Feldman | TR155, Computer Science Department, University of Rochester, New York | November 1985 | AI | |
| Recent Progress of the Rochester Image Understanding Project | J.A. Feldman and C.M. Brown | Proceedings of the DARPA Image Understanding Workshop | December 1985 | AI | |
| Rochester Connectionist Papers: 1979-1985 | J.A. Feldman, D.H. Ballard, C.M. Brown, and G.S. Dell | TR172, Computer Science Department, University of Rochester, New York | December 1985 | AI | |
| Frames and the Semantics of Understanding | C. J. Fillmore | Quaderni di Semantica, Vol. 6, No. 2, pp. 222-254 | December 1985 | AI | [PDF]
|
| Macroscopic T Nonconservation: Prospects for a New Experiment | W. Bialek, J. Moody, and F. Wilczek | Physical Review Letters, Vol. 56, pp. 1623 | 1986 | Algorithms | |
