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

• Probability Theory
• Stochastic Processes
• Mathematical Physics
• +۳ مورد دیگر

Balint Toth is a distinguished academic with dual affiliations: a Research Professor at the Alfréd Rényi Institute of Mathematics in Budapest and a Professor of Probability (Heilbronn Chair) at the University of Bristol 's School of Mathematics. His work bridges Probability Theory , Mathematical Physics , and Statistical Mechanics , focusing on stochastic dynamics, random walks in complex environments, and scaling limits. Key Roles: Co-Editor-in-Chief of Probability Theory and Related Fields , organizer of probability seminars in Budapest-Vienna and Bristol, and former leader of the BME Stochastics Seminar (1999–2020). Teaching: Delivers advanced courses like Probability 2 , Stochastic Differential Equations , and Percolation , emphasizing rigorous mathematical foundations. Research Themes include hydrodynamic limits, self-interacting random walks, diffusion in random media, and symmetry breaking in spin systems. His recent publications explore non-equilibrium stochastic models, anomalous diffusion, and connections between probability and physics. Teaching Materials span bilingual resources (Hungarian/English) for undergraduate and graduate courses in probability and stochastic analysis.

Chris Monicoمشاهده پروفایل

دانشیار

• Cryptology
• Computational Algebra
• Number Theory
• +۶ مورد دیگر

Chris Monico is an Associate Professor in the Department of Mathematics & Statistics at Texas Tech University . He has been a faculty member there since 2003, following post-doctoral research at the University of Notre Dame. Education B.S. in Mathematics – Monmouth University M.S. in Mathematics – University of Notre Dame Ph.D. in Mathematics – University of Notre Dame Research Focus Monico’s scholarship centers on the intersection of cryptology , computational algebra , and number theory . A significant recent thrust has been the application of machine-learning techniques to mathematical finance , evidenced by work on random-forest models for option pricing and high-frequency trading risk metrics. Parallel lines of inquiry include post-quantum cryptographic schemes built on tropical algebra and semigroup actions, as well as classical problems in Ramsey theory and combinatorial semigroups . Publication Trends Between 2015 and 2025 Monico has published prolifically, with a clear shift around 2020 toward mathematical finance and machine-learning applications , alongside continued output in algebraic cryptanalysis and combinatorics . His 2024–2025 articles emphasize data-driven models in trading, whereas 2020–2021 works concentrate on cryptanalyses of tropical and group-based key-exchange systems. Earlier contributions focus on computational number theory and semigroup-based cryptography. Contact Information Email: c.monico@ttu.edu Phone: 806-834-4144 Office: Department of Mathematics & Statistics, Texas Tech University, 1108 Memorial Circle, Lubbock, TX 79409-1042 Advising & Grants No specific doctoral or master’s students, funded grants, or named awards are detailed in the provided text. Laboratory or Research Group The text does not mention any dedicated laboratory or research group.

Christine Muschikمشاهده پروفایل

دانشیار

• Quantum Computing
• Quantum Simulation
• Quantum Information Science
• +۴ مورد دیگر

Christine Muschik is an Associate Professor at the Institute for Quantum Computing (University of Waterloo) and Associate Faculty at Perimeter Institute for Theoretical Physics. Her research bridges quantum technologies with particle physics to develop hybrid quantum-classical simulation techniques. University of Waterloo (2017–present) Perimeter Institute (2019–present) University Research Chair (2022–present) Her work focuses on quantum simulation, quantum sensing, and high-dimensional quantum computing (qudits). Key applications include lattice gauge theories, quantum chemistry, and fundamental particle interactions. Recent publications highlight advancements in qudit-based simulation of vacuum dynamics and SU(2) hadron models. Awards include the CIFAR Azrieli Global Scholar Fellowship (2020–2022), Sloan Fellowship (2019), and Emmy Noether Fellowship (2018). Nature Physics 2025: Qudit simulation of lattice gauge theories Nature Communications 2021: SU(2) hadron modeling Nature 2016: Few-qubit lattice gauge simulations She teaches advanced quantum physics courses at the University of Waterloo and leads the "Quantum Interactions" research group.

• Cryptography
• Post-Quantum Cryptography
• Network Security
• +۳ مورد دیگر

Douglas Stebila is an Associate Professor in the Department of Combinatorics and Optimization at the University of Waterloo, Faculty of Mathematics. His research focuses on cryptographic protocols, with an emphasis on post-quantum cryptography, TLS protocol security, and key exchange mechanisms. He has contributed to the design and analysis of cryptographic systems resilient to quantum computing threats, including work on hybrid key exchange methods and post-quantum TLS implementations. Stebila is involved in standards projects such as the Open Quantum Safe initiative, aiming to transition existing infrastructure to quantum-resistant algorithms. His recent work addresses security models for cryptographic protocols, including formal verification of key establishment schemes and analysis of real-world protocols like Signal and TLS. His research spans theoretical cryptography, applied protocol analysis, and implementation security. Key contributions include studies on obfuscated key exchange, verifiable decapsulation of post-quantum KEMs, and optimization of TLS handshake efficiency (e.g., TurboTLS). He also explores challenges in cryptographic protocol design, such as preventing double authentication and ensuring resistance against side-channel attacks. His work frequently bridges academic research with practical applications, emphasizing the transition of cryptographic innovations into real-world systems. Stebila collaborates with industry and academic partners on projects like the Open Quantum Safe initiative, which develops libraries for post-quantum cryptography integration. His publications often address security analyses of emerging protocols and their vulnerability to both classical and quantum adversaries. He has co-authored conference proceedings for major venues like CRYPTO and SAC, and contributed to standards documentation for protocols such as TLS and SSH.

Luca Chiantiniمشاهده پروفایل

استاد

• Algebraic Geometry
• Commutative Algebra
• Tensor Analysis
• +۴ مورد دیگر

Luca Chiantini is a Full Professor at the University of Siena's Department of Information Engineering and Mathematical Sciences. Born in Siena in 1957, he earned his Mathematics degree from the University of Siena in 1979 and held academic positions at the Polytechnic of Turin, University of Naples, University of Rome 'La Sapienza', and others before joining the University of Siena in 1995. His research focuses on Algebraic Geometry, Commutative Algebra, and applications in Tensor Analysis and Multilinear Algebra. Chiantini's work explores projective varieties, secant varieties, Waring decompositions, and geometric complexity theory. He has authored over 100 publications, including studies on interpolation in higher codimension, Geproci sets, and Terracini loci. Education: Degree in Mathematics from the University of Siena (1979), followed by CNR grants and a Brandeis University fellowship (1982-1983). Academic roles include Department Director (2006-2012) and Dean of the Academic Board (2011-2012). Research Interests: Algebraic Geometry (e.g., projective varieties, secant varieties), Commutative Algebra (Hilbert functions, determinantal representations), and applied areas like tensor decomposition, geometric complexity, and algebraic statistics. His work bridges classical and modern algebraic geometry, with contributions to tensor rank, identifiability, and secant defectivity. Key Projects: Studies on interpolation, secant varieties, and geometric configurations. Collaborations on tensor analysis with applications in statistics and theoretical physics. Active in academic service and education, teaching advanced geometry and mathematics pedagogy.

Anna R. Karlinمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithm Design and Analysis
• Probabilistic Algorithms
• +۶ مورد دیگر

Anna R. Karlin is a Professor and the Bill & Melinda Gates Chair in Computer Science & Engineering at the University of Washington's Paul G. Allen School of Computer Science & Engineering. She serves as Associate Director of Graduate Studies and leads research in theoretical computer science within the Theory & Models of Computation focus area. Ph.D. from Stanford University (1987) Former researcher at Digital Equipment Corporation's Systems Research Center (5 years) Professor Karlin's research centers on theoretical computer science, with specific expertise in algorithm design and analysis, particularly probabilistic and online algorithms. Her work spans multiple interdisciplinary domains including algorithmic game theory, economics and computation, data mining, operating systems, networks, and distributed systems. Her research has evolved from foundational algorithmic work to impactful applications in market design, auction theory, and pricing mechanisms. Karlin's publication record demonstrates a consistent trajectory from classical theoretical computer science toward algorithmic game theory and mechanism design. Her recent work focuses on approximation algorithms for NP-hard problems, auction design, revenue maximization, and stable matching problems, with applications in online advertising, network economics, and resource allocation. She has developed influential algorithms for the Traveling Salesman Problem and made significant contributions to understanding interdependent valuations in combinatorial auctions. Bill & Melinda Gates Chair in Computer Science & Engineering Professor Karlin has advised numerous doctoral students throughout her career, with former students including prominent researchers like Jason Hartline, Frank McSherry, and Kira Goldner. Her collaborative research has been supported by various grants, including NSF funding (CCF-1813135 mentioned in her publications). She co-authored the influential textbook Game Theory, Alive with Yuval Peres, which serves as a rigorous introduction to game theory with applications across multiple disciplines. As a leader in theoretical computer science, Professor Karlin maintains active involvement in the Theory of Computation research group at the Allen School, fostering collaboration between theoretical foundations and practical applications in computer science.

Amit Kuberمشاهده پروفایل

دانشیار

• Representation theory of associative algebras
• Order theory
• K-theory of model-theoretic structures
• +۳ مورد دیگر

Amit Kuber is an Associate Professor in the Department of Mathematics & Statistics at Indian Institute of Technology Kanpur . He specializes in representation theory of associative algebras, order theory, and K-theory of model-theoretic structures, with a growing portfolio of high-impact publications and teaching accolades. Education PhD (2011-14) – University of Manchester, UK (Thesis: "K-theory of theories of modules and algebraic varieties"; Supervisor: Prof. Mike Prest) Master of Advanced Studies/Part III of Mathematical Tripos (2010-11) – University of Cambridge, UK M.Sc. (2008-10) – University of Pune B.Sc. (2006-08) – Garware College, Pune Research Interests & Focus Kuber's work lies at the intersection of algebra, model theory, and combinatorics. He explores combinatorial aspects of the representation theory of bound quivers , arithmetic properties of linear orders, and Grothendieck rings arising from model-theoretic structures. His research often bridges abstract categorical frameworks with concrete combinatorial problems, yielding insights into both tame and wild representation types. Scientific Awards & Honors Gopal Das Bhandari Memorial Distinguished Teacher Award (2023) Excellence-in-Teaching Award (2022) Sushila and Kantilal Mehta Award (2019) Eduard Čech Institute Post-doctoral Fellowship (2016) University of Manchester Overseas Students Scholarship (2011-14) Cambridge Commonwealth Trust Scholarship (2010-11) NBHM M.Sc. Scholarship (2008-10) Lt. Padmabhushan A. Garware & Lt. R.G. Kunte Memorial Awards for First Rank in B.Sc. Mathematics (Pune University) Professional Experience & Grants After completing his PhD, Kuber held post-doctoral positions at Masaryk University, Brno (2014-15) and the Second University of Naples, Caserta (2016). While explicit grant details are not provided, his continuous appointment at IIT Kanpur and multiple teaching awards indicate sustained institutional support for his research and pedagogical initiatives. Extracurricular Interests Beyond academia, Kuber engages in Indian classical and light music (vocal, harmonium, tabla) and poem writing .

Colin Ingallsمشاهده پروفایل

استاد

• Noncommutative Algebra
• Algebraic Geometry

Colin Ingalls is a Full Professor in the School of Mathematics and Statistics at Carleton University. His research focuses on Noncommutative Algebra and Algebraic Geometry, with contributions to areas such as noncommutative resolutions, quiver representations, and birational geometry. He has advised numerous graduate students, including Master’s and PhD candidates, whose theses cover topics like Hochschild cohomology, McKay quivers, and Brauer pairs. Ingalls has an extensive publication record, with recent work exploring reflection groups, discriminant loci, and derived categories of algebraic structures. His research interests span the intersection of algebra and geometry, emphasizing noncommutative methods to address classical geometric problems. He maintains active collaborations, evidenced by co-authored papers on topics such as minimal model programs for orders and applications of Koszul duality. Ingalls’ work bridges abstract algebraic theory with geometric constructions, contributing to foundational advancements in these fields.

László Kozmaمشاهده پروفایل

استادیار

• Data Structures
• Algorithms
• Algorithmic Adaptivity
• +۷ مورد دیگر

László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures , adaptive algorithms , and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures. Academic Affiliation: Freie Universität Berlin (since 2018) Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven. His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection , and self-adjusting heaps . Key areas include: Adaptive algorithms for pattern-avoiding inputs Optimal tree and heap structures Geometric and stochastic approaches to optimization Complexity analysis of classical algorithms Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.

Sylvain Lombardyمشاهده پروفایل

استاد

• Automata Theory
• Formal Languages
• Theoretical Computer Science
• +۳ مورد دیگر

Sylvain Lombardy is a Professor at the University of Bordeaux, affiliated with the Laboratoire Bordelais de Recherche en Informatique (LaBRI) and the Enseirb-Matmeca engineering school within the Institut Polytechnique de Bordeaux. His research focuses on automata theory, formal languages, and theoretical computer science, particularly in weighted automata, formal methods, and algebraic properties of automata. He leads the Formal Methods research team at LaBRI and contributes to projects like the Awali and Vaucanson software platforms for automata manipulation. Education: PhD in Computer Science (2001, ENST Paris), Habilitation à Diriger des Recherches (2005, University of Paris Diderot). His work bridges theoretical foundations with practical tools, emphasizing algorithmic and algebraic aspects of automata. Notable contributions include studies on automata minimization, determinization, and the interplay between rational expressions and automata constructions. Research Interests: Automata Theory, Formal Power Series, Weighted Automata, Tropical Semirings, Algebraic Automata Theory, and Computational Models for Discrete Systems. His recent work explores two-way automata, Hadamard series, and applications in formal verification. Publications highlight contributions to the structure and properties of automata, with a focus on formal methods and algorithmic decidability. Key works address unambiguity, determinism, and the minimization of weighted automata across various semirings. Collaborations include projects on automata-based kernels for machine learning and XML formats for automata descriptions. He has developed influential software tools such as Awali (finite-state machine platform) and Vaucanson (automata manipulation framework), demonstrating practical applications of theoretical research. His work is supported by grants exploring automata in computational linguistics and discrete mathematics.

Jared Duker Lichtmanمشاهده پروفایل

استادیار

• Number Theory
• Analytic Number Theory
• Multiplicative Number Theory
• +۳ مورد دیگر

Jared Duker Lichtman is a Szegö Assistant Professor at Stanford University's Department of Mathematics, beginning in the 2024-25 academic year. Previously, he served as an NSF Postdoctoral Fellow at Stanford under Prof. Kannan Soundararajan. He completed his PhD at the University of Oxford in 2023, focusing on multiplicative number theory. His research centers on prime number distribution, multiplicative structures, and analytic number theory. Notably, he established a world record in studying primes' distribution within arithmetic progressions. His work bridges classical number theory with modern techniques like sieve methods and L-function analysis. Jared's publications explore topics such as the abc conjecture, twin primes, and Erdős problems. While no formal awards are listed, his groundbreaking contributions to prime distribution and multiplicative number theory mark him as a rising star in the field. His academic trajectory includes a focus on primes in arithmetic progressions, Goldbach conjecture extensions, and probabilistic number theory applications. Ongoing research likely continues this trajectory, with potential implications for cryptography and additive number theory.

Konstantin Wernliمشاهده پروفایل

استادیار

• Quantum Field Theory
• Mathematical Physics
• Geometric Quantization
• +۳ مورد دیگر

Konstantin Wernli is an Assistant Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark, affiliated with the Quantum Mathematics research group. His research focuses on quantum field theory, geometric quantization, and mathematical physics, with a particular emphasis on topological field theories and perturbative methods. He has contributed to foundational work in Chern-Simons theories, BV-BFV formalisms, and geometric analysis. His research interests include quantum field theories, algebraic geometry, and the intersection of topology with physics. Notably, he explores combinatorial approaches to quantum field theory, geometric quantization frameworks, and the application of advanced mathematical tools to solve problems in theoretical physics. Recent work includes studies on partition functions, constrained dynamical systems, and the globalization of sigma models. His articles often bridge abstract mathematics with physical applications, such as analyzing heat kernels, theta invariants, and entanglement polytopes. Wernli is a project participant in the Sapere Aude grant 'FROM PERTURBATIVE TO NON-PERTURBATIVE QUANTUM FIELD THEORY BY CUTTING AND GLUING' (2024–2028), which aims to advance non-perturbative QFT techniques. He has advised on research projects involving heat kernel analysis and geometric quantization, though no formal student advisees are listed.

Kevin Fordمشاهده پروفایل

استاد

• Number Theory
• Prime number theory
• Divisor theory
• +۵ مورد دیگر

Kevin Ford is a Professor of Mathematics at the University of Illinois at Urbana-Champaign, affiliated with the Department of Mathematics within the College of Liberal Arts & Sciences. His research focuses on Number Theory, including prime number theory, divisor theory, probabilistic methods, and sieve theory, with notable contributions to the Riemann zeta function and divisor distribution. Ford is also an editor for Research in Number Theory and the Bulletin and Journal of the London Mathematical Society . His recent work explores topics such as large gaps between primes, composite polynomial values, and the concentration of divisors. Ford’s publications often bridge analytic and probabilistic techniques to address classical number-theoretic problems. Despite extensive contributions, no specific academic awards are explicitly listed, though his editorial roles highlight his influence in the field. He advises no listed students, though his research group and collaborations with leading mathematicians like Terence Tao and Dimitris Koukoulopoulos are evident in his publications. Ford’s academic presence includes organizing the Illinois Number Theory Seminar and maintaining an active research agenda in number theory and combinatorics.

• Finite Free Probability
• Non-commutative Probability
• Random Matrices
• +۶ مورد دیگر

Dr. Daniel Perales Anaya is a Visiting Assistant Professor in the Department of Mathematics at Texas A&M University, affiliated with the College of Arts & Sciences. He completed his Ph.D. in 2022 at the University of Waterloo under the supervision of Alexandru Nica. His research focuses on Finite Free Probability, a field at the intersection of free probability, random matrices, combinatorics, and non-commutative probability. He also investigates infinitesimal freeness, hypergeometric polynomials, and cumulant theory. He organizes the Free Probability and Operators Seminar at Texas A&M University and maintains an active research profile with contributions to journals like Transactions of the American Mathematical Society and Constructive Approximation . His work bridges classical analysis, operator algebras, and combinatorial structures, often leveraging finite free convolutions and non-crossing partitions. Publications span topics including infinitesimal distributions, hypergeometric polynomial zeros, and S-transforms in finite free probability. His research has been supported by institutions such as the Simons Foundation and Birkhäuser.

• Computational Complexity
• Boolean Functions
• Communication Complexity
• +۵ مورد دیگر

Shachar Lovett is a researcher at the University of California, San Diego (UCSD), specializing in computational complexity, combinatorics, and theoretical computer science. His work spans advanced topics in communication complexity, pseudorandomness, and coding theory, often intersecting with problems in additive combinatorics and Boolean function analysis. Education : Not explicitly detailed in the provided text. Research Interests : Lovett's research focuses on computational complexity, particularly in communication and circuit complexity, combinatorial structures like sunflowers and high-dimensional expanders, and the analysis of Boolean functions through Fourier and Gowers norms. His work explores the limits of deterministic vs. randomized computation, the structure of codes over finite fields, and the interplay between additive combinatorics and theoretical computer science. Article Trends : His recent publications address exact vs. approximate representations of Boolean functions, quasipolynomial bounds in combinatorics, hypercontractivity in high-dimensional expanders, and advancements in the log-rank conjecture. These works emphasize connections between computational complexity, discrete mathematics, and pseudorandomness, often yielding improved bounds or novel frameworks for understanding Boolean function behavior. Scientific Awards : No specific awards or honors were mentioned in the provided text. Advising and Collaborations : Lovett collaborates extensively with researchers like Hamed Hatami, Kaave Hosseini, and Jiapeng Zhang, contributing to fields such as non-malleable codes, matrix multiplication algorithms, and communication complexity. No formal student advising details were provided.