Publications

Found 1074 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is F  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive Analysis of Financial Games.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive analysis of financial games. Proceedings 33rd Annual Symposium on Foundations of Computer Science. 327-333.
Shetty, N., Schwartz G., Felegyhazi M., & Walrand J. (2009).  Competitive Cyber-Insurance and Internet Security.
Fiat, A., Karp R. M., Luby M., McGeoch L.. A., Sleator D.. D., & Young N.. E. (1991).  Competitive paging algorithms. Journal of Algorithms. 12(4), 685-699.
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.
Feldman, J. A. (2022).  Computation, perception, and mind. Behavioral and Brain Sciences. 45,
Feldman, J. (1988).  Computational Constraints on Higher Neural Representations. Proceedings of the System Development Foundation Symposium on Computational Neuroscience.
Hung, H., Friedland G., & Yeo C. (2010).  Computationally Efficient Clustering of Audio-Visual Meeting Data. 25-59.
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.
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.
Friedland, G. (2007).  Computers and Commerce: A Study of Technology and Management at Eckert-Mauchly Computer Company, Engineering Research Associates, and Remington Rand, 1946-1957 (book review). IEEE Annals of the History of Computing. 29(2), 74-77.
Baswana, S., Biswas S., Doerr B., Friedrich T., Kurur P., & Neumann F. (2009).  Computing Single Source Shortest Paths Using Single-Objective Fitness Functions. 59-66.
Feldman, J., & Ballard D. Harry (1981).  Computing with Connections.
Feldman, J., & Ballard D. Harry (1982).  Computing with Connections.
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. (1990).  Computing with Structured Connectionist Networks. 434-454.
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.
Feldman, J., Fanty M. A., & Goddard N. H. (1988).  Computing with Structured Neural Networks. IEEE Computer. 21(3), 91-103.
Floyd, S. (2000).  Congestion Control Principles.
Feldman, J., & Shastri L. (2003).  Connectionism.
Shastri, L., Grannes D. Jeffrey, Narayanan S., & Feldman J. (2002).  A Connectionist Encoding of Parameterized Schemas and Reactive Plans.

Pages