HTTP/1.1 200 OK Connection: close Date: Thu, 09 Oct 2003 18:09:08 GMT Accept-Ranges: bytes Server: Netscape-Enterprise/3.6 Content-Length: 16244 Content-Type: text/html Last-Modified: Thu, 09 Oct 2003 09:06:27 GMT Cache-Last-Checked: Fri, 24 Oct 2003 03:46:53 GMT Client-Date: Fri, 24 Oct 2003 03:46:49 GMT Client-Response-Num: 1 Proxy-Agent: Netscape-Proxy/3.52 Title: DBLP: Biing-Feng Wang DBLP: Biing-Feng Wang dblp.uni-trier.de

Biing-Feng Wang

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM - CiteSeer - CSB - Google - HomePageSearch
2003
36EEShan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung: Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Transactions on Parallel and Distributed Systems 14(3): 213-221 (2003)
2002
35EEBiing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh: The Conditional Location of a Median Path. COCOON 2002: 494-503
34EETzu-Chin Lin, Biing-Feng Wang: Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. ICPADS 2002: 117-122
33EEHong-Yi Yu, Biing-Feng Wang: An Improved Algorithm for Finding k-centrums on Weighted Trees. ICPADS 2002: 222-225
32EEShan-Chyun Ku, Biing-Feng Wang: An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. Journal of Parallel and Distributed Computing 62(2): 221-227 (2002)
2001
31EEShan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin: Efficient Algorithms for Two Generalized 2-Median Problems on Trees. ISAAC 2001: 768-778
30EEBiing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shil: Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. IEEE Transactions on Parallel and Distributed Systems 12(9): 888-898 (2001)
2000
29EEBiing-Feng Wang, Jyh-Jye Lin: Finding a Two-Core of a Tree in Linear Time. ISAAC 2000: 467-478
28EEChen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang: Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. IEEE Transactions on Parallel and Distributed Systems 11(6): 559-570 (2000)
27 Biing-Feng Wang: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. J. Algorithms 34(1): 90-108 (2000)
26EEBiing-Feng Wang: Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. TCS 242(1-2): 377-401 (2000)
1999
25EEBiing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu: Parallel Algorithms for the Tree Bisector Problem and Applications. ICPP 1999: 192-199
24 Biing-Feng Wang, Jiunn-Nan Tsai, Yuan-Cheng Chuang: The Lowest Common Ancestor Problem on a Tree with an Unfixed Root. Information Sciences 119(1-2): 125-130 (1999)
1998
23EEShan-Chyun Ku, Biing-Feng Wang: Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. IPPS/SPDP 1998: 370-374
22EEBiing-Feng Wang: Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. IEEE Transactions on Parallel and Distributed Systems 9(2): 186-191 (1998)
21EEBiing-Feng Wang: Simulating the CRCW PRAM on Reconfigurable Networks. TCS 205(1-2): 231-242 (1998)
1997
20EEShan-Chyun Ku, Wei Kuan Shih, Biing-Feng Wang: Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. ICPP 1997: 16-19
19 Biing-Feng Wang: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. J. Algorithms 23(2): 345-358 (1997)
1995
18EEJia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng: Recognizing depth-first-search trees in parallel. IPPS 1995: 101-105
17EEDaw-Jong Shyu, Biing-Feng Wang, Chuan-Yi Tang: The emulation problem on trees. IPPS 1995: 251-
16 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. Journal of Parallel and Distributed Computing 26(2): 137-150 (1995)
1994
15 Daw-Jong Shyu, Biing-Feng Wang, Chuan-Yi Tang: An Efficient Emulation for Tree-Connected Networks. ICPADS 1994: 502-507
14 Daw-Jong Shyu, Biing-Feng Wang, Chuan-Yi Tang: Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. ICPP (3) 1994: 143-146
13 Biing-Feng Wang, Gen-Huey Chen: Cost-Optimal Parallel Algorithms for Constructing B-Trees. Information Sciences 81(1-2): 55-72 (1994)
1993
12 Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park: On the Set LCS and Set-Set LCS Problems. J. Algorithms 14(3): 466-477 (1993)
11 Gen-Huey Chen, Biing-Feng Wang, Hungwen Li: Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. TCS 120(2): 215-227 (1993)
1992
10EEGen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu: On the Parallel Computation of the Algebraic Path Problem. IEEE Transactions on Parallel and Distributed Systems 3(2): 251-256 (1992)
1991
9 Biing-Feng Wang, Gen-Huey Chen, M. S. Yu: Cost-Optimal Parallel Algorithms for Constructing B-Trees. ICPP (3) 1991: 294-295
8 Biing-Feng Wang, Gen-Huey Chen, Hungwen Li: Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. ICPP (3) 1991: 42-49
7 Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu: Bitonic Sort with an Arbitrary Number of Keys. ICPP (3) 1991: 58-61
6 Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen: A Simple Approach to Implementing Multiplication with Small Tables. Information Processing Letters 37(6): 327-329 (1991)
5 Biing-Feng Wang, Gen-Huey Chen: Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. Journal of Parallel and Distributed Computing 11(3): 257-262 (1991)
1990
4 Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen: Constant Time Algorithms for the Transitive Closure Problem and Its Applications. ICPP (3) 1990: 52-59
3EEBiing-Feng Wang, Gen-Huey Chen: 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 1(4): 500-507 (1990)
2 Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin: Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. Information Processing Letters 34(4): 187-192 (1990)
1 Biing-Feng Wang, Gen-Huey Chen: Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. Information Processing Letters 36(1): 31-36 (1990)

DBLP: [Home | Search: Author, Title | Conferences | Journals]
Michael Ley (ley@uni-trier.de) Thu Oct 9 03:19:44 2003