Xiao-Jun Shen

From MaRDI portal
Person:912392

Available identifiers

zbMath Open shen.xiaojunMaRDI QIDQ912392

List of research outcomes

PublicationDate of PublicationType
Conservative algorithms for parallel and sequential integer sorting2023-12-12Paper
Permutation routing in all-optical product networks2017-08-25Paper
Frame-Based Packet-Mode Scheduling for Input-Queued Switches2017-08-08Paper
A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees2017-05-16Paper
An efficient parallel algorithm for building the separating tree2012-03-07Paper
A study on the weak barrier coverage problem in wireless sensor networks2011-04-14Paper
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches2009-01-08Paper
https://portal.mardi4nfdi.de/entity/Q56980052005-10-27Paper
Optimally routing LC permutations on k-extra-stage cube-type networks2003-11-02Paper
An optimal algorithm for permutation admissibility to multistage interconnection networks2003-10-15Paper
Optimal realization of any BPC permutation on K-extra-stage Omega networks2003-10-14Paper
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs2003-01-05Paper
Rearrangeable graphs2002-07-25Paper
Very fast parallel algorithms for approximate edge coloring2001-09-03Paper
Partitionability of \(k\)-extra-stage omega networks and an optimal task migration algorithm2001-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45257232001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q42523162000-04-13Paper
Finding the k most vital edges in the minimum spanning tree problem1998-08-13Paper
Parallel algorithms for the edge-coloring and edge-coloring update problems1996-11-04Paper
Generalized Latin squares. II1995-11-26Paper
An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks1995-01-01Paper
A note on minimal visibility graphs1993-08-08Paper
The 4-star graph is not a subgraph of any hypercube1993-05-16Paper
Scheduling on a hypercube1992-06-28Paper
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case1991-01-01Paper
More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case1991-01-01Paper
Covering convex sets with non-overlapping polygons1990-01-01Paper
A tight lower bound on the size of visibility graphs1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Xiao-Jun Shen