Publications

Found 4077 results
Author Title Type [ Year(Asc)]
1989
Cáceres, R. (1989).  Separating Abstraction from Implementation in Communication Network Design.
S. McCormick, T., Pinedo M. L., Shenker S., & Wolf B. (1989).  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research. 37(6), 925-935.
Floyd, S. (1989).  On Space-Bounded Learning and the Vapnik-Chervonenkis Dimension (Thesis).
Guesgen, H. Werner (1989).  Spatial Reasoning Based on Allen's Temporal Logic.
Diederich, J. (1989).  Spreading Activation and Connectionist Models for Natural Language Processing.
Luby, M., & Rackoff C. (1989).  A Study of Password Security.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1989).  Subtree Isomorphism is in Random NC.
Jähnichen, S., Gabriel R., Weber M., & Anlauff M. (1989).  Supporting Formal Program Developments: the DEVA Environment.
Govindan, R., Keshav S., & Verma D. C. (1989).  A Survey of Optical Fibers in Communication.
Guesgen, H. Werner (1989).  A Tagging Method for Distributed Constraint Satisfaction.
Feldman, J. (1989).  A Temporal Extension of the Four Frames Model. 423-441.
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  On the Theory of Average Case Complexity (Revised Edition).
Ben-David, S., Chor B., Goldreich O., & Luby M. (1989).  Towards a Theory of Average Case Complexity.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Karpinski, M., & Werther T. (1989).  VC Dimension and Learnability of Sparse Polynomials and Rational Functions.
Feldman, J. (1989).  What Lies Ahead.
Clausen, M., Dress A., Grabmeier J., & Karpinski M. (1989).  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials over Finite Fields.
1988
Moody, J. (1988).  Associative Memories.
Shenker, S., & Weinrib A. (1988).  Asymptotic Analysis of Large Heterogeneous Queuing Systems. Proceedings of the 1988 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '88). 56-62.
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.

Pages