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

Peter Selingerمشاهده پروفایل

استاد

• Quantum Computing
• Category Theory
• Mathematical Logic
• +۴ مورد دیگر

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

Minsu Kimمشاهده پروفایل

پژوهشگر ارشد

• Artificial Intelligence
• Deep Learning
• Combinatorial Optimization
• +۷ مورد دیگر

Minsu Kim is a CIFAR AI Safety Post-doc Fellow at KAIST and Mila, collaborating with Prof. Yoshua Bengio, Prof. Sungjin Ahn, and Prof. Sungsoo Ahn. His work bridges System 2 Deep Learning, Bayesian posterior inference, and combinatorial optimization. Ph.D., Industrial Engineering, KAIST (2025) M.S., Electrical Engineering, KAIST (2022) B.S., Mathematics and Computer Science (Dual Degree), KAIST (2020) Kim's research focuses on enabling AI systems to measure uncertainty, represent causality, and perform sequential reasoning for safety-guaranteed planning. His methodology integrates GFlowNets and diffusion models with off-policy amortized inference, targeting applications in scientific discovery , hardware design optimization , and large language model alignment . Recent work explores Bayesian posterior inference through GFlowNets, aiming to unify deep learning with probabilistic reasoning. His 15 most recent publications (2025–2024) reveal a trend of combining combinatorial optimization with generative models for tasks like molecular graph discovery, vehicle routing, and neural architecture search. He also investigates diffusion samplers for Bayesian inverse problems and symmetry-based neural methods (Sym-NCO) to enhance sample efficiency. Jang Yeong Sil Fellowship (2025) KAIST Presidential Best Ph.D. Thesis Award (2025) Qualcomm Innovation Fellowship (2023) DesignCon Best Paper Awards (2021–2022) Kim's collaborations span KAIST's Industrial Engineering department and Mila's AI research groups. He actively contributes to academic peer review for top conferences (NeurIPS, ICML, ICLR) and journals (IEEE TNNLS, TPAMI), emphasizing the intersection of AI safety , uncertainty quantification , and systemic reasoning .

Fatih Ecevitمشاهده پروفایل

استاد

• Numerical Analysis
• Partial Differential Equations
• Scattering Theory
• +۲ مورد دیگر

Fatih Ecevit is Full Professor of Mathematics at Boğaziçi University, serving as Vice Chair of the Mathematics Department. Former research associate at Max-Planck-Institut für Mathematik in den Naturwissenschaften, Leipzig (2005-2007). Research develops computational methods for high-frequency scattering problems, including: Boundary element methods for wave propagation Asymptotic analysis of scattering phenomena Galerkin formulations for integral equations Lattice sum evaluations in graph theory Principal investigator for TÜBİTAK-funded project: 'Hybrid integral equation methods for high-frequency scattering problems' (2017-2020). Teaches graduate and undergraduate courses in numerical analysis, partial differential equations, and real analysis.

Charles J. Taylorمشاهده پروفایل

استاد

• Analytical Chemistry
• Chemical Sensing
• Environmental Chemistry
• +۳ مورد دیگر

Charles J. Taylor is Professor of Chemistry and Chair of the Chemistry Department at Pomona College, where he has served since 2002. An analytical chemist specializing in instrumental techniques for volatile organic compound (VOC) analysis, his work bridges medical diagnostics, environmental monitoring, and chemical sensing applications. His educational background includes: Ph.D. from University of Minnesota Bachelor of Arts from Macalester College Taylor's research focuses on developing rapid diagnostic methods through VOC analysis, leveraging microhotplate arrays, Raman spectroscopy, and polymer-carbon composites. His work spans biological systems (nematode chemotaxis, wine fermentation flavor compounds) and environmental applications (trace element profiling in coffee beans). Students in his lab gain hands-on experience with advanced analytical instrumentation and multivariate data analysis. Analysis of his publications reveals consistent themes in chemical sensing materials development, with strong emphasis on microsensor arrays, NASA-collaborative electronic nose projects, and applications in medical/environmental diagnostics. His work demonstrates interdisciplinary integration of materials science, analytical chemistry, and data analysis. His scientific achievements have been recognized with: NASA Board Award for Copolymers for Sensors (2013) NASA Board Award for SO 2 Detection (2012) Provisional U.S. Patent #60/861-617 (2007) Multiple NASA Tech Brief Awards (2007) Taylor actively mentors undergraduate researchers, with students co-authoring publications on diverse projects from medical diagnostics to environmental trace analysis. His teaching includes Advanced Analytical Chemistry, Environmental Chemistry, and General Chemistry, emphasizing practical laboratory experience. Research funding has supported instrumentation development and NASA-collaborative sensor projects. His laboratory focuses on chemical sensing materials development, particularly microhotplate-based sensor arrays and VOC analysis systems, with ongoing collaborations with NASA's Jet Propulsion Laboratory for electronic nose applications and environmental monitoring solutions.

Salem Lahlouمشاهده پروفایل

استادیار

• Machine Learning
• Artificial Intelligence
• GFlowNets
• +۷ مورد دیگر

Salem Lahlou is an Assistant Professor in the Machine Learning Department at the Mohamed bin Zayed University of Artificial Intelligence (MBZUAI), having joined in September 2024. He previously served as a Senior Researcher at the Technology Innovation Institute (TII) in 2024. His academic background includes a PhD from Mila and Université de Montréal (UdeM) under Yoshua Bengio (2023), with prior studies in applied mathematics at École Polytechnique and statistical learning at École Normale Supérieure Paris-Saclay. His research focuses on developing more capable and reliable AI systems through three interconnected pillars: Novel Method Development : Core contributions to Generative Flow Networks (GFlowNets), uncertainty estimation techniques (DEUP), and curriculum learning frameworks Large Language Model Advancement : Enhancing reasoning capabilities and alignment through preference optimization and trace-based learning Community Tooling : Creation of torchgfn library for GFlowNets and benchmarks including BabyAI, FinChain, and LLM-BabyBench Core research areas span Machine Learning, GFlowNets, Uncertainty Estimation, LLM Reasoning, Reinforcement Learning, and AI for Science. Recent publications (2023-2025) demonstrate strong emphasis on GFlowNet theory/improvements (8+ papers), LLM reasoning evaluation (FinChain, LLM-BabyBench), uncertainty quantification, and societal AI impacts. Key application domains include mathematical reasoning, financial systems, privacy preservation, and cognitive science. He currently advises graduate students including Junyi (privacy risks in SNNs) and Abhijith (LLM reasoning). His group collaborates with MBZUAI faculty (Nils Lukas, Alham Fikri, Mingming Gong, Martin Takac) and industry partners on projects involving Conversational AI, Personalization, and Affective AI.

• Sublinear-time algorithms
• Error-correcting codes
• Computational complexity
• +۳ مورد دیگر

Elena Grigorescu is a Professor at the University of Waterloo, Department of Computer Science. She holds a Ph.D. from the Massachusetts Institute of Technology (2010), an M.S. from MIT (2006), and a B.A. from Bard College (2004). Her research focuses on sublinear-time algorithms, error-correcting codes, computational complexity, and learning theory. She explores foundational aspects of algorithms with constraints on time/space, privacy-preserving computation, and applications in graph theory and optimization. Her work includes advancements in spanner algorithms for network design, differential privacy in sublinear-time settings, and learning-augmented approaches for online optimization. Recent publications address trace reconstruction, privacy-utility trade-offs, and combinatorial optimization techniques. Grigorescu is actively involved in conferences like APPROX/RANDOM and IEEE Foundations of Computer Science, contributing to algorithmic theory and practical implementations. Her research emphasizes theoretical rigor while addressing real-world challenges in data analysis and distributed systems. No awards or formal advisees are explicitly listed in the provided information.

• Functional Analysis
• Operator Theory
• Free Probability
• +۳ مورد دیگر

Michael Anshelevich is a Professor of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. His research focuses on Functional Analysis, Operator Theory, and Free Probability, with contributions to non-commutative stochastic processes, orthogonal polynomials, and operator-valued distributions. He holds a Ph.D. from the University of California, Berkeley (2000) and a B.S. from the California Institute of Technology (1994). His work bridges combinatorial methods with advanced probability theory, addressing topics like free Lévy processes and free convolution powers. Research interests span non-commutative probability frameworks, including free stochastic measures, Fock space representations, and applications of combinatorial structures to stochastic calculus. Recent articles explore exponential products in operator algebras, Hermite polynomials in Brownian motion contexts, and depth-two actions in Fock spaces. His contributions to free probability include extending classical limit theorems to non-commutative settings and analyzing multiplicative free convolutions. Publications highlight interdisciplinary connections between functional analysis and stochastic processes, with a focus on operator-valued distributions and Jacobi parameters. While no specific awards are listed, his extensive bibliography reflects sustained impact in mathematical physics and operator theory. Advising and grants sections remain unspecified, though his research often involves collaborative projects in stochastic analysis and free probability.

Don Zagierمشاهده پروفایل

استاد

• Number Theory
• Algebraic Geometry
• Modular Forms
• +۳ مورد دیگر

Don Zagier is a distinguished mathematician holding positions as Scientific Member and former Director at the Max Planck Institute for Mathematics in Bonn. He has been a Professor at the University of Bonn, University of Maryland, Kyushu University, University of Utrecht, and Collège de France. His work bridges number theory, algebraic geometry, topology, and mathematical physics. Born in 1951, he studied at MIT (1966–1968), earned a D.Phil. from Oxford (1971), and completed his habilitation at Bonn (1975). He has held roles in the Sonderforschungsbereich (SFB) Theoretische Mathematik, served as ICTP Distinguished Staff Associate since 2014, and is an Honorary Member of the London Mathematical Society (2019). Research interests include modular forms, zeta functions, quantum invariants, and algebraic geometry. Notable works include studies on the Birch-Swinnerton-Dyer conjecture, polylogarithms, and the theory of Jacobi forms. His contributions span over 200 publications, including foundational texts like Zetafunktionen und quadratische Körper (1981) and co-edited volumes on modular forms. His awards include the Carus Prize (1984), Frank Nelson Cole Prize (1987), and Karl Georg Christian von Staudt Prize (2001). Research trends in his articles focus on modular forms, knot theory, quantum topology, and the interplay between number theory and geometry. Grants and collaborations are extensive, though specifics remain unspecified. He leads research at the MPI and contributes to global mathematical communities through educational initiatives and editorial roles in journals like Communications in Number Theory and Physics .

Shuangping Liمشاهده پروفایل

استادیار

• Probability Theory
• High-Dimensional Statistics
• Theoretical Machine Learning
• +۵ مورد دیگر

Shuangping Li is an Assistant Professor in the Department of Statistics and Data Science at Yale University. She was previously a Stein Fellow in the Department of Statistics at Stanford University (2022–2025). Her research lies at the intersection of probability theory, high-dimensional statistics, theoretical machine learning, and the theory of algorithms. Ph.D. in Applied and Computational Mathematics, Princeton University (2022) B.Sc. in Mathematics, University of Hong Kong Her research interests include probability theory , high-dimensional statistics , theoretical machine learning , and theory of algorithms . She investigates foundational aspects of random constraint satisfaction problems, neural networks, spectral methods, and phase transitions in high-dimensional models. Her work often draws from statistical physics and combinatorics to explain algorithmic behavior. The recent articles highlight a strong focus on binary perceptrons , clustering in network models , and algorithmic phase transitions . Keywords across publications include probability, theoretical computer science, machine learning, and statistical inference. Subfields reveal deep engagement with spin glass theory, discrepancy minimization, spectral embedding, and information-computation gaps. Scientific awards include: Stein Fellow, Department of Statistics, Stanford University (2022–2025) She has advised and taught at both Stanford and Yale, including courses such as Advanced Probability , Theory of Probability , and Stochastic Processes . She has organized seminars at Stanford and has delivered invited talks at institutions including Cornell, Duke, UC Berkeley, and Princeton. Her collaborative research involves prominent scholars such as Allan Sly, Emmanuel Abbe, and Tselil Schramm. There is no mention of external grants, but her postdoctoral fellowship suggests research funding support. She is involved in academic service through organizing the Stanford Statistics and Probability Seminars. She maintains an active research presence with publications in top venues like STOC, FOCS, COLT, ICLR, and journals such as Annals of Probability and Annals of Statistics .

• Applied Mathematics
• Mathematical Biology
• Epidemiology
• +۴ مورد دیگر

Paul Tupper is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. He holds a Ph.D. in Scientific Computing from Stanford University (2002). His research focuses on applied mathematics with emphasis on mathematical modeling in epidemiology, speech perception, neural networks, and computational linguistics. He teaches advanced courses in probability, numerical linear algebra, and calculus for social sciences. His work bridges theoretical mathematics and real-world applications, particularly in understanding complex systems like disease transmission dynamics and cognitive processes. Recent studies include modeling the transition of pandemics to endemic states, genomic analysis of viral spread, and audio-visual perception mechanisms in speech. He actively contributes to public health policy discussions through epidemic modeling research. Professor Tupper's research has been published in high-impact journals and conferences, with notable contributions to diversity metrics in biology and geometry, stochastic differential equations, and connectionist models of linguistic phenomena. His courses reflect interdisciplinary interests, integrating mathematical rigor with practical computational methods.

Rocco Servedioمشاهده پروفایل

استاد

• Computational Complexity Theory
• Computational Learning Theory
• Property Testing
• +۳ مورد دیگر

Rocco Servedio is a Professor in the Department of Computer Science at Columbia University, where he leads research in theoretical computer science with a focus on computational complexity theory, learning theory, and the role of randomness in computation. He previously served as Chair of the Computer Science Department from 2018 to 2021. He holds a Ph.D., MS, and AB in Mathematics from Harvard University. His research interests include property testing, computational learning theory, and algorithmic lower bounds. He has contributed to foundational work in areas like junta testing, trace reconstruction, and convexity testing. Servedio has held leadership roles in major conferences such as STOC, CCC, and COLT, and has mentored students through courses like Unconditional Lower Bounds and Derandomization . Education: Ph.D. in Computer Science, Harvard University MS in Computer Science, Harvard University AB in Mathematics, Harvard University His research bridges theoretical computer science and applied mathematics, with recent work exploring the intersection of Gaussian processes, convex geometry, and algorithmic efficiency. Servedio's contributions to the field are exemplified through his involvement in high-impact conferences and his leadership in advancing fundamental computational theories.

Edwin Romeijnمشاهده پروفایل

استاد

• Optimization Theory
• Radiation Therapy Treatment Planning
• Supply Chain Management
• +۲ مورد دیگر

Edwin Romeijn holds the Jill Stewart Archer Family Chair and Professor position in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology. He served as School Chair from 2015-2024, overseeing the nation's top-ranked industrial engineering program. Previously, he held faculty positions at the University of Michigan, University of Florida, and Erasmus University Rotterdam, and served as Program Director at the National Science Foundation. Education: Ph.D. in Operations Research (1992), Erasmus University Rotterdam M.S. in Econometrics (1988), Erasmus University Rotterdam Romeijn's research centers on optimization theory and applications , with dual focus areas in radiation therapy treatment planning and supply chain management . His radiation therapy work develops algorithms for cancer treatment planning and clinic scheduling, while his supply chain research addresses integrated optimization of production, inventory, and transportation under demand flexibility, resource constraints, perishability, and uncertainty. His methodologies bridge theoretical operations research with real-world healthcare and logistics systems. His publication portfolio demonstrates consistent contributions to optimization methods across diverse application domains, with recent work spanning healthcare systems, renewable energy, sports analytics, and unconventional logistics. The research exhibits strong methodological continuity in stochastic programming, network optimization, and decision-making under uncertainty. Scientific Awards: Fellow of IISE and INFORMS (2017) Richard C. Wilson Faculty Scholar (2012-2013) Multiple best paper awards in industrial engineering conferences Pierskalla Best Paper Award (2003) Young Investigator’s Award at ICCR (2004) Romeijn has advised numerous graduate students and secured significant research funding through NSF and other agencies. His leadership extends to program direction at NSF and chairing Georgia Tech's Industrial and Systems Engineering school. He maintains active collaborations with healthcare institutions and manufacturing enterprises, translating theoretical advances into practical solutions for radiation oncology and supply chain resilience.

• Theoretical Computer Science
• Sublinear Algorithms
• Complexity Theory
• +۴ مورد دیگر

Elena Grigorescu is an Adjunct Associate Professor in the Department of Computer Science at Purdue University, where she has been a faculty member since Fall 2012. Her research program spans theoretical computer science with a focus on foundational algorithmic challenges in large-scale data processing and computational limits, maintaining strong connections to cryptography, communications, and optimization applications. Her educational background includes a PhD from the Massachusetts Institute of Technology (MIT), establishing her expertise in rigorous theoretical frameworks. Professor Grigorescu's research emphasizes designing algorithms that operate in sublinear time or space for massive datasets, analyzing complexity of error-correcting codes and lattices, and exploring information-theoretical computation limits. Current investigations integrate differential privacy with learning-augmented techniques to solve online optimization problems, network design challenges, and data stream processing bottlenecks. Her work bridges abstract theory with practical implementations in cryptographic systems and quantum computing paradigms, demonstrating consistent innovation in algorithmic foundations. Analysis of her recent publications (2022-2025) reveals a dominant focus on sublinear-time algorithms, particularly at the intersection with differential privacy and machine learning augmentation. Key contributions include novel spanner constructions for network design, privacy-preserving clustering frameworks, and breakthroughs in trace reconstruction and coding theory. A pronounced trend shows increasing integration of learning-based predictions to enhance classical online algorithms for packing/covering problems while maintaining theoretical guarantees, alongside sustained contributions to error-correcting code analysis and graph-theoretic foundations. No specific scientific awards or major fellowships were documented in the provided materials, though her publication record in premier venues like STOC, FOCS, and APPROX/RANDOM indicates significant peer recognition. Professor Grigorescu actively mentors graduate students in theoretical computer science research, guiding investigations in sublinear algorithms, complexity theory, and coding theory. Her collaborative projects involve interdisciplinary teams across institutions, focusing on cryptographic applications and quantum information theory, though specific grant details were not included in the source texts. Ongoing work suggests expansion into quantum algorithm design and privacy-preserving machine learning frameworks. While dedicated laboratory facilities were not specified, her research operates within Purdue's theoretical computer science group, leveraging university-wide computational resources and fostering collaborations through conference participation and workshop organization.

Jayce Robert Getzمشاهده پروفایل

دانشیار

• Langlands Functoriality
• Automorphic Representations
• Trace Formulae
• +۵ مورد دیگر

Jayce Robert Getz is an Associate Professor of Mathematics at Duke University's Trinity College of Arts & Sciences. His research focuses on Langlands functoriality, nonabelian Fourier transforms, and relative trace formulae, with applications to automorphic representations and arithmetic geometry. He holds a Ph.D. from the University of Wisconsin (2007), an M.A. from the same institution (2006), and an A.B. from Harvard University (2004). Getz has held visiting positions at Pohang University of Science and Technology (2021, 2024), and collaborated internationally at institutions like the Hebrew University and the Institute for Advanced Study. His work bridges number theory, representation theory, and algebraic geometry. Getz has been awarded prestigious fellowships, including the NSF Postdoctoral Research Fellowship (2007–2010) and the NDSEG Graduate Fellowship (2004–2007). He is a Principal Investigator on multiple NSF grants, including projects on summation formulae and L-functions. His research interests include trace formulae, L-functions, algebraic cycles, and nonabelian harmonic analysis. Recent publications highlight advancements in summation formulae for quadrics, nonabelian circle methods, and automorphic kernel functions. Teaching includes courses on number theory, algebraic structures, and advanced topics in mathematics. Getz collaborates globally, with affiliations at the Postech Mathematics Institute and contributions to international workshops. His work emphasizes foundational questions in arithmetic geometry and the Langlands program.

Laks V.S. Lakshmananمشاهده پروفایل

استاد

• Data Management
• Graph Computing
• Machine Learning
• +۵ مورد دیگر

Laks V.S. Lakshmanan is a Professor in the Department of Computer Science at the University of British Columbia (UBC), within the Faculty of Science. His research focuses on data management, graph computing, machine learning, and algorithms, with notable contributions to dense subgraph discovery, influence maximization, and healthcare informatics. He teaches advanced courses on databases and data management, including CPSC 404 (Advanced Relational Databases) and CPSC 534L (Topics in Data Management). His awards include the ACM SIGMOD Research Highlight Award, the IEEE Data Science Best Paper Award, and recognition as an ACM Distinguished Scientist (2016). His work bridges theoretical algorithm design with practical applications in social networks, bioinformatics, and healthcare. Key research themes include optimizing graph algorithms for large-scale data, combating misinformation through network analysis, and developing efficient methods for subgraph enumeration and influence propagation. His recent publications explore topics like clinical event prediction (TRACE), cost-effective LLM selection (ThriftLLM), and cross-modal consistency in AI systems. Education: Details not explicitly provided in sources. Grants & Funding: Recipient of NSERC Discovery Accelerator Supplements. Labs/Teams: Engaged in UBC's data management research groups and collaborative initiatives with industry partners.