يعرض 61 - 70 نتائج من 137 نتيجة بحث عن '"Mathematics of computing."', وقت الاستعلام: 0.02s تنقيح النتائج
  1. 61

    A cooperative uplink power control scheme for elastic data services in wireless CDMA systems. حسب Alyfantis, George

    الحاوية / القاعدة Computer communication review.
    مقال

    A cooperative uplink power control scheme for elastic data services in wireless CDMA systems.
  2. 62

    Asymmetric k-center is log* n-hard to approximate. حسب Chuzhoy, Julia

    الحاوية / القاعدة Journal of the ACM
    مقال

    Asymmetric k-center is log* n-hard to approximate.
  3. 63

    Boosting textual compression in optimal linear time. حسب Ferragina, Paolo

    الحاوية / القاعدة Journal of the ACM
    مقال

    Boosting textual compression in optimal linear time.
  4. 64

    Edge-disjoint routing in plane switch graphs in linear time. حسب Hochstein, J.M

    الحاوية / القاعدة Journal of the ACM
    مقال

    Edge-disjoint routing in plane switch graphs in linear time.
  5. 65

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. حسب Jerrum, Mark

    الحاوية / القاعدة Journal of the ACM
    مقال

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
  6. 66

    Complexity estimates depending on condition and round-off error. حسب Cucker, Felipe

    الحاوية / القاعدة Journal of the ACM
    مقال

    Complexity estimates depending on condition and round-off error.
  7. 67

    Explicit OR-dispersers with polylogarithmic degree. حسب Saks, Michael

    الحاوية / القاعدة Journal of the ACM
    مقال

    Explicit OR-dispersers with polylogarithmic degree.
  8. 68

    A new general derandomization method. حسب Andreev, Alexander E.

    الحاوية / القاعدة Journal of the ACM
    مقال

    A new general derandomization method.
  9. 69

    Corrigendum Reasoning about knowledge and probability?. حسب Fagin, Ronald

    الحاوية / القاعدة Journal of the ACM
    مقال

    Corrigendum Reasoning about knowledge and probability?.
  10. 70

    Sparsification-a technique for speeding up dynamic graph algorithms. حسب Eppstein, David

    الحاوية / القاعدة Journal of the ACM
    مقال

    Sparsification-a technique for speeding up dynamic graph algorithms.

أدوات البحث: