Publications

Found 416 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is C  [Clear All Filters]
1986
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Feldman, J., McClelland J.. L., Bower G.., & McDermott D.. (1986).  Connectionist Models and Cognitive Science: Goals, Directions and Implications.
1987
Egecioglu, O.., Smith T.. R., & Moody J. (1987).  Computable Functions and Complexity in Neural Networks.
1988
Günther, O. (1988).  The Cell Tree: An Index for Geometric Databases.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Feldman, J. (1988).  Computational Constraints on Higher Neural Representations. Proceedings of the System Development Foundation Symposium on Computational Neuroscience.
Feldman, J., Fanty M. A., Goddard N. H., & Lynne K.. J. (1988).  Computing with Structured Connectionist Networks. Communications of the ACM. 31(2), 170-187.
Feldman, J., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
[Anonymous] (1988).  Connectionist Models and Their Applications. (Waltz, D.., & Feldman J., Ed.).
Feldman, J. (1988).  Connectionist Representation of Concepts.
1989
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Munro, P. W. (1989).  Conjectures on Representations in Backpropagation Networks.
Stolcke, A. (1989).  A Connectionist Model of Unification.
Feldman, J. (1989).  Connectionist Representation of Concepts. 25-45.
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Cleve, R. (1989).  Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
1990
Gusella, R. (1990).  Characterizing the Variability of Arrival Processes with Indices of Dispersion.
Hölldobler, S. (1990).  CHCL - A Connectionist Inference System for Horn Logic Based on the Connection Method and using Limited Resources.
Ferrari, D. (1990).  Client Requirements for Real-Time Communication Services.
Demers, A. J., Weiser M., Hayes B., Boehm H-J.., Bobrow D., & Shenker S. J. (1990).  Combining Generational and Conservative Garbage Collection: Framework and Implementations. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). 261-269.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Cleve, R. (1990).  Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..
Ehrenfeucht, A., & Karpinski M. (1990).  The Computational Complexity of (XOR, AND)-Counting Problems.

Pages