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

Mahsa Ghasemiمشاهده پروفایل

استادیار

• Reinforcement Learning
• Control Theory
• Active Perception
• +۳ مورد دیگر

Mahsa Ghasemi is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University, leading the AKADEMI Group. Her research focuses on theoretical advancements in trustworthy sequential decision-making for autonomous systems, emphasizing human-aware collaboration and adaptation to dynamic environments. She is affiliated with the Institute for Control, Optimization and Networks (ICON). Education: PhD in Electrical and Computer Engineering from The University of Texas at Austin (2021), MSE in Mechanical Engineering (2017), and BSc in Mechanical Engineering from Sharif University of Technology (2014). Research Interests: Reinforcement learning, control theory, active perception, multi-agent systems, robotics, and online learning. Applications span disaster response, healthcare, and autonomous systems design. Key methodological directions include compositional learning, human-AI collaboration, and adaptive decision-making under uncertainty. Teaching: Courses include Reinforcement Learning Theory (ECE 59500), Introduction to Reinforcement Learning (ECE 49595), and Python for Data Science (ECE 20875). Awards: Finalist for Student Best Paper Award at the 2018 American Control Conference (ACC). Students: Current advisees include Maheed H. Ahmed, Jayanth Bhargav, and Somtochukwu Oguchienti. Past members include Lai Wei and Juan Sebastian Mateo Ruiz Bulla. Service: Editorial roles at ICRA, ICCPS, and IFAC workshops. Reviewer for top conferences (NeurIPS, ICML) and journals (Automatica, IEEE TAC). Labs/Teams: Leads the AKADEMI Group, focusing on algorithmic and theoretical research in autonomous decision-making systems.

Tarun Sabarwalمشاهده پروفایل

استاد

• Game Theory
• Microeconomic Theory
• Strategic Complementarities
• +۵ مورد دیگر

Tarun Sabarwal is a Professor of Economics at the University of Kansas and Director of the Center for Analytical Research in Economics. He has held leadership roles including Associate Chair (2016-20) and Director of Graduate Programs (2016-20), while maintaining active research in game theory and microeconomic theory since joining KU in 2000. Education Ph.D. Economics, University of California at Berkeley, 2000 M.A. Math, University of California at Berkeley, 1999 M.B.A. Finance, University of Cincinnati, 1991 B.Comm. (Hon.), Punjabi University, 1989 Research Focus His work centers on strategic complementarities/substitutes and monotone methods in game theory, exploring equilibrium analysis in interdependent decision-making contexts. Key contributions include lattice-based frameworks for network contagion, directional comparative statics, and robust equilibrium characterization across diverse economic environments. Publication Trends Recent publications (2020-2025) demonstrate consistent focus on extending monotone game theory to network contagion dynamics, financial stability, and antitrust applications. His work bridges abstract mathematical economics with real-world policy implications through rigorous lattice-theoretic approaches. Awards Marquis Who's Who in America (2022-present) Economic Theory Fellow of SAET (2020-present) Berkeley Lectures on Monotone Games (2022) De-Min and Chin-Sha Wu Faculty Award (2018-20) Advising and Service Sabarwal has mentored 22 undergraduate researchers including honors thesis students and NSF/Sloan-funded field researchers. He serves as Associate Editor for the International Journal of Economic Theory and chairs key committees including Promotion and Tenure (2022-23). Research Infrastructure As Director of the Center for Analytical Research in Economics, he leads interdisciplinary initiatives and founded the Colloquium seminar series, fostering global collaboration among economists from institutions including Johns Hopkins, Caltech, and Stanford.

• Singular Stochastic Optimal Control
• Optimal Stopping and Free-Boundary Problems
• Stochastic Games
• +۶ مورد دیگر

Giorgio Ferrari is a Full Professor for Mathematical Finance at the Institute for Mathematical Economics (IMW), Faculty of Economics, Bielefeld University. His research bridges stochastic control theory with applications in economics, finance, actuarial science, and epidemiology. Education: B.Sc. and M.Sc. in Physics and Mathematical Physics from the University of Rome La Sapienza, Ph.D. in Mathematics for Economic-Financial Applications (2012). Academic Appointments: Post-Doctoral Researcher (2012–2015), Substitute Full Professor (2015), Junior Professor (W1) (2016–2017), Associate Professor (2017–2023), and Full Professor (2023–present) at Bielefeld University. Research Interests focus on Singular Stochastic Control , Optimal Stopping , and Stochastic Games , with applications to economic policy, financial markets, and epidemic modeling. His work extends to Mean-Field Games for large-scale strategic interactions and Free-Boundary Problems for investment decision-making under uncertainty. Scientific Contributions include groundbreaking publications in Stochastic Processes and their Applications , Mathematical Finance , and SIAM Journal on Control and Optimization . His research projects, such as the DFG SFB 1283 subproject C4 and the Research Training Group 2865 , address uncertainty in dynamic economies through game-theoretic and stochastic frameworks. Notable Awards: AMASES Best Young Researcher Paper (2014), YITP Research Prize (2017), and multiple research fellowships from the University of Padova. Leadership: Director of the Bielefeld Graduate School in Theoretical Sciences (2023–present) and Principal Investigator in major DFG-funded initiatives.

Sara Bernardiniمشاهده پروفایل

استاد

• Artificial Intelligence
• Automated Planning
• Robotics
• +۴ مورد دیگر

Professor Sara Bernardini is a leading academic in Artificial Intelligence at the University of Oxford's Department of Computer Science, where she holds a joint appointment as a Tutorial Fellow at Mansfield College. Her research specializes in decision-making for autonomous systems, automated planning, and robotics, with applications in extreme environments like space missions, nuclear decommissioning, and offshore energy. She bridges theoretical AI with real-world challenges through projects funded by Innovate UK, EPSRC, NERC, and the Alan Turing Institute. Her research interests span: Autonomous Systems : Developing agents that support humans in complex cognitive tasks. Automated Planning : Algorithms for goal recognition, pathfinding, and multi-agent coordination. Robotics : Solutions for subterranean exploration, offshore wind farms, and UAV operations. AI Safety : Risk-aware autonomous systems and interpretable decision-making. Bernardini's publications emphasize algorithmic robustness in path planning, multi-agent coordination , and real-world AI deployments . Recent work explores goal legibility in uncertain environments, energy-efficient robotics, and AI education tools. Her 65+ papers in top venues (e.g., AIJ, JAIR, ICAPS) show a trend toward safety-critical applications and human-AI collaboration. Awards & Leadership: ICAPS-2020 Best Paper Honorable Mention Executive Council Member, Association for the Advancement of Artificial Intelligence (AAAI) Program Chair, International Conference on Automated Planning and Scheduling (ICAPS 2024) Associate Editor, Artificial Intelligence Journal She leads interdisciplinary teams for projects like autonomous offshore wind farm maintenance and modular robots for extreme environments. As Principal Scientist at the UK National Oceanography Centre, she advanced marine robotics. She mentors PhD candidates and collaborates globally (e.g., NASA Ames, MIT).

Andreas S. Schulzمشاهده پروفایل

استاد

• Mathematical Optimization
• Algorithm Design
• Operations Research
• +۵ مورد دیگر

Prof. Dr. Andreas S. Schulz is a faculty member at Technische Universität München (TUM), holding a chair in the Department of Mathematics and the Department of Business and Economics. He previously served as the Patrick J. McGovern Chair of Management and Professor of Mathematics at MIT. His research focuses on mathematical optimization, algorithm design, and their applications in logistics, production, healthcare systems, and online advertising. He has held visiting professorships at institutions such as the Sauder School of Business (UBC) and ETH Zurich. Prof. Schulz’s research bridges operations research, theoretical computer science, and economics. He develops analytical methods to solve complex decision-making problems in business, including scheduling, resource allocation, and network optimization. A key interest is applying mathematical approaches to enhance healthcare delivery and system efficiency. Education: PhD in Operations Research (MIT), prior academic roles at MIT and visiting institutions. Key Achievements: Alexander von Humboldt Professorship (2014), Humboldt Research Award (2010), Glover-Klingman Prize (2006). Research Themes: Robust optimization, approximation algorithms, scheduling theory, and algorithmic game theory. His publications span topics like integer programming, optimal transport, and congestion games. He collaborates across disciplines, emphasizing practical applications of theoretical insights.

Jonathan Weareمشاهده پروفایل

استاد

• Monte Carlo sampling
• Multiscale analysis
• Randomized numerical linear algebra
• +۲ مورد دیگر

Jonathan Weare is a Professor of Mathematics at the Courant Institute of Mathematical Sciences, New York University. He holds affiliations with the Faculty of Arts and Science and the Graduate School of Arts and Science. His academic journey includes roles as an Associate Professor at the University of Chicago (2014–2019) and Assistant Professor (2011–2014), following postdoctoral work as a Courant Instructor at NYU. He earned his Ph.D. in Mathematics from UC Berkeley in 2007. His research focuses on stochastic algorithms and models, with applications in astrophysics, biophysics, computational chemistry, and climate science. Key areas include Monte Carlo methods, rare event simulation, and machine learning-driven scientific analysis. Collaborations with domain experts ensure his work addresses real-world challenges in diverse fields. Recent publications emphasize advancements in trajectory stratification, rare event prediction using machine learning, and efficient algorithms for high-dimensional problems. Notable contributions include the BAD-NEUS framework and AI-based solar system instability predictions. His group’s interdisciplinary approach bridges computational methods with scientific inquiry. Weare has advised numerous students and mentored postdocs, fostering talent in applied mathematics and computational science. His work on Mercury’s orbital dynamics and extreme weather prediction showcases the societal impact of his research. Current projects explore AI applications in weather modeling and rare event analysis, leveraging cutting-edge machine learning techniques. Labs/Teams: His research group at Courant develops stochastic algorithms and collaborates with interdisciplinary teams in computational chemistry, climate science, and astrophysics. Key collaborations include the University of Chicago and Columbia University.

• Operations Research
• Management Science
• Dynamic Pricing
• +۴ مورد دیگر

Arash Asadpour Rahimabadi is an Associate Professor at the N. P. Loomba Department of Management within the Zicklin School of Business at Baruch College, CUNY . His research bridges Operations Research and Management Science , focusing on algorithmic design, dynamic pricing, and optimization in gig economy platforms. Education: Ph.D. in Operations Research, Stanford University (2010) BSc in Computer Engineering, Sharif University of Technology (2004) His research interests include stochastic optimization , submodular maximization , marketplace stability , and fair allocation . Recent work explores dynamic pricing in extreme value regimes , shared ride sustainability , and regulation of gig economy platforms . His scientific contributions span algorithmic game theory, combinatorial optimization, and resource allocation, with key publications in Management Science and Operations Research . Current projects analyze escrow payment mechanisms , shared mobility efficiency , and hotel reservation systems . Scientific Awards Best Paper Award, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010 1st Rank in Iran’s National Graduate Entrance Exam in Computer Engineering, 2004 Silver Medals in Iranian National Olympiads in Informatics, 1999–2000 He serves on graduate and PhD committees at CUNY and has reviewed for journals including Management Science and Operations Research . His teaching includes courses like Decision Models and Analytics and Advanced Discrete Optimization .

Laura Sanitàمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Approximation Algorithms
• Network Design
• +۳ مورد دیگر

Laura Sanità is an Associate Professor in the Department of Computing Sciences at Bocconi University, Milano, Italy. She previously held academic positions at TU Eindhoven (Netherlands) and the University of Waterloo (Canada). Education: Bachelor's in Management Engineering (2003), Università di Roma Tor Vergata Master's in Management Engineering (2005), Università di Roma Tor Vergata PhD in Operations Research (2009), Università Sapienza di Roma Postdoctoral Fellow at EPFL (Switzerland, 2009-2011) Laura's research focuses on discrete mathematics, theoretical computer science, and operations research, with particular emphasis on algorithmic solutions for combinatorial optimization problems. Her work spans approximation algorithms, network design, polyhedral combinatorics, and algorithmic game theory, advancing methodologies for solving complex optimization challenges in theoretical and applied contexts. Her publications demonstrate expertise in network design problems, spanning from fundamental polyhedral characterizations to game-theoretic applications. Key contributions include iterative randomized rounding techniques for Steiner trees, circuit augmentation algorithms, and stabilization approaches for network games. Scientific Awards: NWO-VIDI Award (Netherlands) Discovery Accelerator Supplements Award (NSERC, Canada) Golden Jubilee Research Excellence Award (University of Waterloo) Early Researcher Award (Ontario) Best Paper Award at STOC 2010 Advising & Collaborations: Laura advises PhD students Dylan Hyatt-Denesik and Lucy Verbeck, and collaborates with postdoctoral researchers like Afrouz Jabal Ameli. She has served on program committees and as Associate Editor for top journals including Mathematical Programming, Mathematics of Operations Research, and Operations Research Letters.

Fabio Furiniمشاهده پروفایل

دانشیار

• Combinatorial Optimization
• Operations Research
• Integer Linear Programming
• +۳ مورد دیگر

Fabio Furini is an Associate Professor at the Department of Computer Science, Automatics, and Management (DIAG) at Sapienza University of Rome since September 2021. Prior to this position, he served as a CNR researcher at IASI-CNR in Rome (2020-2021), Maître de Conférences at Université Paris-Dauphine, France (2013-2019), postdoctoral researcher at Université Paris-13, France (2012-2013), and research fellow at the University of Bologna (2011-2012). His educational background includes a Ph.D. in Control Engineering and Operations Research from the University of Bologna in 2011. He further obtained the Habilitation à Diriger des Recherches (HDR) in France in 2017 and the National Scientific Qualification for Full Professor in Operations Research in Italy in 2019. Fabio Furini conducts theoretical and methodological research on Combinatorial Optimization and Operations Research. His primary focus is on developing exact algorithms based on decomposition and reformulation techniques for integer linear programming problems. His research spans various applications including network optimization, graph theory, and combinatorial problems such as the maximum clique problem, bin packing problem, and vertex separator problem. His work often bridges theoretical developments with practical applications in transportation, logistics, and network security. His recent publications demonstrate a strong focus on exact algorithms for combinatorial optimization problems, particularly in network interdiction, bin packing with temporal constraints, and graph-based problems. His work consistently combines integer programming techniques with combinatorial search methods to develop novel formulations and efficient solution approaches that advance the state-of-the-art in these domains. Among his notable scientific awards are the Prime d'encadrement doctoral et de recherche (PEDR), which he received annually from 2014 to 2020, recognizing him among the top 15% of researchers in the French university system. He also holds the prestigious Habilitation à Diriger des Recherches from France (2017) and the National Scientific Qualification for Full Professor in Operations Research from Italy (2019). Fabio Furini has been actively involved in supervising PhD students and has served as principal investigator for numerous national and international research projects. His extensive network includes over 60 co-authors across European and American universities. He is also a member of the editorial boards for three prestigious international journals: Omega, Annals of Operations Research, and Discrete Applied Mathematics. His research activities include collaborations with various institutions across Europe and the United States, including Imperial College London and the University of Colorado. These collaborations have resulted in a robust research program focused on advancing the theoretical foundations and practical applications of combinatorial optimization.

Abolfazl Hashemiمشاهده پروفایل

استادیار

• Large-Scale Optimization
• Machine Learning
• Artificial Intelligence
• +۶ مورد دیگر

Abolfazl Hashemi is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University, directing the MINDS Group. He holds a B.Sc. from Sharif University of Technology (2014), and M.S.E. and Ph.D. degrees from The University of Texas at Austin (2016, 2020). His research focuses on Large-Scale Optimization for AI/ML, Learning at the Edge, and Decision-Making under Uncertainty, with applications in Federated Learning, Medical Image Analysis, and Cyber-Physical Systems. He leads the MINDS Group and collaborates with EnCORE and ICON centers. Key research areas include optimizing algorithms for machine learning, robustness in distributed systems, and adversarial learning. He has developed algorithms with mathematical guarantees for efficient deployment under resource constraints. Teaching includes Optimization for Deep Learning (graduate) and undergraduate courses like ECE 20001. He advises the Purdue RoboMaster robotics team and has mentored students through programs like SURF and Summer Stay Scholars. Outreach activities include fostering diversity through robotics competitions and research fellowships. His work bridges theoretical optimization with practical AI applications, emphasizing equitable and robust solutions in federated and decentralized learning.

Iñaki Esnaolaمشاهده پروفایل

مدرس ارشد

• Information Theory
• Machine Learning
• Cybersecurity
• +۶ مورد دیگر

Dr. Iñaki Esnaola is a Senior Lecturer at the Department of Automatic Control and Systems Engineering, University of Sheffield, and a Visiting Research Collaborator at Princeton University. He holds a MSc from the University of Navarra (2006) and a PhD from the University of Delaware (2011). His research focuses on information theory, machine learning, and cybersecurity, particularly in cyberphysical systems like smart grids. His work addresses data integrity, privacy, robust estimation, and optimal sensor placement. Research interests include: Information theory and data science, machine learning and high-dimensional statistics, cybersecurity (especially data injection attacks), privacy, robust estimation, and sensor placement optimization. Recent projects involve empirical risk minimization with regularization, stealth attacks on control systems, and compressive sensing for environmental monitoring. Key publications include studies on relative entropy in machine learning, sensor placement for sewer networks, and stealth attacks in smart grids. He leads a research group with ongoing projects in resilient cyberphysical systems and received a UKRI grant for advanced manufacturing. His work bridges theoretical foundations with real-world applications in energy systems and environmental monitoring.

Samson Zhouمشاهده پروفایل

استادیار

• Algorithms and theory
• Data science
• Machine learning
• +۷ مورد دیگر

Samson Zhou is an Assistant Professor in the Department of Computer Science & Engineering at Texas A&M University, part of the College of Engineering. He holds a Ph.D. from Purdue University and dual B.S. and M.Eng. degrees from MIT in Computer Science and Mathematics. His research focuses on theoretical computer science, data science, and machine learning, with specializations in numerical linear algebra, streaming algorithms, and differential privacy. He has held postdoctoral positions at institutions including Carnegie Mellon University and Rice University. Education: Ph.D., Computer Science, Purdue University (2018) M.Eng., Computer Science, MIT (2011) B.S., Computer Science & Mathematics, MIT (2010-2011) Research Interests: Dr. Zhou explores intersections of algorithms, data science, and machine learning, emphasizing numerical linear algebra, streaming algorithms, differential privacy, and adversarial robustness. He designs efficient algorithms for large-scale data processing with provable guarantees. Key Contributions: His work includes advancements in sliding window clustering, adversarially robust streaming algorithms, and privacy-preserving techniques. Notable achievements include the Silver Best Paper Award at ICML 2021 and spotlight presentations at ICLR 2025. Service & Leadership: He organizes workshops (e.g., TTIC 2024 on Learning-Augmented Algorithms) and serves on program committees for SOSA, NeurIPS, and COLT. He also co-leads the TAMU Math Circle's problem-solving sessions and the Algorithms & Data Science Reading Group. Labs/Teams: He collaborates on projects involving co-hosted postdocs (e.g., Chen Wang) and masters students (e.g., Shenghao Xie), focusing on topics like coresets, streaming algorithms, and fair clustering.

• Algorithms
• Computational Complexity
• Convex Optimization
• +۴ مورد دیگر

James R. Lee is a Professor in the Department of Computer Science at the University of Washington. His research spans theoretical computer science, probability, and geometry. He has held visiting scientist roles at Microsoft Research (2023, 2018, 2017) and participated in programs at the Simons Institute (2023, 2020, 2018, 2017, 2014). Research Interests: Algorithms, complexity theory, convex optimization, metric embeddings, spectral graph theory, probability, stochastic processes, and the interplay between discrete and continuous analysis. Teaching: Courses on modern algorithms, quantum computing, optimization theory, and spectral methods in theoretical computer science. Scientific Contributions: Developed sparsification algorithms for generalized linear models and norms with near-linear size guarantees (STOC'24, FOCS'23). Extended Cheeger-type inequalities to higher eigenvalues (STOC'12, STOC'18). Proved super-polynomial lower bounds for LP/SDP relaxations in constraint satisfaction (STOC'15, FOCS'13). Disproved Benjamini-Papasoglou conjectures on annular separators (Discrete Comp. Geom. 2024). Advanced understanding of random walks in geometric and unimodular graphs (Israel J. Math. 2023, GAFA 2023). Scientific Awards: Best Paper Award, STOC 2015

Standa Živnýمشاهده پروفایل

استاد

• Theoretical Computer Science
• Discrete Mathematics
• Algorithms
• +۱۰ مورد دیگر

Standa Živný is a Professor of Computer Science at the University of Oxford and a Fellow and Tutor at Merton College. He has been a faculty member at Oxford since 2013 and was promoted to full professor in 2021. His research spans theoretical computer science and discrete mathematics, with a focus on algorithms, computational complexity, and constraint satisfaction problems (CSPs) in various forms, including optimisation, counting, and approximation. His research interests include the power and limitations of convex relaxations, sparsification, submodularity, and the algebraic and logical foundations of tractability in combinatorial problems. He has made significant contributions to understanding when and why certain problems can or cannot be efficiently solved using linear programming and other algorithmic paradigms. The recent trends in his publications show a deep engagement with approximation algorithms, hardness results, sparsification techniques, and the complexity of counting and promise problems. His work often lies at the intersection of algebra, logic, and optimisation, demonstrating the power of interdisciplinary approaches in theoretical computer science. ERC Consolidator Grant (NAASP, 2022–2027) ERC Starting Grant (PowAlgDO, 2017–2022) Royal Society University Research Fellowship (2013–2021) He actively supervises a large cohort of postdoctoral researchers and students, including PhD candidates, master’s, and undergraduate students. His leadership extends to academic service, where he serves as Editor-in-Chief of the SIAM Journal on Discrete Mathematics and holds editorial and committee positions in major journals and funding bodies. He has organised numerous workshops and research programmes at institutions such as Dagstuhl, the Isaac Newton Institute, and AIM. He is involved in major research initiatives, including a Simons Programme on symmetry in computation and an American Institute of Mathematics SQuARE on relaxations for promise CSPs.

James B. Orlinمشاهده پروفایل

استاد

• Network Optimization
• Combinatorial Optimization
• Transportation
• +۷ مورد دیگر

James B. Orlin is the E. Pennell Brooks (1917) Professor in Management and a Professor of Operations Research at the MIT Sloan School of Management. He specializes in network and combinatorial optimization with applications spanning transportation, computer science, operations, and marketing. BA in Mathematics, University of Pennsylvania MA in Mathematics, California Institute of Technology MMath, University of Waterloo PhD in Operations Research, Stanford University His research focuses on designing efficient algorithms for network optimization problems, including shortest path, max flow, and min cost flow. He has contributed to algorithmic theory in logistics, telecommunications, and inventory management, with work on stochastic demand models and data-driven inventory policies. Recent publications include advancements in directed shortest path algorithms, robust submodular function maximization, and energy storage problem complexity. His seminal textbook Network Flows: Theory, Algorithms, and Applications (1993) remains a foundational reference. Leonard G. Abraham Prize Khachiyan Prize Test of Time Award As a mentor, he has advised numerous researchers through collaborative publications and teaching. His work addresses both theoretical algorithm development and practical implementation across diverse domains including airline scheduling, logistics, and network design.