On the public citation graph
Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems
0 signed · 31 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11681878_14openalex-snapshot
Calibrating Noise to Sensitivity in Private Data Analysis
inferredcites →https://doi.org/10.1007/978-3-540-79228-4_1openalex-snapshot
Differential Privacy: A Survey of Results
inferredcites →https://doi.org/10.1017/cbo9780511615320openalex-snapshot
Principles of Constraint Programming
inferredcites →https://doi.org/10.1145/1536414.1536466openalex-snapshot
Differential privacy and robust statistics
inferredcites →https://doi.org/10.1145/1863543.1863568openalex-snapshot
Distance makes the types grow stronger
inferredcites →https://doi.org/10.1145/1866739.1866758openalex-snapshot
A firm foundation for private data analysis
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11416-013-0182-7openalex-snapshot
The security of databases: the Access case
inferred← citeshttps://doi.org/10.1109/srds60354.2023.00019openalex-snapshot
PRISPARK: Differential Privacy Enforcement for Big Data Computing in Apache Spark
inferred← citeshttps://doi.org/10.1109/tdsc.2017.2734664openalex-snapshot
Sensitivity Analysis for Non-Interactive Differential Privacy: Bounds and Efficient Algorithms
inferred← citeshttps://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
inferred← citeshttps://doi.org/10.1145/2505351.2505353openalex-snapshot
Sensitivity analysis using type-based constraints
inferred← citeshttps://doi.org/10.1145/2949689.2949695openalex-snapshot
Graph-based modelling of query sets for differential privacy
inferred← citeshttps://doi.org/10.1145/3264820.3264825openalex-snapshot
Sensitivity Analysis of SQL Queries
inferred← citeshttps://doi.org/10.1145/3318464.3389762openalex-snapshot
Computing Local Sensitivities of Counting Queries with Joins
inferred← citeshttps://doi.org/10.1145/3448016.3452813openalex-snapshot
Residual Sensitivity for Differentially Private Multi-Way Joins
inferred← citeshttps://doi.org/10.1145/3453483.3454050openalex-snapshot
Porcupine: a synthesizing compiler for vectorized homomorphic encryption
inferred← citeshttps://doi.org/10.1145/3514221.3517844openalex-snapshot
R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys
inferred← citeshttps://doi.org/10.1145/3589268openalex-snapshot
Better than Composition: How to Answer Multiple Relational Queries under Differential Privacy
inferred← citeshttps://doi.org/10.1145/3631504.3631506openalex-snapshot
Query Evaluation under Differential Privacy
inferred← citeshttps://doi.org/10.1145/3654931openalex-snapshot
Continual Observation of Joins under Differential Privacy
inferred← citeshttps://doi.org/10.2478/popets-2020-0023openalex-snapshot
A Framework of Metrics for Differential Privacy from Local Sensitivity
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.120openalex-snapshot
Sensitivity of Counting Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4795openalex-snapshot
Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins [Full Version, Draft 0.1]
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.