Recommendations
Cites work
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- Balanced Allocations
- Balanced allocations: the heavily loaded case
- Compressed representations of sequences and full-text indexes
- Cuckoo hashing
- Fully functional static and dynamic succinct trees
- Indexing compressed text
- Oblivious RAM Revisited
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Optimizing ORAM and Using It Efficiently for Secure Computation
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Rank/select operations on large alphabets
- Representing trees of higher degree
- Space efficient suffix trees
- Space-efficient frameworks for top-k string retrieval
- Squeezing succinct data structures into entropy bounds
- Statistically-secure ORAM with \(\tilde{O}(\log^2 n)\) overhead
- Succinct representation of balanced parentheses and static trees
- Ultra-succinct representation of ordered trees
Cited in
(5)
This page was built for publication: Succinct oblivious RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304151)
