Skip to search formSkip to main contentSkip to account menu

Oblivious data structure

An oblivious data structure is a data structure that will give nothing about the sequence or pattern of the operations that have been applied except… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations… 
2016
2016
We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying… 
2007
2007
Abstract We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all… 
2007
2007
We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations in… 
2006
2006
We present static cache-oblivious dictionary structures for strings which provide analogues of tries and suffix trees in the… 
2005
2005
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for… 
Highly Cited
2002
Highly Cited
2002
(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and… 
Highly Cited
2002
Highly Cited
1997
Highly Cited
1997
We introduce the notion of oblivious data structure, motivated by the use of data structuresin cryptography. Informally, an… 
1996
1996
We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, an…