Annina Iseli is a Lecturer in the Department of Mathematics at École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the College of Basic Sciences. She holds dual roles as both a Scientist and Lecturer, contributing to research and teaching within the Institute of Mathematics (MATH-GE). Her work bridges pure and applied mathematics, focusing on geometric and analytical properties of fractals. University: École Polytechnique Fédérale de Lausanne (EPFL) School: College of Basic Sciences Department: Institute of Mathematics (MATH-GE) Role: Lecturer and Scientist Research interests span multiple areas in mathematics: Fractal geometry and its connections to complex dynamics Geometric measure theory applications to projections in normed spaces Conformal and quasiconformal geometry Analysis in metric spaces Her publications include work on projection theorems, fractal dimensions, and hyperbolic space properties. She co-organizes the Quasiworld Seminar and EPFL Geometry Seminar, collaborating with researchers like Mario Bonk, Nicolas Monod, and Zoltán Balogh. Contact: annina.iseli@epfl.ch
Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation
Zhuoyue Zhao is an Assistant Professor in the Department of Computer Science and Engineering at the University at Buffalo, School of Engineering and Applied Sciences. His office is located at 338I Davis Hall, Buffalo, NY 14260, and he can be reached at zzhao35@buffalo.edu or by phone at (716) 645-4735. Dr. Zhao received his PhD in Computer Science from the University of Utah in 2021, where he was advised by Prof. Feifei Li and Prof. Jeff Phillips. Prior to that, he earned his BS in Computer Science from Shanghai Jiao Tong University in 2016, where he was part of the prestigious ACM Class. During his undergraduate studies, he conducted research under Prof. Kenny Zhu and spent Fall 2015 as a research assistant at Hong Kong Polytechnic University supervised by Prof. Eric Lo. Dr. Zhao's research focuses on database management systems, with specific emphasis on traditional and approximate query processing, query optimization, database systems on modern hardware, transaction processing, indexing, and storage. His work bridges theoretical foundations with practical implementations, often resulting in systems that address real-world database challenges. He has made significant contributions to probabilistic query processing, transaction scheduling, and learned indexing techniques. His recent publications demonstrate a clear trajectory toward optimizing database performance in hybrid transactional/analytical processing environments. His research increasingly integrates systems techniques with machine learning approaches, particularly in the area of learned indexes. There's also a strong focus on making database operations more efficient through innovative scheduling mechanisms and query processing techniques that can handle concurrent updates. Google PhD Fellowship (2019-2021) Best Paper Award at SIGMOD 2016 for "Wander Join: Online Aggregation via Random Walks" Best Paper Award at SIGMOD 2025 for "Low-Latency Transaction Scheduling via Userspace Interrupts" Dr. Zhao currently advises several PhD students including Yunnan Yu, Congying Wang, Gaoxiang Liu (co-advised with Prof. Ziming Zhao), and Zhuoran Li. He has successfully guided MS student Nithin Sastry Tellapuri to graduation (Fall 2023), who is now employed at AirPay. His research is supported by significant funding including an NSF CAREER award (#2339596) totaling $599,977 for research on "Speedy and Reliable Approximate Queries in Hybrid Transactional/Analytical Systems" (2024-2029) and an unrestricted Google gift of $30,000 (2021). Dr. Zhao leads the ADBLab research group at UB, where students work on cutting-edge database systems research. His lab focuses on building practical database systems that address real-world challenges in query processing, transaction management, and indexing. The lab maintains strong connections with industry partners and regularly contributes to open-source database projects.
Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).
Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .
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.
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 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.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .
Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.
Itsik Pe'er is a Full Professor and Vice-Chair in the Department of Computer Science at Columbia University's Fu Foundation School of Engineering & Applied Science, and holds a joint appointment as Professor of Systems Biology at the Vagelos College of Physicians and Surgeons. His research focuses on computational methods in human genetics, including genetic variation analysis, disease association studies, and algorithm development for genomic data. He leads the Itsik Pe'er Lab of Computational Genomics, which develops tools like Xplorigin, Germline, and SEACells to address challenges in genomics and medical research. His work spans machine learning applications in healthcare, microbiome analysis, and cancer genomics. Notable contributions include studies on hypertensive disorders in pregnancy, bias correction in predictive models, and the development of non-Euclidean learning libraries like Manify. Pe'er has advised students including Vladimir Vacic, Anat Kreimer, and Arthi Ramachandran, and collaborates on grants addressing genetic epidemiology and computational biology. His lab's location is in the Computer Science Building at Columbia's Morningside Campus.
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.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
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
