PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Zhao, Jianjun"

Author of the publication

copydeleteadd this publication to your clipboard
Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR.

, , and . Parallel Processing Letters, 12 (3-4): 365-374 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jiachen Zhao University of Stuttgart

Zhibin Zhao University of Stuttgart

Jianyu Zhao University of Stuttgart

 

Other publications of authors with the same name

Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR., , and . Parallel Processing Letters, 12 (3-4): 365-374 (2002)Change impact analysis to support architectural evolution., , , and . Journal of Software Maintenance, 14 (5): 317-333 (2002)Estimating human body segment parameters using motion capture data., , , and . IUCS, page 243-249. IEEE, (2010)2nd Asian Workshop on Aspect-Oriented Software Development (AOAsia)., , , , , , and . ASE, page 375. IEEE Computer Society, (2006)Automated batch processing of mass remote sensing and geospatial data to meet the needs of end users., , and . IGARSS, page 3464-3467. IEEE, (2011)On Identifying Bug Patterns in Aspect-Oriented Programs., and . COMPSAC (1), page 431-438. IEEE Computer Society, (2007)Dependence Analysis of Java Bytecode.. COMPSAC, page 486-491. IEEE Computer Society, (2000)Program dependence analysis of concurrent logic programs and its applications., , and . ICPADS, page 282-291. IEEE Computer Society, (1996)Appendix: Workshop and Tutorial Abstracts., and . ICSR, volume 5030 of Lecture Notes in Computer Science, page 390-399. Springer, (2008)Incremental call graph reanalysis for AspectJ software., , and . ICSM, page 306-315. IEEE Computer Society, (2009)