Publications

Found 4228 results
[ Author(Asc)] Title 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 
K
Kay, P., & Webster M. A. (2005).  Variations in Color Naming Within and Across Populations. Behavioral and Brain Sciences. 28(4), 512-513.
Kay, P. (2009).  If a Canoe Can Be Carved from Every Log Why Can't a Log Be Carved into Every Canoe?.
Kay, P., & Sag I. A. (2012).  Discontinuous Dependencies and Complex Determiners.
Kay, P., & Michaelis L.. (2008).  Constructional Meaning and Compositionality.
Kay, P. (2004).  Pragmatic Aspects of Grammatical Constructions.
Kay, P., & Regier T. (2003).  Resolving the Question of Color Naming Universals. Proceedings of the National Academy of Sciences of the United States of America. 100(15), 9085-9089.
Kay, P., & Sag I. A. (2012).  Discontinuous Dependencies and Complex Determiners.
Kay, P. (2004).  Color Categories Are Not Arbitrary. Journal of Cross-Cultural Research.
Kay, P. (2014).  Unary Phrase Structure Rules and the Cognitive Linguistics Lexical Linking Theory. Theoretical Linguistics. 40(1-2), 
Kay, P., & Michaelis L.. (2009).  The Meaning of Constructions.
Kay, R. (2018).  ICSI 30th Anniversary. 30 Years of Innovation: ICSI 30th Anniversary Celebration.
Kay, P., & Regier T. (2006).  Language, Thought, and Color: Recent Developments. Trends in Cognitive Sciences. 10(2), 51-54.
Katz, R. H., Porter G. Manning, Shenker S. J., Stoica I., & Tsai M. (2005).  COPS: Quality of Service Vs. Any Service at All. Proceedings of the 13th International Workshop on Quality of Service 2005 (IWQoS 2005). 3-15.
Katti, S., Katabi D., Blake C.., Kohler E., & Strauss J.. (2004).  MultiQ: Automated Detection of Multiple Bottlenexk Capacities Along a Path. Proceedings of the 2004 Internet Measurement Conference (IMC 2004). 245-250.
Katabi, D., Handley M., & Rohrs C. (2002).  Internet Congestion Control for High Bandwidth-Delay Product Environments. Proceedings of ACM SIGCOMM 2002.
Karpinski, M., Larmore L. L., & Rytter W. (1996).  Correctness of Constructing Optimal Alphabetic Trees Revisited.
Karpinski, M., & Zelikovsky A. (1995).  New Approximation Algorithms for the Steiner Tree Problems.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karpinski, M., & Rytter W. (1993).  An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns.
Karpinski, M., & Shparlinski I. (1994).  Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Karpinski, M., & Rytter W. (1993).  On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Karpinski, M., & Werther T. (1991).  VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions.
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.

Pages