Showing 891 - 900 results of 1,829 for search '"Algorithm."', זמן שאילתה: 0.02s Refine Results
  1. 891

    A faster parallel algorithm for k-connectivity. מאת Iwama, K.

    הוצא לאור ב Information processing letters.
    Article

    A faster parallel algorithm for k-connectivity.
  2. 892

    A tight lower bound for top-down skew heaps. מאת Schoenmakers, Berry

    הוצא לאור ב Information processing letters.
    Article

    A tight lower bound for top-down skew heaps.
  3. 893

    Revisiting a result of Ko. מאת Cintioli, Patrizio

    הוצא לאור ב Information processing letters.
    Article

    Revisiting a result of Ko.
  4. 894

    An approximation result for a duo-processor task scheduling problem. מאת Olmo, P. Dell

    הוצא לאור ב Information processing letters.
    Article

    An approximation result for a duo-processor task scheduling problem.
  5. 895

    Black-box polynomial resultants. מאת Encarnacion, Mark J.

    הוצא לאור ב Information processing letters.
    Article

    Black-box polynomial resultants.
  6. 896

    On approximating the memory-Constrained Module Allocation Problem. מאת Roupin, Frederic

    הוצא לאור ב Information processing letters.
    Article

    On approximating the memory-Constrained Module Allocation Problem.
  7. 897

    Dynamic suffix tree and two-dimensional texts management. מאת Choi, Y.

    הוצא לאור ב Information processing letters.
    Article

    Dynamic suffix tree and two-dimensional texts management.
  8. 898

    An approximation algorithm for clustering graphs with dominating diametral path. מאת Deogun, Jitender S.

    הוצא לאור ב Information processing letters.
    Article

    An approximation algorithm for clustering graphs with dominating diametral path.
  9. 899

    A faster linear systolic algorithm for recovering a longest common subsequence. מאת Lecroq, Thierry

    הוצא לאור ב Information processing letters.
    Article

    A faster linear systolic algorithm for recovering a longest common subsequence.
  10. 900

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs. מאת Mosca, Raffaele

    הוצא לאור ב Information processing letters.
    Article

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.

כלי חיפוש: