Michael McAlpine is a Professor in the Mechanical Engineering department at the University of Minnesota . He also holds affiliations with the Biomedical Engineering and Electrical and Computer Engineering departments. His research focuses on 3D printing functional materials & devices , Nanoscale inks , Biomedical devices , Bioelectronics , and Flexible Microsystems . Research Interests : 3D Printing, Biomedical Engineering, Nanotechnology, Flexible Electronics, Microfluidics Labs : ME 361/363 Contact : mcalpine@umn.edu , (612) 626-3303, ME 117 Recent Research Trends include 3D Printed Biomedical Devices , Flexible Electronics , and Bioprinting Applications . His work spans from Spinal Organoid Formation to Programmable Drug Release Capsules . Scientific Award : Circulation Research 2020 Best Manuscript Award
Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Fabian Suchanek is a full professor at Institut Polytechnique de Paris, specifically affiliated with Télécom Paris. He leads research in the Data, Intelligence, and Graphs (DIG) team within the Computer Science department. His academic career focuses on bridging artificial intelligence with structured knowledge representations. Suchanek's research interests span artificial intelligence, knowledge bases, and natural language processing, with particular emphasis on knowledge graph construction , rule mining , knowledge-based language models , and explainable AI . His work demonstrates how structured knowledge can enhance machine learning systems, particularly large language models, by providing factual grounding and interpretability. The research group he leads develops practical systems that address real-world knowledge management challenges. His recent publications showcase a strong trajectory in knowledge-intensive AI, with notable contributions to knowledge graph completion, rule mining techniques, and neural approaches to knowledge base validation. The research demonstrates increasing integration between symbolic and neural approaches to AI. Best Student Paper Award at KR 2024 for work on contextual reasoning Best Demo Award of IJCAI 2024 for rule mining in knowledge graphs French Open Research Award for the YAGO project Best Paper Award of ESWC 2021 for Neural Knowledge Base Repairs Suchanek has secured significant research funding, evidenced by his active recruitment of PhD students for knowledge-based language model research. He has held visiting positions, including at Nanyang Technological University (June-September 2023), and is recognized internationally through keynote invitations such as the Singapore ACM SIGKDD Symposium 2023. He has deliberately stepped back from administrative duties at Institut Polytechnique de Paris to focus on research. His laboratory maintains strong industry connections through open-source software projects including the YAGO knowledge base, AMIE for rule mining, STACI for explainable AI, and several other tools that have become standard in knowledge representation research.
Eric V. Mazumdar is an Assistant Professor at the California Institute of Technology (Caltech), jointly appointed in the departments of Computing and Mathematical Sciences and Economics. He holds a B.S. from MIT (2015) and a Ph.D. from UC Berkeley (2021), co-advised by Michael Jordan and Shankar Sastry. His research bridges machine learning and economics, focusing on deploying algorithms into societal systems through theoretical and practical lenses. Key areas include strategic classification, multi-agent reinforcement learning, and distributionally robust optimization, with applications in healthcare, online markets, and intelligent infrastructure. Education: B.S., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2015 Ph.D., Electrical Engineering and Computer Science, University of California, Berkeley, 2021 Research Interests: Mazumdar’s work emphasizes understanding learning algorithms in strategic environments, including min-max optimization, game theory, and multi-agent systems. He explores how algorithms interact with human and algorithmic agents in dynamic systems, with practical applications in healthcare delivery, e-commerce, and autonomous systems testing. Awards: NSF CAREER Award (2023) Simons Institute Research Fellowship in Learning in Games Grants & Funding: Supported by NSF, DARPA, Amazon, and other organizations. His NSF CAREER grant focuses on strategic interactions in societal-scale systems. Teaching: Courses include Networks: Structure & Economics (CMS/CS/EE/IDS 144) and Topics in Learning and Games (CMS/Ec 248). At UC Berkeley, he contributed to courses like Data, Inference, and Decisions (DS 102). Students & Postdocs: Current students: Lauren Conger, Tinashe Handina, Yizhou Zhang Postdocs: Zaiwei Chen, Laixi Shi, Kishan Panaganti (co-advised with Adam Wierman)
Dr. Angela Siegel is an Assistant Professor and Assistant Dean, Academic Outreach in the Faculty of Computer Science at Dalhousie University, Halifax, Canada. She is actively involved in both academic leadership and research. Education: Ph.D. in Mathematics (Combinatorial Game Theory), Dalhousie University, 2011 M.Sc. in Mathematics, Dalhousie University, 2005 B.Sc. in Mathematics & Marine Geophysics, 1997 Her research focuses on combinatorial game theory, graph theory, discrete mathematics, and number theory, with a strong emphasis on computer science education and inclusive teaching . She investigates the challenges students face when transitioning into computer science programs, aiming to improve pedagogical approaches and support systems. Her work bridges theoretical mathematics and practical educational innovation. The recent publications highlight a dual focus: theoretical contributions to combinatorial games (e.g., partizan games, placement games, geography variants) and applied research in computing education, particularly student transition and inclusive practices. Her interdisciplinary work spans mathematics, computer science, and educational theory. Scientific Awards: Dr. Siegel has supervised and collaborated with students and researchers on topics including student transition into higher education computing, LEGO-based pedagogy, and workplace readiness. While no specific grants are listed, her repeated presentations and publications suggest active research funding and scholarly engagement. She has contributed to major conference proceedings and book volumes such as Games of No Chance . She is associated with research teams focused on combinatorial games and computer science education innovation, often collaborating with scholars like Richard Nowakowski, Neil McKay, and Mark Zarb. Her work in inclusive teaching and student support reflects a commitment to building accessible and equitable learning environments in computing.
Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.
Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.
Andrew Ollett is an Associate Professor and Director of Graduate Studies in the Department of South Asian Languages and Civilizations at the University of Chicago , where he has taught since 2019. His research focuses on the literary and intellectual traditions of South and Southeast Asia, particularly through works in Sanskrit, Prakrit, Apabhramsha, and Kannada from the first millennium CE. Co-founder and editor of NESAR (New Explorations in South Asia Research) Director of NEH-funded edition/translation of the Kavirājamārga (earliest Kannada literary manual) Expert in Prakrit and Kannada literary traditions His work explores the 'question of language'—examining how language choice shaped cultural production and change in premodern India. Current projects include a monograph on context-sensitivity in Indian language theories and a study of manuscript technology's impact on early South Asian knowledge communities. He has authored The Mirror of Ornaments (Naples: Unior Press, 2025) and Language of the Snakes (UC Press, 2017), and co-authored Lilavai (Harvard, 2021). Recent publications include interdisciplinary studies on: Sanskrit-Prakrit campū genre reevaluation Pragmatics in Mīmāṁsā interpretive concepts Manuscript literacy's influence on literary forms Historical linguistics of Middle Indic syllable reduction Philosophy of language in Śālikanātha and Kumārila Bhaṭṭa Awarded the NEH 'Scholarly Editions and Translations' grant , he teaches classical South Asian literature courses covering Sanskrit, Prakrit, and Tamil traditions. He maintains digital resources including a Prakrit Digital Texts Project and Mīmāṁsādigdarśinī digital text repository, and actively contributes to open-access scholarship.
Prof. Dr. Ieke Moerdijk is a distinguished Professor of Mathematics at the Mathematical Institute of Utrecht University, part of the Faculty of Science. Previously, he held positions at Radboud University (2011–2016) and has been affiliated with institutions like the University of Chicago, Cambridge, and the University of Amsterdam, where he earned his PhD in Mathematics (1985, Cum Laude). His research focuses on algebraic and differential topology, homotopy theory, and applications of topological structures to mathematical logic. He is renowned for co-authoring influential books such as Sheaves in Geometry and Logic (with S. Mac Lane) and Introduction to Foliations and Lie Groupoids (with J. Mrcun). Moerdijk has received prestigious awards including the Spinoza Prize (2012) and the Descartes-Huygens Prize (2011), and is a member of the KNAW and Academia Europaea. His current research emphasizes the theory of dendroidal sets and homotopy operads. He has held visiting positions at institutions like Cambridge, McGill, and Sydney. His academic contributions span editorships, teaching, and supervising numerous students. Moerdijk’s work bridges foundational mathematics with advanced categorical and topological frameworks, influencing areas from algebraic geometry to logic. Education: Bachelor’s/Master’s in Mathematics, Philosophy, and Linguistics at University of Amsterdam PhD in Mathematics, University of Amsterdam (1985) Awards: Spinoza Prize (2012), Descartes-Huygens Prize (2011) Member of KNAW (2006), Academia Europaea (2014) Huygens Fellowship (1986), PIONIER Grant (1995) Research Interests: Algebraic topology, homotopy theory, operads, category theory, and mathematical logic. Moerdijk’s publications include foundational works on dendroidal sets and simplicial methods, with recent contributions addressing ∞-operads and univalent completion. His research often explores connections between algebraic structures and topological spaces, with applications to higher category theory.
Mark de Rond is Professor of Organisational Ethnography at Cambridge Judge Business School and Fellow of Darwin College, University of Cambridge. His work focuses on immersive ethnographic studies of human behavior in extreme contexts including war zones, high-stakes sports, and controversial social movements, revealing how individuals navigate challenging circumstances through compromise and sensemaking. His educational background includes a DPhil from the University of Oxford alongside advanced degrees in management and economics, photojournalism, documentary photography, biography, creative nonfiction, and prose fiction. This multidisciplinary training informs his unconventional methodological approach. De Rond's research centers on extreme context ethnography, examining how pressure-cooker environments expose fundamental organizational dynamics. His work spans military medicine (Camp Bastion fieldwork), elite sports (Cambridge Boat Race), Amazon river expeditions, and controversial practices like paedophile hunting. Key contributions explore negotiation, conflict resolution, serendipity, institutional persistence, and the emotional toll of fieldwork, often employing innovative methods like enactive ethnography and linguistic analysis of digital communities. His recent publications reveal a growing focus on digital vigilantism and the societal implications of extreme practices, with increasing interdisciplinary reach across organizational studies, criminology, medical anthropology, and sociology. The work demonstrates methodological creativity through linguistic analysis of Facebook groups, embodiment studies in extreme environments, and dream-based reflexive techniques. Scientific recognition includes: BEST ARTICLE AWARD FOR 2016 Favorite MBA Professor honors from Poets & Quants (2021, 2022) Guinness World Record for first unsupported Amazon row De Rond advises MBA students and delivers executive education to top law firms (Slaughter and May, Allen & Overy), professional services (McKinsey, KPMG), corporations (Sky, BT, Diageo), and NGOs (UNICEF, NHS). His negotiation training from Harvard Law School informs both academic work and university mediation practice. Current research involves collaborative teams studying paedophile hunting (featured in Sundance-nominated documentary Predators ) and high-performance sports organizations, with fieldwork requiring deep immersion in challenging environments. His research methodology involves embedded collaboration with diverse teams including medical personnel in conflict zones, elite rowers, and controversial activist groups, often pushing methodological boundaries through photojournalism and creative nonfiction approaches.
Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.
Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.
Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.
Prof. Sebastian Rudolph is a Professor of Computational Logic at the Institute for Artificial Intelligence , Faculty of Computer Science , TU Dresden. Since 2021, he has been an Affiliate Member of the Faculty of Mathematics. His research spans theoretical and applied artificial intelligence, focusing on Knowledge Representation and Reasoning through formalisms like Description Logics, Existential Rules, and Formal Concept Analysis, with applications in Semantic Technologies. 2017 : ERC Consolidator Grant for decidability principles in logic-based knowledge representation 2006-2013 : Postdoctoral researcher, project leader, and Privatdozent at KIT's Institute AIFB 2011 : Habilitation at KIT Earlier : PhD in Algebra and teaching qualification in mathematics, physics, and computer science at TU Dresden His recent publications address decidability of logical reasoning, non-monotonic extensions in formal concept analysis, standpoint logics, and multiagent systems. He supervises the DeciGUT and KIMEDS projects, and is involved in the SECAI and ScaDS.AI centers. Teaching activities include courses on Theoretical Computer Science, Existential Rules, and Formal Concept Analysis.
Professor Katrin Tent is a distinguished mathematician specializing in mathematical logic at the University of Münster, where she holds a professorship in the Faculty of Mathematics and Computer Science within the Institute for Mathematical Logic and Foundations Research. She is an active researcher in Mathematics Münster, an investigator in CRC 1442 Geometry: Deformations and Rigidity, and contributes to multiple research projects including Topics in Mathematics Münster T3: Models and universes, T4: Groups and actions, and T8: Random discrete structures and their limits. PhD in Linguistics, Christian-Albrechts-Universität zu Kiel (1988) Diplom in Mathematics, Christian-Albrechts-Universität zu Kiel (1989) PhD in Mathematics, University of Notre Dame (1994) Habilitation, "Model theory of groups and BN-pairs" (2000) Professor Tent's research bridges model theory, group theory, and geometry, with particular focus on finite Morley rank structures, BN-pairs, and sharply multiply transitive groups. Her work often combines methods from these areas to prove unexpected results, either constructing groups or incidence geometries with surprising model theoretic properties or using model theory to construct new and interesting geometries or groups. Her recent publications reveal a consistent trajectory connecting model theory with group-theoretic structures. She has made significant contributions to understanding sharply 2- and 3-transitive groups, finite Morley rank geometries, and the model theory of generalized polygons. Her work demonstrates how model-theoretic techniques can solve deep problems in group theory and geometry, particularly through the study of BN-pairs and incidence structures. DFG Research Fellowship (1996-1998) Bayerischer Habilitationsförderpreis (1998-2001) Heisenberg-Stipendium (2001-2004) ERC Consolidator Grants expert panel (2016, 2018) Elected to DFG Senate (2019) Professor Tent leads an active research group with current members including Marco Amelio, Dr. Benjamin Brück, Anna Cascioli, Lukas Jonuska, Silke Meissner, Zahra Mohammadi Khangheshlaghi, and Dr. Sam Shepherd. Her former research group members include Dr. Simon Andre, Dr. Isabel Müller, and Dr. Tim Clausen, among others. Her supervisory work spans both theoretical foundations and specific applications in geometric group theory and model theory. Her research group operates within the Institute for Mathematical Logic and Foundations Research at the University of Münster, collaborating closely with other researchers in the Mathematics Münster cluster. The group participates in various projects including CRC 1442 - C04: Group theoretic aspects of negative curvature, contributing to the vibrant mathematical research environment at one of Germany's leading mathematics institutions.
