جست‌وجوی استاد و پژوهشگر

• Computer Science
• Continuous Time Models of Computation
• Analog Computing
• +۱۲ مورد دیگر

Olivier Bournez is a Professor of Computer Science at École Polytechnique, part of Institut Polytechnique de Paris (IP Paris), where he is affiliated with the Department of Computer Science (DIX) and the Computer Science Laboratory (LIX), a joint CNRS unit (UMR 7161). He previously served as Director of LIX from 2010 to 2015 and currently holds key leadership roles including Vice-head of the Computer Science, Data and Artificial Intelligence department at IP Paris, Head of the 'Proofs and Algorithms' pole, and Head of the 'Algorithms and Complexity' team at LIX. His research focuses on the theoretical foundations of computation, particularly continuous-time models such as analog computing and dynamical systems, computational complexity over real numbers, distributed computing models like population protocols, and the interplay between differential equations and computation. He explores the limits of computability and complexity in both discrete and continuous domains, with applications in verification, rewriting systems, and chemical computation models. The recent publications reflect a strong trend in characterizing computability and complexity using discrete and continuous ordinary differential equations, with significant contributions to the understanding of polynomial-time computation over real numbers and the Turing completeness of chemical reaction networks. His work bridges theoretical computer science, mathematics, and biological computation, often yielding foundational insights with broad implications. MFCS'2023 Best Paper Award (coauthored with Manon Blanc) MCU'2022 Student Best Paper Award (Manon Blanc) ICALP'2016 Best Paper Award (Track B) CIE'2016 Best Paper Award CMSB'2017 Best Paper Award Ackermann Award 2017 (Amaury Pouly, PhD co-supervised) Bournez has advised several successful students, including Amaury Pouly and Manon Blanc, and has secured research funding, notably the ANR project ∂IFFERENCE. He is actively involved in the academic community, managing the Computability in Europe (CIE) association membership and serving on the editorial board of the journal Computability . His work includes educational outreach through articles in La Recherche , Le Monde 's blog 'Binaire', and the co-authorship of a French computer science textbook. He leads the 'Algorithms and Complexity' research team at LIX and is central to the 'Proofs and Algorithms' pole, fostering collaborative research in foundational computer science.

Rizvana Bradleyمشاهده پروفایل

دانشیار

• Aesthetic Theory
• Art History
• Black Critical Theory
• +۷ مورد دیگر

Rizvana Bradley is Associate Professor of Film and Media and Affiliated Faculty in the History of Art and the Center for Race and Gender at the University of California, Berkeley. She served as the 2023-24 Terra Foundation Visiting Professor for American Art at the John F. Kennedy Institute for North American Studies at Freie Universität Berlin, where she taught courses on Horror and the Cinematic Unconscious, Political Depression and the Aesthetics of Sovereignty, and Art, Race, and Media Poetics. Bradley's research spans Aesthetic Theory , Black Critical Theory , Contemporary Art , Continental Philosophy , Film Theory , and Race and the Philosophy of Media . Her work examines how Black art deconstructs aesthetic forms foundational to modernity, with particular attention to questions of race, gender, and representation. She approaches these themes through explorations of affect theory, its interlocutors, and its critics, with emphasis on what Sianne Ngai terms 'minor feelings' and 'negative affects' in their racial and gendered dimensionality. Her critically acclaimed book Anteaesthetics: Black Aesthesis and the Critique of Form (Stanford University Press, 2023) was named a Best Book of the Year by Frieze Magazine and shortlisted for the Modern Language Association Prize for a First Book. The book moves across multiple histories and artistic mediums—from nineteenth-century painting and early cinema to contemporary text-based works, video installations, and digital art—to inaugurate ante-formalism, a new method for interpretation that demonstrates black art's recursive deconstruction of aesthetic forms foundational to modernity. Advisory Board member of October Advisory Board member of Camera Obscura Bradley's scholarly articles appear in Diacritics , Film Quarterly , Black Camera , Discourse , and TDR: The Drama Review . Her art criticism has been published in The Yale Review , Artforum , e-flux , Art in America , and Parkett , as well as in exhibition catalogs for major institutions including the Serpentine Galleries, the New Museum, and the Berlin Biennale for Contemporary Art. Bradley has curated numerous academic arts symposia at institutions including the British Film Institute, Serpentine Galleries, and Stedelijk Museum of Art. Her work has been supported by the Andrew W. Mellon Foundation, the Terra Foundation for American Art, Creative Capital, and the Andy Warhol Foundation. She holds a PhD from Duke University and was a Helena Rubinstein Critical Studies Fellow at the Whitney Museum of American Art in New York.

Aaron Glassمشاهده پروفایل

استاد

• Native Peoples of the Northwest Coast
• Museums and Anthropology
• Colonialism and Indigenous Modernities
• +۲ مورد دیگر

Aaron Glass is Professor and Associate Chair of Research Programs at Bard Graduate Center , New York City. His work focuses on the cultural histories of the Native Peoples of the Northwest Coast , examining intersections of Museums, Anthropology, Colonialism, Indigenous Modernities , Intercultural Exchange , and Visual Media . Education: PhD in Anthropology (New York University), MA in Anthropology (University of British Columbia), BFA in Studio Art (Emily Carr Institute), BA in Anthropology/Psychology (Reed College) Research Themes: Glass investigates how Indigenous material culture mediates colonial narratives, focusing on totem poles, Hamat'sa ceremonies, and Edward Curtis's ethnographic films. His work emphasizes Indigenous ontologies , digital networks , and decolonizing museum practices . Scientific Contributions: He received a $150,000 NEH Award (2023) for collaborative projects reassembling Franz Boas's 1897 monograph. His 15 most recent articles span topics from Kwakwaka'wakw ceremonial practices to digital ethnographic editions , reflecting interdisciplinary engagement with material culture theory , archival research , and decolonial methodologies .

Sven Scheweمشاهده پروفایل

استاد

• Automata Theory
• Game Theory
• Formal Verification
• +۱۲ مورد دیگر

Sven Schewe is a Professor in the Department of Computer Science at the University of Liverpool, affiliated with the School of Electrical Engineering, Electronics and Computer Science. He leads the AI Section and is a founding member and former leader of the Verification Group. He also has secondary affiliations with the Algorithms, Complexity Theory and Optimisation Group and the Institute for Risk and Uncertainty. Research Interests: His research centers on automata theory and game theory, particularly their applications in the verification and synthesis of reactive and safety-critical systems. He investigates infinite-duration games, automata over infinite words and trees, and develops algorithms and tools for automated verification, synthesis, and learning of optimal control strategies. His work extends to reinforcement learning with formal guarantees, cyber-physical systems, and AI safety. Recent Research Trends: His recent publications demonstrate a strong integration of formal methods with machine learning, particularly in adversarial training, neural network robustness, and model-free reinforcement learning under omega-regular objectives. He also applies formal reasoning to interdisciplinary domains such as chemical space exploration and materials science. Scientific Awards: Finalist for the ERCIM Cor Baayen Award 2010 Dr. Eduard Martin Preis 2009 GI Dissertation Award 2008 Advising and Grants: He actively supervises numerous PhD students and postdoctoral researchers. He is Principal Investigator (PI) or Co-Investigator (CI) on multiple major grants, including EPSRC Programme Grants, Royal Society Fellowships, and Horizon Europe projects. His funded research spans topics such as game theory, verification, synthesis, reinforcement learning, and risk analysis. He has hosted visiting researchers and collaborated internationally with institutions in Germany, France, India, Taiwan, and the US. Labs and Teams: He co-founded and led the Verification Group and previously led the AI Section at the University of Liverpool. These groups focus on formal methods, automata, games, and their applications in AI and safety-critical systems.

Michel Painمشاهده پروفایل

پژوهشگر

• Branching Brownian Motion
• Log-Correlated Fields
• Branching Random Walks
• +۶ مورد دیگر

Michel Pain is a CNRS Researcher at the Toulouse Mathematics Institute (Université de Toulouse). Previously, he held a Courant Instructor position at NYU's Courant Institute of Mathematical Sciences (2019-2021) and completed his PhD in probability theory at Sorbonne Université under Zhan Shi, focusing on branching Brownian motion. His research spans log-correlated fields , including branching Brownian motion/random walks, Derrida-Retaux models, and β-ensembles. He studies extremal statistics , stochastic structures , and phase transitions in hierarchical systems. Michel has published extensively on branching processes , weighted trees , and log-correlated random matrices , with recent work on supercritical phase overlaps (2025) and height asymptotics for weighted trees (2024). His supervised students include PhD candidate Louis Chataignier and several Bachelor/Master thesis authors. He currently teaches the Master 2 course Branching Processes with Pascal Maillard, having previously taught advanced probability at Université Toulouse III, complex analysis at NYU, and integration theory at ENS Paris.

Elmar Teuflمشاهده پروفایل

مدرس ارشد

• Random Walks on Graphs
• Combinatorics
• Probability Theory
• +۳ مورد دیگر

Elmar Teufl is a Senior Lecturer in the Department of Mathematics at Eberhard Karls Universität Tübingen. He holds a Doctorate (2002) and a Habilitation (2015) from Graz University of Technology and Tübingen University, respectively. His research focuses on random walks on graphs and groups, combinatorial problems on self-similar structures, asymptotic methods, and fractal geometry. His work bridges probability theory, combinatorics, and graph theory with applications to fractal networks and recursive systems. Teufl has held academic positions across Europe, including visiting professorships at the University of Stuttgart (2012–2013) and a Marie Curie Fellowship at Bielefeld University (2005–2006). His research has been supported by the Austrian Science Fund (FWF) and the EU. Key achievements include contributions to spanning tree enumeration on Sierpinski graphs and resistance scaling in self-similar lattices. His publications span topics like asymptotic enumeration, determinant identities for Laplacian matrices, and structural properties of nilpotent groups. He received the Austrian Mathematical Society's Studienpreis (2003) for his thesis on self-similar graphs and fractals. Teaching responsibilities include advanced courses in combinatorics and probability, with a full teaching record documented in alma.

• Asymptotic statistics
• Branching processes
• Limit theorems
• +۴ مورد دیگر

Prof. Dr. Matthias Meiners is a faculty member at Justus-Liebig-University Giessen, holding the Chair of Stochastics within the Mathematical Institute. His research focuses on Asymptotic statistics Branching processes Limit theorems Random walks in random environments Regenerative processes Renewal theory Statistical mechanics . Recent publications analyze complex stochastic phenomena across branching processes, random walks, and renewal equations, with 2025 preprints on CMJ explosions and Markov renewal expansions. 2024 works examine active Brownian particle dynamics and supercritical branching fluctuations. Earlier studies address kinetic equations, martingale convergence, and percolation model speeds. Contact: Email: Matthias.Meiners@math.uni-giessen.de Phone: 0641 99-32100 Office: Room 216, Arndtstr. 2, 35392 Gießen

• Theoretical Computer Science
• Logic in Computer Science
• Algorithms
• +۷ مورد دیگر

Alexandre Vigny is a junior professor at University Clermont Auvergne, France, where he conducts research at the intersection of logic, algorithms, and graph theory. His work focuses on theoretical computer science, particularly in model checking, query enumeration, and distributed algorithms on sparse graph classes. Research Interests: Theoretical Computer Science Logic in Computer Science Parameterized and Distributed Algorithms Graph Theory and Structural Sparsity Database Query Evaluation Reconfiguration Problems His recent publications explore algorithmic meta-theorems, first-order logic with connectivity, elimination distance, and distributed domination, primarily on sparse and structurally constrained graphs. His work appears in top venues such as LICS, ICALP, PODS, and JACM. Scientific Awards: No awards explicitly mentioned. Advising and Grants: Co-supervising Jona Dirks, PhD student since October 2024, with Mamadou Kanté. No specific grants mentioned, but active in collaborative research with prominent figures like Sebastian Siebertz, Luc Segoufin, and Patrice Ossona de Mendez. Labs and Teams: Previously part of Sebastian Siebertz’s team at the University of Bremen. Collaborates with researchers across Europe, including in Warsaw and Paris. Involved in the theoretical computer science community, co-organizing the PODC-DARE workshop.

• Probability Theory
• Branching Processes
• Products of Random Matrices
• +۷ مورد دیگر

Prof. Dr. Sebastian Mentemeier is a permanent Professor (W2) in the Department of Mathematics 2 at the Institute for Mathematics, Mathematics Education and Computer Science Education, University of Hildesheim, Germany, a position he has held since October 2019. He also holds significant administrative roles as Vice Dean and Dean of Studies in Faculty 4 (Mathematics, Natural Sciences, Economics & Computer Science), and is a member of the Institute's Board and the Central Commission for Studies and Teaching. His research is centered on advanced probability theory, with a focus on branching processes, products of random matrices, and extreme value theory for time series. His research interests include: Non-Gaussian limit theorems Branching processes, particularly Multitype Branching Random Walks Products of random matrices Extreme value theory for time series Heavy-tailed random variables Conditional limit theorems His recent publications, spanning from 2012 to 2022, demonstrate a consistent and high-impact research trajectory in theoretical probability. The articles reveal a strong trend in analyzing the asymptotic behavior of complex stochastic systems, particularly those defined by recursive equations and random matrix products. His work frequently intersects with statistical mechanics and time series analysis, often investigating the tail behavior and limit laws of solutions to stochastic fixed-point equations, with a particular emphasis on heavy-tailed and multivariate settings. Prof. Mentemeier has been a Principal Investigator on two major DFG projects: 'Nonlinear stochastic fixed-point equations with applications in statistical mechanics' (2017-2023) and 'Products of Random Matrices, Noncommutative Branching Random Walks, and Multitype Branching Random Walks in Random Environments' (since 2021). He is an active member of the academic community, serving as a referee for journals such as Stochastic Processes and their Applications and Journal of Theoretical Probability , and has co-organized international conferences on recursive stochastic processes and branching models. He supervises PhD and Master's students, although specific names are not listed on his profile. He has led a research group within the Department of Mathematics 2 and is a key member of the Institute's academic board. His work is conducted within the broader context of the Faculty of Mathematics, Natural Sciences, Economics & Computer Science at the University of Hildesheim.

Nada Aminمشاهده پروفایل

استادیار

• Programming Languages
• Artificial Intelligence
• Metaprogramming
• +۴ مورد دیگر

Nada Amin is an Assistant Professor of Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), where she leads the metareflection lab . Her research combines programming languages (PL) and artificial intelligence (AI), focusing on neuro-symbolic systems that are correct by construction, with applications in program synthesis, verification, and precision medicine. Harvard John A. Paulson School of Engineering and Applied Sciences (2019–Present) University Lecturer in Programming Languages at University of Cambridge (2017–2019) Doctoral and postdoctoral work at EPFL (2011–2017) Her research spans three core themes: Safer : Type systems and formal verification (Coq, Dafny, Frama-C) Faster : Multi-stage programming and interpreter collapsing techniques Easier : Neuro-symbolic AI for program manipulation and biological reasoning Key publications include: 2025: Modular Imperative with LLMs (LMPL), Multi-stage Relational Programming (PLDI) 2024: Persimmon for extensible variant types (OOPSLA) 2023: LURK for recursive knowledge (ICFP), Dolorem language growth pattern (ECOOP) Scientific honors include: Teaching Assistant Team Award (EPFL, 2015) Michigan Cambridge Research Initiative Grant (2018) ArsDigita Prize (1999) She has served on program committees for GPCE (co-chair), ICFP, PLDI, and organized workshops in metaprogramming and logic programming. Her teaching portfolio includes graduate courses on neurosymbolic programming, program synthesis, and advanced PL theory.

Benjamin C. Pierceمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Language-based Security
• +۵ مورد دیگر

Benjamin C. Pierce is the Henry Salvatori Professor of Computer and Information Science in the School of Engineering and Applied Science at the University of Pennsylvania. As a Fellow of the ACM, he has made significant contributions to programming language theory and formal methods. His academic leadership includes previous editorial roles as co-Editor in Chief of the Journal of Functional Programming and Managing Editor for Logical Methods in Computer Science. His research spans multiple interconnected domains in programming language theory, with particular emphasis on type systems and their applications to security and verification. Pierce's work bridges theoretical foundations with practical implementations, most notably through his development of the Unison file synchronization tool and contributions to the Clowdr virtual conference platform. His research interests form a cohesive trajectory from foundational type theory to applied security and verification techniques. Pierce's scholarly output shows consistent focus on property-based testing, type systems, and formal verification methods. His recent publications demonstrate evolving interests in differential privacy verification, synchronization technologies, and the practical challenges of implementing formal methods in real-world systems. The progression of his work reflects both theoretical depth and practical relevance to software development challenges. Fellow of the ACM Author of influential textbooks Types and Programming Languages and Software Foundations Lead designer of the Unison file synchronizer Co-developer of the Clowdr virtual conference platform Former editorial leadership for multiple prominent programming languages journals As an educator and mentor, Pierce has contributed to the Programming Languages Mentoring Workshop (PLMW) and has served on numerous conference program committees. His academic service extends to SIGPLAN leadership roles including SIGPLAN Vice Chair and Steering Committee membership. His textbook Software Foundations has become a standard resource for teaching formal methods and proof assistants.

Stephanie Balzerمشاهده پروفایل

استادیار

• Programming Languages
• Type Theory
• Program Verification
• +۶ مورد دیگر

Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. She received her PhD from ETH Zurich under Thomas R. Gross and focuses on developing rigorous type systems and verification logics to build failure-free, secure software through compositional and practical methods. Education: PhD (ETH Zurich), Master's (University of Zurich), Semester Thesis (University of Zurich) Her research spans session types , logical relations , and separation logic to ensure correctness and security in concurrent systems. Recent work includes verifying timed message-passing protocols and disentanglement in type systems. Key publication trends include session-typed concurrency , noninterference , and deadlock freedom across programming languages, formal methods, and security domains. She has authored multiple distinguished papers at ECOOP and POPL. Scientific Awards: NSF CAREER Award, ACM SIGPLAN Distinguished Paper, ECOOP Distinguished Paper She advises PhD students including Yue Yao, Yinsen Zhang, and Zak Kent, and has supervised former PhD students like Jules Jacobs (now at Cornell). Her grants include NSF funding for IoT verification , heterogeneous applications , and real-time protocols .

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

مدرس

• Software Verification
• Formal Methods
• Program Analysis
• +۵ مورد دیگر

Philipp Wendler is an academic lecturer in the Department of Computer Science at Ludwig-Maximilians-Universität München (LMU Munich). He is affiliated with the Software and Computational Systems Lab and actively involved in research, teaching, and open-source tool development. As an employee representative in the steering committee of the Institute of Informatics, he contributes to institutional governance. His research focuses on software verification, formal methods, and program analysis. Key projects include CPAchecker (a configurable verification framework) and BenchExec (a benchmarking tool). His work emphasizes practical applications in automated testing, energy-efficient algorithms, and reproducible benchmarking. Publications span topics like interpolation-based model checking, energy measurement tools, and strategies for software verification competitions. He has contributed to advancing predicate analysis, k-induction, and refinement selection techniques. Notable achievements include leading the development of CPAchecker and BenchExec, which are widely used in academic and industrial verification efforts. His research addresses challenges in scalable verification, flaky test analysis, and energy-aware computing.

Emilija Perkovicمشاهده پروفایل

استادیار

• Causal Inference
• Graphical Models
• Probabilistic Graphical Models
• +۳ مورد دیگر

Emilija Perkovic serves as the Dorothy Gilford Early Career Endowed Professor in Mathematical Statistics within the Department of Statistics at the University of Washington. She joined the department in Autumn 2018 as an Acting Assistant Professor and advanced to a tenure-track Assistant Professor position in Autumn 2020, establishing herself as a core faculty member in statistical methodology. Her academic foundation includes: B.Sc. in Mathematics from the University of Belgrade (2012) M.Sc. in Statistics from ETH Zürich (2014) Ph.D. in Statistics from ETH Zürich (2018) under Professor Marloes Maathuis Perkovic's research pioneers causal inference methodologies through probabilistic graphical models, focusing on intuitive frameworks for causal identification and estimation from observational data. Her work bridges theoretical statistics with practical applications, particularly in covariate adjustment techniques and Markov equivalence class analysis. She actively integrates expert knowledge to refine causal models, making complex inference accessible for real-world data challenges where experimental intervention is impossible. Her publication record reveals a concentrated evolution in causal graph theory, with recent preprints advancing adjustment criteria for diverse graph structures (MPDAGs, MAGs, ancestral graphs). Key trends include developing sound/complete identification rules, efficient estimation techniques under linearity, and minimal effect enumeration in equivalence classes—collectively enhancing robustness in observational causal analysis. Her scientific recognition includes: Best Poster Award, Semantic Statistics (SEMSTAT), Statistical Network Science Workshop (2017) While specific advising details and grant histories remain unreported in source materials, Perkovic's research trajectory indicates active mentorship through co-authored preprints with junior collaborators like Sara LaPlante and F. Richard Guo. Her Dorothy Gilford Endowed Professorship likely supports ongoing methodological innovation in causal statistics. No laboratory or team structures are explicitly referenced in her professional profile, suggesting independent or collaborator-driven research within the Statistics Department framework.

Christian Mendlمشاهده پروفایل

استادیار

• Quantum Computing
• Computational Physics
• Statistical Physics
• +۲ مورد دیگر

Christian Mendl is a Rudolf Mößbauer Tenure Track Assistant Professor at the Technical University of Munich (TUM) , affiliated with the School of Computation, Information and Technology and the Institute for Advanced Study (TUM-IAS) . His career includes a postdoctoral position at Stanford University (2015-2017) under a Feodor Lynen Fellowship from the Alexander von Humboldt Foundation, a Junior Professorship at TU Dresden (2017-2019), and a PhD in Physics from LMU Munich (2012). Education : Physics and Mathematics (TUM) Appointments : Rudolf Mößbauer Assistant Professor (TUM, 2019), Junior Professor (TU Dresden, 2017), Postdoc (Stanford, 2015-2017) Research Focus : Mendl specializes in Quantum Computing , Computational Physics (tensor networks, quantum Monte Carlo, neural-network quantum states), Statistical and Non-Equilibrium Physics , and Numerical Simulation . His work bridges quantum information theory with condensed matter physics, emphasizing efficient quantum algorithms and simulators for complex systems. Scientific Contributions : Recent publications highlight advancements in quantum circuit optimization , tree tensor network simulations , block encoding of operators , and quantum-assisted optimization for problems like the capacitated vehicle routing and Toda lattice dynamics. His methods often integrate machine learning with quantum information to address challenges in Hamiltonian simulation and quantum error analysis . Awards : Alexander von Humboldt Feodor Lynen Fellowship, Boehringer Ingelheim Fonds PhD Fellowship, TopMath Graduate Program, Studienstiftung des deutschen Volkes Grants : Rudolf Mößbauer Tenure Track Fellowship (TUM-IAS), Dieter Schwarz Fellowship