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â€¦Â (More)

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

2015

2015

- Daniel S. Roche, Adam J. Aviv, Seung Geol Choi
- 2016 IEEE Symposium on Security and Privacy (SP)
- 2015

We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varyingâ€¦Â (More)

Is this relevant?

2009

2009

- Peyman Afshani, Chris H. Hamilton, Norbert Zeh
- Symposium on Computational Geometry
- 2009

We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of spaceâ€¦Â (More)

Is this relevant?

2007

2007

- Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
- SIAM J. Comput.
- 2007

We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations inâ€¦Â (More)

Is this relevant?

2006

2006

- Gerth StÃ¸lting Brodal, Rolf Fagerberg
- SODA
- 2006

We present static cache-oblivious dictionary structures for strings which provide analogues of tries and suffix trees in theâ€¦Â (More)

Is this relevant?

2005

2005

- Lars Arge, Gerth StÃ¸lting Brodal, Rolf Fagerberg, Morten Laustsen
- Symposium on Computational Geometry
- 2005

We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results forâ€¦Â (More)

Is this relevant?

2005

2005

- Lars Arge, Mark de Berg, Herman J. Haverkort
- Algorithmica
- 2005

We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that allâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

(MATH) In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, andâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
- SODA
- 2002

This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed data structure is <i>cacheâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Daniele Micciancio
- STOC
- 1997

We introduce the notion of oblivious data structure, motivated by the use of data structuresin cryptography. Informally, anâ€¦Â (More)

Is this relevant?

1997

1997

We introduce the notion of oblivious data structure, motivated by the use of data structures in cryptography. Informally, anâ€¦Â (More)

Is this relevant?