Publications

Found 1117 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Technical Report
Kannan, J. Kumar, Caesar M., Stoica I., & Shenker S. (2007).  On the Consistency of DHT-Based Routing.
Renals, S., Morgan N., Bourlard H., Cohen M., Franco H., Wooters C., et al. (1991).  Connectionist Speech Recognition: Status and Prospects.
Kohn, P. (1991).  Connectionist Layered Object-Oriented Network Simulator (CLONES): User's Manual.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Kramer, O. (2010).  Computational Intelligence and Sustainable Energy: Case Studies and Applications.
Ehrenfeucht, A., & Karpinski M. (1990).  The Computational Complexity of (XOR, AND)-Counting Problems.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1991).  Computational Complexity of Sparse Rational Interpolation.
Dahlhaus, E., & Karpinski M. (1994).  On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs.
Hellerstein, L., & Karpinski M. (1991).  Computational Complexity of Learning Read-Once Formulas over Different Bases.
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Berman, P., Karpinski M., Larmore L. L., Plandowski W., & Rytter W. (1996).  The Complexity of Two-Dimensional Compressed Pattern Matching.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
El-Yaniv, R., Fiat A., Karp R. M., & Turpin G. (1992).  Competitive Analysis of Financial Games.
Zhang, H., & Knightly E. W. (1994).  Comparison of Rate-Controlled Static Priority and Stop-and-Go.
Krämer, B., & Wegner L. (1997).  Collaboration Support in Networked Distance Learning.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Asanović, K., Beck J., Callahan T. J., Feldman J., Irissou B., Kingsbury B., et al. (1993).  CNS-1 Architecture Specification: A Connectionist Network Supercomputer.
Hölldobler, S., & Kurfess F. (1991).  CHCL--A Connectionist Inference System.
Bell, O., Allman M., & Kuperman B. (2012).  On Browser-Level Event Logging.
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Vallina-Rodriguez, N., Sundaresan S., Kreibich C., Weaver N., & Paxson V. (2014).  Beyond the Radio: Illuminating the Higher Layers of Mobile Networks.
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.

Pages