Randomized Parallel Search

Randomized Parallel Search is a parallel search algorithm that incorporates probabilistic decision-making into the exploration of the solution space, distinguishing itself from deterministic variants by using randomness to guide the selection and evaluation of candidate solutions across concurrent processes.

7

Publications

393

Citations

13

Authors

7

Institutions

Publications per year

2017–2026

1

Authors

13

  1. YZ
    Yanjun Zhang

    The University of Queensland, Australia

    2 publications · 258 citations

    2

    h-index

  2. RM
    Richard M. Karp

    University of California, Berkeley, United States

    2 publications · 258 citations

    2

    h-index

  3. TŁ
    Tomasz Łuczak

    Adam Mickiewicz University in Poznań, Poland

    1 publications · 20 citations

    1

    h-index

  4. DB
    David B. Dahl

    Texas A&M University, United States

    1 publications · 50 citations

    1

    h-index

  5. SS
    Sandeep Sen

    Indian Institute of Technology Delhi, India

    1 publications · 30 citations

    1

    h-index

1–5 of 13

Venues

  1. Parallel Processing Letters

    1 publications · 13 citations

    1

    h-index

  2. Journal of Computational and Graphical Statistics

    JCGS · 1 publications · 50 citations

    1

    h-index

  3. Journal of Algorithms

    1 publications · 20 citations

    1

    h-index

  4. SIAM Journal on Computing

    1 publications · 30 citations

    1

    h-index

  5. Journal of Gambling Studies

    1 publications · 22 citations

    1

    h-index

1–5