Quentin Hillebrand

According to our database, Quentin Hillebrand authored at least 9 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Communication-Efficient Publication of Sparse Vectors under Differential Privacy.

Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

CoRR, June, 2025

Counting Graphlets of Size <i>k</i> under Local Differential Privacy.

Vorapong Suppakitpaisarn, Donlapark Ponnoprat, Nicha Hirankarn, Quentin Hillebrand

CoRR, May, 2025

Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs.

Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Facility Location Problem Under Local Differential Privacy Without Super-Set Assumption.

Kevin Pfisterer, Quentin Hillebrand, Vorapong Suppakitpaisarn

Proceedings of the Data and Applications Security and Privacy XXXIX, 2025

Counting Graphlets of Size k under Local Differential Privacy.

Vorapong Suppakitpaisarn, Donlapark Ponnoprat, Nicha Hirankarn, Quentin Hillebrand

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024

Publishing Number of Walks and Katz Centrality under Local Differential Privacy.

Louis Betzer, Vorapong Suppakitpaisarn, Quentin Hillebrand

Proceedings of the Uncertainty in Artificial Intelligence, 2024

2023

Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions.

Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

CoRR, 2023

Local Differential Privacy for Number of Paths and Katz Centrality.

Louis Betzer, Vorapong Suppakitpaisarn, Quentin Hillebrand

CoRR, 2023

Unbiased Locally Private Estimator for Polynomials of Laplacian Variables.

Quentin Hillebrand, Vorapong Suppakitpaisarn, Tetsuo Shibuya

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023