Titlebook: Algorithm Theory - SWAT ‘92; Third Scandinavian W Otto Nurmi,Esko Ukkonen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 199

急性

Retrieval of scattered information by EREW, CREW and CRCW PRAMs,me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.

有罪

HUSH

Parallel algorithms for priority queue operations, of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.

Missile

疏遠天際

Fractional cascading simplified, and captures some of the inherent difficulties associated with the fractional casading data structure. In particular, we use tools from branching process theory and derive some useful asymptotic bounds. The probability of deviation from the expected performance bounds decreases rapidly with number of keys.

Generator

https://doi.org/10.1007/978-3-658-29556-1me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.

羊齒

Mandana Biegi,Jürgen F?rster,Thomas Philipped algorithm routes packets consisting of . flits each (. arbitrary), with . · n/4 + 2 · . + . · log .).) routing steps, with very high probability. The practical importance of this work is enhanced even more by the fact that the distribution of the packets only needs to be approximately a . permutation.

門閂

Kai Hafez,Susanne Frank,Sandra T?nzer of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.

Pageant

neutralize