We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributedâ€¦ (More)

We describe a simple randomized construction for generating pairs of hash functions h1,h2 from a universe U to ranges V = [m] = (0,1,...,m-1) and W = [m] so that for every key set S âŠ† U with n = |S|â€¦ (More)

In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval graphs, interval graphs andâ€¦ (More)

We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic read/write registers in asynchronous shared memory models with n processes. We present an adaptiveâ€¦ (More)

We show that for the asymmetric sequential allocation scheme of VÃ¶cking (2003) one can use very simple hash functions. The hash functions we use are a straightforward extension of the hash functionsâ€¦ (More)

We consider augmented ring-based networks with vertices 0,...,n-1, where each vertex is connected to its left and right neighbor and possibly to some further vertices (called long range contacts).â€¦ (More)

Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problemâ€¦ (More)

Bryant [5] has shown that any OBDD for the function MULnâˆ’1,n, i.e. the middle bit of the n-bit multiplication, requires at least 2n/8 nodes. In this paper a stronger lower bound of essentiallyâ€¦ (More)