Search Sciweavers | Sciweavers

658 search results - page 9 / 132

» Lower bounds for sorting networks

click to vote

SPAA
1995
ACM

111views Distributed And Parallel Com...» more SPAA 1995»

Parallel Sorting with Limited Bandwidth

15 years 3 months ago

Download www.ee.unlv.edu

We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...

Micah Adler, John W. Byers, Richard M. Karp

claim paper

Read More »

101

Voted

ENDM
2010

101views more ENDM 2010»

Strong Lower Bounds for a Survivable Network Design Problem

14 years 11 months ago

Download www.ads.tuwien.ac.at

We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...

Markus Leitner, Günther R. Raidl

claim paper

Read More »

Voted

DMTCS
1998

100views Mathematics» more DMTCS 1998»

Lower bounds for sparse matrix vector multiplication on hypercubic networks

14 years 11 months ago