%0 Journal Article %1 journals/ppl/XiangUZ02 %A Xiang, Limin %A Ushijima, Kazuo %A Zhao, Jianjun %D 2002 %J Parallel Processing Letters %K dblp %N 3-4 %P 365-374 %T Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR. %U http://dblp.uni-trier.de/db/journals/ppl/ppl12.html#XiangUZ02 %V 12

@article{journals/ppl/XiangUZ02, added-at = {2003-06-24T00:00:00.000+0200}, author = {Xiang, Limin and Ushijima, Kazuo and Zhao, Jianjun}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/29e988a7beec34369b196614704b798b3/dblp}, ee = {http://dx.doi.org/10.1142/S0129626402001051}, interhash = {3fa85f9571890452abb7f40c4ad8a94c}, intrahash = {9e988a7beec34369b196614704b798b3}, journal = {Parallel Processing Letters}, keywords = {dblp}, number = {3-4}, pages = {365-374}, timestamp = {2016-02-02T07:42:26.000+0100}, title = {Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR.}, url = {http://dblp.uni-trier.de/db/journals/ppl/ppl12.html#XiangUZ02}, volume = 12, year = 2002 }