# Yijie Han

According to our database

Collaborative distances:

^{1}, Yijie Han authored at least 84 papers between 1985 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

CoRR, 2020

Algorithmica, 2020

Algorithmica, 2020

2019

Proceedings of 34th International Conference on Computers and Their Applications, 2019

2018

J. Comb. Optim., 2018

CoRR, 2018

Proceedings of the International Conference on Information Technology, 2018

2017

Construct a perfect word hash function in time independent of the size of integers.

Inf. Process. Lett., 2017

2016

An O(n<sup>3</sup>loglogn/log<sup>2</sup>n) time algorithm for all pairs shortest paths.

J. Discrete Algorithms, 2016

2015

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2013

J. Comb. Optim., 2013

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

J. Comb. Optim., 2012

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2010

J. Parallel Distributed Comput., 2010

2009

Modified Granular Index Scheme for XML Database.

Proceedings of the 2009 International Conference on Information & Knowledge Engineering, 2009

2008

Inf. Process. Lett., 2008

An <i>O</i> ( <i>n</i> <sup>3</sup>(log log <i>n</i> /log <i>n</i> )<sup>5/4</sup>) Time Algorithm for All Pairs Shortest Path.

Algorithmica, 2008

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Data Warehousing: A Functional Overview.

Proceedings of The 2008 International Conference on Data Mining, 2008

2007

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

IEEE/ACM Trans. Netw., 2007

ACM Trans. Algorithms, 2007

Modeling Organization Structures In UML.

Proceedings of the 2007 International Conference on Software Engineering Research & Practice, 2007

Design of Software Systems using Web Services - An Overview and Extension.

Proceedings of the 2007 International Conference on Software Engineering Research & Practice, 2007

Multi-Agent Teacher Assistant, A Case Study Intended for Multi-Agent Applications.

Proceedings of the 2007 International Conference on Software Engineering Research & Practice, 2007

TCP over Satellite, Its Evolution and Variants.

Proceedings of the 2007 International Conference on Wireless Networks, 2007

Mobile Agent Peer Discovery and Information Protocol, an Advance Peer Discovery Technique in P2P Networks.

Proceedings of the 2007 International Conference on Internet Computing, 2007

Maximum Flow with a Faster Way of Computing a Blocking Flow.

Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

Computing Lowest Common Ancestors in Directed Acyclic Graphs.

Proceedings of the 22nd International Conference on Computers and Their Applications, 2007

2006

Inf. Process. Lett., 2006

Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue.

Comput. Networks, 2006

An Efficient Parallel Algorithm for Building the Separating Tree.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006

Resequencing Delays Under Multipath Routing - Asymptotics in a Simple Queueing Model.

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

An <i>O</i>(<i>n</i><sup>3</sup> (loglog<i>n</i>/log<i>n</i>)<sup>5/4</sup>) Time Algorithm for All Pairs Shortest Paths.

Proceedings of the Algorithms, 2006

Achieving O(n<sup>3</sup>/log n) Time for All Pairs Shortest Paths by Using a Smaller Table.

Proceedings of the 21st International Conference on Computers and Their Applications, 2006

Improving the Efficiency of Sorting by Reversals.

Proceedings of the 2006 International Conference on Bioinformatics & Computational Biology, 2006

2005

Proceedings of the 29th Annual International Computer Software and Applications Conference, 2005

2004

J. Algorithms, 2004

Inf. Process. Lett., 2004

2003

Int. J. Comput. Math., 2003

Discret. Appl. Math., 2003

2002

Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus.

IEEE Trans. Computers, 2002

Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs.

SIAM J. Comput., 2002

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

J. ACM, 2001

Inf. Comput., 2001

Discret. Appl. Math., 2001

Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, 2001

2000

Proceedings of the STACS 2000, 2000

1999

Acta Informatica, 1999

On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997

Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs.

Algorithmica, 1997

1996

SIAM J. Comput., 1996

Int. J. Comput. Geom. Appl., 1996

1995

Inf. Process. Lett., 1995

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

J. Parallel Distributed Comput., 1994

1993

Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992

Inf. Process. Lett., 1992

Indexing functions and time lower bounds for sorting on a mesh-connected computer.

Discret. Appl. Math., 1992

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

IEEE Trans. Computers, 1991

Proceedings of the Algorithms and Data Structures, 1991

A Parallel Algorithm for the PROFIT/COST Problem.

Proceedings of the International Conference on Parallel Processing, 1991

Proceedings of the Advances in Computing and Information, 1991

1990

J. ACM, July, 1990

Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays.

Inf. Process. Lett., 1990

Proceedings of the Algorithms, 1990

Proceedings of the Algorithms, 1990

1989

J. Parallel Distributed Comput., 1989

Acta Informatica, 1989

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Proceedings of the Computer Trends in the 1990s, 1989

1988

An Optimal Scheme for Disseminating Information.

Proceedings of the International Conference on Parallel Processing, 1988

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

J. Parallel Distributed Comput., 1987

1986

: Parallel Algorithms for Bucket Sorting and the Data Dependent Prefix Problem.

Proceedings of the International Conference on Parallel Processing, 1986

1985

A Family of Parallel Sorting Algorithms.

Proceedings of the International Conference on Parallel Processing, 1985