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

Ralf Schindlerمشاهده پروفایل

استاد

• Mathematical Logic
• Set Theory
• Model Theory
• +۴ مورد دیگر

Prof. Dr. Ralf Schindler is a Professor at the Institute for Mathematical Logic and Fundamental Research within the Department of Mathematics and Computer Science at the University of Münster. His primary research focuses on foundational aspects of mathematical logic, particularly in set theory and model theory. Schindler's research explores core areas including inner model theory, forcing techniques, large cardinals, determinacy axioms, and descriptive set theory. His investigations address fundamental questions about the structure of mathematical universes, consistency proofs, and connections between set theory and other mathematical disciplines. Recent work emphasizes applications of determinacy hypotheses and extensions of Martin's Maximum. Schindler's publications demonstrate consistent focus on advanced set theory concepts from 2000 to 2021. Key trends include deep investigations into inner models (especially core models and mouse constructions), forcing axioms and their consequences, determinacy hypotheses, and the interplay between large cardinals and descriptive set theory. His collaborative works frequently appear in premier logic journals. Schindler has received significant recognition for his contributions: Hausdorff Medal (2022) Dov Gabbay Prize (2024) He leads the research project EXC 2044 - A2: Groups, model theory and sets , which investigates applications of model theory to arithmetic geometry, topological dynamics, and group theory, while addressing fundamental questions in geometric group theory and set theory foundations.

• Secure Decentralized Systems
• Blockchain Technology
• Systems Security
• +۳ مورد دیگر

Prof. Bryan Ford leads the Decentralized/Distributed Systems (DEDIS) lab at EPFL. He focuses on secure decentralized systems, including blockchain technology, privacy, and systems security. He earned his Ph.D. from MIT and held faculty positions at Yale University and EPFL. His work spans distributed consensus protocols, peer-to-peer networking, and privacy-preserving systems. Key projects include QuePaxa (timeout-free consensus), UIA (global connectivity for mobile devices), and MedCo (secure healthcare data sharing). He advises numerous PhD students and contributes to open-source projects like Bitcoin collective signing and privacy networks like Riffle. Education: Ph.D., MIT; Postdoctoral work at Yale Research interests include blockchain scalability, consensus algorithms, and cryptographic privacy. His lab develops systems like TRIP for coercion-resistant voting and F3B to mitigate blockchain front-running. His work on NAT traversal and peer-to-peer protocols (e.g., STUN/ICE) remains foundational in network architecture. He emphasizes practical, auditable security solutions such as CertiKOS and atomic cross-chain transactions (Atom). Notable contributions: CoSi (collective signing), OmniLedger (sharded blockchain), and privacy-preserving protocols like PURBs (Protected Unsealable Recursive Boxes). His lab collaborates with Swiss Post to audit e-voting systems and designs democratic cryptocurrencies like PoPCoin.

Gerold Alsmeyerمشاهده پروفایل

استاد

• Theory of stochastic processes
• Stochastic fixed-point equations
• Iterated function systems
• +۷ مورد دیگر

Prof. Dr. Gerold Alsmeyer is a faculty member at the Institute of Mathematical Stochastics, Department of Mathematics and Computer Science, University of Münster. He is an active researcher with a focus on stochastic processes, particularly stochastic fixed-point equations and iterated function systems. His work is supported by his role as an Investigator in Mathematics Münster in the project EXC 2044 - C1: Evolution and asymptotics. His primary research interests include the theory of stochastic processes, branching processes, Markov random walks, renewal theory, and the asymptotic analysis of random structures such as random trees and polytopes. He has made significant contributions to the understanding of fluctuation theory, perpetuities, and the smoothing transform. His recent publications (2017–2023) reveal a sustained focus on theoretical probability, with recurring themes in random difference equations, iterated function systems, and limit theorems for stochastic processes. The work spans pure mathematical theory and applications in mathematical biology and combinatorics, indicating a broad yet deep research profile. Prof. Alsmeyer has supervised numerous doctoral and master’s students, including Viet Hung Hoang, Christopher Eick, Philipp Godland, and Fabian Buckmann, whose dissertations cover topics in branching processes, random walks, and stochastic fixed-point equations. He has no listed scientific awards in the provided texts. He teaches courses in probability theory, mathematical statistics, branching processes, and stochastic recursion equations, demonstrating a strong commitment to academic mentoring and education.

Joel David Hamkinsمشاهده پروفایل

استاد

• Set Theory
• Computability Theory
• Philosophy of Mathematics
• +۷ مورد دیگر

Joel David Hamkins is the O’Hara Professor of Logic at the University of Notre Dame, with significant affiliations to logic and philosophy research communities in China and Japan. His work bridges set theory, computability, and philosophy of mathematics, focusing on foundational questions about infinity, truth, and mathematical existence. Key Research Areas : Set theory, potentialism, continuum hypothesis, surreal numbers, forcing, large cardinals, definability, halting problem history Recent Talks : Kobe University (2025), Notre Dame HPS Colloquium (2025), Fudan University seminars (2025), Peking University conference (2025) Scientific Contributions : 2024 arXiv paper on halting problem attribution, ongoing work on bi-interpretation of surreal arithmetic with ZFC, analysis of transitive submodel principles Awards & Recognitions : William Reinhardt Memorial Lecture (2025), former JSPS Fellowship at Kobe University Hamkins’ work reveals deep connections between technical set theory and philosophical inquiry, particularly through his modal logic approach to potentialism and analysis of truth nonabsoluteness. His 2024 paper with Theodor Nenu re-examines Turing’s legacy, while his technical collaborations with researchers from Fudan University and Oxford advance foundational mathematics.

Dominique Devrieseمشاهده پروفایل

استاد

• Functional Programming
• Object Capabilities
• Secure Compilation
• +۵ مورد دیگر

Dominique Devriese is a professor at the Department of Computer Science, KU Leuven, and a member of the DistriNet research group. His work bridges computer security, programming languages, and formal verification. Research interests: Functional Programming, Object Capabilities, Secure Compilation, Dependently-typed Programming, Modal Type Theory Teaching: Formal Systems, Object-Oriented Programming, CyberSecurity, Secure Software His research focuses on rigorous software systems security through capability machines and secure compilation techniques. He actively contributes to formal verification using Agda and Haskell, with recent work on multimode type theory and effect parametricity. Key publication trends include: multimode/presheaf type theory, capability-based security models, formal verification of hardware/software abstractions, and parametricity applications in programming languages. Contact: Email: dominique.devriese@kuleuven.be ORCID: 0000-0002-3862-6856

Dmitriy Traytelمشاهده پروفایل

دانشیار

• Logic
• Automata Theory
• Runtime Verification
• +۷ مورد دیگر

Dmitriy Traytel is an Associate Professor at the University of Copenhagen's Department of Computer Science since August 2020, where he currently heads the Software, Data, People & Society (SDPS) section. Prior to this position, he worked as a senior researcher (Oberassistent) in the Information Security Group led by David Basin at ETH Zürich. He completed his PhD at TU München under Tobias Nipkow's supervision in 2015. His research focuses on formal methods, particularly logic, automata theory, runtime verification and monitoring, decision procedures, (co)induction and (co)recursion, and interactive theorem proving. Traytel develops formally verified tools for runtime monitoring including VeriMon, TimelyMon, and WhyMon, emphasizing correctness and efficiency in monitoring complex temporal properties. His recent publications (2021-2025) demonstrate a strong focus on first-order temporal logic monitoring, with particular attention to explainable verdicts, scalable parallel implementations, and formal verification of monitoring algorithms. The work spans theoretical foundations in logic and category theory while maintaining practical applications in runtime verification systems. Distinguished Paper Award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski' Best Student Paper Award at FSCD 2016 Distinguished Paper Award at ATVA 2018 Traytel has supervised numerous PhD, Master's, and Bachelor's students in areas spanning formal verification, runtime monitoring, and theorem proving. His research has been supported through collaborations with major institutions including ETH Zürich and TU München. He actively contributes to the academic community by serving on program committees for major conferences including ITP 2025 and RV 2025. He leads the Software, Data, People & Society section at the University of Copenhagen, focusing on developing formally verified tools for runtime verification that bridge theoretical computer science with practical applications in security and system monitoring.

Martín Hötzel Escardóمشاهده پروفایل

استاد

• Homotopy Type Theory
• Univalent Mathematics
• Martin-Löf Type Theory
• +۱۲ مورد دیگر

Martín Hötzel Escardó is a Professor of Theoretical Computer Science in the School of Computer Science at the University of Birmingham, UK. He has been a faculty member since 2000, following previous academic positions at Imperial College London, the University of Edinburgh, and the University of St Andrews. His research bridges theoretical computer science and pure mathematics, with a strong emphasis on foundational aspects of computation. His educational background includes a BSc and MSc from Universidade Federal do Rio Grande Sul (Brazil) and a PhD from Imperial College London (1997) under Michael B. Smyth. Escardó's research interests center on topology in computation , constructive mathematics , dependent and univalent type theory (including Homotopy Type Theory and Cubical Type Theory), domain theory , locale theory , and exact real-number computation . His work explores deep connections between logic, topology, and programming, often using functional languages like Haskell and Agda to formalize and experiment with theoretical ideas. He is particularly known for his discoveries on exhaustively searchable infinite sets and the topological nature of computability. The trend in his recent publications reflects a sustained focus on univalent foundations, constructive domain and order theory, game semantics with dependent types, and the logical structure of type universes. His work consistently advances the formalization and understanding of higher-type computation and constructive mathematics within modern type theories. He has no listed scientific awards in the provided text, but his influence is evident through his extensive publication record and software developments like TypeTopology. Escardó has advised several students and collaborators, though specific names are not listed. He has been involved in significant research projects, particularly in the formalization of mathematics in type theory and the semantics of programming languages. His work often involves developing Agda libraries to formalize new mathematical results constructively. He leads and contributes to a vibrant research group in theoretical computer science at Birmingham, with a focus on logic, semantics, and type theory. His public research blog, lecture notes, and open-source Agda code (e.g., TypeTopology, HoTT-UF-in-Agda) serve as important resources for the community.

Steve Zdancewicمشاهده پروفایل

استاد

• Programming Languages
• Type Theory
• Logic
• +۷ مورد دیگر

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

• Artificial Intelligence
• Machine Learning
• Data Mining
• +۵ مورد دیگر

Ling Zhao is a distinguished Professor at the School of Management, Huazhong University of Science and Technology, China, with extensive research contributions spanning artificial intelligence, machine learning, information systems, and biomedical applications. With over 150 publications since 2008, Dr. Zhao has established herself as a leading researcher in multiple interdisciplinary domains, particularly in applying computational methods to solve complex real-world problems. Dr. Zhao's research interests encompass a broad spectrum of cutting-edge topics including artificial intelligence, machine learning, data mining, control systems, and information systems. Her work demonstrates exceptional versatility, bridging theoretical computer science with practical applications in healthcare, transportation, cybersecurity, and business management. Notably, she has made significant contributions to sentiment analysis, medical image processing, algorithmic management, and privacy-preserving data analysis. Her research methodology often combines deep learning approaches with domain-specific knowledge to develop innovative solutions. Analysis of Dr. Zhao's recent publications (2023-2025) reveals a strong focus on interdisciplinary applications of AI, with particular emphasis on healthcare informatics (medical image analysis, disease diagnosis), human-computer interaction (algorithmic management effects), and advanced machine learning techniques (graph neural networks, multimodal learning). Her work shows a consistent trend toward increasingly complex and integrated systems that address real-world challenges across multiple domains. Dr. Zhao has made substantial contributions to academic advising and research mentorship, though specific student names aren't detailed in the available publications. Her research has been supported by various grants enabling work in AI applications, biomedical engineering, and information systems. Dr. Zhao maintains active collaborations with researchers across China and internationally, as evidenced by her co-authorship patterns. While specific laboratory information isn't explicitly mentioned in the publication records, Dr. Zhao appears to lead or be significantly involved in research groups focusing on AI applications in management and healthcare. Her work on medical imaging, sentiment analysis, and control systems suggests involvement in multiple specialized research teams addressing different application domains through computational approaches.

Philipp Staabمشاهده پروفایل

استاد

• Sociology of Work
• Digital Capitalism
• Political Economy of Technology
• +۹ مورد دیگر

Prof. Dr. Philipp Staab is a full professor of Sociology of the Future of Work at Humboldt-Universität zu Berlin, affiliated with the Einstein Center Digital Future (ECDF). His research lies at the intersection of digital capitalism, labor sociology, and the political economy of technology and artificial intelligence. He holds a PhD from the University of Kassel and has held research and teaching positions at institutions including the Hamburg Institute for Social Research, WZB Berlin, and the University of St. Gallen. Staab is a leading voice in analyzing how digital transformation reshapes labor, power, and governance. His research focuses on: Theoretical foundations of digital capitalism Power structures in platform economies and industrial digitalization The role of venture capital and financialization in shaping work The political economy of artificial intelligence and digital sovereignty The transformation of the public sphere in the digital age The social implications of green and digital transitions Staab’s recent publications explore the geopolitical dimensions of technology, sustainable digital market design, and the crisis of legitimacy in green capitalism. His work reveals patterns of increasing control, inequality, and state intervention in digital economies. He leads a collaborative research environment with multiple assistants and contributes to public discourse through books, policy papers, and media engagement. Notable recognitions include: Hans Matthöfer Prize for Business Journalism (2021) Named one of 'Germany’s 30 by 2030' by WirtschaftsWoche (2024) Staab advises on digital and labor policy and is involved in interdisciplinary research networks. He supervises a team of researchers and contributes to academic and public debates on the future of work, digital sovereignty, and ecological transformation.

• Macroeconomics
• Macro-Finance
• Econometrics
• +۷ مورد دیگر

Prof. Dr. Alexander Meyer-Gohde is a Professor of Financial Markets and Macroeconomics at Goethe University Frankfurt’s Faculty of Economics and Business, and a key figure at the Institute for Monetary and Financial Stability (IMFS). His research spans macroeconomic theory, macro-finance, numerical methods, and econometrics, focusing on DSGE models, nonlinear dynamics, and the impact of risk and uncertainty on monetary policy. Education : PhD in Economics (Technische Universität Berlin), MA in Economics and Management (Humboldt-Universität zu Berlin), BA in Language, Literature & Culture (Colorado State University). Research Interests : Macroeconomics, macro-finance, numerical methods, recursive preferences, stochastic volatility, and model uncertainty. Grants : DFG Individual Research Grant (2021-2024) and MatlabMakro DigiTeLL Grant (2022-2023). Publications : Focus on DSGE model solution methods, numerical stability, term premia, and nonlinear dynamics in macroeconomics. Students : Supervises job market candidates Johanna Saecker and Mary Tzaawa-Krenzler. Leadership : Chair of Financial Markets and Macroeconomics at Goethe University (2018–present) and coimplementation of the IMFS “Project Monetary and Financial Stability”.

• Theoretical Computer Science
• Discrete Mathematics
• Randomized Algorithms
• +۱ مورد دیگر

Wolfgang Merkle is a Privatdozent at Universität Heidelberg's Institut für Informatik, affiliated with the Faculty of Mathematics and Computer Science. His research focuses on Theoretical Computer Science and Discrete Mathematics, particularly randomized algorithms and Kolmogorov complexity. He teaches courses including 'Randomized Algorithms' and seminars on Kolmogorov complexity for Bachelor and Master programs. Research interests span algorithmic randomness, computational complexity, and information theory, with significant contributions to understanding computability limits and the foundations of theoretical computer science. His recent publications explore the interplay between randomness and computational efficiency, with works examining superspeedability, relativized depth, and information distance theories.

• Mathematical Logic
• Philosophical Logic
• Philosophy of Mathematics
• +۳ مورد دیگر

Prof. Dr. Reinhard Kahle is a faculty member at the University of Tübingen in the Faculty of Philosophy . He holds the academic rank of Professor and his research focuses on Mathematical Logic , Philosophical Logic , Philosophy of Mathematics , and History of Logic . He also investigates the Societal Relevance of Science and Philosophy of Language . Education : Studium der Mathematik, Philosophie und Informatik in Göttingen, Zürich und München (1987-1993) Diplom in Mathematik, LMU München (1993) Promotion in Informatik, Universität Bern (1997) Habilitation in Informatik, Universität Tübingen (2007) Habilitation in Mathematik, Universidade de Coimbra (2008) Awards : Carl Friedrich von Weizsäcker-Stiftungsprofessor für Theorie und Geschichte der Wissenschaften, University of Tübingen (2019) Publications : Advances in Proof Theory (2016, co-editor) Gentzen's Centenary: The quest for consistency (2015, co-editor) Over 40 peer-reviewed journal articles and book chapters focusing on proof theory, mathematical logic, and philosophical implications of formal systems

Dominique Unruhمشاهده پروفایل

استاد

• Quantum Computing
• Quantum Cryptography
• Post-Quantum Cryptography
• +۵ مورد دیگر

Dominique Unruh is a Professor at RWTH Aachen University , leading the Chair for Quantum Information Systems . Additionally, they hold a Professorship in Cryptography at the Institute of Computer Science of the University of Tartu , Estonia. Their research spans quantum computing , quantum cryptography , post-quantum cryptography , and formal verification of cryptographic protocols and programs. Research Focus : Quantum programs, zero-knowledge proofs, lattice-based cryptography, and quantum random oracle model. Key Contributions : Advancements in NTRU encryption efficiency, quantum Hoare logic, and rewinding techniques for security proofs. Tools : Active development in the EasyCrypt framework for cryptographic verification. Email : unruh@cs.rwth-aachen.de

Benjamin Lucien Kaminskiمشاهده پروفایل

استاد

• formal verification
• semantics
• probabilistic programs
• +۱۰ مورد دیگر

Benjamin Lucien Kaminski is a Professor at Saarland University and a Lecturer at University College London . He specializes in quantitative aspects of formal program verification , with a focus on probabilistic and quantum programs , incorrectness logic , and non-classical computation models . His research includes semantics , probabilistic program verification , expected runtimes , and explainable verification . He leads the Examination Board for B.Sc. Computer Science (English) and actively mentors PhD, Master’s, and Bachelor’s students in logic and verification. 2025 : A Taxonomy of Hoare-Like Logics (POPL), Partial Incorrectness Logic (TPSA) 2024 : Quantitative Weakest Hyper Pre (OOPSLA), Caesar: A Verifier for Probabilistic Programs (Dafny), Hoare-Like Triples (Incorrectness-track) 2023 : A Deductive Verification Infrastructure (OOPSLA), Lower Bounds (OOPSLA), A Calculus for Amortized Expected Runtimes (POPL) He has received notable awards including the Ackermann Award (2020), Best Paper at LOPSTR 2020 , and EATCS Best Paper Award at ETAPS 2016 . He has also served on program committees for leading conferences like CAV , POPL , and LICS , and reviewed for prestigious journals such as Journal of the ACM and TOCL .