Results 1 
8 of
8
DataOblivious Graph Algorithms for Secure Computation and Outsourcing
"... This work treats the problem of designing dataoblivious algorithms for classical and widely used graph problems. A dataoblivious algorithm is defined as having the same sequence of operations regardless of the input data and dataindependent memory accesses. Such algorithms are suitable for secure ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
This work treats the problem of designing dataoblivious algorithms for classical and widely used graph problems. A dataoblivious algorithm is defined as having the same sequence of operations regardless of the input data and dataindependent memory accesses. Such algorithms are suitable for secure processing in outsourced and similar environments, which serves as the main motivation for this work. We provide dataoblivious algorithms for breadthfirst search, singlesource singledestination shortest path, minimum spanning tree, and maximum flow, the asymptotic complexities of which are optimal, or close to optimal, for dense graphs.
On computational models for flash memory devices
 in Experimental Algorithms, 2009
"... Abstract. Flash memorybased solidstate disks are fast becoming the dominant form of enduser storage devices, partly even replacing the traditional harddisks. Existing twolevel memory hierarchy models fail to realize the full potential of flashbased storage devices. We propose two new computati ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. Flash memorybased solidstate disks are fast becoming the dominant form of enduser storage devices, partly even replacing the traditional harddisks. Existing twolevel memory hierarchy models fail to realize the full potential of flashbased storage devices. We propose two new computation models, the general flash model and the unitcost model, for memory hierarchies involving these devices. Our models are simple enough for meaningful algorithm design and analysis. In particular, we show that a broad range of existing externalmemory algorithms and data structures based on the merging paradigm can be adapted efficiently into the unitcost model. Our experiments show that the theoretical analysis of algorithms on our models corresponds to the empirical behavior of algorithms when using solidstate disks as external memory. 1
On the value of multiple read/write streams for data compression
 In Proceedings CPM ’09, LNCS n. 5577
, 2009
"... Abstract. We study whether, when restricted to using polylogarithmic memory and polylogarithmic passes, we can achieve qualitatively better data compression with multiple read/write streams than we can with only one. We first show how we can achieve universal compression using only one pass over one ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We study whether, when restricted to using polylogarithmic memory and polylogarithmic passes, we can achieve qualitatively better data compression with multiple read/write streams than we can with only one. We first show how we can achieve universal compression using only one pass over one stream. We then show that one stream is not sufficient for us to achieve good grammarbased compression. Finally, we show that two streams are necessary and sufficient for us to achieve entropyonly bounds. 1
CacheOblivious Construction of a WellSeparated Pair Decomposition
"... We present a cacheoblivious algorithm for computing a wellseparated pair decomposition of a finite point set S ⊂ Rd using O(sort(S)) memory transfers. ..."
Abstract
 Add to MetaCart
(Show Context)
We present a cacheoblivious algorithm for computing a wellseparated pair decomposition of a finite point set S ⊂ Rd using O(sort(S)) memory transfers.
On Cartesian Trees and Range Minimum Queries
"... We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cacheoblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree of a tree for the bottleneck edge query problem on trees and undirected graphs, ..."
Abstract
 Add to MetaCart
(Show Context)
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cacheoblivious Cartesian tree for solving the range minimum query problem, a Cartesian tree of a tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian tree exists for the twodimensional version of the range minimum query problem. 1
Pruning spanners and constructing wellseparated pair decompositions in the presence of memory hierarchies
, 2010
"... ..."
Level 1
"... 13 14 15 16Breadth‐first search • Level‐by‐level graph traversal • Serial complexity: Θ(m+n) ..."
Abstract
 Add to MetaCart
13 14 15 16Breadth‐first search • Level‐by‐level graph traversal • Serial complexity: Θ(m+n)