Author： Nomura Ken-Ichi Kalia Rajiv Nakano Aiichiro Vashishta Priya Landa Jorge
Publisher： Springer Publishing Company
ISSN： 0920-8542
Source： The Journal of Supercomputing, Vol.41, Iss.2, 2007-08, pp. : 109-117
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Matching user requirements in parallel programming
By Decker K.M. Dvorak J.J. Rehmann R.M. Ruhl R.
Future Generation Computer Systems, Vol. 12, Iss. 4, 1996-12 ,pp. :
Access to resources
Recommend
Fast parallel string prefix-matching
By Breslauer D.
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :
A sublinear parallel algorithm for stable matching
By Feder T. Megiddo N. Plotkin S.A.
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :
Smart-Structures Technology for Parallel Robots
Journal of Intelligent and Robotic Systems, Vol. 63, Iss. 3-4, 2011-09 ,pp. :