Dangos 11 - 20 canlyniadau o 85 ar gyfer chwilio '"Analysis of algorithms and problem complexity."', amser ymholiad: 0.02e Mireinio'r Canlyniadau
  1. 11

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

    Erthygl

    An analysis of BGP convergence properties.
  2. 12

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

    Erthygl

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

    Erthygl

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Boosting textual compression in optimal linear time.
  7. 17

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Probabilistic checking of proofs a new characterization of NP.

Offerynnau Chwilio: