Publications

Found 361 results
[ Author(Asc)] Title 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 
K
Kay, P., & Sag I. A. (2012).  Discontinuous Dependencies and Complex Determiners.
Kay, P., & Michaelis L.. (2008).  Constructional Meaning and Compositionality.
Kay, P., Berlin B., Maffi L., Merrifield W. R., & Cook R. S. (2010).  World Color Survey.
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.
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., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Karpinski, M., & Werther T. (1991).  VC Dimension and Sampling Complexity of Learning Sparse Polynomials and Rational Functions.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Karpinski, M., & Rytter W. (1993).  An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.
Karpinski, M., & Zelikovsky A. (1995).  1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Karpinski, M., & Lhotzky B. (1991).  An (epsilon, delta)--Approximation Algorithm of the Number of Zeros for a Multilinear Polynomial over GF[q].
Karpinski, M., & Macintyre A. (1995).  VC Dimension of Sigmoidal and General Pfaffian Neural Networks.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karpinski, M., & Rytter W. (1993).  On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Karpinski, M., & Macintyre A. (1995).  Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks.

Pages