A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Random-Query Model and the Memory-Bounded Coupon Collector

2020
*
Innovations in Theoretical Computer Science
*

We study a new model of space-bounded computation, the random-query model. The model is based on a branching-program over input variables x1, . . . , xn. In each time step, the branching program gets as an input a random index i ∈ {1, . . . , n}, together with the input variable xi (rather than querying an input variable of its choice, as in the case of a standard (oblivious) branching program). We motivate the new model in various ways and study time-space tradeoff lower bounds in this model.

doi:10.4230/lipics.itcs.2020.20
dblp:conf/innovations/RazZ20
fatcat:23lbsxrrhbeyvjtozfwz2mkvle