Publications

Found 1144 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
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.
Zaslavsky, N., Kemp C., Tishby N., & Regier T. (2019).  Communicative need in colour naming. Cognitive Neuropsychology.
Kirkpatrick, B., Reshef Y., Finucane H., Jiang H., Zhu B., & Karp R. M. (2012).  Comparing Pedigree Graphs. Journal of Computational Biology. 19(9), 998-1014.
Kirkpatrick, B., Reshef Y., Finucane H., Jiang H., Zhu B., & Karp R. M. (2012).  Comparing Pedigree Graphs. Journal of Computational Biology. 19(9), 998-1014.
Narayanan, M.., & Karp R. M. (2007).  Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. Journal of Computational Biology. 14(7), 892-907.
Zhang, H., & Knightly E. W. (1994).  Comparison of Rate-Controlled Static Priority and Stop-and-Go.
Kääriäinen, M., & Langford J. (2005).  A Comparison of Tight Generalization Error Bounds. Proceedings of the 22nd International Conference on Machine Learning (ICML 2005). 409-416.
Hermansky, H., Bayya A., Morgan N., & Kohn P. (1991).  Compensation for the effect of the communication channel in Perceptual Linear Predictive (PLP) analysis of speech. Proceedings of the Second European Conference on Speech Communication and Technology (Eurospeech '91). 1367-1370.
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.
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.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Karp, R. M. (1986).  The complexity of parallel computation. Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI.
Karp, R. M. (1985).  The complexity of parallel computation. Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing. 1.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
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.

Pages