Mostra 11 - 20 risultati di 85 ricerca '"Analysis of Algorithms and Problem Complexity."', tempo di risposta: 0,02s Raffina i risultati
  1. 11

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

    Articolo

    An analysis of BGP convergence properties.
  2. 12

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

    Articolo

    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. di Applegate, David

    Articolo

    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. di Franceschini, Gianni

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

    Boosting textual compression in optimal linear time.
  7. 17

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

    Pubblicato in Journal of the ACM
    Articolo

    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. di Jerrum, Mark

    Pubblicato in Journal of the ACM
    Articolo

    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. di Cucker, Felipe

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

    Probabilistic checking of proofs a new characterization of NP.

Strumenti per la ricerca: