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 …

We connect the study of pseudodeterministic algorithms to two major open problems about
the structural complexity of BPTIME: proving hierarchy theorems and showing the existence …

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 …

Many streaming algorithms provide only a high-probability relative approximation. These
two relaxations, of allowing approximation and randomization, seem necessary--for many …

A probabilistic algorithm A is pseudodeterministic if, on every input, there exists a canonical
value that is output with high probability. If the algorithm outputs one of k canonical values …

We introduce and study the following natural total search problem, which we call the heavy
element avoidance (Heavy Avoid) problem: for a distribution on N bits specified by a …

The Acceptance Probability Estimation Problem (APEP) is to additively approximate the
acceptance probability of a Boolean circuit. This problem admits a probabilistic …

Random algorithms have a unique place in complexity theory as a model of computation
that ispotentially more powerful than “normal” algorithms, and is also practical. However, it is …