Dynamic Tries

Dynamic Tries is a dynamic data structure that extends the trie abstraction to support efficient insertions, deletions, and associative queries over variable-length keys in a mutable dataset.

9

Publications

931

Citations

20

Authors

16

Institutions

Publications per year

2017–2026

1

Authors

20

  1. JP
    Jakub Piskorski

    Joint Research Centre, Italy

    2 publications · 86 citations

    2

    h-index

  2. GN
    Günter Neumann

    German Research Centre for Artificial Intelligence, Germany

    2 publications · 86 citations

    2

    h-index

  3. SN
    Stefan Nilsson

    KTH Royal Institute of Technology, Sweden

    1 publications · 28 citations

    1

    h-index

  4. SM
    Samuel Montané Baños

    Universidad Autónoma de Baja California Sur, Mexico

    1 publications · 87 citations

    1

    h-index

  5. WD
    W. Doeringer

    IBM Research - Zurich, Switzerland

    1 publications · 167 citations

    1

    h-index

1–5 of 20

Venues

  1. Algorithmica

    2 publications · 51 citations

    2

    h-index

  2. Software Practice and Experience

    1 publications · 32 citations

    1

    h-index

  3. Computational Intelligence

    1 publications · 53 citations

    1

    h-index

  4. ACM Transactions on Computer Systems

    TOCS · 1 publications · 456 citations

    1

    h-index

  5. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 52 citations

    1

    h-index

1–5