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

• Number Theory
• Cryptography
• Analytic Number Theory
• +۵ مورد دیگر

Carl Pomerance is a Professor in the Department of Mathematics at Dartmouth College. His research spans various areas of number theory, including analytic number theory, cryptography, and computational methods. He is renowned for his work on prime numbers, pseudoprimes, and the distribution of arithmetic functions. Pomerance has authored or co-authored numerous influential books, including Prime Numbers: A Computational Perspective , and has edited volumes on cryptology and computational number theory. His research interests include the study of arithmetic functions, such as Euler's totient function and Carmichael's function, as well as topics in algebraic number theory, combinatorics, and algorithms. Pomerance has delivered invited talks at major conferences and institutions worldwide, focusing on themes like additive number theory, multiplicative functions, and the interplay between number theory and cryptography. Key contributions include advancements in primality testing algorithms (e.g., the quadratic sieve), the study of Carmichael numbers, and investigations into pseudoprimes and their distribution. He has also explored topics such as covering congruences, elliptic curves, and the properties of algebraic numbers.

Maya Jakobine Steinمشاهده پروفایل

استاد

• Graph Theory
• Combinatorics
• Extremal Graph Theory
• +۳ مورد دیگر

Maya Jakobine Stein is a Full Professor (Profesora Titular) at the Department of Mathematical Engineering and Deputy Director of the Center for Mathematical Modeling (CMM) at Universidad de Chile. She is also involved in leading international projects such as the STALGRAPH initiative, focusing on structural and algorithmic graph theory. Her research spans extremal graph theory, Ramsey theory, hypergraphs, and combinatorics. Her work includes significant contributions to the Loebl-Komlós-Sós conjecture and the Erdős-Sós conjecture, with a focus on tree embeddings, degree conditions, and structural properties of graphs. She has held editorial roles for journals like the Electronic Journal of Combinatorics and SIAM Journal on Discrete Mathematics. Additionally, she coordinates academic programs at the Department of Mathematical Engineering and has been actively involved in research grants, including leadership roles in ANID and EU Horizon 2020 projects. Her teaching spans advanced courses in graph theory, algebra, and combinatorics, and she advises numerous PhD and master’s students. Recent projects include launching the open-access journal Innovations in Graph Theory . Key collaborations involve Argentina, France, and Brazil through projects like MathAmSud and FAPESP-ANID. Her international service roles include Vice-Chair of the SIAM Activity Group in Discrete Mathematics and leadership in conferences like LATIN and Eurocomb.

Chee Yeow Mengمشاهده پروفایل

استاد

• Coding Theory
• Combinatorics
• Data Science
• +۳ مورد دیگر

Chee Yeow Meng is the Provost and Chief Academic & Innovation Officer at the Singapore University of Technology and Design (SUTD), effective April 2025. He holds a Professor rank and oversees curricular, research, and innovation affairs. Previously, he served as Vice President (Innovation and Enterprise) at NUS and held senior roles in academia and public service, including leadership positions at the National Computer Board and Infocomm Development Authority. His education includes a BMath (Hon) and MMath from the University of Waterloo (1988-1989), followed by a PhD in Computer Science (1996). His research focuses on combinatorics' intersection with computer science, particularly coding theory, extremal set systems, and AI applications. He has pioneered work in error-correcting codes, combinatorial cryptography, and data science. Prof Chee is an associate editor for IEEE Transactions on Information Theory and a Fellow of the Institute of Combinatorics and its Applications. His awards include the Public Administration Medal (Silver, 2018) and the Long Service Award (NTU, 2018). He has founded multiple startups and holds patents in coding technologies. His recent publications emphasize innovations in coding theory applications (e.g., domain wall memories, DNA storage) and machine learning for combinatorial optimization. He actively contributes to national committees and international forums on innovation policy and AI ethics.

Louis Esperetمشاهده پروفایل

پژوهشگر

• Graph Theory
• Combinatorial Optimization
• (Distributed) Algorithms
• +۷ مورد دیگر

Louis Esperet is a Senior CNRS Researcher at the G-SCOP Laboratory in Grenoble, France, affiliated with Université Grenoble Alpes since 2009. His research spans graph theory, combinatorial optimization, and interactions with mathematics and computer science. Education: Higher education in Paris, Lyon, and Bordeaux (2000-2005); Ph.D. in Computer Science (2005-2008) from University of Bordeaux under André Raspaud; Habilitation thesis (2017) from Université Grenoble Alpes. Research focuses on graph theory, with applications in combinatorial optimization, distributed algorithms, extremal combinatorics, property testing, communication complexity, geometric group theory, probability theory, discrete geometry, and topology. Current projects include asymptotic dimension of minor-closed families, clustered coloring, and adjacency labeling schemes. Recent publications address the Clustered Hadwiger Conjecture, sparse universal graphs for planarity, and optimal labelling schemes. Grants include ANR ENEDISC (2024-2028), ANR TWIN-WIDTH (2021-2025), and others. He co-organizes events like the Graphs and Complexity workshop and serves as managing editor for diamond open-access journals.

Mareike Dresslerمشاهده پروفایل

مدرس ارشد

• Real Algebraic Geometry
• Computational Algebraic Geometry
• Polynomial Optimization
• +۶ مورد دیگر

Mareike Dressler is a Senior Lecturer (A/Professor, tenured) and ARC Discovery Early Career Research Fellow at the School of Mathematics and Statistics, University of New South Wales (UNSW Sydney). She joined UNSW in February 2022 as a Lecturer (Assistant Professor, tenure-track) and was promoted to Senior Lecturer with tenure in July 2024. Her educational background includes: PhD in Mathematics from Goethe-Universität Frankfurt/Main (2018), supervised by Thorsten Theobald M.Sc. in Mathematics from Goethe-Universität Frankfurt/Main (2013) B.Sc. in Mathematics from Goethe-Universität Frankfurt/Main (2010) Mareike's research focuses on real and computational algebraic geometry and polynomial and convex optimization. She also works on problems intersecting with convex geometry, matrix and tensor computation, applied algebraic geometry, algebraic and geometric combinatorics, and real analysis. Her work particularly involves nonnegativity of polynomials, optimization methods, and ranks of matrices and tensors, with a special interest in sums of nonnegative circuits (SONCs) for sparse polynomials. Her research has strong applications in data science and machine learning. Mareike has received several prestigious awards including the ARC Discovery Project 2025 grant for "Quantifying Uncertainty of Risk-Aware Optimization for Safe Decision-Making," the J G Russell Award from the Australian Academy of Science, and the Early Career Impact Award from UNSW Science. She actively supervises research students, including PhD student Hongzhi Liao, Master's student Qi Wang, and recently supervised Moritz Schick to completion of his PhD in 2025. Mareike has secured significant research funding, including an ARC Discovery Early Career Researcher Award (DECRA) for 2024-2026. Mareike is an active member of the academic community, regularly organizing workshops and conferences such as "Optimization Days" at UNSW and minisymposia at major conferences like SIAM Conference on Applied Algebraic Geometry.

• Topology
• Geometry
• Group Theory
• +۳ مورد دیگر

Philippe Tranchida is a researcher at the Max Planck Institute for Mathematics in the Sciences (MiS) in Leipzig, Germany, where he contributes to the Stochastic Topology and its Applications research group under Erika Roldan's leadership. His work bridges abstract mathematical theory with topological applications, focusing on geometric structures and their symmetries through rigorous group-theoretic analysis. His academic foundation spans international institutions: PhD in Mathematics from KAIST (Daejeon, South Korea) supervised by Harry Hyungryul Baik Master's and Bachelor's degrees from Université libre de Bruxelles (ULB, Belgium) with Master's thesis supervised by Dimitri Leemans Tranchida's research explores the deep connections between topology, geometry, and algebraic structures. He investigates how group actions govern geometric symmetries in chiral polytopes, partitioned surfaces, and combinatorial geometries. His work on residual connectedness and automorphism groups reveals fundamental properties of topological spaces, while his analysis of Torelli groups bridges dynamical systems with homological invariants. Recent publications demonstrate increasing integration of stochastic methods into topological frameworks, reflecting the evolving direction of his research group. Analysis of his publications (2021-2024) shows consistent focus on symmetry classification and topological dynamics. Key patterns include algorithmic approaches to polytope classification, examination of non-hyperbolic properties in Artin groups, and quantification of dynamical invariants in surface mappings. His 2024 work on Torelli groups exemplifies the trend toward connecting topological entropy with algebraic structures, revealing new relationships in low-dimensional topology. Scientific Awards No scientific awards, fellowships, or medals were mentioned in the provided text. Academic Mentoring and Funding The text contains no information about students supervised, grant funding, or research projects beyond his institutional affiliation with MPI MiS. His position suggests institutional support for fundamental mathematical research without specification of external funding sources. Research Environment As a core member of the Stochastic Topology and its Applications group at MPI MiS, Tranchida collaborates on cutting-edge research merging probability theory with topological methods. This interdisciplinary team develops mathematical frameworks for analyzing complex geometric data, with potential applications in materials science and biological modeling. The group's work represents a significant convergence of traditionally separate mathematical disciplines aimed at solving contemporary structural problems.

Kristi Luttrellمشاهده پروفایل

استادیار

• Graph Theory
• Algorithms
• Discrete Mathematics
• +۳ مورد دیگر

Kristi Luttrell, Ph.D., is an Assistant Professor of Mathematics in the Department of Mathematics and Computer Science at Seton Hall University. Her research focuses on graph theory, algorithms, and discrete mathematics, with particular emphasis on component order connectivity, Tutte polynomial posets, and reliability modeling of network structures. She has contributed to the theoretical foundations of graph algorithms and combinatorial optimization, including work on domination numbers and linear-time algorithms for tree analysis. Her academic career includes collaborative research with notable scholars like Dr. Charles L. Suffel, as highlighted in a 2022 tribute. Her publications span topics from maximal graph characterization in posets to reliability metrics in unicyclic networks. Despite no explicitly listed awards or grants in the provided texts, her work demonstrates sustained engagement with foundational problems in discrete mathematics. While no advisees are listed here, her involvement in graph theory education and research supervision is implied through her faculty role. Her workspaces include McQuaid Hall Room 200B, though no lab or team affiliations were detailed in the source material.

Serge Gaspersمشاهده پروفایل

استاد

• Algorithms and complexity
• Graph algorithms
• Quantum algorithms
• +۸ مورد دیگر

Professor Serge Gaspers is a faculty member in the School of Computer Science and Engineering at the University of New South Wales (UNSW), specializing in algorithms for computationally intractable problems. His research focuses on parameterized algorithms, quantum algorithms, and graph theory, with applications in computational social choice and constraint satisfaction. He joined UNSW in 2012 as an ARC DECRA Fellow and later held an ARC Future Fellowship. Gaspers obtained his PhD from the University of Bergen (Norway) in 2008, followed by postdoctoral positions in Montpellier, Santiago, and Vienna. His research interests include algorithms for NP-hard problems, quantum computing, and fair resource allocation. He has been awarded grants totaling over A$2 million, including an ARC Discovery Project (DP210103849) on improved algorithms via random sampling and collaborations with Data61/CSIRO and NICTA. Notable awards include the ARC Future Fellowship (2014), IJCAI 2013 Most Educational Video Award, and DECRA (2012). Teaching: Gaspers teaches COMP6741 - Algorithms for Intractable Problems . His advising spans parameterized algorithms, quantum algorithms, and graph algorithms. Research grants highlight his work in algorithms, with a focus on turbocharging heuristics and computational complexity of resource allocation problems.

Robert Gary Blandمشاهده پروفایل

استاد

• Linear Programming
• Combinatorial Optimization Algorithms
• Optimization
• +۳ مورد دیگر

Robert G. Bland is a Professor at Cornell University's School of Operations Research and Information Engineering (ORIE). He earned his B.S., M.S., and Ph.D. in Operations Research from Cornell University (1969–1974). His career includes roles as Assistant Professor at SUNY Binghamton (1974–1978) and has been at Cornell since 1978, advancing to Full Professor. His research focuses on linear programming, combinatorial optimization, and algorithmic design, with notable contributions to the simplex method and matroid theory. He is affiliated with the Center for Applied Mathematics and holds memberships in the Mathematical Optimization Society and the American Society for Engineering Education. Bland’s teaching spans optimization, game theory, and legislative mathematics. He has received prestigious awards, including the Sloan Foundation Fellowship (1978–1982), multiple Cornell Outstanding Educator Awards, and the McCormick Advising Award (2017). His service includes contributions to engineering education and final exam scheduling. He has authored influential papers in Mathematics of Operations Research , Journal of Combinatorial Theory , and Scientific American . His research emphasizes duality theory, network flow algorithms, and applications in scheduling and resource allocation. Bland’s work bridges theoretical rigor with practical computational methods, shaping modern optimization practices.

Axel Parmentierمشاهده پروفایل

مدرس

• Operations Research
• Machine Learning
• Data-Driven Optimization
• +۵ مورد دیگر

Axel Parmentier is a Lecturer and researcher at the École Nationale des Ponts et Chaussées, where he founded the AI for Air Transport industry research chair with Air France. His work focuses on the intersection of operations research and machine learning, particularly in data-driven combinatorial optimization and stochastic optimization, with industrial applications in air transportation, supply chain, and predictive maintenance. He holds a Ph.D. and has been recognized with awards including the AMIES Dissertation Award (2017) for applied mathematics with industrial impact and the Robert Faure Prize (under 35) from ROADEF. His research also includes contributions to structured reinforcement learning, optimization layers in machine learning, and explainable AI for operational decisions. Awards: AMIES Dissertation Award, Robert Faure Prize Labs/Teams: CERMICS laboratory, AI for Air Transport Chair (collaboration with Air France) Grants/Projects: Continent-scale inventory routing solutions, Renault’s logistics optimization His advising includes students like Victor Cohen, whose work on predictive maintenance was featured on France Culture.

• Theoretical Computer Science
• Statistics
• Probability
• +۵ مورد دیگر

Alex Wein is an Assistant Professor of Mathematics at the University of California, Davis. His research focuses on theoretical computer science, statistics, probability, and data science, with an emphasis on computational complexity of statistical inference, particularly in low-degree polynomial models. He explores challenges in tensor analysis, Bayesian inference, and group actions such as cryo-electron microscopy. His work bridges statistical physics and algorithmic hardness, contributing to foundational understanding of estimation and recovery thresholds. Education: Ph.D. in Mathematics, Massachusetts Institute of Technology (2018) Research Interests: Optimal algorithms for hidden structure detection in noisy data Low-degree polynomial framework for algorithmic hardness predictions Tensors and their computational challenges Connections between Bayesian methods and statistical physics Recent Talks: 'Sharp Phase Transitions in Estimation with Low-Degree Polynomials' at SLMath (2025) 'Unifying Statistical Physics and Low-Degree Polynomials?' at Les Houches School of Physics (2025)

Rachel Caminaمشاهده پروفایل

مدرس

• Group Theory
• Finite Groups
• Algebraic Structures
• +۳ مورد دیگر

Rachel Camina is an Affiliated Lecturer in the Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge's Faculty of Mathematics. Her research focuses on group theory, specifically finite groups, conjugacy classes, and algebraic structures. Her recent publications highlight trends in p-groups , metacyclic groups , and nilpotent groups , with a strong emphasis on analyzing conjugacy class sizes , vanishing classes , and group covering problems . The work often intersects with combinatorics and computational algebra. Dr. Camina's office is located at Room C0.06, DPMMS. She can be reached via email at R.D.Camina@dpmms.cam.ac.uk or through her personal homepage: https://www.dpmms.cam.ac.uk/~rdc26 .

Alison Marrمشاهده پروفایل

استاد

• Graph Theory
• Graph Labeling
• Recreational Mathematics
• +۳ مورد دیگر

Alison Marr is a Professor of Mathematics at Southwestern University, located in Georgetown, Texas. She holds a Ph.D. from Southern Illinois University (2007), an M.S. from Texas A&M University (2004), and a B.A. from Murray State University (2002). Her research focuses on graph theory, graph labeling, and recreational mathematics, with notable contributions to magic labelings of directed graphs and combinatorial design. Marr has served as Department Chair and co-chair of the Transforming Paideia Initiative, emphasizing interdisciplinary education. She teaches across the mathematics curriculum, including innovative courses like a First-Year Seminar on game shows and a team-taught Global Health Paideia Seminar. Active in professional leadership, Marr co-directs the Enhancing Diversity in Graduate Education (EDGE) Summer Program for women in mathematics. She is also involved in inquiry-based learning (IBL) and serves on committees for the Mathematical Association of America (MAA) and Association for Women in Mathematics (AWM). Her recent work addresses equity in calculus education and curriculum modernization. Marr has advised students like D. Beckelhymer and D. Adams, and her research spans over 20 peer-reviewed journal articles, including contributions to Graphs and Combinatorics , Symmetry , and Recreational Mathematics Magazine . Her presentations include invited addresses at conferences such as the Mid-West Conference on Combinatorics and international workshops on graph labeling. Marr collaborates widely, with co-authors including W.D. Wallis and R. Simanjuntak. Beyond academia, she engages in community outreach through teacher circles and high school presentations on mathematics and game shows.

Sarah Ploskerمشاهده پروفایل

استاد

• Quantum Information Theory
• Operator Theory
• Linear Algebra
• +۳ مورد دیگر

Dr. Sarah Plosker is a Professor and Tier 2 Canada Research Chair in Quantum Information Theory at Brandon University's Department of Mathematics & Computer Science. She holds adjunct roles at the University of Manitoba, University of Regina, and University of Guelph. Her research focuses on quantum information theory, operator theory, linear algebra, and matrix analysis, with emphasis on quantum coherence, positive operator valued measures (POVMs), and quantum state transfer. She is affiliated with the Manitoba Quantum Institute and Winnipeg Institute for Theoretical Physics. Education: Ph.D. Applied Mathematics (University of Guelph, 2013), M.Sc. Mathematics (University of Regina, 2010), B.Sc. Combined Mathematics and Statistics (University of Regina, 2008). Her work is supported by CRC, CFI-JELF, and NSERC grants. She actively mentors students and co-supervises at multiple institutions. Research trends in her articles emphasize quantum resource theories, matrix structures (e.g., centrosymmetric, tridiagonal), and graph-based quantum state transfer. Recent work explores coherence measures, universality of quantum unitaries, and applications of operator algebras. Awards include the prestigious Canada Research Chair designation and major grants. Awards: Tier 2 CRC, CFI-JELF Grant, NSERC Discovery Grant. Advising & Grants: Mentors postdocs, PhD/MSc students across institutions. Supervised over 20 students since 2013, specializing in quantum information, linear algebra, and applied mathematics. Labs/Teams: Active in Manitoba Quantum Institute, Winnipeg Institute for Theoretical Physics, and collaborates with University of Regina/Manitoba groups.

Antar Bandyopadhyayمشاهده پروفایل

استاد

• Theoretical Probability
• Applied Probability
• Combinatorics
• +۸ مورد دیگر

Antar Bandyopadhyay is a Professor at the Indian Statistical Institute (ISI) , serving as Head of the Delhi Centre since 2023. He was previously the Professor-in-Charge of the Theoretical Statistics and Mathematics Division (2020–2022). He spent the academic year 2013–2014 as a Visiting Associate Professor at the Department of Statistics, University of California, Berkeley . Education : PhD in Statistics (UC Berkeley, 2003), MA in Statistics (UC Berkeley, 2000), M.Stat. (ISI Kolkata, 1998), B.Stat. (ISI Kolkata, 1996). Research Interests : Theoretical and applied probability, focusing on discrete problems arising from combinatorics, statistical physics, and computer science. Key areas include random graphs , probability on trees , recursive distributional equations , branching random walks , percolation theory , interacting particle systems , Markov chains mixing , random walks in random environments , and urn models . He also explores theoretical statistics and probability questions emerging from it. Publication Trends : His recent work (2006–2025) spans infinite-color urn models , branching random walks , percolation , random graphs , and random walks in dynamic environments . Collaborations include researchers at UC Berkeley, Chalmers University, ISI Kolkata, and the University of Minnesota. Scientific Awards : Outstanding Graduate Student Instructor Award (UC Berkeley, 2002) Teaching Effectiveness Award (UC Berkeley, 2002) Advising and Grants : He has mentored Gursharn Kaur , Debleena Thacker , and others. His work has been supported by institutions such as UC Berkeley, Chalmers University, and the Institute for Mathematics and Its Applications . Labs and Teams : He actively collaborates with the Theoretical Statistics and Mathematics Unit at ISI Delhi and has organized the weekly seminar series (2006–2010), co-organizing workshops like the Lectures on Probability and Stochastic Processes (2006–2014).