| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Biing-Feng Wang, Chung-Chin Kuo, Shang-Ju Liu, Chien-Hsin Lin |
A New Efficient Algorithm for the Gene-Team Problem on General Sequences.  |
IEEE/ACM Trans. Comput. Biology Bioinform.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen |
On the Round-Trip 1-Center and 1-Median Problems. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang |
Faster query algorithms for the text fingerprinting problem. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Chien-Hsin Lin |
Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang |
Improved data structures for the orthogonal range successor problem. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su |
Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jyh-Jye Lin, Chi-Yuan Chan, Biing-Feng Wang |
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang |
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo |
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang |
Efficient algorithms for two generalized 2-median problems and the group median problem on trees. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tzu-Chin Lin, Chung-Chin Kuo, Yong-Hsian Hsieh, Biing-Feng Wang |
Efficient algorithms for the inverse sorting problem with bound constraints under the l INFINITY -norm and the Hamming distance. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin |
Improved Algorithms for the Gene Team Problem. |
COCOA |
2009 |
DBLP DOI BibTeX RDF |
conserved gene clusters, gene teams, algorithms, bioinformatics, comparative genomics |
| 1 | Chih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang |
Efficient Data Structures for the Orthogonal Range Successor Problem. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
algorithms, data structures, indexes, range searching |
| 1 | Biing-Feng Wang, Tzu-Chin Lin, Chien-Hsin Lin, Shan-Chyun Ku |
Finding the conditional location of a median path on a tree. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang |
Improved algorithms for the minmax-regret 1-center and 1-median problems. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
minmax-regret optimization, trees, medians, Location theory, centers, general graphs |
| 1 | Yong-Hsian Hsieh, Chih-Chiang Yu, Biing-Feng Wang |
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2008 |
DBLP DOI BibTeX RDF |
geometrical problems and computations, algorithms, data structures, analysis of algorithms |
| 1 | Li-Pu Yeh, Biing-Feng Wang |
Efficient Algorithms for the kSmallest Cuts Enumeration. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hai-Lung Cheng, Biing-Feng Wang |
On Chen and Chen's new tree inclusion algorithm. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang |
A Faster Query Algorithm for the Text Fingerprinting Problem. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
Patricia trie, Fingerprints, Text indexing, Combinatorial algorithms on words |
| 1 | Chih-Chiang Yu, Yong-Hsian Hsieh, Biing-Feng Wang |
Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. |
FCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku |
Efficient algorithms for a constrained k-tree core problem in a tree network. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang |
Improved Algorithms for the Minmax Regret 1-Median Problem. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
minmax regret optimization, medians, Location theory |
| 1 | Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang |
Improved Algorithms for the Minmax-Regret 1-Center Problem. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
minmax-regret optimization, location theory, centers |
| 1 | Biing-Feng Wang |
Linear time algorithms for the ring loading problem with demand splitting. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Finding r-Dominating Sets and p-Centers of Trees in Parallel. |
IEEE Trans. Parallel Distrib. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku |
Efficient algorithms for the scaled indexing problem. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung |
Constructing Edge-Disjoint Spanning Trees in Product Networks. |
IEEE Trans. Parallel Distrib. Syst. |
2003 |
DBLP DOI BibTeX RDF |
Cartesian product networks, edge-disjoint trees, fault-tolerance, interconnection networks, embedding, spanning trees |
| 1 | Biing-Feng Wang, Yong-Hsian Hsieh, Li-Pu Yeh |
Efficient Algorithms for the Ring Loading Problem with Demand Splitting. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
disjoint-set data structures, algorithms, routing, Optical networks, rings |
| 1 | Shan-Chyun Ku, Biing-Feng Wang |
An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs. |
J. Parallel Distrib. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Finding a 2-Core of a Tree in Linear Time. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tzu-Chin Lin, Biing-Feng Wang |
Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees. |
ICPADS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Yi Yu, Biing-Feng Wang |
An Improved Algorithm for Finding k-centrums on Weighted Trees. |
ICPADS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh |
The Conditional Location of a Median Path. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi |
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems. |
IEEE Trans. Parallel Distrib. Syst. |
2001 |
DBLP DOI BibTeX RDF |
Parallel algorithms, trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique |
| 1 | Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin |
Efficient Algorithms for Two Generalized 2-Median Problems on Trees. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Chen-Hsing Peng, Biing-Feng Wang, Jia-Shung Wang |
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel. |
IEEE Trans. Parallel Distrib. Syst. |
2000 |
DBLP DOI BibTeX RDF |
Depth-first search trees, parallel algorithms, spanning trees, PRAM, the Euler-tour technique |
| 1 | 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 |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Jyh-Jye Lin |
Finding a Two-Core of a Tree in Linear Time. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rong Lin, Stephan Olariu, James L. Schwing, Biing-Feng Wang |
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. |
IEEE Trans. Parallel Distrib. Syst. |
1999 |
DBLP DOI BibTeX RDF |
mesh with hybrid buses, cost-optimal algorithms, pattern recognition, image processing, broadcasting, VLSI architectures, digital geometry, cellular systems |
| 1 | Biing-Feng Wang, Jiunn-Nan Tsai, Yuan-Cheng Chuang |
The Lowest Common Ancestor Problem on a Tree with an Unfixed Root. |
Inf. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Shan-Chyun Ku, Keng-Hua Shi, Ting-Kai Hung, Pei-Sen Liu |
Parallel Algorithms for the Tree Bisector Problem and Applications. (PDF / PS) |
ICPP |
1999 |
DBLP DOI BibTeX RDF |
Trees, EREW PRAM, location theory, bisectors, tree contraction, the Euler-tour technique |
| 1 | Biing-Feng Wang |
Simulating the CRCW PRAM on Reconfigurable Networks. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel. |
IEEE Trans. Parallel Distrib. Syst. |
1998 |
DBLP DOI BibTeX RDF |
Trees, cores, centers, tree contraction, the Euler-tour technique |
| 1 | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
Efficient Emulations for X-trees and /w-ary Trees. |
Parallel Algorithms Appl. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shan-Chyun Ku, Biing-Feng Wang |
Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network. (PDF / PS) |
IPPS/SPDP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang |
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shan-Chyun Ku, Wei Kuan Shih, Biing-Feng Wang |
Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network. (PDF / PS) |
ICPP |
1997 |
DBLP DOI BibTeX RDF |
Trees, cores, tree contraction, the Euler-tour technique |
| 1 | Biing-Feng Wang, Stephan Olariu |
On the Power of the Mesh with Hybrid Buses. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
Mesh with Hybrid Buses, Mesh with Multiple Broadcasting, simulation, parallel algorithms, PRAM, reconfigurable mesh |
| 1 | Biing-Feng Wang |
A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem. |
Parallel Processing Letters |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
J. Parallel Distrib. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng |
Recognizing depth-first-search trees in parallel. (PDF / PS) |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model |
| 1 | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
The emulation problem on trees. (PDF / PS) |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
emulation problem, optimal emulation, X-trees, m-ary trees, parallel algorithms, parallel algorithms, interconnection networks, multiprocessor interconnection networks, trees, pyramids |
| 1 | Biing-Feng Wang, Gen-Huey Chen |
Cost-Optimal Parallel Algorithms for Constructing B-Trees. |
Inf. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
An Efficient Emulation for Tree-Connected Networks. |
ICPADS |
1994 |
DBLP BibTeX RDF |
|
| 1 | Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang |
Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes. |
ICPP |
1994 |
DBLP BibTeX RDF |
|
| 1 | Gen-Huey Chen, Biing-Feng Wang, Hungwen Li |
Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Gen-Huey Chen, Biing-Feng Wang |
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems. |
Inf. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park |
On the Set LCS and Set-Set LCS Problems. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu |
On the Parallel Computation of the Algebraic Path Problem. |
IEEE Trans. Parallel Distrib. Syst. |
1992 |
DBLP DOI BibTeX RDF |
all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem |
| 1 | Biing-Feng Wang, Chuen-Liang Chen, Gen-Huey Chen |
A Simple Approach to Implementing Multiplication with Small Tables. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen |
Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees. |
J. Parallel Distrib. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen, M. S. Yu |
Cost-Optimal Parallel Algorithms for Constructing B-Trees. |
ICPP |
1991 |
DBLP BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen, Cheng-Chung Hsu |
Bitonic Sort with an Arbitrary Number of Keys. |
ICPP |
1991 |
DBLP BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen, Hungwen Li |
Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. |
ICPP |
1991 |
DBLP BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen |
Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin |
Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
IEEE Trans. Parallel Distrib. Syst. |
1990 |
DBLP DOI BibTeX RDF |
related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points |
| 1 | Biing-Feng Wang, Chi-Jen Lu, Gen-Huey Chen |
Constant Time Algorithms for the Transitive Closure Problem and Its Applications. |
ICPP |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")