24th Annual Symposium on Foundations of Computer Science (sfcs 1983) (1983)
Nov. 7, 1983 to Nov. 9, 1983
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1983.32
We study probabilistic on-line simulators for several machine models (or memory structures). The simulators have a more constrained access to data than the virtual machines, but are allowed to use probabilistic means to improve average access time. We show that in many cases coin tosses can not make up for inadequate access.
J. Simon and R. Paturi, "Lower bounds on the time of probabilistic on-line simulations," 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)(FOCS), vol. 00, no. , pp. 343-350, 1983.