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

Betsy Stovallمشاهده پروفایل

استاد

• Harmonic Analysis
• Fourier Analysis
• Partial Differential Equations
• +۲ مورد دیگر

Betsy Stovall is a Professor of Mathematics at the University of Wisconsin–Madison and holds the Letters and Science Mary Herman Rubenstein Professor chair. She serves as the AMS Associate Secretary for the Central Section . Education : Not explicitly stated in provided text. Appointments : Regular faculty at UW–Madison since at least 2012 Organizer of graduate analysis seminars Research Interests : Stovall specializes in harmonic analysis , focusing on operators involving curvature, oscillatory integrals, and Fourier restriction phenomena. Her work intersects with partial differential equations (PDEs) through the study of dispersive equations and geometric analysis problems. Teaching : Complex Analysis (Math 623) - Fall 2021 Calculus III (Math 234) - Fall 2020 Graduate Analysis Seminar - Spring 2022 Organized UW Madison undergraduate summer school in Analysis (2018) Scientific Contributions : Sole or joint author of 15+ publications NSF RTG grant in Analysis and PDE Active in harmonic analysis seminars and educational initiatives Administrative Roles : AMS Associate Secretary Co-organizer of RTG/Student seminars Summer school director

• Cryptography
• Computational Number Theory
• Computer Algebra
• +۳ مورد دیگر

Damien Stehlé is a Professor at the École Normale Supérieure de Lyon (ENS Lyon), affiliated with the Laboratoire LIP (CNRS, ENSL, INRIA, UCBL, U. Lyon) and a member of the AriC team. He is also a member of the Institut Universitaire de France. His research focuses on cryptography, computational number theory, and computer algebra, particularly lattice-based cryptography and its applications in post-quantum security. He has held editorial roles at the Journal of Cryptology and Designs, Codes and Cryptography, and served on committees for major conferences like ASIACRYPT and CRYPTO. His work has led to advancements in lattice reduction algorithms, cryptographic protocols (e.g., signatures, encryption schemes), and security proofs in the quantum random oracle model. Stehlé has supervised numerous PhD students, including Alice Pellet-Mary and Miruna Rosca, and has contributed to open-source lattice reduction software like fplll. His awards include Best Paper Awards at ASIACRYPT 2021 and 2015. He teaches advanced courses on post-quantum cryptography and cryptanalysis at the Master’s level.

Rajesh Pereiraمشاهده پروفایل

دانشیار

• Matrix Theory
• Quantum Information
• Functional Analysis
• +۲ مورد دیگر

Rajesh Pereira is an Associate Professor and Chair of the Department of Mathematics at the University of Guelph. His research focuses on matrix theory, quantum information, functional analysis, and classical analysis, with significant contributions to problems in polynomial theory and quantum entanglement. Education: B.Sc. in Applied Mathematics, McGill University (1996) M.Sc. in Mathematics, McGill University (1998) Ph.D. in Mathematics, University of Toronto (2003) Rajesh Pereira's research in matrix theory includes work on diagonal matrix scalings, doubly stochastic matrices (solving the Perfect-Mirsky conjecture for n=4), and extending Wielandt's theorem to Banach algebras. In quantum information , he investigates quantum fidelity, entanglement, coherence, and privacy, utilizing tools such as completely positive linear maps and majorization. His early work resolved several conjectures in the analytic theory of polynomials. He has successfully supervised several graduate students, including: George Hutchinson (Ph.D., 2018) Connor Paul-Paddock (M.Sc., 2016) Jeremy Levick (Ph.D., 2015) Preeti Mohindru (Ph.D., 2014) Jeffrey Tsang (Ph.D., 2014) Dustin Styner (M.Sc., 2012) His research has been supported by Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grants (2005, 2010, 2016). He serves on the editorial board of Linear and Multilinear Algebra (2016-present) and is the Problem Corner editor for IMAGE, the newsletter of the International Linear Algebra Society (2016-present). Additionally, he has organized the William Lowell Putnam competition since 2013.

Carlos Palazuelos Cabezónمشاهده پروفایل

استاد

• Functional Analysis
• Quantum Information Theory
• Operator Spaces
• +۷ مورد دیگر

Carlos Palazuelos Cabezón is a Professor in the Department of Mathematical Analysis and Applied Mathematics at the Faculty of Mathematical Sciences, Universidad Complutense de Madrid (UCM), with a joint affiliation at the Instituto de Ciencias Matemáticas (ICMAT). He holds a Ramón y Cajal contract and has been a Full Professor since 2024, following his role as Associate Professor from 2019 to 2024. His work bridges deep mathematical theory and quantum information science. Research Interests: His primary research lies at the intersection of functional analysis and quantum information theory. He investigates operator spaces and their applications to quantum entanglement, Bell inequalities, quantum channels, and nonlocal games. A second major line involves noncommutative harmonic analysis, particularly hypercontractivity in von Neumann algebras. His work is highly theoretical and appears in top mathematical and physics journals. Publication Trends: His recent publications demonstrate a consistent focus on the mathematical foundations of quantum information, particularly using tools from operator space theory and Banach space geometry to analyze quantum nonlocality, entanglement, and computational models. There is a strong trend toward solving foundational problems in quantum theory using advanced functional analysis. Scientific Awards: Premio Extraordinario de Doctorado (2008/2009) Doctorado Europeo Advising and Grants: While no specific students are listed, he is part of the MathQI research group and has likely mentored graduate students. He has been supported by prestigious postdoctoral and permanent research contracts in Spain, including the Juan de la Cierva and Ramón y Cajal programs, which are highly competitive grants for early-career and established researchers, respectively. Labs and Teams: He is a member of the MathQI research group (Mathematical Quantum Information) at UCM and is affiliated with ICMAT, a leading mathematics research institute in Spain. These affiliations provide a collaborative environment for interdisciplinary research in mathematical physics and quantum information.

Brian Streetمشاهده پروفایل

استاد

• Mathematics
• Partial Differential Equations
• Singular Integrals
• +۷ مورد دیگر

Brian Street is a Professor in the Department of Mathematics at the University of Wisconsin-Madison . He specializes in partial differential equations, harmonic analysis, and geometric analysis, with a focus on subelliptic and multi-parameter singular integral theories. His work extends classical results like the Newlander-Nirenberg theorem and Frobenius theorem to quantitative and boundary settings. Research Highlights: Development of maximal subellipticity theory (2023), generalization of Calderón-Zygmund singular integrals to multi-parameter settings (2011–2013), and novel approaches to hypoelliptic and mixing flow problems. Publications: Authored a monograph on Multi-parameter Singular Integrals (Princeton University Press, 2012) and co-authored influential papers with leading mathematicians in functional analysis and PDEs. Methodologies: Employed techniques from ODEs, PDEs, and harmonic analysis, including wave equation propagation, non-isotropic Sobolev spaces, and diffeomorphism-invariant frameworks.

Ram Mohapatraمشاهده پروفایل

استاد

• Mathematical Analysis
• Operator Theory
• Variational Inequalities
• +۳ مورد دیگر

Ram Mohapatra is a Professor in the Department of Mathematics at the University of Central Florida (UCF), part of the College of Sciences. His research interests span mathematical analysis, operator theory, variational inequalities, approximation theory, cybersecurity, and fluid dynamics. He has published extensively on topics including inverse scattering problems, generalized inverses, and optimal control theory. His work often intersects with applications in engineering and data science. Recent research focuses on operator theory applications, tensor decompositions, and mathematical modeling of physical systems. He has contributed to advancements in frame theory, numerical radius studies, and cybersecurity methodologies. His academic activities include teaching undergraduate and graduate courses in mathematics, such as MAC 1105C and MAC 2311C, and maintaining active collaborations in interdisciplinary research areas. Professional contributions include over 150 peer-reviewed articles and editorial roles in mathematics journals. While no explicit awards are listed in the provided texts, his prolific publication record underscores his scholarly impact in applied and theoretical mathematics.

• Group Theory
• Algebra
• Coding Theory
• +۳ مورد دیگر

Mima Stanojkovski is an Assistant Professor at the Department of Mathematics, University of Trento. Her research focuses on group theory, algebra, and their applications in coding theory and cryptography. She teaches courses such as Algebra B, Statistics for Data Science, and Teoria dei Gruppi, emphasizing foundational concepts in abstract algebra and their practical implications. Teaching Responsibilities: Algebra B (Department of Mathematics) Statistics for Data Science (Department of Sociology and Social Research) Teoria dei Gruppi (Department of Mathematics) Research Interests: Mima's work centers on geometric and combinatorial aspects of finite groups, modular group algebras, and cryptographic applications of algebraic structures. She explores topics such as independence complexes, rank-metric codes, and pro-p group constructions. Her recent publications address conjectures in coding theory and security analyses of homomorphic encryption schemes. Grants & Collaborations: No grants or collaborative projects explicitly listed in the provided text. Labs/Teams: No specific lab affiliations or research teams mentioned.

• Cryptography
• Lattice-based cryptography
• Post-quantum cryptography
• +۳ مورد دیگر

Professor Damien Stehlé is a faculty member at École Normale Supérieure de Lyon (ENS Lyon), where he is part of the AriC team within the Laboratoire de l'Informatique du Parallélisme (LIP). He is also a distinguished member of the Institut Universitaire de France. His research and teaching activities focus on cryptography, computational number theory, and computer algebra, with particular emphasis on lattice-based cryptographic systems. Stehlé's research primarily centers on the computational aspects of Euclidean lattices and their applications in cryptography. He has made significant contributions to lattice-based cryptography, particularly in the context of post-quantum cryptography. His work addresses fundamental questions about the hardness of lattice problems, algorithmic improvements for lattice reduction, and the development of practical cryptographic schemes based on lattice assumptions. He has been actively involved in the NIST post-quantum cryptography standardization process, contributing to the analysis of lattice-based candidates like Kyber and Saber. His publications span theoretical foundations to practical implementations, demonstrating a rare ability to bridge abstract mathematics with real-world cryptographic applications. Throughout his career, Stehlé has published extensively in top-tier cryptography and theoretical computer science venues. His research has been recognized with multiple best paper awards for groundbreaking contributions to the field. Best paper award at ASIACRYPT 2021 for 'On the hardness of the NTRU problem' Best paper award at ASIACRYPT 2015 for 'Improved security proofs in lattice-based cryptography' Best paper award at EUROCRYPT 2015 for 'Cryptanalysis of the Multilinear Map over the Integers' Professor Stehlé has supervised numerous PhD students over the years, often collaborating with other leading researchers in the field. He serves on program committees of major cryptography conferences and is a member of editorial boards for prestigious journals including the Journal of Cryptology and Designs, Codes and Cryptography. His research group at LIP's AriC team is recognized as a leading center for lattice-based cryptography research in Europe.

Chris Kapulkinمشاهده پروفایل

دانشیار

• Homotopy Theory
• Higher Category Theory
• Combinatorics
• +۴ مورد دیگر

Chris Kapulkin is an Associate Professor in the Department of Mathematics at the University of Western Ontario. His research focuses on Homotopy Theory, Higher Category Theory, Combinatorics, and Formalization of Mathematics using Homotopy Type Theory, with applications to Cryptography. He is a member of the Canadian Journal editorial boards and serves on scientific advisory boards such as Banff International Research Station. He has organized numerous conferences and workshops, including the Mathematical Congress of the Americas (2025) and HoTTEST Summer School (2022). Kapulkin actively supervises PhD and Master's students, postdocs, and undergraduate researchers, contributing to over 20 academic publications since 2011. His awards include the Coxeter-James Prize (2025) and Florence Bucke Science Prize (2024). He leads the Western Cryptography Research Group and co-founded the HoTT Electronic Seminar Talks, fostering interdisciplinary collaboration in category theory and type theory. Research Interests: Kapulkin’s work bridges abstract mathematics and foundational computer science. He explores synthetic approaches to homotopy theory, categorical structures in discrete mathematics, and the formalization of mathematical proofs using type theory. His cryptographic research applies algebraic methods to secure integer comparisons and multilinear maps. Notable contributions include contributions to the Homotopy Type Theory Book (2013) and foundational papers on simplicial models of univalence (2021). Grants & Funding: Holder of the Distiguished Research Professorship (2022-23), recipient of C$20,000 interdisciplinary funding (2016-17) for cryptographic research, and a member of the Mathematical Sciences Research Institute (2022-23). His work has been supported through multiple conference organization grants and academic fellowships. Labs/Teams: Faculty mentor of the Western Cryptography Research Group and co-founder of the HoTTEST seminar series. Active in organizing the Directed Reading Program and Geometry/Topology Seminar at Western University.

• Number Theory
• Cryptography
• Finite Fields
• +۴ مورد دیگر

Professor Igor Shparlinski is a faculty member at the University of New South Wales (UNSW) within the School of Mathematics & Statistics, holding the rank of Professor with an active research profile as evidenced by publications dated 2025. His work bridges pure number theory and cryptographic applications, maintaining international collaborations with institutions like the University of Sydney and Max Planck Institute. Research interests include: Analytic number theory (exponential/character sums) Cryptographic security (Diffie-Hellman, RSA, and pseudorandom generators) Finite field arithmetic and polynomial dynamics Arithmetic combinatorics and additive number theory Distribution of primes/smooth numbers modulo p Elliptic curve structures over finite fields His publications consistently address foundational problems with computational implications, particularly focusing on sum bounds and modular arithmetic. Recent trends (2023-2025) show intensified work on multilinear character sums, matrix statistics over finite fields, and dynamical system orbits. Key journals include Journal of Number Theory and Finite Fields and their Applications , with frequent co-authorship on exponential sum bounds and cryptographic vulnerabilities. Scientific awards: No awards, prizes, or fellowships are documented in the provided text. Advising and grants: No student listings or grant information appears in the source material. Research output suggests sustained funding but lacks explicit details.

Petteri Kaskiمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Algorithm Design
• Exact and Parameterized Algorithms
• +۵ مورد دیگر

Petteri Kaski is an Associate Professor at the Department of Computer Science, School of Science, Aalto University , and a member of the Helsinki Institute for Information Technology (HIIT) . His research focuses on theoretical computer science, particularly in algorithm design, exact and parameterized algorithms, algebraic algorithms, and combinatorics. Doctoral Degree in Engineering and Technology, Helsinki University of Technology (2005) Licentiate Degree in Engineering and Technology, Helsinki University of Technology (2002) Master's Degree in Engineering and Technology, Helsinki University of Technology (2001) His recent work explores tensor scaling, Johnson-Lindenstrauss transforms, Hamiltonian cycles, and computational complexity, with contributions to polynomial-time algorithms, finite field computations, and combinatorial optimization. Notable awards include the Best Paper Award at ICALP 2017 , an ERC Starting Grant (2014) , and the Kirkman Medal (2007) . He has served on scientific committees for conferences like STACS 2025 and ICALP 2024 , and collaborated with institutions such as the IT University of Copenhagen and Universität Regensburg . Key Research Areas : Theoretical Computer Science, Algorithm Design, Exact Algorithms, Algebraic Computation, Graph Theory, Combinatorics

• Functional Analysis
• Operator Theory
• Holomorphic Functions
• +۶ مورد دیگر

Maria Pilar Rueda Segado is a Professor in the Department of Mathematical Analysis at the Faculty of Mathematics, University of Valencia. She is a leading researcher in functional analysis and operator theory, with a focus on holomorphic functions, polynomials, and multilinear operators in infinite-dimensional spaces. Her work is closely associated with the ESALDI research group. Her research interests lie primarily in Functional Analysis, particularly in the areas of: Weighted spaces of holomorphic functions Summing and dominated multilinear operators and polynomials Isometries in function spaces Factorization of operators and polynomials Spaceability and norm-attaining mappings Tensor norms and operator ideals Her extensive publication record, with over 90 works since 1996, reflects a deep and sustained engagement with core problems in nonlinear functional analysis. Her publications demonstrate a consistent focus on abstract operator theory, functional ideals, and the geometry of Banach spaces, often in collaboration with prominent mathematicians such as Daniel Pellegrino, Enrique Sánchez-Pérez, and Christopher Boyd. She earned her PhD from the University of Valencia in 1997 with a thesis on infinite-dimensional holomorphy under the supervision of Dr. Pablo Galindo Pastor. She has not received any explicitly mentioned scientific awards in the provided text. She has supervised PhD students, though their names are not listed in the provided content. Her research has been supported through institutional and collaborative academic grants, typical of senior faculty in mathematical sciences. She actively collaborates with an international network of researchers in functional analysis. She is a key member of the ESALDI (Spaces and Algebras of differentiable Functions) research group at the University of Valencia, which focuses on advanced topics in functional analysis and differentiable structures in infinite dimensions.

Mark A Iwenمشاهده پروفایل

دانشیار

• Computational Harmonic Analysis
• Mathematical Data Science
• Signal Processing
• +۴ مورد دیگر

Mark A Iwen is an Associate Professor at Michigan State University, holding dual appointments in the Department of Mathematics and the Department of Computational Mathematics, Science and Engineering (CMSE) . His research focuses on computational harmonic analysis, mathematical data science, signal processing, and algorithms for analyzing high-dimensional datasets. He has contributed to advancements in sparse Fourier transforms, compressive sensing, and sublinear-time algorithms for large-scale data. Key research themes include: Efficient algorithms for high-dimensional PDEs and spectral methods Phase retrieval and inverse problems in imaging Optimization of tensor decompositions and dimensionality reduction techniques Development of sparse approximation methods with theoretical guarantees His recent work emphasizes applications in: Sublinear-time algorithms for function approximation Terminal embeddings for manifold data Fast JL embeddings with bi-Lipschitz properties Tensor completion and low-rank approximations Notable contributions include: Development of Sparse Harmonic Transforms for functions of many variables Advancements in distributed SVD algorithms for large networks Empirical and theoretical analysis of phase retrieval techniques Efficient sparse FFT implementations (e.g., DMSFT, GFFT) Iwen collaborates on open-source code projects, including sparse FFT libraries and phase retrieval tools. His work bridges mathematical theory with practical applications in engineering and computational science.

• Linear Functional Analysis
• Nonlinear Functional Analysis
• Measure Theory
• +۶ مورد دیگر

Raffaela Giovanna CILIA is an Associate Professor of Mathematical Analysis at the Department of Mathematics and Computer Science, University of Catania. Her research primarily focuses on Linear and Nonlinear Functional Analysis, Measure Theory, and the geometry of Banach spaces, with specific emphasis on vector measures, tensor products, multilinear transformations, and differentiable mappings between Banach spaces. Contact information: Office at V.le A. Doria, 6 (Room 347), email cilia@dmi.unict.it , phone +39 095 7383056. Office hours: Wednesdays 14:30–16:30 and Thursdays 11:15–13:15 (or by appointment via email).

Rafael Oliveiraمشاهده پروفایل

استادیار

• Computational Complexity
• Algebraic Geometry
• Optimization Algorithms
• +۱ مورد دیگر

Rafael Oliveira is an Assistant Professor at the University of Waterloo's Cheriton School of Computer Science, conducting research from office DC 1313. His work explores fundamental connections between complexity theory, optimization, and geometry. Research spans: Algebraic complexity barriers Geometric combinatorics Efficient tensor algorithms Proof complexity frameworks His publications demonstrate consistent focus on mathematical foundations of computation , with recent advances in polynomial identity testing, interactive proofs, and geometric optimization. Article analysis shows recurring themes in algebraic complexity (40%), combinatorial geometry (30%), and optimization (30%).