Cache-Oblivious Data Structures for Orthogonal Range Searching Pankaj K. Agarwal∗ Lars Arge†

Source URL: www.daimi.au.dk

• Cache
• Computer science
• Cache-oblivious algorithm
• K-d tree
• Binary logarithm
• Computational geometry
• Range tree
• Fast Fourier transform
• Bin
• Mathematics
• Computing
• Analysis of algorithms

Verifiable Homomorphic Oblivious Transfer and Private Equality Test Helger Lipmaa Laboratory for Theoretical CS, Department of CS&E Helsinki University of Technology, P.O.Box 5400, FIN[removed]HUT, Espoo, Finland helger@tc

Source URL: www.iacr.org

• Homomorphic encryption
• Oblivious transfer
• Paillier cryptosystem
• Naccache–Stern cryptosystem
• Commitment scheme
• ElGamal encryption
• Transmission Control Protocol
• Cryptography
• Public-key cryptography
• Cryptographic protocols

Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs Carmit Hazay∗ Abstract In this paper we study the two fundamental functionalities oblivious polynomial evaluation in the

Source URL: eprint.iacr.org

• Oblivious transfer
• Secure multi-party computation
• Decisional Diffie–Hellman assumption
• ElGamal encryption
• XTR
• IP
• Degree of a polynomial
• Proof of knowledge
• Cryptography
• Cryptographic protocols
• Polynomials

Privacy-Preserving Methods for Sharing Financial Risk Exposures∗ Emmanuel A. Abbe,1,2 Amir E. Khandani,3 Andrew W. Lo2,3,4∗ 1 EPFL School of Communication and Computer Sciences

Source URL: secure.brightworkinc.net

• Secure multi-party computation
• Internet privacy
• Information privacy
• Oblivious transfer
• Cryptographic protocols
• Ethics
• Privacy

Cache-Oblivious Algorithms E XTENDED A BSTRACT Matteo Frigo Charles E. Leiserson Harald Prokop Sridhar Ramachandran

Source URL: supertech.csail.mit.edu

• Analysis of algorithms
• Applied mathematics
• Cache-oblivious algorithm
• Fast Fourier transform
• Asymptotically optimal algorithm
• CPU cache
• Cooley–Tukey FFT algorithm
• Cache algorithms
• Merge sort
• Mathematics
• Theoretical computer science
• Cache

Cache-Oblivious String B-trees for a single key κ after κ∗ , and thus cannot overlap[removed]t[removed]h[removed]e[removed]n[removed]e[removed]a[removed]r[removed]r[removed]i[removed]g[removed]h)4

Source URL: supertech.csail.mit.edu

Cache-Oblivious Streaming B-trees Michael A. Bender Martin Farach-Colton Jeremy T. Fineman

Source URL: supertech.csail.mit.edu

• B-tree
• Tree traversal
• T-tree
• Rope
• R-tree
• Linked list
• Tree
• Self-balancing binary search tree
• Binary search tree
• Binary trees
• Graph theory
• Computing

Portable High-Performance Programs by Matteo Frigo Laurea, Universit`a di Padova[removed]Dottorato di Ricerca, Universit`a di Padova (1996)

Source URL: supertech.csail.mit.edu

• Cilk
• Charles E. Leiserson
• Computer architecture
• Microprocessors
• Digital signal processing
• Cache-oblivious algorithm
• Parallel computing
• Thread
• Microarchitecture
• Computing
• Cache
• Central processing unit

The Pochoir Stencil Compiler Yuan Tang Rezaul Chowdhury Chi-Keung Luk

Source URL: supertech.csail.mit.edu

• Computational science
• Scientific modeling
• Simulation software
• Stencil codes
• Wave equation
• Stencil
• Heat equation
• Projection
• Cache-oblivious algorithm
• Mathematical analysis
• Visual arts
• Mathematics

Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman Department of Computer Science

Source URL: supertech.csail.mit.edu

• Data management
• B-tree
• Linked lists
• T-tree
• Skip list
• Trie
• Insertion sort
• Priority queue
• Cache-oblivious algorithm
• Computing
• Binary trees
• Computer programming