Prof. Biing-Feng Wang's Publications

A. International Journals
  1. B. F. Wang, G. H. Chen, and F. C. Lin (1990), "Constant time sorting on processor arrays with reconfigurable bus systems," Information Processing Letters, vol. 34, no. 4, pp. 187-192.
  2. B. F. Wang and G. H. Chen (1990), "Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500-507.
  3. B. F. Wang and G. H. Chen (1990), "Two-Dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model," Information Processing Letters, vol. 36, no. 1, pp. 31-36.
  4. B. F. Wang and G. H. Chen (1991), "Cost-optimal parallel algorithms for constructing 2-3 trees," Journal of Parallel and Distributed Computing, vol. 11, no. 3, pp. 257-261.
  5. B. F. Wang, C. L. Chen, and G. H. Chen (1991), "A simple approach to implementing multiplication with small tables," Information Processing Letters, vol. 37, no. 6, pp. 327-329.
  6. G. H. Chen, B. F. Wang, and C. J. Lu (1992), "On the parallel computation of the algebraic path problem," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 2, pp. 251-256.
  7. B. F. Wang, G. H. Chen, and K. Park (1993), "On the set LCS and set-set LCS problems," Journal of Algorithms, vol. 14, pp. 466-477.
  8. G. H. Chen, B. F. Wang, and H. Li (1993), "Deriving algorithms on reconfigurable networks based on function decomposition," Theoretical Computer Science, vol. 120, pp. 215-227.
  9. G. H. Chen and B. F. Wang (1993), "Sorting and computing convex hulls on processor arrays with reconfigurable bus systems," Information Sciences, vol. 71, no. 3, pp. 191-206.
  10. G. H. Chen and B. F. Wang (199?), "Cost-optimal parallel algorithms for constructing B-trees," Information Sciences, to appear.
  11. G. H. Chen, S. Olariu, J. L., B. F. Wang, and J. Zhang (199?), "Constant time tree algorithms," Journal of Parallel and Distributed Computing, to appear.
B. Conference Papers
  1. B. F. Wang, C. J. Lu, and G. H. Chen (1990), "Constant time algorithms for the transitive closure problem and its applications," Proceedings of the 1990 International Conference on Parallel Processing, vol. III, Chicago, Illinois, U.S.A., pp. 52-59.
  2. B. F. Wang and G. H. Chen (1990), "An O(1) time algorithm for generating computation tree forms," Proceedings of the 1990 International Computer Symposium, vol. 2, Hsinchu, Taiwan, pp. 465-470.
  3. B. F. Wang and G. H. Chen (1990), "Constant time algorithms for sorting and computing convex hulls," Proceedings of the 1990 International Computer Symposium, vol. 2, Hsinchu, Taiwan, pp. 607-612.
  4. B. F. Wang, G. H. Chen, and H. Li (1990), "Configurational computation on processor arrays with reconfigurable bus systems," Proceedings of the First Workshop on Parallel Processing, Hsinchu, Taiwan, pp. 96-105.
  5. B. F. Wang, G. H. Chen, and H. Li (1991), "Configurational computation: a new computation method on processor arrays with reconfigurable bus systems," Proceedings of the 1991 International Conference on Parallel Processing, vol. III, Chicago, Illinois, U.S.A., pp. 42-49.
  6. B. F. Wang, G. H. Chen, and C. C. Hsu (1991), "Bitonic sort with an arbitrary number of keys," Proceedings of the 1991 International Conference on Parallel Processing, vol. III, Chicago, Illinois, U.S.A., pp. 58-61.
  7. B. F. Wang, G. H. Chen, and M. S. Yu (1991), "Cost-optimal parallel algorithms for constructing B-trees," Proceedings of the 1991 International Conference on Parallel Processing, vol. III, Chicago, Illinois, U.S.A., pp. 294-295.
  8. B. F. Wang, G. H. Chen, and H. Li (1991), "Fast algorithms for some arithmetic and logic operations," Proceedings of the 1991 National Computer Symposium, vol. 1, Chung-Li, Taiwan, pp. 178-183.
  9. D. J. Shyu, B. F. Wang, and C. Y. Tang (1994), "Fast algorithms for simulating the CRCW shared-memory computer on reconfigurable meshes," Proceedings of the 1994 International Conference on Parallel Processing, vol. III, Chicago, Illinois, U.S.A., pp. 143-146.
  10. D. J. Shyu, B. F. Wang, and C. Y. Tang (1994), "An Efficient emulation for tree-connected networks," Proceedings of the 1994 International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan, to appear.