Works matching IS 01290541 AND DT 2016 AND VI 27 AND IP 5

Results: 8
    1
    2

    Parikh Matrices and Strong M-Equivalence.

    Published in:
    International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 545, doi. 10.1142/S0129054116500155
    By:
    • Teh, Wen Chean
    Publication type:
    Article
    3
    4

    Algorithms for Longest Common Abelian Factors.

    Published in:
    International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 529, doi. 10.1142/S0129054116500143
    By:
    • Alatabbi, Ali;
    • Iliopoulos, Costas S.;
    • Langiu, Alessio;
    • Rahman, M. Sohel
    Publication type:
    Article
    5

    Self-Stabilizing Prefix Tree Based Overlay Networks.

    Published in:
    International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 607, doi. 10.1142/S0129054116500192
    By:
    • Caron, Eddy;
    • Datta, Ajoy K.;
    • Petit, Franck;
    • Tedeschi, Cédric
    Publication type:
    Article
    6

    Secret Sharing Schemes from Linear Codes over.

    Published in:
    International Journal of Foundations of Computer Science, 2016, v. 27, n. 5, p. 595, doi. 10.1142/S0129054116500180
    By:
    • Wang, Xianfang;
    • Gao, Jian;
    • Fu, Fang-Wei
    Publication type:
    Article
    7
    8