- “A Theoretical Framework for Distribution-Aware Dataset Search”, PODS 2025
- “Smallest Synthetic Witnesses for Conjunctive Queries”, PODS 2025
- “Improved Approximation Algorithms for Relational Clustering”, PODS 2025
- “Computing A Well-Representative Summary of Conjunctive Query Results”, PODS 2025
- “Range (Renyi) Entropy Queries and Partitioning”, LMCS 2025
- “Combinatorial upper bounds for the smallest eigenvalue of a graph”, AdM 2024
- Conference Services:
- Program Committee: WWW 2025, CIKM 2025, CIKM 2024
- Reviewer: SIGMOD, ICDT, WWW, TKDE, CIKM, SoCG
Research Experience
- Position: Ph.D. Student
- Work Experience: Conducting research at the University of Illinois Chicago, focusing on improving database query efficiency and relational clustering.
Education
- PhD: University of Illinois Chicago, Department of Computer Science, Advisor: Stavros Sintos, 2021 to present
- B.Sc.: Amirkabir University of Technology, Computer Science, Graduation year not specified
Background
- Research Interests: Theoretical aspects of databases and data management, particularly at the intersection of Computational Geometry and Database Management.
- Professional Field: Computer Science
- Brief Introduction: Currently a second-year Ph.D. student in the Computer Science department at the University of Illinois Chicago, with Stavros Sintos as his advisor.
Miscellany
- Personal Interests: Solving algorithmic riddles of any kind, enjoys doing research in any subfield of TCS (Theoretical Computer Science).