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

Richard Elmanمشاهده پروفایل

استاد

• Algebra
• Quadratic Forms
• Algebraic Geometry
• +۴ مورد دیگر

Richard Elman is a Professor of Mathematics at the University of California, Los Angeles (UCLA), affiliated with the Department of Mathematics. His research focuses on algebraic structures, particularly quadratic forms, Witt rings, and their connections to algebraic geometry and Galois cohomology. He has authored foundational texts like Lectures in Algebra and contributed to topics such as elliptic curves, linear algebraic groups, and cohomological dimensions. His work bridges abstract algebra with geometric and topological methods, influencing both pure and applied mathematical research. Elman's research interests include advanced algebraic theories such as quadratic form theory, Witt ring structure, and the interplay between algebraic geometry and number theory. He has explored topics like cohomological dimensions of fields, étale cohomology, and the classification of quadratic forms over various fields. His publications often address problems at the intersection of algebraic structures and geometric interpretations. His recent work (2019) continues the development of abstract algebraic frameworks, while earlier contributions (2008, 2006) delve into geometric and cohomological aspects of quadratic forms. Notable projects include studies on elliptic curves over local fields and the structure of Witt rings. Elman has also engaged in interdisciplinary efforts, such as public health research on reducing environmental tobacco smoke exposure in communities. Though no specific student or grant information is provided in the text, his extensive publication record indicates sustained academic contributions. His office is located in the Mathematical Sciences Building at UCLA, and he can be reached via email at rse@math.ucla.edu .

Adrian Sampsonمشاهده پروفایل

دانشیار

• Computer Architecture
• Programming Languages
• Hardware-Software Co-Design
• +۴ مورد دیگر

Adrian Sampson is an Associate Professor in the Department of Computer Science at Cornell University, where he is part of the Computer Systems Laboratory and the Programming Languages Group. He leads the Capra research group, focusing on programming languages, computer architecture, and hardware-software co-design. Previously, he was an Assistant Professor at Cornell (2016–2022) and a researcher at Microsoft and Google. Education: Ph.D. in Computer Science and Engineering from the University of Washington (2015), advised by Luis Ceze and Dan Grossman. Dissertation: Hardware and Software for Approximate Computing . B.S. in Computer Science from Harvey Mudd College (2009). Research interests include approximate computing, compiler optimization, hardware accelerators, and formal methods in systems programming. His work on Geometry Types and Reticle has advanced abstractions for graphics programming and FPGA design. Sampson is known for contributions to compiler infrastructure for accelerators, such as the Timeline Types framework for predictable hardware design. Awards include the Cornell Bowers CIS Research Excellence Award (2024), IEEE TCCA Young Computer Architect Award (2021), NSF CAREER Award (2019), and the Google Ph.D. Fellowship in Computer Architecture (2013–2015). He has advised over 30 graduate and undergraduate students, contributing to projects like compiler-driven accelerator simulation and vectorization techniques. Teaching includes courses on compilers, programming languages, and computer architecture at Cornell. He has served on program committees for major conferences (ASPLOS, PLDI, ISCA) and chairs roles in ISCA and ASPLOS. Sampson’s research is supported by grants from NSF, Google, and industry partnerships.

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

استادیار

• Theoretical Computer Science
• Automata Theory
• Formal Methods
• +۷ مورد دیگر

Sven Dziadek is an Assistant Professor (Maître de Conférence) at Telecom SudParis, affiliated with the ACMES team within the SAMOVAR research laboratory. His primary research focuses on theoretical computer science, particularly weighted automata, formal methods, and infinite-word languages. He has held postdoctoral positions at Inria Paris (VALDA team) and LRE at EPITA, and completed his PhD under Manfred Droste and Werner Kuich at Universität Leipzig, funded by the DFG QuantLA research training group. His research interests include automata theory, program verification, energy problems, and recently enumeration algorithms and homotopy type theory. He has published extensively in venues such as Formal Aspects of Computing, Information and Computation, and the International Symposium on Formal Methods (FM). Current affiliations include teaching and research at Télécom SudParis, with offices at 19 place Marguerite Perey in Palaiseau. No specific grants or awards are explicitly mentioned in the provided materials.

Antoine Tilloyمشاهده پروفایل

استادیار

• Quantum Mechanics
• Quantum Field Theory
• Tensor Networks
• +۷ مورد دیگر

Antoine Tilloy is an Assistant Professor at the Centre Automatique et Systèmes, Mines ParisTech, part of Paris Sciences et Lettres (PSL). He is also affiliated with the Quantic research team at Inria, reflecting his dual academic and research institute role. His work bridges theoretical physics, quantum information, and nuclear engineering, with a focus on tensor networks and quantum field theory. Research Interests: Quantum Field Theory (non-perturbative methods) Tensor Networks for many-body quantum systems Quantum Foundations and Measurement Theory Semiclassical and Quantum Gravity Nuclear Engineering and Fuel Cycle Physics His recent research has explored the application of tensor networks to solve quantum field theories, the philosophical and technical challenges in defining QFT rigorously, and the physics of nuclear fuel recycling. He advocates for a 'pile of dirt' approach—tackling messy, realistic models over highly structured but artificial ones. Scientific Contributions: Active contributor to non-perturbative QFT methods ERC-funded research and postdoctoral supervision Public engagement through blog posts and science communication Advising and Grants: While specific students are not listed, he leads an ERC-funded project and has advertised postdoctoral positions, indicating active mentorship. His research is supported by competitive European funding, underscoring its significance in the field. Labs and Teams: He is a member of the Quantic team at Inria, a leading research group in quantum information and technologies, and conducts his work at the Centre Automatique et Systèmes at Mines ParisTech.

• Representation Theory
• Algebra
• Quiver Representations
• +۵ مورد دیگر

Bernt Tore Jensen is an Associate Professor in the Department of Mathematical Sciences at the Norwegian University of Science and Technology (NTNU), based at the Gjøvik campus. He is actively involved in research and teaching within mathematics, particularly in algebra and representation theory. Research Interests: His work focuses on advanced topics in algebra, including representation theory of quivers, Lie algebras, cluster algebras, Hecke algebras, and A-infinity structures. He investigates geometric realizations of algebraic objects and structural properties of modules and categories. The publication trends show a sustained focus on algebraic structures and their representations over the past decade, with frequent collaborations with researchers such as Xiuping Su, Alastair King, and Dag Oskar Madsen. His work appears in prestigious journals like Advances in Mathematics , Journal of Algebra , and Transactions of the American Mathematical Society , reflecting high-quality theoretical contributions. Teaching Responsibilities: He teaches a range of engineering mathematics courses, including Matematikk for ingeniørfag and Matematiske metoder , indicating a strong commitment to applied mathematical education. Collaborations and Advising: While formal student advisees are not listed, his extensive co-authorships suggest active research collaboration. There is no mention of grants or awards in the provided text, but his publication record implies recognition within the mathematical community. Laboratories and Research Groups: Though specific labs or teams are not mentioned, his research is likely conducted within the algebra and representation theory group at NTNU's Department of Mathematical Sciences.

Lionel Parreauxمشاهده پروفایل

استادیار

• Programming Languages
• Type Systems
• Compiler Optimization
• +۳ مورد دیگر

Lionel Parreaux is an Assistant Professor at the Hong Kong University of Science and Technology (HKUST) in the Department of Computer Science and Engineering since February 2021. He obtained his PhD in Computer Science from the Swiss Federal Institute of Technology, Lausanne (EPFL) in 2020, where he developed the Squid type-safe metaprogramming library for Scala. Research Interests: His work spans programming languages, type systems, functional programming, generative programming, language design, and compiler optimizations. He focuses on improving program correctness and performance through advanced type theory and compilation techniques. Publications: His recent articles concentrate on type inference methodologies, compiler optimizations (especially for functional programs), metaprogramming, and formal verification of language features. Key themes include constraint-based type systems, deforestation techniques, polymorphic subtyping, and error message improvements. Research Group: He leads a team of 8 PhD students and 1 MPhil student, with 2 MPhil students graduated in 2024. Actively recruits students for projects in programming languages and compilers. Projects: A Lightweight Type System for Scope and Effect Safety (Huawei-funded, 2024–) Optimizing Functional Programs via Graph Reduction (RGC Early Career Scheme, 2022–2025)

Dirk Hachenbergerمشاهده پروفایل

دانشیار

• Discrete Mathematics
• Finite Fields
• Coding Theory
• +۶ مورد دیگر

Prof. Dr. Dirk Hachenberger is an Associate Professor of Mathematics for Computer Scientists at the University of Augsburg, Germany. He is affiliated with the Faculty of Mathematics, Natural Sciences and Technology, specifically within the Institute of Mathematics where he works in the Chair of Discrete Mathematics, Optimization and Operations Research. His academic work focuses on theoretical and applied aspects of discrete structures, with particular emphasis on finite fields and their applications in coding theory and cryptography. Prof. Hachenberger's research interests span multiple areas of discrete mathematics, with a strong focus on finite fields , normal bases , and completely free elements . His work demonstrates deep connections between pure algebra and practical applications in information security. He has made significant contributions to understanding primitive elements in field extensions and developing theoretical frameworks for various algebraic structures used in cryptographic systems and error-correcting codes. Analysis of Prof. Hachenberger's publication record reveals a consistent focus on algebraic structures with applications in information theory. His work shows a progression from foundational theoretical research on normal bases to more applied studies on coding theory, demonstrating both mathematical depth and practical relevance. The recurring themes in his research include primitive elements, field extensions, and algebraic structures with cryptographic applications. Among his notable recognitions is the Prize for Good Teaching awarded by the Bavarian State Minister for Science, Research and the Arts in 2004, highlighting his excellence in academic instruction. Prof. Hachenberger has supervised numerous graduate students, with thesis records spanning from 2006 to 2022. His supervision covers both theoretical mathematical investigations and applied business mathematics problems, reflecting the interdisciplinary nature of his work. He has also authored influential textbooks including "Mathematik für Informatiker" (2005, 2008) and "Topics in Galois Fields" (2020), which have significantly contributed to mathematical education for computer scientists.

• Nonlinear Analysis
• Degree Theory
• Morse Theory
• +۴ مورد دیگر

Professor Norman Dancer is a distinguished academic in the Department of Mathematics at the University of Sydney, Faculty of Science. His research has significantly contributed to the field of nonlinear analysis and partial differential equations over several decades. He maintains an active research profile with publications extending to 2022. Professor Dancer's research focuses on Nonlinear Analysis , with particular expertise in degree theory, Morse theory, and Conley index. His work explores applications to nonlinear ordinary and partial differential equations, including singular perturbations and bifurcation theory. He is a member of the Nonlinear Analysis Research Group at the University of Sydney and serves on the Editorial Advisory Board of a mathematics book publishing program focused on Central and Eastern Europe, launched jointly by de Gruyter and Versita. Analysis of Professor Dancer's recent publications reveals a consistent focus on elliptic equations, stability analysis, and nonlinear phenomena. His work frequently addresses problems related to the Gross-Pitaevskii system, Liouville-type results, and solutions with specific properties like stability or finite Morse index. His research demonstrates sophisticated mathematical techniques applied to challenging problems in nonlinear analysis. Professor Dancer has secured significant research funding through multiple Australian Research Council Discovery Projects. His collaborative work, particularly with S. Yan and Y. Du, has focused on nonlinear partial differential equations, bubbles, layers, stability, and related topics. His research program has maintained remarkable consistency and productivity over many years, addressing fundamental questions in nonlinear analysis and partial differential equations. Professor Dancer is affiliated with the Nonlinear Analysis Research Group at the University of Sydney, where he contributes to the vibrant research environment in mathematical analysis. His work connects with broader mathematical physics applications, particularly in understanding phenomena related to Bose-Einstein condensates through the Gross-Pitaevskii equations.

• Computational Geometry
• Discrete Geometry
• Combinatorial Geometry
• +۷ مورد دیگر

Clemens Huemer is a professor affiliated with the Department of Mathematics at the Escola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels (EETAC), part of the Universitat Politècnica de Catalunya (UPC). He is a key member of the DCCG (Discrete, Combinational, and Computational Geometry) research group, where he contributes extensively to theoretical and applied geometric research. His work spans computational, discrete, and combinatorial geometry with strong ties to graph theory and combinatorics. His primary research interests include computational geometry, discrete and combinatorial geometry, Voronoi diagrams (especially higher-order variants), geometric graphs, point set configurations, and algorithmic geometry. He investigates structural properties of geometric objects, combinatorial configurations, and optimization problems in discrete settings. His recent publications emphasize Voronoi constructions, matching problems in colored point sets, spectral properties of token graphs, and production matrices for enumerating geometric graphs. The trends in his recent articles (2021–2024) reflect a deep focus on higher-order Voronoi diagrams, geometric matching, and combinatorial properties of point sets and graphs. His work combines theoretical depth with algorithmic insights, often involving polynomial representations, spectral analysis, and geometric enumeration. The recurring themes include structural analysis of geometric arrangements, extremal problems in point sets, and algebraic-combinatorial methods in geometry. Clemens Huemer has been involved in multiple competitive R&D projects, including those funded under the Spanish State Research Plans and Horizon 2020, often in collaboration with leading researchers in computational geometry. He has served on scientific committees of conferences such as the Workshop on Geometric Networks and the Intensive Research Program on Discrete, Combinatorial and Computational Geometry, indicating leadership in the academic community. He advises and collaborates with numerous researchers and students, though specific advisees are not listed in the provided data. His research is supported through national and European grants, and he actively contributes to the dissemination of results via conference presentations and journal publications in top venues such as Discrete and Computational Geometry , Computational Geometry: Theory and Applications , and European Workshop on Computational Geometry . Clemens Huemer is based at the Baix Llobregat campus of UPC and is deeply embedded in the UPC research network, with extensive collaborations across institutions in Spain and internationally. His work is central to the DCCG group’s efforts in advancing the theoretical foundations of discrete and computational geometry.

Misha Lyubichمشاهده پروفایل

استاد

• Analytic Low-Dimensional Dynamics
• Complex Dynamics
• Real Dynamics
• +۱۲ مورد دیگر

Misha Lyubich is a Professor of Mathematics at Stony Brook University where he also serves as the Director of the Institute for Mathematical Sciences. His academic career has been dedicated to advancing the field of dynamical systems with particular focus on low-dimensional dynamics. Lyubich's research interests center around Analytic Low-Dimensional Dynamics, encompassing both complex and real dynamics. His work spans multiple interconnected areas including renormalization theory, Julia sets, Mandelbrot set theory, Schwarz reflections, rational maps, Kleinian groups, and Henon maps. His approach combines deep theoretical insights with connections to mathematical physics through studies of the Ising model. The breadth of his research is evident in his extensive publication record that spans over four decades, with recent work published as recently as 2024. The analysis of Lyubich's recent publications reveals consistent focus on the geometric and measure-theoretic aspects of dynamical systems. His work frequently examines the structure of fractal sets arising in dynamics, renormalization phenomena, and the interplay between complex analysis and dynamical behavior. Many papers demonstrate collaborative work with leading mathematicians including Artur Avila, Sergei Merenkov, and Sabyasachi Mukherjee. Major Awards: While specific awards aren't detailed in the provided information, his biographical sketch suggests recognition within the mathematical community Professional Service: As Director of the Institute for Mathematical Sciences at Stony Brook, he leads a significant research center Collaborations: Extensive collaborations with prominent mathematicians worldwide Lyubich maintains an active research program with recent contributions to understanding the measure-theoretic properties of dynamical systems, structural properties of polynomial automorphisms, and connections between different areas of complex dynamics. His work continues to influence both theoretical developments and applications in related fields.

Emanuele D'Osualdoمشاهده پروفایل

استاد

• Programming Languages
• Verification
• Security
• +۸ مورد دیگر

Emanuele D'Osualdo is a Tenure-Track Professor of Formal Methods for Software Engineering at the University of Konstanz, Department of Computer and Information Science. Previously, he was a Postdoctoral Researcher at Max Planck Institute for Software Systems (MPI-SWS) in Saarbrücken until April 2024, working with Derek Dreyer on verification of concurrent software. Before that, until September 2020, he was a Marie Curie Fellow at Imperial College London, working with Prof. P. Gardner. From 2015 to 2017, he was a PostDoc in the Concurrency Theory Group at the University of Kaiserslautern, working with Prof. Roland Meyer. His educational background includes: PhD (DPhil) in Computer Science from the University of Oxford (2015), supervised by Prof. C.-H. Luke Ong Undergraduate and master's studies at the University of Udine, Italy, graduating with honors and supported by the Scuola Superiore scholarship Emanuele D'Osualdo's research focuses on Formal Methods for the verification of software, with particular emphasis on two main approaches: automatic verification methods using static analysis and infinite-state model checking; and compositional methods, focusing on program logics for properties beyond safety. His work spans several areas including Programming Languages, Verification, Security, Concurrency Theory, Probabilistic Programs, Types, Static Analysis, Process Algebra, and Model Checking. His research has led to the development of tools such as Soter for automatic safety verification of Erlang programs and James Bound for analyzing π-calculus. His recent publications demonstrate a strong focus on advanced verification techniques for concurrent and distributed systems, with particular attention to linearizability, session types, security protocols, and probabilistic reasoning. His work bridges theoretical foundations with practical applications in software verification, showing a progression from foundational work on π-calculus to more applied verification of concurrent data structures and probabilistic systems. He has received notable recognition for his work, including: Winner of the 2016 CPHC/BCS Distinguished Dissertation award Marie Curie Fellow Emanuele actively supervises students and leads research in formal methods. He is involved in several research projects related to software verification and has presented his work at top-tier conferences including POPL, OOPSLA, ESOP, and CAV. He is scheduled to give a keynote at HYPER'25 in Zagreb and will be attending POPL'25. His research group appears to focus on developing theoretically sound yet practical verification techniques for modern concurrent and distributed software systems.

Michael Vogeliusمشاهده پروفایل

استاد

• Partial Differential Equations
• Numerical Analysis
• Mathematical Analysis
• +۴ مورد دیگر

Michael Vogelius serves as Board of Governors Professor in the Department of Mathematics at Rutgers University, New Brunswick. He joined the faculty in 1989 after seven years at the University of Maryland, College Park, and has held visiting appointments at Stanford University, École Polytechnique Fédérale de Lausanne, and the University of Copenhagen. His current teaching includes Math 550: Linear Algebra and Applications, and he maintains active research leadership in mathematical analysis. Education: PhD from University of Maryland under advisor Ivo Babuška Postdoctoral training at New York University with George Papanicolaou Research Interests: Professor Vogelius specializes in Partial Differential Equations and Numerical Analysis, with core contributions to blow-up phenomena in nonlinear boundary conditions, scattering effects of small inhomogeneities, metamaterials theory, and non-scattering wave characterization. His work bridges rigorous mathematical analysis with applications in electromagnetic imaging, cloaking technologies, and inverse problems. Recent projects emphasize finiteness of non-scattering wave numbers, crack reconstruction via energy methods, and asymptotic models for thin inhomogeneities in conductive media. Publication Trends: His 2020-2025 publications demonstrate sustained focus on inverse problems and wave scattering in complex media. Key patterns include developing rigorous frameworks for crack reconstruction in Calderón's problem, establishing finiteness results for non-scattering phenomena, and advancing cloaking techniques for broadband and anisotropic settings. These works consistently employ sophisticated asymptotic analysis and error estimation for thin or small-scale defects, reflecting his expertise in connecting theoretical PDE analysis with practical electromagnetic applications. Collaborations and Funding: Vogelius maintains extensive collaborations including Robert V. Kohn (10 publications, 1984-2010), Fadil Santosa (9 publications, 1990-2000), and recent partnerships with Henrik Garde and Matti Lassas (2024). His research is supported by the National Science Foundation through the Division of Mathematical Sciences (DMS), as evidenced by his participation in DMS updates and conference organization. The Mathematics Department website references student advisement and postdoc mentorship, though specific trainee names aren't detailed in the provided text.

Paula Federicoمشاهده پروفایل

استاد

• Mathematical Ecology
• Computational Ecology
• Population Dynamics
• +۳ مورد دیگر

Paula Federico serves as a Professor in the Department of Mathematics, Computer Science & Physics at Capital University, where she has been a faculty member since 2009 following postdoctoral positions at the University of Tennessee Knoxville and Ohio State University's Mathematical Biosciences Institute. Her teaching responsibilities include Calculus I, Calculus III, Differential Equations, Introduction to Computational Sciences, and Linear Algebra. Her academic credentials include: Ph.D. in Ecology and Evolutionary Biology from the University of Tennessee Graduate Certificate in Applied Statistics from the University of Tennessee B.Sc. in Mathematics from Universidad Nacional del Centro de la Provincia de Buenos Aires, Argentina Dr. Federico's research program centers on mathematical and computational ecology, with specific applications to population dynamics, natural resource conservation, epidemic/epizootic modeling, and animal movement behavior. She emphasizes mathematics' relevance across disciplines and seeks to reveal its inherent beauty to students, particularly mathematics majors. Analysis of her publication record reveals consistent focus on developing mathematical frameworks for ecological challenges, especially in spatio-temporal population modeling, habitat quality assessment for mobile species, and migratory network dynamics. These works typically involve large interdisciplinary collaborations addressing conservation biology and wildlife management. No scientific awards are documented in the provided materials. Information regarding graduate student advising, research grants, laboratory facilities, or administrative roles was not included in the source text.

• Mathematics Education
• Example-Based Learning
• Conjecture Development
• +۳ مورد دیگر

Alison Lynch is an Associate Professor in the Department of Mathematics & Statistics at California State University, Monterey Bay . Her research bridges mathematics education and abstract algebra, focusing on example-based learning, conjecture development, and quantum group representations. Role: Associate Professor University: California State University, Monterey Bay School: College of Science Department: Mathematics & Statistics Her work in mathematics education examines how mathematicians and students use examples during conjecturing and proving, with recent studies on precalculus curriculum redesigns and counterexample understanding. Earlier publications delve into algebraic structures like Cauchy pairs and Uq(sl2)-modules. Alison's research spans both pedagogical frameworks and pure algebraic theory, though specific awards, grants, or student advisement details are not publicly available in the provided texts.

Sarasij Maitraمشاهده پروفایل

استادیار مهمان

• Commutative Algebra
• Machine Learning
• Data Science
• +۳ مورد دیگر

Sarasij Maitra is a Visiting Assistant Professor of Mathematics and Statistics at Haverford College. Previously, he was a Postdoctoral Researcher/Lecturer in Mathematics at the University of Utah. He earned his PhD from the Department of Mathematics at the University of Virginia under the guidance of Professor Craig Huneke. Dr. Maitra completed his bachelor's and master's degrees at Indian Statistical Institute Bangalore and Indian Statistical Institute Kolkata, respectively. His research primarily focuses on Commutative Algebra, specifically studying Noetherian commutative local rings and the structure theory of modules over such rings. He investigates concepts such as torsion, reflexivity, and Ulrichness of modules using tools like local cohomology, Hilbert-Samuel Multiplicity, numerical semi-group rings, and Frobenius numbers (related to the Chicken McNugget Problem!). Dr. Maitra has developed a strong research portfolio examining Berger's Conjecture, trace ideals, and the module of differentials. His work shows a consistent pattern of collaboration with researchers like Vivek Mukundan, Craig Huneke, and others, demonstrating expertise in both theoretical aspects of commutative algebra and computational approaches using Macaulay2. His recent publications indicate a growing interest in applying algebraic methods to data science and machine learning. All University Graduate Teaching Award (University of Virginia) Postdoc Teaching Award (University of Utah) Dr. Maitra actively mentors undergraduate students, currently supervising senior theses at Haverford College in Commutative Algebra, Cryptography, and Deep Learning. He has taught a wide range of undergraduate mathematics courses including Multivariable Calculus, Real Analysis, Linear Algebra, and specialized topics like Commutative Algebra. He has also contributed to the mathematical community through software development for Macaulay2, including the RandomRationalPoints and SwitchingFields packages.