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

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

Tal Malkinمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Complexity Theory
• +۸ مورد دیگر

Tal Malkin is a Professor of Computer Science at Columbia University, directing the Cryptography Lab and serving as inaugural chair of the Cybersecurity Center at Columbia's Data Science Institute. She holds a Ph.D. from MIT (2000), joined Columbia after AT&T Labs research experience, and focuses on cryptography, security, complexity theory with applications in secure computation, zero-knowledge proofs, and privacy-preserving systems . Education: B.S. in Math and Computer Science, Bar-Ilan University M.S. in Computer Science, Weizmann Institute of Science Ph.D. in Computer Science, MIT (2000) Research Interests: Malkin's work spans foundational and applied cryptography, including homomorphic encryption, lattice-based protocols, attribute-based encryption, and tamper-resilient systems . She explores intersections with machine learning and information theory , addressing challenges in multi-party computation , public-key encryption , and side-channel resistance . Scientific Contributions: Her publications include breakthroughs in non-malleable codes , secure computation , and privacy-preserving databases . Notable works involve continual leakage resilience , optimally-fair coin tossing , and garbled circuits for efficient cryptographic protocols. Awards & Grants: Recipient of the NSF CAREER award, IBM and Google faculty research awards, and the IACR Fellow designation. Her research is funded by NSF, NSA, DHS, NYSIA, IARPA, and industry partnerships with Google, IBM, Mitsubishi, and NEC. Professional Leadership: Former conference chairs at CRYPTO 2021 , CCS 2017 , and CT-RSA conferences. Active in program committees for over 20 leading cryptography and security events, including FOCS , Eurocrypt , and Real World Crypto . Advising: Supervised numerous Ph.D. students and postdoctoral researchers, including Marshall Ball , Chengyu Lin , and Negev Shekhel Nosatzki . Her lab has mentored graduates like Ghada Almashaqbeh (2019) and Fernando Krell (2016), focusing on decentralized networks , secure learning , and cryptographic primitives .

Amin Keramatiمشاهده پروفایل

استادیار

• Transportation & Logistics
• Supply Chain Management
• Data Analytics
• +۴ مورد دیگر

Dr. Amin Keramati is an Assistant Professor of Supply Chain Management at Widener University’s School of Business Administration. He holds a PhD in Transportation & Logistics from North Dakota State University and previously served as a graduate research assistant at the Upper Great Plains Transportation Institute. His work includes federally funded projects like the Mountain-Plains Consortium’s MPC-550 project, focusing on highway-rail grade crossing safety. Dr. Keramati teaches courses in enterprise resource planning, decision analytics, database management, transportation/logistics, project management, and data analytics. Education: PhD in Transportation & Logistics, North Dakota State University Graduate Research Assistant at Upper Great Plains Transportation Institute Research Focus: Dr. Keramati develops mathematical, statistical, and machine learning approaches to solve complex problems in transportation, supply chain, and logistics. Key areas include data mining, big data decision support, transportation network analytics, project scheduling, smart manufacturing, and accident analysis. His interdisciplinary work bridges supply chain optimization with emerging technologies like blockchain for healthcare and clinical trials. Awards & Recognition: Student Paper Award, American Association of State Highway and Transportation Officials (2017) Grants & Projects: Lead researcher on the Mountain-Plains Consortium’s MPC-550 project, which expanded his dissertation work on safety systems for highway-rail crossings. Collaborates on federally funded transportation safety initiatives and supply chain optimization for bioethanol and pharmaceutical industries. Labs/Teams: Active in Widener’s School of Business research groups focusing on supply chain innovation and interdisciplinary projects combining logistics with emerging technologies.

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

استاد

• Algorithms
• Combinatorial Optimization
• Operations Research
• +۴ مورد دیگر

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

Andrea Coladangeloمشاهده پروفایل

استادیار

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +۳ مورد دیگر

Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.

Moe Z. Winمشاهده پروفایل

استاد

• Wireless communications
• Optical communications
• Space communications systems
• +۲ مورد دیگر

Moe Z. Win is the Robert R. Taylor Professor at the Massachusetts Institute of Technology (MIT), specializing in wireless communications, optical communications, and space communications systems. His research bridges theoretical and applied domains, including quantum sensing, network localization, and signal processing. B.S.E.E., Texas A&M (1987) M.S.E.E. & Ph.D., University of Southern California (1989, 1998) Recent work focuses on quantum-enhanced positioning, machine learning for localization, and next-generation (xG) non-terrestrial networks. He leads research at the Quantum neXus Laboratory (QX Lab), Wireless Information & Network Sciences Lab, and Laboratory for Information and Decision Systems. His career spans the Jet Propulsion Laboratory (1987-1995) and AT&T Research Laboratories (1998-2002). Key methodologies include soft information fusion, variational quantum sensing, and robust beam tracking for terahertz communications.

Lijie Chenمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +۴ مورد دیگر

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

Florentina Buneaمشاهده پروفایل

استاد

• Statistical machine learning theory
• High-dimensional statistical inference
• Optimal transport
• +۶ مورد دیگر

Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449

Dean Ecklesمشاهده پروفایل

دانشیار

• Social Influence
• Network Analysis
• Causal Inference
• +۴ مورد دیگر

Dean Eckles is an Associate Professor of Marketing at MIT Sloan School of Management and serves as an Associate Director of the MIT Institute for Data, Systems, and Society (IDSS). He is also affiliated with the MIT Schwarzman College of Computing through the Institute for Data, Systems & Society and its Statistics and Data Science Center. Additionally, he leads the analytics research area at the Initiative on the Digital Economy and organizes the annual Conference on Digital Experimentation (CODE@MIT). His educational background includes a BA in philosophy, BS and MS in cognitive science, MS in statistics, and PhD in communication, all from Stanford University. Prior to joining MIT, Eckles worked as a scientist at Facebook, where he contributed to areas including News Feed, messaging, advertising, tools for randomized experiments, and survey methods. He previously held research positions at Nokia and Yahoo. Eckles's research primarily focuses on social influence mediated by interactive technologies, examining how communication technologies mediate, amplify, and direct social influence. His work spans multiple specific areas including social interactions, contagion, and interventions in networks; experimental design and inference in networks; and methods for causal inference. His research often combines social science with advanced statistical methods. His notable publications include research on long ties in social networks and their relationship to economic prosperity, how network structure affects social contagions, and algorithmic transparency in social media platforms. His work has appeared in prestigious journals including PNAS and Nature Human Behaviour, and he has provided expert testimony before the US Senate on algorithmic ranking. Long ties, disruptive life events and economic prosperity (PNAS) Long ties accelerate noisy threshold-based contagions (Nature Human Behaviour) Algorithmic transparency and assessing effects of algorithmic ranking (Senate testimony) Eckles actively shares his research through social media platforms including Bluesky, Twitter, and Mastodon, as well as through his blog and contributions to the Gelman et al. blog. His work bridges academic research with practical applications in technology and policy.

• Machine Learning
• Artificial Intelligence
• Algorithms
• +۳ مورد دیگر

Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.

Martin T. Wellsمشاهده پروفایل

استاد

• Applied Statistics
• Theoretical Statistics
• Bayesian Statistics
• +۷ مورد دیگر

Martin T. Wells is the Charles A. Alexander Professor of Statistical Sciences at Cornell University, with joint appointments in the Department of Statistical Science, Department of Biological Statistics and Computational Biology, Department of Social Statistics, and as Professor of Clinical Epidemiology and Health Services Research at Weill Medical School. He serves as Editor-in-Chief of the ASA-SIAM Book Series and Co-Editor of the Journal of Empirical Legal Studies. Cornell University, Ithaca, NY Weill Cornell Medical College Research Interests span applied and theoretical statistics, Bayesian methods, biostatistics, clinical epidemiology, and computational biology. His work bridges disciplines like finance, legal studies, and health services research. Article Trends highlight advancements in Bayesian modeling, quantum cognition machine learning, tensor analysis, and misclassification correction, with applications in genomics, finance, and public health. Fellow of the American Statistical Association Fellow of the Royal Statistical Society Contributions include developing statistical software (e.g., rTensor), methodological innovations in clinical trials, and empirical legal studies on civil rights and the death penalty.

Jacob Foxمشاهده پروفایل

استاد

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

Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.

• Uncertainty Reasoning and Decision Making in Artificial Intelligence
• Electronic Business
• Systems Analysis and Design
• +۷ مورد دیگر

Liping Liu is a Professor in the Department of Management at The University of Akron's College of Business. He holds a Ph.D. in Business from the University of Kansas (1995), Master of Engineering in Systems Engineering (1991), and dual bachelor's degrees in Applied Mathematics (1986) and River Dynamics (1987). Ph.D., University of Kansas MS, Huazhong University of Science and Technology B.E., Wuhan University BS, Huazhong University of Science and Technology His research spans Artificial Intelligence , Electronic Business , Systems Analysis , Data Quality , and Belief Function Theory . He pioneered coarse utility theory and linear belief functions , now taught in top Ph.D. programs across multiple disciplines. Key trends in his publications include Belief Function Applications (2012-2024), Medical Data Systems (2003-2015), and Decision Theory (2004-2014). Recent works focus on Gamma Belief Functions (2024) and computational improvements in linear belief function operations (2019-2016). Scientific contributions recognized via: Microsoft Azure Educator Grant (2014-2016) Inclusion in Who's Who in America (2010-2013) and Who's Who in the World (2011-2013) As an editor and committee member for major conferences (INFORMS, AMCIS, Belief Functions conferences), he bridges academic research with practical systems implementation in e-business and healthcare domains.

Sendhil Mullainathanمشاهده پروفایل

استاد

• Behavioral Science
• Economics
• Machine Learning
• +۷ مورد دیگر

Sendhil Mullainathan is the Roman Family University Professor of Computation and Behavioral Science at the University of Chicago Booth School of Business and a Professor of Economics and the Peter de Florez Professor of EECS at the Massachusetts Institute of Technology . His work bridges machine learning , behavioral science , and computational medicine , focusing on social problems like discrimination , poverty , and health equity . Research Interests : Behavioral economics, algorithmic fairness, poverty, AI in healthcare, and policy evaluation. Teaching : Courses on Artificial Intelligence and Algorithmic Solutions to Human Problems. Publications : Over 150 papers in journals like Science , Quarterly Journal of Economics , and Nature Medicine , with recent work on AI-driven healthcare disparities and behavioral economics. Scientific Awards : MacArthur ‘Genius’ Grant, Infosys Prize, ‘Top 100 Thinker’ (Foreign Policy Magazine), ‘Young Global Leader’ (World Economic Forum). Organizations : Co-founder of ideas42 (behavioral science non-profit), J-PAL (randomized trials in development), and Dandelion Health (healthcare data for AI). Serves on the MacArthur Foundation board.