Person:182320: Difference between revisions

From MaRDI portal
Person:182320
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Hong Shen to Hong Shen: Duplicate
 
(No difference)

Latest revision as of 17:37, 8 December 2023

Available identifiers

zbMath Open shen.hongMaRDI QIDQ182320

List of research outcomes

PublicationDate of PublicationType
A centroid labelling technique and its application to path selection in trees2022-08-19Paper
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping2021-03-10Paper
Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus2018-07-09Paper
Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)2017-09-08Paper
Coordinated En-Route Web Caching in Multiserver Networks2017-08-08Paper
Embedding Meshes and Tori on Double-Loop Networks of the Same Size2017-07-27Paper
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks2017-07-12Paper
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks2017-07-12Paper
Effective Reconstruction of Data Perturbed by Random Projections2017-07-12Paper
Edge-independent spanning trees in augmented cubes2017-03-16Paper
2-space bounded online cube and hypercube packing2016-01-15Paper
Learning a hybrid similarity measure for image retrieval2015-12-08Paper
Updating attribute reduction in incomplete decision systems with the variation of attribute set2015-07-10Paper
Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints2015-07-10Paper
Improved approximation algorithms for constrained fault-tolerant resource allocation2015-06-10Paper
On the Advice Complexity of One-Dimensional Online Bin Packing2014-09-02Paper
Approximation Algorithms for Fault Tolerant Facility Allocation2014-01-21Paper
Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation2013-08-16Paper
On finding Min-Min disjoint paths2013-06-25Paper
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints2013-06-11Paper
On the complexity of the edge-disjoint min-min problem in planar digraphs2012-06-25Paper
Routing and wavelength assignment for hypercube in array-based WDM optical networks2012-03-07Paper
A DISTRIBUTED APPROXIMATION ALGORITHM FOR FAULT-TOLERANT METRIC FACILITY LOCATION2011-10-10Paper
Unconstrained and Constrained Fault-Tolerant Resource Allocation2011-08-17Paper
Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs2011-06-03Paper
The generalization of some trellis properties of linear codes to group codes2010-02-26Paper
The Fault-Tolerant Facility Allocation Problem2009-12-17Paper
A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates2008-12-21Paper
A Relation Between the Characteristic Generators of a Linear Code and its Dual2008-12-21Paper
Janus: A Two-Sided Analytical Model for Multi-Stage Coordinated Attacks2008-05-06Paper
Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees2008-03-19Paper
Nearest lattice point algorithms on semi \(k\)-reduced basis2007-02-20Paper
Random walk routing in WSNS with regular topologies2006-10-12Paper
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time2006-08-14Paper
Computing and Combinatorics2006-01-11Paper
Computational Science – ICCS 20052005-11-30Paper
Sorting on Single-Channel Wireless Sensor Networks2005-10-19Paper
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO2005-08-01Paper
Mining informative rule set for prediction2005-03-15Paper
A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL2004-10-06Paper
https://portal.mardi4nfdi.de/entity/Q44518972004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44519392004-02-11Paper
More efficient topological sort using reconfigurable optical buses2003-08-20Paper
Analysis on extended ant routing algorithms for network routing and management2003-08-20Paper
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers2003-05-08Paper
Transversal of disjoint convex polygons.2003-01-21Paper
Fast association discovery in derivative transaction collections2003-01-08Paper
Fast sequential and parallel algorithms for finding extremal sets2002-12-19Paper
https://portal.mardi4nfdi.de/entity/Q45327542002-11-06Paper
An efficient algorithm for constructing Hamiltonian paths in meshes2002-09-09Paper
A study of average-case speedup and scalability of parallel computations on static networks2002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27685852002-02-03Paper
An architecture-independent graphical tool for automatic contention-free process-to-processor mapping2001-11-07Paper
https://portal.mardi4nfdi.de/entity/Q45015932001-03-12Paper
Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree2000-10-30Paper
Fully dynamic algorithms for maintaining extremal sets in a family of sets2000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q44941002000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q49533342000-05-09Paper
Finding the \(k\) most vital edges with respect to minimum spanning tree1999-12-20Paper
An efficient clustering algorithm for partitioning parallel programs1999-01-12Paper
Lower bounds for dynamic tree embedding in bipartite networks1999-01-06Paper
Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk1998-11-01Paper
Optimal parallel multiselection on EREW PRAM1998-08-13Paper
Efficient enumeration of all minimal separators in a graph1998-07-22Paper
Optimal algorithms for generalized searching in sorted matrices1998-06-30Paper
NC algorithms for the Single Most Vital Edge problem with respect to shortest paths1997-02-28Paper
Optimal parallel selection in sorted matrices1997-02-27Paper
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems1997-02-27Paper
An efficient permutation-based parallel range-join algorithm on \(N\)-dimensional torus computers1996-02-26Paper
An efficient permutation-based parallel algorithm for range-join in hypercubes1996-01-29Paper
https://portal.mardi4nfdi.de/entity/Q52890571994-10-31Paper
A high performance interconnection network for multiprocessor systems1993-11-28Paper
Construction of large‐size interconnection networks with high performance1993-08-23Paper
Improved universal \(k\)-selection in hypercubes1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39871811992-06-28Paper
Improved nonconservative sequential and parallel integer sorting1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38133031988-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: Hong Shen