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

Ronald Parrمشاهده پروفایل

استاد

• Reinforcement Learning
• Markov Decision Processes
• Artificial Intelligence
• +۳ مورد دیگر

Ronald Parr is a Professor of Computer Science in the Department of Computer Science at Duke University's Pratt School of Engineering. He has been at Duke since 2000, progressing from Assistant Professor to Associate Professor with tenure, and ultimately to Full Professor. From 2014 to 2017, he served as Department Chair and delivered graduation speeches in 2015, 2016, and 2017. Dr. Parr received his Ph.D. in Computer Science from the University of California, Berkeley in 1998, with a dissertation titled "Hierarchical Control and Learning in Markov Decision Processes" under advisor Stuart Russell. He earned his A.B. in Philosophy, cum laude, from Princeton University in 1990. His primary research focuses on methods for solving large stochastic planning problems using Markov Decision Processes and approximate dynamic programming techniques. His work spans reinforcement learning, value function approximation, game theory, sensing, and robotics. Dr. Parr's research has been consistently funded by major agencies including NSF, DARPA, and ARO, with recent projects focusing on feature encoding for reinforcement learning, neurosymbolic hierarchical reinforcement learning, and reasoning in large, structured, uncertain domains. His publication record demonstrates consistent contributions to top venues including NeurIPS, ICML, and AAAI, with work that bridges theoretical foundations and practical applications. Dr. Parr has received numerous honors including being elected as an AAAI Fellow in 2023, receiving an AAAI Outstanding Paper Honorable Mention in 2013, winning the IJCAI-JAIR Best Paper Award in 2007, receiving an NSF CAREER award in 2006, and being named an Alfred P. Sloan Fellow in 2003. He has advised ten graduate students to completion across various research areas within AI and robotics. His research has been supported by over $1.5 million in direct funding to his lab, with additional collaborative funding from multiple NSF, DARPA, and ARO grants. Dr. Parr has served extensively on program committees for major AI conferences including ICML, NeurIPS, AAAI, and UAI, and has held leadership roles such as Program Co-Chair and General Chair for UAI. Dr. Parr maintains an active research group focused on reinforcement learning and sequential decision making, with ongoing projects in neurosymbolic AI, hierarchical reinforcement learning, and interpretable machine learning models, continuing to bridge theoretical foundations with practical applications in robotics and AI systems.

Daniel M. Kaneمشاهده پروفایل

استاد

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

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.

Constantinos Daskalakisمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Game Theory
• +۶ مورد دیگر

Constantinos Daskalakis is the Armen Avanessians (1982) Professor in the MIT Schwarzman College of Computing and the Department of Electrical Engineering and Computer Science (EECS). He joined MIT in 2009 and is a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), affiliated with the Laboratory for Information and Decision Systems (LIDS) and the Operations Research Center (ORC). His research focuses on theoretical computer science, with emphasis on game theory, machine learning, and high-dimensional statistics. Education: Ph.D. in Computer Science (not explicitly stated, but implied by tenure and awards). Research interests include computational complexity of Nash equilibria, multi-item auctions, machine learning algorithms, and causal inference. His work bridges game theory, economics, probability, and statistics, with applications in AI and healthcare. Key contributions include resolving long-standing problems in computational game theory and developing efficient methods for statistical hypothesis testing. He has been recognized with the 2018 Nevanlinna Prize, ACM Grace Murray Hopper Award, and the Kalai Game Theory Prize. Affiliations: CSAIL, LIDS, ORC, and the Foundations of Data Science Institute. Active in multi-agent learning, bias mitigation in data, and generative models.

Igors Gorbovickisمشاهده پروفایل

دانشیار

• Dynamical Systems
• Complex Analysis
• Discrete Geometry
• +۳ مورد دیگر

Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.

• Machine Learning
• Artificial Intelligence
• Data Science
• +۷ مورد دیگر

Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University. Previously, Xu was a Postdoctoral Scholar Research Associate at Caltech's Department of Computing and Mathematical Science and earned a Ph.D. in Computer Science from UCLA. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong empirical performance and theoretical guarantees. Xu's research interests center around Machine Learning with broad applications in Artificial Intelligence, Data Science, Optimization, Reinforcement Learning, and High Dimensional Statistics. The research specifically targets real-world problems in Bioinformatics and Healthcare, with recent work emphasizing distributionally robust decision making, efficient exploration strategies, and multi-agent systems. Xu has developed novel algorithms that address the challenges of exploration in sequential decision making and robustness to distributional shifts between training and deployment environments. Xu's recent publications demonstrate a strong trend toward developing theoretically grounded yet practical algorithms for reinforcement learning and bandit problems, with particular emphasis on distributionally robust methods, efficient exploration techniques, and applications to healthcare. The work spans both theoretical analysis (providing minimax optimal regret bounds) and practical implementations (validated on benchmarks like Atari games and real healthcare datasets). Whitehead Scholar award from Duke University School of Medicine (2023) Best Paper Award at ACM FAccT 2023 for Queer In AI paper PIMCO Postdoctoral Fellowship in Data Science (2022) TMLR Featured Certification (2023) NSF award on approximate sampling based exploration (2023) Xu actively mentors multiple Ph.D. students across Duke's Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering programs, with several alumni now pursuing doctoral studies at top institutions. The research group has secured competitive funding including an NSF award for approximate sampling based exploration for sequential decision making. Xu serves as an action editor for TMLR and as an area chair for major conferences including ICML, NeurIPS, AAAI, ICLR, and AISTATS. Xu leads a dynamic research group focused on sequential decision making, with projects spanning theoretical algorithm development, implementation of practical systems, and applications to healthcare and bioinformatics. The group maintains active collaborations across Duke's medical and engineering schools, with recent work applying machine learning to epidemic forecasting during the pandemic.

• Number Theory
• Diophantine Geometry
• Arithmetic Algebraic Geometry
• +۳ مورد دیگر

Prof. Dr. Philipp Habegger is a faculty member at the University of Basel's Department of Mathematics and Computer Science . His research focuses on Number Theory , specifically Diophantine Geometry, heights on abelian varieties, unlikely intersections, and algebraic number theory. He leads the Research Group in Number Theory and participates in collaborative seminars like the Number Theory Web Seminar with Mike Bennett and Alina Ostafe. Contact : philipp.habegger@unibas.ch | +41 61 207 26 98 Office : Spiegelgasse 1, 4051 Basel, Switzerland Academic Role : Research and teaching in number theory and Diophantine problems Research Overview Habegger's work addresses fundamental questions about the distribution of special points on algebraic varieties and the arithmetic properties of polynomial dynamics. His recent publications analyze degeneracy loci in abelian families, canonical heights, and the geometric Bogomolov conjecture. The 15 most recent articles reflect a focus on number theory, algebraic geometry, and effective bounds in Diophantine problems. Scientific Collaborations Collaborated with Ziyang Gao, Harry Schmidt, Umberto Zannier, and others Contributed to journals: Annals of Mathematics , Forum of Mathematics, Sigma , Compositio Mathematica Key themes: Abelian varieties , Heights , Unlikely intersections , CM jacobians

• Theoretical Computer Science
• Graph Algorithms
• Dynamic Algorithms
• +۷ مورد دیگر

Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.

• Nonparametric Statistics
• High Dimensional Data Analysis
• Statistical Methods in Finance
• +۷ مورد دیگر

Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.

John MacLaren Walshمشاهده پروفایل

استاد

• Information Theory
• Network Coding
• Distributed Computing
• +۴ مورد دیگر

John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.

• Dynamical systems
• Arithmetic geometry
• Complex analysis
• +۳ مورد دیگر

Laura DeMarco is a Professor of Mathematics at Harvard University and holds the Radcliffe Alumnae Professorship at the Radcliffe Institute for Advanced Study. She is affiliated with the Department of Mathematics at Harvard's Science Center (Office 337). Her research focuses on dynamical systems, arithmetic geometry, and complex analysis, with a particular emphasis on algebraic dynamics and the interplay between geometry and number theory. DeMarco earned her Ph.D. in Mathematics from Harvard University in 2002, with a thesis on holomorphic families of rational maps. Her work explores topics such as preperiodic points, moduli spaces of dynamical systems, and arithmetic equidistribution. She has organized events like the Algebraic Dynamics Seminar and participates in conferences worldwide, including the 2025 Diophantine approximation conference in France. Her research publications analyze geometric and arithmetic properties of dynamical systems, such as the geometry of preperiodic points, bifurcation measures, and the classification of polynomial basins of infinity. Her studies often bridge algebraic geometry, complex dynamics, and number theory, contributing to foundational questions in arithmetic dynamics. DeMarco has collaborated extensively with researchers like N. M. Mavraki, H. Krieger, and X. Wang, advancing topics like bounded geometry in dynamical families and uniform results in the Manin-Mumford conjecture. Her work has been published in leading journals such as the Annals of Mathematics, Compositio Mathematica, and the Journal of the European Mathematical Society.

Nati Srebroمشاهده پروفایل

استاد

• Machine Learning
• Optimization
• Deep Learning
• +۴ مورد دیگر

Nati Srebro is a Professor at the Toyota Technological Institute at Chicago with a cross-appointment as a Part-Time Professor in the Department of Computer Science and Committee on Computational and Applied Mathematics at the University of Chicago. He earned his PhD from MIT in 2004 and has held previous positions including post-doctoral fellow at the University of Toronto, Visiting Scientist at IBM, and Associate Professor at the Technion. Professor Srebro's research focuses on methodological, statistical and computational aspects of Machine Learning and Optimization. His work spans foundational contributions to learning theory, matrix reconstruction, and optimization techniques. He is particularly known for introducing the use of nuclear norm for machine learning, work on wider Markov networks, and advancing our understanding of the relationship between learning and optimization. His current research interests include understanding deep learning through optimization, distributed and federated learning systems, algorithmic fairness, and practical adaptive data analysis. His publication record shows consistent contributions to core machine learning conferences and workshops, with recent work focusing on symmetric and asymmetric hashing techniques, matrix parameter learning, and optimization methods. The publications demonstrate a strong theoretical foundation with practical applications across various machine learning domains. Professor Srebro has been actively involved in several research programs including the Federated and Collaborative Learning program (Spring 2026, as Visiting Scientist and Program Organizer), Modern Paradigms in Generalization (Fall 2024), and multiple summer clusters on Deep Learning Theory and Fairness. His program participation reflects his leadership in emerging areas of machine learning research. Contact: nati@ttic.edu | (773) 834-7493 | Toyota Technological Institute at Chicago, 6045 S. Kenwood Ave., Chicago, IL 60637

• Machine Learning
• Deep Learning
• Foundation Models
• +۱۱ مورد دیگر

Bo Han is an Associate Professor in the Department of Computer Science at Hong Kong Baptist University's Faculty of Science, where he leads the Trustworthy Machine Learning and Reasoning (TMLR) Group. He also holds a visiting scientist position at the RIKEN Center for Advanced Intelligence Project (RIKEN AIP) in Japan. His research focuses on developing trustworthy and efficient machine learning systems, particularly under imperfect data conditions such as noisy labels, out-of-distribution data, and weak supervision. Bo Han's research interests span Machine Learning , Deep Learning , Foundation Models , Causal Representation Learning , Weakly and Self-supervised Learning , Robustness and Security in Machine Learning , Federated Learning , and AI for Science . His work aims to build intelligent systems that can reliably learn and reason from complex, imperfect real-world data. His recent publications reveal a strong trend toward trustworthy foundation models , robust reasoning with large language models , out-of-distribution detection , privacy-preserving learning , and causal robustness . His research integrates theoretical foundations with practical applications, often published in top-tier venues like NeurIPS, ICML, ICLR, and TPAMI. Notable Awards and Honors: Outstanding Paper Award, NeurIPS Most Influential Paper, NeurIPS IEEE AI's 10 to Watch Award IJCAI Early Career Spotlight INNS Aharon Katzir Young Investigator Award Dean's Award for Outstanding Achievement RGC Early CAREER Scheme Bo Han has been actively involved in the academic community, serving as a Senior Area Chair and Area Chair for NeurIPS, ICML, and ICLR, and as an Associate Editor for IEEE TPAMI, MLJ, and JAIR. He has advised numerous PhD and research students and leads a globally distributed research group. His work is supported by major grants from RGC, NSFC, GDST, RIKEN, and industry partners including Microsoft, Alibaba, Tencent, and Baidu. He also leads research initiatives in Trustworthy Machine Learning , including projects on federated learning, model unlearning, privacy-preserving AI, and robust foundation models, often in collaboration with industry and international institutions.

Erik Waingartenمشاهده پروفایل

استادیار

• Algorithms for Massive Datasets
• High-dimensional Geometry
• Property Testing
• +۵ مورد دیگر

Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song

Betsy Stovallمشاهده پروفایل

استاد

• Harmonic Analysis
• Fourier Analysis
• Partial Differential Equations
• +۲ مورد دیگر

Betsy Stovall is a Professor of Mathematics at the University of Wisconsin–Madison and holds the Letters and Science Mary Herman Rubenstein Professor chair. She serves as the AMS Associate Secretary for the Central Section . Education : Not explicitly stated in provided text. Appointments : Regular faculty at UW–Madison since at least 2012 Organizer of graduate analysis seminars Research Interests : Stovall specializes in harmonic analysis , focusing on operators involving curvature, oscillatory integrals, and Fourier restriction phenomena. Her work intersects with partial differential equations (PDEs) through the study of dispersive equations and geometric analysis problems. Teaching : Complex Analysis (Math 623) - Fall 2021 Calculus III (Math 234) - Fall 2020 Graduate Analysis Seminar - Spring 2022 Organized UW Madison undergraduate summer school in Analysis (2018) Scientific Contributions : Sole or joint author of 15+ publications NSF RTG grant in Analysis and PDE Active in harmonic analysis seminars and educational initiatives Administrative Roles : AMS Associate Secretary Co-organizer of RTG/Student seminars Summer school director

• Algorithms on Discrete Structures
• Parameterized Algorithms
• Structural Graph Theory
• +۴ مورد دیگر

Michał Pilipczuk is an Associate Professor at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His research focuses on theoretical computer science, particularly algorithms on discrete structures, parameterized algorithms, structural graph theory, and logic in computer science. He leads the ERC-funded project "BOBR: Decomposition Method for Discrete Problems" and previously led a grant on optimality in parameterized complexity funded by the Polish National Science Center. His research interests include parameterized algorithms , structural graph theory , graph algorithms , and computational complexity . He has made significant contributions to the understanding of problems such as Independent Set in restricted graph classes, graph editing problems, and structural decompositions. The recent publications highlight a strong focus on structural graph theory and exact algorithms . Key themes include quasi-polynomial time algorithms for Independent Set in claw-free graphs, diameter computation in bounded genus graphs, and kernelization in trivially perfect graphs. His work often bridges combinatorial insights with algorithmic applications, particularly in the context of parameterized complexity. Principal Investigator, ERC Grant BOBR: Decomposition Method for Discrete Problems (2021–2026) Principal Investigator, Polish National Science Center Grant on Optimality in Parameterized Complexity (2014–2017) He has advised or collaborated with several researchers, including Marcin Wrochna and Marcin Pilipczuk. His work is published in top venues such as STOC, SODA, ESA, and ICALP.