Search Results - "randomized parallel algorithms"

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Cover Image

    Fast RNC and NC algorithms for maximal path sets by Uehara, Ryuhei, Chen, Zhi-Zhong, He, Xin

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 01.02.1999
    Published in Theoretical Computer Science (01.02.1999)
    “…We present two parallel algorithms for finding a maximal set of paths in a given undirected graph. One is randomized and runs in O( log n) expected time with…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms by MacKenzie, Philip D.

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1997
    Published in SIAM journal on computing (01.12.1997)
    “…The random-adversary technique is a general method for proving lower bounds on randomized parallel algorithms. The bounds apply to the number of communication…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: