The SCEAS System
Navigation Menu

Journals in DBLP

Parallel Processing Letters
1998, volume: 8, number: 3

  1. Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Vaidyanathan
    Tighter and Broader Complexity Results for Reconfigurable Models. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:271-282 [Journal]
  2. Yueming Li, Jianhui Tao, Si-Qing Zheng
    A Symmetric Processor Array with Synchronous Optical Buses and Switches. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:283-295 [Journal]
  3. Tzung-Pei Hong, Jyh-Jong Lee
    A Nearly Optimal Back-Propagation Learning Algorithm on a Bus-Based Architecture. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:297-306 [Journal]
  4. Jie Wu
    Fault-Tolerant Communications in Cube-Based Multiple-Bus Systems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:307-320 [Journal]
  5. Chunming Qiao, Yousong Mei
    An Improved Embedding of Binary Trees in a Square Reconfigurable Array with Spanning Optical Buses. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:321-336 [Journal]
  6. Sook-Yeon Kim, Oh-Heum Kwon, Kyung-Yong Chwa
    Embeddings of Butterflies into Hypermeshes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:337-350 [Journal]
  7. M. Manzur Murshed, Richard P. Brent
    Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:351-361 [Journal]
  8. Tarun Anand, Phalguni Gupta
    A Selection Algorithm for X + Y on Mesh. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:363-370 [Journal]
  9. Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes
    Hamilton Cycle Decomposition of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:371-385 [Journal]
  10. Marek Karpinski, Wojciech Rytter
    On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:387-397 [Journal]
  11. Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis
    A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:399-405 [Journal]
  12. Paraskevas Evripidou, Robert Barry
    Mapping Fortran Programs to Single Assignment Semantics for Efficient Parallelization. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:407-418 [Journal]
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