Pith. sign in

[Yes, we outline the setting and the algorithm in Sections 2 and 3.] (b) An analysis of the properties and complexity (time, space, sample size) of any algorithm

For all models, algorithms presented, check if you include: (a) A clear description of the mathematical setting, assumptions, algorithm, and/or model

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.SI 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Counting Graphlets of Size $k$ under Local Differential Privacy

cs.SI · 2025-05-19 · conditional · novelty 6.0

An edge-local differentially private algorithm counts arbitrary k-node graphlets with expected L2 error O(n^{k-1}), matching lower bounds for non-interactive methods and a Ω(n^{k-1.5}) bound for all methods.

citing papers explorer

Showing 1 of 1 citing paper.

  • Counting Graphlets of Size $k$ under Local Differential Privacy cs.SI · 2025-05-19 · conditional · none · ref 1

    An edge-local differentially private algorithm counts arbitrary k-node graphlets with expected L2 error O(n^{k-1}), matching lower bounds for non-interactive methods and a Ω(n^{k-1.5}) bound for all methods.