Biing-Feng Wang

Chien-Hsin Lin

J. Comput. Syst. Sci., 2010

Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches.

[BibT_eX]

[DOI]

Jyh-Jye Lin

Chi-Yuan Chan

Discret. Appl. Math., 2010

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights.

[BibT_eX]

[DOI]

Li-Pu Yeh

Hsin-Hao Su

Algorithmica, 2010

Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.

[BibT_eX]

[DOI]

Chung-Chin Kuo

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Efficient algorithms for two generalized 2-median problems and the group median problem on trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Efficient algorithms for the inverse sorting problem with bound constraints under the l<sub>∞</sub>-norm and the Hamming distance.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Efficient Data Structures for the Orthogonal Range Successor Problem.

[BibT_eX]

[DOI]

Wing-Kai Hon

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Improved Algorithms for the Gene Team Problem.

[BibT_eX]

[DOI]

Shang-Ju Liu

Chien-Hsin Lin

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Improved algorithms for the minmax-regret 1-center and 1-median problems.

[BibT_eX]

[DOI]

Hung-I Yu

ACM Trans. Algorithms, 2008

Finding the conditional location of a median path on a tree.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Efficient Algorithms for the kSmallest Cuts Enumeration.

[BibT_eX]

[DOI]

Li-Pu Yeh

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

On Chen and Chen's new tree inclusion algorithm.

[BibT_eX]

[DOI]

Hai-Lung Cheng

Inf. Process. Lett., 2007

Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average.

[BibT_eX]

Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

A Faster Query Algorithm for the Text Fingerprinting Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Efficient algorithms for a constrained <i>k</i>-tree core problem in a tree network.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Improved Algorithms for the Minmax-Regret 1-Center Problem.

[BibT_eX]

[DOI]

Hung-I Yu

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Improved Algorithms for the Minmax Regret 1-Median Problem.

[BibT_eX]

[DOI]

Hung-I Yu

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Linear time algorithms for the ring loading problem with demand splitting.

[BibT_eX]

[DOI]

J. Algorithms, 2005

2004

Finding r-Dominating Sets and p-Centers of Trees in Parallel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2004

Efficient algorithms for the scaled indexing problem.

[BibT_eX]

[DOI]

Jyh-Jye Lin

J. Algorithms, 2004

2003

Constructing Edge-Disjoint Spanning Trees in Product Networks.

[BibT_eX]

[DOI]

Ting-Kai Hung

IEEE Trans. Parallel Distributed Syst., 2003

Efficient Algorithms for the Ring Loading Problem with Demand Splitting.

[BibT_eX]

[DOI]

Li-Pu Yeh

Proceedings of the Algorithms, 2003

2002

Finding a 2-Core of a Tree in Linear Time.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

An Optimal Simple Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2002

An Improved Algorithm for Finding k-centrums on Weighted Trees.

[BibT_eX]

[DOI]

Hong-Yi Yu

Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Parallel and Distributed Systems, 2002

The Conditional Location of a Median Path.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems.

[BibT_eX]

[DOI]

Keng-Hua Shi

IEEE Trans. Parallel Distributed Syst., 2001

Efficient Algorithms for Two Generalized 2-Median Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel.

[BibT_eX]

[DOI]

Chen-Hsing Peng

Jia-Shung Wang

IEEE Trans. Parallel Distributed Syst., 2000

Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Finding a Two-Core of a Tree in Linear Time.

[BibT_eX]

[DOI]

Jyh-Jye Lin

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1999

The Lowest Common Ancestor Problem on a Tree with an Unfixed Root.

[BibT_eX]

[DOI]

Jiunn-Nan Tsai

Yuan-Cheng Chuang

Inf. Sci., 1999

Parallel Algorithms for the Tree Bisector Problem and Applications.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel Processing 1999, 1999

1998

Finding a k-Tree Core and a k-Tree Center of a Tree Network in Parallel.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1998

Simulating the CRCW PRAM on Reconfigurable Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Efficient Emulations for X-trees and /w-ary Trees.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1998

Optimally Locating a Structured Facility of a Specified Length in a Weighted Tree Network.

[BibT_eX]

[DOI]

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On the Power of the Mesh with Hybrid Buses.

[BibT_eX]

[DOI]

Stephan Olariu

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Efficient Parallel Algorithms for Optimally Locating a k-Leaf Tree in a Tree Network.

[BibT_eX]

[DOI]

Wei-Kuan Shih

Proceedings of the 1997 International Conference on Parallel Processing (ICPP '97), 1997

1996

A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1996

1995

Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

Recognizing depth-first-search trees in parallel.

[BibT_eX]

[DOI]

Jia-Shung Wang

Chen-Hsing Peng

Proceedings of IPPS '95, 1995

The emulation problem on trees.

[BibT_eX]

[DOI]

Proceedings of IPPS '95, 1995

1994

Cost-Optimal Parallel Algorithms for Constructing B-Trees.

[BibT_eX]

[DOI]

Inf. Sci., 1994

Fast Algorithms for Simulating the CRCW Shared-Memory Computer on Reconfigurable Meshes.

[BibT_eX]

[DOI]

Proceedings of the 1994 International Conference on Parallel Processing, 1994

An Efficient Emulation for Tree-Connected Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

1993

Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition.

[BibT_eX]

[DOI]

Hungwen Li

Theor. Comput. Sci., 1993

On the Set LCS and Set-Set LCS Problems.

[BibT_eX]

[DOI]

Kunsoo Park

J. Algorithms, 1993

Sorting and computing convex hulls on processor arrays with reconfigurable bus systems.

[BibT_eX]

[DOI]

Inf. Sci., 1993

1992

On the Parallel Computation of the Algebraic Path Problem.

[BibT_eX]

[DOI]

Chi-Jen Lu

IEEE Trans. Parallel Distributed Syst., 1992

1991

Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1991

A Simple Approach to Implementing Multiplication with Small Tables.

[BibT_eX]

[DOI]

Chuen-Liang Chen

Inf. Process. Lett., 1991

Cost-Optimal Parallel Algorithms for Constructing B-Trees.

[BibT_eX]

M. S. Yu

Proceedings of the International Conference on Parallel Processing, 1991

Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems.

[BibT_eX]

Hungwen Li

Proceedings of the International Conference on Parallel Processing, 1991

Bitonic Sort with an Arbitrary Number of Keys.

[BibT_eX]

Cheng-Chung Hsu

Proceedings of the International Conference on Parallel Processing, 1991

1990

Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1990

Constant Time Sorting on a Processor Array with a Reconfigurable Bus System.

[BibT_eX]

[DOI]

Ferng-Chiang Lin

Inf. Process. Lett., 1990

Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Constant Time Algorithms for the Transitive Closure Problem and Its Applications.

[BibT_eX]

Chi-Jen Lu