Publications

Found 1117 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Technical Report
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1992).  Read-Once Threshold Formulas, Justifying Assignments, and Generic Tranformations.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1991).  RASTA-PLP Speech Analysis.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1991).  RASTA-PLP Speech Analysis.
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Grigoriev, D. Yu., & Karpinski M. (1996).  Randomized ?(n^2) Lower Bound for Knapsack.
Gasieniec, L., Karpinski M., Plandowski W., & Rytter W. (1996).  Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1992).  On Randomized Algebraic Test Complexity.
Banerjea, A., & Keshav S. (1992).  Queueing Delays in Rate Controlled Networks.
Kalfa, W. (1992).  Proposal of an External Processor Scheduling in Micro-Kernel Based Operating Systems.
Kohler, E., Chen B., M. Kaashoek F., Morris R., & Poletto M. (2000).  Programming Language Techniques for Modular Router Configurations.
Kohler, E., Chen B., M. Kaashoek F., Morris R., & Poletto M. (2000).  Programming Language Techniques for Modular Router Configurations.
Blum, M. E., & Kannan S. (1988).  Program Correctness Checking and the Design of Programs That Check Their Work.
Kannan, S. (1989).  Program Checkers for Algebraic Problems (Thesis).
Kannan, S. (1989).  Program Checkers for Algebraic Problems.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Ablayev, F., & Karpinski M. (1995).  On the Power of Randomized Branching Programs.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the Power of Randomization in Online Algorithms.
Kurfess, F. (1991).  Potentiality of Parallelism in Logic.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Arora, S., Karger D. R., & Karpinski M. (1995).  Polynomial Time Approximation Schemes for Dense Instances of $NP$-HardProblems.
Arora, S., Karger D. R., & Karpinski M. (1995).  Polynomial Time Approximation Schemes for Dense Instances of $NP$-HardProblems.
W. de la Vega, F., & Karpinski M. (1997).  Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT.
Karpinski, M., & Macintyre A. (1995).  Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks.

Pages