Sparse Approximation, List Decoding, and Uncertainty Principles. - Mahmoud Abo Khamis; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra (CoRR, 2014)

FAQ: Questions Asked Frequently. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (PODS, 2016)

Computing Join Queries with Functional Dependencies. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (PODS, 2016)

Joins via Geometric Resolutions: Worst Case and Beyond. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Christopher Ré; Atri Rudra (ACM Trans. Database Syst., 2016)

What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (PODS, 2017)

Juggling Functions Inside a Database. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (SIGMOD Rec., 2017)

In-Database Learning with Sparse Tensors. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (PODS, 2018)

AC/DC: In-Database Learning Thunderstruck. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (DEEM@SIGMOD, 2018)

Boolean Tensor Decomposition for Conjunctive Queries with Negation. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Olteanu; Dan Suciu (ICDT, 2019)

A Layered Aggregate Engine for Analytics Workloads. - Maximilian Schleich; Dan Olteanu; Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen (SIGMOD Conference, 2019)

Learning Models over Relational Data: A Brief Tutorial. - Maximilian Schleich; Dan Olteanu; Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen (SUM, 2019)

Decision Problems in Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ICALP, 2020)

Functional Aggregate Queries with Additive Inequalities. - Mahmoud Abo Khamis; Ryan R. Curtin; Benjamin Moseley; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (ACM Trans. Database Syst., 2020)

Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies. - Mahmoud Abo Khamis; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (ACM Trans. Database Syst., 2020)

Approximate Aggregate Queries Under Additive Inequalities. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

A Relational Gradient Descent Algorithm For Support Vector Machine Training. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

Instance Optimal Join Size Estimation. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (LAGOS, 2021)

An Approximation Algorithm for the Matrix Tree Multiplication Problem. - Mahmoud Abo Khamis; Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (MFCS, 2021)

Bag Query Containment and Information Theory. - Mahmoud Abo Khamis; Phokion G. Kolaitis; Hung Q. Ngo 001; Dan Suciu (ACM Trans. Database Syst., 2021)

The Complexity of Boolean Conjunctive Queries with Intersection Joins. - Mahmoud Abo Khamis; George Chichirim; Antonia Kormpa; Dan Olteanu (PODS, 2022)

Optimizing Recursive Queries with Progam Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (SIGMOD Conference, 2022)

Optimizing Recursive Queries with Program Synthesis. - Yisu Remy Wang; Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu (CoRR, 2022)

Datalog in Wonderland. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2022)

Join Size Bounds using Lp-Norms on Degree Sequences. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (CoRR, 2023)

Convergence of Datalog over (Pre-) Semirings. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Reinhard Pichler; Dan Suciu; Yisu Remy Wang (SIGMOD Rec., 2023)

Fast Matrix Multiplication meets the Subdmodular Width. - Mahmoud Abo Khamis; Xiao Hu 005; Dan Suciu (CoRR, 2024)

Join Size Bounds using lp-Norms on Degree Sequences. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (Proc. ACM Manag. Data, 2024)

Insert-Only versus Insert-Delete in Dynamic Query Evaluation. - Mahmoud Abo Khamis; Ahmet Kara 002; Dan Olteanu; Dan Suciu (Proc. ACM Manag. Data, 2024)

Pessimistic Cardinality Estimation. - Mahmoud Abo Khamis; Kyle Deeds; Dan Olteanu; Dan Suciu (SIGMOD Rec., 2024)

LpBound in Action: Cardinality Estimation with One-Sided Guarantees. - Christoph Mayer 010; Haozhe Zhang 001; Mahmoud Abo Khamis; Dan Olteanu; Dan Suciu (SIGMOD Conference Companion, 2025)

PANDA: Query Evaluation in Submodular Width. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Dan Suciu (TheoretiCS, 2025)

Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation. - Mahmoud Abo Khamis; Vasileios Nakos; Dan Olteanu; Dan Suciu (SIGMOD Rec., 2025)

Fast Matrix Multiplication meets the Submodular Width. - Mahmoud Abo Khamis; Xiao Hu 005; Dan Suciu (Proc. ACM Manag. Data, 2025)

Output-Sensitive Evaluation of Regular Path Queries. - Mahmoud Abo Khamis; Ahmet Kara 002; Dan Olteanu; Dan Suciu (Proc. ACM Manag. Data, 2025)

A Unifying Algorithm for Hierarchical Queries. - Mahmoud Abo Khamis; Jesse Comer; Phokion G. Kolaitis; Sudeepa Roy 001; Val Tannen (CoRR, 2025)

LpBound: Pessimistic Cardinality Estimation Using ℓp-Norms of Degree Sequences. - Haozhe Zhang 001; Christoph Mayer 010; Mahmoud Abo Khamis; Dan Olteanu; Dan Suciu (Proc. ACM Manag. Data, 2025)