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, `2 approximation, finding a non...
Main Authors: | Goldwasser, Shafrira, Grossman, Ofer. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/129560 |
Similar Items
-
Pseudo-deterministic proofs
by: Goldwasser, Shafi, et al.
Published: (2021) -
Bipartite Perfect Matching in Pseudo-Deterministic NC
by: Goldwasser, Shafi, et al.
Published: (2021) -
On the pseudo-deterministic query complexity of NP search problems
by: Goldwasser, S, et al.
Published: (2021) -
Pseudo-determinism
by: Grossman, Ofer
Published: (2023) -
Formalizing Data Deletion in the Context of the Right to Be Forgotten
by: Goldwasser, Shafrira, et al.
Published: (2021)