Sciweavers

MST
1998
68views more  MST 1998»
14 years 3 days ago
A Steady State Analysis of Diffracting Trees
Nir Shavit, Eli Upfal, Asaph Zemach
MST
1998
58views more  MST 1998»
14 years 3 days ago
Sorting Algorithms
Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith,...
MST
1998
75views more  MST 1998»
14 years 3 days ago
Periodic Merging Networks
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...
MST
1998
66views more  MST 1998»
14 years 3 days ago
A Strange Application of Kolmogorov Complexity
Daniel Hammer, Alexander Shen
MST
1998
61views more  MST 1998»
14 years 3 days ago
Functions Computable with Nonadaptive Queries to NP
Harry Buhrman, Jim Kadin, Thomas Thierauf
MST
1998
76views more  MST 1998»
14 years 3 days ago
Sharply Bounded Alternation and Quasilinear Time
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
MST
1998
91views more  MST 1998»
14 years 3 days ago
An Experimental Analysis of Parallel
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