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

Eric J. Schmutzمشاهده پروفایل

استاد

• Discrete mathematics
• Probabilistic methods
• Combinatorial number theory

Eric J. Schmutz is a tenured Professor in the Department of Mathematics at Drexel University, actively contributing to combinatorial mathematics research and academic instruction. His career demonstrates sustained engagement in theoretical and applied probabilistic methods within discrete structures. His academic foundation includes: PhD in Mathematics from the University of Pennsylvania (1988) AB in Mathematics from Princeton University (1981) Professor Schmutz's research centers on discrete mathematics with specialized expertise in probabilistic combinatorics and combinatorial number theory . His work systematically explores asymptotic behaviors in random combinatorial structures, including permutation orders, partition statistics, and matrix properties. This interdisciplinary approach bridges pure mathematics with stochastic modeling, yielding insights applicable to computational complexity and algorithmic design. Analysis of his publication timeline reveals consistent contributions to combinatorial probability since the early 1990s, with recent work (2021) extending classical permutation theory. Key thematic threads include the statistical properties of random permutations, structural analysis of integer partitions, and number-theoretic functions—often involving collaborations with prominent mathematicians like Paul Erdős and William Goh. While no specific advising relationships or grant funding are documented in the source text, his extensive publication record spanning three decades implies significant mentorship of graduate researchers. The absence of laboratory or team affiliations suggests primarily theoretical work conducted through mathematical collaboration rather than experimental facilities.

Pawel Hitczenkoمشاهده پروفایل

استاد

• Probability Theory
• Combinatorics
• Wavelets
• +۱ مورد دیگر

Pawel Hitczenko is a Professor in the Department of Mathematics at Drexel University. He holds a PhD from Warsaw University, Poland, and has held long-term visiting positions at institutions including Texas A&M, Rutgers, and Université Paris-Sud. His research centers on probability theory applied to combinatorics, asymptotic analysis of algorithms, and stochastic processes. Specific interests include recurrence relations, random combinatorial structures, and convergence properties in discrete mathematics. Recent publications focus on asymptotic distributions in combinatorial models, stochastic analysis of recurrence algorithms, and properties of random tableaux. Work demonstrates consistent advancement in probabilistic combinatorics and algorithm analysis techniques. No scientific awards are documented in available materials. No advising or grant details are available. No lab or team information is provided.

Benjamin Braunمشاهده پروفایل

استاد

• Algebraic Combinatorics
• Topological Combinatorics
• Geometric Combinatorics
• +۳ مورد دیگر

Benjamin Braun is a Professor of Mathematics at the University of Kentucky, serving as the Director of Graduate Studies in the Department of Mathematics (College of Arts & Sciences). His research focuses on geometric, algebraic, and topological combinatorics, with particular emphasis on polytopes, integer points in polyhedra, and combinatorial algebra. He also investigates interdisciplinary topics such as active learning, mathematics education, and the integration of critical theory (including feminist and reader-response perspectives) into STEM disciplines. His work bridges pure and applied mathematics, addressing areas like Ehrhart theory, flow polytopes, and social justice in education. He co-organizes the University of Kentucky Mathematics Community and Ethics Working Group, fostering dialogue on ethics and societal impacts in mathematical research. Braun’s contributions span over 50 peer-reviewed articles, with recent work emphasizing the intersection of mathematics with pedagogy and equity. Research interests include: Algebraic and topological combinatorics Mathematics education reform Interdisciplinary applications of combinatorics Notable research trends reflect his dual focus on foundational mathematics and educational innovation. Articles from 2023–2025 highlight studies on Ehrhart polynomials, flow polytopes, and the role of identity and belief systems in student success. His scholarship of teaching and learning emphasizes student-centered assessment and institutional support structures. Braun’s professional service includes leadership in graduate education and curriculum development. His website ( braunmath ) provides access to research, teaching materials, and collaborative projects.

Amin Coja-Oghlanمشاهده پروفایل

استاد

• Probabilistic Combinatorics
• Mathematical Physics
• Disordered Systems
• +۲ مورد دیگر

Amin Coja-Oghlan is Professor of Efficient Algorithms and Complexity Theory at TU Dortmund University's Department of Computer Science. His research integrates probabilistic combinatorics, information theory, and statistical physics to solve fundamental problems in theoretical computer science. Education includes a doctorate in Mathematics (University of Hamburg, 2002) and habilitation in Computer Science (Humboldt University Berlin, 2005). Research advances understanding of phase transitions in constraint satisfaction problems, optimization landscapes, and random structures. Recent publications analyze SAT thresholds, group testing, and sparse matrix properties. Academic appointments include professorships at Goethe University Frankfurt and lectureships at Edinburgh and Warwick. Research contributions bridge discrete mathematics with computational complexity.

Marc Noyمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Discrete Geometry
• +۳ مورد دیگر

Marc Noy is a Professor at the Department of Applied Mathematics II, Polytechnic University of Catalonia (UPC), affiliated with the School of Mathematics and Statistics. He is the Director of the Barcelona Graduate School of Mathematics (BGSMath) and leads the 2015-2019 Excellence program BGSMath/María de Maeztu. His research focuses on Combinatorics and Graph Theory, including asymptotic enumeration, random graphs, discrete geometry, and Tutte polynomials. He has advised multiple PhD and Master’s students and contributes to editorial roles for the Electronic Journal of Combinatorics and the Catalan Mathematical Society’s Bulletin. His teaching spans undergraduate and graduate courses in Combinatorics, Graph Theory, Complex Analysis, and Discrete Mathematics at UPC. He has participated in numerous international conferences and workshops, including the ICM 2014 and FOCM 2017. His work emphasizes the probabilistic analysis of graph structures, limit laws, and enumerative combinatorics. His recent publications explore topics like logical limit laws in graph classes, random planar graphs, and Tutte polynomial evaluations. He maintains active collaborations in combinatorial enumeration, with contributions to understanding graph properties in minor-closed classes and random geometric configurations.

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

Juanjo Rué Perna is an Associate Professor at the Universitat Politècnica de Catalunya (UPC), holding a position in the Department of Mathematics . He also serves as Director of the CFIS (Centre de Formació Interdisciplinària Superior). Previously, he was a Juniorprofessor (Assistant Professor) at Freie Universität Berlin (2013-2016), affiliated with the Combinatorics and Graph Theory group. His academic journey includes postdoctoral positions at ICMAT (Madrid, 2010-2013) and École Polytechnique (France, 2009-2010). Rué obtained his PhD in Discrete Mathematics from UPC in 2009 under Marc Noy, focusing on the enumeration of topological graphs. His research interests span Enumerative Combinatorics , Graph Theory , Random Graphs , and Additive Combinatorics , with notable contributions to planar maps and asymptotic analysis. He has supervised four PhD students, including Clément Requilé and Christoph Spiegel. He has organized major conferences like EUROCOMB 2021 and authored books such as El arte de contar: Combinatoria y enumeración and academic works on transcendental numbers. Rué's work bridges theoretical mathematics with applications in quantum gravity and statistical physics, emphasizing interdisciplinary approaches.

Bruce Kapronمشاهده پروفایل

استاد

• Logic in Computer Science
• Cryptography
• Foundations of Security
• +۳ مورد دیگر

Bruce Kapron is a Professor of Computer Science at the University of Victoria, affiliated with the Faculty of Engineering and Computer Science. He holds a PhD from the University of Toronto (1991) and an M.Sc. in Mathematics from Simon Fraser University (1986). His research focuses on theoretical computer science, including computability, cryptography, computational complexity, and verification. He has held visiting positions at institutions such as Stanford University and the Institute for Advanced Study. Notable contributions include foundational work in higher-order computability, cryptographic protocols, and formal verification. Education: PhD in Computer Science from the University of Toronto (1991), supervised by Stephen Cook; M.Sc. in Mathematics from Simon Fraser University (1986), supervised by S. K. Thomason. Research interests emphasize logic in computer science, computational complexity, cryptographic foundations, and verification techniques. His work bridges theoretical insights with practical applications in security and algorithm design. Recent publications explore equilibrium complexity in games, separation logic, and pseudorandomness. He has advised numerous graduate students and holds major grants, including NSERC Discovery Grants focused on complexity theory and security foundations. His contributions extend to textbook authorship, such as *Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook* (2023). Key professional milestones include roles as Distinguished Professor at Fondation Sciences Mathématiques de Paris (2022) and Visiting Fellow at the University of Bologna (2022). He actively participates in research networks and has delivered invited talks on topics such as NP-completeness and higher-order complexity theory.

Victor Falgas Ravryمشاهده پروفایل

دانشیار

• Extremal Combinatorics
• Discrete Probability
• Extremal Graph Theory
• +۲ مورد دیگر

Victor Falgas Ravry is an Associate Professor in Mathematics at the Department of Mathematics and Mathematical Statistics, Umeå University. He holds a Docent qualification and has been affiliated with Umeå University since 2016, following a Kempe research fellowship (2012-2014) and a tenure as Assistant Professor at Vanderbilt University (2014-2016). Education: MMath (University of Cambridge, UK, 2004-2008); PhD (University of London, UK, 2008-2012) Research Interests: His work focuses on extremal combinatorics and discrete probability , particularly extremal graph and hypergraph theory and random graph models. These fields address optimization problems in discrete structures and probabilistic modeling of complex networks. Awards: He has received significant research funding, including: Swedish Research Council Project Grant (VR 2021-03687) for 2022-2025 Swedish Research Council Starting Grant (VR 2016-03488) for 2017-2021 Teaching & Organization: Since 2020, he serves as head of the Master's programmes in Mathematics and Mathematical Statistics, and deputy head of the Bachelor's programme in Mathematics since 2022. He regularly organizes the Discrete Mathematics Seminar, the Midwinter Workshop in Discrete Probability, and an upcoming extremal graph/hypergraph workshop at the Mittag-Leffler Institute.

Bent Jesper Christensenمشاهده پروفایل

استاد

• Econometrics
• Finance
• Labor Economics
• +۵ مورد دیگر

Bent Jesper Christensen is a Professor at the Department of Economics and Business Economics, Aarhus University. He holds a Ph.D. in Economics from Cornell University (1990) and maintains affiliations as a Research Fellow at the Danish Finance Institute (DFI) and the Center for Research in Energy: Economics and Markets (CoRE), alongside an External Fellow role at the University of Essex's Centre for Financial Econometrics. Ph.D., Economics, Cornell University, 1990 His research spans econometrics, finance, labor economics, macroeconomics, and insurance, with notable contributions to fractional cointegration, fractional GARCH models, and structural estimation of dynamic programming/search models. Recent work focuses on climate-energy-economy interactions, asset pricing (term structure of interest rates), and machine learning applications in forecasting. Current teaching includes Masters-level courses in Applied Time Series Econometrics, Fixed Income Analysis, and Causal Inference. He has supervised over 45 Ph.D. and 170 Masters theses, primarily in finance and econometrics. Key awards include Research Fellowships at DFI and CoRE, and external assessor roles at Danish universities. Research Fellow, Danish Finance Institute Research Fellow, Center for Research in Energy: Economics and Markets External Fellow, University of Essex His academic activities include organizing conferences like the Danish Doctoral School of Finance and visiting Harvard University as an external researcher (2006-2007). Collaborations involve interdisciplinary work on emissions, energy markets, and financial risk modeling.

Dimitris Achlioptasمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithms
• Randomized Algorithms
• +۵ مورد دیگر

Dimitris Achlioptas is a Professor at the Department of Informatics and Telecommunications, National and Kapodistrian University of Athens. His research focuses on theoretical computer science, algorithms, and probabilistic methods. He has contributed extensively to areas such as satisfiability problems, random constraint satisfaction, combinatorial optimization, and phase transitions in random structures. His work bridges algorithm design with probabilistic analysis, often leveraging tools from discrete mathematics and statistical physics. Key research themes include the Lovász Local Lemma, random k-SAT, and the interplay between computational complexity and statistical properties of problems. Notable contributions address algorithmic barriers from phase transitions, solution space geometry of random CSPs, and efficient sampling techniques for combinatorial structures. His recent work explores applications of probabilistic methods in machine learning and optimization, including scalable algorithms for high-dimensional problems.

• Combinatorics
• Functional Analysis
• Ramsey Theory
• +۵ مورد دیگر

Pandelis Dodos is a Professor in the Department of Mathematics at the National and Kapodistrian University of Athens, Greece. His research focuses on combinatorics, functional analysis, and their intersections, particularly Ramsey theory, Banach space geometry, and descriptive set theory. He holds a PhD from the National Technical University of Athens (2003) and a Habilitation à Diriger des Recherches from Université Pierre et Marie Curie (2009). His work bridges analysis and combinatorics, addressing problems in nonlinear spectral gaps, forbidden intersection configurations, and high-dimensional random arrays. He leads the ANACOMB project (Hellenic Foundation for Research and Innovation), exploring combinatorial problems via analytical methods. Notable collaborations include researchers such as V. Kanellopoulos, K. Tyros, and S. Todorcevic. His contributions include monographs on Ramsey theory and Banach spaces, as well as over 50 peer-reviewed articles. Education: MSc Electrical Engineering (NTUA, 1997) PhD Mathematics (NTUA, 2003) Habilitation (UPMC Paris 6, 2009) His research projects include the ANACOMB initiative, investigating density Hales-Jewett conjectures and concentration inequalities. He advises PhD candidate Stamatis Skouras and collaborates with institutions like Texas A&M and Charles University. His work frequently intersects with theoretical computer science and probability theory. Awards: None explicitly listed, but recognized through extensive international collaboration and editorial roles in journals like Mathematische Annalen and Transactions of the AMS . Grants & Labs: ANACOMB (HFRI-FM20-02717), leading a multinational team addressing analytic combinatorics. Active in organizing workshops like COMPRAAthens 2024 .

Loukia Meligkotsidouمشاهده پروفایل

دانشیار

• Bayesian Inference
• Computational Statistics
• Hidden Markov Models
• +۴ مورد دیگر

Loukia Meligkotsidou is an Associate Professor of Statistics at the Department of Mathematics of the National and Kapodistrian University of Athens. She holds a BSc in Statistics from Athens University of Economics and Business (2002) and a PhD in Statistics from Lancaster University (2005), focusing on filtering methods for population genetics, phylogenetics, and mixture models. Her research interests span Bayesian inference, computational statistics, hidden Markov models, biostatistics, and econometrics. She teaches undergraduate courses on Bayesian Inference and postgraduate courses on Time Series analysis. Her work emphasizes methodological advancements in statistical modeling, particularly in longitudinal data analysis, competing risks, and model uncertainty. Recent publications address issues like shared parameter models for longitudinal data, Bayesian unit root testing, and quantile regression approaches in financial forecasting. She is a Fellow of the Royal Statistical Society and active in professional societies like ISBA and IMS. Her research integrates theoretical contributions with applied problems in economics, finance, and biology. Notable contributions include frameworks for handling informative dropout mechanisms and developing efficient Bayesian computational methods for complex models. Her work bridges statistical methodology and real-world applications, particularly in econometrics and biostatistics.

Konstantinos Tyrosمشاهده پروفایل

دانشیار

• Ramsey Theory
• Density Combinatorics
• Banach Space Geometry
• +۲ مورد دیگر

Konstantinos Tyros is Associate Professor in Mathematics at the University of Athens, specializing in combinatorial analysis and Ramsey theory. His research connects density theorems in combinatorics with problems in Banach space geometry and probabilistic methods. Key contributions include density versions of combinatorial theorems (Carlson-Simpson, Hales-Jewett), structure theorems for stochastic processes on discrete cubes, and concentration inequalities for high-dimensional random arrays. His work on spreading models in Banach spaces reveals new structures in functional analysis. He has developed novel approaches to nonlinear spectral gaps and dual Ramsey theory for trees, while advancing the Moser-Tardos algorithmic framework. Honors include technical excellence awards from Greek academic institutions.

Trambak Banerjeeمشاهده پروفایل

استادیار

• Shrinkage Estimation
• Empirical Bayes Prediction
• High Dimensional Penalized Likelihood Methods
• +۸ مورد دیگر

Trambak Banerjee is an Assistant Professor in the Analytics, Information, and Operations academic area at the University of Kansas School of Business. His research focuses on developing rigorous statistical methods for analyzing modern high-dimensional data where issues such as unobserved heterogeneity and noise accumulation impede inferences using standard methods. Education: Ph.D. in Business Administration (Statistics), Marshall School of Business, University of Southern California, 2020 M.S. in Mathematical Finance, University of Oxford, 2015 M.S. in Statistics, Indian Statistical Institute, Kolkata, 2006 B.S. in Statistics, St. Xavier's College, University of Calcutta, 2004 Dr. Banerjee's research interests span multiple domains including Shrinkage Estimation, Empirical Bayes Prediction, High Dimensional Penalized Likelihood Methods, and statistical applications in Virology, Consumer Behavior, and Marketing. His industry experience in financial services has significantly influenced his research approach, often connecting methodological development to concrete applied problems. His work bridges theoretical statistics with practical applications in health, marketing, and finance. His publication record demonstrates expertise in developing novel statistical frameworks for complex data problems, with a particular focus on nonparametric methods, empirical Bayes estimation, and testing procedures for heterogeneous data. His recent work includes significant contributions to statistical methods for single-cell virology, shrinkage prediction under complex covariance structures, and joint modeling approaches for user behavior in digital platforms. Dr. Banerjee has developed several software packages to implement his methodological contributions, including truh for nonparametric two-sample testing under heterogeneity, cezij for constrained zero-inflated joint modeling, and several R packages for adaptive shrinkage and clustering procedures. His work combines theoretical rigor with practical implementation, making his methods accessible to researchers across multiple disciplines.

Bjørn Kjos-Hanssenمشاهده پروفایل

استاد

• Automatic Complexity
• Computability Theory
• Algorithmic Randomness
• +۲ مورد دیگر

Bjørn Kjos-Hanssen is a Professor in the Department of Mathematics at the University of Hawaiʻi at Mānoa, where he has been a faculty member since 2007. He served as Associate Chair from 2021 to 2024. His primary research interests lie in automatic complexity and computability theory , with additional focus on algorithmic randomness and theoretical computer science. He completed his Ph.D. in Mathematics at the University of California, Berkeley in 2002 under the advisement of Theodore A. Slaman. His research explores foundational questions in computability, such as measures of string complexity, randomness extraction, and the interplay between automata theory and combinatorics on words. Recent work includes studies on Cantor homeomorphisms, protein folding models, and metric interpolation between Jaccard and information distances. His contributions often bridge theoretical computer science with mathematical logic. Publications span topics from Medvedev reducibilities to VC-dimensions of automata, reflecting a deep engagement with both abstract and applied computational questions. While no formal awards are listed, his extensive publication record highlights sustained impact in his field. Advising and grant details are not explicitly documented here, though his role as Associate Chair suggests active participation in academic governance. He can be reached at bjoern@math.hawaii.edu or bjoernkh@hawaii.edu , and his office is located in PSB 306.