Find Academic Supervisors

• Distributed Systems
• Fault-Tolerant Computing
• Asynchronous Algorithms
• +3 more

Prof. Ulrich Schmid is a full professor at TU Wien, affiliated with the Forschungsbereich Embedded Computing Systems. His research focuses on distributed systems, fault-tolerant computing, and asynchronous algorithms. He leads projects like 'Asynchronous Distributed Algorithms in the Theta-Model' and 'Gracefully Degrading Agreement in Directed Dynamic Networks.' Prof. Schmid has received honors at TU Wien and actively supervises numerous students in PhD and Master's programs. His academic work spans theoretical foundations (e.g., epistemic logic in Byzantine systems) and practical applications (e.g., digital circuit delay modeling). Key contributions include hybrid delay models for integrated circuits and formal verification frameworks for timed circuits. Collaborations involve institutions like the Institut für Technische Informatik and the E191-02 research group. Notable research areas: Byzantine fault tolerance, consensus protocols, and embedded systems Leadership in 4 major projects addressing distributed computing challenges Recipient of TU Wien honors (2021) Prof. Schmid's lab emphasizes bridging theoretical computer science with hardware-software co-design, producing over 220 publications and 10+ supervised theses since 2000.

• Computer-Aided Design (CAD)
• Digital Circuit Design
• Low Power Design
• +4 more

Jing-Yang Jou is the current President and K.T. Li Chair Professor at National Central University in Taiwan. He holds MS (1983) and PhD (1985) degrees in Computer Science from the University of Illinois. His research focuses on logic synthesis, physical synthesis, design verification, CAD for low-power systems, and Network-on-Chips (NoC). With over 200 technical publications, he has made significant contributions to digital circuit design automation. Former Deputy Minister of National Science Council, Taiwan (2010-2012) Vice Chancellor for Academic Affairs, University System of Taiwan (2007-2010) Executive Director of National SoC Program (2007-2010) Director General of National Chip Implementation Center (2004-2007) Recipient of prestigious awards including IEEE Fellow distinction and multiple industry-academia collaboration recognitions. His career includes roles at AT&T Bell Laboratories (1986-1994) and GTE Laboratories (1985-1986). Research emphasizes bridging theoretical computer science with practical semiconductor design challenges.

• Statistical Relational Learning
• Machine Learning
• Probabilistic Graphical Models
• +5 more

Lise Getoor is a Professor in the Department of Computer Science at the University of California, Santa Cruz, within the Baskin School of Engineering. She previously held positions at the University of Maryland, College Park and has established herself as a leading researcher in statistical relational learning and neuro-symbolic artificial intelligence. Her research focuses on developing principled approaches to reasoning and learning with rich, relational data. She has made significant contributions to probabilistic soft logic, statistical relational learning, knowledge graph construction, and the integration of symbolic and neural approaches to AI. Her work bridges theoretical foundations with practical applications in areas including social network analysis, sustainable recommendations, cyberbullying detection, and fair machine learning systems. Analysis of her recent publications reveals a strong trend toward neuro-symbolic integration, with increasing focus on combining neural networks with logical reasoning frameworks. Her research demonstrates consistent innovation in developing scalable algorithms for structured prediction across diverse application domains while addressing critical issues of fairness and interpretability in AI systems. Professor Getoor has advised numerous PhD students who have become active contributors to the field, including Connor Pryor, Charles Dickens, Eriq Augustine, and Varun Embar. Her research has been supported by multiple grants from major funding agencies, though specific details aren't provided in the current data. She leads research in the Statistical Relational AI (StaRAI) Lab at UC Santa Cruz, where her team develops frameworks that combine logical reasoning with probabilistic modeling to address complex real-world problems requiring both structured knowledge and statistical learning.

Samuel R. BussView profile

Professor

• Mathematical Logic
• Proof Complexity
• Computer Graphics
• +3 more

Samuel R. Buss is a Professor of Mathematics and Computer Science at the University of California, San Diego (UCSD). He holds a Ph.D. in Mathematics from Princeton University (1985) and has expertise spanning mathematical logic, proof complexity, computational complexity, and computer graphics. His work bridges foundational mathematics with theoretical computer science, particularly in formal systems, automated reasoning, and algorithm design. Key research areas include proof complexity (e.g., resolution and extended resolution systems), computational logic, and applications in computer graphics (e.g., OpenGL implementations and ray tracing). He authored influential books such as 3D Computer Graphics: A Mathematical Introduction with OpenGL and Introduction to Mathematical Logic . His software contributions include OpenGL-based tools and algorithms for computer graphics and satisfiability solving. Buss has advised notable Ph.D. students, including David Robinson and Nathan Segerlind, and has received funding from NSF grants and other institutions. His research often intersects interdisciplinary topics like bounded arithmetic, computational geometry, and formal verification.

Georgios PortokalidisView profile

Research Professor

• Systems Security
• Binary Analysis
• Software Hardening
• +1 more

Georgios Portokalidis is an Associate Research Professor at IMDEA Software Institute and Visiting Research Professor at Stevens Institute of Technology. He leads research in software systems security with focus on binary analysis, software hardening, and operating system security. His research develops practical defenses against software vulnerabilities through techniques like binary debloating, system call filtering, and hardware-assisted security. Current projects explore Rust language security, processor-assisted protection mechanisms, and vulnerability mitigation through code reduction. Publication trends show evolution from foundational binary analysis to applied security hardening, with recent emphasis on Rust security, hardware-assisted defenses, and real-world system protection. Work demonstrates consistent focus on practical, deployable security solutions. He has supervised numerous PhD students and postdocs, currently mentoring researchers at IMDEA. His group investigates binary analysis, software debloating, and system hardening techniques. Major grants include DARPA YFA (2021-2023) and ONR funding (2017-2022) supporting adaptive binary debloating research. Leads the systems security research group at IMDEA Software Institute, collaborating with international partners. Maintains active research partnerships and regularly contributes to top security conferences as program committee member.

Andrei KrokhinView profile

Professor

• Computational Complexity
• Constraint Satisfaction Problems
• Universal Algebra
• +4 more

Andrei Krokhin is a Professor in the Department of Computer Science at Durham University, UK. His academic roles include being a member of the Algorithms and Complexity Research Group. He holds a PhD in Mathematics from Ural State University (Russia) and has held positions at Warwick University and Oxford University. His research focuses on computational complexity, constraint satisfaction problems (CSP), universal algebra, and combinatorics. Education: PhD in Mathematics, Ural State University, 1990s Research Interests: Professor Krokhin investigates the mathematical and algorithmic foundations of CSP, emphasizing complexity classification and approximation. His work bridges universal algebra, logic, combinatorics, and graph theory. Key themes include algebraic approaches to CSP, constraint optimization, and the interplay between computational complexity and structural mathematics. Awards: EPSRC Advanced Research Fellowship (2006) Principal organizer of the 2006 Oxford Workshop on Mathematics of Constraint Satisfaction Invited plenary speaker at ISMVL 2003 (Tokyo) Invited lectures at NATO ASI Summer School (2003) Advising & Grants: Supervises PhD students (e.g., Yiming Qiu) and leads EPSRC-funded projects like 'Promise Constraint Satisfaction Problems: Structure and Complexity.' He recruits students for research on CSP complexity and approximation. Labs/Teams: Member of the Algorithms and Complexity Research Group at Durham University, collaborating internationally on CSP theory and applications.

John McNamaraView profile

Research Fellow

• Artificial Intelligence
• Cybersecurity
• Transportation Systems
• +3 more

John McNamara is an IBM Master Inventor and Advanced Visiting Research Fellow at the University of Sheffield, holding Honorary Professorships at University College London (UCL) and Sheffield Hallam University. He specializes in interdisciplinary innovation across cybersecurity, transportation systems, and artificial intelligence, leveraging technologies like Cloud and Watson for Tech for Good initiatives. His roles include IBM Technical Specialist, IBM Thought Leader, and Open Group Distinguished Technical Specialist, with industry expertise spanning defense, finance, and healthcare sectors. Education: BSc (Hons) in Information Systems from the University of Hull. Research focuses on patentable inventions addressing complex event processing, automated systems optimization, and regulatory compliance. Key innovations include intelligent fuel management systems, automated style-checking frameworks, and goal-directed simulation tools for business processes. His work bridges academic research with real-world industry applications. Awards: IBM Master Inventor IBM Thought Leader Technical Specialist Open Group Distinguished Technical Specialist Collaborates with IBM UK University Programs to develop socially impactful technologies. Active in creating solutions for disease control, banking systems, and defense applications through cross-disciplinary partnerships.

Kristopher MicinskiView profile

Assistant Professor

• Programming Languages
• Static Analysis
• Formal Methods
• +4 more

Kristopher Micinski is an Assistant Professor in the Electrical Engineering and Computer Science Department at Syracuse University. His research focuses on scalable program analysis, static analysis, and formal methods applied to computer security and privacy. He holds a PhD in Computer Science from the University of Maryland and a BS in Computer Engineering from Michigan State University. Education: PhD, Computer Science, University of Maryland at College Park BS, Computer Engineering, Michigan State University Research Interests: His work bridges theory and application of program analyses, emphasizing scalable static analysis frameworks, Datalog optimization for distributed systems, and security applications. Recent efforts include GPU-accelerated Datalog engines and large-scale malware analysis pipelines like Assemblage. Grants & Projects: NSF PPoSS Large: $1M grant for declarative analytics DARPA V-SPELLS: $400K for legacy software optimization Assemblage: $350K DoD grant for malware classification Teaching: He teaches undergraduate and graduate courses on programming languages (CIS352) and formal methods (CIS700), with materials publicly available on YouTube.

Ruben MartinsView profile

Research Professor

• Constraint Programming
• Program Synthesis
• Software Analysis
• +3 more

Ruben Martins is an Assistant Research Professor and Master’s Program Director at the School of Computer Science, Carnegie Mellon University. He holds a Ph.D. from the Technical University of Lisbon, followed by postdoctoral research at the University of Oxford and UT Austin. His work focuses on constraint programming, program synthesis, and formal verification, with applications in improving programmer productivity and automating data science tasks. Education: Ph.D. in Computer Science, Technical University of Lisbon (2013) Postdoctoral Researcher, University of Oxford (2014-2015) Postdoctoral Researcher, UT Austin (2015-2017) Ruben's research bridges constraint programming with program synthesis, aiming to automate tasks such as vulnerability detection, code repair, and SQL synthesis. He developed Open-WBO , a MaxSAT solver that won multiple gold medals and is used in real-world optimization scenarios like seating arrangements for events. His work integrates large language models (LLMs) with traditional methods to enhance software analysis and debugging. Awards: Distinguished Paper Award at PLDI 2018 Gold Medal in MaxSAT Competitions for Open-WBO Advising & Grants: Ruben advises Master’s students and directs courses such as 15639, 15604, and others. His research has been supported by grants focusing on program synthesis and cybersecurity. Labs/Teams: Leads development of Open-WBO and contributes to projects like Crabtree (Rust API testing) and Pryde (evasion attack analysis).

Peter DybjerView profile

Professor

• Intuitionistic Type Theory
• Categorical Type Theory
• Proof Assistants
• +9 more

Peter Dybjer is a Professor of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology in Sweden. He is a leading researcher in the field of type theory, with a focus on intuitionistic type theory, categorical semantics, and proof assistants. His work bridges foundational aspects of mathematics and computer science, emphasizing constructive methods and formal verification. Research Interests: Intuitionistic Type Theory and its categorical semantics Proof assistants and formal verification Inductive and inductive-recursive definitions Game semantics and normalization techniques Dependent type systems and their applications Homotopy Type Theory and univalent foundations Activities & Contributions: Editor of the Bulletin of Symbolic Logic Member of program committees for conferences like TYPES, FSCD, and MFPS Keynote speaker at events including the European Congress of Mathematics and the Hausdorff Research Institute's Summer School on Types, Sets, and Constructions Initiated and directed the Master's Program in Computer Science – Algorithms, Languages, and Logic at Chalmers Teaching & Outreach: Professor Dybjer has taught advanced courses at international summer schools, including: Inductive Definitions in Constructive Type Theory (TYPES Summer School, 2005) Dependent Types at Work (LerNet Summer School, Uruguay, 2008) Normalization by Evaluation (Midlands Graduate School, 2009 and 2015)

• Programming Languages
• Formal Semantics
• Theoretical Computer Science
• +3 more

Benedict Bunting is a Doctoral Student in the Department of Computer Science at the University of Oxford, concurrently serving as a College Lecturer. He is affiliated with St John's College and Keble College. His research focuses on programming languages, formal semantics, and theoretical computer science, particularly in areas such as algorithmic game semantics and concurrency theory. Bunting's work explores foundational aspects of programming languages through operational and denotational approaches. Supervisor: Andrzej Murawski His research themes include state and control mechanisms in programming languages, nested data structures, and the application of game semantics to program equivalence. He has published at leading conferences such as the ACM/IEEE Symposium on Logic in Computer Science (LICS).

Kim WernerView profile

Professor

• Climate Change Adaptation
• Sustainability and Climate Protection
• Diversity
• +5 more

Prof. Dr. Kim Werner is a Professor of Business Administration, specializing in Event Management, at the Faculty of Economics and Social Sciences (WiSo) of Osnabrück University of Applied Sciences. Her academic career spans roles in industry and academia, including positions at Lufthansa, Tourism Australia, and the Auckland University of Technology. She holds a PhD in the impact of mega-events on regional collaboration and knowledge transfer. Education: PhD in Event Management (Auckland University of Technology, 2013) Bachelor's in International Tourism Management (Bremen University of Applied Sciences, 2004) Research Interests: Climate Adaptation in Events Sustainability and Climate Protection Event Co-Creation and Value Creation Knowledge Transfer in Destinations Funding and Projects: "KlimaEvent": Climate-Resilient Event Supply Chains (BMUV-funded, 2023–2026) "Kreislaufwirtschaft in der Messewirtschaft" (DBU-funded, 2024–2026) VR-Based Climate Adaptation Training (STIL-funded, 2025–2027) Awards and Roles: Editorial Board Member: Event Management and Journal of Policy Research in Tourism, Leisure and Events Scientific Advisor: degefest e.V. (Congress and Seminar Industry Association) Labs and Teams: Leading research groups on climate adaptation and sustainable event design, collaborating with the University of Osnabrück and local municipalities.

Bertram LudäscherView profile

Professor

• Data and Knowledge Management
• Scientific Workflows
• Data Provenance
• +4 more

Bertram Ludäscher is a Professor at the School of Information Sciences at the University of Illinois, with affiliate appointments at the National Center for Supercomputing Applications (NCSA) and the Department of Computer Science. He leads the Center for Informatics Research in Science and Scholarship and directs the NSF-funded Euler project focused on logic-based taxonomic alignment. His research emphasizes scientific workflow systems, data provenance, and knowledge representation. Ludäscher co-founded the Kepler workflow system and contributed to DataONE’s provenance initiatives. He previously held roles at UC Davis and the San Diego Supercomputer Center. Education: PhD in Computer Science, University of Freiburg (1998) MS in Computer Science, Technical University of Karlsruhe (1992) Research Interests: Data and knowledge management, scientific workflows, provenance tracking, biodiversity data curation, and taxonomic reconciliation using logic-based methods. Ludäscher’s work bridges computational methods with biological and environmental sciences, focusing on reproducibility and interoperability in data-driven research. Recent Work Trends: His articles address provenance unification in databases, workflow automation recovery, and resolving taxonomic conflicts. Key themes include reproducibility frameworks (e.g., the Whole Tale project), ontology alignment, and scalable workflow systems for diverse scientific domains. Awards: 2018 ProvenanceWeek Best Paper, Google Scholar Classic Papers recognition. Advising & Grants: Leads NSF-funded projects like Euler and Kurator. Active in collaborative initiatives such as DataONE and the Whole Tale. Courses taught include data curation, workflow design, and data cleaning methodologies. Labs/Teams: Directs the Center for Informatics Research in Science and Scholarship and collaborates with NCSA on cyberinfrastructure projects. Key partnerships include the San Diego Supercomputer Center and UC Davis Genome Center.

Ella HaigView profile

Associate Professor

• Intelligent Systems
• User Modelling and Personalisation
• Data Mining
• +7 more

Ella Haig is an Associate Professor of Artificial Intelligence at the University of Portsmouth, UK, affiliated with the School of Computing within the Faculty of Technology. She is also a member of the Portsmouth AI and Data Science Centre, Future of Law, Innovation and Technology Research Centre, and Centre for Cybercrime and Economic Crime. Her academic journey includes a PhD in Computer Science from Birkbeck College (University of London), an MSc in Learning Technologies from the National College of Ireland, and a Postgraduate Certificate in Learning and Teaching from the University of Portsmouth. Her research focuses on Intelligent Systems, User Modelling, Data Mining, and Decision Support, with notable contributions to emotion recognition, machine learning, and educational data mining. Ella has published over 140 works, including articles on multimodal emotion detection and comparative analyses of AI models like GPT-3 and BERT. She actively contributes to conferences, such as the IEEE World Congress on Computational Intelligence and the International Conference on Educational Data Mining. Ella has secured grants totaling over £235,000 for projects like the KTP Citizens Advice initiative, exploring technology solutions for public services. Her work aligns with UN Sustainable Development Goals, particularly in advancing education and innovation. Notable achievements include a 2023 Best Paper Award for her research on multimodal emotion recognition systems.

Stephen QuackenbushView profile

Professor

• International Conflict
• Deterrence Theory
• Strategic Studies
• +4 more

Stephen L. Quackenbush is a Professor and Director of Defense and Strategic Studies at the Truman School of Government and Public Affairs, University of Missouri. His expertise spans international conflict, deterrence theory, strategic studies, and bridging academic-policy divides. He created the MA in Defense and Strategic Studies program and previously served as President of the International Studies Association-Midwest. Education: Bachelor of Science (BS) in Aerospace Engineering, Illinois Institute of Technology Master of Science (MS) in Aerospace Engineering, Georgia Institute of Technology Master of Arts (MA) and Doctor of Philosophy (PhD) in Political Science, University at Buffalo, SUNY Research Interests: General and extended deterrence mechanisms Gray zone conflicts and geopolitical strategy Counterinsurgency dynamics and military effectiveness Policy applications of strategic studies His recent work emphasizes updating conflict datasets (e.g., Politically Active Dyads) and addressing accidental warfare risks. He has authored influential books like Understanding General Deterrence and International Conflict: Logic and Evidence . Awards: Recipient of the Bronze Star Medal for service during Operation Iraqi Freedom while in the U.S. Army. Led initiatives in curriculum development (MA program creation) and contributed to defense policy debates through game-theoretic models of extended deterrence in Northeast Asia and Middle Eastern conflicts.