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
جستوجوی استاد و پژوهشگر
استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشیتان را پیدا کنید و با او ارتباط بگیرید.
نمایش ۱۶-۳۰ از ۱٬۸۰۳ استاد راهنما
اطلاعات این پروفایلها از صفحات عمومی دانشگاهها جمعآوری شده و ممکن است بهروز نباشد.
- 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.
Mark Crowleyمشاهده پروفایل
دانشیار
- Reinforcement Learning
- Deep Learning
- Manifold Learning
- +۱۲ مورد دیگر
Mark Crowley is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, with a cross-appointment in the Cheriton School of Computer Science. He is a member of the Waterloo Artificial Intelligence Institute (WAII) and the Waterloo Institute for Complexity and Innovation (WICI), and serves as National Secretary of the Canadian Artificial Intelligence Association (CAIAC). His educational background includes a Ph.D. and M.Sc. in Computer Science from the University of British Columbia, where he worked in the Laboratory for Computational Intelligence, and a B.A. in Computer Science from York University. He completed a postdoctoral fellowship at Oregon State University working with Tom Dietterich's machine learning group. Crowley's research focuses on developing dependable and transparent algorithms to augment human decision-making in complex domains with multiple agents, spatial structure, or uncertainty. His work spans Reinforcement Learning , Deep Learning , Ensemble Methods , and Manifold Learning . He frequently collaborates with researchers in applied fields including Computational Sustainability, Sustainable Forest Management, Autonomous Driving, Medical Imaging, and Material Design. His research is motivated by both theoretical opportunities and real-world challenges such as forest fire management, automotive applications, and medical imaging. His recent publications demonstrate a strong focus on addressing challenges in reinforcement learning, particularly around observation costs, multi-agent systems, and causal representation learning. His work on ChemGymRL provides a significant contribution to digital chemistry and material design through reinforcement learning frameworks. The textbook Elements of Dimensionality Reduction and Manifold Learning represents a major contribution to the theoretical foundations of machine learning. Crowley actively supervises graduate students, with recent thesis completions including Shayan Shirahmadi Gale Bagi (PhD, Feb 2025) and Oleksandra Nahorna (MASc, Dec 2024). His lab, UWECEML (Waterloo ECE Machine Learning Lab), focuses on developing new algorithms at the intersection of Machine Learning, Optimization, and Probabilistic Modeling. He teaches courses including ECE 457C (Reinforcement Learning), ECE 657A (Data & Knowledge Modelling & Analysis), and ECE 457B (Fundamentals of Computational Intelligence). His blog Computationally Thinking explores AI, machine learning, and the societal impact of these technologies.
Liming Fengمشاهده پروفایل
دانشیار
Liming Feng is an Associate Professor at the Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, and has served as Director of the Master of Science in Financial Engineering (MSFE) program since 2022. His academic career at the university spans from Assistant Professor (2006-2012) to his current role. He earned his Ph.D. in Industrial Engineering and Management Sciences from Northwestern University (2006), an M.S. in Mathematics from Northwestern University (2000), and a B.S. in Mathematics from Beijing Normal University (1997). Ph.D., Industrial Engineering and Management Sciences, Northwestern University, 2006 M.S., Mathematics, Northwestern University, 2000 B.S., Mathematics, Beijing Normal University, 1997 Feng’s research focuses on Financial Engineering, Stochastic Modeling, and Computational Methods. He has contributed extensively to quantitative finance, particularly in options pricing, portfolio optimization, and market impact models. His work leverages advanced numerical methods, Fourier transforms, and stochastic calculus to solve complex financial problems. The trends in his publications highlight expertise in Levy processes, jump diffusion models, and numerical algorithms for financial derivatives. He has developed innovative techniques for Bermudan options pricing, discretely monitored barrier options, and portfolio deleveraging strategies. His articles often intersect Operations Research with Financial Engineering, emphasizing computational efficiency and mathematical rigor. ISE Faculty Fellow (2025) INFORMS Financial Services Section Best Student Research Paper (2013) First runner-up of the 2012 Morgan Stanley Prize for Excellence in Financial Markets Feng has served on editorial boards for Operations Research Letters and Mathematical Finance . He has been recognized repeatedly for teaching excellence, including the Sharp Outstanding Teaching Award (2011, 2022) and multiple entries in the List of Teachers Ranked as Excellent by Their Students (2007-2024). He currently leads the MSFE program and contributes to curriculum development through courses like IE 522 (Statistical Methods in Finance) and IE 527 (MSFE Professional Development).
Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
Caterina Consani is a Professor of Mathematics at Johns Hopkins University's Krieger School of Arts & Sciences. She holds a PhD from the University of Chicago (1996) and a Dottore di Ricerca in Matematica from the Universities of Genoa and Turin (1993). Her research focuses on arithmetic geometry, non-commutative geometry, and the development of absolute geometry over the 'absolute point.' She has contributed to foundational work on the BC-system, the Arithmetic Site, and the Scaling Site, linking number theory with geometric frameworks. Education: PhD in Mathematics, University of Chicago (1996); Dottore di Ricerca in Matematica, Universities of Genoa & Turin (1993). Prior to Johns Hopkins, she taught at MIT (1996–1999) and the University of Toronto (1999–2005). Research Interests: Arithmetic geometry, non-commutative geometry, absolute geometry in characteristic one, connections to number theory and the Riemann Hypothesis. Collaborations include work with Alain Connes on adele class spaces and non-commutative algebraic geometry. Awards: Fellow of the American Mathematical Society (2024); 2025 Best Paper AOFA Award (Annals of Functional Analysis). Editorial roles include the Journal of Number Theory and Journal of Noncommutative Geometry. Teaching: Offers advanced courses in algebraic geometry and number theory, including topics like étale cohomology and the yoga of weights in 'Weil II.' Grants: Supported by the Simons Foundation. Organized major conferences such as the JAMI Conference on Riemann-Roch in Characteristic One (2019).
Prof. Peter Scholze is a leading mathematician at the Max Planck Institute for Mathematics in Bonn, specializing in algebraic geometry and arithmetic geometry. He holds the academic rank of Professor and is part of the Arbeitsgruppe Algebraische Geometrie und Darstellungstheorie. His research focuses on foundational questions in algebraic geometry, number theory, and representation theory, particularly through the lens of the Langlands program, p-adic Hodge theory, and perfectoid spaces. Scholze has pioneered geometric approaches to the local Langlands correspondence and introduced revolutionary concepts like prismatic cohomology and condensed mathematics. He actively contributes to academia through advanced courses on topics such as geometrization of the Langlands program, étale cohomology, and condensed mathematics. His work bridges algebraic geometry with representation theory, addressing fundamental problems in arithmetic geometry and p-adic analysis. Scholze’s research outputs include seminal papers on perfectoid spaces, prismatic cohomology, and the geometrization of local Langlands correspondence. He collaborates extensively with leading mathematicians globally, contributing to collaborative research initiatives like the ARGOS seminar and the Habiro ring project. His teaching engagements include advanced lectures on algebraic geometry, representation theory, and p-adic geometry, reflecting his commitment to training the next generation of researchers. Despite no explicitly listed awards in the provided text, Scholze is widely recognized as a Fields Medalist (2018) and a leading figure in modern mathematics.
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) .
Vesna Stojanoska is an Associate Professor in the Department of Mathematics at the University of Illinois, holding the Norman P. Jones Professorial Scholar title and serving as a Hamstrom Scholar. Her research focuses on stable homotopy theory, chromatic phenomena, and interactions with arithmetic. She earned her PhD in Mathematics from Northwestern University in 2011 and has been recognized with a Fellowship from the Center for Advanced Study (2018-2019). Key research areas include advanced topics in algebraic topology, such as Picard groups, Brauer groups, and topological modular forms. Her work frequently explores connections between homotopy theory and arithmetic structures. Recent contributions include studies on Morava stabilizer groups, determinant spheres, and collaborative efforts through initiatives like the Women in Topology IV workshop. Dr. Stojanoska has advised three graduate students, including Zachary Halladay (expected 2025), Venkata Sai Bavisetty (2024), and Elizabeth Tatum (2022). Her office is located at #307, 805 W Pennsylvania Ave, Urbana, Illinois.
Irina Bobkovaمشاهده پروفایل
دانشیار
Irina Bobkova is an Associate Professor in the Department of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. Her research focuses on algebraic topology, particularly computational aspects of equivariant and chromatic homotopy theory. She has received significant support from the National Science Foundation (NSF) via a CAREER Grant and an RTG Grant. Her research interests include equivariant homotopy theory, chromatic homotopy theory, and the study of stable homotopy groups of spheres. She explores computational methods involving Morava stabilizer groups, Picard groups, and topological modular forms. Her work often involves collaborations with leading mathematicians in the field, such as Agnès Beaudry and Vesna Stojanoska. Bobkova has published extensively in top journals like Mathematische Zeitschrift , Journal of Topology , and Algebraic & Geometric Topology . Her recent work includes groundbreaking contributions to K(2)-local homotopy theory, duality resolutions, and the cohomology of Morava stabilizer groups. She co-organizes the South Central Topology Conference, fostering regional collaboration in topology. Her grants and awards reflect her leadership in advancing algebraic topology. She actively engages in academic service, including organizing workshops and mentoring early-career researchers. Despite no listed formal advisees, her collaborative approach shapes the field’s future directions.
- 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.
Brian Conrad is a Professor of Mathematics at Stanford University, specializing in number theory and arithmetic geometry. He holds a position in the Department of Mathematics and has contributed extensively to algebraic geometry, algebraic number theory, and representation theory. His research encompasses foundational work on reductive groups, pseudo-reductive groups, and their applications in arithmetic contexts. Dr. Conrad is an editor for the Journal of the AMS, Algebra and Number Theory, and IMRN. He has organized numerous learning seminars, including those on étale cohomology and the BSD conjecture, and has taught advanced courses on algebraic geometry, class field theory, and modular forms. His work bridges classical algebraic geometry with modern arithmetic applications, emphasizing foundational proofs and geometric intuition. His editorial roles and seminar leadership reflect his commitment to advancing mathematical exposition and education. Education details are not explicitly provided in the texts, but his academic trajectory includes significant contributions to the field through publications and mentorship. Dr. Conrad's research has led to advancements in areas such as the classification of algebraic groups, étale cohomology, and the arithmetic of elliptic curves. His collaborative work with mathematicians like Chai, Oort, and Prasad has produced influential monographs, including Pseudo-reductive Groups and Complex Multiplication and Lifting Problems .
Jeremy Hahnمشاهده پروفایل
استادیار
Jeremy Hahn is an Assistant Professor at the Massachusetts Institute of Technology (MIT), affiliated with the Department of Mathematics within the School of Science. His research focuses on Algebraic Topology, particularly structured ring spectra, chromatic homotopy theory, and equivariant homotopy theory. Supported by grants from the Sloan Foundation and the National Science Foundation (DMS-1803273), his work has contributed to foundational advances in topological K-theory, algebraic K-theory, and manifold topology. Education details are not explicitly listed, though past teaching roles at Harvard University suggest prior academic training. His research interests span topics including: Structured ring spectra constructions (e.g., truncated Brown-Peterson spectra) Chromatic redshift phenomena and algebraic K-theory Equivariant orientations and C_p actions Applications of homotopy theory to manifold classification Notable recent work includes counterexamples to Ravenel's telescope conjecture, advancements in motivic filtrations of topological cyclic homology, and the construction of multiplicative structures on classical spectra. Collaborations with researchers such as Robert Burklund, Dylan Wilson, and Allen Yuan reflect his active engagement in the global topology research community. Teaching includes advanced courses like Algebraic Topology I (18.905) and past roles as a teaching assistant for Linear Algebra (18.06) and multivariable calculus at MIT. His research has been supported by multiple NSF grants and the Sloan Fellowship, indicating sustained academic excellence and leadership in the field.
Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.
Rashmi Vinayakمشاهده پروفایل
دانشیار
Rashmi Vinayak is an Associate Professor in the Computer Science Department at Carnegie Mellon University, with a courtesy appointment in the Electrical and Computer Engineering Department. She is a member of both the Systems group and Theory group at CMU and leads TheSys research group. She is also affiliated with the Parallel Data Lab (PDL). Her educational background includes a Ph.D. from UC Berkeley in 2016, followed by postdoctoral studies at the same institution. Rashmi's research spans the intersection of computer/networked systems and information/coding theory. Her current focus is on robustness and resource efficiency in data systems across storage, communication, and computation. Key thrusts include storage systems, caching systems, and systems for machine learning. Her work on SIEVE, a cache eviction algorithm, has been widely adopted by industry including VMware, Google, Redpanda, and numerous open source libraries. Her recent publications demonstrate a strong trend toward practical systems research with theoretical foundations, particularly in caching algorithms, storage systems, and machine learning infrastructure. Many of her papers have received best paper awards and industry adoption. Notable awards include: Sloan Research Fellowship (2023) IEEE Information Theory Society Goldsmith Lecturer (2023) NSF CAREER Award (2020) Multiple USENIX NSDI Community (Best Paper) Awards VMware Systems Research Award (2021) Facebook and Google Research Awards Rashmi has supervised numerous PhD, Master's, and undergraduate students, many of whom have gone on to prestigious positions at Harvard, Google, Meta, and other leading institutions. Her research has been generously funded by NSF, Sloan Foundation, Open Compute Project, Google, Facebook/Meta, VMware, and Amazon Web Services. She actively collaborates with industry partners including Google, Microsoft, NetApp, Facebook, Cisco, Intel and Cloudera. She leads TheSys research group which focuses on designing next-generation data systems that are robust, efficient, and performant. The group takes a multi-disciplinary approach spanning computer systems, information theory, and machine learning.