The following pages link to Yijie Han (Q170441):
Displaying 49 items.
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Tight bound for matching (Q431927) (← links)
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- An improvement on parallel computation of a maximal matching (Q672837) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Improved algorithm for the symmetry number problem on trees (Q844174) (← links)
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays (Q915448) (← links)
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
- Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618) (← links)
- Indexing functions and time lower bounds for sorting on a mesh-connected computer (Q1192947) (← links)
- Parallel PROFIT/COST algorithms through fast derandomization (Q1306566) (← links)
- Algorithms for testing occurrences of length 4 patterns in permutations (Q1698070) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space (Q2300729) (← links)
- A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths (Q2380054) (← links)
- Erratum to: Tight bound for matching (Q2392740) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Distribution of path durations in mobile ad-hoc networks -- Palm's theorem to the rescue (Q2498804) (← links)
- (Q2728853) (← links)
- (Q2768383) (← links)
- (Q2885618) (← links)
- More Efficient Parallel Integer Sorting (Q2898003) (← links)
- An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths (Q2904549) (← links)
- A Linear Time Algorithm for Ordered Partition (Q3452555) (← links)
- An efficient and fast parallel-connected component algorithm (Q3477960) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Deterministic sorting in <i>O</i> ( <i>n</i> log log <i>n</i> ) time and linear space (Q3579249) (← links)
- (Q4037417) (← links)
- (Q4201931) (← links)
- (Q4252292) (← links)
- (Q4252316) (← links)
- Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation (Q4406291) (← links)
- (Q4471267) (← links)
- Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus (Q4571286) (← links)
- Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs (Q4785624) (← links)
- Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers (Q4805931) (← links)
- Deterministic sorting in O(nloglogn) time and linear space (Q4819696) (← links)
- A Fast Derandomization Scheme and Its Applications (Q4875445) (← links)
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS (Q4889502) (← links)
- (Q4937213) (← links)
- Optimal parallel selection (Q4962677) (← links)
- On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs (Q5048013) (← links)
- An optimal linked list prefix algorithm on a local memory computer (Q5375419) (← links)
- Algorithms for Testing Length Four Permutations (Q5405913) (← links)
- An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths (Q5449546) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
- Conservative algorithms for parallel and sequential integer sorting (Q6085719) (← links)
- More Efficient Parallel Integer Sorting (Q6114876) (← links)
