DOI,IST REx ID,Research Group,Title of publication
10.1145/3801895,22318,MoHe,Concurrent composition for differentially private continual mechanisms
10.1145/3816252,22716,MoHe,Incremental approximate maximum flow via residual graph sparsification
10.1137/1.9781611978322.95,19038,MoHe,Improved differentially private continual observation using group algebra
10.4230/LIPIcs.SAND.2025.4,19858,MoHe,On b-matching and fully-dynamic maximum k-edge coloring
null,20301,MoHe,Differentially private continual release of histograms and related queries
10.4230/LIPIcs.ESA.2025.36,20534,MoHe,Efficient contractions of dynamic graphs - with applications
10.4230/LIPIcs.ESA.2025.91,20535,MoHe,Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism
10.4230/LIPIcs.WADS.2025.47,20536,MoHe,B-Treaps revised: Write efficient randomized block search trees with high load
10.1137/1.9781611978322.22,19982,MoHe,Fully dynamic approximate minimum cut in subpolynomial time per operation
10.4230/lipics.icalp.2025.91,21280,MoHe,Incremental approximate maximum flow via residual graph sparsification
10.1137/1.9781611977912.11,15093,"HeEd,MoHe",Dynamically maintaining the persistent homology of time series
10.52202/079017-0299,19512,MoHe,Continual counting with gradual privacy expiration
10.4230/LIPIcs.ITCS.2024.55,15008,MoHe,Electrical flows for polylogarithmic competitive oblivious routing
10.1137/1.9781611977929.17,14769,MoHe,Experimental evaluation of fully dynamic k-means via coresets
10.4230/LIPIcs.DISC.2024.21,18557,MoHe,Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges
10.4230/LIPIcs.APPROX/RANDOM.2024.40,18156,MoHe,Private counting of distinct elements in the turnstile model and extensions
10.4230/LIPIcs.ESA.2024.100,18308,MoHe,Fully dynamic k-means coreset in near-optimal update time
null,18115,MoHe,Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond
10.1137/1.9781611977912.111,18503,MoHe,Deterministic near-linear time minimum cut in weighted graphs
null,18116,MoHe,Making old things new: A unified algorithm for differentially private clustering