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

Imre Z. Ruzsa is a Research Professor at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences since 1989, head of the Department of Number Theory since 1991. He is also part-time faculty at Central European University. Education: B.S. in Mathematics, Eötvös Loránd University, Budapest (1976) Candidate of Sciences (Ph.D. equivalent) (1979) Doctor of Sciences (D.Sci.) (1990) Research Interests: A leading expert in Additive Combinatorics and Number Theory , his work bridges Probabilistic Number Theory and Combinatorics , focusing on sumsets, Sidon sequences, and entropy connections. His Additive Number Theory contributions include structural theorems and linear equation solutions in integer sets. Scientific Awards: Fellow of the American Mathematical Society (2012) Rollo Davidson Prize (1986) Pichoridis Distinguished Lecturer (2007) Academy Prize (1995) Erdõs Prize (1988) Corresponding Member (1998) and Full Member (2004) of the Hungarian Academy of Sciences Labs/Teams: Head of the Department of Number Theory at the Alfréd Rényi Institute, leading collaborative research in additive structures and probabilistic methods in number theory.

• Additive combinatorics
• Number theory
• Probability theory
• +۲ مورد دیگر

Chris Dowden is a Research Fellow at the Institute of Discrete Mathematics, Graz University of Technology. His research project 'Asymptotic properties of graphs on a surface', funded by the Austrian Science Fund (FWF Grant P27290), investigates combinatorial and probabilistic aspects of graphs embeddable on 2-dimensional surfaces. Key focus areas include random planar graphs, genus evolution, and extremal graph properties. Recent publications analyze topological constraints in random graphs, with works examining genus evolution in Erdős-Rényi models, surface embedding phase transitions, and extremal problems for cycle-free planar graphs. Research employs combinatorial probability, asymptotic analysis, and topological graph theory to establish fundamental properties of random graph embeddings. Teaching activities include courses in Analytic Combinatorics and Probabilistic Methods in Combinatorics and Algorithmics. No awards, student advisements, or laboratory information are detailed in available sources.

• Graph Theory
• Random Graphs
• Combinatorics
• +۲ مورد دیگر

Vladimir Kolmogorov is a Professor at the Institute of Science and Technology Austria (IST Austria), leading the Kolmogorov Group focused on Discrete Optimization. He previously held positions as Assistant Professor at IST Austria (2011–2014), Lecturer at University College London (2005–2011), and Associate Researcher at Microsoft Research (2003–2005). His research spans algorithm development for graphical models, combinatorial optimization, and applications in computer vision. Education: M.S. in Applied Mathematics and Physics from the Moscow Institute of Physics and Technology, and Ph.D. in Computer Science from Cornell University (2003). Research interests include complexity classifications, algorithm design for discrete optimization problems (e.g., max-flow, min-cost matching), and applications in computer vision. Notable contributions include the 'Boykov-Kolmogorov' max-flow algorithm and 'Blossom V' for minimum cost perfect matching. Honors include the ERC Consolidator Grant (2014–2019), Koenderink Prize (2012), and best paper awards at CVPR and ECCV. His work on optimization algorithms and theoretical complexity has significantly impacted computer vision and combinatorial optimization fields. Advising and grants: Supervised multiple PhD students and postdocs, with current advisees including Martin Dvořák and Pavel Arkhipov. His team explores inference in graphical models, combinatorial optimization, and discrete optimization theory.

• Discrete Optimization
• Combinatorial Optimization
• Global Optimization
• +۳ مورد دیگر

William Peden is a Postdoctoral Researcher at the Institute for Philosophy and Philosophy of Science , Johannes Kepler University Linz, Austria. He previously held positions at Lingnan University (Research Assistant Professor, 2022-2023), Erasmus University Rotterdam (Postdoctoral Researcher, 2020-2022), Polytechnic University of the Marche (Research Fellow, 2019-2020), and Durham University (PhD and Postdoc, 2013-2019). His research focuses on applying formal epistemology to statistical and probabilistic reasoning in economics and artificial intelligence. PhD in Philosophy (2013-2017), Durham University MPhil in History, Philosophy, and Sociology of Science, Technology, and Medicine (2011-2012), Cambridge University MA in Philosophy (2006-2010), Edinburgh University His research explores statistical reasoning through frameworks like Henry E. Kyburg's Evidential Probability and Jon Williamson's Objective Bayesianism, addressing issues in decision theory , inductive logic , probability , and AI epistemology . He uses agent-based modeling to compare reasoning frameworks under ambiguity. His recent publications investigate Bayesianism vs. Imprecise Probability , statistical testing economics , and philosophy of machine learning . He co-authored studies on publication market incentives , personalized medicine evidence , and Keynesian probability theory . William contributes to debates about inductive skepticism , Bayesian updating , and philosophy of economic modeling . He collaborates with researchers across Italy, Netherlands, and the UK.

• Philosophy of Statistics
• Philosophy of Probability
• Philosophy of Artificial Intelligence
• +۴ مورد دیگر

Michał Karoński is a Professor of Mathematics at Adam Mickiewicz University in Poznań, Poland, where he heads the Department of Discrete Mathematics at the Faculty of Mathematics and Computer Science. He is renowned for his work in random discrete structures, probabilistic combinatorics, graph theory, and algorithm design. Academic Leadership: Co-founded the international journal Random Structures & Algorithms in 1990 and serves as its Editor-in-Chief alongside Noga Alon and Andrzej Ruciński. International Collaborations: Active in global research, holding visiting professorships at Emory University (since 1992), Johns Hopkins University, Purdue University, and Southern Methodist University. Conducted research at institutions including Bellcore, Microsoft Research, BRICS, and the Isaac Newton Institute. Conference Organization: Chaired 17 bi-annual conferences on random structures and algorithms since 1983, hosted in Poznań, Atlanta, Tel Aviv, and Pittsburgh. Policy & Governance: Served on Poland's Committee for Scientific Research (2004-2005), the Research Council (2005-2010), and as Chairman of the National Science Centre Council (2010-2016). Research Impact: His work bridges discrete mathematics and theoretical computer science, influencing fields such as random graphs, probabilistic methods, and algorithmic design. He has authored 60 publications and delivered over 30 plenary lectures worldwide. Scientific Awards 2016: Medal Homini Vere Academico 2013: Order of Polonia Restituta Officer Cross 1990: Minister of Science and Higher Education Prize

• Discrete Mathematics
• Theoretical Computer Science
• Random Discrete Structures
• +۳ مورد دیگر

Jan Niclas Dreier is a PostDoc Researcher at TU Wien's Department of Algorithms and Complexity. His research focuses on theoretical computer science, particularly algorithmic meta-theorems, structural graph theory, and computational complexity. He is affiliated with projects such as REVEAL-AI and SLIM. His work addresses topics like monadic stability, SAT solving, and model checking on sparse graph classes. Research Interests : Dreier's primary areas include algorithm design, parameterized complexity, and logic in computer science. His contributions span model checking for graph classes, backdoor analysis in SAT solving, and combinatorial properties of monadic dependence. Recent work explores the interplay between structural graph theory and algorithmic efficiency, with applications to finite model theory and pseudorandom models. Teaching : He teaches courses such as Algorithmic Meta-Theorems , Algorithmics , and Bachelor Thesis in Computer Science . His courses emphasize theoretical foundations and practical algorithmic techniques. Projects : Active involvement in the REVEAL-AI project (2020–2024) and SLIM (2019–2024), focusing on algorithmic advancements in AI and structural graph analysis.

• Algorithmics
• Computational Complexity
• Graph Theory
• +۳ مورد دیگر

Philipp Sprüssel is a Senior Lecturer at Graz University of Technology's Institute of Discrete Mathematics. His research focuses on Random Graphs , Enumerative Combinatorics , and Phase Transitions , with particular emphasis on graphs on surfaces, hypergraphs, and simplicial complexes. He has organized conferences like the Random Structures and Algorithms and contributed to workshops on enumerative combinatorics and phase transitions. His academic career includes roles as a Postdoctoral Researcher at the University of Haifa and the University of Oxford, and a DAAD-funded position at the University of Hamburg. He holds a PhD from the University of Hamburg (2010). Teaching responsibilities span courses in Analytic Combinatorics , Discrete Mathematics , and Mathematics for Engineering , with recent activities in 2023. Research grants include an FWF-funded project on graphs on surfaces. Key contributions include studies on cohomology groups of random simplicial complexes, phase transitions in graph evolution, and symmetry characterization of unlabelled triangulations. His Erdős number is 2.

• Random Graphs
• Enumerative Combinatorics
• Phase Transitions
• +۳ مورد دیگر

Bernhard Gittenberger is an Associate Professor at the Institute of Discrete Mathematics and Geometry at TU Wien. His research focuses on enumerative combinatorics, analysis of algorithms, and probability theory, particularly stochastic processes in combinatorial structures. He has advised numerous Master's and PhD students, contributing to advancements in discrete mathematics and algorithmic analysis. Affiliation: TU Wien, Institute of Discrete Mathematics and Geometry Roles: Academic Researcher, Educator, PhD Advisor His work encompasses lattice paths, tree structures, phylogenetic networks, and analytic combinatorics. He has been involved in multiple research projects, including FWF-funded initiatives and collaborations with institutions like Université de Versailles and Academia Sinica. Key contributions include studies on asymptotic enumeration, probabilistic methods in combinatorics, and algorithmic analysis of discrete structures. His scientific achievements include the Jubiläums-Studienpreis from the Austrian Mathematical Society in 1996.

• Enumerative Combinatorics
• Analysis of Algorithms
• Probability Theory
• +۴ مورد دیگر

Prof. Benedikt Stufler is a Professor of Mathematics at Technische Universität Wien's Institute of Discrete Mathematics and Geometry. His research focuses on the interplay between combinatorics and probability, particularly the analysis of random structures such as graphs, trees, and maps. He holds a Habilitation in Mathematics (2022) and a Doctorate from Ludwig-Maximilians-Universität München (2015). Education: Habilitation in Mathematics, TU Wien (2022) Doctorate in Mathematics, LMU Munich (2015) Master's (Diplom-Mathematiker), LMU Munich (2013) Study abroad at Universidad de Buenos Aires (2011) Research Interests: His work combines stochastic methods with combinatorial constructions to study models of random structures. Key areas include: Limits of random structures (Gromov-Hausdorff-Prokhorov convergence) Branching processes and random maps Enumerative combinatorics and Gibbs partition models Phase transitions in weighted graphs Algorithmic sampling of combinatorial structures Recent Grants: FWF Project 'Limits of random networks' (2024–2027, €435k) Principal Investigator in SFB 'Discrete Random Structures' (2024–2028, €3.9M total) Lab/Group: Current members include postdoc Dr. Colin Desmarais and PhD students Niccolò Bosio and Philipp Beltran. He supervises master's theses in probability theory.

• Combinatorics
• Probability Theory
• Random Structures
• +۵ مورد دیگر

Robert Tichy is a full Professor at the Institute of Analysis and Number Theory, Technische Universität Graz. His research spans number theory, stochastic analysis, and computational mathematics. He has held significant administrative roles including Department Head (1994-2000), Dean of Mathematical and Physical Sciences (2003-2009), and Vice-Dean (2010-2017). Tichy is a Corresponding Member of the Austrian Academy of Sciences and has served on editorial boards for journals like the Journal of Number Theory and The Ramanujan Journal .

• Uniform Distribution
• Discrepancy Theory
• Diophantine Equations
• +۷ مورد دیگر

Florian Schreier-Aigner is a Research Fellow and PostDoc at the University of Vienna's Department of Mathematics, where he leads the FWF Stand-Alone Project Symmetric polynomials and (arrowed) monotone triangles . He is an active member of Christian Krattenthaler's combinatorics group and supervises both PhD and Master's students. His academic background includes: PhD in Mathematics, University of Vienna (2015-2019) Master in Mathematics, University of Vienna (2014-2015) Bachelor in Mathematics, University of Vienna (2010-2014) Schreier-Aigner's research focuses on algebraic, enumerative, and bijective combinatorics, with connections to representation theory, statistical physics, probability theory, and geometry. Specific interests include symmetric functions, alternating sign matrices, plane partitions, Catalan combinatorics, and probabilistic aspects of combinatorial structures. His work frequently explores connections between discrete mathematics and theoretical physics. Recent publications demonstrate a strong emphasis on combinatorial structures like alternating sign matrices, plane partitions, and symmetric functions, often employing probabilistic methods and exploring connections to representation theory. His work consistently appears in top combinatorics journals and features collaborations with international researchers. Awards and fellowships: Erwin Schrödinger Fellowship (2019-2021) He currently advises: PhD student: Julia Hörmayer (since 2024) Master's student: Christian Theiner (since 2024) He leads the FWF-funded project on symmetric polynomials and monotone triangles. Schreier-Aigner is an active member of the combinatorics research group at the University of Vienna and regularly presents at international conferences including FPSAC and Séminaire Lotharingien de Combinatoire.

• Algebraic Combinatorics
• Enumerative Combinatorics
• Bijective Combinatorics
• +۸ مورد دیگر

Gerald Kuba is ao. Univ. Prof. (Associate Professor) at the University of Natural Resources and Life Sciences, Vienna (BOKU) , Institute of Mathematics, Gregor-Mendel-Straße 33, 1180 Wien. His research centres on analytic number theory, lattice-point problems, enumeration of discrete structures such as metric spaces, topologies, and Hamel bases, and set-theoretic real analysis. He has been involved in three Austrian Science Fund (FWF) projects led by Werner Georg Nowak, serving as sub-project leader or scientific staff between 1998 and 2012, all devoted to lattice points and analytic number theory. Since then he has continued an active solo publication record with over 80 refereed articles. Research interests Analytic number theory & lattice-point asymptotics Enumerative combinatorics of metric, ultrametric and ordered spaces Set-theoretic real analysis – decompositions of ℝ, Cantor sets, saltus functions Functional equations and didactics of mathematics Recent publications (2025-2021) explore connected Hamel bases in Hilbert spaces, functional equations of Cauchy type, Cantor sets as fields, and counting discrete structures, illustrating a persistent focus on combining classical analysis with enumerative problems. Presentations & outreach Invited talk “On the differentiability of certain saltus functions” , Mathematics Colloquium, University of Vienna, 2009 No doctoral students or supervised theses are recorded in the BOKU database under his name; no personal grants after 2012 are shown. He remains affiliated with the Institute of Mathematics and continues to publish actively, hence is regarded as an active faculty member.

• Analytic number theory
• Lattice-point problems
• Discrete geometry
• +۳ مورد دیگر

Prof. Michael Drmota is a distinguished academic at TU Wien's Department of Combinatorics and Algorithms, part of the Faculty of Mathematics and Geoinformation. He leads research in discrete mathematics, focusing on combinatorics, number theory, and random discrete structures. His work bridges pure mathematics with applications in computer science and statistical physics. Research Interests: Drmota's expertise spans analytic combinatorics, additive number theory, random graph theory, and the study of automatic sequences. He explores topics like prime number distributions, planar map structures, and stochastic processes in discrete systems. His methods often involve generating functions, singularity analysis, and probabilistic techniques. Key Projects: He coordinates major research initiatives including Arithmetic Randomness , Shape Characteristics of Planar Maps , and Infinite Singular Systems . These projects investigate foundational questions in combinatorics and number theory, with implications for algorithm design and mathematical physics. Advising & Collaboration: Drmota supervises graduate students and collaborates internationally. Notable advisees include Andreas Nessmann (discrete polyharmonic functions), Lucas Unterberger (Erdős-Ko-Rado theorems), and Guan-Ru Yu (pattern occurrences in planar maps). His work appears in top-tier journals and conference proceedings. Labs/Teams: Active in TU Wien's Network Lab , he fosters interdisciplinary research on complex networks and algorithmic combinatorics.

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

Ruzsa Imre Z. is a Research Professor and Head of the Department of Number Theory at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences since 1976. He holds a part-time faculty position at the Central European University. Elected as a corresponding member of the Hungarian Academy of Sciences in 1998 and elevated to full membership in 2004. His research focuses on additive combinatorics, probabilistic and combinatorial number theory, and probability theory. Education: 1976: Graduated from Eötvös Loránd University, Budapest. Candidate of Sciences (PhD equivalent, 1979) and Doctor of Sciences (D.Sci., 1990) from the Hungarian Academy of Sciences. Research Interests: Explores connections between number theory and probability, including probabilistic number theory, additive number theory, and decomposition of probability measures. His work bridges combinatorial and probabilistic approaches in number theory and probability theory. Awards & Honors: 1986 Rollo Davidson Prize (shared with G. J. Székely). 2012 Fellow of the American Mathematical Society. Multiple invitations to speak at major international congresses (IMC 2006, ECM 2004). National and international prizes including the Erdős Prize (1988) and Kató Rényi Prizes (1971–1974). Advising & Grants: No specific advisees or grants listed; focus on research publications. Visiting Positions: Held visiting roles at institutions including the University of Bordeaux, University of Ulm (Humboldt Stipendium), University of Michigan, and Rutgers University.

• Additive combinatorics
• Number theory
• Probability theory
• +۴ مورد دیگر

Endre Szemerédi is a Hungarian mathematician and computer scientist, currently serving as a Permanent Research Fellow at the Alfréd Rényi Institute of Mathematics (Hungarian Academy of Sciences) and holding the New Jersey Professor of Computer Science position at Rutgers University since 1986. His career spans prestigious institutions including Stanford, Caltech, and the Institute for Advanced Study. Expertise: Discrete mathematics, combinatorics, theoretical computer science, and number theory. Education: M.Sc. (1965, Eötvös Loránd University), Ph.D. (1970, Moscow State University under Israel Gelfand). Research legacy encompasses foundational contributions to combinatorics, graph theory, and computational complexity. His work on Hamiltonian cycles in random graphs , parallel sorting networks , and the Blow-up Lemma revolutionized extremal combinatorics and algorithm design. Scientific honors include: 2012 Abel Prize and Széchenyi Prize 2008 Rolf Schock Prize and Steele Prize 1982 Member of Hungarian Academy of Sciences , 2010 Member of US National Academy of Sciences 1975 Pólya Prize , 1973 Rényi Prize , multiple Grünwald Prizes .

• Discrete mathematics
• Combinatorics
• Theoretical computer science
• +۱ مورد دیگر