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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static…

2014

We revisit the polytope method for factoring sparse bivariate polynomials over finite fields, and address the bottleneck arising…

2009

We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used…

2008

In modern computer hardware architecture memory is organized in a hierarchy consisting of several types of memory with different…

2006

This thesis provides both experimental and theoretical contributions regarding externalmemory dynamic search trees with fast…

2005

We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for…

1997

We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, an…

1996

We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, an…