Abstract is missing.
- Differential Privacy and the US CensusCynthia Dwork. 1 [doi]
- Regularizing Conjunctive Features for ClassificationPablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld. 2-16 [doi]
- Probabilistic Databases with an Infinite Open-World AssumptionMartin Grohe, Peter Lindner. 17-31 [doi]
- Query Evaluation in Election DatabasesBenny Kimelfeld, Phokion G. Kolaitis, Muhammad Tibi. 32-46 [doi]
- 2019 ACM PODS Alberto O. Mendelzon Test-of-Time AwardJianwen Su, Dirk Van Gucht, Victor Vianu. 47 [doi]
- Database Repairs and Consistent Query Answering: Origins and Further DevelopmentsLeopoldo E. Bertossi. 48-58 [doi]
- Efficient Logspace Classes for Enumeration, Counting, and Uniform GenerationMarcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros. 59-73 [doi]
- Ranked Enumeration of Minimal TriangulationsNoam Ravid, Dori Medini, Benny Kimelfeld. 74-88 [doi]
- Enumeration on Trees with Tractable Combined Complexity and Efficient UpdatesAntoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth. 89-103 [doi]
- Counting Database Repairs under Primary Keys RevisitedMarco Calautti, Marco Console, Andreas Pieris. 104-118 [doi]
- The Complexity of Counting Cycles in the Adjacency List Streaming ModelJohn Kallaugher, Andrew McGregor 0001, Eric Price, Sofya Vorotnikova. 119-133 [doi]
- On the Enumeration Complexity of Unions of Conjunctive QueriesNofar Carmeli, Markus Kröll. 134-148 [doi]
- Split-Correctness in Information ExtractionJohannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven. 149-163 [doi]
- Robust Set Reconciliation via Locality Sensitive HashingMichael Mitzenmacher, Tom Morgan. 164-181 [doi]
- What Storage Access Privacy is Achievable with Small Overhead?Sarvar Patel, Giuseppe Persiano, Kevin Yeo. 182-199 [doi]
- Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming ModelPiotr Indyk, Ali Vakilian. 200-217 [doi]
- Weighted Reservoir Sampling from Distributed StreamsRajesh Jayaram, Gokarna Sharma, Srikanta Tirthapura, David P. Woodruff. 218-235 [doi]
- Distributed and Streaming Linear Programming in Low DimensionsSepehr Assadi, Nikolai Karpov, Qin Zhang. 236-253 [doi]
- Better Sliding Window Algorithms to Maximize Subadditive and Diversity ObjectivesMichele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam. 254-268 [doi]
- Making Consistency Protocols SerializableAlan Fekete. 269 [doi]
- The Space-Efficient Core of VadalogGerald Berger, Georg Gottlob, Andreas Pieris, Emanuel Sallinger. 270-284 [doi]
- Decidable XPath Fragments in the Real WorldDavid Baelde, Anthony Lick, Sylvain Schmitz. 285-302 [doi]
- Containment of Shape Expression Schemas for RDFSlawek Staworko, Piotr Wieczorek. 303-319 [doi]
- Complexity Bounds for Relational Algebra over Document SpannersLiat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll. 320-334 [doi]
- Reachability in Database-driven Systems with Numerical Attributes under Recency BoundingParosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali. 335-352 [doi]
- Compiling Existential Positive Queries to Bounded-Variable FragmentsChristoph Berkholz, Hubie Chen. 353-364 [doi]
- Testability of Homomorphism Inadmissibility: Property Testing Meets Database TheoryHubie Chen, Yuichi Yoshida. 365-382 [doi]
- The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment ProblemsHubie Chen. 383-398 [doi]
- Attacking Diophantus: Solving a Special Case of Bag ContainmentGeorge Konstantinidis, Fabio Mogavero. 399-413 [doi]
- On Functional Aggregate Queries with Additive InequalitiesMahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo 0001, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich. 414-431 [doi]
- Topology Dependent Bounds For FAQsMichael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra. 432-449 [doi]
- Instance and Output Optimal Parallel Algorithms for Acyclic JoinsXiao Hu, Ke Yi 0001. 450-463 [doi]
- HyperBench: A Benchmark and Tool for Hypergraphs and Empirical FindingsWolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler. 464-480 [doi]
- Algorithmic Fairness: Measures, Methods and RepresentationsSuresh Venkatasubramanian. 481 [doi]