Period of time： 2004年1期
Publisher： Academic Press
Founded in： 1980
Total resources： 32
ISSN： 0196-6774
Subject： O Mathematical Sciences and Chemical
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 Algorithms,volume 29,issue 1
Menu
The
By Borchers A.,Du D-Z.,Gao B.,Wan P. in (1998)
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.
Access to resources
Recommend
On the Comparison Complexity of the String Prefix-Matching Problem
By Breslauer D.,Colussi L.,Toniolo L. in (1998)
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.All-Pairs Min-Cut in Sparse Networks
By Arikati S.R.,Chaudhuri S.,Zaroliagis C.D. in (1998)
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.By Kearney P.E.,Corneil D.G. in (1998)
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Optimal Constructions of Hybrid Algorithms
By Kao M-Y.,Ma Y.,Sipser M.,Yin Y. in (1998)
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Approximating Clique and Biclique Problems
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.Papers to Appear in Forthcoming Issues
Journal of Algorithms,volume 29,issue 1 , Vol. 29, Iss. 1, 1998-10 , pp.