Résultat(s) 11 - 20 résultats de 85 pour la requête '"Analysis of algorithms and problem complexity."', Temps de recherche: 0,02s Affiner les résultats
  1. 11

    An analysis of BGP convergence properties. par Griffin, Timothy G.

    Article

    An analysis of BGP convergence properties.
  2. 12

    Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay. par Ramabhadran, Sriram

    Article

    Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay.
  3. 13

    Making intra-domain routing robust to changing and uncertain traffic demands understanding fundamental tradeoffs. par Applegate, David

    Article

    Making intra-domain routing robust to changing and uncertain traffic demands understanding fundamental tradeoffs.
  4. 14

    An in-place sorting with O(nlog n) comparisons and O(n) moves. par Franceschini, Gianni

    Publié dans Journal of the ACM
    Article

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  5. 15

    Asymmetric k-center is log* n-hard to approximate. par Chuzhoy, Julia

    Publié dans Journal of the ACM
    Article

    Asymmetric k-center is log* n-hard to approximate.
  6. 16

    Boosting textual compression in optimal linear time. par Ferragina, Paolo

    Publié dans Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  7. 17

    Edge-disjoint routing in plane switch graphs in linear time. par Hochstein, J.M

    Publié dans Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  8. 18

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

    Publié dans Journal of the ACM
    Article

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

    Complexity estimates depending on condition and round-off error. par Cucker, Felipe

    Publié dans Journal of the ACM
    Article

    Complexity estimates depending on condition and round-off error.
  10. 20

    Probabilistic checking of proofs a new characterization of NP. par Arora, Sanjeev

    Publié dans Journal of the ACM
    Article

    Probabilistic checking of proofs a new characterization of NP.

Outils de recherche: