Found 4168 results
Author [ Title(Desc)] Type Year
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 
Feldman, J., & Narayanan S. (2014).  Affordances, Actionability, and Simulation.
Feigenbaum, J., Nisan N., Ramachandran V., Sami R., & Shenker S. (2002).  Agents' Privacy In Distributed Algorithmic Mechanisms (Position Paper).
Thaler, D., & Handley M. (2000).  On the Aggregatability of Multicast Forwarding State. Proceedings of Infocom 2000.
Mahajan, R., Bellovin S. M., Floyd S., Ioannidis J., Paxson V., & Shenker S. (2002).  Aggregate Congestion Control. ACM SIGCOMM Computer Communication Review. 32(1), 69.
Rosenfeld, A.., Feldman J., Kanal L.. N., & Winston P.. H. (1977).  AI and Pattern Recognition.
Metere, A. (2019).  AI will never conquer humanity. It’s too rational. Cosmos Magazine.
Afroz, S., Biggio B., Carlini N., Elovici Y., & Shabtai A. (2019).  AISec'19: 12th ACM Workshop on Artificial Intelligence and Security. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. 2707-2708.
Feldman, J., Finkel R. A., Taylor R. H., Bolles R. C., & Paul R. P. (1974).  AL, A Programming System for Automation.
Gittens, A.., Rothauge K.., Mahoney M.. W., Wang S.., Gerhardt L.., Prabhat, et al. (2018).  Alchemist: An Apache Spark <=> MPI Interface. Concurrency and Computation: Practice and Experience (Special Issue of the Cray User Group, CUG 2018), e5026.
Guesgen, H. Werner, & Ladkin P. (1990).  An Algebraic Approach to General Boolean Constraint Problems.
Blum, L., Cucker F., Shub M., & Smale S. (1996).  Algebraic Settings for the Problem.
Feldman, J., & Rovner P. D. (1969).  An ALGOL-based Associative Language. Communications of the ACM. 12(8), 439-449.
Feldman, J., & Rovner P. D. (1968).  An ALGOL-based Associative Language.
Feldman, J., & Rovner P. D. (1971).  An ALGOL-based Associative Language.
Radoslavov, P., & Tokuda T.. (1997).  An Algorithm for Cost-Delay Balanced Trees and Its Application to Wide Area Network Multicast. Proceedings of the First International Conference on Worldwide Computing and Its Applications.
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1993).  An Algorithm to Learn Read-Once Threshold Formulas, and Some Generic Transformations Between Learning Models (Revised Version).
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
Condon, A., & Karp R. M. (1999).  Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.). 221-232.
Chandrasekaran, K.., Karp R. M., Moreno-Centeno E.., & Vempala S.. (2011).  Algorithms for Implicit Hitting Set Problems. 614-629.
Karp, R. M., & Shamir R. (1998).  Algorithms for Optical Mapping. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 117-124.
Karp, R. M., & Shamir R. (2000).  Algorithms for Optical Mapping.
Grigoriev, D. Yu., & Karpinski M. (1991).  Algorithms for Sparse Rational Interpolation.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multi-Protein Modularity Conserved During Evolution.