Publications

Found 1106 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is K  [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
Morris, R., Kohler E., Jannotti J., & M. Kaashoek F. (1999).  The Click Modular Router.
Levchenko, K., Pitsillidis A., Chachra N., Enright B., Felegyhazi M., Grier C., et al. (2011).  Click Trajectories: End-to-End Analysis of the Spam Value Chain. 431-446.
Levchenko, K., Pitsillidis A., Chachra N., Enright B., Felegyhazi M., Grier C., et al. (2011).  Click Trajectories: End-to-End Analysis of the Spam Value Chain. 431-446.
Xing, E. P., & Karp R. M. (2001).  CLIFF: Clustering of High-Dimensional Microarray Data via Iterative Feature Filtering Using Normalized Cuts. 17, S306-S315.
Popa, L., Yu M., Ko S.. Y., Ratnasamy S., & Stoica I. (2010).  CloudPolice: Taking Access Control out of the Network.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Hellerstein, L., Gibson G. A., Karp R. M., Katz R.. M., & Patterson D. (1994).  Coding techniques for handling failures in large disk arrays. Algorithmica. 12(2-3), 182-208.
Hellerstein, L., Gibson G. A., Karp R. M., Katz R.. M., & Patterson D. (1994).  Coding techniques for handling failures in large disk arrays. Algorithmica. 12(2-3), 182-208.
Krämer, B., & Wegner L. (1997).  Collaboration Support in Networked Distance Learning.
Kay, P. (2004).  Color Categories Are Not Arbitrary. Journal of Cross-Cultural Research.
Regier, T., & Kay P. (2004).  Color Naming and Sunlight. Psychological Science. 15, 288-289.
Regier, T., & Kay P. (2004).  Color Naming and Sunlight: Commentary on Lindsey and Brown. Psychological Science. 15(4), 289-290.
Regier, T., Kay P., & Khetarpal N. (2007).  Color Naming Is Near Optimal. 15.
Regier, T., Kay P., & Khetarpal N. (2007).  Color Naming Is Near Optimal. 15.
Hardy, J.., Frederick C.., Kay P., & Werner J.. (2005).  Color Naming Lens Aging and Grue: What the Optics of the Aging Eye Can Teach Us About Color Language. Psychological Science. 16(4), 321-327.
Regier, T., Kay P., & Khetarpal N. (2007).  Color Naming Reflects Optimal Partitions of Color Space. 104(4), 1436-1441.
Regier, T., Kay P., & Khetarpal N. (2007).  Color Naming Reflects Optimal Partitions of Color Space. 104(4), 1436-1441.
Kay, P., & Regier T. (2007).  Color Naming Universals: The Case of Berinmo. Cognition. 102(2), 289-298.
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Combinatorial Approach to Protein Docking with Flexible Side-Chains. Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00).
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M. (1986).  Combinatorics, Complexity and Stochastic Algorithms. Informatie. 28(9), 722-733.
Kitzelmann, E. (2011).  A Combined Analytical and Search-Based Approach for the Inductive Synthesis of Functional Programs. Künstliche Intelligenz. 25(2), 179-182.
Kotzias, P., Razaghpanah A., Amann J., Paterson K. G., Vallina-Rodriguez N., & Caballero J. (2018).  Coming of Age: A Longitudinal Study of TLS Deployment. Proceedings of IMC 18.

Pages