Randomized Parameterized Algorithms

Randomized Parameterized Algorithms is a class of parameterized algorithms that employ randomness as a computational resource to achieve expected or bounded runtime complexity with respect to a problem's parameter, distinguishing it from deterministic parameterized algorithms by its probabilistic decision-making process.

24

Publications

936

Citations

56

Authors

46

Institutions

Publications per year

2017–2026

4

Authors

56

  1. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    5 publications · 195 citations

    5

    h-index

  2. FV
    Fedor V. Fomin

    University of Bergen, Norway

    4 publications · 120 citations

    4

    h-index

  3. DL
    Daniel Lokshtanov

    University of Bergen, Norway

    4 publications · 122 citations

    4

    h-index

  4. PA
    Petr A. Golovach

    University of Bergen, Norway

    2 publications · 56 citations

    2

    h-index

  5. FN
    Frank Neumann

    The University of Adelaide, Australia

    2 publications · 99 citations

    2

    h-index

1–5 of 56

Venues

  1. Algorithmica

    5 publications · 225 citations

    5

    h-index

  2. Theoretical Computer Science

    4 publications · 188 citations

    4

    h-index

  3. SIAM Journal on Computing

    2 publications · 83 citations

    2

    h-index

  4. Journal of Computer and System Sciences

    1 publications · 80 citations

    1

    h-index

  5. Mathematical Social Sciences

    1 publications · 14 citations

    1

    h-index

1–5