[an error occurred while processing this directive]<meta name="keywords" content="Department of Computer Science, publications, by date, Mahmoud AboKhamis"></meta><meta name="description" content="Publications, by date, Department of Computer Science, Oxford, Mahmoud AboKhamis"></meta><title>Department of Computer Science, University of Oxford: Mahmoud Abo Khamis : Publications
</title><style type="text/css">
			  .btn-toolbar::after, .btn-toolbar::before
			  {
			    content: " ";
			    display: table;
			  }

			
			.btn-toolbar
			{
			    margin-bottom: 2em;
			}

			  .btn-toolbar::after, .btn-group::after
			  {
			    clear: both;
			  }


			.btn-toolbar .btn, .btn-toolbar .btn-group
			  {
			    float: left;
			}
			
			.btn-group
			  {
			    display: inline-block;
			    position: relative;
			    vertical-align: middle;
			}

			  .btn-group > .btn:first-child:not(:last-child)
			  {
			    border-bottom-right-radius: 0;
			    border-top-right-radius: 0;
			}
			
			.btn-group > .btn:first-child
			  {
			    margin-left: 0;
			}

			.btn-group > .btn
			  {
			    float: left;
			    position: relative;
			}

			  .btn-group > .btn:not(:first-child):not(:last-child)
			  {
			    border-radius: 0;
			}
			
			  .btn-group > .btn:last-child:not(:first-child)
			  {
			    border-bottom-left-radius: 0;
			    border-top-left-radius: 0;
			}
			
			.btn-group .btn + .btn, .btn-group .btn + .btn-group, .btn-group .btn-group + .btn, .btn-group .btn-group + .btn-group
			  {
			    margin-left: -2px;
			}
			</style>[an error occurred while processing this directive]<div class="content-width"><ol class="breadcrumb text-uppercase"><li><a href="/">Home</a></li><li><a href="/aboutus/">About Us</a></li><li><a href="/people/">People</a></li><li><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/Mahmoud.AboKhamis"><span itemprop="name">Mahmoud Abo Khamis</span></a></li><li class="active">Publications</li></ol></div><!-- MOBILE NAVIGATION --><div class="content-width space-below mobile-menu-placeholder visible-xs visible-sm"></div><!-- COLUMNS --><div class="container-fluid content-width"><div class="row"><div class="col-xs-12 col-md-9 col-md-push-3" id="maincontent"><!-- CONTENT (Column 2) --><div class="page-title"><h1>Mahmoud Abo Khamis : Publications
</h1></div><div role="toolbar" class="btn-toolbar"><div class="btn-group"><a href="/people/publications/date/Mahmoud.AboKhamis.html" aria-hidden="true" type="button" class="btn btn-oxford-blue"><span class="glyphicon glyphicon-sort-by-attributes"></span> By date</a><a href="/people/publications/title/Mahmoud.AboKhamis.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By title</a><a href="/people/publications/type/Mahmoud.AboKhamis.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-sort-by-attributes"></span> By type</a><a href="/people/publications/bibtex/Mahmoud.AboKhamis.html" aria-hidden="true" type="button" class="btn btn-default"><span class="glyphicon glyphicon-file"></span> BibTex</a></div></div><p></p><ul class="list-unbulleted list-unbulleted-spaced"><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[1] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Maintaining Queries under Updates Using Heavy&#x2212;Light Partitioning of the Input Relations </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Eden Chmielewski&#x201a; Andrei Draghici&#x201a; Ahmet Kara and Dan Olteanu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 4.
        
            No. 2.
        May,
            2026.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17212-abstract.html">
			Details <span class="sr-only" > about <em> Maintaining Queries under Updates Using Heavy&#x2212;Light Partitioning of the Input Relations  </em></span> </a> |
			<a href="/publications/publication17212.bib">
			BibTeX  <span class="sr-only" > data for <em> Maintaining Queries under Updates Using Heavy&#x2212;Light Partitioning of the Input Relations  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3801905">
		DOI (10.1145/3801905)
		</a> 
					| <a href="https://doi.org/10.1145/3801905"> Link <span class="sr-only" > to <em> Maintaining Queries under Updates Using Heavy&#x2212;Light Partitioning of the Input Relations  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[2] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular&#x2212;Width Time </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud and Hubie Chen  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 4.
        
            No. 2.
        May,
            2026.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17211-abstract.html">
			Details <span class="sr-only" > about <em> Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular&#x2212;Width Time  </em></span> </a> |
			<a href="/publications/publication17211.bib">
			BibTeX  <span class="sr-only" > data for <em> Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular&#x2212;Width Time  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3801904">
		DOI (10.1145/3801904)
		</a> 
					| <a href="https://doi.org/10.1145/3801904"> Link <span class="sr-only" > to <em> Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular&#x2212;Width Time  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[3] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Alexandru&#x2212;Mihai Hurjui&#x201a; Ahmet Kara&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 4.
        
            No. 2.
        May,
            2026.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17210-abstract.html">
			Details <span class="sr-only" > about <em> Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries  </em></span> </a> |
			<a href="/publications/publication17210.bib">
			BibTeX  <span class="sr-only" > data for <em> Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3801891">
		DOI (10.1145/3801891)
		</a> 
					| <a href="https://doi.org/10.1145/3801891"> Link <span class="sr-only" > to <em> Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[4] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            PANDAExpress: A Simpler and Faster PANDA Algorithm </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 4.
        
            No. 2.
        May,
            2026.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17209-abstract.html">
			Details <span class="sr-only" > about <em> PANDAExpress: A Simpler and Faster PANDA Algorithm  </em></span> </a> |
			<a href="/publications/publication17209.bib">
			BibTeX  <span class="sr-only" > data for <em> PANDAExpress: A Simpler and Faster PANDA Algorithm  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3801910">
		DOI (10.1145/3801910)
		</a> 
					| <a href="https://doi.org/10.1145/3801910"> Link <span class="sr-only" > to <em> PANDAExpress: A Simpler and Faster PANDA Algorithm  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[5] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            CorrBound: Cardinality Estimation Accounting for Inter&#x2212; and Intra&#x2212;relation Correlations </strong> </p>
	    <p class="publicationAuthors"> <em> Christoph Mayer&#x201a; Haozhe Zhang&#x201a; Mahmoud Abo Khamis&#x201a; Kyle Deeds&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 4.
        
            No. 1.
        April,
            2026.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17208-abstract.html">
			Details <span class="sr-only" > about <em> CorrBound: Cardinality Estimation Accounting for Inter&#x2212; and Intra&#x2212;relation Correlations  </em></span> </a> |
			<a href="/publications/publication17208.bib">
			BibTeX  <span class="sr-only" > data for <em> CorrBound: Cardinality Estimation Accounting for Inter&#x2212; and Intra&#x2212;relation Correlations  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3786633">
		DOI (10.1145/3786633)
		</a> 
					| <a href="https://doi.org/10.1145/3786633"> Link <span class="sr-only" > to <em> CorrBound: Cardinality Estimation Accounting for Inter&#x2212; and Intra&#x2212;relation Correlations  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[6] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Output&#x2212;Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Alexandru&#x2212;Mihai Hurjui&#x201a; Ahmet Kara&#x201a; Dan Olteanu&#x201a; Dan Suciu and Zilu Tian  </em> </p>
	
	<p class="publicationDetails"> 
            In Balder ten Cate and Maurice Funk, editors,
             
            <em>
            29th International Conference on Database Theory (ICDT 2026)</em>.
        
            Vol. 365
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 18:1&#x2013;18:20.
            Dagstuhl&#x201a; Germany.
        2026.
        Schloss Dagstuhl &#x2013; Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17225-abstract.html">
			Details <span class="sr-only" > about <em> Output&#x2212;Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries  </em></span> </a> |
			<a href="/publications/publication17225.bib">
			BibTeX  <span class="sr-only" > data for <em> Output&#x2212;Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.ICDT.2026.18">
		DOI (10.4230/LIPIcs.ICDT.2026.18)
		</a> 
					| <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2026.18"> Link <span class="sr-only" > to <em> Output&#x2212;Sensitive Evaluation of Acyclic Conjunctive Regular Path Queries  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[7] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Query Optimization and Evaluation via Information Theory </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Companion of the 45th Symposium on Principles of Database Systems</em>.
        
                Pages 2&#x2013;17.
            New York&#x201a; NY&#x201a; USA.
        2026.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17201-abstract.html">
			Details <span class="sr-only" > about <em> Query Optimization and Evaluation via Information Theory  </em></span> </a> |
			<a href="/publications/publication17201.bib">
			BibTeX  <span class="sr-only" > data for <em> Query Optimization and Evaluation via Information Theory  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3788852.3805595">
		DOI (10.1145/3788852.3805595)
		</a> 
					| <a href="https://doi.org/10.1145/3788852.3805595"> Link <span class="sr-only" > to <em> Query Optimization and Evaluation via Information Theory  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[8] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Output&#x2212;Sensitive Evaluation of Regular Path Queries </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Ahmet Kara&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 3.
        
            No. 2.
        June,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17215-abstract.html">
			Details <span class="sr-only" > about <em> Output&#x2212;Sensitive Evaluation of Regular Path Queries  </em></span> </a> |
			<a href="/publications/publication17215.bib">
			BibTeX  <span class="sr-only" > data for <em> Output&#x2212;Sensitive Evaluation of Regular Path Queries  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3725242">
		DOI (10.1145/3725242)
		</a> 
					| <a href="https://doi.org/10.1145/3725242"> Link <span class="sr-only" > to <em> Output&#x2212;Sensitive Evaluation of Regular Path Queries  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[9] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Fast Matrix Multiplication meets the Submodular Width </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Xiao Hu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 3.
        
            No. 2.
        June,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17214-abstract.html">
			Details <span class="sr-only" > about <em> Fast Matrix Multiplication meets the Submodular Width  </em></span> </a> |
			<a href="/publications/publication17214.bib">
			BibTeX  <span class="sr-only" > data for <em> Fast Matrix Multiplication meets the Submodular Width  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3725235">
		DOI (10.1145/3725235)
		</a> 
					| <a href="https://doi.org/10.1145/3725235"> Link <span class="sr-only" > to <em> Fast Matrix Multiplication meets the Submodular Width  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[10] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            LpBound: Pessimistic Cardinality Estimation Using &#x2113;p&#x2212;Norms of Degree Sequences </strong> </p>
	    <p class="publicationAuthors"> <em> Haozhe Zhang&#x201a; Christoph Mayer&#x201a; Mahmoud Abo Khamis&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 3.
        
            No. 3.
        June,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17203-abstract.html">
			Details <span class="sr-only" > about <em> LpBound: Pessimistic Cardinality Estimation Using &#x2113;p&#x2212;Norms of Degree Sequences  </em></span> </a> |
			<a href="/publications/publication17203.bib">
			BibTeX  <span class="sr-only" > data for <em> LpBound: Pessimistic Cardinality Estimation Using &#x2113;p&#x2212;Norms of Degree Sequences  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3725321">
		DOI (10.1145/3725321)
		</a> 
					| <a href="https://doi.org/10.1145/3725321"> Link <span class="sr-only" > to <em> LpBound: Pessimistic Cardinality Estimation Using &#x2113;p&#x2212;Norms of Degree Sequences  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[11] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Vasileios Nakos&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIGMOD Rec.</em>.
        
            Vol. 54.
        
            No. 1.
        
                Pages 7&#x2013;15.
            April,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17217-abstract.html">
			Details <span class="sr-only" > about <em> Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation  </em></span> </a> |
			<a href="/publications/publication17217.bib">
			BibTeX  <span class="sr-only" > data for <em> Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3733620.3733623">
		DOI (10.1145/3733620.3733623)
		</a> 
					| <a href="https://doi.org/10.1145/3733620.3733623"> Link <span class="sr-only" > to <em> Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[12] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            PANDA: Query Evaluation in Submodular Width </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>TheoretiCS</em>.
        
            Vol. Volume 4.
        April,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17216-abstract.html">
			Details <span class="sr-only" > about <em> PANDA: Query Evaluation in Submodular Width  </em></span> </a> |
			<a href="/publications/publication17216.bib">
			BibTeX  <span class="sr-only" > data for <em> PANDA: Query Evaluation in Submodular Width  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.46298/theoretics.25.12">
		DOI (10.46298/theoretics.25.12)
		</a> 
					| <a href="https://theoretics.episciences.org/13722"> Link <span class="sr-only" > to <em> PANDA: Query Evaluation in Submodular Width  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[13] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Unifying Algorithm for Hierarchical Queries </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Jesse Comer&#x201a; Phokion G. Kolaitis&#x201a; Sudeepa Roy and Val Tannen  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 3.
        
            No. 5.
        November,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17213-abstract.html">
			Details <span class="sr-only" > about <em> A Unifying Algorithm for Hierarchical Queries  </em></span> </a> |
			<a href="/publications/publication17213.bib">
			BibTeX  <span class="sr-only" > data for <em> A Unifying Algorithm for Hierarchical Queries  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3767710">
		DOI (10.1145/3767710)
		</a> 
					| <a href="https://doi.org/10.1145/3767710"> Link <span class="sr-only" > to <em> A Unifying Algorithm for Hierarchical Queries  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[14] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Pessimistic Cardinality Estimation </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Kyle Deeds&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIGMOD Rec.</em>.
        
            Vol. 53.
        
            No. 4.
        
                Pages 1&#x2013;17.
            January,
            2025.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17218-abstract.html">
			Details <span class="sr-only" > about <em> Pessimistic Cardinality Estimation  </em></span> </a> |
			<a href="/publications/publication17218.bib">
			BibTeX  <span class="sr-only" > data for <em> Pessimistic Cardinality Estimation  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3712311.3712313">
		DOI (10.1145/3712311.3712313)
		</a> 
					| <a href="https://doi.org/10.1145/3712311.3712313"> Link <span class="sr-only" > to <em> Pessimistic Cardinality Estimation  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[15] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            LpBound in Action: Cardinality Estimation with One&#x2212;Sided Guarantees </strong> </p>
	    <p class="publicationAuthors"> <em> Christoph Mayer&#x201a; Haozhe Zhang&#x201a; Mahmoud Abo Khamis&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Companion of the 2025 International Conference on Management of Data</em>.
        
                Pages 187&#x2013;190.
            New York&#x201a; NY&#x201a; USA.
        2025.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17243-abstract.html">
			Details <span class="sr-only" > about <em> LpBound in Action: Cardinality Estimation with One&#x2212;Sided Guarantees  </em></span> </a> |
			<a href="/publications/publication17243.bib">
			BibTeX  <span class="sr-only" > data for <em> LpBound in Action: Cardinality Estimation with One&#x2212;Sided Guarantees  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3722212.3725114">
		DOI (10.1145/3722212.3725114)
		</a> 
					| <a href="https://doi.org/10.1145/3722212.3725114"> Link <span class="sr-only" > to <em> LpBound in Action: Cardinality Estimation with One&#x2212;Sided Guarantees  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[16] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Join Size Bounds using lp&#x2212;Norms on Degree Sequences </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Vasileios Nakos&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 2.
        
            No. 2.
        May,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17220-abstract.html">
			Details <span class="sr-only" > about <em> Join Size Bounds using lp&#x2212;Norms on Degree Sequences  </em></span> </a> |
			<a href="/publications/publication17220.bib">
			BibTeX  <span class="sr-only" > data for <em> Join Size Bounds using lp&#x2212;Norms on Degree Sequences  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3651597">
		DOI (10.1145/3651597)
		</a> 
					| <a href="https://doi.org/10.1145/3651597"> Link <span class="sr-only" > to <em> Join Size Bounds using lp&#x2212;Norms on Degree Sequences  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[17] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Convergence of datalog over (Pre&#x2212;) Semirings </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; Reinhard Pichler&#x201a; Dan Suciu and Yisu Remy Wang  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>J. ACM</em>.
        
            Vol. 71.
        
            No. 2.
        April,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17202-abstract.html">
			Details <span class="sr-only" > about <em> Convergence of datalog over (Pre&#x2212;) Semirings  </em></span> </a> |
			<a href="/publications/publication17202.bib">
			BibTeX  <span class="sr-only" > data for <em> Convergence of datalog over (Pre&#x2212;) Semirings  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3643027">
		DOI (10.1145/3643027)
		</a> 
					| <a href="https://doi.org/10.1145/3643027"> Link <span class="sr-only" > to <em> Convergence of datalog over (Pre&#x2212;) Semirings  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[18] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Insert&#x2212;Only versus Insert&#x2212;Delete in Dynamic Query Evaluation </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Ahmet Kara&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Proc. ACM Manag. Data</em>.
        
            Vol. 2.
        
            No. 5.
        November,
            2024.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17219-abstract.html">
			Details <span class="sr-only" > about <em> Insert&#x2212;Only versus Insert&#x2212;Delete in Dynamic Query Evaluation  </em></span> </a> |
			<a href="/publications/publication17219.bib">
			BibTeX  <span class="sr-only" > data for <em> Insert&#x2212;Only versus Insert&#x2212;Delete in Dynamic Query Evaluation  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3695837">
		DOI (10.1145/3695837)
		</a> 
					| <a href="https://doi.org/10.1145/3695837"> Link <span class="sr-only" > to <em> Insert&#x2212;Only versus Insert&#x2212;Delete in Dynamic Query Evaluation  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[19] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Convergence of Datalog over (Pre&#x2212;) Semirings </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; Reinhard Pichler&#x201a; Dan Suciu and Yisu Remy Wang  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIGMOD Rec.</em>.
        
            Vol. 52.
        
            No. 1.
        
                Pages 75&#x2013;82.
            June,
            2023.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17221-abstract.html">
			Details <span class="sr-only" > about <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span> </a> |
			<a href="/publications/publication17221.bib">
			BibTeX  <span class="sr-only" > data for <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3604437.3604454">
		DOI (10.1145/3604437.3604454)
		</a> 
					| <a href="https://doi.org/10.1145/3604437.3604454"> Link <span class="sr-only" > to <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[20] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Datalog in Wonderland </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo&#x201a; Reinhard Pichler&#x201a; Dan Suciu and Yisu Remy Wang  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIGMOD Rec.</em>.
        
            Vol. 51.
        
            No. 2.
        
                Pages 6&#x2013;17.
            July,
            2022.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17222-abstract.html">
			Details <span class="sr-only" > about <em> Datalog in Wonderland  </em></span> </a> |
			<a href="/publications/publication17222.bib">
			BibTeX  <span class="sr-only" > data for <em> Datalog in Wonderland  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3552490.3552492">
		DOI (10.1145/3552490.3552492)
		</a> 
					| <a href="https://doi.org/10.1145/3552490.3552492"> Link <span class="sr-only" > to <em> Datalog in Wonderland  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[21] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            The Complexity of Boolean Conjunctive Queries with Intersection Joins </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; George Chichirim&#x201a; Antonia Kormpa and Dan Olteanu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 41st ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 53&#x2013;65.
            New York&#x201a; NY&#x201a; USA.
        2022.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17228-abstract.html">
			Details <span class="sr-only" > about <em> The Complexity of Boolean Conjunctive Queries with Intersection Joins  </em></span> </a> |
			<a href="/publications/publication17228.bib">
			BibTeX  <span class="sr-only" > data for <em> The Complexity of Boolean Conjunctive Queries with Intersection Joins  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3517804.3524156">
		DOI (10.1145/3517804.3524156)
		</a> 
					| <a href="https://doi.org/10.1145/3517804.3524156"> Link <span class="sr-only" > to <em> The Complexity of Boolean Conjunctive Queries with Intersection Joins  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[22] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Optimizing Recursive Queries with Program Synthesis </strong> </p>
	    <p class="publicationAuthors"> <em> Yisu Remy Wang&#x201a; Mahmoud Abo Khamis&#x201a; Hung Q. Ngo&#x201a; Reinhard Pichler and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 2022 International Conference on Management of Data</em>.
        
                Pages 79&#x2013;93.
            New York&#x201a; NY&#x201a; USA.
        2022.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17227-abstract.html">
			Details <span class="sr-only" > about <em> Optimizing Recursive Queries with Program Synthesis  </em></span> </a> |
			<a href="/publications/publication17227.bib">
			BibTeX  <span class="sr-only" > data for <em> Optimizing Recursive Queries with Program Synthesis  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3514221.3517827">
		DOI (10.1145/3514221.3517827)
		</a> 
					| <a href="https://doi.org/10.1145/3514221.3517827"> Link <span class="sr-only" > to <em> Optimizing Recursive Queries with Program Synthesis  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[23] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Convergence of Datalog over (Pre&#x2212;) Semirings </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; Reinhard Pichler&#x201a; Dan Suciu and Yisu Remy Wang  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 41st ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 105&#x2013;117.
            New York&#x201a; NY&#x201a; USA.
        2022.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17226-abstract.html">
			Details <span class="sr-only" > about <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span> </a> |
			<a href="/publications/publication17226.bib">
			BibTeX  <span class="sr-only" > data for <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3517804.3524140">
		DOI (10.1145/3517804.3524140)
		</a> 
					| <a href="https://doi.org/10.1145/3517804.3524140"> Link <span class="sr-only" > to <em> Convergence of Datalog over (Pre&#x2212;) Semirings  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[24] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Bag Query Containment and Information Theory </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Phokion G. Kolaitis&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Trans. Database Syst.</em>.
        
            Vol. 46.
        
            No. 3.
        September,
            2021.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17223-abstract.html">
			Details <span class="sr-only" > about <em> Bag Query Containment and Information Theory  </em></span> </a> |
			<a href="/publications/publication17223.bib">
			BibTeX  <span class="sr-only" > data for <em> Bag Query Containment and Information Theory  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3472391">
		DOI (10.1145/3472391)
		</a> 
					| <a href="https://doi.org/10.1145/3472391"> Link <span class="sr-only" > to <em> Bag Query Containment and Information Theory  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[25] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Instance Optimal Join Size Estimation </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo&#x2212;Khamis&#x201a; Sungjin Im&#x201a; Benjamin Moseley&#x201a; Kirk Pruhs and Alireza Samadian  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>Procedia Computer Science</em>.
        
            Vol. 195.
        
                Pages 135&#x2212;144.
            2021.
        </p> <p
            class="publicationNote"> Proceedings of the XI Latin and American Algorithms&#x201a; Graphs and Optimization Symposium.</p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17232-abstract.html">
			Details <span class="sr-only" > about <em> Instance Optimal Join Size Estimation  </em></span> </a> |
			<a href="/publications/publication17232.bib">
			BibTeX  <span class="sr-only" > data for <em> Instance Optimal Join Size Estimation  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/https://doi.org/10.1016/j.procs.2021.11.019">
		DOI (https://doi.org/10.1016/j.procs.2021.11.019)
		</a> 
					| <a href="https://www.sciencedirect.com/science/article/pii/S187705092102158X"> Link <span class="sr-only" > to <em> Instance Optimal Join Size Estimation  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[26] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Approximate Aggregate Queries Under Additive Inequalities </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo&#x2212;Khamis&#x201a; Sungjin Im&#x201a; Benjamin Moseley&#x201a; Kirk Pruhs and Alireza Samadian  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Symposium on Algorithmic Principles of Computer Systems (APOCS)</em>.
        
                Pages 85&#x2013;99.
            SIAM.
        2021.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17247-abstract.html">
			Details <span class="sr-only" > about <em> Approximate Aggregate Queries Under Additive Inequalities  </em></span> </a> |
			<a href="/publications/publication17247.bib">
			BibTeX  <span class="sr-only" > data for <em> Approximate Aggregate Queries Under Additive Inequalities  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1137/1.9781611976489.7">
		DOI (10.1137/1.9781611976489.7)
		</a> 
					| <a href="https://epubs.siam.org/doi/abs/10.1137/1.9781611976489.7"> Link <span class="sr-only" > to <em> Approximate Aggregate Queries Under Additive Inequalities  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[27] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Relational Gradient Descent Algorithm For Support Vector Machine Training </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo&#x2212;Khamis&#x201a; Sungjin Im&#x201a; Benjamin Moseley&#x201a; Kirk Pruhs and Alireza Samadian  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Symposium on Algorithmic Principles of Computer Systems (APOCS)</em>.
        
                Pages 100&#x2013;113.
            SIAM.
        2021.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17246-abstract.html">
			Details <span class="sr-only" > about <em> A Relational Gradient Descent Algorithm For Support Vector Machine Training  </em></span> </a> |
			<a href="/publications/publication17246.bib">
			BibTeX  <span class="sr-only" > data for <em> A Relational Gradient Descent Algorithm For Support Vector Machine Training  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1137/1.9781611976489.8">
		DOI (10.1137/1.9781611976489.8)
		</a> 
					| <a href="https://epubs.siam.org/doi/abs/10.1137/1.9781611976489.8"> Link <span class="sr-only" > to <em> A Relational Gradient Descent Algorithm For Support Vector Machine Training  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[28] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            An Approximation Algorithm for the Matrix Tree Multiplication Problem </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo&#x2212;Khamis&#x201a; Ryan Curtin&#x201a; Sungjin Im&#x201a; Benjamin Moseley&#x201a; Hung Ngo&#x201a; Kirk Pruhs and Alireza Samadian  </em> </p>
	
	<p class="publicationDetails"> 
            In Filippo Bonchi and Simon J. Puglisi, editors,
             
            <em>
            46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)</em>.
        
            Vol. 202
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 6:1&#x2013;6:14.
            Dagstuhl&#x201a; Germany.
        2021.
        Schloss Dagstuhl &#x2013; Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17229-abstract.html">
			Details <span class="sr-only" > about <em> An Approximation Algorithm for the Matrix Tree Multiplication Problem  </em></span> </a> |
			<a href="/publications/publication17229.bib">
			BibTeX  <span class="sr-only" > data for <em> An Approximation Algorithm for the Matrix Tree Multiplication Problem  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.MFCS.2021.6">
		DOI (10.4230/LIPIcs.MFCS.2021.6)
		</a> 
					| <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.6"> Link <span class="sr-only" > to <em> An Approximation Algorithm for the Matrix Tree Multiplication Problem  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[29] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo&#x201a; Xuanlong Nguyen&#x201a; Dan Olteanu and Maximilian Schleich  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Trans. Database Syst.</em>.
        
            Vol. 45.
        
            No. 2.
        June,
            2020.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17206-abstract.html">
			Details <span class="sr-only" > about <em> Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies  </em></span> </a> |
			<a href="/publications/publication17206.bib">
			BibTeX  <span class="sr-only" > data for <em> Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3375661">
		DOI (10.1145/3375661)
		</a> 
					| <a href="https://doi.org/10.1145/3375661"> Link <span class="sr-only" > to <em> Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[30] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Functional Aggregate Queries with Additive Inequalities </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Ryan R. Curtin&#x201a; Benjamin Moseley&#x201a; Hung Q. Ngo&#x201a; Xuanlong Nguyen&#x201a; Dan Olteanu and Maximilian Schleich  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Trans. Database Syst.</em>.
        
            Vol. 45.
        
            No. 4.
        December,
            2020.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17207-abstract.html">
			Details <span class="sr-only" > about <em> Functional Aggregate Queries with Additive Inequalities  </em></span> </a> |
			<a href="/publications/publication17207.bib">
			BibTeX  <span class="sr-only" > data for <em> Functional Aggregate Queries with Additive Inequalities  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3426865">
		DOI (10.1145/3426865)
		</a> 
					| <a href="https://doi.org/10.1145/3426865"> Link <span class="sr-only" > to <em> Functional Aggregate Queries with Additive Inequalities  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[31] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Bag Query Containment and Information Theory </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Phokion G. Kolaitis&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 39th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 95&#x2013;112.
            New York&#x201a; NY&#x201a; USA.
        2020.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17234-abstract.html">
			Details <span class="sr-only" > about <em> Bag Query Containment and Information Theory  </em></span> </a> |
			<a href="/publications/publication17234.bib">
			BibTeX  <span class="sr-only" > data for <em> Bag Query Containment and Information Theory  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3375395.3387645">
		DOI (10.1145/3375395.3387645)
		</a> 
					| <a href="https://doi.org/10.1145/3375395.3387645"> Link <span class="sr-only" > to <em> Bag Query Containment and Information Theory  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[32] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Decision Problems in Information Theory </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Phokion G. Kolaitis&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In Artur Czumaj&#x201a; Anuj Dawar and Emanuela Merelli, editors,
             
            <em>
            47th International Colloquium on Automata&#x201a; Languages&#x201a; and Programming (ICALP 2020)</em>.
        
            Vol. 168
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 106:1&#x2013;106:20.
            Dagstuhl&#x201a; Germany.
        2020.
        Schloss Dagstuhl &#x2013; Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17233-abstract.html">
			Details <span class="sr-only" > about <em> Decision Problems in Information Theory  </em></span> </a> |
			<a href="/publications/publication17233.bib">
			BibTeX  <span class="sr-only" > data for <em> Decision Problems in Information Theory  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.ICALP.2020.106">
		DOI (10.4230/LIPIcs.ICALP.2020.106)
		</a> 
					| <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.106"> Link <span class="sr-only" > to <em> Decision Problems in Information Theory  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[33] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Boolean Tensor Decomposition for Conjunctive Queries with Negation </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; Dan Olteanu and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In Pablo Barcelo and Marco Calautti, editors,
             
            <em>
            22nd International Conference on Database Theory (ICDT 2019)</em>.
        
            Vol. 127
                of Leibniz International Proceedings in Informatics (LIPIcs).
        
                Pages 21:1&#x2013;21:19.
            Dagstuhl&#x201a; Germany.
        2019.
        Schloss Dagstuhl &#x2013; Leibniz&#x2212;Zentrum f&#xfc;r Informatik.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17238-abstract.html">
			Details <span class="sr-only" > about <em> Boolean Tensor Decomposition for Conjunctive Queries with Negation  </em></span> </a> |
			<a href="/publications/publication17238.bib">
			BibTeX  <span class="sr-only" > data for <em> Boolean Tensor Decomposition for Conjunctive Queries with Negation  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.4230/LIPIcs.ICDT.2019.21">
		DOI (10.4230/LIPIcs.ICDT.2019.21)
		</a> 
					| <a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.21"> Link <span class="sr-only" > to <em> Boolean Tensor Decomposition for Conjunctive Queries with Negation  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[34] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            A Layered Aggregate Engine for Analytics Workloads </strong> </p>
	    <p class="publicationAuthors"> <em> Maximilian Schleich&#x201a; Dan Olteanu&#x201a; Mahmoud Abo Khamis&#x201a; Hung Q. Ngo and XuanLong Nguyen  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 2019 International Conference on Management of Data</em>.
        
                Pages 1642&#x2013;1659.
            New York&#x201a; NY&#x201a; USA.
        2019.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17237-abstract.html">
			Details <span class="sr-only" > about <em> A Layered Aggregate Engine for Analytics Workloads  </em></span> </a> |
			<a href="/publications/publication17237.bib">
			BibTeX  <span class="sr-only" > data for <em> A Layered Aggregate Engine for Analytics Workloads  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3299869.3324961">
		DOI (10.1145/3299869.3324961)
		</a> 
					| <a href="https://doi.org/10.1145/3299869.3324961"> Link <span class="sr-only" > to <em> A Layered Aggregate Engine for Analytics Workloads  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[35] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Learning Models over Relational Data: A Brief Tutorial </strong> </p>
	    <p class="publicationAuthors"> <em> Maximilian Schleich&#x201a; Dan Olteanu&#x201a; Mahmoud Abo&#x2212;Khamis&#x201a; Hung Q. Ngo and XuanLong Nguyen  </em> </p>
	
	<p class="publicationDetails"> 
            In Ben Amor&#x201a; Nahla&#x201a; Benjamin Quost and Martin Theobald, editors,
             
            <em>
            Scalable Uncertainty Management</em>.
        
                Pages 423&#x2013;432.
            Cham.
        2019.
        Springer International Publishing.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17236-abstract.html">
			Details <span class="sr-only" > about <em> Learning Models over Relational Data: A Brief Tutorial  </em></span> </a> |
			<a href="/publications/publication17236.bib">
			BibTeX  <span class="sr-only" > data for <em> Learning Models over Relational Data: A Brief Tutorial  </em></span>   </a>
			
			
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[36] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            On Functional Aggregate Queries with Additive Inequalities </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Ryan R. Curtin&#x201a; Benjamin Moseley&#x201a; Hung Q. Ngo&#x201a; XuanLong Nguyen&#x201a; Dan Olteanu and Maximilian Schleich  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 38th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 414&#x2013;431.
            New York&#x201a; NY&#x201a; USA.
        2019.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17235-abstract.html">
			Details <span class="sr-only" > about <em> On Functional Aggregate Queries with Additive Inequalities  </em></span> </a> |
			<a href="/publications/publication17235.bib">
			BibTeX  <span class="sr-only" > data for <em> On Functional Aggregate Queries with Additive Inequalities  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3294052.3319694">
		DOI (10.1145/3294052.3319694)
		</a> 
					| <a href="https://doi.org/10.1145/3294052.3319694"> Link <span class="sr-only" > to <em> On Functional Aggregate Queries with Additive Inequalities  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[37] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            AC/DC: In&#x2212;Database Learning Thunderstruck </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo&#x201a; XuanLong Nguyen&#x201a; Dan Olteanu and Maximilian Schleich  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the Second Workshop on Data Management for End&#x2212;To&#x2212;End Machine Learning</em>.
        New York&#x201a; NY&#x201a; USA.
        2018.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17244-abstract.html">
			Details <span class="sr-only" > about <em> AC/DC: In&#x2212;Database Learning Thunderstruck  </em></span> </a> |
			<a href="/publications/publication17244.bib">
			BibTeX  <span class="sr-only" > data for <em> AC/DC: In&#x2212;Database Learning Thunderstruck  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3209889.3209896">
		DOI (10.1145/3209889.3209896)
		</a> 
					| <a href="https://doi.org/10.1145/3209889.3209896"> Link <span class="sr-only" > to <em> AC/DC: In&#x2212;Database Learning Thunderstruck  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[38] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            In&#x2212;Database Learning with Sparse Tensors </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; XuanLong Nguyen&#x201a; Dan Olteanu and Maximilian Schleich  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 37th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 325&#x2013;340.
            New York&#x201a; NY&#x201a; USA.
        2018.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17239-abstract.html">
			Details <span class="sr-only" > about <em> In&#x2212;Database Learning with Sparse Tensors  </em></span> </a> |
			<a href="/publications/publication17239.bib">
			BibTeX  <span class="sr-only" > data for <em> In&#x2212;Database Learning with Sparse Tensors  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3196959.3196960">
		DOI (10.1145/3196959.3196960)
		</a> 
					| <a href="https://doi.org/10.1145/3196959.3196960"> Link <span class="sr-only" > to <em> In&#x2212;Database Learning with Sparse Tensors  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[39] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Juggling Functions Inside a Database </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo and Atri Rudra  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>SIGMOD Rec.</em>.
        
            Vol. 46.
        
            No. 1.
        
                Pages 6&#x2013;13.
            May,
            2017.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17224-abstract.html">
			Details <span class="sr-only" > about <em> Juggling Functions Inside a Database  </em></span> </a> |
			<a href="/publications/publication17224.bib">
			BibTeX  <span class="sr-only" > data for <em> Juggling Functions Inside a Database  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3093754.3093757">
		DOI (10.1145/3093754.3093757)
		</a> 
					| <a href="https://doi.org/10.1145/3093754.3093757"> Link <span class="sr-only" > to <em> Juggling Functions Inside a Database  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[40] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            What Do Shannon&#x2212;type Inequalities&#x201a; Submodular Width&#x201a; and Disjunctive Datalog Have to Do with One Another? </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 36th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 429&#x2013;444.
            New York&#x201a; NY&#x201a; USA.
        2017.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17240-abstract.html">
			Details <span class="sr-only" > about <em> What Do Shannon&#x2212;type Inequalities&#x201a; Submodular Width&#x201a; and Disjunctive Datalog Have to Do with One Another?  </em></span> </a> |
			<a href="/publications/publication17240.bib">
			BibTeX  <span class="sr-only" > data for <em> What Do Shannon&#x2212;type Inequalities&#x201a; Submodular Width&#x201a; and Disjunctive Datalog Have to Do with One Another?  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/3034786.3056105">
		DOI (10.1145/3034786.3056105)
		</a> 
					| <a href="https://doi.org/10.1145/3034786.3056105"> Link <span class="sr-only" > to <em> What Do Shannon&#x2212;type Inequalities&#x201a; Submodular Width&#x201a; and Disjunctive Datalog Have to Do with One Another?  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[41] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Joins via Geometric Resolutions: Worst Case and Beyond </strong> </p>
	    <p class="publicationAuthors"> <em> Mahmoud Abo Khamis&#x201a; Hung Q. Ngo&#x201a; Christopher R&#xe9; and Atri Rudra  </em> </p>
	
	<p class="publicationDetails"> 
        In <em>ACM Trans. Database Syst.</em>.
        
            Vol. 41.
        
            No. 4.
        November,
            2016.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17205-abstract.html">
			Details <span class="sr-only" > about <em> Joins via Geometric Resolutions: Worst Case and Beyond  </em></span> </a> |
			<a href="/publications/publication17205.bib">
			BibTeX  <span class="sr-only" > data for <em> Joins via Geometric Resolutions: Worst Case and Beyond  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/2967101">
		DOI (10.1145/2967101)
		</a> 
					| <a href="https://doi.org/10.1145/2967101"> Link <span class="sr-only" > to <em> Joins via Geometric Resolutions: Worst Case and Beyond  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[42] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Computing Join Queries with Functional Dependencies </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo and Dan Suciu  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 35th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 327&#x2013;342.
            New York&#x201a; NY&#x201a; USA.
        2016.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17241-abstract.html">
			Details <span class="sr-only" > about <em> Computing Join Queries with Functional Dependencies  </em></span> </a> |
			<a href="/publications/publication17241.bib">
			BibTeX  <span class="sr-only" > data for <em> Computing Join Queries with Functional Dependencies  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/2902251.2902289">
		DOI (10.1145/2902251.2902289)
		</a> 
					| <a href="https://doi.org/10.1145/2902251.2902289"> Link <span class="sr-only" > to <em> Computing Join Queries with Functional Dependencies  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[43] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            FAQ: Questions Asked Frequently </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo and Atri Rudra  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 35th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 13&#x2013;28.
            New York&#x201a; NY&#x201a; USA.
        2016.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17204-abstract.html">
			Details <span class="sr-only" > about <em> FAQ: Questions Asked Frequently  </em></span> </a> |
			<a href="/publications/publication17204.bib">
			BibTeX  <span class="sr-only" > data for <em> FAQ: Questions Asked Frequently  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/2902251.2902280">
		DOI (10.1145/2902251.2902280)
		</a> 
					| <a href="https://doi.org/10.1145/2902251.2902280"> Link <span class="sr-only" > to <em> FAQ: Questions Asked Frequently  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[44] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            FAQ: Questions Asked Frequently </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis and Mahmoud  </em> </p>
	
	<p class="publicationDetails">  PhD Thesis State University of New York at Buffalo.
        2016.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17248-abstract.html">
			Details <span class="sr-only" > about <em> FAQ: Questions Asked Frequently  </em></span> </a> |
			<a href="/publications/publication17248.bib">
			BibTeX  <span class="sr-only" > data for <em> FAQ: Questions Asked Frequently  </em></span>   </a>
			
			
					| <a href="http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10127614"> Link <span class="sr-only" > to <em> FAQ: Questions Asked Frequently  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li><li>
	
	<div class="row">
		
			<div class="col-xs-1 text-right">
				[45] 
			</div>

		
        
		<div
			class="col-xs-11"
		>
			
	
	<p class="publicationTitle"> <strong>
            Joins via Geometric Resolutions: Worst&#x2212;case and Beyond </strong> </p>
	    <p class="publicationAuthors"> <em> Abo Khamis&#x201a; Mahmoud&#x201a; Hung Q. Ngo&#x201a; Christopher R&#xe9; and Atri Rudra  </em> </p>
	
	<p class="publicationDetails"> 
            In  
            <em>
            Proceedings of the 34th ACM SIGMOD&#x2212;SIGACT&#x2212;SIGAI Symposium on Principles of Database Systems</em>.
        
                Pages 213&#x2013;228.
            New York&#x201a; NY&#x201a; USA.
        2015.
        Association for Computing Machinery.
        </p>
	
        		<p class="publicationlinks"> <a
        
            		href="/publications/publication17242-abstract.html">
			Details <span class="sr-only" > about <em> Joins via Geometric Resolutions: Worst&#x2212;case and Beyond  </em></span> </a> |
			<a href="/publications/publication17242.bib">
			BibTeX  <span class="sr-only" > data for <em> Joins via Geometric Resolutions: Worst&#x2212;case and Beyond  </em></span>   </a>
			
			 | <a
		href="http://dx.doi.org/10.1145/2745754.2745776">
		DOI (10.1145/2745754.2745776)
		</a> 
					| <a href="https://doi.org/10.1145/2745754.2745776"> Link <span class="sr-only" > to <em> Joins via Geometric Resolutions: Worst&#x2212;case and Beyond  </em></span> </a>
  				
		
		</div> 
	</div> 
	
        </li></ul></div><div class="col-xs-12 col-md-3 col-md-pull-9 side-menu-col"><h2 class="side-menu-title text-uppercase"><a href="#">About Us</a></h2><ul class="side-menu"><li class="active mobile-menu-source"><a href="/people/">People</a><ul><li class="active"><a href="/people/faculty.html">Faculty</a></li><li><a href="/people/research.html">Research</a></li><li><a href="/people/students.html">Students</a></li><li><a href="/people/support.html">Professional Services</a></li><li><a href="/people/visitingprofessors.html">Visiting Professors</a></li><li><a href="/people/emeritusfaculty.html">Emeritus Faculty</a></li></ul></li><li><a href="/aboutus/vacancies/">Vacancies</a></li><li><a href="/aboutus/women-cs-oxford/index.html">Women in the department</a></li><li><a href="/aboutus/equality-diversity-inclusion/index.html">Equality, diversity and inclusion</a></li><li><a href="https://www.alumniweb.ox.ac.uk/cs/make-a-donation">Support Us</a></li><li><a href="/aboutus/cshistory.html">Our History</a></li><li><a href="/aboutus/contact.html">Contact Us</a></li></ul></div></div></div>[an error occurred while processing this directive]