Gianfranco Bilardi

Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines

We propose a parallel algorithm, called adaptive bitonic sorting, which runs on a PRAC, a shared-memory multiprocessor where fetch and store conflicts are disallowed. On a

Area-time lower-bound techniques with applications to sorting

P

Merging and sorting networks with the topology of the omega network

processors PRAC, our algorithm achieves optimal performance

Language Learning without Overgeneralization

TP = O(N log N)

Characterization of associative operations with prefix circuits of constant depth and linear size

, for any computation time

The Influence of Key Length on the Area-Time Complexity of Sorting

T

Digital Filtering in VLSI

in the range

Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions

Omega (log^{2} N) leq T leq O(N log N)

Some Observations on Models of Parallel Computation

. Adaptive bitonic sorting has also a small constant factor, since it performs less than

Mean value of the output of a discrete-time Volterra system driven by a Markov chain (Corresp.)

2N log N