The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Biing-Feng Wang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
    Improved Algorithms for the Minmax Regret 1-Median Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:52-62 [Conf]
  2. Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
    The Conditional Location of a Median Path. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:494-503 [Conf]
  3. Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh
    Efficient Algorithms for the Ring Loading Problem with Demand Splitting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:517-526 [Conf]
  4. Tzu-Chin Lin, Biing-Feng Wang
    Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2002, pp:117-122 [Conf]
  5. Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
    An Efficient Emulation for Tree-Connected Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1994, pp:502-507 [Conf]
  6. Hong-Yi Yu, Biing-Feng Wang
    An Improved Algorithm for Finding k-centrums on Weighted Trees. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2002, pp:222-225 [Conf]
  7. Shan-Chyun Ku, Wei Kuan Shih, Biing-Feng Wang
    Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. [Citation Graph (0, 0)][DBLP]
    ICPP, 1997, pp:16-19 [Conf]
  8. Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
    Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:143-146 [Conf]
  9. Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu
    Bitonic Sort with an Arbitrary Number of Keys. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:58-61 [Conf]
  10. Biing-Feng Wang, Gen-Huey Chen, Hungwen Li
    Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:42-49 [Conf]
  11. Biing-Feng Wang, Gen-Huey Chen, M. S. Yu
    Cost-Optimal Parallel Algorithms for Constructing B-Trees. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:294-295 [Conf]
  12. Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu
    Parallel Algorithms for the Tree Bisector Problem and Applications. [Citation Graph (0, 0)][DBLP]
    ICPP, 1999, pp:192-199 [Conf]
  13. Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen
    Constant Time Algorithms for the Transitive Closure Problem and Its Applications. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1990, pp:52-59 [Conf]
  14. Shan-Chyun Ku, Biing-Feng Wang
    Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:370-374 [Conf]
  15. Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang
    The emulation problem on trees. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:251-0 [Conf]
  16. Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng
    Recognizing depth-first-search trees in parallel. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:101-105 [Conf]
  17. Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin
    Efficient Algorithms for Two Generalized 2-Median Problems on Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:768-778 [Conf]
  18. Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang
    Improved Algorithms for the Minmax-Regret 1-Center Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:537-546 [Conf]
  19. Biing-Feng Wang, Jyh-Jye Lin
    Finding a Two-Core of a Tree in Linear Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:467-478 [Conf]
  20. Biing-Feng Wang, Stephan Olariu
    On the Power of the Mesh with Hybrid Buses. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:172-178 [Conf]
  21. Biing-Feng Wang, Gen-Huey Chen
    Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:1, pp:31-36 [Journal]
  22. Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen
    A Simple Approach to Implementing Multiplication with Small Tables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:6, pp:327-329 [Journal]
  23. Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin
    Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:4, pp:187-192 [Journal]
  24. Hai-Lung Cheng, Biing-Feng Wang
    On Chen and Chen's new tree inclusion algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:1, pp:14-18 [Journal]
  25. Gen-Huey Chen, Biing-Feng Wang
    Sorting and computing convex hulls on processor arrays with reconfigurable bus systems. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1993, v:72, n:3, pp:191-206 [Journal]
  26. Biing-Feng Wang, Gen-Huey Chen
    Cost-Optimal Parallel Algorithms for Constructing B-Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1994, v:81, n:1-2, pp:55-72 [Journal]
  27. Biing-Feng Wang, Jiunn-Nan Tsai, Yuan-Cheng Chuang
    The Lowest Common Ancestor Problem on a Tree with an Unfixed Root. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:119, n:1-2, pp:125-130 [Journal]
  28. Biing-Feng Wang
    Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:90-108 [Journal]
  29. Biing-Feng Wang
    Linear time algorithms for the ring loading problem with demand splitting. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:45-57 [Journal]
  30. Biing-Feng Wang
    Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:345-358 [Journal]
  31. Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park
    On the Set LCS and Set-Set LCS Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:466-477 [Journal]
  32. Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku
    Efficient algorithms for the scaled indexing problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:82-100 [Journal]
  33. Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku
    Efficient algorithms for a constrained k-tree core problem in a tree network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:2, pp:107-124 [Journal]
  34. Gen-Huey Chen, Stephan Olariu, James L. Schwing, Biing-Feng Wang, Jingyuan Zhang
    Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:2, pp:137-150 [Journal]
  35. Shan-Chyun Ku, Biing-Feng Wang
    An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:2, pp:221-227 [Journal]
  36. Biing-Feng Wang, Gen-Huey Chen
    Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:11, n:3, pp:257-262 [Journal]
  37. Biing-Feng Wang
    Finding a 2-Core of a Tree in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:193-210 [Journal]
  38. Gen-Huey Chen, Biing-Feng Wang, Hungwen Li
    Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:120, n:2, pp:215-227 [Journal]
  39. Biing-Feng Wang
    Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:377-401 [Journal]
  40. Biing-Feng Wang
    Simulating the CRCW PRAM on Reconfigurable Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:231-242 [Journal]
  41. Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung
    Constructing Edge-Disjoint Spanning Trees in Product Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:3, pp:213-221 [Journal]
  42. Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu
    On the Parallel Computation of the Algebraic Path Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1992, v:3, n:2, pp:251-256 [Journal]
  43. Rong Lin, Stephan Olariu, James L. Schwing, Biing-Feng Wang
    The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:3, pp:266-280 [Journal]
  44. Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang
    Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:6, pp:559-570 [Journal]
  45. Biing-Feng Wang
    Finding r-Dominating Sets and p-Centers of Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2004, v:15, n:8, pp:687-698 [Journal]
  46. Biing-Feng Wang
    Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:2, pp:186-191 [Journal]
  47. Biing-Feng Wang, Gen-Huey Chen
    Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1990, v:1, n:4, pp:500-507 [Journal]
  48. Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shil
    Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:9, pp:888-898 [Journal]
  49. Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang
    A Faster Query Algorithm for the Text Fingerprinting Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:123-135 [Conf]

  50. Efficient Algorithms for the kSmallest Cuts Enumeration. [Citation Graph (, )][DBLP]


  51. Efficient Data Structures for the Orthogonal Range Successor Problem. [Citation Graph (, )][DBLP]


  52. Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. [Citation Graph (, )][DBLP]


  53. Improved Algorithms for the Gene Team Problem. [Citation Graph (, )][DBLP]


  54. Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. [Citation Graph (, )][DBLP]


  55. Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. [Citation Graph (, )][DBLP]


Search in 7.152secs, Finished in 7.155secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002