| Differential Privacy and the US Census
|
2019 |
Dwork, Cynthia |
| 2019 ACM PODS Alberto O. Mendelzon Test-of-Time Award
|
2019 |
Su, Jianwen |
| On the Enumeration Complexity of Unions of Conjunctive Queries
|
2019 |
Carmeli, Nofar |
| What Storage Access Privacy is Achievable with Small Overhead?
|
2019 |
Patel, Sarvar |
| HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
|
2019 |
Fischl, Wolfgang |
| Regularizing Conjunctive Features for Classification
|
2019 |
Barceló, Pablo |
| Split-Correctness in Information Extraction
|
2019 |
Doleschal, Johannes |
| Containment of Shape Expression Schemas for RDF
|
2019 |
Staworko, Stawek |
| On Functional Aggregate Queries with Additive Inequalities
|
2019 |
Khamis, Mahmoud Abo |
| Attacking Diophantus: Solving a Special Case of Bag Containment
|
2019 |
Konstantinidis, George |
| Topology Dependent Bounds For FAQ
|
2019 |
Langberg, Michael |
| Instance and Output Optimal Parallel Algorithms for Acyclic Joins
|
2019 |
Hu, Xiao |
| Algorithmic Fairness: Measures, Methods and Representations
|
2019 |
Venkatasubramanian, Suresh |
| Probabilistic Databases with an Infinite Open-World Assumption
|
2019 |
Grohe, Martin |
| Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
|
2019 |
Arenas, Marcelo |
| Database Repairs and Consistent Query Answering: Origins and Further Developments
|
2019 |
Bertossi, Leopoldo |
| The Complexity of Counting Cycles in the Adjacency List Streaming Model
|
2019 |
Kallaugher, John |
| Robust Set Reconciliation via Locality Sensitive Hashing
|
2019 |
Mitzenmacher, Michael |
| Tight Trade-offs for the Maximum k-Coverage Problem 230 in the General Streaming Model
|
2019 |
Indvk, Piotr |
| Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives
|
2019 |
Borassi, Michele |
Tag hinzufügen