| Massively Parallel Computational Models of Biological Systems | J.A. Feldman | Proceedings of the Fourth International Conference on Mathematical Modeling, Zurich, Switzerland | August 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 | |
| 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 | |
| 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 | |
| Rochester's Intelligent Gateway | J.A. Feldman, K. Lantz, K. Gradischnig, and R. Rashid | Computer, Vol. 15, Issue 10 | October 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 | |
| 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 | |
| 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 | |
| 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 | |
| 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 | |
| Memory and Change in Connection Networks | J.A. Feldman | TR96, Computer Science Department, University of Rochester, New York | December 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 | |
| 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 | |
| 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 | |
| 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 | |
| On Linear Characterizations of Combinatorial Optimization Problems | R. M. Karp and C.H. Papadimitriou | Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, New York, pp. 1-9 | October 1980 | Algorithms | |
| On the Importance of Basic Research in Robotics | J.A. Feldman | Proceedings of the Robotics Research Workshop, Newport, Rhode Island | April 1980 | AI | |
| Progress at the Rochester Image Understanding Project | J.A. Feldman and K.R. Sloan | Proceedings of the DARPA Image Understanding Workshop, College Park, Maryland | April 1980 | AI | |
| An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)* | R. M. Karp | Networks, Vol. 10, No. 2, pp. 143-52 | 1980 | Algorithms | |
| A Model and Proof Technique for Message-Based Systems | J.A. Feldman and A. Nigam | SIAM Journal of Computing, Vol. 9, Issue 4, pp. 768-784 | 1980 | AI | |
| Programming Languages | J.A. Feldman | Scientific American, Vol. 241, No. 6 | December 1979 | AI | |
| A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem | R. M. Karp | SIAM Journal on Computing, Vol. 8, No. 4, pp. 561-73 | November 1979 | Algorithms | |
| Recent Developments in the Rochester Image Understanding Project | J.A. Feldman and K. Sloan | Proceedings of the DARPA Image Understanding Workshop, Los Angeles, California | November 1979 | AI | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff | Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science, San Juan, Puerto Rico, pp. 218-23 | October 1979 | Algorithms | |
| Rejuvenating Experimental Computer Science | J.A. Feldman and W.R. Sutherland, eds | Communications of the ACM, Vol. 22, No. 9 | September 1979 | AI | |
| Is Memory Still a Mystery? | J.A. Feldman | Proceedings of the Cold Spring Harbor Symposium on Models of Specific Systems | August 1979 | AI | |
| Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms | R. M. Karp, Edited by: Maurer, H.A. | Automata, Languages and Programming, Graz, Austria, Springer-Verlag, pp. 338-9 | July 1979 | Algorithms | |
| A Distributed Information Processing Model of Visual Memory | J.A. Feldman | Proceedings of the Conference on Associative Memory and Parallel Computation, San Diego, California. Also TR52, Computer Science Department, University of Rochester, December 1979 | June 1979 | AI | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, and L. Lovasz | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, Canada, pp. 174-6 | May 1979 | Algorithms | |
| Probabilistic Analysis of Graph-theoretic Algorithms | R. M. Karp | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, pp. 173 | May 1979 | Algorithms | |
| Progress at the Rochester Image Understanding Project | J.A. Feldman, C. Brown, and K. Sloan | Proceedings of the DARPA Image Understanding Workshop, Menlo Park, California | April 1979 | AI | |
| High Level Programming for Distributed Computing | J.A. Feldman | Communications of the ACM, Vol. 22, Issue 6, pp. 353-368. Reprinted in Distributed Computing: Concepts and Implementations, P. L. McEntire, J. G. O'Reilly and R. E. Larson (eds.), IEEE Press, New York | 1979 | AI | |
| Programming Distributed Systems | J.A. Feldman, J. Low, and P. Rovner | Proceedings of the ACM Annual Conference, Washington, D.C., Vol. 2, pp. 310-317 | December 1978 | AI | |
| Progress at the Rochester Image Project | J.A. Feldman, C. Brown, and K. Sloan | Proceedings of the DARPA Image Understanding Workshop, Pittsburgh, Pennsylvania | October 1978 | AI | |
| A Characterization of the Minimum Cycle Mean in a Digraph | R. M. Karp | Discrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11 | September 1978 | Algorithms | |
| Towards Symbolic Models of Neural Nets | J.A. Feldman | Presented at the Cold Spring Harbor Conference on Biological Information Processing | August 1978 | AI | |
| System Support for Advanced Image Understanding | J.A. Feldman | Proceedings of the DARPA Image Understanding Workshop, Boston, Massachusetts | May 1978 | AI | |
| Some Remarks on Data Types | J. A. Feldman and G. Williams | University of Rochester Computer Science Department Technical Report TR28, Rochester, New York | April 1978 | AI | |
| Understanding Natural Texture | J.A. Feldman, C. Brown, and J. Maleson | DARPA Image Understanding Workshop | October 1977 | AI | |
| Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane | R. M. Karp | Mathematics of Operations Research, Vol. 2, No. 3, pp. 209-24 | August 1977 | Algorithms | |
| An Approach to Knowledge-Directed Image Analysis | J.A. Feldman, D. Ballard, and C. Brown | Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI 1977), Cambridge, Massachusetts. Also TR21, Computer Science Department, University of Rochester, 1977. Also in Computer Vision Systems, A. R. Hanson and E. M. Riseman (eds.), Academic Press, New York, 1978 | August 1977 | AI | |
