Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efficient heap memory allocator. Instead ...
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...