Publications

Found 416 results
Author Title Type [ Year(Asc)]
Filters: First Letter Of Title is C  [Clear All Filters]
1982
Feldman, J., & Ballard D. Harry (1982).  Connectionist Models and Their Properties. 6, 205-254.
Kadanoff, L. P., & Shenker S. J. (1982).  Critical Behavior of a KAM Surface: I. Empirical Results. Journal of Physical Statistics. 27(4), 631-656.
1981
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.
1978
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
1977
Fillmore, C. J. (1977).  The Case for Case Reopened. 59-81.
1975
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
1974
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
1973
Feldman, J., & Low J.. R. (1973).  Comment on Brent's Scatter Storage Algorithm. 16(11), 703.
1971
Fillmore, C. J. (1971).  Coming and Going. 50-69.
1969
Feldman, J., Paul R. P., & Falk G. (1969).  The Computer Description of Simply Described Scenes.
Feldman, J., Paul R. P., & Falk G. (1969).  The Computer Description of Simply Described Scenes.
1968
Fillmore, C. J. (1968).  The Case for Case. 1-88.
1967
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment.
Feldman, J., & Curry J.. (1967).  The Compiler-compiler in a Time-Sharing Environment. Bit Dropper.

Pages