Showing 11 - 20 results of 85 for search '"Analysis of algorithms and problem complexity."', सवाल का समय: 0.02सेकंड परिणाम को परिष्कृत करें
  1. 11

    An analysis of BGP convergence properties. द्वारा Griffin, Timothy G.

    में प्रकाशित Computer communication review.
    लेख

    An analysis of BGP convergence properties.
  2. 12

    Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay. द्वारा Ramabhadran, Sriram

    में प्रकाशित Computer communication review.
    लेख

    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. द्वारा Applegate, David

    में प्रकाशित Computer communication review.
    लेख

    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. द्वारा Franceschini, Gianni

    में प्रकाशित Journal of the ACM
    लेख

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

    Asymmetric k-center is log* n-hard to approximate. द्वारा Chuzhoy, Julia

    में प्रकाशित Journal of the ACM
    लेख

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

    Boosting textual compression in optimal linear time. द्वारा Ferragina, Paolo

    में प्रकाशित Journal of the ACM
    लेख

    Boosting textual compression in optimal linear time.
  7. 17

    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.
  8. 18

    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.
  9. 19

    Complexity estimates depending on condition and round-off error. द्वारा Cucker, Felipe

    में प्रकाशित Journal of the ACM
    लेख

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

    Probabilistic checking of proofs a new characterization of NP. द्वारा Arora, Sanjeev

    में प्रकाशित Journal of the ACM
    लेख

    Probabilistic checking of proofs a new characterization of NP.

खोज साधन: