جستجوی استاد راهنمای دانشگاهی

Ricky Ini Liuمشاهده پروفایل

دانشیار

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorial Geometry
• +۵ مورد دیگر

Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.

Catherine Greenhillمشاهده پروفایل

استاد

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

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

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.

Ram Vasudevanمشاهده پروفایل

دانشیار

• Optimization and control of nonlinear systems
• Legged robot locomotion
• Autonomous systems safety
• +۴ مورد دیگر

Ram Vasudevan is an Associate Professor and Associate Chair of Graduate Studies in the Department of Robotics at the University of Michigan. His research focuses on developing tools for safe and robust deployment of robotic systems, emphasizing optimization, nonlinear control, and real-world applications. Key areas include legged robot locomotion, shared control systems, and safety-critical autonomous systems. Research Interests: Optimization and control of nonlinear systems, locomotion of legged robots, shared control active safety systems, and automation of diagnostic/rehabilitative tasks. His ROAHM Lab prioritizes mathematical guarantees for robotic performance, with applications in medical robotics, autonomous vehicles, and soft robotics. Recent work emphasizes trajectory optimization, sensor fusion, and safety-aware control strategies. He has contributed to benchmarks for autonomous vehicle perception and novel methods in thermal image restoration using neural radiance fields. Awards: None explicitly listed in provided text. Labs/Teams: Directs the ROAHM Lab, collaborating on projects like robotic tail mechanics, real-time motion planning, and sensor data analysis. Active in academic conferences including RSS and ICRA.

• Topological Data Analysis
• Data Visualization
• Computational Topology
• +۵ مورد دیگر

Bei Wang Phillips is an Associate Professor in the School of Computing and a faculty member at the Scientific Computing and Imaging (SCI) Institute at the University of Utah. She holds a Ph.D. in Computer Science from Duke University and an undergraduate degree from the University of Bridgeport. Her research focuses on Topological Data Analysis (TDA), data visualization, computational topology, and machine learning, with applications in scientific data exploration and analysis. She has received prestigious awards including the NSF CAREER Award (2022) and the PECASE Award (2025). Her work spans projects funded by NSF, NIH, and DOE, including multiparameter TDA and topology-aware data compression. She advises numerous students and collaborates on interdisciplinary initiatives in astrophysics, climate science, and AI fairness. Education: Ph.D. in Computer Science, Duke University (2010) B.S. in Computer Science and Mathematics, University of Bridgeport (2003) Research Interests: Topological techniques for large-scale data analysis Integration of topological, geometric, and machine learning methods Applications in visualization, bioinformatics, and network analysis Key Projects: NSF-funded TDA research (DMS-2301361, OAC-2313124) DOE project on topology-preserving data compression Collaborations with NASA, Argonne National Lab, and Carnegie Institution of Washington Awards: Presidential Early Career Award for Scientists and Engineers (2025) NSF CAREER Award (2022) DOE Early Career Research Program (2020) Advising and Grants: Mentored over 30 students and postdocs Recipient of multiple NSF and DOE grants totaling millions

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

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.

Ruihong Huangمشاهده پروفایل

دانشیار

• Natural Language Processing (NLP)
• Information Extraction
• Machine Learning
• +۶ مورد دیگر

Ruihong Huang is an Associate Professor in the Department of Computer Science and Engineering at Texas A&M University, part of the College of Engineering. She holds a Ph.D. from the University of Utah (2014) and completed a postdoctoral fellowship at Stanford University. Her research focuses on Natural Language Processing (NLP) with emphasis on information extraction, event recognition, media bias analysis, and ethical AI applications. She teaches courses like Information Storage and Retrieval (CSCE 470), Natural Language Processing (CSCE 638), and has advised numerous PhD, Master’s, and undergraduate students. Key research contributions include work on event coreference resolution, discourse analysis, and detecting media bias through event relation graphs. Huang has developed benchmark datasets like UAL-Bench and EMONA, and her work spans applications in disaster management, fake news detection, and moral reasoning in LLMs. She is a recipient of the NSF CAREER Award and serves on program committees for top conferences like ACL and EMNLP. Her academic service includes roles as Area Chair for ACL 2024 and Senior Area Chair for EMNLP 2024. She maintains an active lab group focusing on NLP fundamentals and real-world applications, with projects involving propaganda identification, polarity calibration for opinion summarization, and multimodal dialog act classification. Huang has published over 80 papers in top-tier venues such as NAACL, EMNLP, ACL, and NeurIPS.

Anush Tserunyanمشاهده پروفایل

استاد

• Mathematics
• Ergodic Theory
• Combinatorics
• +۳ مورد دیگر

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.

Imre Leaderمشاهده پروفایل

استاد

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +۳ مورد دیگر

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

Brett Kolesnikمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Structures
• Bootstrap Percolation
• +۴ مورد دیگر

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +۵ مورد دیگر

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).

Allan Greenleafمشاهده پروفایل

استاد

• Harmonic Analysis
• Microlocal Analysis
• Integral Geometry
• +۱ مورد دیگر

Allan Greenleaf is Professor of Mathematics and Co-director of Graduate Studies at the University of Rochester's Department of Mathematics, School of Arts & Sciences. He received his AB/SM from the University of Chicago (1977) and PhD from Princeton University (1981), followed by an NSF Postdoctoral Fellowship at MIT. His research specializes in harmonic analysis and microlocal analysis applied to integral geometry and inverse problems. Recent work focuses on degenerate Fourier integral operators, X-ray transforms underlying CAT scanning, and transformation optics for invisibility/cloaking. Publications demonstrate consistent exploration of configuration sets, microlocal techniques in tomography/seismology, and quantum integrable systems. Awards: Sloan Research Fellowship (1990-91)

Chandra Chekuriمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +۶ مورد دیگر

Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.