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
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. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Blum, M. E., Karp R. M., Vornberger O.., Papadimitriou C. H., & Yannakakis M.. (1981).  The Complexity of Testing Whether a Graph is a Superconcentrator. 13(4-5), 164-167.
Berman, P., Karpinski M., Larmore L. L., Plandowski W., & Rytter W. (1996).  The Complexity of Two-Dimensional Compressed Pattern Matching.
Beame, P., Karp R. M., Pitassi T., & Saks M. (1998).  On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. 561-571.
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.
Karp, R. M. (1975).  On the Computational Complexity of Combinatorial Problems. Networks. 5,
Hellerstein, L., & Karpinski M. (1991).  Computational Complexity of Learning Read-Once Formulas over Different Bases.
Dahlhaus, E., & Karpinski M. (1994).  On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Ehrenfeucht, A., & Karpinski M. (1990).  The Computational Complexity of (XOR, AND)-Counting Problems.

Pages