Publications

Found 4258 results
Author Title Type [ Year(Desc)]
1979
Fillmore, C. J. (1979).  Innocence: A Second Idealization for Linguistics. Proceedings of the Fifth Annual Meeting of the Berkeley Linguistics Society (BLS 5). 63-76.
Feldman, J. (1979).  Is Memory Still a Mystery?. Proceedings of the Cold Spring Harbor Symposium on Models of Specific Systems.
Karp, R. M. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Feldman, J. (1979).  Programming Languages. Scientific American. 241,
Feldman, J., Brown C. M., & Sloan K. R. (1979).  Progress at the Rochester Image Understanding Project. Proceedings of the DARPA Image Understanding Workshop.
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Karp, R. M. (1979).  Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms. 338-339.
Feldman, J., & Sloan K. R. (1979).  Recent Developments in the Rochester Image Understanding Project. Proceedings of the DARPA Image Understanding Workshop.
[Anonymous] (1979).  Rejuvenating Experimental Computer Science. (Feldman, J., & Sutherland W.. R., Ed.).Communications of the ACM. 22,
Shenker, S. J., Kadanoff L. P., & Pruisken A.. M. M. (1979).  A Variational Real Space Renormalization Group Transformation Based on the Cumulant Expansion. Journal of Physics A: Mathematical and General. 12(1), 91-97.
1980
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Feldman, J. (1980).  On the Importance of Basic Research in Robotics. Proceedings of the Robotics Research Workshop.
Karp, R. M., & Papadimitriou C. H. (1980).  On Linear Characterizations of Combinatorial Optimization Problems. Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. 1-9.
Feldman, J., & Nigam A.. (1980).  A Model and Proof Technique for Message-Based Systems. 9(4), 768-784.
Feldman, J., & Sloan K. R. (1980).  Progress at the Rochester Image Understanding Project. Proceedings of the DARPA Image Understanding Workshop.
1981
Kadanoff, L. P., & Shenker S. J. (1981).  Band to Band Hopping in One-Dimensional Maps. Journal of Physics A: Mathematical and General. 14(2), L23-26.
Blum, M. E., Karp R. M., Vornberger O.., Papadimitriou C. H., & Yannakakis M.. (1981).  The Complexity of Testing Whether a Graph is a Superconcentrator. 13(4-5), 164-167.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
Feldman, J. (1981).  A Connectionist Model of Visual Memory. 65-97.
Karp, R. M., & Sipser M.. (1981).  Maximum Matchings in Sparse Random Graphs. Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
Feldman, J. (1981).  Memory and Change in Connection Networks.
Karp, R. M., & Orlin J.. B. (1981).  Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
1982
Feldman, J., & Ballard D. Harry (1982).  Computing with Connections.

Pages