Xiao-Jun Shen

Available identifiers

zbMath Open shen.xiaojunMaRDI QIDQ912392

List of research outcomes

Publication	Date of Publication	Type
Conservative algorithms for parallel and sequential integer sorting	2023-12-12	Paper
Permutation routing in all-optical product networks	2017-08-25	Paper
Frame-Based Packet-Mode Scheduling for Input-Queued Switches	2017-08-08	Paper
A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees	2017-05-16	Paper
An efficient parallel algorithm for building the separating tree	2012-03-07	Paper
A study on the weak barrier coverage problem in wireless sensor networks	2011-04-14	Paper
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches	2009-01-08	Paper
https://portal.mardi4nfdi.de/entity/Q5698005	2005-10-27	Paper
Optimally routing LC permutations on k-extra-stage cube-type networks	2003-11-02	Paper
An optimal algorithm for permutation admissibility to multistage interconnection networks	2003-10-15	Paper
Optimal realization of any BPC permutation on K-extra-stage Omega networks	2003-10-14	Paper
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs	2003-01-05	Paper
Rearrangeable graphs	2002-07-25	Paper
Very fast parallel algorithms for approximate edge coloring	2001-09-03	Paper
Partitionability of \(k\)-extra-stage omega networks and an optimal task migration algorithm	2001-02-19	Paper
https://portal.mardi4nfdi.de/entity/Q4525723	2001-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4252316	2000-04-13	Paper
Finding the k most vital edges in the minimum spanning tree problem	1998-08-13	Paper
Parallel algorithms for the edge-coloring and edge-coloring update problems	1996-11-04	Paper
Generalized Latin squares. II	1995-11-26	Paper
An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks	1995-01-01	Paper
A note on minimal visibility graphs	1993-08-08	Paper
The 4-star graph is not a subgraph of any hypercube	1993-05-16	Paper
Scheduling on a hypercube	1992-06-28	Paper
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case	1991-01-01	Paper
More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case	1991-01-01	Paper
Covering convex sets with non-overlapping polygons	1990-01-01	Paper
A tight lower bound on the size of visibility graphs	1987-01-01	Paper

Research outcomes over time

This page was built for person: Xiao-Jun Shen