
...we propose a framework for networkobliviousness based on a model of computation where the only parameter is the prob lem's input size. algorithms are then evaluated on a...for a wide class of networkoblivious algorithms, optimality in the latter model...

...and we propose a multicoreoblivious approach to algorithms and schedulers for hm. we instantiate this approach with provably ecient multicoreoblivious algorithms for matrix and prefix sum...components. we then use the network oblivious framework proposed earlier as an oblivious framework for a network of processors, and we present...

...we study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. in oblivious algorithms the fact (or probability in...in the class of uniform oblivious randomized algorithms.finally we observe that in case of symmetric networks the aforementioned oblivious randomized algorithm completes gossiping with high probability...

Published in 2005.

...we present oblivious routing algorithms whose routing paths are constructed independent of each other, with no dependence
on the routing history. oblivious algorithms are inherently adaptive to dynamic...utilization. we present two simple oblivious routing algorithms. the first algorithm is for geometric networks in which nodes are embedded...

...that the lower bounds for oblivious and partially oblivious algo rithms are both tight. we do so by presenting optimal oblivious algorithms, which converge after dn 2...surprising convergence complexity collapse of oblivious and partially oblivious algorithms, and a convergence complexity separation between (partially) oblivious and nonoblivious algorithms for optimistic, bottleneck ratebased...
Published in 2000.

...we present dataoblivious algorithms in the externalmemory model...use a number of new algorithmic techniques, including dataoblivious uses of invertible bloom lookup tables, a butterflylike compression network, randomized data thinning, and "shuffle...
Published in 2011.

...we give efficient dataoblivious algorithms for several fundamental geometric
problems...neighbors. our methods are "dataoblivious" in
that they don't...

...we study the performance of oblivious routing algo rithms that follow minimal (shortest) paths, referred to as minimal oblivious routing algorithms in this pa per, using...that the well known deterministic oblivious routing algorithm, namely, the greedy routing algorithm, has competitive ratio (n 1...

...we present an algorithm to find a worstcase traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. the linearity of channel loading offered by oblivious routing algorithms enables the problem to be...
Published in 2001.