Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > JACKSON MORRIS:
All reports by Author Jackson Morris:

TR26-081 | 29th April 2026
Farzan Byramji, Daniel Kane, Jackson Morris, Anthony Ostuni

Hard-to-Sample Distributions from Robust Extractors

Revisions: 1

We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extractors, which are extractors that remain sound even when a small number of points violate the min-entropy constraint. Using such objects, ... more >>>


TR26-075 | 13th May 2026
Farzan Byramji, Daniel Kane, Jackson Morris, Anthony Ostuni

On the Advantage of Adaptivity for Sampling with Cell Probes

We construct an explicit distribution $\mathbf{D}$ over $\{0,1\}^N$ that exhibits an essentially optimal separation between adaptive and non-adaptive cell-probe sampling. The distribution can be sampled exactly when each output bit is allowed two adaptive probes to an arbitrarily long sequence of independent uniform symbols from $[N]$. In contrast, any non-adaptive ... more >>>




ISSN 1433-8092 | Imprint