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.
Olha Matsyi serves as an Assistant Professor (post-doc) within the Division of Applications of Contemporary Mathematical Analysis at Lodz University of Technology, with contact details including email olha.matsyi@p.lodz.pl and phone (+48) 42 631-36-17. Her research focuses on Operations Research and Mathematical Optimization, specializing in combinatorial algorithms for location theory, knapsack problems, community detection, and VLSI routing. She employs metaheuristic and bio-inspired methods to solve NP-hard optimization challenges, bridging theoretical mathematics with engineering applications in healthcare logistics and crisis management. Publications from 2020-2025 demonstrate increasing emphasis on real-world implementations like mobile medical service optimization and decision support systems, alongside theoretical advances in continuous coverage and constrained classification. Collaborative work with researchers such as Oksana Pichugina highlights her interdisciplinary approach to algorithm design. No scientific awards were documented. Information regarding student mentorship, research grants, or specific laboratory teams was not provided in the source material.
Margaret A. Readdy is a Professor of Mathematics at the University of Kentucky, where she has been a faculty member since Fall 2000. She is a member of the Discrete Mathematics group within the Department of Mathematics. Her academic journey includes a PhD in Mathematics followed by a two-year postdoctoral fellowship at Laboratoire de Combinatoire et d'Informatique Mathématiques (LACIM) at Université du Québec à Montréal (UQAM), and a three-year Visiting Assistant Professorship at Cornell University. She has held numerous prestigious visiting positions including at the Institute for Advanced Study in Princeton (1998-1999 and 2010-2011), Stockholm University, MIT (2006-2007), and Princeton University (2014-2015). Professor Readdy's research focuses on algebraic combinatorics, particularly the interactions of combinatorics with algebra, topology, discrete geometry, and number theory. Her work explores the deep connections between combinatorial structures and other mathematical fields, with significant contributions to the study of polytopes, root systems, Coxeter groups, and flag enumeration. She has developed important insights into the cd-index, Eulerian posets, and combinatorial identities arising from representation theory. Her research is supported by NSF grant DMS-2247382, continuing her long-standing record of externally funded research. Analysis of Professor Readdy's recent publications (2016-2024) reveals a consistent focus on combinatorial structures with geometric interpretations. Her work often centers on polytopes (particularly the Legendre polytope), triangulations, and the combinatorial properties of Coxeter arrangements. She frequently collaborates with Richard Ehrenborg and other mathematicians, producing results that bridge discrete geometry, algebraic combinatorics, and topology. A notable theme in her recent work is the application of combinatorial methods to solve geometric problems, such as the n-dimensional pizza theorem, and the exploration of connections between different combinatorial structures through bijections and enumerative techniques. Involved with Women and Mathematics program that won the AMS 2019 Award for Mathematics Programs that Make a Difference Guest editor for March 2018 Notices of the AMS special issue for Women's History Month Featured on the cover of the March 2018 Notices of the AMS Professor Readdy actively mentors students, currently advising PhD students Will Gustafson and Ben Reese. She has received consistent research support from the National Science Foundation, including current grant DMS-2247382. She co-organizes the KOI Combinatorics Lectures (funded by NSF DMS 2435236), which brings together researchers from Kentucky, Ohio, and Indiana. She has organized the Discrete CATS Seminar since 2000 (with some interruptions), fostering a vibrant research community in combinatorics at the University of Kentucky. Professor Readdy is deeply involved in academic service and outreach. She has been a key participant in the Women and Mathematics (WAM) Program at the Institute for Advanced Study and Princeton University since 2017, serving as Academic Program Manager (2017-2019) and on the WAM Committee (2020-2022). She co-founded the Math Ambassadors program at the University of Kentucky and has organized multiple Julia Robinson Math Festivals. Her commitment to promoting mathematics extends to K-12 education through presentations at local schools and participation in the Kentucky American Water Science Fair.
Adele Howe is a Professor in the Department of Computer Science at Colorado State University (CSU), affiliated with the College of Natural Sciences. Her research focuses on artificial intelligence, particularly in search and optimization techniques, security for home computer users, and automated planning and scheduling. She has held roles such as Acting Department Chair (2009-2010) and served on editorial boards for journals like JAIR and AI Magazine. Howe has extensive professional service experience, including roles in AAAI Executive Council and ICAPS Council. Education: PhD (Computer and Information Science, UMass Amherst, 1993), MS (UMass Amherst, 1987), BS (Computer Science, University of Pennsylvania, 1983). Her work includes over 100 publications in AI planning, optimization, and security. Notable awards include AAAI Fellow (2015), NSF CAREER Award (1996), and recognition for teaching excellence. Her research integrates empirical methods to evaluate algorithm performance, with applications in military scheduling (e.g., AFSCN satellite communications) and cybersecurity. Recent work explores psychological factors in user security behavior. Howe has advised over 20 graduate students and led grants totaling millions, including projects on landscape analysis for TSP and security agents. Awards and recognitions highlight her contributions to AI planning, cybersecurity, and education. She has organized major conferences (e.g., AAAI 2007, ICAPS 2009) and contributed to initiatives like the Defense Science Board Task Force on Autonomy.
Chaoyun Li is a Lecturer in Software Security at the Surrey Centre for Cyber Security, University of Surrey, since March 2023. Prior to this, he served as a postdoc researcher at the COSIC research group, KU Leuven (2020–2023) and completed his PhD in cryptography under Prof. Bart Preneel at the same institution in 2020. His academic journey includes a Marie Skłodowska-Curie ESR Fellowship (2015–2019) as part of the EU H2020 ECRYPT-NET project. Chaoyun holds a PhD in Electrical Engineering from KU Leuven (2020) and has conducted extensive research in applied cryptography, cryptanalysis, privacy-enhancing technologies, and mathematical foundations of cryptography. His work focuses on breaking cryptographic systems, designing secure primitives, and optimizing lightweight ciphers for constrained environments. Notable contributions include advancements in side-channel attacks, MDS matrix design, and de Bruijn sequence construction. His research interests span symmetric cryptography, fault analysis, and secure implementations. Recent projects emphasize practical intrusion detection over encrypted traffic and the integration of cryptographic ciphers with fully homomorphic encryption (FHE). Chaoyun has received several accolades, including the FWO Junior Postdoc Fellowship (2020–2023) and the CHES 2021 Challenge WhibOx Contest victory for best implementations (2021). He actively contributes to academic service, serving on program committees for conferences like Indocrypt and IMACC, and reviewing for journals such as IEEE Transactions on Information Theory and Designs, Codes and Cryptography. As a mentor, he co-supervises PhD student Indranil Thakur and has guided master’s students Ryan De Koninck, Edward Wiels, Michiel Verbauwhede, and Xueming Zhong. His collaborative efforts include affiliations with imec-COSIC (KU Leuven) and visits to institutions such as the Chinese Academy of Sciences and Orange Labs. Professional activities include invited talks at venues like the International Workshop on Coding Theory and Cryptography and the Chinese Academy of Sciences. Chaoyun’s work bridges theoretical cryptography and practical security applications, with a focus on real-world implementations and vulnerabilities in cryptographic systems.
Matteo Bonini is an Assistant Professor in the Department of Mathematical Sciences at Aalborg University, under the Faculty of Engineering and Science. He is also associated with the AAU BLUE – Marine & Maritime Research initiative, indicating interdisciplinary engagement in real-world applications of mathematics. His research lies at the intersection of algebraic geometry, finite fields, and coding theory. PhD in Mathematics – Specific institution and year not mentioned in text Possibly postdoctoral experience inferred from publication history and project role His research interests center on algebraic geometry , coding theory , and combinatorics , particularly focusing on AG codes, covering codes, rational points on algebraic varieties, irreducibility of polynomials, and weight distributions in linear codes. His work often applies algebraic methods to solve problems in information theory and error correction. The fingerprint analysis from his profile highlights recurring themes such as Polynomial Mathematics, Weight Distribution, Rational Points, Linear Codes, and Algebraic Geometry. The recent publications show a consistent trend in exploring structural properties of codes—especially covering codes in sum-rank metrics, minimal codewords, and connections between algebraic curves and code design. His studies frequently involve deep algebraic techniques over finite fields, with applications in cryptography and data transmission. He collaborates internationally, as evidenced by co-authorships across European institutions. Currently, there are no scientific awards mentioned in the provided text. Matteo Bonini serves as a Principal Investigator in the ongoing project Blue Math: Blue Mathematics at AAU , which aims to apply advanced mathematical methods to marine and maritime challenges. While no formal students are listed, his role as a PI and active researcher suggests mentorship responsibilities. No specific grants are detailed beyond this project. He is affiliated with the Mathematics group within the Department of Mathematical Sciences at Aalborg University, contributing to both theoretical and applied research, particularly through the AAU BLUE initiative that connects mathematical modeling with engineering and real-life systems.
Mohit Pal is a Postdoctoral Fellow at the Department of Informatics, University of Bergen, Norway. He is affiliated with the Faculty of Mathematics and Natural Sciences and conducts research under the mentorship of Prof. Lilya Budaghyan. He holds a Ph.D. in Mathematics from the Indian Institute of Technology Jammu, where he was supervised by Dr. Sartaj Ul Hasan. Education: B.Sc. in Mathematics, University of Allahabad (2011–2014) M.Sc. in Mathematics, Indian Institute of Technology Kharagpur (2014–2016) Ph.D. in Mathematics, Indian Institute of Technology Jammu (2018–2021) Visiting Student, Indian Institute of Technology Delhi (2018–2019) Visiting Student, Indian Statistical Institute Delhi (2022) His research lies at the intersection of cryptography and finite fields, focusing on boomerang uniformity, differential uniformity, APN and PN functions, permutation polynomials, and arithmetization-oriented cryptographic primitives . His work contributes to the theoretical foundations of symmetric cryptography and algebraic design of secure functions. He has published in leading journals such as Designs, Codes and Cryptography , IEEE Transactions on Information Theory , and Advances in Mathematics of Communications . His recent publications explore connections between generalized differential properties and cryptographic robustness, particularly in odd characteristic fields. Scientific Awards and Recognition: Reviewer for top-tier journals including IEEE Transactions on Information Theory , Designs, Codes and Cryptography , and Applicable Algebra in Engineering, Communication and Computing . Active participant in major international workshops such as Asiacrypt, Boolean Functions and Their Applications (BFA), and SETA. Erdős Number: 3 (via Sartaj Ul Hasan and Pantelimon Stănică). He has advised no students to date but has contributed to research mentoring through collaboration. He taught INF-143A: Applied Cryptography at the University of Bergen in 2024, instructing 84 students at undergraduate and master’s levels. His research has been supported through postdoctoral funding at the University of Bergen and prior project fellowships at IIT Jammu and Harish-Chandra Research Institute. He is currently engaged in advancing the theory of arithmetization-friendly cryptographic functions, with implications for zero-knowledge proofs and secure computation. Laboratories and Research Teams: Mohit Pal is part of the cryptography research group at the Department of Informatics, University of Bergen, collaborating closely with Prof. Lilya Budaghyan and Dr. Chunlei Li. His work integrates into broader efforts on algebraic methods in modern cryptography, particularly in the context of post-quantum and efficient cryptographic design.
Mario Szegedy is a Professor in the Department of Mathematics at Rutgers, The State University of New Jersey, and a member of the university’s Graduate Faculty. His research integrates quantum computing , theoretical computer science , combinatorics , and algorithms . A dominant theme is elucidating the power and limits of quantum algorithms relative to classical counterparts. Representative directions include: Quantum Monte Carlo methods and speed-ups Locally testable codes and quantum error correction Combinatorial optimization and approximation algorithms Graph-theoretic processes and Markov chains Communication complexity and decision-making under constraints Across more than two decades, Szegedy’s publications reveal a steady trajectory toward deeper quantum–classical separations, practical quantum algorithm design, and structural insights into hard combinatorial problems. His 2024–2025 work pushes further into non-linear quantum Monte Carlo and exotic quantum codes, while earlier contributions laid foundational results on query complexity and randomized algorithms. Although the provided text does not enumerate awards or funded grants, the breadth and longevity of publication in top venues implicitly signal sustained research funding and recognition within the theoretical computer-science community. Laboratory or center affiliations are not specified in the text, but his presence in the Mathematics Department and Graduate Faculty suggests active involvement in mentoring PhD students and postdocs in discrete mathematics and quantum information.
Tommi Junttila serves as a Senior University Lecturer in the Department of Computer Science at Aalto University, Finland, where he conducts cutting-edge research at the intersection of formal methods and computational logic. His academic profile demonstrates sustained contributions to theoretical computer science with practical applications in system verification and blockchain technology. His research program centers on advancing formal verification techniques, with core expertise in: Symmetry reduction algorithms for state space explosion SAT/SMT solving with specialized parity and XOR reasoning Bounded model checking of timed and asynchronous systems Blockchain protocol verification (notably DeFi lending pools) Canonical labeling tools for graph automorphism detection Recent work shows increasing focus on decentralized finance applications while maintaining foundational contributions to solver technology. Analysis of his publication trajectory (2011-2022) reveals consistent innovation in SAT solving methodologies, with symmetry reduction and parity reasoning forming persistent research threads. His 2022 work on DeFi lending pools represents a strategic expansion into blockchain verification, leveraging established formal methods expertise for emerging financial technologies. Tool development (bliss, PySMT) demonstrates commitment to practical research impact. No scientific awards were documented in the source materials. Similarly, no information regarding student supervision, grant funding, or laboratory affiliations was present in the provided text. His independent tool development (including bliss for graph canonical labeling and PySMT for SMT solver interfaces) indicates significant technical leadership within the formal methods community.
Dr. Alison Hsiang-Hsuan Liu is an Assistant Professor at the Faculty of Science, Utrecht University, specializing in the Algorithms and Complexity group within the Department of Information and Computing Sciences. Her research focuses on combinatorial optimization problems, particularly designing online and approximation algorithms for network design, resource allocation, scheduling, and graph coloring. She actively supervises graduate students and collaborates on algorithmic research in special graph classes. Email: h.h.liu@uu.nl Liu's research emphasizes potential functions and accounting methods for algorithm analysis, with a strong interest in non-determinism as a theoretical framework. Her work spans both fundamental algorithm design and applied problems in smart grids and energy-aware scheduling systems. Recent publications highlight advancements in scheduling with untrusted predictions, amortized recourse for online graph problems, and combinatorial optimization in smart grid models. These works have appeared at prestigious venues like SOFSEM, MFCS, WAOA, and journals including Theory of Computing Systems and Algorithmica. She supervises graduate students including: Bob Krekelberg Rick van de Bovenkamp Xiao-Ou Zhang Jonathan Toole-Charignon Liu has delivered invited speeches at institutions such as NYCU School of Law, University of Liverpool, and Academia Sinica, covering topics like AI-assisted decision making, online algorithms with predictions, and optimization under uncertainty.
Dr. Shahram Rasoolzadeh is a researcher in symmetric cryptography at Ruhr University Bochum's Faculty of Computer Science, specifically within the Chair for Symmetric Cryptography. He previously held post-doctoral positions at Radboud University and Ruhr University Bochum, and conducted PhD research at the HGI institute. His expertise spans cryptographic primitive design, Boolean function analysis, and embedded security. Education: PhD in Electrical Engineering (Symmetric Cryptography & Embedded Security), Ruhr University Bochum (2020) M.Sc. in Electrical Engineering (Cryptography), Sharif University of Technology (2015) B.Sc. in Electrical Engineering (Communication Systems), University of Tabriz (2013) His research focuses on cryptanalysis of symmetric ciphers, Boolean function applications in cryptography, and low-latency cryptographic designs. Notable contributions include the cryptanalysis of HALFLOOP and the design of lightweight block ciphers like CRAFT and SPEEDY. He has received the Best Paper Award at FSE/ToSC 2024 and Intel's Outstanding Research Award 2022. His work often emphasizes practical security in constrained environments and collaborative industry partnerships. Dr. Rasoolzadeh co-organizes significant events like the Spring School on Symmetric Cryptography and contributes to program committees for conferences like EuroCrypt and ASIACRYPT. He has taught courses on symmetric cryptanalysis and calculus/probability theory.
Juan Jacobo Simon Pinero is a Professor in the Department of Mathematics at the Faculty of Mathematics, Universidad de Murcia, Spain. His research focuses on algebra, particularly ring theory, group theory, and their applications to coding theory and information theory. He earned his doctorate from Universidad de Murcia in 1992 with the thesis "El problema de la caracterización y de la unicidad," supervised by Dr. José Luis García Hernández. Professor Simon Pinero's research spans several interconnected areas of algebra and its applications. His primary focus is on ring theory and group theory, with significant contributions to the theory of partial group actions, Morita equivalence, and their applications to coding theory. His work bridges abstract algebra with practical applications in information theory and error-correcting codes. Over his career, he has explored the connections between algebraic structures like rings and groups and their applications in communication theory, particularly in the development and analysis of various coding schemes. His publication record shows a consistent research trajectory with significant contributions in both pure algebra and applied coding theory. In the early part of his career, he focused on foundational aspects of ring theory and Morita equivalence. Later, he expanded his research to include applications in coding theory, particularly exploring abelian codes, BCH codes, and Reed-Muller codes. His most recent work continues to bridge these areas, examining how algebraic structures can inform the design and analysis of efficient error-correcting codes. Professor Simon Pinero has collaborated extensively with researchers across Spain and internationally, with notable long-term collaborations with mathematicians such as José Joaquín Bernal, Angel del Río, and Mikhailo Dokuchaev. His work has been published in prestigious mathematics journals including Journal of Algebra, Communications in Algebra, and IEEE Transactions on Information Theory.
William Hoza is an Assistant Professor in the Department of Computer Science at the University of Chicago, affiliated with the UChicago CS Theory Group. His research focuses on computational complexity theory, particularly pseudorandom generators, derandomization of space-bounded computation, and circuit complexity. He earned a Ph.D. in Computer Science from the University of Texas at Austin (2021) and a B.S. from the California Institute of Technology (2016). Hoza advises two PhD students, including Zelin Lv (co-advised with Aaron Potechin). He has taught courses such as Introduction to Complexity Theory, Pseudorandomness, and Circuit Complexity. His academic journey includes a postdoctoral fellowship at UC Berkeley's Simons Institute. Hoza's work bridges theoretical computer science and practical algorithm design, with contributions to derandomization techniques and pseudorandom generator constructions. Key contributions include research on hitting sets, branching programs, and the limitations of pseudorandom generators. His publications span venues like FOCS, STOC, and ITCS, addressing foundational questions in computational complexity.
Jaco van de Pol is a Professor at the Department of Computer Science, Aarhus University. His research focuses on formal methods, quantum computing, and symbolic computation. He specializes in model checking, timed automata, decision diagram algorithms, and quantum circuit synthesis. Education background includes expertise in computer science with a strong foundation in theoretical computer science and formal verification techniques. Key research interests include: Development of scalable symbolic algorithms for large systems Quantum circuit optimization using SAT-based approaches External memory implementations of decision diagrams Formal verification of real-time and parametric systems Recent work emphasizes quantum computing applications, such as layout-aware CNOT circuit synthesis for NISQ processors, and novel algorithms for parametric timed games. His contributions include the Adiar framework for external memory BDD manipulation and the Sylvan decision diagram library. No academic awards or grants are explicitly mentioned in the provided materials. He has advised multiple collaborations but no specific student names are listed. His research group focuses on advancing formal methods through practical tools and theoretical advancements.
Ryan O'Donnell is a Professor of Computer Science at Carnegie Mellon University, where he is a member of the Theory Group within the Computer Science Department. He has established himself as a leading researcher in theoretical computer science with a focus on quantum computation, analysis of Boolean functions, and computational complexity. Professor O'Donnell's research spans multiple interconnected areas of theoretical computer science. His primary interests include quantum computation and information theory, approximability of optimization problems, spectral graph theory, analysis of Boolean functions, probability, and complexity theory. His work is characterized by deep mathematical insights combined with computational applications, often bridging seemingly disparate fields to develop novel theoretical frameworks. His recent publications reveal a strong emphasis on quantum computing theory, with numerous papers on quantum state certification, quantum algorithms, and quantum information processing. He has also made significant contributions to graph theory, particularly in developing explicit constructions of expanders beyond traditional spectral barriers. His research frequently combines techniques from probability theory, combinatorics, and algebra to solve challenging problems in theoretical computer science. Professor O'Donnell is the author of the influential book "Analysis of Boolean Functions," which has become a standard reference in the field and is available as a free PDF download. He regularly teaches advanced courses at CMU, including "15-759: Spectral Graph Theory" and various offerings on quantum computing, demonstrating his commitment to both research and education in theoretical computer science.
