Publications

Found 4258 results
Author Title [ Type(Desc)] Year
Technical Report
Hodgkinson, L., & Karp R. M. (2011).  Algorithms to Detect Multi-Protein Modularity Conserved During Evolution.
Müller, S. M. (1993).  All-to-All Broadcast on the CNS-1.
Karpinski, M., & Rytter W. (1993).  An Alphabet-Independent Optimal Parallel Search for Three Dimensional Patterns.
Richter, D. (1992).  Ambiguities in Object Specifications in View of Data Testing.
Nakamura, T., & Berlekamp E. (2002).  Analysis of Composite Corridors.
Luby, M., Mitzenmacher M., M. Shokrollahi A., & Spielman D. A. (1997).  Analysis of Low Density Codes and Improved Designs Using Irregular Graphs.
Luby, M., Mitzenmacher M., & M. Shokrollahi A. (1997).  Analysis of Random Processes via And-Or Tree Evaluation.
Stoutamire, D., Zimmermann W., & Trapp M. (1996).  An Analysis of the Divergence of Two Sather Dialects.
Govindan, R., & Radoslavov P. (2002).  An Analysis of The Internal Structure of Large Autonomous Systems.
Eklund, R., Bates R., Kuyper C., Willingham E., & Shriberg E. (2006).  The Annotation and Analysis of Importance in Meetings.
Kushilevitz, E., Micali S., & Ostrovsky R. (1993).  Any Non-Private Boolean Function Is Complete For Private Multi-Party Computations.
Kaiser, M. (1993).  An Application of a Neural Net for Fuzzy Abductive Reasoning.
Haban, D., & Shin K. G. (1989).  Application of Real-Time Monitoring to Scheduling Tasks with Random.
Hirsch, M. D. (1990).  Applications of Topology to Lower Bound Estimates in Computer Science.
Ma, K. W. (1995).  Applying Large Vocabulary Hybrid HMM-MLP Methods to Telephone Recognition of Digits and Natural Numbers.
Feldman, J., Ballard D. Harry, & Brown C. M. (1977).  An Approach to Knowledge-Directed Image Analysis.
Berman, P., Fößmeier U., Karpinski M., Kaufmann M., & Zelikovsky A. (1994).  Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
Pan, V. (1992).  Approximate Evaluation of a Polynomial on a Set of Real Points.
Heun, V. (1998).  Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Henzinger, M. Rauch (1994).  Approximating Minimum Cuts Under Insertion.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].

Pages