| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Yijie Han 28 Yijie Han, Yi Pan , Hong Shen : Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus. IEEE Transactions on Computers 51 (6): 702-707 (2002) 27 Kyoosang Cho , Yijie Han, Yugyung Lee , E. K. Park : Dynamic and Hierarchical Spatial Access Method using Integer Searching. CIKM 2001 : 341-348 26 Yijie Han: Improved fast integer sorting in linear space. SODA 2001 : 793-796 25 Yijie Han, Weifa Liang , Xiaojun Shen : Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics 108 (3): 227-238 (2001) 24 Yijie Han: Improved Fast Integer Sorting in Linear Space. Information and Computation 170 (1): 81-94 (2001) 23 Ka Wong Chong , Yijie Han, Tak Wah Lam : Concurrent threads and optimal parallel minimum spanning trees algorithm. JACM 48 (2): 297-323 (2001) 22 Yijie Han: Fast Integer Sorting in Linear Space. STACS 2000 : 242-253 21 Ka Wong Chong , Yijie Han, Yoshihide Igarashi , Tak Wah Lam : Improving Parallel Computation with Fast Integer Sorting. COCOON 1999 : 452-461 20 Ka Wong Chong , Yijie Han, Tak Wah Lam : On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999 : 225-234 19 Yijie Han, Xiaojun Shen : Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. SODA 1999 : 419-428 18 Yijie Han, Yoshihide Igarashi : Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Informatica 36 (3): 215-232 (1999) 17 Yijie Han, Victor Y. Pan , John H. Reif : Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. Algorithmica 17 (4): 399-415 (1997) 16 Yijie Han: A Fast Derandomization Scheme and Its Applications. SIAM J. Comput. 25 (1): 52-82 (1996) 15 Yijie Han, Xiaojun Shen : Conservative Algorithms for Parallel and Sequential Integer Sorting. COCOON 1995 : 324-333 14 Yijie Han: An Improvement on Parallel Computation of a Maximal Matching. Information Processing Letters 56 (6): 343-348 (1995) 13 Yijie Han, Yoshihide Igarashi : Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP 1993 : 223-226 12 Yijie Han, Yoshihide Igarashi , Kumiko Kanai , Kinya Miura : Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992 : 145-154 11 Yijie Han, Victor Y. Pan , John H. Reif : Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992 : 353-362 10 Jingdong Chen , Yijie Han: Stroring Shortest Paths for a Polyhedron. ICCI 1991 : 169-180 9 Yijie Han: A Fast Derandomization Schemes and Its Applications. WADS 1991 : 177-188 8 Yijie Han: An Optimal Linked List Prefix Algorithm on a Local Memory Computer. IEEE Transactions on Computers 40 (10): 1149-1153 (1991) 7 Yijie Han, Yoshihide Igarashi : Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990 : 328-337 6 Yijie Han: Parallel Algorithms for Linked List and Beyond. SIGAL International Symposium on Algorithms 1990 : 86-100 5 Jindong Chen , Yijie Han: Shortest Paths on a Polyhedron. Symposium on Computational Geometry 1990 : 360-369 4 Yijie Han, Yoshihide Igarashi : Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Information Processing Letters 33 (5): 233-238 (1990) 3 Yijie Han, Robert A. Wagner : An Efficient and Fast Parallel-Connected Component Algorithm. JACM 37 (3): 626-642 (1990) 2 Yijie Han, Yoshihide Igarashi : Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Informatica 26 (7): 643-655 (1989) 1 Yijie Han, Yoshihide Igarashi : Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988 : 434-443  DiSC'02 © 2003 Association for Computing Machinery |
