![]() | ![]() |
| 2012 | ||
|---|---|---|
| 77 | Yijie Han, Xin He: More Efficient Parallel Integer Sorting. FAW-AAIM 2012: 279-290 | |
| 76 | Yijie Han: Tight bound for matching. J. Comb. Optim. 23(3): 322-330 (2012) | |
| 2010 | ||
| 75 | Yijie Han, Sanjeev Saxena, Xiaojun Shen: An efficient parallel algorithm for building the separating tree. J. Parallel Distrib. Comput. 70(6): 625-629 (2010) | |
| 2009 | ||
| 74 | Yijie Han: Tight Bound for Matching. FCS 2009: 68-74 | |
| 73 | Joel Lopes, Yijie Han: Modified Granular Index Scheme for XML Database. IKE 2009: 200-203 | |
| 2008 | ||
| 72 | Srikanth Rokkam, Yijie Han: Data Warehousing: A Functional Overview. DMIN 2008: 362-369 | |
| 71 | Yijie Han: Matching for Graphs of Bounded Degree. FAW 2008: 171-173 | |
| 70 | Yijie Han: An O ( n 3(log log n /log n )5/4) Time Algorithm for All Pairs Shortest Path. Algorithmica 51(4): 428-434 (2008) | |
| 69 | Yijie Han: A note of an O(n3/logn) time algorithm for all pairs shortest paths. Inf. Process. Lett. 105(3): 114-116 (2008) | |
| 2007 | ||
| 68 | Yijie Han: Computing Lowest Common Ancestors in Directed Acyclic Graphs. Computers and Their Applications 2007: 36-37 | |
| 67 | Yijie Han: Maximum Flow with a Faster Way of Computing a Blocking Flow. FCS 2007: 52-56 | |
| 66 | Abhinay Bodapunti, Yijie Han: TCP over Satellite, Its Evolution and Variants. ICWN 2007: 3-11 | |
| 65 | Hafeez Razzaq, Muhammad Fareed Arif, Yijie Han: Mobile Agent Peer Discovery and Information Protocol, an Advance Peer Discovery Technique in P2P Networks. International Conference on Internet Computing 2007: 234-240 | |
| 64 | Zhichuan Li, Yijie Han: Modeling Organization Structures In UML. Software Engineering Research and Practice 2007: 177-182 | |
| 63 | Nivesh Gopathi, Yijie Han: Design of Software Systems using Web Services - An Overview and Extension. Software Engineering Research and Practice 2007: 217-223 | |
| 62 | Muhammad Fareed Arif, Hafeez Razzaq, Yijie Han: Multi-Agent Teacher Assistant, A Case Study Intended for Multi-Agent Applications. Software Engineering Research and Practice 2007: 501-510 | |
| 61 | Yijie Han: Optimal parallel selection. ACM Transactions on Algorithms 3(4): (2007) | |
| 60 | Richard J. La, Yijie Han: Distribution of path durations in mobile ad hoc networks and path selection. IEEE/ACM Trans. Netw. 15(5): 993-1006 (2007) | |
| 2006 | ||
| 59 | Yijie Han: Improving the Efficiency of Sorting by Reversals. BIOCOMP 2006: 406-409 | |
| 58 | Yijie Han: Achieving O(n3/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. Computers and Their Applications 2006: 36-37 | |
| 57 | Yijie Han: Improved Algorithm for the Symmetry Number Problem on Trees. Computers and Their Applications 2006: 38-40 | |
| 56 | Yijie Han: An O(n3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths. ESA 2006: 411-417 | |
| 55 | Yijie Han, Richard J. La, Hongqiang Zhang: Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration. INFOCOM 2006 | |
| 54 | Yijie Han, Armand M. Makowski: Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. INFOCOM 2006 | |
| 53 | Yijie Han: An Efficient Parallel Algorithm for Building the Separating Tree. PDPTA 2006: 369-373 | |
| 52 | Yijie Han, Richard J. La, Armand M. Makowski, Seungjoon Lee: Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue. Computer Networks 50(12): 1887-1900 (2006) | |
| 51 | Yijie Han: Improved algorithm for the symmetry number problem on trees. Inf. Process. Lett. 98(4): 130-132 (2006) | |
| 2005 | ||
| 50 | Sujaa Rani Mohan, E. K. Park, Yijie Han: Association Rule-Based Data Mining Agents for Personalized Web Caching. COMPSAC (2) 2005: 37-38 | |
| 2004 | ||
| 49 | Yijie Han: Improved algorithm for all pairs shortest paths. Inf. Process. Lett. 91(5): 245-250 (2004) | |
| 48 | Yijie Han: Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1): 96-105 (2004) | |
| 2003 | ||
| 47 | Yijie Han: Optimal parallel selection. SODA 2003: 1-9 | |
| 46 | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving the efficiency of parallel minimum spanning tree algorithms. Discrete Applied Mathematics 126(1): 33-54 (2003) | |
| 45 | Hong Shen, Yijie Han, Yi Pan, David J. Evans: Optimal Parallel Algorithms for Multiselection on Mesh-Connected Computers. Int. J. Comput. Math. 80(2): 165-179 (2003) | |
| 2002 | ||
| 44 | Yijie Han, Mikkel Thorup: Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. FOCS 2002: 135-144 | |
| 43 | Yijie Han: Deterministic sorting in O(nlog log n) time and linear space. STOC 2002: 602-608 | |
| 42 | Yijie Han, Yi Pan, Hong Shen: Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus. IEEE Trans. Computers 51(6): 702-707 (2002) | |
| 41 | Yijie Han, Xiaojun Shen: Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs. SIAM J. Comput. 31(6): 1852-1878 (2002) | |
| 2001 | ||
| 40 | Kyoosang Cho, Yijie Han, Yugyung Lee, E. K. Park: Dynamic and Hierarchical Spatial Access Method using Integer Searching. CIKM 2001: 341-348 | |
| 39 | Yijie Han: Improved fast integer sorting in linear space. SODA 2001: 793-796 | |
| 38 | Yijie Han, Weifa Liang, Xiaojun Shen: Very fast parallel algorithms for approximate edge coloring. Discrete Applied Mathematics 108(3): 227-238 (2001) | |
| 37 | Yijie Han: Improved Fast Integer Sorting in Linear Space. Inf. Comput. 170(1): 81-94 (2001) | |
| 36 | Ka Wong Chong, Yijie Han, Tak Wah Lam: Concurrent threads and optimal parallel minimum spanning trees algorithm. J. ACM 48(2): 297-323 (2001) | |
| 2000 | ||
| 35 | Yijie Han: Fast Integer Sorting in Linear Space. STACS 2000: 242-253 | |
| 1999 | ||
| 34 | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving Parallel Computation with Fast Integer Sorting. COCOON 1999: 452-461 | |
| 33 | Ka Wong Chong, Yijie Han, Tak Wah Lam: On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999: 225-234 | |
| 32 | Yijie Han, Xiaojun Shen: Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. SODA 1999: 419-428 | |
| 31 | Yijie Han, Yoshihide Igarashi: Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Inf. 36(3): 215-232 (1999) | |
| 1997 | ||
| 30 | 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) | |
| 1996 | ||
| 29 | Jindong Chen, Yijie Han: Shortest paths on a polyhedron. Int. J. Comput. Geometry Appl. 6(2): 127-144 (1996) | |
| 28 | Yijie Han: A Fast Derandomization Scheme and Its Applications. SIAM J. Comput. 25(1): 52-82 (1996) | |
| 1995 | ||
| 27 | Yijie Han, Xiaojun Shen: Conservative Algorithms for Parallel and Sequential Integer Sorting. COCOON 1995: 324-333 | |
| 26 | Yijie Han: An Improvement on Parallel Computation of a Maximal Matching. Inf. Process. Lett. 56(6): 343-348 (1995) | |
| 1994 | ||
| 25 | Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura: Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distrib. Comput. 23(3): 462-467 (1994) | |
| 1993 | ||
| 24 | Yijie Han, Yoshihide Igarashi: Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP 1993: 223-226 | |
| 1992 | ||
| 23 | Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura: Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992: 145-154 | |
| 22 | Yijie Han, Victor Y. Pan, John H. Reif: Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. SPAA 1992: 353-362 | |
| 21 | Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski: Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discrete Applied Mathematics 36(2): 141-152 (1992) | |
| 20 | Yijie Han, Bhagirath Narahari, Hyeong-Ah Choi: Mapping a Chain Task to Chained Processors. Inf. Process. Lett. 44(3): 141-148 (1992) | |
| 1991 | ||
| 19 | Jindong Chen, Yijie Han: Storing Shortest Paths for a Polyhedron. ICCI 1991: 169-180 | |
| 18 | Yijie Han: A Parallel Algorithm for the PROFIT/COST Problem. ICPP (3) 1991: 107-114 | |
| 17 | Yijie Han: A Fast Derandomization Schemes and Its Applications. WADS 1991: 177-188 | |
| 16 | Yijie Han: An Optimal Linked List Prefix Algorithm on a Local Memory Computer. IEEE Trans. Computers 40(10): 1149-1153 (1991) | |
| 1990 | ||
| 15 | Yijie Han, Yoshihide Igarashi: Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990: 328-337 | |
| 14 | Yijie Han: Parallel Algorithms for Linked List and Beyond. SIGAL International Symposium on Algorithms 1990: 86-100 | |
| 13 | Jindong Chen, Yijie Han: Shortest Paths on a Polyhedron. Symposium on Computational Geometry 1990: 360-369 | |
| 12 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990) | |
| 11 | Yijie Han, Robert A. Wagner: An Efficient and Fast Parallel-Connected Component Algorithm J. ACM 37(3): 626-642 (1990) | |
| 1989 | ||
| 10 | Yijie Han: An Optimal Linked List Prefix Algorithms on a Local Memory Computer. ACM Conference on Computer Science 1989: 278-286 | |
| 9 | Yijie Han: Matching Partition a Linked List and Its Optimization. SPAA 1989: 246-253 | |
| 8 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Inf. 26(7): 643-655 (1989) | |
| 7 | Yijie Han: Parallel Algorithms for Computing Linked List Prefix. J. Parallel Distrib. Comput. 6(3): 537-557 (1989) | |
| 1988 | ||
| 6 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988: 434-443 | |
| 5 | Yijie Han, Raphael A. Finkel: An Optimal Scheme for Disseminating Information. ICPP (2) 1988: 198-203 | |
| 1987 | ||
| 4 | Louis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland: Finding Test-and-Treatment Procedures Using Parallel Computation. J. Parallel Distrib. Comput. 4(3): 309-318 (1987) | |
| 1986 | ||
| 3 | Luis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland: Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP 1986: 688-690 | |
| 2 | Yijie Han, Robert A. Wagner: : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem. ICPP 1986: 924-930 | |
| 1985 | ||
| 1 | Yijie Han: A Family of Parallel Sorting Algorithms. ICPP 1985: 851-853 | |
Colors in the list of coauthors
Last update Thu May 31 18:55:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page