Find Academic Supervisors

• Database Systems
• Graph Databases
• Data Management
• +7 more

Amol Deshpande is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, College of Engineering. With over 160 publications spanning from 2000 to 2025, his research has significantly impacted the database systems community. His work bridges theoretical foundations with practical systems, evidenced by numerous publications in top-tier venues including SIGMOD, VLDB, and ICDE. Professor Deshpande's research focuses on database systems, with particular expertise in graph databases, data management, probabilistic databases, query optimization, and data provenance. His work addresses fundamental challenges in managing complex data, including efficient graph analytics, dataset versioning, streaming data processing, and privacy-preserving data management. Recent research directions include entity-relationship abstractions beyond traditional relations, standalone catalog engines for large data systems, and graph theoretical approaches to dataset versioning. His publication trends show a consistent focus on evolving database technologies, with early work on probabilistic databases and query optimization, transitioning to graph analytics and data provenance, and more recently addressing modern challenges in data cataloging, privacy-first data management, and serverless stream processing. His research spans both theoretical contributions (e.g., approximation algorithms for stochastic optimization) and practical systems building (e.g., RStore, TreeCat). Professor Deshpande has mentored numerous PhD students who have become active researchers in the database community, including Hui Miao, Souvik Bhattacherjee, and Konstantinos Xirogiannopoulos. His collaborative work spans across institutions, with frequent collaborations with researchers from MIT, University of Maryland, and other leading institutions. His research has been supported by major funding agencies and has influenced both academic research and industry practices in data management. The evolution of his work reflects the changing landscape of data management, from traditional relational systems to modern graph and streaming data challenges.

Jan PfisterView profile

Researcher

• Natural Language Processing
• Deep Learning
• Sentiment Analysis
• +5 more

Jan Pfister is a researcher at the Chair of Data Science (Informatik X) , affiliated with the Faculty of Mathematics and Computer Science at the University of Würzburg . Holding an M.Sc. in Computer Science from 2021, he contributes to the DMIR group while maintaining the BibSonomy platform. His work bridges Natural Language Processing and Deep Learning , with a focus on structured sentiment analysis and German language modeling. His research explores the integration of Large Language Models with Pointer Networks to extract fine-grained sentiment information. He has developed ModernGBERT , a German-only encoder model, and LLäMmlein , advancing NLP capabilities for the language. Pfister's recent publications highlight trends in encoder-decoder architectures, model-agnostic hallucination detection, and multi-label classification frameworks that refine LLM outputs. He has taught courses including Information Retrieval (SS '22), Text Mining (WS '23), and Selected Topics in Machine Learning (SS'21, WS '21, WS'24). His collaborative projects span medical informatics, human-AI interaction, and social media analysis, often involving interdisciplinary teams and real-world data.

Max WillseyView profile

Assistant Professor

• Program Optimization
• Programming Languages
• Databases
• +5 more

Max Willsey is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley, since 2024. He specializes in program optimization, leveraging techniques from programming languages, databases, and systems to develop robust and accessible compiler frameworks. His research focuses on equality saturation, E-Graphs, and the integration of Datalog with compiler optimizations. He has contributed to advancements in unifying algorithmic approaches, enabling faster and more extensible program analysis. Teaching: CS 164 (Programming Languages and Compilers, Spring 2025), CS 265 (Compiler Optimization, Fall 2024), and CS 294-260 (Declarative Program Analysis and Optimization, Spring 2024). Research Highlights: Development of the egg and egglog projects, co-organizing the EGRAPHS workshop, and leading the EGRAPHS Community for e-graphs researchers. His recent articles highlight trends in unifying traditional hash joins with worst-case optimal joins, applying equality saturation to diverse domains like Datalog and tensor graph optimization, and advancing E-Graphs for program synthesis and formal verification. Scientific Awards: SIGMOD Record Research Highlight, 2024 MIT PL Review Selection, 2024 Distinguished Paper, OOPSLA 2021 and POPL 2021 NSF Graduate Research Fellowship Honorable Mention, 2018 Qualcomm Innovation Fellow, 2019 Service: Committee Member, PLDI 2025, POPL 2025, ASPLOS 2025 Co-organizer, EGRAPHS 2024 and 2023 workshops Interviewer, UC Berkeley Graduate Admissions Committee, 2024

• Knowledge Representation
• Ontology Engineering
• Semantic Web
• +6 more

Cassia Trojahn is a permanent Lecturer at the University of Toulouse 2 Jean Jaurès , affiliated with IRIT - UMR 5505, Department of Mathematics and Computer Science. Her career spans institutions in France, Portugal, Brazil, and the Netherlands, with roles including Expert Engineer at Joseph Fourier University and Post-Doc at INRIA Rhône-Alpes. Education Semantic Web, Ontology Alignment, Business Intelligence (University of Toulouse) Functional Programming (Haskell, Scala), Information Extraction (Pierre Mendès University) Graph Theory and Complexity (University of Évora) Research Interests : Knowledge representation and semantic web technologies Ontology alignment methodologies (argumentation, complex alignments, holistic approaches) Earth observation data integration with contextual information Open science and FAIR data principles Argumentation frameworks for mapping reconciliation Query rewriting with complex correspondences Advising : Co-supervised 5 PhD theses across France and Brazil, including: Jordane Dorne (2018-2021) - Earth observation semantic change detection Élodie Thiéblin (2016-2019) - Complex ontology alignment Roger Granada (2011-2015) - Hierarchical relations extraction Projects : Participated in international (CAMELEON, MULTIFARM) and European (EFFECTOR, CANDELA, SEALS) projects focused on multilingual ontology alignment, maritime situational awareness, and semantic earth observation data analysis.

• Theoretical Computer Science
• Circuit Design
• Computational Complexity
• +3 more

Günter Hotz is a full Professor at the Department of Computer Science (Fachrichtung Informatik), Universität des Saarlandes , Germany. His academic career spans over five decades, including roles as Director of the Computer Center (1972-1974) Spokesperson for SFB 100 (1982-1984) and SFB 124 (1991-1992) . Research Interests include Theoretical Computer Science Circuit Design Computational Complexity Information Theory Geometric Motion Planning Formal Verification . His work focuses on analytic machines, hardware verification, and motion planning algorithms, with applications in linguistics and VLSI design. Publications emphasize formal methods for hardware, computational models over real numbers, and efficient parsing algorithms. Key trends involve integrating mathematical theory with practical circuit design and motion planning solutions. Scientific Awards include Leibniz Prize (1986) Konrad Zuse Medal (1999) Grand Cross of Merit (1998) . Students : Supervised 40 dissertations, with over a third of his advisees becoming professors in mathematics and computer science. Labs & Projects : Led major research initiatives like SFB 100 (COMSKEE system) and SFB 124 (VLSI design methods). Collaborative works with international institutions in France, the U.S., and Georgia.

• Semantic Web
• Ontology-Based Data Access
• Knowledge Graphs
• +3 more

Martin Giese is affiliated with the University of Oslo (Department of Informatics) and the University Clinic Tübingen (Department of Cognitive Neurology). He is a researcher with a focus on semantic technologies, ontology-based data access, and visual query systems. Research Themes : Semantic Web, Ontology Engineering, Knowledge Graphs, Geological Informatics, Probabilistic Logic, Automated Reasoning Key Collaborations : Siemens, Statoil, Norwegian Petroleum Directorate, and various European research institutions Technical Contributions : Developed visual query systems (OptiqueVQS), ontology-driven geological modeling (GeoFault), and semantic data integration frameworks for industrial applications. His work spans both theoretical logic and practical implementations in big data environments. Publications : Recent articles focus on fault ontologies, process representation, and semantic embeddings. Earlier work includes foundational research in automated theorem proving and UML formalization.

Pascal WeisenburgerView profile

Researcher

• Programming Languages
• Multitier Programming
• Tierless Programming
• +12 more

Pascal Weisenburger is a researcher at the School of Computer Science , University of St. Gallen. His work focuses on programming languages for distributed systems , emphasizing multitier programming, reactive paradigms, and type-driven placement reasoning. Research Themes : Multitier programming languages, CRDTs, dynamic placement type systems, reactive microservices, compiler correctness, and domain-specific scheduling. Recent Articles : Explored E-graphs for disequality reasoning (POPL 2025), array type duality in functional languages (ECOOP 2024), and formal verification of CRDTs (PLDI 2023). Committee Roles : Participated in program/steering committees for ECOOP, SPLASH, APLAS, and IEEE BigData conferences. Key Contributions : Developed the ScalaLoci language for multitier systems, proposed Propel for algebraic property verification, and introduced Dyno for static reasoning in dynamic placement scenarios.

Zachary TatlockView profile

Associate Professor

• Programming Languages
• Formal Verification
• Compiler Optimization
• +5 more

Zachary Tatlock is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington. He leads the UW PLSE research group and focuses on making programming languages and compilers more accessible through formal verification and practical tool development. Current affiliations: University of Washington (Paul G. Allen School) Academic rank: Associate Professor His research spans programming languages, compiler optimization, and formal verification, with recent work on: E-Graphs and equality saturation for program synthesis Floating-point error analysis and accuracy optimization Accessible web layout verification using formal logic Hardware-software co-design for compiler generation His recent publications demonstrate expertise in both theoretical foundations (congruence closure proofs, anti-unification) and practical implementations (Odyssey tool for FP rewriting, Titanic framework for number systems analysis). Collaborations span institutions like Adobe and involve rigorous formal verification in Coq and CakeML.

Chandrakana NandiView profile

Assistant Professor

• programming languages
• compilers
• computational geometry
• +5 more

Chandrakana Nandi is the Director of US R&D at Certora and an Affiliate Assistant Professor at the University of Washington (UW), Seattle. She earned her PhD from the UW PLSE group under advisors Zachary Tatlock and Dan Grossman. Education & Affiliation PhD in Computer Science (2021) from University of Washington MS in Computer Science (2014) from Georgia Institute of Technology BS in Computer Science (2012) from Georgia Institute of Technology Research Interests Her work focuses on automated formal verification for real-world programs, particularly DeFi applications. She develops verification tools for languages like WASM and uses mutation testing to simplify specification writing. She pioneered equality saturation applications in synthesis, verification, and optimization through projects like egg and Ruler . Her computational fabrication research includes LambdaCAD and Reincarnate. Publications & Awards Distinguished Paper Award (OOPSLA 2021) Distinguished Paper Award and Sigplan Research Highlight (POPL 2021) Community Involvement She chairs sessions at PLDI and OOPSLA, co-organizes EGRAPHS workshops, and contributes to the egg open-source library. Her NSF grants (#1813166, #1644558) and Adobe Research Fellowship support her work. Contact Email: chandra@certora.com

Aalok ThakkarView profile

Assistant Professor

• Programming Languages
• Formal Logic
• Artificial Intelligence
• +3 more

Aalok Thakkar is an Assistant Professor in the Department of Computer Science at Ashoka University, specializing in Programming Languages , Formal Logic , and Artificial Intelligence . He earned his Ph.D. in 2023 from the University of Pennsylvania , advised by Rajeev Alur and Mayur Naik. His research focuses on example-guided synthesis of relational queries , with applications in program verification, automated reasoning, and AI. Recent work includes the Mobius framework (OOPSLA 2023) and Relational Query Synthesis ⋈ Decision Tree Learning (VLDB 2023). Published in npj Digital Medicine (2021) on pandemic risk modeling Contributed to Natural Computing (2020) on Boolean network concurrency Workshop papers on synthesis algorithm complexity (SYNT 2022) and reactive systems (SYNT 2020) He was previously affiliated with Adobe Systems, Aptos Labs, Amazon AWS, and Bell Labs. Awards include the Alt Carbon Darjeeling Revival Fellowship . Teaching includes courses on Symbolic Logic , Rust programming , and Games on Graphs . He will host an IndiCS Seminar on Automated Synthesis in 2025.

Armando Solar-LezamaView profile

Associate Professor

• Software Synthesis
• High-Performance Computing
• Information Flow Security
• +3 more

Armando Solar-Lezama is an Associate Professor at the Massachusetts Institute of Technology (MIT) where he leads the Computer Aided Programming Group within CSAIL. His research bridges programming languages, formal methods, and machine learning to advance program synthesis techniques for real-world applications. His primary research focuses on software synthesis with applications spanning high-performance computing, information flow security, and probabilistic programming. He investigates how to automatically generate correct and efficient programs from specifications, with recent work emphasizing neurosymbolic approaches that combine neural networks with symbolic reasoning for complex synthesis tasks. Analysis of his publication trends (2021-2025) reveals a strategic evolution from foundational synthesis algorithms toward practical applications in probabilistic programming and security-critical systems. His work consistently integrates machine learning with formal verification, demonstrating growing emphasis on coarse-to-fine synthesis methods and knowledge compilation techniques for discrete probabilistic models. Award highlights: SIGPLAN Milner Award As leader of MIT's Computer Aided Programming Group, Solar-Lezama mentors graduate researchers and collaborates across institutions. His extensive service as Program Chair for POPL 2025 and committee roles at premier conferences (PLDI, POPL, SPLASH) demonstrates significant community leadership. While specific grant details aren't provided, his sustained publication output in top venues indicates robust funding support. He directs the Computer Aided Programming Group at MIT CSAIL, which develops tools for program synthesis, verification, and analysis. Current projects focus on neurosymbolic programming frameworks, probabilistic program synthesis, and security-aware compilation techniques that integrate information flow control with high-performance computing optimizations.

Mohsen LesaniView profile

Associate Professor

• Reliability and Security of Software Systems
• Concurrent and Distributed Systems
• Secure Replicated Systems
• +4 more

Mohsen Lesani is an Associate Professor at the Computer Science and Engineering Department of University of California, Santa Cruz . He obtained his PhD from UCLA , MS in Artificial Intelligence from Sharif University of Technology , and BS in Software Engineering from University of Tehran . His research focuses on reliability and security of software systems , particularly concurrent and distributed systems , with recent work on secure replicated systems and distributed machine learning . NSF CAREER Award (2020) DARPA Young Faculty Award (2022) SIGPLAN Research Highlight (2019) Distinguished Paper Award at OOPSLA 2018 Best Paper Award at ISSRE 2015 His recent publications tackle challenges in automated synthesis of distributed protocols , heterogeneous replication , secure blockchain transactions , and verified RDMA-based data types . He advises PhD students Xiao Li , Eric Chan , Javad Saber-Latibari , and Tejas Mane in the Safe and Secure Software (S3) lab . He has taught courses on Distributed Systems , Parallel Programming , and Compiler Design .

• Digital Twin
• Building Information Modeling (BIM)
• Graph Rewriting in Engineering Design
• +3 more

Benedikt Hofer is a researcher at the Technical University of Munich (TUM), affiliated with the Professorship for Thermofluid Dynamics. His work focuses on the intersection of civil engineering, computer science, and digital modeling. University: Technical University of Munich Role: Researcher Contact: benedikt.hofer@tum.de Hofer’s research interests include Digital Twin , Building Information Modeling (BIM) , Graph Rewriting , and Parametric Modeling . His work emphasizes automated model generation, infrastructure digitization, and optimization through AI-driven methods. Recent publications highlight advancements in BIM collaboration , point cloud analysis for bridges , and graph-based design systems . These studies focus on scalability, version control, and integration of digital fabrication with BIM. The Technical University of Munich’s Thermofluid Dynamics group, led by Prof. Wolfgang Polifke, supports Hofer’s research in thermoacoustic interactions and fluid dynamics.

David CarralView profile

Researcher

• Knowledge Representation
• Database Theory
• Artificial Intelligence
• +3 more

Dr. David Carral is a former Research Associate at the International Center for Computational Logic (ICCL) within the Faculty of Computer Science at TU Dresden. His work focuses on Knowledge Representation , Database Theory , and Computational Logic , particularly in the context of ontology-based data access, existential rules, and chase termination analysis. He contributed to projects like CFAED and collaborated on systems such as VLog and ROWL . David supervised theses including "Don’t Repeat Yourself: Termination of the Skolem Chase on Disjunctive Existential Rules" by Lukas Gerlach. His research bridges formal methods with practical applications in AI and database systems. Research interests include ontology design patterns , query rewritability , and efficient reasoning algorithms . He actively participated in conferences like KR and IJCAI, contributing to advancements in nonmonotonic reasoning and hyperproperties. His work integrates description logics, answer set programming, and semantic web technologies to address challenges in knowledge-based systems.

Mark-Matthias ZymlaView profile

Research Fellow

• Computational Semantics
• Syntax/Semantics Interface
• Formal Pragmatics
• +5 more

Mark-Matthias Zymla is a post-doctoral researcher at the University of Konstanz's Department of Linguistics specializing in computational linguistics. His work bridges theoretical linguistic frameworks with practical computational implementations, focusing on semantic representation and processing. His primary research interests include computational semantics, the syntax/semantics interface, formal and computational pragmatics, with particular expertise in tense and aspect systems, argumentation theory, discourse particles, and rhetorical questions. He develops computational tools like LiGER (Linguistic Graph Expansion and Rewriting) that integrate syntactic analyses from LFG and Universal Dependencies with semantic annotations using Glue Semantics. Zymla has taught numerous courses at the University of Konstanz including Computational Semantics, Lexical Functional Grammar, Large Language Models, and Grammar Development across multiple semesters since 2015. His research is supported by projects like CUEPAQ (Visual Analytics for Argument Quality), VALIDA, and tense/aspect research funded by the Nuance Foundation. He actively participates in the ParGram community, co-organizing meetings in Rochester (2023) and Groningen (2022), and co-founded the 'SuP' reading group on semantics and pragmatics at Konstanz. His publications demonstrate strong interdisciplinary work connecting computational linguistics with visual analytics, argumentation studies, and cross-linguistic semantic annotation.