Polynomial-time pseudodeterministic construction of primes
A randomized algorithm for a search problem is pseudodeterministic if it produces a fixed
canonical solution to the search problem with high probability. In their seminal work on the …
canonical solution to the search problem with high probability. In their seminal work on the …
Tight space lower bound for pseudo-deterministic approximate counting
We investigate one of the most basic problems in streaming algorithms: approximating the
number of elements in the stream. Famously, Mor78 gave a randomized algorithm achieving …
number of elements in the stream. Famously, Mor78 gave a randomized algorithm achieving …
When a random tape is not enough: lower bounds for a problem in adversarially robust streaming
A Chakrabarti, M Stoeckl - arXiv preprint arXiv:2310.03634, 2023 - arxiv.org
Adversarially robust streaming algorithms are required to process a stream of elements and
produce correct outputs, even when each stream element can be chosen depending on …
produce correct outputs, even when each stream element can be chosen depending on …
Pseudo-determinism
O Grossman - 2023 - dspace.mit.edu
A curious property of randomized algorithms for search problems is that on different
executions on the same input, the algorithm may return different outputs due to differences in …
executions on the same input, the algorithm may return different outputs due to differences in …
Variants of Pseudo-deterministic Algorithms and Duality in TFNP
MH Ebtehaj - 2023 - uwspace.uwaterloo.ca
We introduce a new notion of``faux-deterministic''algorithms for search problems in query
complexity. Roughly, for a search problem $\cS $, a faux-deterministic algorithm is a …
complexity. Roughly, for a search problem $\cS $, a faux-deterministic algorithm is a …
On adaptivity and randomness for streaming algorithms
M Stoeckl - 2024 - digitalcommons.dartmouth.edu
A streaming algorithm has a limited amount of memory and reads a long sequence (data
stream) of input elements, one by one, and computes an output depending on the input …
stream) of input elements, one by one, and computes an output depending on the input …
Finding Missing Items Requires Strong Forms of Randomness
A Chakrabarti, M Stoeckl - 2024 - par.nsf.gov
Adversarially robust streaming algorithms are required to process a stream of elements and
produce correct outputs, even when each stream element can be chosen as a function of …
produce correct outputs, even when each stream element can be chosen as a function of …