جستجوی استاد راهنمای دانشگاهی

• Theoretical Computer Science
• Algorithms
• Convex Optimization
• +۴ مورد دیگر

Rasmus Kyng is an Assistant Professor in the Department of Computer Science at ETH Zurich, where he has been since 2019. His research focuses on fast algorithms for graph problems, convex optimization, and their applications in machine learning. He has received grants from the Swiss National Science Foundation, including project grants and a starting grant. Education: B.A. in Computer Science from the University of Cambridge (2011), PhD in Computer Science from Yale University (2017), advised by Daniel A. Spielman. Postdoctoral positions included Harvard University (2018–2019) and a research fellowship at the Simons Institute, UC Berkeley (2017). Research Interests: Development of nearly linear-time algorithms for fundamental graph problems (e.g., maximum flow, minimum-cost flow), dynamic graph algorithms, discrepancy theory, and fine-grained complexity. His work bridges numerical linear algebra and combinatorial optimization, emphasizing practical implementations such as the Laplacians.jl package. Awards: FOCS Best Paper Award (2022), Inaugural ICBS Frontiers of Science Award (2022), Machtey Award (Best Student Paper, FOCS 2017). Teaching: Advanced Graph Algorithms and Optimization (ETH Zurich, 2020–2023), Algorithms, Probability, and Computing (ETH Zurich, 2020–2022). Supervised numerous PhD students and mentored postdocs in theoretical computer science. Labs/Teams: Co-leads a research group with Maximilian Probst Gutenberg, focusing on dynamic graph algorithms and optimization. Collaborations include work on sparsification, spectral graph theory, and machine learning applications.

Benny Sudakovمشاهده پروفایل

استاد

• Extremal Graph and Hypergraph Theory
• Ramsey Theory
• Random Structures
• +۵ مورد دیگر

Benny Sudakov is a Professor of Mathematics at ETH Zurich, where he conducts research in combinatorics. He has previously held positions at UCLA, Princeton University, and the Institute for Advanced Study. His work is supported by the SNSF grant 200021_196965. Research Interests: His primary research areas include Extremal Graph and Hypergraph Theory, Ramsey Theory, Random Structures, and the application of Algebraic and Probabilistic Methods in Combinatorics, with strong connections to Theoretical Computer Science. He investigates fundamental structural properties of discrete systems, such as the existence of regular subgraphs, extremal configurations, and the behavior of random combinatorial objects. The recent popular science articles on his work highlight a consistent trend of solving long-standing open problems in extremal combinatorics using sophisticated probabilistic and algebraic techniques. His research spans topics like equiangular lines, graph decompositions, and the emergence of cycles in sparse graphs, demonstrating a deep focus on the interplay between structure and randomness. Scientific Awards: No specific awards are mentioned in the provided text. Advising and Grants: He has advised numerous Ph.D. students, many of whom have gone on to become professors at top universities (e.g., Oxford, Stanford, CMU, ETH, Princeton). His research is currently funded by the Swiss National Science Foundation (SNSF). He has organized workshops and seminars, such as the Theory of Combinatorial Algorithms Mittagsseminar at ETH and a workshop at UCLA on Extremal and Probabilistic Combinatorics. Labs and Teams: He is a key member of the combinatorics group at ETH Zurich and co-organizes the Theory of Combinatorial Algorithms Mittagsseminar, a central forum for research discussions in discrete mathematics at the institution.

Simon Weberمشاهده پروفایل

پژوهشگر

• Unique Sink Orientations
• Computational Complexity
• Combinatorial Algorithms
• +۷ مورد دیگر

Simon Weber is a researcher affiliated with the ETH Zurich (Department of Computer Science). His work focuses on Unique Sink Orientations (USOs) , a combinatorial abstraction of optimization problems like Linear and Quadratic Programming. Simon's research spans three areas: (1) Structure of USOs and their links to Oriented Matroids; (2) Constructions of high-dimensional USOs to analyze algorithm complexity; and (3) Algorithmic improvements for sink-finding. He also explores topics in graph compression, neural networks, and ∃R-complete problems. Key Publications: PhD thesis on USO reductions, ∃R-completeness in neural training, and USO phase analysis. Scientific Contributions: Advances in USO complexity, FPT algorithms for MaxCut, and recognition of geometric hypergraphs and nerves of convex sets. He has supervised multiple theses at ETH Zurich, including topics on USO visualization, MaxCut algorithms, and necklace splitting. His teaching experience includes being a Head Assistant for courses like Geometry: Combinatorics & Algorithms and Topological Data Analysis . Simon's work has been recognized with Best Paper and Best Student Paper Finalist awards at SC19.

Suryanarayana Sankagiriمشاهده پروفایل

پژوهشگر

• Discrete Choice Models
• Recommendation Systems
• Blockchain Security
• +۴ مورد دیگر

Suryanarayana Sankagiri is a postdoctoral researcher at the École Polytechnique Fédérale de Lausanne (EPFL) in Switzerland, affiliated with the Information and Network Dynamics (INDY1) group under Professor Matthias Grossglauser. Previously, he earned his Ph.D. in Electrical & Computer Engineering (2018-2022) from the University of Illinois at Urbana-Champaign , where he was supervised by Bruce Hajek and participated in the Coordinated Science Lab . He also holds an M.S. in Electrical & Computer Engineering from the University of Illinois (2016-2018) and a B.Tech. in Electrical Engineering from the Indian Institute of Technology Bombay (2012-2016). Education : Ph.D., Electrical & Computer Engineering, University of Illinois (2018-2022) M.S., Electrical & Computer Engineering, University of Illinois (2016-2018) B.Tech., Electrical Engineering, IIT Bombay (2012-2016) Suryanarayana's research focuses on discrete choice models and their application to recommendation systems , with a particular emphasis on learning from choice data and developing novel models for human decision-making. His broader interests include blockchain security under adverse network conditions, network dynamics , probabilistic modeling , and algorithm design . Recent work explores nonconvex matrix factorization and contextual dueling bandits for recommendation systems. His publications span theoretical and applied domains, including high-impact venues like ICML , Stochastic Systems , and IEEE Transactions on Networking . Themes include blockchain efficiency , hidden community detection in preferential attachment graphs, and temporal analysis of Indian classical music. Current projects involve refining recommendation systems through sparse comparison data and designing protocols for resilient blockchain networks. Scientific Awards : zkCapital Paper of the Week (2021) Rambus Fellowship (2021) Mavis Future Faculty Fellowship (2019) List of Teachers Ranked as Excellent (2019) Nomination for IIT Bombay Undergraduate Colloquium (2016) Best Poster Award, IIT Bombay Undergraduate Research Symposium (2013) Suryanarayana has advised no students listed in the provided materials. His work has been supported by fellowships such as the Mavis Future Faculty Fellowship and Rambus Fellowship . He contributes to the INDY1 group at EPFL, which investigates information and network dynamics through interdisciplinary approaches combining probability , network theory , and algorithmic design .

• Applied Analysis
• Numerical Analysis
• Data Science
• +۶ مورد دیگر

Leon Bungert is a Professor of Mathematics of Machine Learning at the University of Würzburg, working in applied analysis and numerics with a particular focus on data science and machine learning. His research investigates PDEs and variational models on graphs, adversarial robustness of machine learning, variational regularization, and nonlinear optimization. Dr. Bungert serves as a guest editor for the European Journal of Applied Mathematics, an associate editor for Advances in Continuous and Discrete Models: Theory and Applications, and is a member of the program committee at SSVM 2025. He is also an ELLIS member and actively organizes conferences and workshops, including "MIA'25" at IHP in Paris (January 13-15, 2025), "Synergies of Machine Learning and Numerics" in Osaka (March 11-13, 2025), and "Mathematical Analysis of Adversarial Machine Learning" in Oaxaca (August 17-22, 2025). Research Interests Dr. Bungert's primary research areas include: PDEs on graphs Adversarial robustness in machine learning Inverse problems Optimization Variational problems in L-infinity Nonlinear eigenvalue problems Image reconstruction with structural priors His work bridges theoretical mathematics with practical applications in machine learning, particularly focusing on the mathematical foundations of deep learning and developing robust algorithms that can withstand adversarial attacks. He has made significant contributions to understanding the connections between partial differential equations and machine learning algorithms. Research Trends Analysis of Dr. Bungert's recent publications reveals a strong focus on the intersection of machine learning and mathematical analysis. A key theme is the application of variational methods and partial differential equations to machine learning problems, particularly in understanding and improving the robustness of neural networks against adversarial examples. His work on Lipschitz learning on graphs has established important theoretical foundations for graph-based semi-supervised learning. Additionally, his research on the infinity Laplacian and p-Laplacian equations provides deep insights into the mathematical structure of machine learning algorithms. The development of Bregman learning frameworks for sparse neural networks represents a significant contribution to efficient deep learning model training. Professional Activities Dr. Bungert is actively involved in the academic community through editorial roles and conference organization. His current professional activities include: Guest editor for the European Journal of Applied Mathematics Associate editor for Advances in Continuous and Discrete Models: Theory and Applications Member of the program committee at SSVM 2025 ELLIS member Co-organizer of multiple international conferences and workshops Technical Contributions Dr. Bungert has developed several open-source software packages that implement his theoretical contributions, including: Code for convergence rates of Lipschitz learning on graphs A Bregman training framework for sparse neural networks CLIP: Cheap Lipschitz Training of Neural Networks Nonlinear Power Method for Proximal Operators and Neural Networks Robust Image Reconstruction with Misaligned Structural Information These implementations are primarily in Python and MATLAB, demonstrating his commitment to making theoretical advances accessible for practical applications.

• Distributed Computing
• Parallel Algorithms
• Graph Theory
• +۳ مورد دیگر

Christoph Grunau is a Researcher at ETH Zürich's Theoretical Computer Science department, affiliated with the Professorship for Computer Science. His work focuses on distributed computing, parallel algorithms, graph theory, and network decomposition. He has contributed to advancements in scalable MPC (Massively Parallel Computing) algorithms, efficient parallel derandomization techniques, and deterministic network decomposition methods. His research emphasizes algorithmic efficiency, theoretical guarantees, and applications in distributed systems, quantum computing, and dynamic graph problems. Key contributions include work on graph orientation, dynamic coloring algorithms, and clustering techniques such as k-center and k-means++. His publications span topics like shortest path algorithms with negative edge weights, probabilistic methods for algorithm analysis, and distributed symmetry breaking in sparse graphs. Grunau's research bridges foundational theory with practical distributed computing challenges, addressing scalability and efficiency in both classical and emerging computational frameworks.

• Positional games
• Discrete and computational geometry
• Discrete random structures
• +۲ مورد دیگر

Miloš Stojaković is a Full Professor at the Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia. He has held this position since 2016, following roles as Associate Professor (2011–2016) and Assistant Professor (2006–2011). His research focuses on positional games, discrete and computational geometry, discrete random structures, combinatorial algorithms, and graph theory. He leads the Foundations of Computer Science group since 2018. Stojaković earned his Ph.D. in Computer Science from ETH Zurich (2005), advised by Emo Welzl and Tibor Szabó, and holds M.Sc. and B.Sc. degrees from the University of Novi Sad. He has been recognized with the Dr Z. Đinđić Award (2008) for best young scientist in Vojvodina and the Best Student of University of Novi Sad Award (1998/99). He has advised three Ph.D. students: Mirjana Mikalački, Marko Savić, and Jelena Stratijev. His work spans over 60 publications, including seminal contributions to positional games and computational geometry. He serves on editorial boards of Discrete Mathematics & Theoretical Computer Science and the Novi Sad Journal of Mathematics . Stojaković teaches courses such as Combinatorial Algorithms, Graph Theory, and Theoretical Computer Science at the University of Novi Sad. He has also taught specialized courses on positional games at institutions like the University of Buenos Aires and Eötvös Loránd University Budapest. His research interests emphasize algorithmic and combinatorial aspects of games, geometry, and graph theory.

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

پژوهشگر

• Labor Studies
• Economics of Health
• Economics of Education
• +۵ مورد دیگر

Professor Peter Hull at Brown University focuses on Labor Studies , Economics of Health , Economics of Education , and Applied Econometrics . His research examines systemic discrimination, algorithmic fairness, and policy evaluation using instrumental variable methods. Key Themes : Discrimination in child protection systems, structural estimation in econometrics, shift-share instruments, and healthcare utilization. Methodological Contributions : Developed quasi-experimental tools for measuring unwarranted disparities, non-discriminatory algorithms, and recentered instrumental variables. His recent work includes analyzing school effectiveness, Medicaid crowdout effects, and jury selection bias. Articles highlight Instrumental Variables as central to his empirical approach. Collaborations span leading economists like Josua Angrist , Kirill Borusyak , and Alex Imas . He contributes to AEJ: Applied as an editor and leads workshops on shift-share econometrics.

• Probability Theory
• Random Graphs
• Graph Limits
• +۳ مورد دیگر

Backhausz Ágnes is a Assistant Professor at Eötvös Loránd University's Faculty of Science , specifically in the Department of Probability Theory and Statistics . She also holds a part-time Researcher position at the Alfréd Rényi Institute of Mathematics . Her academic journey includes habilitation and a PhD in Mathematics, focusing on random graph models and their asymptotic properties. Research Group: Struktúrák limeszei (since 2013, part-time since 2015) Grants: ERC Grant on 'Limits of Discrete Structures' (2014–2019) Ágnes specializes in Probability Theory and Random Graphs , with emphasis on graph limits , factor of i.i.d. processes , and spectral theory . Recent publications analyze epidemic spread on multilayer networks, entropy inequalities, and action convergence in graph operators. Her work bridges theoretical mathematics with applications in network science and stochastic processes. Notable awards include the Grünwald Géza Memorial Medal (2014) from the Bolyai János Matematikai Társulat. She actively contributes to academic service as a Supervisor and Training Lead for the Beyond The Edge Marie Curie Doctoral Network (2024–2027) and serves on program committees for conferences like Eurocomb and the European Girls' Mathematical Olympiad . Her teaching portfolio spans Probability Theory, Stochastic Processes, and Mathematical Statistics at both undergraduate and graduate levels.

• Positional games
• Discrete geometry
• Computational geometry
• +۳ مورد دیگر

Miloš Stojaković is a Full Professor at the Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia. He has been with the university since 1999, progressing from student to Assistant Professor (2006-2011), Associate Professor (2011-2016), and Full Professor (2016-present). He leads the Foundations of Computer Science group and serves as an editor for Discrete Mathematics & Theoretical Computer Science and the Novi Sad Journal of Mathematics. Ph.D. in Computer Science, ETH Zurich (2005), advisors: Emo Welzl and Tibor Szabó M.Sc. in Computer Science, University of Novi Sad (2001), advisor: Joviša Žunić B.Sc. in Mathematics and Computer Science, University of Novi Sad (1999) Stojaković's research centers on positional games, discrete and computational geometry, discrete random structures, combinatorial algorithms, and graph theory. His work explores theoretical aspects of combinatorial games, particularly Maker-Breaker type games on graphs and other structures. He investigates geometric properties of discrete structures and develops algorithms for geometric problems. His research has applications in theoretical computer science and combinatorics, with significant contributions to understanding game strategies, structural properties, and computational complexity in discrete settings. Stojaković's recent publications (2016-2025) primarily focus on positional games, extending classical results to new settings like posets, generalized saturation, and constructor-blocker variants. He examines computational complexity aspects and structural properties of game outcomes. His work often involves collaborations with leading researchers including Dan Hefetz, Michael Krivelevich, and Tibor Szabó, demonstrating the ongoing vitality of combinatorial game theory and its connections to other areas of discrete mathematics. "Dr Z. Đinđić Award" for the best young scientist in Vojvodina (2008) "Best Student of University of Novi Sad Award" (1998/99) Stojaković has supervised three PhD students to completion: Mirjana Mikalački (2014), Marko Savić (2018), and Jelena Stratijev (2023). His research has been supported by various grants, including the 1 million RSD grant accompanying the Dr Z. Đinđić Award. He has organized multiple workshops including the Novi Sad Workshop on Foundations of Computer Science series (2015, 2017, 2024) and co-organized the Mini-Workshop on Positional Games at Oberwolfach Research Institute (2018) and the Positional Games workshop within A Sparse (Graphs) Coalition (2021). Since 2018, Stojaković has led the Foundations of Computer Science group at the University of Novi Sad. He maintains active international collaborations, having taught courses at Eötvös Loránd University Budapest, University of Buenos Aires, University of Szeged, University of Banja Luka, University of Groningen, and Graz University of Technology. His research group focuses on theoretical aspects of combinatorial games, discrete geometry, and related computational problems, contributing significantly to these fields through publications, workshops, and academic leadership.

• Cellular Automata
• Artificial Life
• Discrete Dynamical Systems
• +۳ مورد دیگر

Barbora Hudcová is a Lecturer at École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the School of Basic Sciences and the Department of Mathematics . She works under the Chair of Statistical Field Theory and is involved in teaching courses like "Cellular Automata and Models of Artificial Life" through the SMA-ENS program. Her research focuses on computational and dynamical aspects of discrete systems. Research Interests Cellular Automata Artificial Life Discrete Dynamical Systems Computational Complexity Reservoir Computing Statistical Field Theory Publications Her work explores computational hierarchies, complexity transitions, and mathematical structures in cellular automata, with recent contributions to encoding-decoding relations and dynamical cavity methods. Key topics include artificial life modeling, computational universality, and transient behavior analysis in discrete systems.

Miklós Abértمشاهده پروفایل

استاد

• Measured group theory
• Asymptotic group theory
• Spectral theory of graphs and groups
• +۷ مورد دیگر

Miklós Abért is a Professor at the MTA Alfréd Rényi Institute of Mathematics. His research focuses on measured and asymptotic group theory, with specific interests in spectral theory of graphs and groups, Benjamini-Schramm convergence, invariant random subgroups, homology growth, sofic entropy, and cellular automata. He leads the ERC Consolidator Grant research group "Asymptotic invariants of discrete groups, sparse graphs and locally symmetric spaces" (2015–present). Award of the Academy (2023) Rényi Prize (2017) János Bolyai Research Fellowship (2011) Erdős Pál Prize (2010) Grünwald Géza Memorial Medal (2003) His recent work explores the interplay between physical network structures, stochastic processes, and group-theoretic invariants, with applications to spectral radius analysis, torsion growth, and unimodular random trees. He has organized major conferences on measured group theory and collaborated extensively with leading mathematicians.

Rico Zenklusenمشاهده پروفایل

استاد

• Combinatorial Optimization
• Theoretical Computer Science
• Network Optimization
• +۳ مورد دیگر

Prof. Rico Zenklusen is a Full Professor at the Department of Mathematics and Deputy Head of the Institute for Operations Research at ETH Zurich. He previously held positions at Johns Hopkins University and conducted postdoctoral research at MIT and EPFL. His research focuses on Combinatorial Optimization, including algorithm design for complex optimization problems using structures like matroids, submodular functions, and polyhedral methods, with applications in Theoretical Computer Science and Graph Theory. Education: PhD in Mathematics from ETH Zurich Master's degree in Mathematics from EPFL Research Interests: Combinatorial Optimization, Network Design, Submodular Maximization, Matroid Theory, and Applications in Operations Research. His work emphasizes efficient algorithms for optimization problems with real-world applications, such as train engine scheduling, operating room management, and rolling stock scheduling for railways. Grants & Awards: ERC Consolidator Grant (ICOPT) Swiss National Science Foundation Support Students & Advising: Advises PhD and master’s students in optimization and related fields. Current and past students include Adam Kurpisz, Etienne Bamas, and Vera Traub. Visit the group page for project opportunities. Labs & Collaborations: Leads the Zenklusen Group, collaborating on interdisciplinary projects with industries like BLS Cargo (train engine optimization) and the SBB (rolling stock scheduling). Active in ETH Zurich's AI Center for complex system research.

• Computational Geometry
• Algorithm Design and Analysis
• VLSI Computer-Aided Design
• +۳ مورد دیگر

Evanthia Papadopoulou is a Full Professor of Computer Science at the University of Lugano (Università della Svizzera italiana) since 2016. Previously, she was an Associate Professor at USI (2008–2016), a Research Staff Member at IBM T.J. Watson Research Center (1996–2008), and an Assistant Professor at Athens University of Economics and Business (2004–2008). She holds a BS in Mathematics from the University of Athens, an MS in Computer Science from the University of Illinois at Chicago, and a PhD in Computer Science from Northwestern University (1995). Her research focuses on computational geometry, algorithm design, and their applications in VLSI CAD and geometric computing. Key areas include Voronoi diagrams, proximity algorithms, triangulations, and geometric optimization. She has received the IBM Outstanding Innovation Award (2006) and the Technical Accomplishment for IBM Research (2006) for her work on VLSI critical area analysis using Voronoi diagrams. As part of the Dalle Molle Institute for Artificial Intelligence (IDSIA USI-SUPSI), her work integrates theoretical and applied aspects of computational geometry. Her contributions span algorithmic frameworks, geometric data structures, and practical applications in VLSI layout analysis and manufacturing. Her recent research emphasizes high-order Voronoi diagrams, subdivision methods for geometric optimization, and certified approximation algorithms. These advancements address challenges in geometric computing, such as farthest-color Voronoi diagrams and dynamic geometric problems.

Simon Mongeyمشاهده پروفایل

پژوهشگر ارشد

• Labor Market Power
• Macroeconomics
• Monopsony
• +۵ مورد دیگر

Simon Mongey is a Senior Research Economist and Faculty Research Fellow at the Federal Reserve Bank of Minneapolis, with affiliations at the NBER and e61 Institute. He contributes to macroeconomic research, focusing on labor market power, monopsony, and policy implications of market structure. Education : Not explicitly stated Research Interests His work bridges macroeconomics and labor economics, examining oligopsony , minimum wage efficiency , and merger impacts on labor markets . Key areas include general equilibrium modeling , market power quantification , and pandemic policy evaluation . Recent projects analyze discrete choice theory and tax progressivity interactions . Article Trends Simon’s publications since 2021 emphasize labor market monopsony (2024, 2023), merger guidelines (2025), and wage inequality (2025). His empirical work leverages Census data and online job postings (2023) to quantify market dynamics. Scientific Awards NSF Grant #2214431 (2022) NSF Grant #2214460 (2022) Simon Mongey’s research informs antitrust policy and macroeconomic labor frameworks . He develops quantitative models for market power, merger effects, and pandemic responses, with methodological contributions to recruiting intensity and firm dynamics .