Publications

Found 4258 results
Author [ Title(Asc)] 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 
A
Yuan, A., Luther K., Krause M., Vennix S. Isabel, Dow S. P., & Hartmann B. (2016).  Almost an expert: The effects of rubrics and expertise on perceived value of crowdsourced design critiques. Proceedings of the 19th ACM Conference on Computer-Supported Cooperative Work & Social Computing. 1005-1017.
Müller, S. M. (1993).  All-to-All Broadcast on the CNS-1.
Petruck, M. R. L., & Boas H. C. (2003).  All in a Day's Week. Proceedings of the Workshop on Frame Semantics.
Tsai, T.. J., & Stolcke A. (2015).  Aligning Meeting Recordings Via Adaptive Fingerprinting. 786-790.
Ferrandez, O.., Ellsworth M., Muñoz R., & Baker C. F. (2010).  Aligning FrameNet and WordNet Based on Semantic Neighborhoods. 310-314.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution. IEEE/ACM Transactions on Computational Biology and Bioinformatics.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multi-Protein Modularity Conserved During Evolution.
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multiprotein Modularity Conserved During Evolution.
Grigoriev, D. Yu., & Karpinski M. (1991).  Algorithms for Sparse Rational Interpolation.
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.
Chandrasekaran, K.., Karp R. M., Moreno-Centeno E.., & Vempala S.. (2011).  Algorithms for Implicit Hitting Set Problems. 614-629.
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.
Kirkpatrick, B., Finucane H., Reshef Y., & Karp R. M. (2010).  Algorithms for Comparing Pedigree Graphs.
Karp, R. M. (1980).  An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)*. 10(2), 143-152.
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).
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.
Feldman, J., & Rovner P. D. (1969).  An ALGOL-based Associative Language. Communications of the ACM. 12(8), 439-449.
Feldman, J., & Rovner P. D. (1971).  An ALGOL-based Associative Language.
Feldman, J., & Rovner P. D. (1968).  An ALGOL-based Associative Language.
Blum, L., Cucker F., Shub M., & Smale S. (1996).  Algebraic Settings for the Problem.
Guesgen, H. Werner, & Ladkin P. (1990).  An Algebraic Approach to General Boolean Constraint Problems.
Gittens, A.., Rothauge K.., Mahoney M., 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.
Feldman, J., Finkel R. A., Taylor R. H., Bolles R. C., & Paul R. P. (1974).  AL, A Programming System for Automation.
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.

Pages