MST 1998 | Sciweavers

We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher�...

Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...

claim paper

Read More »

21

click to vote

MST
1998

66views more MST 1998»

A Strange Application of Kolmogorov Complexity

13 years 10 months ago

Download www.lif.univ-mrs.fr

Daniel Hammer, Alexander Shen

claim paper

Read More »

16

click to vote

MST
1998

61views more MST 1998»

Functions Computable with Nonadaptive Queries to NP

13 years 10 months ago

Download www.uni-ulm.de

Harry Buhrman, Jim Kadin, Thomas Thierauf

claim paper

Read More »

31

click to vote

MST
1998

76views more MST 1998»

Sharply Bounded Alternation and Quasilinear Time

13 years 10 months ago

Download home.adelphi.edu

We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith

claim paper

Read More »

37

click to vote

MST
1998

91views more MST 1998»

An Experimental Analysis of Parallel

13 years 10 months ago

Download www.cs.cmu.edu

We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...

Guy E. Blelloch, Charles E. Leiserson

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers