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

Ruzsa Imre Z.مشاهده پروفایل

استاد پژوهشی

• Additive combinatorics
• Number theory
• Probability 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.

• Discrete Mathematics
• Applied Mathematics
• Optimization
• +۳ مورد دیگر

Franz Rendl is a Full Professor at the Institute of Discrete Mathematics, University of Klagenfurt, since October 1, 1998. His contact email is frendl@tugraz.at, and he holds a teaching authorization in Applied Mathematics. Research interests include: Discrete Mathematics Optimization algorithms Operations Research Theoretical Computer Science Additional information available through TU Graz systems includes consultation hours and research portal (PURE) records.

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

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.

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

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.

Arne Winterhofمشاهده پروفایل

پژوهشگر

• Finite Fields
• Number Theory
• Coding Theory
• +۵ مورد دیگر

Arne Winterhof is a Senior Fellow at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences. He holds the title of University Lecturer (Univ.-Doz.) and has extensive experience in academic leadership, including project leadership roles in multiple FWF-funded research projects. His primary affiliation is with RICAM's Applied Discrete Mathematics and Cryptography group. Winterhof earned his Diploma (summa cum laude) and PhD (summa cum laude) in Mathematics from TU Braunschweig (1994, 1996) and completed his Habilitation at the University of Vienna in 2001. He has held positions at institutions such as Temasek Laboratories (National University of Singapore) and has been a Senior Scientist and Fellow at RICAM since 2003. In 2016, he declined a Full Professorship offer at the University of Rostock. His research focuses on Finite Fields, Number Theory, Coding Theory, Cryptology, Combinatorics, and Cryptography. He has received prestigious awards, including the Edmund and Rosa Hlawka Prize (2004) and the Austrian Mathematical Society Advancement Award (2010). He serves on editorial boards for journals like Finite Fields and Their Applications and Cryptography and Communications . Winterhof has led numerous research projects, including Generalized Cyclotomic Mappings of Finite Fields (2025–2027) and On the Hierarchy of Measures of Pseudorandomness (2014–2018). His work emphasizes pseudorandom sequence design, cryptographic applications, and theoretical foundations in discrete mathematics.

Szemerédi Endreمشاهده پروفایل

استاد

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

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 .

• Databases
• Programming Languages
• Query languages and data models
• +۱۱ مورد دیگر

Peter Buneman is currently a Professor of Database Systems at the University of Edinburgh , affiliated with the School of Informatics and the Foundations of Computer Science Laboratory . Previously, he held a Professor of Computer Science position at the University of Pennsylvania from 1975 to 2001, progressing from assistant to full professor. Education: PhD in Mathematics (1970), University of Warwick (Supervisor: E.C. Zeeman) MA in Mathematics (1966), University of Cambridge Research Interests: His work spans databases (semistructured data, XML, data provenance, distributed databases), programming languages (type systems, functional languages, semantics), and interdisciplinary areas like mathematical phylogeny , neural models , and applications of computers in the humanities . He has also contributed to database interfaces, knowledge bases, and data modeling. Scientific Awards: Member of the Order of the British Empire (2013) Fellow of the Royal Society (2009) Fellow of the Royal Society of Edinburgh (2004) Royal Society Wolfson Research Merit Award (2002) ACM Fellow (1999) Multiple Test of Time Awards (SIGMOD, ICDT) Broadband Awards from Nextgen Challenge and European Commission Additional Roles: Served as Graduate Chairman at University of Pennsylvania (1981-1987) and held visiting research positions at INRIA (France), Kyoto University (Japan), and Imperial College London.

• Number Theory
• Combinatorics on Words
• Mathematical Analysis
• +۳ مورد دیگر

Lukas Spiegelhofer holds the academic rank of Professor in a position associated with the Chair of Mathematics, Statistics and Geometry. His research focuses on number theory, combinatorics on words, and mathematical analysis with particular emphasis on automatic sequences, digit statistics, and entropy-related problems. His work has been published in prestigious journals such as Israel Journal of Mathematics , Journal of the Australian Mathematical Society , and Journal d'analyse mathématique . Recent research explores topics like synchronization of automatic sequences, digit sum collisions across bases, and gap distributions in the Thue-Morse word. Spiegelhofer actively participates in academic activities including invited lectures at conferences such as the 2024 Thue-Morse workshop and combinatorics on words symposium. His research collaborations span international institutions and focus on interdisciplinary areas combining number theory with dynamical systems.

Pierre Bienvenuمشاهده پروفایل

پژوهشگر

• Arithmetic Combinatorics
• Number Theory
• Additive Combinatorics
• +۴ مورد دیگر

Pierre Bienvenu is a Research Scientist at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), part of the Austrian Academy of Sciences, since June 2025. Previously, he held postdoctoral positions at the Technische Universität Graz (2021-2022), the Max Planck Institute for Mathematics in Bonn (2020-2021), and the Institut Camille Jordan in Lyon/St-Etienne (2018-2020). He also served as a Teaching Fellow at Trinity College Dublin (2022-2023) and as a Lecturer at the American University in Paris in Spring 2018. His educational background includes a PhD in Mathematics from the University of Bristol (2014-2018), supervised by Julia Wolf, with a thesis titled "Linear, bilinear and polynomial configurations in function fields and the primes." Bienvenu's research lies at the intersection of arithmetic combinatorics, number theory, and harmonic analysis. He employs analytic, combinatorial, probabilistic, and algebraic methods to study problems in additive combinatorics, such as configurations in prime numbers, sum-product estimates, and density of sumsets. His work has strong connections to ergodic theory and theoretical computer science, particularly in pseudorandomness and error-correcting codes. His recent publications, spanning from 2017 to 2025, focus on density constraints, intersective sets, power monoids, and transference principles in additive combinatorics. These works often involve deep applications of higher-order Fourier analysis and the Green-Tao method, addressing fundamental questions about the structure of sets of integers and primes. As a member of RICAM, Bienvenu contributes to the institute's research groups in computational mathematics and number theory, collaborating with an international network of mathematicians on cutting-edge problems in arithmetic combinatorics.