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

• Quantum algorithms
• Quantum computational complexity
• Classical information theory
• +۳ مورد دیگر

Penghui Yao is a Professor in the Department of Computer Science and Technology at Nanjing University, where he is a member of the CS Theory group. His academic career spans prestigious institutions including the Centre for Quantum Technologies at National University of Singapore, Centrum Wiskunde Informatica (CWI), Institute for Quantum Computing (IQC) at University of Waterloo, and Joint Center for Quantum Information and Computer Science (QuICS) at University of Maryland. Education: BSc in Mathematics from East China Normal University PhD from Centre for Quantum Technologies, National University of Singapore (supervised by Rahul Jain and Miklos Santha) Professor Yao's research focuses on quantum computing and theoretical computer science, with particular expertise in quantum algorithms and computational complexity. His work bridges classical and quantum information theory, with significant contributions to analysis of Boolean functions and their quantum applications. He has developed novel approaches to communication complexity problems in both classical and quantum settings, advancing our understanding of the fundamental limits of computation. His recent publications reveal a strong trend toward practical quantum algorithms with applications in distributed systems, quantum simulation, and quantum cryptography. The breadth of his work spans from theoretical foundations of quantum complexity classes to experimental implementations of quantum processes, demonstrating both depth in theoretical understanding and relevance to practical quantum computing challenges. Professor Yao actively mentors the next generation of quantum computing researchers, supervising multiple PhD and Master's students at Nanjing University while maintaining collaborations with international research groups. His service to the community includes program committee roles for major quantum computing conferences including QIP and TQC.

Marek Balcerzakمشاهده پروفایل

استاد

• Real Analysis
• Measure Theory
• Topology
• +۵ مورد دیگر

Prof. Marek Balcerzak is a Research and Teaching Professor at the Department of Applications of Modern Mathematical Analysis , Lodz University of Technology. His work bridges mathematical analysis, topology, and applied dynamical systems. Research Interests: Real analysis, measure theory, Baire category, ideal convergence, Cantor sets, and applications to dynamical systems and control theory. Publication Trends: Recent articles focus on Baire category, ideal convergence, and Lyapunov exponent applications in chaos theory. His work spans pure mathematics (e.g., equi-Lebesgue families) and engineering (e.g., neural network control systems). Advising: Supervised 13 PhD students, including Piotr Nowakowski (Cantor sets), Szymon Głąb (descriptive set theory), and Paolo Leonetti (ideal convergence). Authored four textbooks, including Foundations of Ergodic Theory (2022). Scientific Contributions: Developed density operators, solved problems in Marczewski-Burstin representations, and extended Birkhoff integral convergence theorems. His interdisciplinary work connects mathematical analysis with control systems and nonlinear dynamics.

Johan Håstadمشاهده پروفایل

استاد

• Theoretical Computer Science
• Computational Complexity
• Circuit Complexity
• +۳ مورد دیگر

Johan Håstad is a Professor at the Department of Mathematics, School of Engineering Sciences, KTH Royal Institute of Technology. His research focuses on theoretical computer science, particularly algorithms, computational complexity, approximation algorithms, and cryptography. He is funded by the Knut and Alice Wallenberg Foundation through project grants and the Wallenberg AI, Autonomous Systems and Software Program (WASP). External Funding: Knut and Alice Wallenberg Foundation, WASP Editorial Roles: Theory of Computing, TheoretiCS Professional Activities: Cyber Defense Center, Royal Swedish Academy of Sciences (former chairman) Research Interests : • Algorithms and Complexity • Circuit Complexity • Approximation Algorithms • Quantum Computing and Cryptography Scientific Awards : Knut and Alice Wallenberg Foundation Support Labs and Teams : • Involved in KTH's Cyber Defense Center • Editor for key journals in theoretical computer science

• Algebra
• Algebraic Coding Theory
• Boolean Algebras
• +۷ مورد دیگر

Massimiliano Sala is a Full Professor at the Department of Mathematics of the University of Trento. His expertise spans Algebra, Algebraic Coding Theory, Boolean Algebras, Cryptography, and Computational Algebra. He specializes in cryptographic protocols, post-quantum security, and elliptic curve cryptography. His recent work includes advancements in blockchain-agnostic multi-signature schemes, searchable encryption, and elliptic curve group structures. Research Focus: Dr. Sala's research integrates mathematical foundations with applied cryptography, emphasizing secure communication protocols, cryptographic algorithm design, and blockchain technologies. He has contributed to the analysis of Boolean functions, APN permutations, and secure multi-party computation. Recent Contributions: His 2024 publications address topics like cubic Boolean functions, blockchain-agnostic asset management, and randomized searchable encryption. He also explores post-quantum cryptographic frameworks and elliptic curve-based security mechanisms. Awards & Recognition: None explicitly listed in the provided materials. Teaching & Academic Leadership: Teaches Algebraic Cryptography at the Master's level, focusing on public-key systems and post-quantum cryptography. His academic contributions include editorial work for cryptographic journals and conference proceedings.

• Group Theory
• Topology
• Set Theory
• +۳ مورد دیگر

Sam Corson is a Ramon y Cajal Fellow (Research Fellow) at the Technical University of Madrid, specializing in the construction of unconventional mathematical structures at the intersection of group theory, topology, and set theory. His work resolves longstanding conjectures, such as the Cannon-Conner problem on fundamental groups of the harmonic archipelago and Griffiths double cone, and introduces novel objects like Artinian groups of arbitrary cardinality and Jonsson groups satisfying Babai’s infinitary edge orbit conjecture. His research interests emphasize automatic continuity (proving open kernels for homomorphisms from topological groups to hyperbolic/braid groups), wild topology (analyzing fundamental groups of non-locally simply connected spaces), and set-theoretic group theory (constructing groups under ZF axioms without choice). Key contributions include models of ZF where metric spaces fail paracompactness or torsion-free abelian groups lack bi-orderings, demonstrating deep interactions between logic and algebra. Recent publications (2021–2025) reveal a trend toward profinite rigidity in Coxeter groups, cardinality constraints in infinite groups, and geometric realizations of permutation actions. His work spans journals like Bulletin of the London Mathematical Society and Proceedings of the American Mathematical Society , often coauthored with Saharon Shelah and Olga Varghese. Scientific recognition includes: Ramon y Cajal Fellowship (prestigious Spanish postdoctoral award) With an Erdős number of 2, Corson collaborates extensively but has no documented advisees, teaching roles, or grants. His research operates within pure mathematics frameworks without applied lab structures or institutional teams beyond coauthor networks.

• Cryptographic Hardware
• Symmetric Cryptographic Schemes
• Hardware Implementations of Cryptographic Algorithms
• +۵ مورد دیگر

Silvia Mella is an Assistant Professor in the Digital Security (DiS) group at Radboud University, Netherlands, and a member of the Cryptographic Engineering & Side-Channel Analysis (CESCA) Lab. Her research focuses on cryptographic hardware for embedded devices, including secure implementations of cryptographic algorithms and analysis of side-channel and fault attacks. She holds a PhD from the University of Milan (2018) and previously worked at STMicroelectronics (2015–2022), developing hardware accelerators for public-key cryptography. She has supervised numerous PhD and Master’s students, co-authored over 30 publications, and contributed to cryptographic standards like ASCON and Xoodoo. Her work emphasizes bridging theoretical cryptography with practical hardware security solutions. Education: Bachelor and M.Sc. in Mathematics, University of Milan, Italy PhD in Cryptography (2018), University of Milan, Italy Research Interests: Design/analysis of symmetric cryptographic schemes Hardware implementation security Side-channel and fault attack countermeasures Post-quantum cryptography Lightweight cryptographic primitives Recent Research Trends: Recent work focuses on novel code-based cryptographic constructions (ChiLow/ChiChi), low-latency pseudorandom functions (Koala), and SCA-resistant implementations of algorithms like Xoodoo and Xoodyak. Her research bridges theoretical cryptographic analysis with practical hardware vulnerabilities, often leveraging machine learning techniques for attack detection. Advising & Collaboration: Co-supervised 10+ PhD/Master students on topics like cryptographic permutations and post-quantum schemes Active in industry-academia collaborations through STMicroelectronics and PROACT projects Involved in open-source cryptographic library development Labs & Teams: Leading research in the CESCA Lab at Radboud University, focusing on cryptographic engineering and embedded system security. Collaborates with the Politecnico di Milano and STMicroelectronics on hardware security projects.

Bridget Tennerمشاهده پروفایل

استاد

• Combinatorics
• Algebraic combinatorics
• Enumerative combinatorics
• +۵ مورد دیگر

Bridget Tenner is a Professor of Mathematics in the Department of Mathematical Sciences at DePaul University's College of Science and Health. She joined the faculty in 2007 after earning her PhD in Mathematics from MIT in 2006 under Richard Stanley, with prior degrees (AB and AM) from Harvard University in 2002. Dr. Tenner's research focuses on combinatorics, particularly algebraic, enumerative, and topological aspects of permutation patterns, Coxeter groups, and Bruhat order. Her work bridges pure mathematics with applications in voting theory, electoral geography, and conference organization for equity. She has developed significant connections between reduced decompositions, pattern avoidance, and geometric structures. Analysis of her recent publications reveals a strong emphasis on permutation patterns, particularly in Stirling permutations, boolean permutations, and signed permutations. Her work frequently connects combinatorial structures with algebraic properties, exploring relationships between pattern avoidance, reduced words, and geometric interpretations. She has made substantial contributions to understanding the combinatorial properties of Coxeter groups and their applications to voting theory and electoral districting. Dr. Tenner has been recognized as a Fellow of the American Mathematical Society, a significant honor in the mathematical community. Her collaborative work spans numerous institutions and demonstrates strong mentorship through co-authorship with early-career mathematicians. She maintains an active research program with consistent high-impact publications across mathematics journals and interdisciplinary venues including Political Geography. Dr. Tenner also contributes to the mathematical community through initiatives like the Database of Permutation Pattern Avoidance and advocacy for equitable conference practices.

Nikolay Stoyanov Kaleyskiمشاهده پروفایل

دانشیار

• Cryptographic Boolean Functions
• APN Functions
• Finite Fields
• +۴ مورد دیگر

Nikolay Stoyanov Kaleyski is an Associate Professor at the Department of Informatics, University of Bergen. His research focuses on cryptographic Boolean functions, particularly APN (Almost Perfect Nonlinear) functions and their applications in symmetric cryptography. He explores algorithm design for function analysis and hardware architectures for efficient cryptographic implementations. He has taught courses including Advanced Cybersecurity (INF249), Applied Cryptography (INF143A), and Information Theory (INF242) across multiple semesters. His research interests include the construction, classification, and properties of Boolean functions with optimal cryptographic criteria. He investigates hardware-friendly implementations of APN permutations and contributes to understanding equivalence relations among functions (EA/CCZ-equivalence). Notable work includes studies on planar functions in finite fields and low-complexity hardware architectures using TU-decomposition. Publications span topics like APN function generalizations, 0-APN monomials, and partial APN properties. Collaborations with institutions like the Naval Postgraduate School and Sungkyunkwan University highlight his international research network. His doctoral dissertation (2021) deepened insights into longstanding APN-related problems.

Petr Lisonekمشاهده پروفایل

استاد

• Cryptography
• Error-Correcting Codes
• Quantum Codes
• +۵ مورد دیگر

Petr Lisonek is a Professor in the Department of Mathematics at Simon Fraser University (SFU), part of the Faculty of Science. His research focuses on applications of algebraic and combinatorial methods in cryptography, error-correcting codes, steganography, and computer algebra. Education: Ph.D. in Computer Science from Johannes Kepler University (1994). Research Interests: Non-linear functions in symmetric cryptography and their algebraic/combinatorial constructions. Design of error-control codes for classical and quantum channels using finite fields and finite geometries. Steganographic schemes leveraging linear codes for secure information hiding. Algorithmic aspects of cryptography and coding theory in computer algebra systems. Recent Research Trends: Recent work emphasizes quantum code construction, cryptographic APN permutations, and foundational results in quantum contextuality (Kochen-Specker sets). Publications span topics like twisted codes, maximal nonassociative quasigroups, and minimal magic sets in quantum mechanics. Affiliations: Editor for Advances in Mathematics of Communications . Maintains a research website at CECM .

Sourour Elloumiمشاهده پروفایل

استاد

• Operations Research
• Discrete Mathematical Optimization
• Energy Optimization
• +۷ مورد دیگر

Sourour Elloumi is a Professor at the Applied Mathematics Unit (UMA) of ENSTA Paris , with additional affiliation to the CEDRIC laboratory at Cnam. Her research focuses on Operations Research and Discrete Mathematical Optimization , with applications in energy systems, transportation networks, and telecommunications infrastructure. Specializes in Quadratic Programming and Mixed-Integer Optimization Develops Convex Reformulation Techniques for complex optimization problems Active in Network Optimization and Railway Rolling-Stock Planning Recent publications emphasize Quantum Algorithm Design for combinatorial problems, Hydrogen Injection in Gas Pipelines , and Robust MILP Formulations for location problems. Her work bridges theoretical optimization with industrial applications, particularly in Energy Transition and Transport Planning . She teaches Mathematical Programming and Discrete Optimization at the graduate level, including courses in the Master Parisien de Recherche Opérationnelle (MPRO) program. Her research methodology combines theoretical analysis with practical implementation through Convex Relaxation and Decomposition Algorithms .

Aleksandar Nikolovمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Algorithm Design
• High-Dimensional Geometry
• +۶ مورد دیگر

Aleksandar Nikolov is an Associate Professor in the Department of Computer Science at the University of Toronto, holding the Canada Research Chair in Algorithms and Private Data Analysis. He is affiliated with the Vector Institute and a faculty fellow at the Schwartz Reisman Institute. His research focuses on theoretical computer science, algorithm design, and their connections to high-dimensional geometry, differential privacy, discrepancy theory, and approximation algorithms. Nikolov completed his PhD at Rutgers University under Muthu's advisement and was a postdoctoral researcher at Microsoft Research. Research Interests: Nikolov explores high-dimensional geometry's applications in algorithm design, particularly in private data analysis (differential privacy), discrepancy theory, and experimental design. His work bridges geometric tools with computational challenges, including nearest neighbor search and geometric optimization. He also delves into approximation algorithms and sublinear/parallel algorithms for large-scale data analysis. Awards: Nikolov received the Best Paper Award at SoCG 2015 and a $100 prize from Joel Spencer for resolving Beck's 3-permutations conjecture. His contributions span theoretical computer science with a focus on algorithmic foundations and privacy. Supervision and Education: He has mentored several graduate and undergraduate students, including current PhD candidates Haohua Tang and Lily Li. Teaching includes advanced courses like CSC2420 (Algorithm Design) and a discrepancy theory course. His research spans over 50 publications, with recent work emphasizing differential privacy and geometric algorithms. Affiliations: Beyond his academic role, Nikolov collaborates with industry and academic institutions, contributing to Canada's AI ecosystem through Vector Institute and interdisciplinary efforts at Schwartz Reisman.

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

Michelle L. Wachs Galloway is a Professor in the Department of Mathematics at the University of Miami's College of Arts and Sciences. Her research focuses on algebraic combinatorics, symmetric functions, and poset homology. Role: Professor Institution: University of Miami School: College of Arts and Sciences Department: Mathematics Email: m.galloway@miami.edu Her work explores connections between combinatorics and algebra, including Eulerian quasisymmetric functions, chromatic quasisymmetric functions, and Rees products of posets. She has advanced understanding of symmetric group representations, Catalan numbers, and enumerative combinatorics. Key publication trends include studies of permutation statistics, homology of posets, and refinements of classical combinatorial structures. Her research has been published in leading journals like Advances in Mathematics and Transactions of the American Mathematical Society . Scientific Award: Cooper Fellow of the College of Arts and Sciences

Alexander Belovمشاهده پروفایل

استادیار

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

Alexander Belov is an Assistant Professor and researcher at the Faculty of Computing, University of Latvia. He has held this position since 2016, while also serving as a researcher at the same institution since 2013. Prior to this, he completed postdoctoral work at Centrum Wiskunde & Informatica (CWI) in the Netherlands (2015-2016) and MIT's CSAIL (2014). His educational background includes: PhD in Computer Science, University of Latvia (2009-2014), supervised by Andris Ambainis Master of Mathematics, University of Waterloo (2008), supervised by Ashwin Nayak Master of Computer Science, University of Latvia (2006-2009), with distinction BSc in Computer Science, University of Latvia (2002-2006), with distinction Dr. Belov's research focuses primarily on quantum algorithms, with emphasis on upper and lower bounds for quantum complexity of various problems, applications of the adversary method, and discrete quantum walks. He also explores theoretical computer science topics including models of computation, query complexity, lower bounds, and related mathematical techniques. His work bridges deep theoretical insights with potential practical applications in quantum computing. His recent publications demonstrate a strong trend toward developing novel quantum algorithms, particularly for problems like monotonicity testing, k-distinctness, and group testing. His work often establishes important lower bounds and separation results in quantum query complexity. The research spans theoretical computer science, quantum information, and mathematical techniques for analyzing computational problems. Dr. Belov has received several prestigious awards: IEEE Conference on Computational Complexity 2014: Best student paper award IEEE Conference on Computational Complexity 2013: Best student paper award International Olympiad in Informatics 2002, Korea: Gold Medal International Mathematical Olympiad 2002, UK: Silver Medal International Mathematical Olympiad 2001, USA: Bronze Medal Dr. Belov serves as the principal researcher for the ERDF project "Quantum walks for large speed-ups, and general limitations of quantum algorithms" (project number 1.1.1.2/VIAA/1/16/113). He has been actively involved in reviewing papers for major conferences including STOC, FOCS, SODA, CCC, ICALP, ESA, QIP, and SOFSEM, as well as journals like Algorithmica, Theory of Computing, and Physical Review A. He has also contributed significantly to mathematical education in Latvia through Aivars Liepa's Extramural Mathematics School, preparing high school students for international olympiads and serving as the leader of Latvia's team at the 54th International Mathematical Olympiad.

• Cryptography
• Finite Fields
• Boolean Functions
• +۳ مورد دیگر

Assoc. Prof. Constanza Riera is affiliated with the Department of Computing, Mathematics, and Physics at the University of South-East Norway. Her research focuses on cryptography, finite fields, Boolean functions, quantum computing, algebraic combinatorics, and coding theory. She has published extensively on topics including differential spectra, cryptographic function design, quantum states, and algebraic structures. Her work bridges theoretical mathematics with applications in cryptography and information security. Recent articles explore properties of APN functions, c-differentials, quantum state characterization, and combinatorial designs rooted in finite fields. Notable contributions include advancements in c-differential uniformity and the application of Dillon's switching method to construct secure functions. Riera's research also delves into quantum computing, analyzing graph-based quantum states and their algebraic properties. Her interdisciplinary approach addresses both foundational mathematical problems and practical cryptographic challenges.

• Algebraic systems biology
• Algebraic combinatorics
• Discrete dynamical systems
• +۲ مورد دیگر

Matthew Macauley is an Associate Professor in the Department of Mathematical and Statistical Sciences at Clemson University's College of Science. His research focuses on algebraic systems biology, combinatorial methods, and discrete dynamical systems. He has taught over 15 advanced mathematics courses ranging from Calculus to Topology and Algebraic Biology. Dr. Macauley's research investigates algebraic frameworks for biological systems, discrete models of RNA structures, and combinatorial Coxeter theory. His work bridges pure mathematics with biological applications, exploring inverse problems in biomathematics and computational approaches to biological networks. Recent publications demonstrate consistent focus on algebraic combinatorics applications to biological systems, with emerging work on mathematical crystallography and geometric algebra. His research trajectory shows increasing integration of computational methods with abstract algebraic structures. Awards & Recognition Simons Foundation Collaboration Grant for Mathematicians (2016–21) NSF Research Grant (2012–14) Project NExT Fellow, MAA (2008–09) Chavin Prize for best senior thesis (2003) He has advised over 25 graduate students and 10 undergraduates in mathematical biology research, with graduates securing positions at academic institutions including University of North Georgia and Virginia Tech. Current collaborations include international partnerships with researchers in Denmark and interdisciplinary projects with Clemson's engineering departments.