Отображение 61 - 70 результаты of 137 для поиска '"Mathematics of computing."', время запроса: 0.03сек. Отмена результатов
  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.

Инструменты поиска: