Find Academic Supervisors

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

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.

Stanislav SmirnovView profile

Professor

• Mathematical Physics
• Statistical Physics
• Probability Theory
• +4 more

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

Grégoire IthierView profile

Senior Lecturer

• Quantum Engineering
• Quantum Decoherence
• Thermalization
• +3 more

Grégoire Ithier is a Senior Lecturer in Physics at the Department of Physics, Royal Holloway, University of London. His research focuses on quantum engineering, decoherence, thermalization, mesoscopic physics, and random matrix theory. He leads the 'TypDyn' project exploring typical dynamics of embedded quantum systems, and co-leads the Leverhulme Trust-funded 'Generation and detection of quantum signals' initiative. His work bridges theoretical and experimental domains, including superconducting circuits and cryogenic microwave engineering. Ithier's research tools include advanced numerical methods (e.g., exact diagonalization) and statistical techniques (e.g., random matrix theory). Key Projects: TypDyn: Studies typical dynamics in embedded quantum systems (2015–present) QSimFP: Quantum simulators for fundamental physics (2020–2024) A new statistical theory of disordered quantum systems (2020–2024) His experimental work involves superconducting qubits, Josephson devices, and nano-superfluidic cavities. Grants include STFC and Leverhulme Trust funding. Recent publications address quantum thermalization, many-body systems, and random Hamiltonian analysis.

Amit KumarView profile

Professor

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +5 more

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Imre LeaderView profile

Professor

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +3 more

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

David BindelView profile

Associate Professor

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +5 more

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

Ali VakilianView profile

Academic

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +18 more

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Chandra ChekuriView profile

Professor

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +6 more

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 FerberView profile

Assistant Professor

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +1 more

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.

Daniel A. SpielmanView profile

Professor

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +7 more

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

Mark BakerView profile

Professor

• Comparative Syntax
• Linguistic Universals
• Semantic Roles
• +4 more

Mark Baker is a Professor of Linguistics and Cognitive Science at Rutgers University. His work focuses on comparative syntax, linguistic universals, semantic roles, and the study of Amerindian and African languages. He holds the title of Distinguished Professor and maintains an office in Scott Hall. As of 2021, his office hours were by appointment due to sabbatical leave. His research interests include syntactic diversity, its limits, and patterns across languages. Notable themes in his work involve logophoric pronouns, switch-reference mechanisms, and the relationship between case systems and agreement structures. He has contributed to discussions on language typology, formal syntax, and the cognitive foundations of linguistic structures. Baker teaches advanced syntax courses and has published extensively on topics ranging from Panoan languages to theoretical models in generative grammar. His recent articles explore syntactic variation, morphosyntactic alignment, and interdisciplinary connections between linguistics and cognitive science. He serves on editorial boards and has reviewed for journals such as Journal of East Asian Linguistics and Yearbook of Corpus Linguistics and Pragmatics . His work bridges formal linguistic theory with empirical cross-linguistic analysis, emphasizing the interplay between universal grammatical principles and lineage-specific traits.

Huiyan SangView profile

Professor

• Spatial Statistics
• Bayesian Nonparametrics
• Machine Learning
• +9 more

Huiyan Sang is a Professor and Director of the Undergraduate Program in the Department of Statistics at Texas A&M University (College of Arts & Sciences). She earned her Ph.D. in Statistics from Duke University and a B.Sc. in Mathematics and Applied Mathematics from Peking University. Her research focuses on spatial statistics, Bayesian nonparametric methods, machine learning, computational statistics, and applications in environmental sciences, geosciences, urban planning, and biomedical research. Her interdisciplinary work integrates statistical methodologies with real-world challenges, such as analyzing extreme environmental events, optimizing urban infrastructure, and modeling complex systems like human mobility during pandemics. She has contributed to advancing spatio-temporal modeling, Gaussian processes, and Bayesian hierarchical frameworks for large datasets. Recent publications highlight innovations in nonparametric regression, spatial functional data analysis, and stochastic frontier analysis, often leveraging computational efficiency and scalability. Her work addresses critical societal issues, including the impact of community design on public health and environmental monitoring through remote-sensing data. No scientific awards are explicitly listed in the provided texts. She advises no students or grants in the current dataset but collaborates widely on interdisciplinary projects. Her research lab focuses on developing cutting-edge statistical tools with applications in engineering, public health, and environmental science.

Zhou Zhi-HuaView profile

Professor

• Artificial Intelligence
• Machine Learning
• Data Mining
• +3 more

Zhou Zhi-Hua is a Professor at Nanjing University's Department of Computer Science & Technology, serving as Standing Deputy Director of the National Key Lab for Novel Software Technology and Founding Director of LAMDA (Institute of Machine Learning and Data Mining). He holds simultaneous fellowships from ACM, AAAI, AAAS, IEEE, IAPR, IET/IEE, and CCF, reflecting his exceptional contributions to computational intelligence. His educational background includes: B.Sc. in Computer Science from Nanjing University (1996) M.Sc. in Computer Science from Nanjing University (1998) Ph.D. in Computer Science from Nanjing University (2000) Zhou's research pioneers fundamental advances in machine learning theory and applications. His seminal work on ensemble methods established new frameworks for classifier combination, while innovations in multi-label learning and anomaly detection addressed critical challenges in complex data analysis. His research bridges theoretical rigor with practical implementations across diverse domains including biometrics, data mining, and computer vision, resulting in over 150 publications and 18 patents. His textbooks "Ensemble Methods" (2012) and "Machine Learning" (2016) have become standard references in the field. Analysis of his publication trajectory reveals sustained leadership in core machine learning challenges: evolving from neural network ensembles (2002) through semi-supervised learning breakthroughs (2005) to foundational work on multi-instance learning (2012) and theoretical margin analysis (2013). His recent focus demonstrates increasing sophistication in handling complex data structures while maintaining theoretical soundness. His scientific excellence is recognized through: National Natural Science Award of China (2013) PAKDD Distinguished Contribution Award (2016) IEEE ICDM Outstanding Service Award (2016) IEEE CIS Outstanding Early Career Award (2013) Microsoft Professorship Award (2006) Simultaneous fellowships from 7 major international societies Zhou provides extraordinary service to the academic community as Executive Editor-in-Chief of Frontiers of Computer Science and Associate Editor-in-Chief of Science China Information Science. He founded the ACML conference and has chaired premier events including ICDM'16 and PAKDD'14. His leadership extends to serving as General Chair for ICDM'16, Program Chair for IJCAI'15 Machine Learning Track, and Area Chair for multiple top conferences. The available text does not specify student advising details or research grants. He directs LAMDA research group at Nanjing University, which has established itself as a global powerhouse in machine learning research, and contributes significantly to the National Key Lab for Novel Software Technology's mission of developing next-generation intelligent systems.

Jason LiView profile

Assistant Professor

• Fast Graph Algorithms
• Algorithm Design
• Minimum Cut Problems
• +6 more

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.

Kyle C. HaleView profile

Associate Professor

• Operating Systems
• High-Performance Computing
• Computer Architecture
• +4 more

Kyle C. Hale is an Associate Professor at Oregon State University's School of Electrical Engineering and Computer Science (College of Engineering). He holds a Ph.D. and M.S. from Northwestern University (2016, 2013) and a B.S. in Computer Science from UT Austin (2010). Prior to joining Oregon State in 2024, he served as an Associate Professor at Illinois Tech in Chicago. His research spans operating systems, high-performance computing (HPC), virtualization, computer architecture, and system security. Current work focuses on specialized system software stacks for emerging computing paradigms like memory disaggregation and parallelism optimization. He leads the HExSA Lab and collaborates with the HiPCastor group. Scientific Awards: NSF CAREER Award (2023-2028) Illinois Tech College of Computing Excellence in Research (2023) Illinois Tech College of Computing Excellence in Teaching (2021) Illinois Tech Department of Computer Science Teacher of the Year (2020) EuroSys '22 Best Artifact Award Recent Research Trends: His publications emphasize compiler techniques for memory-disaggregated systems, optimizing parallel runtimes through hardware-software integration, virtualization at fine granularities, and accelerating machine learning workloads via system-level innovations. Keywords include HPC, virtualization, parallelism, and secure execution contexts. Teaching: Courses taught include Computer Architecture (CS/ECE 472), System Security (CSP 544), Operating Systems (CS 450), and advanced topics in serverless/edge computing. He actively recruits PhD students to the HExSA Lab.