| Publication | Date of Publication | Type |
|---|
A centroid labelling technique and its application to path selection in trees
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping
Journal of Computer and System Sciences | 2021-03-10 | Paper |
Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus
IEEE Transactions on Computers | 2018-07-09 | Paper |
Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1)
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
Coordinated En-Route Web Caching in Multiserver Networks
IEEE Transactions on Computers | 2017-08-08 | Paper |
Embedding Meshes and Tori on Double-Loop Networks of the Same Size
IEEE Transactions on Computers | 2017-07-27 | Paper |
Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks
IEEE Transactions on Computers | 2017-07-12 | Paper |
Effective Reconstruction of Data Perturbed by Random Projections
IEEE Transactions on Computers | 2017-07-12 | Paper |
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks
IEEE Transactions on Computers | 2017-07-12 | Paper |
Edge-independent spanning trees in augmented cubes
Theoretical Computer Science | 2017-03-16 | Paper |
2-space bounded online cube and hypercube packing
Tsinghua Science and Technology | 2016-01-15 | Paper |
Learning a hybrid similarity measure for image retrieval
Pattern Recognition | 2015-12-08 | Paper |
Updating attribute reduction in incomplete decision systems with the variation of attribute set
International Journal of Approximate Reasoning | 2015-07-10 | Paper |
Improved approximation algorithms for computing k disjoint paths subject to two constraints
Journal of Combinatorial Optimization | 2015-07-10 | Paper |
Improved approximation algorithms for constrained fault-tolerant resource allocation
Theoretical Computer Science | 2015-06-10 | Paper |
On the advice complexity of one-dimensional online bin packing
Frontiers in Algorithmics | 2014-09-02 | Paper |
Approximation algorithms for fault tolerant facility allocation
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Improved approximation algorithms for constrained fault-tolerant resource allocation (extended abstract)
Fundamentals of Computation Theory | 2013-08-16 | Paper |
On finding Min-Min disjoint paths
Algorithmica | 2013-06-25 | Paper |
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Lecture Notes in Computer Science | 2013-06-11 | Paper |
On the complexity of the edge-disjoint min-min problem in planar digraphs
Theoretical Computer Science | 2012-06-25 | Paper |
Routing and wavelength assignment for hypercube in array-based WDM optical networks
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
A distributed approximation algorithm for fault-tolerant metric facility location
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
Unconstrained and constrained fault-tolerant resource allocation
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Hardness of finding two edge-disjoint Min-Min paths in digraphs
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
The generalization of some trellis properties of linear codes to group codes
Science in China. Series F | 2010-02-26 | Paper |
The fault-tolerant facility allocation problem
Algorithms and Computation | 2009-12-17 | Paper |
A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Relation Between the Characteristic Generators of a Linear Code and its Dual
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Janus: A Two-Sided Analytical Model for Multi-Stage Coordinated Attacks
Information Security and Cryptology – ICISC 2006 | 2008-05-06 | Paper |
Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees
Transactions on Computational Systems Biology II | 2008-03-19 | Paper |
Nearest lattice point algorithms on semi k-reduced basis
Science in China. Series F | 2007-02-20 | Paper |
Random walk routing in WSNS with regular topologies
Journal of Computer Science and Technology | 2006-10-12 | Paper |
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Sorting on Single-Channel Wireless Sensor Networks
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
Mining informative rule set for prediction
Journal of Intelligent Information Systems | 2005-03-15 | Paper |
A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL
Parallel Algorithms and Applications | 2004-10-06 | Paper |
| scientific article; zbMATH DE number 2040837 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2040811 (Why is no real title available?) | 2004-02-11 | Paper |
More efficient topological sort using reconfigurable optical buses
The Journal of Supercomputing | 2003-08-20 | Paper |
Analysis on extended ant routing algorithms for network routing and management
The Journal of Supercomputing | 2003-08-20 | Paper |
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
International Journal of Computer Mathematics | 2003-05-08 | Paper |
Transversal of disjoint convex polygons.
Information Processing Letters | 2003-01-21 | Paper |
Fast association discovery in derivative transaction collections
Knowledge and Information Systems | 2003-01-08 | Paper |
Fast sequential and parallel algorithms for finding extremal sets
International Journal of Computer Mathematics | 2002-12-19 | Paper |
| scientific article; zbMATH DE number 1750105 (Why is no real title available?) | 2002-11-06 | Paper |
An efficient algorithm for constructing Hamiltonian paths in meshes
Parallel Computing | 2002-09-09 | Paper |
A study of average-case speedup and scalability of parallel computations on static networks
Mathematical and Computer Modelling | 2002-05-05 | Paper |
| scientific article; zbMATH DE number 1700007 (Why is no real title available?) | 2002-02-03 | Paper |
An architecture-independent graphical tool for automatic contention-free process-to-processor mapping
The Journal of Supercomputing | 2001-11-07 | Paper |
| scientific article; zbMATH DE number 1500572 (Why is no real title available?) | 2001-03-12 | Paper |
Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup>
International Journal of Computer Mathematics | 2000-10-30 | Paper |
Fully dynamic algorithms for maintaining extremal sets in a family of sets<sup>∗</sup>
International Journal of Computer Mathematics | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1487620 (Why is no real title available?) | 2000-08-10 | Paper |
| scientific article; zbMATH DE number 1444292 (Why is no real title available?) | 2000-05-09 | Paper |
Finding the k most vital edges with respect to minimum spanning tree
Acta Informatica | 1999-12-20 | Paper |
An efficient clustering algorithm for partitioning parallel programs
Parallel Computing | 1999-01-12 | Paper |
Lower bounds for dynamic tree embedding in bipartite networks
Journal of Parallel and Distributed Computing | 1999-01-06 | Paper |
Performance analysis for dynamic tree embedding in k-partite networks by a random walk
Journal of Parallel and Distributed Computing | 1998-11-01 | Paper |
Optimal parallel multiselection on EREW PRAM
Parallel Computing | 1998-08-13 | Paper |
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science | 1998-07-22 | Paper |
Optimal algorithms for generalized searching in sorted matrices
Theoretical Computer Science | 1998-06-30 | Paper |
NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
Information Processing Letters | 1997-02-28 | Paper |
Optimal parallel selection in sorted matrices
Information Processing Letters | 1997-02-27 | Paper |
NC algorithms for dynamically solving the all pairs shortest paths problem and related problems
Information Processing Letters | 1997-02-27 | Paper |
An efficient permutation-based parallel range-join algorithm on N-dimensional torus computers
Information Processing Letters | 1996-02-26 | Paper |
An efficient permutation-based parallel algorithm for range-join in hypercubes
Parallel Computing | 1996-01-29 | Paper |
| scientific article; zbMATH DE number 278835 (Why is no real title available?) | 1994-10-31 | Paper |
A high performance interconnection network for multiprocessor systems
Parallel Computing | 1993-11-28 | Paper |
Construction of large‐size interconnection networks with high performance
Networks | 1993-08-23 | Paper |
| scientific article; zbMATH DE number 30939 (Why is no real title available?) | 1992-06-28 | Paper |
Improved universal \(k\)-selection in hypercubes
Parallel Computing | 1992-06-28 | Paper |
Improved nonconservative sequential and parallel integer sorting
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4082988 (Why is no real title available?) | 1988-01-01 | Paper |
