Ömer Eǧecioǧlu

TL;DR: The algorithm is compared with the distributed-memory implementation of the parallel prefix algorithm proposed by Kruskal, Rudolph, and Snir and is shown to be more efficient when n is large and p 2 (p − 1) ≤ 4 τ .

TL;DR: A randomized protocol that assigns distinct ids to the processes within an expected polynomial number of rounds using a polynometric number of boolean atomic variables is presented.

TL;DR: It is shown that hexagonal partitioning has optimal I/O performance for circular queries among all partitioning methods that use convex non-overlapping regions, and parallel storage and retrieval algorithms for hexagonal partitions can be constructed by using current algorithms for rectangular grid partitioning.

TL;DR: In this article, the authors introduce a new transformation method and a multiplication algorithm for multiplying the elements of the field GF\((2^k) expressed in a normal basis, which is more suitable for applications in which tens or hundreds of field multiplications are performed before needing to transform the results back.