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

Ajit Rajwadeمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Signal Processing
• +۶ مورد دیگر

Ajit Rajwade is a Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay. His research spans Artificial Intelligence , Compressed Sensing , and Medical Imaging , with affiliations to the Centre for Machine Intelligence and Data Science and the Koita Centre for Digital Health . Education : PhD in Computer and Information Science and Engineering, University of Florida (2010) MSc in Computer Science, McGill University (2004) BTech in Computer Engineering, University of Pune (2002) His research interests focus on intelligent data acquisition, particularly in neural network analysis , graph signal processing , and medical imaging . He develops compressed sensing algorithms for inverse problems like tomography and MRI reconstruction , alongside applying group testing to pandemic response. Scientific awards include the Prof. S. P. Sukhatme Award (2024) and Departmental Teaching Excellence (2019). His publications demonstrate expertise in image restoration , noise modeling , and epidemiological algorithms . He has advised PhD students like Sabyasachi Ghosh and Jerin Geo James , with a focus on computationally efficient methods in medical imaging and machine learning .

• Operations Research
• Supply Chain Management
• Inventory Theory
• +۴ مورد دیگر

Teo Chung Piaw is the Stephen Riady Professor and Executive Director of the Institute of Operations Research and Analytics (IORA) at the National University of Singapore (NUS). He holds a PhD in Operations Research from MIT (1996) and has held academic positions including Head of Department and Acting Deputy Dean at NUS Business School. His research focuses on optimization under uncertainty, supply chain management, and combinatorial optimization. He serves as a department editor for Management Science and has led strategic initiatives in Singapore's Smart Nation Program. Teo's educational journey includes a Bachelor of Science (Honors) in Mathematics from NUS (1990). His corporate experience spans roles at Unilever, Hewlett Packard, and PSA International. He has received prestigious awards including the NUS Faculty Outstanding Researcher Award (2003, 2006) and has been a Fellow of the Singapore-MIT Alliance Program. His research addresses operational challenges in smart cities, healthcare scheduling, and supply chain resilience. Notable contributions include work on appointment scheduling under patient no-show behavior, disruption risk mitigation in supply chains, and flexible production network design. He has authored over 100 publications and serves on editorial boards of leading journals like Operations Research and Management Science .

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.

• Data Science
• Machine Learning
• Computational Harmonic Analysis
• +۶ مورد دیگر

Pierre Vandergheynst is a Full Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) in the Department of Electrical Engineering, with a courtesy appointment in Computer and Communication Sciences. He serves as EPFL’s Vice-Provost for Education since 2015 and leads the Signal Processing Laboratory 2 (LTS2). His research spans harmonic analysis, sparse approximations, mathematical data processing, and applications in signal/image processing, computer vision, machine learning, and graph-based data analysis. PhD in Mathematical Physics (1998), Université catholique de Louvain Postdoctoral Researcher at EPFL (1998-2001) Assistant Professor at EPFL (2002-2007) His research explores geometry/symmetry in high-dimensional data, redundant dictionaries for dimensionality reduction, and computational harmonic analysis on manifolds. Recent work focuses on protein structure modeling, geometric deep learning, and graph-based signal processing. Key article trends include graph neural networks for protein analysis, geometric deep learning in neuroscience, and structured knowledge priors in neural models. His 2023-2025 publications emphasize interpretable AI, long-range dependencies in graphs, and molecular representation learning. Scientific Awards: IEEE Signal Processing Magazine Best Paper Award (2023) Signal Processing Society Best Paper Award (2022) Apple ARTS Award (2007) De Boelpaepe Prize, Royal Academy of Sciences of Belgium (2009-2010) He has supervised over 30 PhD theses and contributed to foundational work in graph signal processing, compressive sensing, and geometric deep learning. His lab develops tools for data science on non-Euclidean structures, with applications in medicine, astronomy, and wireless systems.

Anoosheh Heidarzadehمشاهده پروفایل

استادیار

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +۳ مورد دیگر

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

Kimon Fountoulakisمشاهده پروفایل

دانشیار

• Machine Learning on Graphs
• Numerical Optimization
• Graph Algorithms
• +۲ مورد دیگر

Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.

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.

Shirshendu Gangulyمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +۳ مورد دیگر

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

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.

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

استادیار

• Fast Graph Algorithms
• Algorithm Design
• Minimum Cut Problems
• +۶ مورد دیگر

Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.

• Algorithms on Discrete Structures
• Parameterized Algorithms
• Structural Graph Theory
• +۴ مورد دیگر

Michał Pilipczuk is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on theoretical computer science, particularly algorithms on discrete structures, parameterized algorithms, structural graph theory, and logic in computer science. He leads the ERC-funded project "BOBR: Decomposition Method for Discrete Problems" and previously led a grant on optimality in parameterized complexity funded by the Polish National Science Center. His research interests include parameterized algorithms , structural graph theory , graph algorithms , and computational complexity . He has made significant contributions to the understanding of problems such as Independent Set in restricted graph classes, graph editing problems, and structural decompositions. The recent publications highlight a strong focus on structural graph theory and exact algorithms . Key themes include quasi-polynomial time algorithms for Independent Set in claw-free graphs, diameter computation in bounded genus graphs, and kernelization in trivially perfect graphs. His work often bridges combinatorial insights with algorithmic applications, particularly in the context of parameterized complexity. Principal Investigator, ERC Grant BOBR: Decomposition Method for Discrete Problems (2021–2026) Principal Investigator, Polish National Science Center Grant on Optimality in Parameterized Complexity (2014–2017) He has advised or collaborated with several researchers, including Marcin Wrochna and Marcin Pilipczuk. His work is published in top venues such as STOC, SODA, ESA, and ICALP.

Aaron Smithمشاهده پروفایل

دانشیار

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +۳ مورد دیگر

Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.

Maria Chudnovskyمشاهده پروفایل

استاد

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

Maria Chudnovsky is a Professor in the Department of Mathematics at Princeton University. Her research focuses on structural graph theory, particularly in areas such as graph decomposition, induced subgraphs, and algorithmic applications of graph structure. She is renowned for her contributions to understanding perfect graphs, even-hole-free graphs, and the Erdős–Hajnal conjecture. Her work often explores the interplay between graph structure and algorithmic efficiency, with applications in combinatorial optimization and theoretical computer science. Notable contributions include foundational results on tree decompositions, chromatic number bounds, and the structure of metrizable graphs. Recent research trends include investigations into induced subgraph obstructions, tree independence numbers, and the properties of sparse graphs. She has published extensively on topics such as clique-stable set separation, rainbow matchings, and the complexity of graph coloring problems in restricted graph classes. Chudnovsky has been involved in significant collaborative projects, including work funded by the DMS-EPSRC grant 'The Power of Graph Structure' (2021). Her research frequently bridges theoretical insights with practical algorithm design, contributing to both fundamental and applied areas of discrete mathematics.

Clyde Kruskalمشاهده پروفایل

دانشیار

• Parallel Computing
• Algorithms
• Computer Architecture
• +۳ مورد دیگر

Clyde Kruskal is an Associate Professor in the Department of Computer Science at the University of Maryland, College Park. His research focuses on parallel architectures, models, and algorithms. He earned a Ph.D. from New York University in 1981 and a bachelor’s degree from Brandeis University in 1976. His work includes foundational contributions to parallel computing, such as the read–modify–write concept in distributed systems. Kruskal’s research spans topics like interconnection networks, synchronization mechanisms, and algorithm design for parallel systems. Education: Bachelor’s Degree: Brandeis University, 1976 Master’s Degree: New York University (Courant Institute), 1978 Ph.D.: New York University (Courant Institute), 1981 Research Interests: Parallel computing architectures, parallel algorithms design, multiprocessor synchronization, interconnection networks, and computational geometry problems like graph coloring and visibility analysis. His work emphasizes theoretical foundations and practical implementations in parallel systems. Notable Contributions: Kruskal co-authored the book Problems With A Point: Exploring Math And Computer Science (2019), and his research includes foundational papers on parallel prefix operations, sparse matrix algorithms, and synchronization protocols. His publications span over three decades, reflecting sustained contributions to parallel computing theory and practice. Advising & Outreach: He has mentored students through programs like the Summer Combinatorial Algorithms REU at UMD, fostering undergraduate research in algorithm design and parallel computing.

Soroosh Shafieeمشاهده پروفایل

استادیار

• Optimization under Uncertainty
• Robust Optimization
• Optimal Transport
• +۳ مورد دیگر

Soroosh Shafiee is an Assistant Professor in the School of Operations Research and Information Engineering at Cornell University since July 2023. Before joining Cornell, he held postdoctoral positions at the Tepper School of Business (Carnegie Mellon University) and the Automatic Control Laboratory (ETH Zurich). He earned a B.Sc. and M.Sc. in Electrical Engineering from the University of Tehran and a Ph.D. in Operations Research from École Polytechnique Fédérale de Lausanne (EPFL). His research focuses on optimization under uncertainty, robust optimization, optimal transport, and their applications in machine learning and finance. Specific interests include designing algorithms for data-driven optimization, analyzing statistical and computational complexity, and exploring nonconvex optimization structures. Swiss National Science Foundation Early PostDoc Mobility Fellowship (2020) PhD Thesis Distinction Award, EPFL (2020) His work bridges theoretical foundations with practical applications, contributing to areas such as distributionally robust optimization, Wasserstein-based methods, and scalable algorithm development. His research has been published in top venues like Journal of Machine Learning Research and Operations Research .