default search action
Mahmoud Abo Khamis
Person information
- affiliation: RelationalAI, Berkeley, CA, USA
- affiliation: LogicBlox Inc., Berkeley, CA, USA
- affiliation (PhD): University at Buffalo, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Mahmoud Abo Khamis
, Hung Q. Ngo
Convergence of datalog over (Pre-) Semirings. J. ACM 71(2): 8:1-8:55 (2024) - [j9]Mahmoud Abo Khamis
Join Size Bounds using lp-Norms on Degree Sequences. Proc. ACM Manag. Data 2(2): 96 (2024) - [j8]Mahmoud Abo Khamis
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. Proc. ACM Manag. Data 2(5): 219:1-219:26 (2024) - [i23]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
PANDA: Query Evaluation in Submodular Width. CoRR abs/2402.02001 (2024) - 2023
- [j7]Mahmoud Abo Khamis
Convergence of Datalog over (Pre-) Semirings. SIGMOD Rec. 52(1): 75-82 (2023) - [i22]Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
Join Size Bounds using Lp-Norms on Degree Sequences. CoRR abs/2306.14075 (2023) - [i21]Mahmoud Abo Khamis, Ahmet Kara
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. CoRR abs/2312.09331 (2023) - 2022
- [j6]Mahmoud Abo Khamis
Datalog in Wonderland. SIGMOD Rec. 51(2): 6-17 (2022) - [c19]Mahmoud Abo Khamis
The Complexity of Boolean Conjunctive Queries with Intersection Joins. PODS 2022: 53-65 - [c18]Mahmoud Abo Khamis
Convergence of Datalog over (Pre-) Semirings. PODS 2022: 105-117 - [c17]Yisu Remy Wang, Mahmoud Abo Khamis
Optimizing Recursive Queries with Progam Synthesis. SIGMOD Conference 2022: 79-93 - [i20]Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu:
Optimizing Recursive Queries with Program Synthesis. CoRR abs/2202.10390 (2022) - 2021
- [j5]Mahmoud Abo Khamis
Bag Query Containment and Information Theory. ACM Trans. Database Syst. 46(3): 12:1-12:39 (2021) - [c16]Mahmoud Abo Khamis
Approximate Aggregate Queries Under Additive Inequalities. APOCS 2021: 85-99 - [c15]Mahmoud Abo Khamis
A Relational Gradient Descent Algorithm For Support Vector Machine Training. APOCS 2021: 100-113 - [c14]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. LAGOS 2021: 135-144 - [c13]Mahmoud Abo Khamis
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [i19]Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang:
Convergence of Datalog over (Pre-) Semirings. CoRR abs/2105.14435 (2021) - [i18]Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa, Dan Olteanu:
The Complexity of Boolean Conjunctive Queries with Intersection Joins. CoRR abs/2106.13342 (2021) - 2020
- [j4]Mahmoud Abo Khamis
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies. ACM Trans. Database Syst. 45(2): 7:1-7:66 (2020) - [j3]Mahmoud Abo Khamis
Functional Aggregate Queries with Additive Inequalities. ACM Trans. Database Syst. 45(4): 17:1-17:41 (2020) - [c12]Mahmoud Abo Khamis
Decision Problems in Information Theory. ICALP 2020: 106:1-106:20 - [c11]Mahmoud Abo Khamis
Bag Query Containment and Information Theory. PODS 2020: 95-112 - [i17]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. CoRR abs/2003.10588 (2020) - [i16]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Decision Problems in Information Theory. CoRR abs/2004.08783 (2020) - [i15]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR abs/2005.05325 (2020) - [i14]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. CoRR abs/2012.08083 (2020)
2010 – 2019
- 2019
- [c10]Mahmoud Abo Khamis
Boolean Tensor Decomposition for Conjunctive Queries with Negation. ICDT 2019: 21:1-21:19 - [c9]Mahmoud Abo Khamis
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [c8]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis
A Layered Aggregate Engine for Analytics Workloads. SIGMOD Conference 2019: 1642-1659 - [c7]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. SUM 2019: 423-432 - [i13]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
A Layered Aggregate Engine for Analytics Workloads. CoRR abs/1906.08687 (2019) - [i12]Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, Dan Suciu:
Bag Query Containment and Information Theory. CoRR abs/1906.09727 (2019) - [i11]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. CoRR abs/1911.06577 (2019) - 2018
- [c6]Mahmoud Abo Khamis
In-Database Learning with Sparse Tensors. PODS 2018: 325-340 - [c5]Mahmoud Abo Khamis
AC/DC: In-Database Learning Thunderstruck. DEEM@SIGMOD 2018: 8:1-8:10 - [i10]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
AC/DC: In-Database Learning Thunderstruck. CoRR abs/1803.07480 (2018) - [i9]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j2]Mahmoud Abo Khamis
Juggling Functions Inside a Database. SIGMOD Rec. 46(1): 6-13 (2017) - [c4]Mahmoud Abo Khamis
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? PODS 2017: 429-444 - [i8]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
Juggling Functions Inside a Database. CoRR abs/1703.03147 (2017) - [i7]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. CoRR abs/1703.04780 (2017) - [i6]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. CoRR abs/1712.07445 (2017) - 2016
- [j1]Mahmoud Abo Khamis
Joins via Geometric Resolutions: Worst Case and Beyond. ACM Trans. Database Syst. 41(4): 22:1-22:45 (2016) - [c3]Mahmoud Abo Khamis
FAQ: Questions Asked Frequently. PODS 2016: 13-28 - [c2]Mahmoud Abo Khamis
Computing Join Queries with Functional Dependencies. PODS 2016: 327-342 - [i5]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
Computing Join Queries with Functional Dependencies. CoRR abs/1604.00111 (2016) - [i4]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu:
What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR abs/1612.02503 (2016) - 2015
- [c1]Mahmoud Abo Khamis
Joins via Geometric Resolutions: Worst-case and Beyond. PODS 2015: 213-228 - [i3]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. CoRR abs/1504.04044 (2015) - 2014
- [i2]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. CoRR abs/1404.0703 (2014) - [i1]Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra:
Sparse Approximation, List Decoding, and Uncertainty Principles. CoRR abs/1404.5190 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: