93 citations · 93 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
On a Conjecture for Parameterized st-Orientations
Charalampos Papamanthou
MaxSTN and MinSTN -- proposed by Papamanthou and Tollis (TCS 2008, JGAA 2010) -- are two algorithms for producing -orientations of biconnected graphs with long and short longes…
cs.DS2025
Practical and Accurate Local Edge Differentially Private Graph Algorithms
Pranay Mundra, Charalampos Papamanthou, Julian Shun +1
The rise of massive networks across diverse domains necessitates sophisticated graph analytics, often involving sensitive data and raising privacy concerns. This paper addresses th…
cs.DS2020
Generalized Cuckoo Hashing with a Stash, Revisited
Brice Minaud, Charalampos Papamanthou
Cuckoo hashing is a common hashing technique, guaranteeing constant-time lookups in the worst case. Adding a stash was proposed by Kirsch, Mitzenmacher, and Wieder at SICOMP 2010,…