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

Aravindan Vijayaraghavanمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Machine Learning Theory
• Data Science
• +۷ مورد دیگر

Aravindan Vijayaraghavan is an Associate Professor in the Department of Computer Science at Northwestern University (affiliated with McCormick School of Engineering). He also holds courtesy appointments in the Industrial Engineering and Management Sciences (IEMS) department. Research interests include theoretical computer science , machine learning algorithms , quantum information , and combinatorial optimization under non-worst-case paradigms. He leads IDEAL (Institute for Data, Economics, Algorithms and Learning) as Site Director at Northwestern and former Institute Director (2023-24). Academic Background : PhD in Computer Science from Princeton University (advisor: Moses Charikar ) Bachelor's Degree in Computer Science from Indian Institute of Technology Madras Postdoctoral work at Courant Institute (NYU) and Carnegie Mellon University via Simons Collaboration grants Research Contributions : Developed smoothed analysis frameworks for random matrices with dependent entries Created sum-of-squares certificates for anti-concentration beyond Gaussian distributions Advanced quantum entanglement certification algorithms for subspaces Improved weak-to-strong generalization theory with data distribution expansion properties Designed error-tolerant e-discovery protocols for legal document classification Scientific Recognition : NSF CAREER Award NSF AITF Award (CCF-1637585, CCF-2154100) Google Research Scholar Program grant Amazon Research Awards program support Simons Postdoctoral Fellowship Academic Leadership : General Chair for FOCS 2024 Co-organizer of Junior Theory Workshop and Northwestern QTW series Active in program committees for COLT , ICML , NeurIPS , and STOC conferences Teaching Portfolio : CS262: Mathematical Foundations of CS (Continuous Mathematics for Computer Science) CS212: Mathematical Foundations of Computer Science (multiple offerings since 2015) CS496: Graduate Algorithms (since 2016) CS396/496: Quantum Computation & Information (co-taught with S. Rao) CS497: Machine Learning Theory (Spring 2025 offering)

Peter Bormمشاهده پروفایل

استاد

• Game Theory
• Cooperative Game Theory
• Non-Cooperative Game Theory
• +۷ مورد دیگر

Peter Borm is a Full Professor of Mathematics and Game Theory at Tilburg University, affiliated with the Department of Econometrics and Operations Research within the Tilburg School of Economics and Management (TS Economics and Management). His career spans over three decades, beginning as an Assistant Professor in 1990 and advancing to his current role since 2001. His research focuses on cooperative and non-cooperative game theory, operations research, bankruptcy problems, and networks, with notable contributions to strategic behavior in interactive decision-making and opinion dynamics. Education: PhD in Mathematics from Radboud University Nijmegen (1990), focusing on game-theoretic models and solution concepts. Research interests include game practice, games of skill/chance, sequencing and delivery situations, and stochastic environments. He has supervised over 25 PhD students, many of whom have produced influential work in game theory and operations research. Awards highlight his teaching excellence, including multiple TiSEM Best Teacher recognitions. Current research trends in his articles revolve around cooperative investment dynamics, strategic bankruptcy models, opinion network influence, and financial network clearing mechanisms. His work bridges game theory with real-world applications in economics, environmental policy, and infrastructure.

• Machine Learning
• Online Learning
• Algorithmic Game Theory
• +۴ مورد دیگر

Andrea Celli is an Assistant Professor in the Department of Computing Sciences at Bocconi University. He is affiliated with the ELLIS Society and the Bocconi Institute for Data Science and Analytics. Previously, he was a postdoctoral researcher at Meta (formerly Facebook Research) in London. He holds a Ph.D. in Computer Science from Politecnico di Milano and conducted research at Carnegie Mellon University's Electronic Marketplaces Lab. His research focuses on intersections of computer science, machine learning, and economics, particularly in strategic interactions and online learning environments. Notable achievements include a NeurIPS 2020 Best Paper Award and the 2017 Lesmo Prize for his MSc thesis. His research is supported by grants including an ERC Starting Grant (2024) for the PLA-STEER project and an MUR-PRIN grant (2022). He teaches courses such as Deep Learning and Reinforcement Learning, Machine Learning, and Optimization at the Ph.D. level. His work spans topics like equilibrium finding, online learning under constraints, and mechanism design. Key publications include contributions to ICLR, NeurIPS, EC, and other top venues. Celli advises Master’s students including Annalisa Barbara, Emanuele Coccia, Davide Drago, and Antonio Preiti. He collaborates with postdocs like Riccardo Poiani and Martino Bernasconi. He actively organizes academic events, such as the EC 2025 workshop on Online Learning and Economics. His research emphasizes theoretical foundations while addressing practical challenges in algorithmic game theory and data-driven decision-making.

Arindam Royمشاهده پروفایل

دانشیار

• Analytic Number Theory
• Algebraic Number Theory
• Special Functions
• +۶ مورد دیگر

Arindam Roy is an Associate Professor in the Department of Mathematics and Statistics at the University of North Carolina at Charlotte. He serves as the Director of the Math and Stat Honors Program and is affiliated with research in analytic number theory, algebraic number theory, and graph theory. Current Position: Associate Professor, UNC Charlotte (2025–) Previous Positions: Assistant Professor, UNC Charlotte (2018–2025); G.C. Evans Instructor, Rice University (2015–2018) His research focuses on zeros of the Riemann zeta-function and L-functions, partial sums of zeta functions, divisor problems, integral transforms, and graph theory. Recent work explores value distributions, Turán inequalities, and connections to Ramanujan's theories. Key trends in his publications include analytic number theory, special functions, and the interplay between modular forms and graph theory. His articles often address critical line behavior, approximation techniques, and arithmetic functions.

Aniol Llorente-Saguerمشاهده پروفایل

استاد

• Political Economy
• Experimental Economics
• Behavioral Economics
• +۵ مورد دیگر

Aniol Llorente-Saguer is a Professor of Economics at Queen Mary University of London's School of Economics and Finance. He specializes in behavioral/experimental economics and political economy, with a focus on voting behavior, electoral rules, and collective decision-making mechanisms. His research integrates microeconomic theory with experimental methods to study issues such as auctions, contests, equilibrium selection, and coalition formation. Education: PhD in Economics, Universitat Pompeu Fabra BA in Economics, Universitat Pompeu Fabra Research Interests: His work explores voting systems, information aggregation in elections, and the design of rules to improve democratic processes. Key areas include: - Electoral rules and turnout dynamics - Strategic behavior in contests and auctions - Veto power and majority voting mechanisms - Experimental validation of economic theories Professional Background: Prior to Queen Mary, he held positions at the California Institute of Technology and the Max Planck Institute for the Study of Collective Goods. He has also been affiliated with Hebrew University of Jerusalem and New York University. Research Contributions: His studies span theoretical and experimental analyses of political institutions, with notable work on: - The superiority of majority rules with veto power over unanimity - Information effects in shareholder decision-making - Sunspot-driven market volatility in experimental settings - Voting rights and agenda control in collective decisions Labs/Teams: His research is conducted within Queen Mary's School of Economics and Finance and collaborates with institutions like the Centre for Economic Policy Research (CEPR) as a Research Fellow.

Andrzej Nowakمشاهده پروفایل

استاد

• Game theory
• Nash equilibria in non-zero-sum stochastic games
• Mathematical economics
• +۱۹ مورد دیگر

Andrzej Nowak is a Professor at the Institute of Mathematics, University of Zielona Gora, specializing in game theory, mathematical economics, and applied mathematics with significant applications in economics and finance. His academic profile includes: Research on Nash equilibria in non-zero-sum stochastic games with constraints on player strategies Work on Recursive Utilities in Dynamic Economic Models and General Equilibrium Theory Investigations of Risk Measures in Dynamic Programming and Markovian Decision Processes Analysis of multivariate linear models and Inclusions and multivalued stochastic equations Studies of Preference models using graded and interval relations for decision support systems Professor Nowak teaches fundamental courses in game theory, mathematical economics, and mathematical foundations of economics in finance (including portfolio analysis, capital market lines, and time series). He also covers probability theory and stochastic processes with applications to economics and finance, particularly Markov chain theory and discrete-time martingales. His broader research encompasses: Approximation theory using Fourier series and summability methods Combinatorial geometry including partitions of n-dimensional space Mathematical means and their invariance properties Applications of computer science to secure data transmission and privacy standards

Boualem Djehicheمشاهده پروفایل

استاد

• Stochastic Analysis
• Stochastic Control
• Insurance Mathematics
• +۸ مورد دیگر

Boualem Djehiche is a Professor of Mathematical Statistics at the Department of Mathematics, KTH Royal Institute of Technology. He is affiliated with the Digital Futures Faculty and the SCI School at KTH. His research focuses on Stochastic Analysis, including Stochastic Control, Insurance Mathematics, Mathematical Finance, and Game Theory. Djehiche holds editorial roles in journals such as Scandinavian Actuarial Journal and Finance and Stochastics . Education details are not explicitly stated in the provided texts. His teaching responsibilities include courses like Game Theory, Probability Theory, and Financial Mathematics. He advises students in these areas, though explicit student names are not listed. His research explores advanced topics such as mean-field games, time-inconsistent optimal control, and applications in finance and economics. Recent publications address topics like zero-sum Dynkin games, generative AI outcomes as Nash equilibria, and commodity futures pricing with regime switching. Research Interests: Stochastic Control, Insurance Mathematics, Mathematical Finance, Mean-Field Games, System Identification. Editorial Duties: Editor-in-Chief of Scandinavian Actuarial Journal , Associate Editor of Finance and Stochastics , and roles in multiple other journals. Grants & Collaborations: Collaborations include work on disability insurance modeling, credit scoring, and energy market dynamics via mean-field-type games. Labs/Teams: Involved in cross-disciplinary initiatives like the Digital Futures research center, focusing on digital technologies and societal challenges.

Srilakshmi Krishnamoorthyمشاهده پروفایل

دانشیار

• Arithmetic Geometry
• Number Theory
• Graph Theory
• +۱ مورد دیگر

Srilakshmi Krishnamoorthy serves as an Associate Professor in the School of Mathematics at the Indian Institute of Science Education and Research (IISER) Thiruvananthapuram. She joined IISER TVM in 2017 as an Assistant Professor and was promoted to her current position. Her academic journey includes a PhD from the University of Sheffield, UK in Arithmetic Geometry, followed by a postdoctoral fellowship at IMSc Chennai and a visiting scientist position at the Max-Planck Institute for Mathematics in Bonn, Germany. PhD: University of Sheffield, UK (specialization in Arithmetic Geometry) Post Doctoral Fellowship: IMSc Chennai (2010-2013) Visiting Scientist: Max-Planck Institute for Mathematics, Bonn (2013-2014) Her research spans Arithmetic Geometry, Number Theory, Graph Theory, and Combinatorics, with particular focus on modular forms, elliptic curves, class field theory, and zero-sum problems. She has made significant contributions to understanding class numbers of quadratic fields, modular degrees of elliptic curves, and congruences in partition theory. Analysis of her 15 most recent publications reveals a strong concentration on class field theory problems, particularly concerning class numbers of quadratic fields and their divisibility properties. Her work frequently connects modular forms with number-theoretic questions, demonstrating expertise in both theoretical and computational aspects of modern number theory. Recent papers show increasing collaboration with junior researchers, indicating active mentoring of the next generation of mathematicians. DST-SERB Core Research Grant (2024-2027) DST-INSPIRE Faculty Award (2014-2019) Gold medal for first rank in M.Sc. Mathematical Sciences (2004) CSIR-JRF Award (2005) Multiple summer fellowships from Indian Academy of Sciences Professor Krishnamoorthy has supervised numerous students at various levels, including 4 postdoctoral researchers, 3 PhD students who have completed their degrees, and multiple masters and undergraduate research students. Her teaching portfolio includes advanced courses in Modular Forms, Algebraic Number Theory, and Number Theory and Cryptography. She has also secured multiple research grants including DST-SERB, DST-INSPIRE, and NBHM funding for conference organization and research activities. As an active member of the mathematical community, she serves as Coordinator for the Club of Mathematics at IISER TVM and has organized major events like the International Conference on Number Theory. Her research group maintains strong international connections, with regular visits from collaborators at institutions including Max-Planck Institute, TIFR Mumbai, and universities in France, Germany, and the UK. The group participates actively in the number theory seminar series and organizes workshops to foster collaboration within the Indian mathematical community.

Shahriar Shahriariمشاهده پروفایل

استاد

• Combinatorics of Posets
• Extremal Set Theory
• Finite Group Theory
• +۳ مورد دیگر

Shahriar Shahriari is the William Polk Russell Professor of Mathematics at Pomona College, part of The Claremont Colleges. He has been affiliated with Pomona since 1989, holding roles such as Department Chair (2004–2007) and Associate Dean of the College (2000–2003). His research focuses on combinatorics, particularly chain partitions, cut-sets in Boolean lattices, and finite group theory. He is renowned for his teaching excellence, including the 2015 Deborah and Franklin Tepper Haimo Award for Distinguished Teaching. His textbook Approximately Calculus (2006) won a Choice Outstanding Academic Title. He has authored over 30 refereed papers in combinatorics and algebra, edited volumes, and Persian-language expository works. His academic service includes editorial roles at Order and Math Horizons , and he has held visiting positions at institutions including Columbia University and EPFL. Shahriari earned his Ph.D. from the University of Wisconsin-Madison (1986) and B.A. from Oberlin College (1977). Education: Ph.D. in Mathematics (1986) from University of Wisconsin-Madison; B.A. in Mathematics and Economics (1977) from Oberlin College. Recent Courses: Abstract Algebra, Combinatorics, Deterministic Operations Research, and Honors Calculus. Publications: Includes books on combinatorics and algebra, plus peer-reviewed articles in Journal of Combinatorial Theory , Proceedings of the AMS , and others. Awards: Multiple Wig Teaching Awards (1993, 1999, 2008, 2013), MAA's Allendoerfer Award (1998), and Pomona College Alumni Service Award (2017). His research emphasizes combinatorial structures and pedagogical innovation.

• Algebra
• Group Theory
• Lie Theory
• +۳ مورد دیگر

Giovanni Falcone is a Full Professor (MATH-02/B) in the Department of Mathematics and Computer Science at the University of Palermo, Italy. His office is located at Via Archirafi 34, Palermo, Room 107, where he holds office hours on Tuesdays from 2:00 PM to 5:00 PM. Professor Falcone's research spans multiple areas of pure mathematics with a focus on: Algebraic structures and Lie theory Combinatorial designs and finite geometries Number theory and algebraic geometry Coding theory and applications His scholarly work demonstrates a consistent trajectory through advanced mathematical structures, with recent publications focusing on Steiner systems, Lie algebras, hyperelliptic curves, and combinatorial designs. Over the past two decades, his research has evolved from foundational work in Lie theory and group theory toward increasingly sophisticated applications in coding theory and geometric structures, showing remarkable continuity and development across multiple mathematical disciplines. Professor Falcone maintains an active publication record with significant contributions spanning both theoretical developments and practical applications, particularly at the intersection of combinatorial mathematics and algebraic structures. His work on Steiner systems and affine designs represents ongoing innovation in classical areas of combinatorics, while his research on hyperelliptic curves and Goppa codes demonstrates relevance to modern cryptographic applications.

• Geometric Measure Theory
• Harmonic Analysis
• Mathematical Analysis
• +۳ مورد دیگر

Alan Chang is an Assistant Professor of Mathematics at Washington University in St. Louis. His research focuses on geometric measure theory and harmonic analysis, exploring topics such as Nikodym sets, maximal functions, and fractal structures. He holds a Ph.D. in Mathematics from the University of Chicago (2020) and a B.A. from Princeton University (2014). Previously, he was an Instructor at Princeton University under Assaf Naor. Chang has been awarded the NSF Graduate Research Fellowship (2014) and the NSF Mathematical Sciences Postdoctoral Fellowship (2020, declined). His work includes grants like NSF Grant DMS-2247233 (2023–2026). His research interests span geometric measure theory, harmonic analysis, and fractal geometry. Notable contributions include studies on Besicovitch sets, decoupling theory, and the Whitney extension theorem. Chang’s publications address diverse areas such as analytic capacity, Minkowski sums, and Kakeya needle problems, reflecting his expertise in geometric and analytic methods. Grants: NSF Grant DMS-2247233 (2023–2026) Awards: NSF Graduate Research Fellowship (2014), NSF Postdoctoral Fellowship (2020, declined) Chang advises no listed students but has contributed to mentoring through his roles as an instructor and researcher. His work intersects with labs and teams focused on geometric analysis and harmonic functions.

Steve Gonekمشاهده پروفایل

استاد

• Analytic Number Theory
• Riemann Zeta-Function
• L-Functions
• +۱ مورد دیگر

Steve Gonek is Professor of Mathematics at the University of Rochester's School of Arts & Sciences. He received his PhD from the University of Michigan in 1979 and specializes in analytic number theory, particularly the Riemann zeta-function, L-functions, and prime number distribution. His research examines moments of zeta and L-functions, zero distribution properties, and connections between analytic behavior and arithmetic problems. He has held visiting positions at Macquarie University, the American Institute of Mathematics, and the Newton Institute. Analysis of recent publications shows sustained focus on distribution properties of zeta zeros, equivalence relationships between major number theory conjectures, and explicit formulas for L-functions. His work consistently advances analytic methods in number theory.

Damien Vergnaudمشاهده پروفایل

استاد

• Cryptography
• Post-quantum cryptography
• Zero-knowledge proofs
• +۴ مورد دیگر

Dr. Damien Vergnaud is a Full Professor at Sorbonne University since September 2017, affiliated with the ALMASTY research team within LIP6 (Laboratoire d'Informatique de Paris 6), the Computer Science department of the Faculty of Science. His office is located at 4 place Jussieu, Paris, France, in Couloir 24-25, Étage 4, Bureau 412. Dr. Vergnaud holds a doctorate degree in mathematics from Université de Caen Basse-Normandie and an habilitation thesis in computer science from École normale supérieure. His research focuses on the design of efficient and secure cryptographic protocols, theoretical aspects of provable security, number theory, and randomness in cryptography. His work spans multiple domains including post-quantum cryptography, zero-knowledge proofs, secure implementation techniques against side-channel attacks, and cryptographic protocol analysis. He actively investigates how quantum computing impacts traditional cryptographic assumptions and protocols, as evidenced by his supervision of PhD students working on quantum-related cryptographic topics. Dr. Vergnaud's recent publications demonstrate a strong focus on post-quantum cryptographic techniques, zero-knowledge argument systems, and secure implementation methodologies. His research output shows consistent collaboration with both academic researchers and industry partners, particularly in practical cryptographic implementations. His work bridges theoretical foundations with practical security considerations, addressing challenges in modern cryptographic systems including resistance to quantum computing threats and side-channel analysis. Dr. Vergnaud actively supervises PhD students, currently mentoring three doctoral candidates and having successfully guided four students to completion in recent years. His supervision spans diverse topics within cryptography, including post-quantum cryptographic techniques, zero-knowledge arguments, secure implementations against physical attacks, and mathematical studies of pseudorandom number generators. He has served on numerous PhD defense committees, indicating his active role in the academic community. Dr. Vergnaud is a member of the ALMASTY research team at LIP6, which specializes in cryptographic algorithms and protocols. The team works on both theoretical foundations and practical implementations of cryptographic systems, with particular emphasis on security against various attack vectors including quantum computing threats and side-channel analysis.

Martin Bullingerمشاهده پروفایل

عضو هیئت علمی

• Computational Social Choice
• Algorithmic Game Theory
• Computational Complexity
• +۳ مورد دیگر

Martin Bullinger is a Research Associate at the University of Oxford's Department of Computer Science. His research focuses on computational social choice, algorithmic game theory, and combinatorial algorithms. He completed his PhD at the Technical University of Munich (TUM) under Felix Brandt, with a thesis on computing desirable outcomes in coalition formation, and holds a master's degree in Mathematics from TUM. His work bridges theoretical computer science and economics, addressing challenges in coalition formation dynamics, hedonic games, and stability mechanisms. Key contributions include studies on individually stable coalition structures, welfare guarantees in Schelling segregation models, and algorithmic strategies for popular coalition recognition. Prominent publications include 'Reaching Individually Stable Coalition Structures' (ACM TEAC 2023) and 'Welfare Guarantees in Schelling Segregation' (JAIR 2021). His recent research explores online coalition formation stability and fairness in public transportation modeling. No academic awards or grants are explicitly listed in the provided materials. He advises no students, though collaborates with researchers like Edith Elkind (Oxford) and Warut Suksompong (NUS). No dedicated lab affiliations are mentioned.

Laszlo Kozmaمشاهده پروفایل

استادیار

• Data Structures
• Algorithms
• Combinatorics
• +۴ مورد دیگر

László Kozma is an Assistant Professor at Freie Universität Berlin in the Theoretical Computer Science department. He obtained his PhD at Saarland University under Raimund Seidel, followed by postdocs at Tel Aviv University and TU Eindhoven. His work focuses on data structures , combinatorics , and algorithmic adaptivity , with significant contributions to self-adjusting heaps, binary search trees, and geometric optimization. Recent research includes pattern-avoiding sequences and saddlepoint algorithms . His publications span exponential algorithms , TSP variants , and heap structures , with a recurring theme of connecting combinatorial geometry to algorithm design. Co-authors include leading researchers like Robert Tarjan, Uri Zwick, and Haim Kaplan. Key software implementations (e.g., smooth heap ) are publicly available. He has developed tools like Cuckoo Hashing Visualization and the historical WikipediaVision project, demonstrating practical engagement with algorithmic concepts. His mathematical genealogy traces back to classical researchers.