D4.C — The Complexity of Verifying Loop-free Programs as Differentially Private
Why the open web links it
Analyzes the computational complexity of verifying differential privacy in loop-free programs.
Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.