Yijie Han

Ph. D., Computer Science, Duke University


Journal Publications:

  1. K. W. Chong, Y. Han, I. Igarashi, T. W. Lam. Improving the efficiency of parallel minumum spanning tree algorithms. Accepted by Discrete Applied Mathmatics.

  2. Y. Han, Y. Pan, H. Shen. Fast parallel selection on the linear array with reconfigurable pipelined bus system. Accepted by IEEE Trans. on Computers.

  3. Y. Han. Improved fast integer sorting in linear space. Information and Computation, Vol. 170, No. 1, 81-94(Oct. 2001).

  4. K. W. Chong, Y. Han, T. W. Lam. Concurrent threads and optimal parallel minimum spanning trees algorithm. Journal of ACM Vol. 48. No. 2, 297-323(Mar. 2001).

  5. Y. Han, W. Liang, X. Shen. Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics. 108, 227-238(2001).

  6. Y. Han, Y. Igarashi. Fast PROFIT/COST algorithms through fast derandomization. Acta Informatica, Vol. 36, Facs. 3, 215-232(1999).

  7. Y. Han, V. Y. Pan, and J. H. Reif.. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Algorithmica, (1997) 17, 399-415.

  8. J. Chen and Y. Han. Shortest paths on a polyhedron, Part I: Computing shortest paths. Int. J. of Computataional Geometry and Applications, . Vol. 6, No. 2, pp. 127-144, June 1996.

  9. Y. Han. A fast derandomization scheme and its applications, SIAM J. Comput. Vol. 25, No. 1, pp. 52-82, February 1996.

  10. Y. Han. An improvement on parallel computation of a maximal matching. Information Processing Letters 56 , 343-348(1995).

  11. Y. Han, Y. Igarashi, K. Kanai and K. Miura. Broadcasting in faulty binary jumping networks. J. of Parallel and Distributed Computing 23 , 462-467(1994).

  12. Y. Han, B. Narahari, H.-A. Choi. Mapping a chain task to chained processors. Information Processing Letters 44 (1992)141-148.

  13. Y. Han, Y. Igarashi, M. Truszczynski. Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discrete Applied Mathematics, 36 141-152(1992).

  14. Y. Han. An optimal linked list prefix algorithm on a local memory computer. IEEE Transactions on Computers , Vol. 40 , No. 10, 1149-1152(1991).

  15. Y. Han, R. A. Wagner. A fast and efficient parallel connected component algorithm. Journal of ACM , Vol. 37 , No. 3, 626-642(July 1990).

  16. Y. Han, Y. Igarashi. Time lower bounds for parallel sorting on multi-dimensional mesh-connected processor arrays. Information Processing Letters, Vol. 33, No. 5, 10, 233-238(January 1990).

  17. Y. Han, Y. Igarashi. Time lower bounds for parallel sorting on a mesh-connected processor array. Acta Informatica, Vol. 26, Facs. 7, 643-656(1989).

  18. Y. Han. Parallel algorithms for computing linked list prefix. Journal of Parallel and Distributed Computing 6, 537-557(1989).

  19. L.D. Duval, R.A. Wagner, Y. Han, D.W. Loveland: Finding test-and-treatment procedures using parallel computation. Journal of Parallel and Distributed Computing 4, 309-318(1987).

Articles in Published Book:

  1. Y. Han. Parallel derandomization techniques. ``Advances in Parallel Algorithms'', (edited by L. Kronsjo and D. Shumsheruddin), Blackwell Scientific Publications, 368-388, 1992.

Conference Publications:

  1. Y. Han. Improved fast integer sorting in linear space. Proc. 2001 ACM-SIAM Symposium on Discrete Algorithms (SODA'01), 793-796(Jan. 2001).

  2. Y. Han, Y. Lee. Parallel computation for managing transitive relations. IASTED 2000 Int. Conf. on Parallel and Distributed Systems, Las Vegas, Neveda, Vol. I, 37-43(Nov. 2000).

  3. Y. Han. Fast integer sorting in linear space. Proc. 2000 Symposium on Theoretical Aspects of Computing (STACS'2000), Lecture Notes in Computer Science 1170, 242-253.

  4. K. W. Chong, Y. Han, Y. Igarashi, T. W. Lam. Improve parallel computation with fast integer sorting. Proceedings of the 5th International Conference on Computing and Combinatorics, Lecture Notes in Computer Sciecn 1627, 452-461(1999).

  5. Y. Han, Y. Pan, H. Shen. Fast parallel selection on the linear array with reconfigurable pipelined bus system. Proc. of The IEEE Seventh Symposium on the Frontiers of Massively Parallel Computation (Frontiers'99). Annapolis, Maryland, 286-293(1999).

  6. Y. Han, X. Shen. Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs. Proc. 1999 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, 419-428(January 1999).

  7. K. W. Chong, Y. Han, T. W. Lam. On the parallel time complexity of undirected connectivity and minimum spanning trees. Proc. 1999 Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, 225-234(January 1999).

  8. Y. Han, W. Liang, X. Shen. Very fast parallel algorithms for approximate edge coloring. Proc. 1998 10th IASTED International Conference on Parallel and Distributed Computing and Systems, Las Vegas, Nevada, 244-249(October 1998).

  9. Y. Han, X. Shen. Conservative algorithms for parallel and sequential integer sorting. Proc. 1995 International Computing and Combinatorics Conference, Lecture Notes in Computer Science 959, 324-333(August, 1995).

  10. Y. Han, Y. Igarashi. Efficient parallel shortest path algorithms for banded matrices. Proc. 1993 Int. Conf. on Parallel Processing, St. Charles, Illinois, Vol. 3, 223-226, (Aug. 1993).

  11. Y. Han, V.Y. Pan, J.H. Reif. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Proc. 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'92), San Diego, California. 353-362(1992). (Journal version of the paper available)

  12. Y. Han, Y. Igarashi, K. Kanai, K. Miura. Broadcasting in faulty binary jumping networks. Proc. 3rd International Symposium on Algorithms and Computation, ISAAC'92 Nagoya, Japan, December 1992, Lecture Notes in Computer Science (Springer-Verlag, New York/Berlin), Vol. 650, 145-154(1992). (Journal version of the paper available)

  13. Y. Han. A parallel algorithm for the PROFIT/COST problem. Proc. 1991 Int. Conf. on Parallel Processing, Vol. 3, 103-112(August 1991).

  14. Y. Han. A fast derandomization scheme and its applications. Proc. 2nd Workshop on Algorithms and Data Structures (WADS'91), Ottawa, Canada, Lecture Notes in Comput. Sci. 519, 177-188(August, 1991). (Journal version of the paper available)

  15. J. Chen and Y. Han. Storing shortest paths for a polyhedron. Proc. 1991 Int. Conf. on Computing and Information, Lecture Notes in Comput. Sci. 497, 169-180(May 1991).

  16. J. Chen and Y. Han. Shortest paths on a polyhedron. Proc. 6th Annual ACM Symposium on Computational Geometry. (Berkeley, Calif, June 1990), 360-369. (Journal version of the paper available)

  17. Y. Han. Parallel algorithms for linked list and beyond. (invited paper). Proc. SIGAL Symp. on Algorithms, Tokyo, Japan, Lecture Notes in Compt. Sci. 450, 86-100(August 1990).

  18. Y. Han, Y. Igarashi. Derandomization by exploiting redundancy and mutual independence. Proc. SIGAL Symp. on Algorithms, Tokyo, Japan, Lecture Notes in Comput. Sci. 450, 328-337(August 1990).

  19. Y. Han. Matching partition a linked list and its optimization. Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA'89), Santa Fe, New Mexico, 246-253(June 1989).

  20. Y. Han. An optimal linked list prefix algorithm on a local memory computer. Proc. 1989 Computer Science Conference (CSC'89), 278-286(Feb., 1989).

  21. Y. Han, R. Finkel. An optimal scheme for disseminating information. Proc. 1988 Int. Conf. on Parallel Processing, Vol. 2, 198-203(August 1988).

  22. Y. Han, Y. Igarashi. Time lower bounds for parallel sorting on a mesh-connected processor array. Proc. 3rd Aegean Workshop on Computing (AWOC'88), Corfu, Greece, Lecture Notes in Comput. Sci. 319, 434-443(June/July 1988). (Journal version of the paper available)

  23. R.A. Wagner, Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. Proc. 1986 Int. Conf. on Parallel Processing, 924-930(August 1986).

  24. L. D. Duval, R.A.Wagner, Y. Han, D.W. Loveland. Finding test-and-treatement procedures using parallel computation. Proc. 1986 Int. Conf. on Parallel Processing, 688-690(August 1986). (Journal version of the paper available)

  25. Y. Han. A family of parallel sorting algorithms. Proc. 1985 Int. Conf. on Parallel Processing, 851-853(August 1985).

Phone: (816) 235-5930 (Work)
Mailing Address:
Computer Science Telecommunications Program
University of Missouri - Kansas City
5100 Rockhill Rd.
Kansas City, MO 64110
Email: yhan01@yahoo.com

(last update 31-January-2001)