Is there an Oblivious RAM Lower Bound for Online Reads?

Mor Weiss Daniel Wichs

Published in: IACR Cryptol. ePrint Arch. (2018)

Keyphrases

lower bound
upper bound
online algorithms
online learning
objective function
branch and bound
branch and bound algorithm
data sets
optimal solution
dynamic programming
upper and lower bounds
design considerations
real time
linear programming relaxation
competitive ratio