"Time Optimal n-Size Matching Parentheses and Binary Tree Decoding ..."

Limin Xiang, Kazuo Ushijima, Jianjun Zhao (2002)

> Home

Details and statistics

DOI: 10.1142/S0129626402001051

access: closed

type: Journal Article

metadata version: 2023-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ppl/XiangUZ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ppl/XiangUZ02
Limin Xiang, Kazuo Ushijima, Jianjun Zhao:
Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR. Parallel Process. Lett. 12(3-4): 365-374 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.