# Yijie Han

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Algorithms for testing occurrences of length 4 patterns in permutations.

J. Comb. Optim., 2018

2017

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

Inf. Process. Lett., 2017

2016

J. Discrete Algorithms, 2016

2015

A Linear Time Algorithm for Ordered Partition.

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

2014

Parallel Algorithms for Testing Length Four Permutations.

Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2013

Erratum to: Tight bound for matching.

J. Comb. Optim., 2013

Algorithms for Testing Length Four Permutations.

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

2012

An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths.

Proceedings of the Algorithm Theory - SWAT 2012, 2012

More Efficient Parallel Integer Sorting.

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

2010

An efficient parallel algorithm for building the separating tree.

J. Parallel Distrib. Comput., 2010

2009

Modified Granular Index Scheme for XML Database.

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

Tight Bound for Matching.

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

2008

A note of an O(n

^{3}/logn) time algorithm for all pairs shortest paths.
Inf. Process. Lett., 2008

Algorithmica, 2008

Matching for Graphs of Bounded Degree.

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

Parallel Algorithms for Maximal Independent Set and Maximal Matching.

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

Distribution of path durations in mobile ad hoc networks and path selection.

IEEE/ACM Trans. Netw., 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

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

Computer 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

Path Selection in Mobile Ad-Hoc Networks and Distribution of Path Duration.

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

Proceedings of the Algorithms, 2006

Improved Algorithm for the Symmetry Number Problem on Trees.

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

Achieving O(n

^{3}/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

Association Rule-Based Data Mining Agents for Personalized Web Caching.

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

2004

J. Algorithms, 2004

Improved algorithm for all pairs shortest paths.

Inf. Process. Lett., 2004

2003

Optimal Parallel Algorithms for Multiselection on Mesh-Connected Computers.

Int. J. Comput. Math., 2003

Improving the efficiency of parallel minimum spanning tree algorithms.

Discrete Applied Mathematics, 2003

Optimal parallel selection.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus.

IEEE Trans. Computers, 2002

Deterministic sorting in O(nlog log n) time and linear space.

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

Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space.

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

2001

Concurrent threads and optimal parallel minimum spanning trees algorithm.

J. ACM, 2001

Very fast parallel algorithms for approximate edge coloring.

Discrete Applied Mathematics, 2001

Improved fast integer sorting in linear space.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Dynamic and Hierarchical Spatial Access Method using Integer Searching.

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

2000

Fast Integer Sorting in Linear Space.

Proceedings of the STACS 2000, 2000

1999

Parallel PROFIT/COST Algorithms Through Fast Derandomization.

Acta Inf., 1999

Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Improving Parallel Computation with Fast Integer Sorting.

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

1996

A Fast Derandomization Scheme and Its Applications.

SIAM J. Comput., 1996

1995

An Improvement on Parallel Computation of a Maximal Matching.

Inf. Process. Lett., 1995

Conservative Algorithms for Parallel and Sequential Integer Sorting.

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

1994

Broadcasting in Faulty Binary Jumping Networks.

J. Parallel Distrib. Comput., 1994

1993

Efficient Parallel Shortest Path Algorithms for Banded Matrices.

Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992

Mapping a Chain Task to Chained Processors.

Inf. Process. Lett., 1992

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

Discrete Applied Mathematics, 1992

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

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Fault-Tolerant Broadcasting in Binary Jumping Networks.

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

1991

An Optimal Linked List Prefix Algorithm on a Local Memory Computer.

IEEE Trans. Computers, 1991

A Fast Derandomization Schemes and Its Applications.

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

Storing Shortest Paths for a Polyhedron.

Proceedings of the Advances in Computing and Information, 1991

1990

An Efficient and Fast Parallel-Connected Component Algorithm

J. ACM, July, 1990

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

Inf. Process. Lett., 1990

Derandomization by Exploiting Redundancy and Mutual Independence.

Proceedings of the Algorithms, 1990

Parallel Algorithms for Linked List and Beyond.

Proceedings of the Algorithms, 1990

Shortest Paths on a Polyhedron.

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Parallel Algorithms for Computing Linked List Prefix.

J. Parallel Distrib. Comput., 1989

Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array.

Acta Inf., 1989

Matching Partition a Linked List and Its Optimization.

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

An Optimal Linked List Prefix Algorithms on a Local Memory Computer.

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

Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array.

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

1987

Finding Test-and-Treatment Procedures Using Parallel Computation.

J. Parallel Distrib. Comput., 1987

1986

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

Proceedings of the International Conference on Parallel Processing, 1986

Finding Test-and-Treatment Procedures Using Parallel Computation.

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