On Architecture Selection for Linear Inverse Problems with Untrained Neural Networks. - Yang Sun; Hangdong Zhao; Jonathan Scarlett (Entropy, 2021)

The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (ICALP, 2023)

Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. - Hangdong Zhao; Shaleen Deep; Paraschos Koutris (PODS, 2023)

Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. - Yifei Yang; Hangdong Zhao; Xiangyao Yu; Paraschos Koutris (CIDR, 2024)

Evaluating Datalog via Structure-Aware Rewriting. - Hangdong Zhao; Paraschos Koutris; Shaleen Deep (Datalog, 2024)

Tight Bounds of Circuits for Sum-Product Queries. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (Proc. ACM Manag. Data, 2024)

Evaluating Datalog over Semirings: A Grounding-based Approach. - Hangdong Zhao; Shaleen Deep; Paraschos Koutris; Sudeepa Roy 001; Val Tannen (Proc. ACM Manag. Data, 2024)

Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. - Hangdong Zhao; Austen Z. Fan; Xiating Ouyang; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

Output-sensitive Conjunctive Query Evaluation. - Shaleen Deep; Hangdong Zhao; Austen Z. Fan; Paraschos Koutris (Proc. ACM Manag. Data, 2024)

The Quest for Faster Join Algorithms (Invited Talk). - Paraschos Koutris; Shaleen Deep; Austen Z. Fan; Hangdong Zhao (ICDT, 2025)

Circuit Bounds for Conjunctive Queries with Self-joins. - Austen Z. Fan; Paraschos Koutris; Hangdong Zhao (Proc. ACM Manag. Data, 2025)