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

Yuhan Jiangمشاهده پروفایل

استادیار مهمان

• Algebraic Combinatorics
• Combinatorics of Integrable Systems
• Ehrhart Theory
• +۳ مورد دیگر

Yuhan Jiang is a Morrey Visiting Assistant Professor in the Department of Mathematics at the University of California, Berkeley, appointed in 2025. His research focuses on algebraic combinatorics and related fields within pure mathematics. Education: PhD in Mathematics from Harvard University, advised by Professor Lauren K. Williams Current postdoctoral position at UC Berkeley under Professor Sylvie Corteel Dr. Jiang's research spans multiple interconnected areas of algebraic combinatorics. His work centers on the combinatorics of integrable systems, Ehrhart theory, matroid theory, and diagonal coinvariants. He has made significant contributions to understanding the structure of positroid polytopes, alcoved polytopes, and the connections between rowmotion and echelonmotion in posets. His research often bridges combinatorial structures with algebraic and geometric methods, particularly in the context of symmetric functions, lattice polytopes, and algebraic statistics. His publication record shows a strong progression in combinatorial algebra with increasing focus on geometric interpretations. Recent work explores the Ehrhart theory of various polytopes, the combinatorics of exclusion processes, and algebraic properties of coinvariant rings. The research demonstrates a consistent theme of connecting discrete structures with continuous geometric and algebraic frameworks, particularly through the lens of representation theory and symmetric functions. Dr. Jiang teaches Complex Analysis (Math 185) at UC Berkeley. His academic lineage includes prominent researchers in algebraic combinatorics, reflecting his deep engagement with cutting-edge developments in the field. His work with Professor Corteel at Berkeley continues his trajectory of exploring fundamental connections between combinatorial structures and algebraic geometry.

Patrick Felkeمشاهده پروفایل

استاد

• IT Security
• Cryptography
• Cryptanalysis
• +۶ مورد دیگر

Prof. Dr. Patrick Felke is a Professor for IT Security at the University of Applied Sciences Emden/Leer, affiliated with the Department of Technology, Electrical Engineering and Informatics. His research focuses on advanced cryptographic techniques, including cryptanalysis of encryption algorithms, IoT security vulnerabilities (e.g., Z-Wave protocols), and mathematical foundations of cryptographic primitives. He leads the IT-Sec Lab (https://itsec-lab.hs-emden-leer.de/), which explores topics like multivariate cryptography, symmetric cipher design, and side-channel attack mitigation. His research spans both theoretical and applied aspects of information security, with notable contributions to cryptanalysis of TETRA encryption algorithms, analysis of multivariate encryption schemes (e.g., EFLASH), and identification of critical flaws in wireless communication standards. Felke also contributes to the Digital Hub Ostfriesland initiative, focusing on IT security advancements in regional technology ecosystems. Key areas of expertise include: Cryptographic protocol vulnerability analysis Z-Wave and IoT device security Design and cryptanalysis of symmetric/asymmetric encryption systems Mathematical foundations of nonlinear functions in cryptography Publications emphasize practical cryptanalysis methods, algorithmic decomposition techniques, and cryptographic standard evaluation. His work bridges academic research with real-world cybersecurity challenges in telecommunications and embedded systems.

• Randomness and Computation
• Algorithms and Optimization
• Complexity Theory
• +۱۲ مورد دیگر

Avi Wigderson is the Herbert H. Maass Professor at the School of Mathematics, Institute for Advanced Study, Princeton, where he leads research in theoretical computer science and discrete mathematics. He organizes the CSDM (Computer Science and Discrete Mathematics) program at IAS, fostering interdisciplinary research and collaboration. Research Interests: His primary research areas include randomness and pseudorandomness, computational complexity, circuit and proof complexity, quantum computation, cryptography, and distributed computing. His work bridges computer science and pure mathematics, particularly through algebra, analysis, and combinatorics. He has pioneered foundational results in derandomization, lower bounds, and the interplay between computation and mathematical structures. The recent publications highlight his continued leadership in advancing algebraic and analytic techniques in complexity theory. Themes include operator scaling, invariant theory, expander graphs, arithmetic circuits, and the asymptotic analysis of tensors and matrix spaces. These works often unify computational problems with deep mathematical frameworks, demonstrating the power of interdisciplinary approaches. Scientific Awards: Edsger W. Dijkstra Prize in Distributed Computing (2023) for the paper 'Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computing' Advising and Grants: Wigderson has advised numerous PhD students, primarily at the Hebrew University and Princeton, and hosted over 50 postdoctoral researchers at IAS, including many who have become leading figures in theoretical computer science. While specific grants are not listed, his sustained productivity and influence suggest long-term funding from major sources such as the NSF, Simons Foundation, or IAS internal support. Labs and Teams: He leads the CSDM (Computer Science and Discrete Mathematics) group at the Institute for Advanced Study, organizing seminars, workshops, and collaborative research initiatives that bring together mathematicians and computer scientists from around the world.

James A. Mingoمشاهده پروفایل

استاد

• Free probability
• Random matrices
• Operator algebras
• +۵ مورد دیگر

James A. Mingo is a Professor in the Department of Mathematics and Statistics at Queen's University. His research focuses on free probability, random matrices, operator algebras, and related areas. He holds a Ph.D. from Dalhousie University. Education: Ph.D. (Dalhousie University) Research Interests: Mingo's work explores the interplay between free probability and random matrices, with applications to operator algebras and mathematical physics. Key topics include infinitesimal freeness, asymptotic distributions of random matrices, and combinatorial structures in non-commutative probability. His contributions bridge abstract algebraic frameworks with probabilistic methods, addressing questions in both theoretical and applied contexts. Grants and Collaborations: Mingo collaborates widely, as evidenced by his co-authored papers with researchers like Roland Speicher, Mihai Popa, and Daniel Munoz George. His research has been supported by grants from institutions like the Simons Foundation. Teaching and Service: Mingo has taught courses such as STAT/MTHE 353 and MATH 892 at Queen's University, reflecting his commitment to both undergraduate and graduate education. He also organizes research seminars and workshops in free probability and random matrices.

Pamela E. Harrisمشاهده پروفایل

استاد

• Algebraic Combinatorics
• Representation Theory
• Graph Theory
• +۴ مورد دیگر

Pamela E. Harris is a Professor of Mathematics in the Department of Mathematical Sciences at the University of Wisconsin-Milwaukee. She is also a cohost of the podcast Mathematically Uncensored and President and co-founder of Lathisms: Latinxs and Hispanics in the Mathematical Sciences. Education: PhD in Mathematics (2012), University of Wisconsin-Milwaukee; M.S. in Mathematics (2008), University of Wisconsin-Milwaukee; B.S. in Mathematics (2005), Marquette University; Associate Degrees in Sciences and Liberal Arts (2003), Milwaukee Area Technical College. Her research focuses on algebraic combinatorics, particularly representation theory of Lie algebras, with applications to parking functions, graph theory, and discrete mathematics. She is a leading advocate for diversity, equity, and inclusion in mathematics, mentoring underrepresented students and co-organizing symposia for SACNAS and the American Mathematical Society. Dr. Harris has authored over 65 peer-reviewed articles and coauthored books such as Asked And Answered: Dialogues On Advocating For Students of Color in Mathematics and Practices and Policies: Advocating for Students of Color in Mathematics . Her work includes developing community agreements and DEI frameworks for academic settings. Scientific Awards: MAA Deborah and Franklin Tepper Haimo Award (2023), MAA Northeast Section Award (2020), MAA Henry L. Alder Award (2019), Council on Undergraduate Research Mentor Award (2019), Karen Uhlenbeck EDGE Fellow (2020). She actively engages in promoting community-building initiatives and has contributed to national dialogues on mentorship, equity, and the intersection of mathematics with social justice.

Xiang-dong Houمشاهده پروفایل

استاد

• Finite Fields
• Permutation Polynomials
• Coding Theory
• +۲ مورد دیگر

Xiang-dong Hou is Professor in the Department of Mathematics and Statistics at the University of South Florida. His research spans algebra, number theory, coding theory, cryptography, and combinatorics, with particular expertise in finite fields and permutation polynomials. Research develops novel approaches to polynomial factorization over finite fields and equivalence classification of rational functions. Applications include cryptographic Boolean function design and efficient coding theory implementations. Publications demonstrate innovative connections between abstract algebra and information security, particularly in developing new permutation polynomial families for cryptographic applications. Recent work advances theoretical frameworks for normal polynomial identification. Scientific Awards: No awards listed Supervises doctoral students in finite field applications and serves as editorial board member for Finite Fields and Their Applications journal.

Sajin Korothمشاهده پروفایل

استادیار

• Theoretical computer science
• Complexity theory
• Communication complexity
• +۳ مورد دیگر

Sajin Koroth is an Assistant Professor in the Department of Computer Science at the University of Victoria, Canada. He holds a PhD from the Indian Institute of Technology Madras and has held postdoctoral positions at Simon Fraser University and the University of Haifa. His research focuses on theoretical computer science, particularly complexity theory, communication complexity, and circuit complexity. He has received the IBM India Outstanding Ph.D. Thesis Award for his doctoral work. Education: PhD and Master's from IIT Madras, postdoctoral research at SFU and Haifa University. Research interests include circuit lower bounds, communication complexity, and probabilistically checkable proofs (PCPs). Key contributions involve lifting theorems, query-to-communication complexity, and lower bounds for De Morgan formulas. Awards: IBM India Outstanding Ph.D. Thesis Award (2017). Teaching: Courses on communication complexity and computational complexity theory at UVic. Active in academic conferences and workshops, including presentations at STOC, CCC, and ICALP.

• Biosensor Development
• Protein Engineering
• Electrochemical Sensors
• +۳ مورد دیگر

Dr. Zhong Guo is a Researcher at the School of Biology & Environmental Science, Faculty of Science, Queensland University of Technology (QUT). His work focuses on developing biosensors through protein engineering, with applications in diagnostics and clinical samples. He holds a PhD and collaborates extensively with researchers like Dr. Konstantin Alexandrov and Dr. Evgeny Katz on bioelectronic systems and synthetic biology projects. His research interests include biosensor design, electrochemical and fluorometric sensing technologies, and synthetic allostery. Key contributions include the creation of lanthanide-controlled protein switches and mRNA display pipelines for biosensor construction. His work bridges molecular biology, biochemistry, and engineering to advance point-of-care diagnostics and biotechnological tools. Publications highlight innovations in protein logic gates, chimeric enzymes, and magnetic signal-activated systems. These contributions underscore his role in integrating biological systems with electronic interfaces for biomedical applications.

Chunlei Liمشاهده پروفایل

استاد

• Cryptography
• Coding Theory
• Wireless Communications
• +۴ مورد دیگر

Chunlei Li is a Professor in the Department of Informatics at the University of Bergen, specializing in Coding Theory and Cryptography. His research focuses on signal design, error-correcting codes, cryptographic primitives, and blockchain technology. He holds a PhD from the University of Bergen (2014) and has held postdoctoral positions at the University of Stavanger and the Selmer Center. He teaches courses in algebraic coding, cybersecurity, and cryptography. His research spans waveform design for wireless communications, feedback shift register sequences, rank metric codes, homomorphic encryption, and discrete mathematics. He leads projects such as 'Sequences and Their Applications' and contributes to conferences like SETA and NISK. Supervised students include those in symmetric cryptography, sequence design, and code-based cryptography. His work emphasizes cryptographic strength, with contributions to APN functions, permutation polynomials, and decoding algorithms for rank metric codes. He has authored numerous papers on topics like differential properties of functions and blockchain-based security systems.

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

Professor Daniel Kleitman is a faculty member in the Massachusetts Institute of Technology (MIT) Department of Mathematics , where he has taught courses such as 18.310 Principles of Discrete Applied Mathematics , 18.01 Calculus , and 18.022 Calculus . His academic rank is Professor, with a career spanning decades in combinatorics, discrete mathematics, and interdisciplinary applications. Teaches 18.310 (Discrete Applied Mathematics) Teaches 18.01 (Calculus) Teaches 18.022 (Multivariable Calculus) Research Interests Professor Kleitman’s work lies at the intersection of combinatorics , graph theory , and discrete applied mathematics . His research explores: Theoretical foundations of discrete mathematics Error-correcting codes and cryptographic algorithms Applications to computer science, biology, and physics Geometric and probabilistic methods in combinatorics Publications Trends His publications since 1980 emphasize combinatorics , graph theory , and algorithm design . Key areas include: Combinatorial geometry (convex sets, planarity) Network optimization (spanning trees, linear programming) Coding theory (Shannon bounds, BCH codes) Interdisciplinary applications (gene recognition, urban homicide analysis)

Yuval Peresمشاهده پروفایل

استاد

• Probability Theory
• Analysis
• Theoretical Computer Science
• +۶ مورد دیگر

Yuval Peres is a Professor at the Beijing Institute of Mathematical Sciences and Applications (BIMSA). His research spans Probability Theory , Analysis , Theoretical Computer Science , and Game Theory . He has made foundational contributions to topics such as Random Walks , Markov Chains , Fractals , and Brownian Motion , with applications in network science and mathematical physics. Research Interests : Peres’ work often intersects probability and analysis, focusing on problems like phase transitions , mixing times , Gaussian analytic functions , and homogenization . His recent papers address homogenization problems, cutoff phenomena in Markov chains, and boundary value problems via stochastic methods. Advising and Mentorship : Peres has mentored over 20 PhD students and postdoctoral scholars, many of whom hold prominent positions at institutions like MIT, UC Berkeley, and Yale. His collaborations span mathematics, computer science, and physics. Awards : Linked to the David P. Robbins Prize (specific paper not named in text)

• Combinatorics
• Theory of Algorithms
• Geometry
• +۵ مورد دیگر

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at The Hebrew University of Jerusalem, where he has maintained a distinguished academic career spanning several decades. His research bridges multiple mathematical disciplines with theoretical computer science. Linial's primary research interests encompass Combinatorics, Theory of Algorithms, Geometry, Analysis, and Computational Molecular Biology . His work often explores the deep connections between discrete mathematics and computer science, particularly focusing on high-dimensional combinatorial structures, metric embeddings, and their algorithmic applications. His publication record demonstrates consistent contributions across decades, with recent work focusing on high-dimensional permutations, simplicial complexes, graph theory, and coding theory. Linial has developed significant theoretical frameworks for understanding complex combinatorial structures and their geometric representations. Among his notable achievements is being named an AMS Fellow and receiving the 2008 Conant Prize for the influential survey paper "Expander graphs and their applications" co-authored with S. Hoory and A. Wigderson. His research has shaped multiple areas of theoretical computer science and discrete mathematics. Linial has served on the editorial boards of prestigious journals including Israel Journal of Mathematics (where he was Chief Editor 2013-2017), Random Structures and Algorithms , and Combinatorica . He has supervised numerous students throughout his career and maintains active research collaborations worldwide.

David Ellisمشاهده پروفایل

دانشیار

• Combinatorics
• Discrete Analysis
• Fourier Analysis
• +۴ مورد دیگر

Dr. David Ellis is an Associate Professor in Pure Mathematics at the School of Mathematics, University of Bristol. His research bridges extremal combinatorics with algebra, analysis, probability theory, and theoretical computer science. Previously, he held positions at Queen Mary, University of London, and St John's College, Cambridge. Education: B.A., M.Math (University of Cambridge), PhD (University of Cambridge, supervised by Imre Leader). Research Interests: Dr. Ellis specializes in extremal combinatorics, with a focus on interactions between combinatorics, algebra, analysis, and theoretical computer science. His work explores forbidden intersection problems, Turán-type theorems, and applications to probability and graph theory. Publication Trends: His recent articles (2023-2025) address Turán densities for hypercubes and daisies, junta approximations in symmetric groups, forbidden intersections in linear maps, and structure of union-closed families. These papers emphasize probabilistic and algebraic methods in combinatorics. Scientific Awards: Feinberg Visiting Fellowship, Weizmann Institute of Science (2013-14). Grants & Collaborations: Principal Investigator for EPSRC project EP/W000032/1 on pooled testing algorithms for pandemic management. Collaborated with DELVE Initiative (2020) on healthcare infection modeling during the coronavirus pandemic.

• Automata Theory
• Formal Languages
• Temporal Logic
• +۶ مورد دیگر

Marc Zeitoun is a Professor of Computer Science at Bordeaux University , conducting research at the LaBRI laboratory within the M2F department. His work focuses on automata theory, formal languages, and their connections to logic, algebra, and software verification. Research Interests: Automata theory, temporal and first-order logic, regular language hierarchies, software model checking, group languages, modular predicates, and algebraic characterizations. Key Projects: ANR projects UnReAL (2025–2029), Delta (2016–2022), and FREC (2010–2014). Software Development: Co-developer of MeSCaL, a tool for testing membership and separation problems in regular languages with optimized algorithms for syntactic monoids. Recent Contributions: Decidability of membership in dot-depth three, temporal hierarchies, and unambiguous polynomial closures; polynomial-time reductions for separation problems in first-order logic fragments.

• Complex systems
• Combinatorial optimization
• Evolutionary computation
• +۵ مورد دیگر

Sebastien Verel is a Researcher at the Laboratoire d'Informatique de l'Université du Littoral Côte d'Opale (LISIC) . His work focuses on complex systems, combinatorial optimization, evolutionary computation, and fitness landscape analysis. Research Interests: Multiobjective optimization, metaheuristics, adaptive algorithms, and simulation-based modeling Collaborations: Active in international conferences (GECCO, EvoCOP, PPSN) with teams from UK, Italy, Australia, and Morocco Key Publications (2023-2025) address topics like: Pareto local optimal networks for multiobjective landscapes Surrogate-assisted optimization using Walsh decomposition Fitness landscape analysis across ML models and protein engineering Urban mobility benchmarks (bus spacing in Calais)