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

Stephen S. Kudlaمشاهده پروفایل

استاد

• Automorphic Forms
• Arithmetic Geometry
• Theta Functions
• +۴ مورد دیگر

Stephen S. Kudla is a Professor in the Department of Mathematics at the University of Toronto, located in the Bahen Centre for Information Technology. He holds the prestigious distinction of being a Fellow of the Royal Society of Canada (FRSC), reflecting his significant contributions to mathematical research. Professor Kudla's research focuses on the deep connections between number theory and geometry, with particular expertise in automorphic forms, arithmetic geometry, and theta functions. His work bridges abstract mathematical theory with concrete geometric structures, exploring how modular forms can encode arithmetic information about algebraic varieties. Analysis of Kudla's publication record reveals a sustained research program centered on the relationship between derivatives of Eisenstein series and arithmetic geometry. His work consistently explores how modular and automorphic forms can be used to study arithmetic cycles on Shimura varieties. A notable pattern in his research is the interplay between analytic objects (like Eisenstein series) and geometric structures (such as arithmetic cycles), with applications to understanding heights, intersection theory, and special values of L-functions. Fellow of the Royal Society of Canada (FRSC) While specific details about Kudla's advising activities aren't provided in the available materials, his extensive publication record with prominent collaborators like Michael Rapoport and Tonghai Yang suggests he has likely mentored numerous graduate students and postdoctoral researchers throughout his career. His participation in major mathematical conferences including the International Congress of Mathematicians (ICM) indicates recognition by the broader mathematical community. Kudla's research has clearly been supported by significant funding, as evidenced by his ability to maintain a sustained publication record in top mathematical journals.

John Lygerosمشاهده پروفایل

استاد

• Automatic Control
• Hybrid Systems
• Large-Scale Dynamical Systems
• +۴ مورد دیگر

John Lygeros is a Full Professor and Head of the Institute for Automatic Control at ETH Zurich's Department of Information Technology and Electrical Engineering. He received his B.Eng. (1990) and M.Sc. (1991) from Imperial College London, and Ph.D. (1996) from UC Berkeley. Before joining ETH Zurich in 2006, he held academic positions at the University of Cambridge and University of Patras. His research focuses on: Modeling and control of hierarchical hybrid systems Large-scale dynamical systems applied to biochemical networks Control of automated transportation systems via wireless networks Energy systems and advanced manufacturing control His research demonstrates strong emphasis on optimization methods, distributed control architectures, and machine learning applications in control systems, with significant contributions to real-time optimization algorithms and data-driven control methodologies. Major scientific awards include: HSCC Test of Time Award (2024) ERC Advanced Grant (2018) O. Hugo Schuck Best Paper Award (2018) IEEE George S. Axelby Paper Award (2016) Three Golden Owl teaching awards from ETH Zurich He leads the Automatic Control Laboratory at ETH Zurich and serves as Director of the National Centre of Competence in Research 'Dependable Ubiquitous Automation'. He has advised over 60 doctoral candidates since 2017, with research spanning optimization algorithms, power systems, autonomous systems, and machine learning applications.

Fatma Kılınç-Karzanمشاهده پروفایل

دانشیار

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +۷ مورد دیگر

Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.

Dinesh S. Thakurمشاهده پروفایل

استاد

• Number Theory
• Arithmetic Geometry
• Function Field Arithmetic
• +۷ مورد دیگر

Professor Dinesh S. Thakur holds the position of Professor in the Department of Mathematics at the University of Rochester. He earned his PhD from Harvard University and has made significant contributions to number theory, arithmetic geometry, and function field arithmetic. His research focuses on developing theories related to zeta functions, Drinfeld modules, and p-adic analysis in finite characteristic environments. Education: PhD in Mathematics, Harvard University Research Interests: Thakur’s work integrates advanced topics such as elliptic curves, modular forms, Diophantine equations, and the arithmetic of function fields. He has pioneered studies on multizeta values, p-adic continued fractions, and the distribution of Diophantine exponents in finite characteristic. His research bridges classical number theory with modern algebraic geometry and p-adic analysis. Teaching & Mentorship: Thakur has taught a wide range of courses, including graduate-level topics in function field arithmetic, algebraic geometry, and number theory. He has advised 11 PhD students and several master’s students, whose theses span themes like elliptic Carmichael numbers, Drinfeld modular forms, and multizeta relations. Notable advisees include Javier Diaz-Vargas (1996), George Todd (2015), and Yao-Rui Yeo (2021). Outreach & Contributions: Thakur participates in initiatives like the Arizona Winter School and Olympiad training programs in India. He maintains an active seminar series at UR on topics such as L-values, Fermat’s Last Theorem, and automatic sequences. His work is accessible through his personal page and MathSciNet.

• Optimization
• Complex Networks
• Statistical Inference
• +۳ مورد دیگر

Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.

Hayden Kwok Hay SOمشاهده پروفایل

دانشیار

• Reconfigurable Computing
• FPGA-Based Systems
• Computer Architecture
• +۷ مورد دیگر

Prof. Hayden Kwok Hay SO is an Associate Professor at the University of Hong Kong (HKU), affiliated with the Department of Electrical and Electronic Engineering. He currently serves as Acting Director of the School of Innovation and previously co-directed the Computer Engineering Program. His research focuses on reconfigurable computing systems, FPGA-based architectures, and their applications in AIoT, medical imaging, and high-performance computing. He holds a B.S., M.S., and Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (1998–2007). Prof. So has been recognized with awards such as the IEEE-HKN Teaching Award (2021), Croucher Innovation Award (2013), and multiple teaching excellence awards. He leads the Computer Architecture & System Research Lab (CASR) and co-founded the Joint Lab on Future Cities (JLFC). His work spans FPGA overlay architectures, graph processing systems, and hardware-software co-design for efficient computing. Key research contributions include advancements in FPGA-based reconfigurable systems, sparse dataflow architectures, and medical imaging accelerators. He has secured grants for projects like 'Advanced machine vision guided aquatic surface vehicles' and 'Efficient and Productive Parallel Data Processing in Hybrid FPGA-CPU Clusters.' Prof. So has advised numerous students and researchers, contributing to over 150 peer-reviewed publications. His current projects explore AI hardware acceleration, neuromorphic computing, and FPGA-driven solutions for big data challenges.

Kartik Prasannaمشاهده پروفایل

استاد

• Number Theory
• Automorphic Forms
• Algebraic Cycles
• +۶ مورد دیگر

Kartik Prasanna is a Professor in the Department of Mathematics at the University of Michigan , affiliated with the College of Literature, Science and the Arts . He received his PhD from Princeton University in 2003 under the supervision of Andrew Wiles. Research Interests: His work lies at the intersection of number theory , algebraic cycles , and automorphic forms , focusing on the Langlands program , L-functions , algebraic cycles , and Iwasawa theory , particularly through the lens of the Bloch-Beilinson and Bloch-Kato conjectures . His recent publications explore periods of automorphic forms and the arithmetic of Shimura varieties. Grants & Awards: Simons Fellowship (2014-15) von Neumann Fellowship at the Institute for Advanced Study (2014-15) Current NSF Grants : DMS 2001293 and RTG DMS 1840234 Previous NSF grants: DMS 1600494, DMS 1160720, DMS 1015173, DMS 0801191, DMS 0854900 Academic Contributions: He has advised or collaborated with numerous postdoctoral researchers including Christopher Lyons , Ruochuan Liu , and Cameron Franc . Prasanna organized the 2011 FRG/RTG Workshop on L-functions, Galois Representations and Iwasawa Theory at the University of Michigan.

Amir Ali Ahmadiمشاهده پروفایل

استاد

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

Christopher Morrisمشاهده پروفایل

استادیار

• Machine Learning
• Graph Neural Networks
• Computer Science Theory
• +۳ مورد دیگر

Christopher Morris is a tenure-track Assistant Professor at RWTH Aachen University and a DFG Emmy Noether fellow. He leads the Learning on Graphs (LoG) research group, focusing on machine learning methods for structured data, particularly graph neural networks. His work bridges machine learning, computer science theory, and discrete mathematics, addressing challenges in generalization, expressivity, and algorithmic efficiency. Education: PhD in Computer Science from TU Dortmund University (advised by Petra Mutzel and Kristian Kersting), postdoctoral research at Mila - Quebec AI Institute (Siamak Ravanbakhsh) and McGill University, and Polytechnique Montréal (Andrea Lodi). Research interests emphasize graph machine learning, including generalization theory, combinatorial optimization, and scalable graph embeddings. Notable contributions include analyzing Weisfeiler-Leman algorithms' impact on GNNs' expressivity and generalization (VC dimension connections). Awards: DFG Emmy Noether Fellowship. Supervises six PhD students in Aachen. Active in teaching, offering courses on graph-based machine learning foundations and applications since 2022. Labs/Teams: LoG group at RWTH Aachen, collaborating with institutions like Mila and Polytechnique Montréal. Erdős number 3 through Petra Mutzel’s collaboration network.

• High-speed data converters
• Wireless transceivers
• Digital phase-locked loops
• +۷ مورد دیگر

Shiyu Su is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Waterloo. His research focuses on high-speed data converters, wireless transceivers, digital phase-locked loops (PLL), and AI-assisted analog/mixed-signal design automation. He holds a Ph.D. from the University of Southern California (2019) and teaches courses such as ECE 340 (Electronic Circuits 2) and ECE 432 (Radio Frequency Integrated Devices and Circuits). Education: B.S. from Beijing University of Post and Telecommunication (China) and Queen Mary, University of London (UK), 2011; M.S. and Ph.D. from USC, 2013 and 2019, all in electrical engineering. Research Interests: High-speed ADCs/DACs RF/mm-wave transceivers Time-approximation filters (TAF) Analog/mixed-signal design automation Memristor-based computing Biomedical interfaces Key Awards: IEEE SSCS Predoctoral Achievement Award (2017–2018) Best Student Paper Award at IEEE RFIC (2022) Ming Hsieh Institute Scholar (2019–2020) Lab Focus: The Shiyu Su Lab develops integrated circuits for communications, sensing, and computing, with a focus on AI-driven methodologies and digital-analog co-design. Collaborations include work with Prof. Wei Wu (USC) on memristor-based systems.

• Optimization
• Machine Learning
• Statistics
• +۳ مورد دیگر

Damek Davis serves as an Associate Professor of Statistics and Data Science and Co-Academic Director of the Dual Master's Degree in Statistics at the Wharton School, University of Pennsylvania. His academic base is the Department of Statistics and Data Science within the Wharton School, with his office located at the Academic Research Building in Philadelphia, PA. His research expertise centers on optimization theory for data science, with deep specialization in nonsmooth and stochastic optimization problems. Key focus areas include convergence analysis of first-order methods, variance reduction techniques, and theoretical guarantees for algorithms in nonconvex settings. His work bridges mathematical rigor with practical applications in machine learning and statistical inference, particularly in developing efficient computational frameworks for large-scale data analysis. Analysis of his 2022-2024 publications reveals dominant themes in optimization for modern data challenges: nonsmooth stochastic approximation, linear convergence under sharpness conditions, and global optimality in mixture models. His research consistently appears in premier venues across optimization (Mathematical Programming, SIAM Journal), statistics (The Annals of Statistics), and machine learning (IEEE Transactions), demonstrating cross-disciplinary impact in both theoretical foundations and computational methodologies.

Bin Tangمشاهده پروفایل

استاد

• Data Placement Algorithms
• Robotic Sensor Networks
• Cloud Data Centers
• +۳ مورد دیگر

Dr. Bin Tang is a Professor in the Department of Computer Science at California State University, Dominguez Hills. He holds a Ph.D. in Computer Science from Stony Brook University (2007) and dual M.S. degrees in Computer Science and Materials Science from the same institution. His research focuses on algorithmic solutions for data placement in networks, with applications in robotic sensor systems and cloud data centers. He has led multiple NSF-funded projects including 'Edge-Based Approach to Robust Multi-Robot Systems' and 'Optimal Resource Allocation in Policy-Driven Data Centers'. Dr. Tang mentors students in research competitions and has supervised numerous graduate theses. He teaches courses in operating systems, algorithms, computer networks, and cloud computing.

Margaret P. Chapmanمشاهده پروفایل

استادیار

• Risk-Averse Control Theory
• Stochastic Control Theory
• Safety Analysis for Dynamical Systems
• +۴ مورد دیگر

Margaret P. Chapman is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Toronto's Faculty of Applied Science and Engineering. She leads the DATA Lab (Decision Analysis for Trustworthy Autonomy), focusing on risk-averse and stochastic control theory with applications to environmental and human health. Education: B.S. and M.S. in Mechanical Engineering from Stanford University (2012, 2014), Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (2020, advised by Claire Tomlin) Her research bridges robust and stochastic optimal control via risk measure theory, emphasizing safety-critical applications in healthcare and sustainable cities. Key challenges include scalable risk-sensitive control methods, integrating physics-based and data-driven models for safety analysis, and promoting technologies that enhance planetary and human well-being. Recent publications focus on risk-averse autonomous systems, CVaR-based safety analysis, and multi-time-scale modeling for cancer treatment. She has advised students in both graduate and undergraduate research roles, including NSERC awardees and thesis participants. Awards: US National Science Foundation Graduate Research Fellowship, Berkeley Fellowship, Terman Engineering Scholastic Award, Leon O. Chua Award She teaches courses like ECE 557 (Linear Control Theory) and ECE 1643 (Risk-Averse Control with Learning). Her invited talks span institutions such as MIT, Princeton, and Georgia Tech, highlighting risk-sensitive analysis and control for trustworthy autonomy.

• Mathematics Education Curriculum
• Mathematics Teacher Education
• Algebra Teaching and Learning
• +۳ مورد دیگر

Jill Newton is a Professor in the Department of Curriculum and Instruction at Purdue University’s College of Education. Her work focuses on mathematics education curriculum development, teacher training, and equity in education, with additional contributions to international and study abroad programs. Ph.D. in Curriculum, Teaching, and Educational Policy (Mathematics Education), Michigan State University (2008) M.A. in International Education, George Washington University (1995) B.S. in Mathematics and Secondary Teaching Certification, Michigan State University (1987) Newton’s research spans algebra teaching, curriculum coherence, and social justice in education. She has led national studies on mathematics teacher preparation and explored how teachers use curricular resources post-COVID. Her work also emphasizes international education, including virtual communities of practice for global social justice. Recent publications highlight her focus on algebraic reasoning, curricular alignment, and equity. She has co-authored studies on elementary teachers’ curriculum use, preservice teacher development, and virtual intercultural collaborations. Terry L. Wood Mathematics Teacher Educator Award (2024-25) Book of Great Teachers Inductee (2023) Outstanding Leadership in Globalization Award (2022-23) Charles B. Murphy Outstanding Undergraduate Teaching Award (2017) Newton has coordinated undergraduate research at Purdue since 2018 and has taught mathematics education courses since 2004. Her teaching experience spans secondary schools in Venezuela, Tanzania, Bulgaria, and Papua New Guinea, enriching her global perspective.

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.