Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > SIDHANTH MOHANTY:
All reports by Author Sidhanth Mohanty:

TR19-177 | 6th December 2019
Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David Woodruff

Pseudo-deterministic Streaming

A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions. Classic streaming algorithms, such as those for finding heavy hitters, approximate counting, $\ell_2$ approximation, finding a nonzero entry in a vector (for turnstile algorithms) ... more >>>




ISSN 1433-8092 | Imprint