4 citations · 4 across the 7 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Distributed Statistical Zero-Knowledge Proofs via Sumcheck
Benjamin Jauregui, Masayuki Miyamoto
We study distributed zero-knowledge proofs, introduced by Bick, Kol, and Oshman (SODA 2022). While distributed interactive proofs have advanced rapidly, general-purpose techniques…
cs.DC2024
Distributed Complexity of -freeness: Decision and Certification
Masayuki Miyamoto
The class of graphs that do not contain a path on nodes as an induced subgraph (-free graphs) has rich applications in the theory of graph algorithms. This paper explores…
cs.DC2021
Lower Bounds for Induced Cycle Detection in Distributed Computing
François Le Gall, Masayuki Miyamoto
The distributed subgraph detection asks, for a fixed graph , whether the -node input graph contains as a subgraph or not. In the standard CONGEST model of distributed com…