The following pages link to Richard Chia-Tung Lee (Q702771):
Displaying 50 items.
- (Q290217) (redirect page) (← links)
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Optimal MMI file systems for orthogonal range retrieval (Q688303) (← links)
- The full Steiner tree problem (Q702772) (← links)
- On weighted rectilinear 2-center and 3-center problems (Q757236) (← links)
- The hierarchical ordering in multiattribute files (Q760202) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
- A parallel algorithm to solve the stable marriage problem (Q798000) (← links)
- Solving the set cover problem on a supercomputer (Q910182) (← links)
- The weighted perfect domination problem (Q912630) (← links)
- On the continuous working problem (Q917431) (← links)
- The vectorization of the partition problem (Q922722) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- The mapping of two-dimensional array processors to one-dimensional processors (Q1079955) (← links)
- An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
- On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons (Q1336739) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- An optimal embedding of cycles into incomplete hypercubes (Q1607026) (← links)
- The minimal spanning tree preservation approaches for DNA multiple sequence alignment and evolutionary tree construction (Q1777421) (← links)
- Single step searching in weighted block graphs (Q1894239) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) (← links)
- An algorithm to generate prime implicants and its application to the selection problem (Q2557226) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- (Q3042217) (← links)
- VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE (Q3212328) (← links)
- The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
- (Q3359794) (← links)
- A Letter-oriented Minimal Perfect Hashing Scheme (Q3718180) (← links)
- A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
- Symbolic Gray Code as a Multikey Hashing Function (Q3877053) (← links)
- Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries (Q3933809) (← links)
- 20‐relative neighborhood graphs are hamiltonian (Q3984463) (← links)
- COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME (Q3986399) (← links)
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS (Q4017520) (← links)
