Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Fully Dynamic Graph Algorithms with Edge Differential Privacy
Sofya Raskhodnikova, Teresa Anna Steiner
We study differentially private algorithms for analyzing graphs in the challenging setting of continual release with fully dynamic updates, where edges are inserted and deleted ove…
cs.DS2026
Local Node Differential Privacy
Sofya Raskhodnikova, Adam Smith, Connor Wagaman +1
We initiate an investigation of node differential privacy for graphs in the local model of private data analysis. In our model, dubbed LNDP*, each node sees its own edge list and r…
cs.CC2026
Computational Complexity in Property Testing
Renato Ferreira Pinto, Diptaksho Palit, Sofya Raskhodnikova
We initiate a systematic study of the computational complexity of property testing, focusing on the relationship between query and time complexity. While traditional work in proper…