Publications

Found 4120 results
Author [ Title(Desc)] 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 
C
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
von Stengel, B., & Werchner R. (1995).  Complexity of Searching an Immobile Hider in a Graph.
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.
Cleve, R. (1990).  Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S..
Pan, H., Hindman B., & Asanović K. (2010).  Composing Parallel Software Efficiently with Lithe. 376-387.
Schryen, G. (2009).  A Comprehensive and Comparative Analysis of the Patching Behavior of Open Source and Closed Source Software Vendors. 153-168.
Hemmerling, A. (1996).  Computability of String Functions Over Algebraic Structures (Preliminary Version).
Egecioglu, O.., Smith T.. R., & Moody J. (1987).  Computable Functions and Complexity in Neural Networks.
M. Shokrollahi, A. (1996).  Computation of Irregular Primes up to Eight Million (Preliminary Report).
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Ellis, D. P. W. (1997).  Computational Auditory Scene Analysis Exploiting Speech-Recognition Knowledge. Proceedings of the IEEE Workshop on Applications of Signal Processing to Audio and Acoustics. 4.
Narayanan, S. (2005).  Computational Cognitive Semantics.
Goldreich, O., Ostrovsky R., & Petrank E. (1994).  Computational Complexity and Knowledge Complexity.
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.
Feldman, J. (1988).  Computational Constraints on Higher Neural Representations. Proceedings of the System Development Foundation Symposium on Computational Neuroscience.
Kramer, O. (2010).  Computational Intelligence and Sustainable Energy: Case Studies and Applications.
Amengual, A. (2009).  A computational model of attachment secure responses in the Strange Situation.
Chang, N. (2004).  A computational model of comprehension-based construction acquisition.

Pages