Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

JPDC
2010

favoriteEmaildiscussreport

109views more JPDC 2010»

An efficient parallel algorithm for building the separating tree

12 years 11 months ago

An efficient parallel algorithm for building the separating tree

Download ww1.ucmss.com

We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CREW PRAM and O(log n log log n) time using O(n log n) operations on the CRCW PRAM.

Yijie Han, Sanjeev Saxena, Xiaojun Shen

Real-time Traffic

CREW PRAM | Efficient Parallel Algorithm | JPDC 2010 | Separable Permutation |

claim paper

Related Content

» Building Dynamic Multicast Trees in Mobile Networks

» On Gazit and Millers Parallel Algorithm for Planar Separators Achieving Greater Efficiency...

» Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP

» Memory Efficient SelfStabilizing Algorithm to Construct BFS Spanning Trees

» Building Large Phylogenetic Trees on CoarseGrained Parallel Machines

» Efficiently building a parse tree from a regular expression

» Building species trees from larger parts of phylogenomic databases

» A Streaming Parallel Decision Tree Algorithm

» Distribution TreeBuilding RealValued Evolutionary Algorithm

Post Info
More Details (n/a)

Added	19 May 2011
Updated	19 May 2011
Type	Journal
Year	2010
Where	JPDC
Authors	Yijie Han, Sanjeev Saxena, Xiaojun Shen

Comments (0)