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

Benjamin Landonمشاهده پروفایل

استادیار

• Probability
• Mathematical physics
• Random matrix theory
• +۳ مورد دیگر

Benjamin Landon is an Assistant Professor in the Department of Mathematics at the University of Toronto, where he has been faculty since 2021. His office is located in the Bahen Centre for Information Technology, Room 6264. Prior to joining the University of Toronto, he was a CLE Moore Instructor at the Massachusetts Institute of Technology from 2018-2021. Education: PhD in Mathematics, Harvard University (2018). Advisor: Horng-Tzer Yau M.Sc. in Mathematics, McGill University (2013). Advisors: Vojkan Jaksic and Robert Seiringer B.Sc., McGill University (2012) Dr. Landon's research focuses on Probability and Mathematical Physics, with particular expertise in Random Matrix Theory. His work spans various aspects of spectral statistics, eigenvalue distributions, and universality phenomena in random matrix ensembles. He has made significant contributions to understanding the behavior of extremal eigenvalues, linear spectral statistics, and connections to other areas of mathematical physics such as spin glasses and the KPZ universality class. His research often involves developing novel analytical techniques to establish precise asymptotic behavior in complex random systems. Analysis of Dr. Landon's publication record reveals a strong focus on the intersection of probability theory and mathematical physics. His work consistently explores universality phenomena across different random matrix ensembles and related stochastic systems. A notable trend is his investigation of connections between random matrix theory and other areas of mathematical physics, particularly spin glass models and the KPZ equation. His research demonstrates both technical depth in establishing rigorous asymptotic results and breadth in connecting seemingly disparate areas of mathematical physics.

• Self-organized criticality
• Neuronal network dynamics
• Excitation/Inhibition balance
• +۵ مورد دیگر

Anna Levina is an Assistant Professor for Computational Neuroscience at the University of Tübingen , affiliated with the Department of Computer Science under the Faculty of Science. Her research focuses on the self-organization of neuronal activity, critical dynamics in neural networks, and the excitation/inhibition balance in cortical circuits. Current positions: Assistant Professor (since 2018), Group Leader (2017-2018), Equality Officer (Computer Science) Previous roles: IST Fellow (2015-2017), Associated Researcher (2011-2015), Postdoc/PI (2011-2015), Postdoc (2008-2011) Her research integrates mathematical modeling , statistical physics , and computational neuroscience to study criticality phenomena, neural avalanches, and adaptive network dynamics. Key interests include: Self-organized criticality in neural systems Excitation/Inhibition balance mechanisms Network topology and dynamics Timescale analysis in neural processing Stochastic modeling of neural activity Recent publications reveal trends in understanding critical dynamics across biological and artificial networks, with applications to memory systems, sensorimotor integration, and disease modeling. She has received recognition as an IST Fellow .

Ola Svenssonمشاهده پروفایل

دانشیار

• Approximation Algorithms
• Combinatorial Optimization
• Computational Complexity
• +۳ مورد دیگر

Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.

• Control Theory
• Machine Learning
• Nonlinear Estimation
• +۶ مورد دیگر

Prashant Mehta is a Professor of Mechanical Science and Engineering at the University of Illinois at Urbana-Champaign , affiliated with the Coordinated Science Laboratory . His research focuses on controlled interacting particle systems and machine learning applications , particularly in human activity recognition using motion sensors. Education: Ph.D. in Mathematics, Cornell University (2004) M.S. in Electrical & Computer Engineering, University of Massachusetts Amherst (1996) B.E. in Electrical & Electronics Engineering, Birla Institute of Technology & Sciences (1993) Mehta's work has pioneered the feedback particle filter (FPF) algorithm for nonlinear estimation, applied in robotic systems and gesture recognition. His research spans control of combustion instabilities in jet engines, mean-field games , and dynamical systems in aerospace engineering. His publications emphasize nonlinear control theory and stochastic filtering , with recent trends in sensor data pattern recognition and cyber-physical systems . He has received multiple scientific awards , including the MURI award for the Cyberoctopus project and Excellence in Undergraduate Advising Awards . Scientific Honors: MURI Award (2019) for Cyberoctopus Excellence in Undergraduate Advising (2010, 2008) Outstanding Teaching Assistant Award (1994) Senior Member, IEEE Control Systems Society Member, ASME Energy Systems Subcommittee Member, SIAM Dynamical Systems Group Mehta has supervised students like Jin Kim (IEEE CDC Best Student Paper, 2019) and co-founded the startup Rithmio , acquired by Bosch Sensortec . His laboratory develops gesture-detection filters for applications in soft robotics and human-machine interfaces .

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.

Elias Jarlebringمشاهده پروفایل

استاد

• Numerical Linear Algebra
• Matrix computations
• Nonlinear eigenvalue problems
• +۱۰ مورد دیگر

Elias Jarlebring is a Professor in Numerical Linear Algebra at the Department of Mathematics, KTH Royal Institute of Technology, Stockholm. He has held the position of Full Professor since 2021, following his tenure as Associate Professor (2013-2021) and Dahlquist Research Fellow (2011-2013). His research focuses on numerical analysis, numerical linear algebra, matrix computations, and scientific computing. Jarlebring develops linear algebra algorithms to solve problems from various fields including systems and control, acoustics, electromagnetics, data science, quantum mechanics, and quantum chemistry. He is a core developer of NEP-PACK, a scientific computing software package for nonlinear eigenproblems. His recent publications demonstrate significant contributions to computational methods for nonlinear eigenvalue problems, matrix functions, and parameterized linear systems. The research shows a clear trajectory toward increasingly complex applications in quantum computing, data science, and wave propagation problems. Project grant, Swedish research council (2019) Ruth och Nils-Erik Stenbäcks foundation, junior grant (2019) Göran Gustafsson Prize for junior researchers (2014) Project grant for junior researchers, Swedish research council (2014-2018) Professor Jarlebring has supervised numerous PhD students including Vilhelm Peterson Lithell, Gustaf Lorentzon, Siobhán Correnty, Parikshit Upadhyaya, Emil Ringh, Antti Koskela, and Giampaolo Mele. He has received multiple research grants from the Swedish Research Council and serves as editor for BIT Numerical Mathematics, Linear and Multilinear Algebra, NACO Numerical Algebra Control and Optimization, and CALCOLO. He is actively involved in the numerical linear algebra community as a member of ILAS (International Linear Algebra Society), GAMM Activity Group on Numerical Linear Algebra, and the Nordic Numerical Linear Algebra Association. He also contributes to open source projects, particularly in the Julia programming language ecosystem.

Yuguo Chenمشاهده پروفایل

استاد

• Network Analysis
• Monte Carlo Methods
• Statistical Inference
• +۷ مورد دیگر

Yuguo Chen is a Professor in the Department of Statistics at the University of Illinois at Urbana-Champaign (UIUC), serving as Interim Department Chair and Director of the Illinois Statistics Office. He holds affiliations with the Department of Computer Science, Information Trust Institute, Coordinated Science Lab, and Illinois Informatics Institute. Chen earned his PhD in Statistics from Stanford University (2001) and a B.S. in Mathematics from the University of Science and Technology of China (1997). His research focuses on Monte Carlo methods, network data analysis, state space models, bioinformatics, and Bayesian inference. Key interests include scalable network estimation, community detection, and applications in public health, education, and computational biology. Recent work highlights include advancements in dynamic network modeling, Bayesian latent class models for cognitive diagnosis, and statistical methods for analyzing multi-layer networks. His contributions have been recognized through awards such as the American Statistical Association Fellowship (2018) and the Charles Edison Lectureship (2018). Editorial Roles: Associate Editor of Journal of the American Statistical Association , Journal of Computational and Graphical Statistics , and Journal of Algebraic Statistics . Grants & Consulting: Directs the Illinois Statistics Office, providing interdisciplinary research support. Active in collaborative projects involving healthcare, education, and computational infrastructure. Labs & Teams: Leads initiatives at the Coordinated Science Lab and Information Trust Institute, integrating statistical methods with cybersecurity and data-driven decision-making.

Mohammad Mohammadi Amiriمشاهده پروفایل

استادیار

• Large Language Models
• Data Valuation
• Federated Learning
• +۵ مورد دیگر

Mohammad Mohammadi Amiri serves as an Assistant Professor in the Department of Computer Science at Rensselaer Polytechnic Institute (RPI), appointed in Fall 2023. His research focuses on advancing artificial intelligence through strategic data utilization, with emphasis on large language models, data valuation, federated learning, and deep learning. Previously, he held postdoctoral appointments at Princeton University and MIT Media Lab, building on his strong educational foundation from Imperial College London, University of Tehran, and Iran University of Science and Technology. Education: Ph.D. in Electrical and Electronic Engineering, Imperial College London (2019) - Best Ph.D. Thesis Award recipient M.Sc. in Electrical and Computer Engineering, University of Tehran (2014) - Ranked 1st among all M.Sc. students B.Sc. in Electrical Engineering, Iran University of Science and Technology (2011) - Ranked 1st among all B.Sc. students Dr. Amiri's research centers on optimizing artificial intelligence systems through innovative data strategies. His work addresses critical challenges in large language models including efficiency, memory usage, alignment, and reasoning capabilities. In data valuation, he develops principled methods to quantify data worth for fair trading platforms. His federated learning research tackles privacy concerns, heterogeneous data distribution, and communication overhead in decentralized environments. The deep learning component explores theoretical foundations to improve model interpretability and robustness. Analysis of his recent publications reveals a strong focus on making AI systems more efficient and accessible, with particular emphasis on large language model optimization, federated learning advancements, and data valuation frameworks. His work bridges theoretical foundations with practical applications in wireless communications and distributed computing environments. Scientific Awards: IEEE Communications Society Young Author Best Paper Award (2022) Best PhD Thesis Award from IEEE Information Theory Chapter of UK and Ireland (2019) Eryl Cadwallader Davies Prize for Outstanding PhD Thesis (2019) EEE Departmental Scholarship at Imperial College London (2015-2019) Ranked 1st among M.Sc. students at University of Tehran (2014) Ranked 1st among B.Sc. students at Iran University of Science and Technology (2011) Dr. Amiri actively mentors graduate students, currently supervising five Ph.D. candidates and one M.Sc. student working on efficient LLM fine-tuning, inference, and storage. His research has attracted significant attention, evidenced by numerous keynote invitations at prestigious institutions including Bell Labs, MIT, King's College London, and various IEEE conferences. He serves on program committees for major conferences including IEEE Globecom and ICC, demonstrating his growing influence in the academic community. His research group operates at the intersection of machine learning and wireless communications, developing innovative solutions for resource-constrained environments while addressing fundamental theoretical challenges in AI systems. Current projects focus on making advanced AI more scalable and accessible through efficiency improvements in model training and inference.

Giorgis Petridisمشاهده پروفایل

دانشیار

• Arithmetic Combinatorics
• Combinatorial Geometry
• Number Theory
• +۳ مورد دیگر

Giorgis Petridis is an Associate Professor at the University of Georgia, specializing in arithmetic combinatorics, a field rooted in combinatorial number theory with modern extensions into discrete analysis and finite field geometry. Born in Athens, Greece, he earned his PhD from the University of Cambridge under Tim Gowers and held a Visiting Assistant Professor position at the University of Rochester. He serves as an editor for Combinatorial Theory and is affiliated with the Number Theory and Arithmetic Geometry group, particularly its additive combinatorics and discrete analysis subgroup. Doctor of Philosophy (2011), University of Cambridge Certificate of Advanced Studies in Mathematics (2002), St John’s College, Cambridge BA (Hons) in Mathematics (2001), St John’s College, Cambridge His research focuses on additive combinatorics, exploring sumset estimates, polynomial configurations in prime lattices, and geometric incidence problems over finite fields. He investigates combinatorial geometry, including pinned distance problems and bisector arrangements, while also contributing to exponential sum bounds and expander graph theory. His work bridges theoretical mathematics with applications in pseudorandomness and discrete geometry. Recent publications highlight trends in finite field analysis, with 6 of 15 articles addressing arithmetic structures in prime-order fields. Key keywords include Combinatorics , Number Theory , and Finite Fields , with sub-fields spanning polynomial configurations, energy bounds, and geometric combinatorics. Scientific awards include the Creative Research Medal (2024) from the University of Georgia for mid-career research impact. Grants from the Simons Foundation (MPS-TSM-00007816) and multiple NSF DMS Awards (2054214, 1723016, 1500984, 1804049) support his work on discrete analysis and conferences. He co-advises five PhD students and has supervised multiple Master’s theses on topics like point-plane incidences and additive energy. Outreach includes leading high school math teams, organizing discrete analysis sessions, and contributing to public science communication guides.

Ben Greenمشاهده پروفایل

استاد

• Additive Combinatorics
• Analytic Number Theory
• Harmonic Analysis
• +۳ مورد دیگر

Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.

Aleksandar Bojchevskiمشاهده پروفایل

استاد

• Trustworthy Artificial Intelligence
• Graph Neural Networks
• Adversarial Robustness
• +۳ مورد دیگر

Aleksandar Bojchevski is a full professor of Computer Science at the University of Cologne, leading the Trustworthy Artificial Intelligence Lab (TAIL). His research focuses on developing robust, interpretable, and privacy-preserving machine learning models, particularly graph neural networks (GNNs). The lab emphasizes trustworthiness in high-stakes applications through methods that handle noisy, adversarial, or anomalous data. Bojchevski holds a PhD and PostDoc from the Technical University of Munich, advised by Stephan Günnemann. Previously, he was faculty at CISPA Helmholtz Center for Information Security. His work bridges theory and practice, addressing adversarial robustness, uncertainty quantification, and scalable GNN techniques. Research interests include: robustness certification for GNNs, conformal prediction, adversarial attack analysis, and privacy-aware machine learning. His lab actively collaborates with RWTH Aachen and organizes events like the Learning on Graphs Meet Up. Recent achievements include a teaching award for the Machine Learning lecture (SS 24) and NeurIPS 2024 acceptance of SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors . Open positions are available in his group focusing on trustworthy ML topics. Key labs/teams: Trustworthy Artificial Intelligence Lab (TAIL), Center for Data and Simulation Science (CDS) as a core scientist.

• VLSI Design
• Computer-Aided Design
• Spectral Graph Theory
• +۴ مورد دیگر

Zhuo Feng is Professor of Electrical and Computer Engineering at Stevens Institute of Technology, directing the HUDSON Lab and holding a Ph.D. from Texas A&M University. His research develops spectral graph methods for VLSI design, including circuit simulation, power grid verification, and machine learning applications. Funded by NSF CAREER and multiple grants, his work has produced award-winning algorithms like GRASS for graph sparsification. Recent publications focus on spectral methods for circuit stability analysis, physics-informed neural networks, and explainable AI frameworks. He teaches graduate courses in VLSI design and GPU programming while co-founding LeapLinear Solutions. NSF CAREER Award (2014) ACM/IEEE DAC Best Paper Award (2013) Multiple Best Paper Nominations (ICCAD 2008, 2006)

Rayan Saabمشاهده پروفایل

استادیار

• Compressed Sensing
• Signal Processing
• Applied and Computational Harmonic Analysis
• +۵ مورد دیگر

Rayan Saab is an Assistant Professor in the Department of Mathematics at the University of California, San Diego. His research focuses on the mathematics of information, data science, and signal processing, with an emphasis on quantization, compressed sensing, and machine learning algorithms. Education: Ph.D. in Electrical and Computer Engineering from the University of British Columbia (2010). His work bridges theoretical mathematics and practical applications in data acquisition, digitization, and processing. Recent publications analyze quantization methods for neural networks and compressed sensing systems. He has taught graduate and undergraduate courses in numerical analysis, optimization, and mathematical methods in data science. Research trends include: Developing quantization algorithms with provable guarantees. Applications in high-dimensional data and machine learning. Stochastic frameworks for neural network compression. Scientific awards: Banting Postdoctoral Fellowship (2011-2013). Hellman Fellowship. Advising and grants: Advised students in thesis projects related to signal processing and data science. Received funding for research in mathematical data acquisition. Contact: rsaab@ucsd.edu | Office: AP&M 5157.

Behnaam Aazhangمشاهده پروفایل

استاد

• Signal and Data Processing
• Information Theory
• Neuroengineering
• +۴ مورد دیگر

Behnaam Aazhang is the J.S. Abercrombie Professor of Electrical and Computer Engineering at Rice University and Director of the Rice Neuroengineering Initiative (NEI). He holds a B.S., M.S., and Ph.D. from the University of Illinois at Urbana-Champaign. His roles include leading the multi-university Rice Neuroengineering Initiative and directing the Center for Neuroengineering. He has held an Academy of Finland Distinguished Visiting Professorship (FiDiPro) at the University of Oulu (2006-2014) and received an Honorary Doctorate from the University of Oulu in 2017. Education: Ph.D. in Electrical Engineering, University of Illinois at Urbana-Champaign (1986) M.S. in Electrical Engineering, University of Illinois at Urbana-Champaign (1983) B.S. in Electrical Engineering, University of Illinois at Urbana-Champaign (1981) Research Interests: Dr. Aazhang’s work focuses on signal/data processing, information theory, and neuroengineering applications. Key areas include: Neuronal circuit connectivity and learning impacts Real-time closed-loop neuromodulation for neurological disorders (epilepsy, Parkinson’s, depression) Patient-specific cardiac pacing systems Cybersecurity in cloud computing Awards & Honors: 2022 Rice Outstanding Doctoral Thesis Advisor Award 2019 SIGMOBILE Test of Time Award 2017 Honorary Doctorate (University of Oulu) 2013 IEEE Communication Society Advances in Communication Award AAAS and IEEE Fellowships (2012 and 1999) Grants & Advising: His research is supported by multi-university collaborations and grants. He has advised numerous graduate students in electrical engineering and neuroengineering, though specific names are not listed here. Labs & Teams: Leads the Aazhang Lab and the Rice Neuroengineering Initiative, focusing on translational technologies for neurological and cardiac disorders, including non-invasive neuromodulation and cloud security systems.

• Algebra
• Combinatorics
• Number Theory
• +۳ مورد دیگر

Gábor Somlai is a mathematics researcher at Eötvös Loránd University's Faculty of Science, affiliated with the Department of Algebra and Number Theory since 2006. He is a core member of the HUN-REN-ELTE Geometric and Algebraic Combinatorics Research Group (previously MTA-ELTE until 2023) and participates in the Asymptotic Group Theory ERC project. His institutional roles include contributions to the Mathematics Doctoral School and the Institute of Mathematics. His research spans Algebra , Combinatorics , and Number Theory , with emphasis on spectral sets, tiling problems, group theory, and finite geometry. Recent work explores cyclotomic polynomials, the generalized trifference problem, and connections between tiling and spectral properties in finite abelian groups. His publications reveal a strong focus on combinatorial number theory and algebraic methods in discrete geometry. Somlai's publication trends show sustained contributions to theoretical foundations of tiling and spectral sets (testing Fuglede's conjecture in cyclic groups) Cayley graph properties and CI-group classifications polynomial methods in finite geometry and direction problems His work bridges pure algebra with combinatorial applications, often resolving long-standing conjectures in specialized domains. As part of the HUN-REN-ELTE research group, he collaborates on geometric and algebraic combinatorics projects, leveraging ERC funding for asymptotic group theory investigations. His research infrastructure includes access to the Alfréd Rényi Institute of Mathematics (http://www.renyi.hu) resources.