Search the dblp DataBase
Yijie Han :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Yijie Han An Optimal Linked List Prefix Algorithms on a Local Memory Computer. [Citation Graph (0, 0)][DBLP ] ACM Conference on Computer Science, 1989, pp:278-286 [Conf ] Yijie Han , Yoshihide Igarashi Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. [Citation Graph (0, 0)][DBLP ] AWOC, 1988, pp:434-443 [Conf ] Yijie Han Improving the Efficiency of Sorting by Reversals. [Citation Graph (0, 0)][DBLP ] BIOCOMP, 2006, pp:406-409 [Conf ] Yijie Han Achieving O(n3 /log n) Time for All Pairs Shortest Paths by Using a Smaller Table. [Citation Graph (0, 0)][DBLP ] Computers and Their Applications, 2006, pp:36-37 [Conf ] Yijie Han Improved Algorithm for the Symmetry Number Problem on Trees. [Citation Graph (0, 0)][DBLP ] Computers and Their Applications, 2006, pp:38-40 [Conf ] Kyoosang Cho , Yijie Han , Yugyung Lee , E. K. Park Dynamic and Hierarchical Spatial Access Method using Integer Searching. [Citation Graph (0, 0)][DBLP ] CIKM, 2001, pp:341-348 [Conf ] Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam Improving Parallel Computation with Fast Integer Sorting. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:452-461 [Conf ] Yijie Han , Xiaojun Shen Conservative Algorithms for Parallel and Sequential Integer Sorting. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:324-333 [Conf ] Jindong Chen , Yijie Han Shortest Paths on a Polyhedron. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1990, pp:360-369 [Conf ] Sujaa Rani Mohan , E. K. Park , Yijie Han Association Rule-Based Data Mining Agents for Personalized Web Caching. [Citation Graph (0, 0)][DBLP ] COMPSAC (2), 2005, pp:37-38 [Conf ] Yijie Han An O (n 3 (loglogn /logn )5/4 ) Time Algorithm for All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:411-417 [Conf ] Yijie Han , Mikkel Thorup Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:135-144 [Conf ] Jindong Chen , Yijie Han Storing Shortest Paths for a Polyhedron. [Citation Graph (0, 0)][DBLP ] ICCI, 1991, pp:169-180 [Conf ] Luis D. Duval , Yijie Han , Robert A. Wagner , Donald W. Loveland Finding Test-and-Treatment Procedures Using Parallel Computation. [Citation Graph (0, 0)][DBLP ] ICPP, 1986, pp:688-690 [Conf ] Yijie Han A Parallel Algorithm for the PROFIT/COST Problem. [Citation Graph (0, 0)][DBLP ] ICPP (3), 1991, pp:107-114 [Conf ] Yijie Han A Family of Parallel Sorting Algorithms. [Citation Graph (0, 0)][DBLP ] ICPP, 1985, pp:851-853 [Conf ] Yijie Han , Raphael A. Finkel An Optimal Scheme for Disseminating Information. [Citation Graph (0, 0)][DBLP ] ICPP (2), 1988, pp:198-203 [Conf ] Yijie Han , Yoshihide Igarashi Efficient Parallel Shortest Path Algorithms for Banded Matrices. [Citation Graph (0, 0)][DBLP ] ICPP, 1993, pp:223-226 [Conf ] Yijie Han , Robert A. Wagner : Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem. [Citation Graph (0, 0)][DBLP ] ICPP, 1986, pp:924-930 [Conf ] Yijie Han , Yoshihide Igarashi , Kumiko Kanai , Kinya Miura Fault-Tolerant Broadcasting in Binary Jumping Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:145-154 [Conf ] Yijie Han An Efficient Parallel Algorithm for Building the Separating Tree. [Citation Graph (0, 0)][DBLP ] PDPTA, 2006, pp:369-373 [Conf ] Yijie Han Parallel Algorithms for Linked List and Beyond. [Citation Graph (0, 0)][DBLP ] SIGAL International Symposium on Algorithms, 1990, pp:86-100 [Conf ] Yijie Han , Yoshihide Igarashi Derandomization by Exploiting Redundancy and Mutual Independence. [Citation Graph (0, 0)][DBLP ] SIGAL International Symposium on Algorithms, 1990, pp:328-337 [Conf ] Yijie Han Improved fast integer sorting in linear space. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:793-796 [Conf ] Yijie Han Optimal parallel selection. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:1-9 [Conf ] Ka Wong Chong , Yijie Han , Tak Wah Lam On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:225-234 [Conf ] Yijie Han , Xiaojun Shen Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:419-428 [Conf ] Yijie Han Matching Partition a Linked List and Its Optimization. [Citation Graph (0, 0)][DBLP ] SPAA, 1989, pp:246-253 [Conf ] Yijie Han , Victor Y. Pan , John H. Reif Efficient Parallel Algorithms for Computing all Pair Shortest Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP ] SPAA, 1992, pp:353-362 [Conf ] Yijie Han Fast Integer Sorting in Linear Space. [Citation Graph (0, 0)][DBLP ] STACS, 2000, pp:242-253 [Conf ] Yijie Han Deterministic sorting in O(nlog log n) time and linear space. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:602-608 [Conf ] Yijie Han A Fast Derandomization Schemes and Its Applications. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:177-188 [Conf ] Yijie Han , Yoshihide Igarashi Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1989, v:26, n:7, pp:643-655 [Journal ] Yijie Han , Yoshihide Igarashi Parallel PROFIT/COST Algorithms Through Fast Derandomization. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1999, v:36, n:3, pp:215-232 [Journal ] Yijie Han , Victor Y. Pan , John H. Reif Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:17, n:4, pp:399-415 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Computer Networks, 2006, v:50, n:12, pp:1887-1900 [Journal ] Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam Improving the efficiency of parallel minimum spanning tree algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:1, pp:33-54 [Journal ] Yijie Han , Weifa Liang , Xiaojun Shen Very fast parallel algorithms for approximate edge coloring. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:108, n:3, pp:227-238 [Journal ] Yijie Han Improved Fast Integer Sorting in Linear Space. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:170, n:1, pp:81-94 [Journal ] Jindong Chen , Yijie Han Shortest paths on a polyhedron. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:127-144 [Journal ] Hong Shen , Yijie Han , Yi Pan , David J. Evans Optimal Parallel Algorithms for Multiselection on Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Math., 2003, v:80, n:2, pp:165-179 [Journal ] Yijie Han Improved algorithm for all pairs shortest paths. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:91, n:5, pp:245-250 [Journal ] Yijie Han Improved algorithm for the symmetry number problem on trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:98, n:4, pp:130-132 [Journal ] Yijie Han An Improvement on Parallel Computation of a Maximal Matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1995, v:56, n:6, pp:343-348 [Journal ] Yijie Han , Yoshihide Igarashi Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:33, n:5, pp:233-238 [Journal ] Yijie Han , Bhagirath Narahari , Hyeong-Ah Choi Mapping a Chain Task to Chained Processors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:44, n:3, pp:141-148 [Journal ] Ka Wong Chong , Yijie Han , Tak Wah Lam Concurrent threads and optimal parallel minimum spanning trees algorithm. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:297-323 [Journal ] Yijie Han , Robert A. Wagner An Efficient and Fast Parallel-Connected Component Algorithm [Citation Graph (0, 0)][DBLP ] J. ACM, 1990, v:37, n:3, pp:626-642 [Journal ] Yijie Han Deterministic sorting in O(n loglogn ) time and linear space. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:50, n:1, pp:96-105 [Journal ] Yijie Han Parallel Algorithms for Computing Linked List Prefix. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1989, v:6, n:3, pp:537-557 [Journal ] Louis D. Duval , Robert A. Wagner , Yijie Han , Donald W. Loveland Finding Test-and-Treatment Procedures Using Parallel Computation. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1987, v:4, n:3, pp:309-318 [Journal ] Yijie Han , Yoshihide Igarashi , Kumiko Kanai , Kinya Miura Broadcasting in Faulty Binary Jumping Networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1994, v:23, n:3, pp:462-467 [Journal ] Yijie Han A Fast Derandomization Scheme and Its Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1996, v:25, n:1, pp:52-82 [Journal ] Yijie Han , Xiaojun Shen Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2002, v:31, n:6, pp:1852-1878 [Journal ] Yijie Han An Optimal Linked List Prefix Algorithm on a Local Memory Computer. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1991, v:40, n:10, pp:1149-1153 [Journal ] Yijie Han , Yi Pan , Hong Shen Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2002, v:51, n:6, pp:702-707 [Journal ] Yijie Han Computing Lowest Common Ancestors in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP ] Computers and Their Applications, 2007, pp:36-37 [Conf ] Yijie Han , Richard J. La , Hongqiang Zhang Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2006, pp:- [Conf ] Yijie Han , Armand M. Makowski Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2006, pp:- [Conf ] Data Warehousing: A Functional Overview. [Citation Graph (, )][DBLP ] Maximum Flow with a Faster Way of Computing a Blocking Flow. [Citation Graph (, )][DBLP ] Tight Bound for Matching. [Citation Graph (, )][DBLP ] Mobile Agent Peer Discovery and Information Protocol, an Advance Peer Discovery Technique in P2P Networks. [Citation Graph (, )][DBLP ] TCP over Satellite, Its Evolution and Variants. [Citation Graph (, )][DBLP ] Modified Granular Index Scheme for XML Database. [Citation Graph (, )][DBLP ] Modeling Organization Structures In UML. [Citation Graph (, )][DBLP ] Design of Software Systems using Web Services - An Overview and Extension. [Citation Graph (, )][DBLP ] Multi-Agent Teacher Assistant, A Case Study Intended for Multi-Agent Applications. [Citation Graph (, )][DBLP ] Matching for Graphs of Bounded Degree. [Citation Graph (, )][DBLP ] An O ( n 3 (log log n /log n )5/4 ) Time Algorithm for All Pairs Shortest Path. [Citation Graph (, )][DBLP ] Indexing functions and time lower bounds for sorting on a mesh-connected computer. [Citation Graph (, )][DBLP ] Search in 0.010secs, Finished in 0.014secs