9 research outputs found

    A Parallel Dynamic Programming Algorithm for Unranking t-ary Trees

    No full text
    In this paper an O(n) parallel algorithm is presented for fast unranking t--ary trees with n internal nodes in Zaks' representation
    corecore