Max Alekseyev is an Associate Professor in the Mathematics Department and Computational Biology Institute. His research spans computational graph theory, enumerative combinatorics, computational/algorithmic biology, and comparative genomics. He focuses on interdisciplinary problems, blending mathematics with biological applications, particularly in genome assembly and analysis. His work includes advancements in genome scaffolding algorithms, combinatorial sequence analysis, and mathematical biology. Notable contributions involve genome assembly tools like CAMSA and studies on ancestral genome reconstruction. He also explores theoretical topics such as Bernoulli series generalizations and modular data classification. His research trends highlight a blend of pure mathematics (e.g., number theory, graph theory) and applied computational methods, addressing challenges in genomics and evolutionary biology. He secured an NSF Student Travel Grant in 2018 for computational molecular biology.
Henry D. Pfister is the Addy Family Professor of Electrical and Computer Engineering at Duke University, with a secondary appointment in Mathematics. He holds affiliations with the Pratt School of Engineering and the Duke Quantum Center. His research focuses on information theory, error-correcting codes, quantum computing, and machine learning applications in communications. Pfister earned his Ph.D. from UC San Diego and has held prior roles at Texas A&M University, École Polytechnique Fédérale de Lausanne, and Qualcomm. Education: Ph.D. in Electrical Engineering, UC San Diego (2003); M.S. degrees in Public Policy and Environmental Management from Duke University; J.D. and additional degrees from UNC Chapel Hill. Research interests include Reed-Muller codes, quantum error correction, neural decoders for DNA storage, and capacity-achieving coding schemes. Recent work highlights include proving Reed-Muller codes achieve capacity on binary-erasure channels and developing quantum-enhanced classical communication protocols. Publications span topics like polar codes for quantum channels, belief-propagation algorithms, and neural network-based decoding. Notable grants include NSF funding for DNA storage coding and quantum simulation projects. Pfister has advised over 20 graduate students and is a recipient of the STOC Best Paper Award and NSF CAREER Award.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Tom Schrijvers is a Professor at the Department of Computer Science in the Faculty of Engineering Science at KU Leuven, Belgium. He leads the Programming Languages Group within the Declarative Languages and Artificial Intelligence (DTAI) research group. His research focuses on programming languages, particularly functional and logic programming, with special emphasis on Haskell, type systems, and algebraic effects. His research interests include: Functional Programming, especially Haskell Type Systems and Type Theory Algebraic Effects and Handlers Logic Programming, particularly Prolog Constraint Programming Domain-Specific Languages Programming Language Theory Prof. Schrijvers' recent research has focused on effect systems, staged programming, and language composition. His work on algebraic effect handlers has been particularly influential, providing new insights into how effects can be modularly composed and handled in functional languages. He has also made significant contributions to the understanding of type classes and their implementation in Haskell. His publications demonstrate a consistent focus on practical applications of programming language theory, with work spanning from foundational type theory to applied domain-specific languages for areas like fluorescence microscopy. His research often bridges the gap between theoretical programming language concepts and practical implementation concerns. Prof. Schrijvers has supervised numerous PhD students to completion, including Pieter Wuille, Benoit Desouter, George Karachalias, Steven Keuchel, Amr Saleh, Alexander Vandenbroucke, and Ruben Pieters. He currently supervises PhD students Klara Mardirosian, César Santos, Gert-Jan Bottu, Koen Pauwels, Birthe van den Berg, and Roger Bosman. His research group has received funding from various sources including EU projects like GRACeFUL. The Programming Languages Group at KU Leuven, which he leads, focuses on functional (Haskell) and logic (Prolog, Datalog, CLP) programming languages, as well as general programming language theory. The group has been active in numerous research projects and collaborations across Europe.
Nathan Kaplan is a Professor in the Department of Mathematics at the University of California, Irvine, where he conducts research in number theory, algebraic geometry, and combinatorics. His work spans rational points on varieties over finite fields, arithmetic statistics, coding theory, and the study of numerical semigroups. He is actively involved in the mathematical community, organizing seminars and conferences including the UC Irvine Number Theory Seminar and the Southern California Number Theory Day. Dr. Kaplan received his PhD from Harvard University in 2013 under the direction of Noam Elkies. Following his doctorate, he was a postdoctoral researcher at Yale University from 2013-2015 before joining the faculty at UC Irvine. His research interests focus on the intersection of number theory and algebraic geometry, with particular attention to problems involving rational points on varieties over finite fields, arithmetic statistics, and coding theory. He has made significant contributions to the study of numerical semigroups, cokernels of random p-adic and integer matrices, and quadratic forms and lattices. His work often bridges theoretical mathematics with applications in coding theory and cryptography. Analysis of his recent publications shows a strong trend toward combinatorial aspects of number theory, particularly in the study of numerical semigroups and their properties. He frequently collaborates with researchers across institutions, with recent work spanning algebraic geometry, combinatorics, and coding theory. His publications demonstrate expertise in both theoretical developments and computational aspects of number theory. Dr. Kaplan is deeply committed to undergraduate research and mentoring. He has experience as a mentor for undergraduate research projects through programs including SUMRY (a research program for Yale undergraduates), the University of Minnesota-Duluth REU program, and the Trinity University REU program. He actively encourages undergraduates to apply for summer research opportunities and has organized numerous outreach activities. He is an organizer of the UC Irvine Number Theory Seminar and the Southern California Number Theory Day conference series. In 2018, he co-organized the Conference on Open Questions in Cryptography and Number Theory in honor of Alice Silverberg's 60th Birthday. Dr. Kaplan has given numerous talks at mathematical venues including the Museum of Mathematics' Math Encounters series, where he presented "Error-Correcting Codes: The Mathematics of Communication" in July 2022. He has also spoken at the Yale Undergraduate Math Society, the UCI Math Circle, and various other outreach events.
Andrew Lan is an Associate Professor in the College of Information and Computer Sciences at the University of Massachusetts Amherst, where he also serves as the CS Undergraduate Program Director. He was granted tenure by the UMass Board of Trustees in June 2025 and is currently on leave through Spring 2026. His research focuses on developing human-in-the-loop machine learning methods to enable scalable, effective, and personalized learning experiences in education. Dr. Lan received his BS in Physics and Mathematics from the Hong Kong University of Science and Technology, followed by his MS (2014) and PhD (2016) in Electrical and Computer Engineering from Rice University. He completed postdoctoral research at Rice University (2016) and Princeton University's EDGE Lab (2017-2018). His research spans artificial intelligence for education, with particular expertise in educational data mining, knowledge tracing, personalized learning systems, and human-AI collaboration in educational contexts. Dr. Lan's work leverages massive and multimodal learner and content data collected from both traditional classrooms and online learning platforms to develop systems that deliver high-quality, affordable, and personalized learning experiences. He has made significant contributions to areas including computerized adaptive testing, math word problem generation, student affect detection, and automated grading systems. His recent work increasingly focuses on leveraging large language models for educational applications while maintaining rigorous scientific validation of these approaches. Best Student Paper Award at the 2024 AIED Conference (with Alexander Scarlatos) Best Paper Nominee at LAK 2021 Best Student Paper Award at IEEE Big Data 2020 NAEP Math Automated Scoring Challenge Grand Prize Winner Dr. Lan actively mentors graduate students and postdoctoral researchers, with several of his advisees receiving recognition for their work. He has secured substantial funding from the National Science Foundation, including a $90M grant for the SafeInsights project, a secure cyberinfrastructure for educational research. His research group collaborates with institutions including Worcester Polytechnic Institute, University of Pennsylvania, and Rice University. He teaches undergraduate and graduate courses including COMPSCI 240 (Reasoning under Uncertainty) and COMPSCI 590OP (Applied Numerical Optimization), with a focus on the practical application of theoretical concepts in machine learning and artificial intelligence. His educational philosophy emphasizes bridging the gap between theoretical foundations and real-world implementation in educational technology.
David Blaauw is the Kensall D. Wise Collegiate Professor of Electrical Engineering and Computer Science (EECS) at the University of Michigan. His research focuses on ultra-low-power analog/mixed-signal circuits, mm-scale sensors, neural networks, and biomedical applications. He leads the Blaauw Lab, which has pioneered innovations like the Michigan Micro Mote (M^3) and neural recording probes. His work emphasizes real-world deployability, with applications in environmental monitoring (e.g., monarch butterflies), medical devices, and robotics. Education: B.S. in Physics and Computer Science, Duke University (1986) Ph.D. in Computer Science, University of Illinois Urbana-Champaign (1991) Research Interests: Blaauw’s lab explores ultra-low-power computing, mm-scale systems, RF communication, in-memory computing, and genomics acceleration. Key projects include: Millimeter-scale computers (e.g., 0.04mm³ temperature sensors) Wireless neural interfaces for brain-machine communication Energy-efficient accelerators for edge AI and genomics Micro-robotics with sensing/actuation/computation Awards: IEEE Fellow 2016 SIA-SRC Faculty Award Motorola Innovation Award Best Paper Awards at ISSCC, ISCA, and RFIC Advising & Impact: Over 600 publications, 65 patents, and 4 startup companies spun from his lab. Current research includes genome sequencing accelerators (GenAx) and neural recording dust for brain mapping. He directs the Michigan Integrated Circuits Lab and chairs major conferences like ISSCC and DAC. Labs/Teams: Blaauw Lab (University of Michigan) Michigan Integrated Circuits Lab (MICAL)
Professor Moncef Gabbouj is a distinguished academic and researcher currently serving as Professor of Signal Processing at the Department of Computing Sciences, Faculty of Information Technology and Communication Sciences, Tampere University, Finland. Previously, he held the same position at Tampere University of Technology before the merger in 2019. He has also held visiting professorships at prestigious institutions including Hong Kong University of Technology and Science, University of Southern California, and Purdue University. Ph.D. and MSc. in Electrical Engineering from Purdue University, USA (1989 and 1986) B.Sc. in Electrical Engineering from Oklahoma State University, USA (1985) Prof. Gabbouj's research spans multiple domains within signal and image processing, with a strong focus on machine learning applications. His primary research interests include artificial intelligence, machine learning, Big Data analytics, multimedia content-based analysis, indexing and retrieval, nonlinear signal and image processing, voice conversion, and video processing and coding. His work bridges theoretical advancements with practical applications across various industries, particularly in multimedia communications and biomedical applications. His extensive publication record demonstrates a clear evolution from traditional signal processing techniques toward more sophisticated machine learning and deep learning approaches. Recent work shows increasing focus on convolutional neural networks for various applications including ECG classification, video processing, financial time-series analysis, and image recognition tasks, reflecting the broader trend in the field toward deep learning methodologies while maintaining strong foundations in signal processing theory. IEEE Fellow (2011) Member, Finnish Academy of Science and Letters (2014) Knight, First Class, of the Order of the White Rose of Finland (2006) Nokia Foundation Recognition Award (2005) Nokia Foundation Visiting Professor Award (2012) Finnish Cultural Foundation for Art and Science Award (2017) TUT Foundation Grand Award (2015) Prof. Gabbouj has supervised 64 doctoral and 72 Master's theses, demonstrating his significant contribution to academic mentoring. His research has been supported by substantial funding, including research grants totaling 8.5 million Euro (2001-2015). He has served as Academy of Finland Professor during 2011-2015 and has been involved in numerous EU research projects including Horizon, ESPRIT, HCM, IST, COST, Tempus and Erasmus programs. As Editor, Guest Editor or member of the Editorial Board of 6 international scientific journals, he has significantly influenced the academic discourse in his field. He leads the Signal Analysis and Machine Intelligence (SAMI) research group at Tampere University and serves as the Finland Site Director of the NSF IUCRC funded Center for Visual and Decision Informatics. His research unit focuses on applying advanced machine learning techniques to solve complex problems in signal processing, computer vision, and multimedia analytics, with applications ranging from healthcare to multimedia communications and financial analysis.
John Voight is a Professor of Mathematics at the University of Sydney, affiliated with the School of Mathematics and Statistics. He holds a Ph.D. from UC Berkeley (2005) and has held academic positions at the University of Sydney, University of Minnesota, University of Vermont, and Dartmouth College. His research focuses on arithmetic algebraic geometry, number theory, and computational aspects of these fields, including modular forms, elliptic curves, and quaternion algebras. Education: Ph.D. in Mathematics, UC Berkeley (2005); earlier studies include a focus on classical piano and liberal arts at Gonzaga University. Professional trajectory includes postdoctoral roles at the University of Sydney and University of Minnesota, followed by faculty appointments at the University of Vermont (2006–2013) and Dartmouth College (2013–present). Research Interests: Arithmetic algebraic geometry: modular curves, Shimura varieties, moduli spaces, and algorithmic methods Number theory: algebraic number theory, quadratic forms, cryptography, and coding theory Computational mathematics: modular forms, quaternion algebras, and database construction (e.g., LMFDB) Publications and Recognition: Over 90 peer-reviewed articles, including contributions to Contemp. Math. , Math. Comp. , and Res. Number Theory . Recipient of the Selfridge Prize in Number Theory and recognized for teaching excellence at Dartmouth. Leads projects on Hilbert modular forms and paramodular abelian surfaces. Teaching and Mentorship: Emphasizes student-centered learning and the integration of liberal arts with STEM. Advises students on topics ranging from elliptic curves to cryptography. Active in curriculum design and promoting computational tools in mathematics education. Labs/Teams: Collaborates with the L-Functions and Modular Forms Database (LMFDB) project, contributing to computational frameworks for algebraic geometry and number theory.
Ben Bloem-Reddy is an Assistant Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver Campus. His research focuses on statistical theory and applications in machine learning, particularly in causal inference, Bayesian methods, neural networks, and probabilistic models. He advises current students Quanhan (Johnny) Xi, Kenny Chiu, and Gian Carlo Diluvi. His work bridges foundational statistical theory with practical machine learning challenges, including causal discovery, model identifiability, and uncertainty quantification. Recent research explores topics such as latent variable models, generative processes, and symmetry in data and algorithms. His contributions span interdisciplinary areas like particle physics applications and information theory-based compression techniques. Ben’s research trends emphasize advancing theoretical guarantees for modern machine learning systems while addressing real-world problems. His publications frequently intersect with algebraic topology (e.g., cocycles in causal inference) and nonparametric methods. He maintains an active lab within the Department of Statistics, fostering collaborations across UBC’s academic ecosystem. No scientific awards are explicitly listed in the provided information. His advising and grant activities focus on statistical methodology development, as evidenced by his student supervision and published work. His office is located in ESB 3168, and he can be reached at benbr@stat.ubc.ca.
Damien Stehlé is a Professor at the École Normale Supérieure de Lyon (ENS Lyon), affiliated with the Laboratoire LIP (CNRS, ENSL, INRIA, UCBL, U. Lyon) and a member of the AriC team. He is also a member of the Institut Universitaire de France. His research focuses on cryptography, computational number theory, and computer algebra, particularly lattice-based cryptography and its applications in post-quantum security. He has held editorial roles at the Journal of Cryptology and Designs, Codes and Cryptography, and served on committees for major conferences like ASIACRYPT and CRYPTO. His work has led to advancements in lattice reduction algorithms, cryptographic protocols (e.g., signatures, encryption schemes), and security proofs in the quantum random oracle model. Stehlé has supervised numerous PhD students, including Alice Pellet-Mary and Miruna Rosca, and has contributed to open-source lattice reduction software like fplll. His awards include Best Paper Awards at ASIACRYPT 2021 and 2015. He teaches advanced courses on post-quantum cryptography and cryptanalysis at the Master’s level.
Carles Padro Laimon is a Professor at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Mathematics and the School of Telecommunications Engineering. He is a leading researcher in cryptography and information security, focusing on secret sharing schemes, combinatorial structures, and cryptographic protocols. His work integrates discrete mathematics, coding theory, and algorithmic design to address security challenges in digital systems. Padro leads the MAK Research Group (Mathematics Applied to Cryptography) and the ISG-MAK Information Security Group. He has been involved in numerous competitive research projects, including initiatives on post-quantum cryptography and secure multi-user systems. His contributions span over 211 documented activities, including articles, theses, and conference participations. His research interests include the theoretical foundations of cryptography, with a focus on optimizing secret sharing schemes, analyzing matroid-based structures, and developing secure communication protocols. He has collaborated extensively with institutions like the UPC and European research networks, contributing to both academic and practical advancements in cybersecurity. Padro holds a PhD in Mathematics from UPC and has supervised doctoral theses and mentored researchers in his field. His work frequently appears in top journals like IEEE Transactions on Information Theory, Designs, Codes and Cryptography, and SIAM Journal on Discrete Mathematics.
Prof. Felix Krahmer is a TUM Tenure Track Assistant Professor of Optimization and Data Analysis at the Department of Mathematics, Technische Universität München (TUM), part of the School of Computation, Information and Technology. Previously, he held a Junior Professorship (W1) for Mathematical Data Analysis at the University of Göttingen (2012–2015). His research focuses on mathematical foundations of data science, including compressed sensing, signal quantization, uncertainty quantification, and optimization algorithms. He has led an Emmy Noether research group and contributed to the ZeMat interdisciplinary project. Education : PhD in Mathematics (2009), New York University, advisors: Percy Deift & Sinan Güntürk MSc in Mathematics (2007), New York University BSc in Mathematics (2004), Jacobs University Bremen Research Interests : Krahmer’s work bridges theoretical mathematics and applied data science. Key areas include compressed sensing algorithms, high-dimensional signal reconstruction, quantization theory for analog-to-digital conversion, and optimization methods for inverse problems. He also explores applications in imaging (e.g., MRI reconstruction) and stochastic processes. Key Contributions : His research on phase retrieval, sigma-delta quantization, and compressed sensing recovery has advanced signal processing techniques. Recent efforts focus on uncertainty quantification for high-dimensional inverse problems and the mathematical analysis of consensus-based optimization. Grants & Awards : Emmy Noether Research Group Grant (DFG) Funding from BMBF (ZeMat project) Teaching & Outreach : Krahmer has taught advanced courses on compressed sensing, functional analysis, and random matrix theory. He co-organized workshops on probabilistic techniques and clinical risk prediction, emphasizing interdisciplinary collaboration. Labs/Teams : Member of the TUM Data Science Research Group, focusing on optimization, imaging, and uncertainty quantification. Active in the Munich Center for Quantum Science and Technology (MCQST).
Arrvindh Shriraman is an Associate Professor and Program Director of Software Systems at Simon Fraser University's School of Computing Science in Surrey. His research focuses on energy-efficient software, multicore memory systems, and optimizing hardware/software interfaces for parallel programming. He holds a Ph.D. (2010) and M.S. (2006) in Computer Science from the University of Rochester, and a B.Eng. (2004) from the University of Madras. He teaches courses on parallel programming and energy-conscious software design. His research interests include synchronization mechanisms for domain-specific architectures, cache optimization, and FPGA-based acceleration. He has contributed to frameworks like Mu-grind for HLS-generated RTL instrumentation and TAPAS for parallel accelerator generation. Notable projects include RANGE-BLOCKS for synchronization in domain-specific systems and TapeFlow for gradient computation in neural networks. His work emphasizes real-time verification of autonomous systems and safety-critical trajectory planning for underwater vehicles. Shriraman collaborates closely with the Tangent Lab, exploring cutting-edge solutions in hardware-software co-design and embedded systems. His teaching and research bridge theoretical computer science with applied engineering challenges, addressing scalability, efficiency, and safety in modern computing systems.
William Sulis is an Associate Clinical Professor in the Department of Psychiatry and an Associate Member of the Department of Psychology at McMaster University, where he also directs the Collective Intelligence Lab (CILab). With a unique interdisciplinary background spanning mathematics, physics, and psychiatry, Dr. Sulis bridges the gap between theoretical science and clinical practice. His educational journey is exceptionally diverse: B.Sc. (Hon) in Mathematics with minor in Theoretical Physics, Carleton University (1976) M.D., University of Western Ontario (1980) M.A. in Mathematics, University of Western Ontario (1984) Ph.D. in Mathematics, University of Western Ontario (1989) FRCPC in Psychiatry (1984) Ph.D. in Theoretical Physics, University of Waterloo (2014) CRCPC in Geriatric Psychiatry (2015) Dr. Sulis's research explores the intersection of complex systems theory with psychological and psychiatric phenomena. His work on Collective Intelligence investigates how group dynamics emerge from individual interactions, while his research on Temperament and Psychobiology examines the continuum between normal personality variations and mental illness. He has made significant contributions to understanding Synchronization in Complex Systems and developed the concept of Transient Induced Global Response Synchronization (TIGoRS) , which has implications for neural coding and information processing. His theoretical work extends to Quantum Foundations and Process Algebra Theory , where he proposes novel approaches to quantum mechanics. Analysis of his recent publications reveals a consistent thread connecting complex systems theory with psychological and psychiatric applications. His work increasingly focuses on bridging the gap between temperament theory and clinical psychiatry, using mathematical and computational approaches to understand mental illness. Simultaneously, he continues to develop theoretical frameworks in quantum physics through process algebra models, demonstrating remarkable interdisciplinary range. Dr. Sulis has received several prestigious awards including The Governor General's Medal for having the highest overall grade point average in his graduating class, the Henry Marshall Tory Scholarship, and multiple Harry Stevenson Southam Scholarships. Throughout his career, Dr. Sulis has mentored numerous students across disciplines, supervising research projects spanning collective intelligence, semantic space modeling, network dynamics, and temperament studies. His Collective Intelligence Lab has served as a hub for interdisciplinary research connecting computer science, psychology, and psychiatry. Dr. Sulis has also been actively involved in professional organizations, serving as President of The Society for Chaos Theory in Psychology and the Life Sciences (1996-1998) and holding editorial positions for several journals including "Dynamical Psychology" and "Nonlinear Dynamics in Psychology and the Life Sciences." As Director of the Collective Intelligence Lab at McMaster University, Dr. Sulis fosters research exploring how complex adaptive systems can model cognitive and social phenomena. The lab serves as an intellectual nexus where mathematics, computer science, psychology, and psychiatry converge to address fundamental questions about intelligence, both individual and collective.
