Showing 121 - 130 results of 394 for search 'Journal of algorithms.', query time: 0.01s Refine Results
  1. 121

    Lower bounds on the bounded coefficient complexity of bilinear maps. by Bürgisser, Peter

    Published in Journal of the ACM
    Article

    Lower bounds on the bounded coefficient complexity of bilinear maps.
  2. 122

    On clusterings good, bad and spectral. by Kannan, Ravi

    Published in Journal of the ACM
    Article

    On clusterings good, bad and spectral.
  3. 123

    A primal-dual schema based approximation algorithm for the element connectivity problem. by Jain, Kamal

    Published in Journal of algorithms.
    Article

    A primal-dual schema based approximation algorithm for the element connectivity problem.
  4. 124

    Fast deterministic consensus in a noisy environment. by Aspnes, James

    Published in Journal of algorithms.
    Article

    Fast deterministic consensus in a noisy environment.
  5. 125

    On the complexity of bicoloring clique hypergraphs of graphs. by Kratochvil, Jan

    Published in Journal of algorithms.
    Article

    On the complexity of bicoloring clique hypergraphs of graphs.
  6. 126

    Simpler and faster biconnectivity augmentation. by Hsu, Tsan-sheng

    Published in Journal of algorithms.
    Article

    Simpler and faster biconnectivity augmentation.
  7. 127

    Coloring k-colorable graphs using relatively small palettes. by Halperin, Eran

    Published in Journal of algorithms.
    Article

    Coloring k-colorable graphs using relatively small palettes.
  8. 128

    Computing left Kan extensions. by Bush, M. R.

    Article

    Computing left Kan extensions.
  9. 129

    Constructive recognition of classical groups in their natural representation. by Brooksbank, Peter A.

    Article

    Constructive recognition of classical groups in their natural representation.
  10. 130

    Counting Points on Curves over Finite Fields. by Huang, Ming-Deh

    Article

    Counting Points on Curves over Finite Fields.

Search Tools: