Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NATHAN SHEFFIELD:
All reports by Author Nathan Sheffield:

TR25-150 | 14th October 2025
James Cook, Surendra Ghentiyala, Ian Mertz, Edward Pyne, Nathan Sheffield

The Structure of In-Place Space-Bounded Computation

In the standard model of computing multi-output functions in logspace ($\text{FL}$), we are given a read-only tape holding $x$ and a logarithmic length worktape, and must print $f(x)$ to a dedicated write-only tape. However, there has been extensive work (both in theory and in practice) on in-place algorithms for ... more >>>


TR24-188 | 21st November 2024
Edward Pyne, Nathan Sheffield, William Wang

Catalytic Communication

The study of space-bounded computation has drawn extensively from ideas and results in the field of communication complexity. Catalytic Computation (Buhrman, Cleve, Koucký, Loff and Speelman, STOC 2013) studies the power of bounded space augmented with a pre-filled hard drive that can be used non-destructively during the computation. Presently, many ... more >>>




ISSN 1433-8092 | Imprint