Publisher： Elsevier
Founded in： 1980
Total resources： 4
ISSN： 1570-8667
Subject： O1 Mathematics
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Discrete Algorithms
Menu
Access to resources
Recommend
Optimal gossiping in paths and cycles
By Lau F.C.M., Zhang S.H. in (2003)
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.Regular expression searching on compressed text
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.The suffix binary search tree and suffix AVL tree
By Irving R.W., Love L. in (2003)
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.Efficient text fingerprinting via Parikh mapping
By Amir A., Apostolico A., Landau G.M., Satta G. in (2003)
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.Applying an edit distance to the matching of tree ring sequences in dendrochronology
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.Two-pattern strings I-A recognition algorithm
By Franek F., Lu W., Smyth W.F. in (2003)
Journal of Discrete Algorithms , Vol. 1, Iss. 5, 2003-10 , pp.(k,+)-distance-hereditary graphs
By Cicerone S., Di Stefano G. in (2003)
Journal of Discrete Algorithms , Vol. 1, Iss. 3, 2003-06 , pp.The non-approximability of bicriteria network design problems
Journal of Discrete Algorithms , Vol. 1, Iss. 3, 2003-06 , pp.
Previous
Next