Parallel Search On Shared Memory

Parallel Search On Shared Memory is a computational framework within the domain of parallel algorithms that enables concurrent access to a common memory space by multiple processing units to accelerate the search process through coordinated exploration of shared data structures.

22

Publications

636

Citations

59

Authors

37

Institutions

Publications per year

2017–2026

1

Authors

59

  1. MS
    Marc Snir

    University of Illinois Urbana-Champaign, United States

    2 publications · 122 citations

    2

    h-index

  2. MF
    Martı́n Farach-Colton

    Rutgers, The State University of New Jersey, United States

    1 publications · 16 citations

    1

    h-index

  3. TM
    Thorsten Meinl

    University of Konstanz, Germany

    1 publications · 16 citations

    1

    h-index

  4. DP
    Daniele Paolo Scarpazza

    IBM Research - Thomas J. Watson Research Center, United States

    1 publications · 57 citations

    1

    h-index

  5. DR
    David R. Mathog

    University of California, San Francisco, United States

    1 publications · 74 citations

    1

    h-index

1–5 of 59

Venues

  1. Computer

    2 publications · 80 citations

    2

    h-index

  2. 1

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 1 publications · 11 citations

    1

    h-index

  4. RWTH Publications (RWTH Aachen)

    Repository · 1 publications · 18 citations

    1

    h-index

  5. 1

    h-index

1–5