The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yamin Li: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yamin Li, Shietung Peng, Wanming Chu
    Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2004, pp:222-228 [Conf]
  2. Wanming Chu, Yamin Li
    Cost/Performance Tradeoff of n-Select Square Root Implementations. [Citation Graph (0, 0)][DBLP]
    ACAC, 2000, pp:9-16 [Conf]
  3. Kenji Watanabe, Wanming Chu, Yamin Li
    Exploiting Java Instruction/Thread Level Parallelism with Horizontal Multithreading. [Citation Graph (0, 0)][DBLP]
    ACSAC, 2001, pp:35-44 [Conf]
  4. Yamin Li, Shietung Peng, Wanming Chu
    Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    CIS, 2004, pp:51-56 [Conf]
  5. Yamin Li, Shietung Peng, Wanming Chu
    From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. [Citation Graph (0, 0)][DBLP]
    CW, 2002, pp:85-94 [Conf]
  6. Yamin Li, Wanming Chu
    Implementation of single precision floating point square root on FPGAs. [Citation Graph (0, 0)][DBLP]
    FCCM, 1997, pp:226-233 [Conf]
  7. Yamin Li, Wanming Chu
    The Effects of STEF in Finely Parallel Multithreaded Processors. [Citation Graph (0, 0)][DBLP]
    HPCA, 1995, pp:318-325 [Conf]
  8. Yamin Li, Wanming Chu
    A New Non-Restoring Square Root Algorithm and its VLSI Implementation. [Citation Graph (0, 0)][DBLP]
    ICCD, 1996, pp:538-544 [Conf]
  9. Yamin Li, Wanming Chu
    Parallel-Array Implementations of a Non-Restoring Square Root Algorithm. [Citation Graph (0, 0)][DBLP]
    ICCD, 1997, pp:690-695 [Conf]
  10. Yamin Li, Shietung Peng
    Fault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2001, pp:315-322 [Conf]
  11. Yamin Li, Shietung Peng, Wanming Chu
    Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. [Citation Graph (0, 0)][DBLP]
    ICPADS (1), 2005, pp:71-77 [Conf]
  12. Yi Pan, Yamin Li, Jie Li, Keqin Li, Si-Qing Zheng
    Computing Distance Maps Efficiently Using an Optical Bus. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:178-185 [Conf]
  13. Yamin Li, Shietung Peng, Wanming Chu
    Online Adaptive Fault-Tolerant Routing in 2D Torus. [Citation Graph (0, 0)][DBLP]
    ISPA, 2005, pp:150-161 [Conf]
  14. Yamin Li, Shietung Peng, Wanming Chu
    Efficient Communication in Metacube: A New Interconnection Network. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:165-0 [Conf]
  15. Yamin Li, Shietung Peng, Wanming Chu
    An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2004, pp:196-201 [Conf]
  16. Yamin Li, Shietung Peng, Wanming Chu
    An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2005, pp:75-79 [Conf]
  17. Yamin Li, Shietung Peng, Wanming Chu
    K-MCore for Multicasting on Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2006, pp:109-114 [Conf]
  18. Yamin Li, Shietung Peng, Wanming Chu
    Fault-tolerant cycle embedding in hypercube with mixed link and node failures. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2004, pp:561-566 [Conf]
  19. Yamin Li, Wanming Chu
    Design and Implementation of a Multiple-Instruction-Stream. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Systems, 1995, pp:477-480 [Conf]
  20. Yamin Li, Shietung Peng, Wanming Chu
    Efficient Collective Communications in Dual-Cube. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2004, v:28, n:1, pp:71-90 [Journal]
  21. Yi Pan, Yamin Li, Jie Li, Keqin Li, Si-Qing Zheng
    Efficient parallel algorithms for distance maps of 2D binary images using an optical bus. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part A, 2002, v:32, n:2, pp:228-236 [Journal]

  22. Hamiltonian Connectedness of Recursive Dual-Net. [Citation Graph (, )][DBLP]


  23. Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. [Citation Graph (, )][DBLP]


  24. A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  25. The Recursive Dual-Net and Its Applications. [Citation Graph (, )][DBLP]


  26. K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. [Citation Graph (, )][DBLP]


  27. An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. [Citation Graph (, )][DBLP]


  28. Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. [Citation Graph (, )][DBLP]


  29. Parallel Prefix Computation in the Recursive Dual-Net. [Citation Graph (, )][DBLP]


  30. Prefix Computation and Sorting in Dual-Cube. [Citation Graph (, )][DBLP]


  31. K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  32. Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. [Citation Graph (, )][DBLP]


  33. An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. [Citation Graph (, )][DBLP]


  34. An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. [Citation Graph (, )][DBLP]


  35. Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. [Citation Graph (, )][DBLP]


  36. Two improvements in genetic programming for image classification. [Citation Graph (, )][DBLP]


  37. Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002