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

Osman Yağanمشاهده پروفایل

استاد پژوهشی

• Machine Learning
• Data Science
• Network Science
• +۷ مورد دیگر

Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.

Daniel Dominic Kaplan Sleatorمشاهده پروفایل

استاد

• Algorithms
• Data Structures
• Theoretical Computer Science
• +۵ مورد دیگر

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

Nihar B. Shahمشاهده پروفایل

دانشیار

• Machine Learning
• Peer Review Systems
• Algorithmic Fairness
• +۴ مورد دیگر

Nihar B. Shah is an Associate Professor at Carnegie Mellon University with joint appointments in the Machine Learning and Computer Science departments within the School of Computer Science. His research focuses on developing theoretically grounded algorithms for evaluating scientific work, with applications in peer review, fairness, and human-AI collaboration. His work has impacted over 100,000 research papers and grant evaluations. Education: Ph.D. in EECS, UC Berkeley M.E. in Telecommunications, Indian Institute of Science B.Tech. in Electronics, NIT Karnataka Research Interests: Shah's group investigates the science of evaluation through machine learning, optimization, and large-scale experiments. Key areas include peer review systems, algorithmic fairness, LLM applications in science, and human-AI collaboration frameworks. Research addresses fundamental questions about research validity, funding allocation, and equitable assessment. Publication Trends: Recent work focuses on improving peer review through randomized controlled trials, security against collusion, LLM-based review systems, and bias mitigation. Publications consistently appear in premier venues (NeurIPS, PLOS ONE, AAAI) with growing emphasis on real-world deployments. Awards & Honors: Young Alumnus Medal (IISc 2024) NSF CAREER Award (2020-2025) Google Research Scholar Award (2021) Multiple best paper awards (HCOMP, ICLR) Research Group & Funding: Leads a focused research team with NSF, Google, and JP Morgan support. Alumni hold positions in academia and industry. Current projects involve large-scale evaluations of scientific work and algorithmic fairness.

Kathryn Roederمشاهده پروفایل

استاد

• Statistical Genetics
• Genomics
• Biostatistics
• +۵ مورد دیگر

Kathryn Roeder is the UPMC University Professor of Statistics and Life Sciences at Carnegie Mellon University (CMU), affiliated with the Dietrich College of Humanities and Social Sciences and the Departments of Statistics & Data Science and Computational Biology. Her research focuses on developing statistical methods for genetic and genomic data, particularly in identifying autism risk genes and analyzing single-cell multi-omic data. She earned her Ph.D. in Statistics from Penn State University and has been at CMU since 1994, previously serving as Vice Provost for Faculty (2015–2019). Education: Ph.D. in Statistics, Penn State University (1988) B.S. in Wildlife Resources, University of Idaho (1982) Research Interests: Her work integrates modern statistical techniques (high-dimensional statistics, machine learning, networks) to study complex diseases like autism and schizophrenia. Recent efforts include tools for analyzing single-cell RNA-seq and proteomic data, such as UNICORN, DAWN, and SCEPTRE. Key Awards: COPSS Distinguished Achievement Award (2020) National Academy of Sciences Member (2019) COPSS Presidents’ Award (1997) AAAS Fellow (2020) Advising & Grants: She has advised over 20 Ph.D. students, many contributing to landmark studies in autism genetics. Her grants include NIH funding for projects like the Autism Sequencing Consortium. Current research teams focus on computational biology and statistical genetics. Labs & Collaborations: Her lab develops software tools (e.g., TADA, MIND) and collaborates with the Autism Sequencing Consortium and iPSYCH-BROAD Consortium on large-scale genomic studies.

• Theoretical Computer Science
• Error-Correcting Codes
• Approximation Algorithms
• +۴ مورد دیگر

Venkatesan Guruswami is a Chancellor's Professor in the Department of Electrical Engineering and Computer Sciences and Professor in the Department of Mathematics at the University of California, Berkeley. He previously served as faculty at Carnegie Mellon University for 13 years and held a Miller Research Fellowship at UC Berkeley. His research focuses on Theoretical Computer Science , particularly in Error-Correcting Codes , Approximation Algorithms , Quantum Computing , and Hardness of Approximation . Guruswami has made groundbreaking contributions to list decoding and quantum code constructions, with works featured in Science Magazine and the Journal of the ACM (where he serves as Editor-in-Chief). Education : B.Tech (1997, IIT Madras), Ph.D. (2001, MIT), Miller Research Fellowship (2001-02, UC Berkeley) Research Areas : Theory of error-correcting codes, approximation algorithms, pseudorandomness, probabilistically checkable proofs, and quantum coding theory Guruswami's recent work explores quantum LDPC codes , parameterized inapproximability , and stream decodable codes . He has received prestigious awards including the NSF CAREER award , David and Lucile Packard Fellowship , and Sloan Research Fellowship . His advising spans a wide range of students and postdocs, with notable contributions to coding theory and computational complexity .

Yihan Sunمشاهده پروفایل

استادیار

• Parallel Computing
• Algorithms
• Data Structures
• +۱۲ مورد دیگر

Yihan Sun is an Assistant Professor at the University of California, Riverside (UCR) since January 2020. He earned his Ph.D. in Computer Science from Carnegie Mellon University (CMU) , advised by Guy Blelloch , and holds a Bachelor's degree in Computer Science from Tsinghua University . Research Interests: Yihan Sun focuses on the theory and practice of parallel computing , including Parallel algorithms and data structures Write-efficient algorithms for Non-Volatile Memory (NVM) Computational geometry (range trees, Delaunay triangulations) Graph algorithms (SSSP, SCC, cluster-based BFS) Concurrent and persistent data structures Multi-version concurrency control (MVCC) with garbage collection Applications in databases, transactional systems, and computational biology Recent Research Trends: His work on join-based parallel balanced trees has been foundational, supporting four balancing schemes (AVL, red-black, weight-balanced, treaps) and enabling efficient implementations in graph analytics, spatial queries, and dynamic programming. Recent publications focus on output-sensitive algorithms , scalable graph libraries (PASGAL) , and pedagogical approaches to teaching parallel algorithms. Teaching: He teaches CS260 (Parallel Algorithms) at UCR and has served as a guest lecturer for MIT 6.886 (Algorithm Engineering) and CMU 15-859 (Algorithms in the real world) . He also contributed to algorithm education through a tutorial at the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP 2019) . Labs & Collaborations: Yihan is a core contributor to the PAM (Parallel Augmented Maps) library, which has been integrated into systems like Aspen (graph-streaming) and C-trees . He collaborates with teams at CMU-Parlay , PBBS , and Ligra , with his code available on Github for community feedback.

• Algorithms
• Data Streams
• Machine Learning
• +۳ مورد دیگر

David P. Woodruff is a Professor in the Department of Computer Science at Carnegie Mellon University, part of the Theory Group within the School of Computer Science. He is actively involved in academic leadership roles, including chairing the CATCS (Conference on Theoretical Computer Science) and serving as PC chair for SODA 2024 and ICALP 2022. His research focuses on algorithms, data streams, machine learning, numerical linear algebra, sketching, and sparse recovery. He has been recognized with awards such as the Herbert Simon Award for teaching and the PODS Best Paper Award. Woodruff has advised numerous students and postdocs, including notable scholars like Ainesh Bakshi, Rajesh Jayaram, and Hongyang Zhang. His work often addresses foundational challenges in theoretical computer science, with contributions to distributed computing, streaming algorithms, and privacy-preserving techniques. He has published extensively in top conferences like NeurIPS, ICML, FOCS, and STOC, covering topics ranging from low-rank approximation to adversarial robustness in data streams. His teaching includes courses like Algorithms for Big Data and core algorithms courses, reflecting his commitment to both research and education. Collaborations span academia and industry, with applications in genomics and secure computation. Woodruff is a key contributor to the Foundations of Data Science program at the Simons Institute.

Gary L Millerمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algorithms
• Computational Geometry
• +۴ مورد دیگر

Gary L. Miller is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. His research focuses on Spectral Graph Theory, Algorithms, Computational Geometry, and Scientific Computing. He has developed influential methods in graph partitioning, mesh generation, and numerical linear algebra solvers. Teaching includes advanced courses like Spectral Graph Theory, Algorithms, and Computational Geometry. Active in publishing, recent work involves weighted Cheeger inequalities, exact manifold metric computations, and adaptive graph sketching techniques. Projects include Orasis, 3D Meshing Software, Tumble, and Sangria. His work bridges theoretical foundations with applications in machine learning, image processing, and scientific computing. Current projects emphasize efficient graph algorithms and scalable numerical methods.

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

استادیار

• Econometrics
• Statistics
• Machine Learning
• +۵ مورد دیگر

Shuangning Li is an Assistant Professor of Econometrics and Statistics at the University of Chicago's Booth School of Business. He holds a Ph.D. from Stanford University's Department of Statistics, advised by Professors Emmanuel Candès and Stefan Wager, and a Bachelor of Science from the University of Hong Kong. Prior to his current role, he was a postdoctoral fellow in Statistics at Harvard University. His research focuses on causal inference, machine learning, and statistical methodology with applications in econometrics, networks, and genomics. **Education:** Ph.D. in Statistics, Stanford University (Advisors: Emmanuel Candès, Stefan Wager) Bachelor of Science, University of Hong Kong **Research Interests:** Causal inference in complex systems (e.g., networks, high-dimensional data) Statistical methods for experimental design and robustness Machine learning applications in genomics and reinforcement learning Randomization-based testing and knockoff filters **Recent Work Trends:** His articles emphasize methodological innovations in causal effect estimation, network interference modeling, and transfer learning. Recent work addresses challenges in stochastic congestion, multi-environment analysis, and cooperative learning frameworks. His 2024 paper advances covariate shift correction for conditional randomization tests, while his 2023 studies explore robustness in model-X inference and dyadic reinforcement learning dynamics. **Advising & Academic Background:** His doctoral training under Candès and Wager shaped his focus on rigorous statistical foundations. He has not yet listed advising relationships in available materials, but his research collaborations span academia and industry.

Reza Zadehمشاهده پروفایل

استاد مدعو

• Machine Learning
• Distributed Computing
• Discrete Mathematics
• +۷ مورد دیگر

Reza Zadeh is a Computational Mathematics professor at Stanford University's School of Engineering and Founder & CEO of Matroid . He previously served as a Technical Advisory Board member for Databricks and leads the Spark Tutorial at Stanford. Research Interests: Specializing in Machine Learning and Distributed Computing , his work bridges theoretical mathematics with practical implementations in big data systems. Key focus areas include Optimization of Apache Spark 3D Convolutional Neural Networks Discrete Mathematics and Graph Theory Medical Imaging Applications Academic Contributions: His publications reveal trends across multiple disciplines: Adapting machine learning for medical diagnostics (2019-2022) Advancing distributed computing frameworks (2014-2016) Developing mathematical foundations for social networks (2009-2013) Creating scalable optimization algorithms (2014-2016) Scientific Awards: Best Paper Award runner-up at KDD 2016 Academic Leadership: He has taught SMACC Consulting and designed courses including CME 323: Distributed Algorithms and Optimization (2015-2024) and CME 305: Discrete Mathematics and Algorithms (2010-2017). His lectures cover graph theory, approximation algorithms, and spectral sparsification. Labs & Teams: Organized Spark Summit workshops and leads Scaled Machine Learning Conference . Collaborates with Stanford's ICME computational consulting services.

Clinton Conleyمشاهده پروفایل

دانشیار

• Descriptive Set Theory
• Ergodic Theory
• Combinatorics
• +۴ مورد دیگر

Clinton Conley is an Associate Professor and Director of Graduate Studies in the Department of Mathematical Sciences at Carnegie Mellon University, part of the Mellon College of Science. He holds a Ph.D. in Mathematics from UCLA and has held postdoctoral appointments at the Kurt Gödel Research Center (Vienna, Austria) and Cornell University. His research focuses on descriptive set theory, measurable group actions, and Borel graphs, exploring intersections with ergodic theory, combinatorics, and set theory. Key research areas include measurable chromatic numbers, Borel combinatorics, and hyperfinite equivalence relations. His work often bridges abstract set-theoretic principles with concrete problems in dynamics and graph theory. Notable awards include the Julius Ashkin Award. Education: Ph.D. in Mathematics, University of California, Los Angeles Postdoctoral Appointments: KGRC (Vienna), Cornell University Recent publications span topics like measurable regular subgraphs, quasi-invariant measures, and hyperfiniteness in Borel combinatorics. Teaching includes advanced courses on descriptive set theory, set theory, and mathematical paradoxes. Advising and grants sections remain unspecified in available data. No lab or team affiliations are noted.

Anil Adaمشاهده پروفایل

استاد آموزشی

• Theoretical Computer Science
• Education
• Communication Complexity
• +۵ مورد دیگر

Anil Ada is an Associate Teaching Professor at the Computer Science Department of Carnegie Mellon University . He was born in Istanbul and completed his B.Sc. (Hon.), M.Sc., and Ph.D. in Mathematics and Computer Science at McGill University , advised by Denis Thérien and Hamed Hatami. Research Focus : Theoretical computer science with an emphasis on communication complexity, circuit complexity, and the intersection of structure vs randomness in computation. Education : B.Sc. (Hon.) in Mathematics and Computer Science from McGill University M.Sc. in Computer Science from McGill University Ph.D. in Computer Science from McGill University Academic Contributions : His research has explored foundational questions in computational complexity, including pseudorandomness, Boolean function analysis, and additive combinatorics. He has published in venues such as Computational Complexity , ICALP , and International Journal of Foundations of Computer Science . Teaching Innovation : He developed Panda Notes , a web application combining document collaboration with AI-assisted educational tools. He teaches courses like 15-251: Great Ideas in Theoretical Computer Science and 15-155: The Computational Lens , with prior teaching roles at McGill University.

David S. Choiمشاهده پروفایل

دانشیار

• Statistics
• Machine Learning
• Network Analysis
• +۵ مورد دیگر

David S. Choi is an Associate Professor at Heinz College, Carnegie Mellon University, which houses the Schools of Public Policy and Information Systems. He maintains a courtesy appointment in the Department of Statistics at the same institution. His academic credentials include a Ph.D. in Electrical Engineering from Stanford University under Benjamin Van Roy. Professional experience encompasses roles as a technical staff member at MIT Lincoln Laboratory, postdoctoral research at Harvard University's School of Engineering, and a visiting postdoc at UC Berkeley's Department of Statistics. Choi's research centers on statistical and machine learning methodologies for network-structured data. His work pioneers community detection techniques, latent variable network modeling, unsupervised learning frameworks, and causal inference methods that account for interference in social networks. These innovations address fundamental challenges in analyzing interconnected systems across public policy, healthcare, and social sciences. Publication analysis reveals consistent contributions to causal inference in networked experiments, particularly in characterizing interference and spillover effects. His scholarship spans network clustering algorithms, biological network modeling, and policy evaluation methodologies, with impactful work published in Journal of the American Statistical Association, PNAS, and Annals of Statistics. No scientific awards were documented in the source material. The available information does not reference doctoral students supervised or research grants managed by Professor Choi. Specific research laboratories or collaborative teams were not mentioned in the provided documentation.

Marios Savvidesمشاهده پروفایل

استاد

• Biometric Identification
• Artificial Intelligence
• Machine Learning
• +۵ مورد دیگر

Marios Savvides is the Bossa Nova Robotics Professor of Artificial Intelligence and a Full Tenured Professor in the Electrical and Computer Engineering Department at Carnegie Mellon University (CMU). He is also the Founder and Director of the CyLab Biometrics Center. His research focuses on AI algorithms for biometrics, facial recognition, iris scanning, and object detection under challenging conditions. He holds a BEng from the University of Manchester, an MS in Robotics from CMU, and a PhD in Electrical and Computer Engineering from CMU. Education: BEng, Microelectronics Systems Engineering, University of Manchester Institute of Science and Technology (1997) MS, Robotics, Carnegie Mellon University (2000) PhD, Electrical and Computer Engineering, Carnegie Mellon University (2004) Research Interests: Core AI and machine learning for robust biometric systems Long-range iris capture and matching Low-shot object detection and scene understanding Applications in retail automation, airport security, and medical imaging Key Achievements: Recipient of seven Best Paper Awards and the 2022 PIPLA Inventor of the Year Recipient of the 2015 Edison Gold Award, 2018 Immigrant Entrepreneur Award, and 2020 AI Excellence Award Developed AI algorithms deployed in over 3 million ADT security cameras and Bossa Nova robots Spun off startups including HawXeye and Oosto, serving as CTO/Chief AI Scientist Grants and Partnerships: Collaborations with Bossa Nova Robotics, Egen, UltronAI, and CMKL University Research on facial recognition for stock market prediction and medical imaging privacy risks Labs and Teams: Director of the CyLab Biometrics Center Member of IEEE Biometric Council and contributor to the IEEE Certified Biometrics Professional program

• Experimental Mathematics
• Artificial Intelligence
• Legal aspects of technology
• +۴ مورد دیگر

Michael Ian Shamos is a Distinguished Career Professor at Carnegie Mellon University's School of Computer Science, with appointments in the Language Technologies Institute and Software and Societal Systems Department. His career spans academia, law, and technology entrepreneurship, with expertise in experimental mathematics, artificial intelligence, and legal aspects of technology. Dr. Shamos earned his educational credentials through an impressive multidisciplinary path: A.B. in Physics from Princeton University (1968) under John Wheeler M.A. in Physics from Vassar College (1970) M.S. in Technology of Management from American University (1972) M.S. and M.Phil. in Computer Science from Yale University (1973-1974) Ph.D. in Computer Science from Yale University (1978) J.D. from Duquesne University (1981) His research interests bridge multiple domains with exceptional depth. In experimental mathematics, he develops computational systems that automatically generate and prove novel mathematical theorems, particularly in number theory, having contributed hundreds of new results to the field. As a leading expert in electronic voting security, he has examined over 120 voting systems for seven states and testified before Congress multiple times. His work uniquely integrates legal expertise with technical knowledge, especially regarding intellectual property in the digital age. He directs the M.S. in Artificial Intelligence and Innovation program at CMU, advising 74 students in this cutting-edge field. His publication trajectory reveals an evolution from foundational computational geometry (co-authoring the seminal "Computational Geometry: An Introduction") to contemporary issues in voting security and experimental mathematics. The consistent thread is applying computational methods to solve real-world problems with careful attention to legal and societal implications. His notable recognitions include: Industry Service Award of the Billiard and Bowling Institute of America (1996) Black and White Scotch Achiever's Award for contributions to bagpipe musicography (1991) As an educator and mentor, Dr. Shamos directs the M.S. in Artificial Intelligence and Innovation program and teaches courses including "AI & Future Markets" and "The Law of Computer Technology." He has served as an expert witness in over 360 legal cases involving computer technology and has been a statutory examiner of computerized voting systems for Pennsylvania since 1980. His extensive industry experience includes founding technology companies and serving as General Counsel for an AI company. Dr. Shamos is actively involved with the Universal Library project, which has scanned over 1.5 million books. He also serves as faculty advisor to the Carnegie Mellon Pool Team and is Curator of The Billiard Archive, reflecting his deep commitment to preserving billiards history alongside his academic pursuits.