جستجوی استاد راهنمای دانشگاهی

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

• Programming Languages
• Type Theory
• Dependent Types
• +۱۲ مورد دیگر

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.

• Resilient Systems
• High-Performance Data Management
• Database Theory
• +۱۰ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

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.

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Description Logics
• +۷ مورد دیگر

Manfred Droste is a Professor at the Institute of Computer Science of the University of Leipzig, where he leads the Research Group on Automata and Formal Languages. He serves as Director of the Graduate Centre Mathematics, Computer Science and Natural Sciences and is Vice-speaker of the DFG-Research Training Group Quantitative Logics and Automata. His academic career spans decades of research and leadership in theoretical computer science and algebra. Prof. Droste's research focuses on theoretical computer science, particularly automata theory, logic, algebraic models for concurrent systems, and domain theory. In algebra, his interests include model theory, automorphism groups, and ordered algebraic structures. His work bridges theoretical foundations with practical applications in formal language theory and quantitative systems. His extensive publication record demonstrates a consistent focus on weighted automata, formal languages, and their logical characterizations. Over the years, his research has evolved to address increasingly complex quantitative models, with recent work focusing on weighted complexity classes, weighted linear dynamic logic, and decidability boundaries for weighted automata. Prof. Droste has received significant recognition including election to Academia Europaea, an honorary doctorate from Immanuel Kant Baltic Federal University, and fellowship in the Asia-Pacific Artificial Intelligence Association. These honors reflect his substantial contributions to theoretical computer science. He has supervised numerous PhD students including Dietrich Kuske, Paolo Boldi, and Karin Quaas, many of whom have become prominent researchers. His extensive grant portfolio includes multiple DFG projects on weighted automata and international collaborations through DAAD funding. Prof. Droste leads a vibrant research team including Andrea Hesse, Karin Quaas, Erik Paul, and others. He has organized the international workshop series "Weighted Automata: Theory and Applications" since 2002, fostering global collaboration in this specialized field.

• Theoretical Computer Science
• Automata Theory
• Logic
• +۶ مورد دیگر

Marilena Vendittelli is a Professor at Sapienza University of Rome, affiliated with the Robotics group. Her research spans control systems, biomedical robotics, motion planning, and autonomous systems. Research Areas: Control systems for robotics and nonholonomic systems Biomedical applications (hyperthermia therapy, needle insertion) UAV navigation and obstacle avoidance Haptics and human-robot interaction Adaptive estimation algorithms Recent Publications focus on adaptive control of bio-heat equations, safe UAV motion planning, soft robotics actuation, and haptic feedback in medical procedures.

• Robotics
• Control Systems
• Biomedical Engineering
• +۷ مورد دیگر

Peter Johnstone is Professor of Foundations of Mathematics at the University of Cambridge, affiliated with the Department of Pure Mathematics and Mathematical Statistics within the Faculty of Mathematics. His academic profile shows consistent contributions to foundational mathematical research over several decades, with current contact information indicating active engagement in his position. Johnstone's primary research focus lies in category theory, specifically topos theory and its connections with mathematical logic. His work explores the deep structural relationships between algebraic structures, logical systems, and geometric interpretations within categorical frameworks. His research has significantly advanced our understanding of locales, realizability toposes, and the categorical foundations of mathematical logic. Analysis of his recent publications reveals a consistent trajectory in topos theory with emphasis on geometric morphisms, realizability structures, and categorical logic. His work demonstrates sophisticated interplay between abstract category theory and concrete mathematical structures, particularly in how logical systems can be represented and manipulated within topos-theoretic frameworks. Johnstone maintains an active academic presence with a personal homepage at the University of Cambridge and standard university contact information including email (P.T.Johnstone@dpmms.cam.ac.uk), office location (Room C0.01), and telephone number (01223 337985). His extensive publication record spanning from the 1980s through the 2010s indicates sustained scholarly activity in his specialized field.

• Category Theory
• Topos Theory
• Mathematical Logic
• +۳ مورد دیگر

Sampsa Hautaniemi is a Professor at the Department of Biochemistry and Developmental Biology within the Faculty of Medicine at the University of Helsinki. He serves as Principal Investigator of the Systems Biology of Drug Resistance in Cancer research group and holds docentship in the Faculty of Medicine. Professor Hautaniemi actively supervises doctoral students across multiple programs including the Doctoral Programme in Biomedicine, Doctoral Programme in Clinical Research, and Doctoral Programme in Integrative Life Science. His research focuses on systems biology approaches to understand drug resistance mechanisms in cancer, particularly ovarian cancer. His work integrates computational biology, genomics, epigenetics, and bioinformatics to develop precision medicine approaches for cancer treatment. His laboratory develops innovative computational methods and experimental models including patient-derived organoids to study tumor evolution, identify therapeutic targets, and predict treatment responses. Analysis of his recent publications reveals a strong emphasis on understanding tumor heterogeneity, clonal evolution during therapy, and the development of computational tools for cancer genomics. His work spans multiple disciplines including cancer biology, computational biology, immunology, and precision medicine, with a particular focus on high-grade serous ovarian cancer as a model system. Scientific Awards: The Anders Jahre Medical Prize to young medical scientists (2014) for outstanding research on systems biology and cancer The Finnish Medical Foundation 50-years jubileum award (2010) Professor Hautaniemi has supervised numerous doctoral students and early-career researchers, contributing significantly to cancer research education. His research is supported by multiple active projects including the DECIDER project (Clinical Decision via Integrating Multiple Data Levels to Overcome Chemotherapy Resistance in High-Grade Serous Ovarian Cancer) funded until 2026, as well as projects from the Academy of Finland, Cancer Foundation, and industry partners like Orion Corporation. His laboratory maintains a patient-derived organoid biobank for high-grade serous ovarian cancer and develops computational tools like Jellyfish for visualizing tumor evolution.

• Systems Biology
• Cancer Research
• Drug Resistance
• +۷ مورد دیگر

Saharon Shelah is an Israeli mathematician renowned for his groundbreaking work in mathematical logic and set theory. He currently holds the Robinson Chair for Mathematical Logic at Hebrew University, a position he has held since 1978, and has been a Professor at Hebrew University since 1974. Additionally, he serves as a Distinguished Visiting Professor at Rutgers University since 1986. His educational background includes: B.Sc. from Tel Aviv University (1964) M.Sc. from Tel Aviv University (1967) M.Sc. from Hebrew University (1968) Ph.D. from Hebrew University of Jerusalem (1969), summa cum laude, supervised by Michael Rabin Shelah's research primarily focuses on mathematical logic, particularly model theory and set theory. His work has revolutionized these fields through the development of stability theory, PCF theory, and proper forcing. He has made significant contributions to understanding the connections between logic and other mathematical disciplines including algebra, computer science, and combinatorics. His approach often involves creating general frameworks that solve multiple problems simultaneously, demonstrating extraordinary depth and breadth in mathematical thinking. An analysis of Shelah's extensive publication record reveals consistent innovation across mathematical logic. His work shows a progression from foundational model theory in the 1970s through the development of stability theory, to groundbreaking set theory results in the 1980s and 1990s, particularly in cardinal arithmetic and PCF theory. Recent publications continue to expand abstract model theory while finding new applications across mathematics. His research demonstrates remarkable consistency in quality and originality over five decades. Shelah's exceptional contributions have been recognized with numerous prestigious awards: 2013 AMS Steele Prize 2011 EMET Prize in Mathematics 2001 Wolf Prize in Mathematics 2000 Bolyai Prize 1998 Israel Prize for Mathematics 1992 SIAM George Pólya Prize 1991 Honorary Foreign Member of the American Academy of Arts and Sciences 1988 Member of the Israel Academy of Sciences and Humanities 1983 Karp Prize 1982 Rothshild Prize 1977 Erdös Prize Throughout his career, Shelah has mentored numerous students and collaborated with over 200 coauthors. His research has been supported by multiple grants from prestigious organizations including the Israel Science Foundation and the National Science Foundation. Shelah's work has fundamentally shaped modern mathematical logic, with his classification theory providing frameworks that continue to guide research directions. His ability to connect seemingly disparate areas of mathematics through logical structures has made his contributions exceptionally influential. Shelah maintains an active research group at Hebrew University, where he continues to supervise doctoral students and postdoctoral researchers. His research program, known for its depth and technical sophistication, continues to generate new directions in mathematical logic. The Shelah Archive (http://shelah.logic.at) serves as a comprehensive repository of his extensive publication record, which surpassed 1190 papers by the end of 2024.

• Model theory
• Axiomatic set theory
• Applications of logic in algebra
• +۲ مورد دیگر

Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.

• Type Theory
• Dependent Types
• Functional Programming
• +۱۱ مورد دیگر

Daniel M. Smith is an Associate Professor in the Department of Political Science at the University of Pennsylvania, School of Arts & Sciences. He holds a PhD from the University of California, San Diego, and has held academic positions at Harvard University, Columbia University, and Stanford University. His research focuses on comparative politics, political economy, and political behavior, with regional expertise in Japan and Western Europe. PhD, Political Science, University of California, San Diego (2012) MA, Political Science, University of California, San Diego (2009) BA, Political Science and Italian, University of California, Los Angeles (2005) His research centers on political institutions, democratic representation, electoral systems, and political dynasties. He is the author of the acclaimed book Dynasties and Democracy (Stanford University Press, 2018), which explores the persistence of political families in democracies, particularly in Japan. His work also investigates voter behavior, gender and age in politics, distributive politics, and legislative accountability. His recent publications in top journals such as the American Political Science Review , American Journal of Political Science , and The Journal of Politics reflect a strong trend toward mixed-methods research, combining large-scale data analysis with experimental designs. His work frequently employs conjoint experiments, natural experiments, and administrative data to study political behavior and institutional effects. Winner of the 2023 Lawrence Longley Award (APSA) Winner of the 2022 Kenneth A. Shepsle Prize Honorable mention for the 2024 APSA Best Paper Award Smith has advised numerous graduate students and co-organizes the Japanese Politics Online Seminar Series (JPOSS). He has also co-edited multiple volumes in the Japan Decides series, analyzing Japanese general elections. He teaches courses on electoral rules, representation, and Japanese politics at both undergraduate and graduate levels. His research is supported by active collaborations with scholars across the U.S. and Japan, and he maintains a robust pipeline of working papers on topics such as coalition dynamics, gender bias, and constituency-building.

• Comparative Politics
• Political Economy
• Political Behavior
• +۷ مورد دیگر

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. His research is generously supported by an ERC Starting Grant and an ISF Grant. He actively supervises PhD and MSc students, and seeks highly motivated candidates for postdoc, PhD, and MSc positions in programming language theory, concurrency, and formal methods. Dr. Lahav completed his PhD at Tel Aviv University under the supervision of Arnon Avron. In 2014, he was a postdoctoral researcher at Tel Aviv University hosted by Mooly Sagiv. From 2014 to September 2017, he was a postdoctoral researcher at MPI-SWS in Germany hosted by Viktor Vafeiadis and Derek Dreyer. His primary research areas focus on programming languages and verification, with specialization in concurrency and relaxed memory models. He also has significant interests in proof-theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in programming language design and implementation. Dr. Lahav's publication record shows a consistent trajectory of high-impact research in top-tier conferences including PLDI, POPL, OOPSLA, and ESOP. His recent work (2023-2025) demonstrates continued leadership in memory models, concurrency semantics, and verification techniques. His research spans both theoretical contributions in denotational semantics and practical tools for verification. Best Paper Award DISC 2024 Best Student Paper Award DISC 2024 Distinguished Artifact Award ESOP 2022 Distinguished Paper Award OOPSLA 2021 Kleene Award for Best Student Paper LICS 2013 Dr. Lahav actively advises students including Yoav Ben Shimon, Yotam Dvir, Amir Karniel, and Roy Margalit (PhD students), Yuval Katsman Ezra (MSc student), and has alumni including Ori Saporta (MSc) and Abhishek Kr Singh (postdoc, now Assistant Professor at IIIT Hyderabad). He has organized significant events including VMCAI 2024 and Dagstuhl Seminars on persistent programming. His teaching portfolio includes courses on Shared Memory Concurrency Semantics, Programming Language Foundations, and Software Foundations in Coq.

• Programming Languages
• Verification
• Concurrency
• +۴ مورد دیگر

Ethan Scheiner is a Professor and Chair in the Department of Political Science at the University of California, Davis. His research focuses on the intersection of politics and sports, Japanese politics, electoral systems, and comparative politics. He holds a Ph.D. from Duke University and has held postdoctoral fellowships at Stanford and Harvard Universities. Education: Ph.D. (Duke University, 2001), M.A. (Duke University, 1998), M.A. (University of Wisconsin-Madison, 1994), B.A. (UC Santa Cruz, 1991) Professor Scheiner’s research explores how sports narratives intersect with political movements, as exemplified in his 2023 book *Freedom to Win*, which examines Cold War-era Czechoslovakian hockey as a metaphor for national resistance. He also studies electoral systems globally, co-authoring *Electoral Systems and Political Context* (2012) and co-editing the *Japan Decides* series. His teaching emphasizes applying political science concepts through courses like *Politics & Sports* and *Comparative Electoral Systems*. Notable awards include recognition for mentorship (2015) and being a finalist for the ASUCD Excellence in Education Award (2011). His work has been published in leading journals such as the *American Political Science Review* and *British Journal of Political Science*. Key grants and advising: Extensive academic networks and contributions to policy analysis in Japan. Labs/Teams: Collaborates with interdisciplinary teams analyzing sports-politics intersections and electoral dynamics.

• Comparative Politics
• Politics & Sports
• Japanese Politics
• +۳ مورد دیگر

Lars Kristiansen is Professor II (part-time Professor) at the Department of Mathematics, University of Oslo . His research centres on the intersection of mathematical logic, computability theory, and computational complexity, with recent emphasis on computable analysis, weak first-order theories, subrecursive degree structures, and implicit computational complexity. Research Interests Computable Analysis: Representations and computational complexity of irrational and real numbers. Weak First-Order Theories: Decidability, interpretability and fragments of concatenation theories. Subrecursive Degree Theory: Fine structure of honest subrecursive degrees and the Grzegorczyk hierarchy. Implicit Computational Complexity: Reversible computing, type systems that capture complexity classes, and resource-bounded program analysis. Across more than 50 refereed publications since 1996, a clear trend emerges: an early focus on subrecursive hierarchies and honest degrees evolved into an intensive study of the computational content of real number representations and the logical strength of weak arithmetics. Recent work (2023-2025) deepens this agenda, analysing the complexity of converting between alternative representations of reals and the degree structures that these induce. Scientific Output While no named awards are listed, Kristiansen’s contributions are disseminated in top venues such as Bulletin of Symbolic Logic , Annals of Pure and Applied Logic , Archive for Mathematical Logic , Science of Computer Programming , and leading LNCS conferences. His work is frequently co-authored with Amir Ben-Amram, Jakob Grue Simonsen, Juvenal Murwanashyaka, Ivan Georgiev, and Neil D. Jones, indicating active collaborative networks in both logic and theoretical computer science. Research Groups & Collaborations Logic research group at the University of Oslo Data and Knowledge Management (DKM) group

• Mathematical Logic
• Computability Theory
• Complexity Theory
• +۴ مورد دیگر

Martin Delacourt is a Lecturer at the University of Orléans, affiliated with the LIFO (Laboratoire d'informatique fondamentale d'Orléans). He earned his PhD on December 5, 2011, under the joint supervision of Bruno Durand and Victor Poupet at LIF Marseille. His research focuses on cellular automata, including directional dynamics, limit sets, and decidability of computational problems. PhD: University of Montpellier 2 (2011) ENS Lyon: Bachelor (2006), Master (2008) His research explores cellular automata through computational complexity, symbolic dynamics, and formal verification. Key themes include limit set characterization, defect dynamics, and algorithmic properties of number systems. He has published in conferences like AUTOMATA, MFCS, and CiE. Teaching responsibilities include courses in network engineering, computability, complexity theory, operating systems, and algorithm analysis at the University of Orléans. He has supervised work-study students in the MIAGE program since 2018.

• Cellular Automata
• Computational Dynamics
• Theoretical Computer Science
• +۴ مورد دیگر