Pavel Hrubes is a theoretical computer scientist and mathematician specializing in computational complexity, arithmetic circuits, and non-commutative computation. His work explores foundational aspects of circuit complexity, proof systems, and algebraic models. Key collaborations with Amir Yehudayoff, Avi Wigderson, and others. Contributions to monotone circuit lower bounds, depth reduction techniques, and connections between learnability and set theory. Research Interests : Computational complexity theory Arithmetic circuit design and analysis Non-commutative and monotone computation Algebraic lower bounds and polynomial identities Applications to mathematical logic and learning theory Notable Trends in Publications : Focus on depth and structure limitations in arithmetic circuits Interdisciplinary work bridging machine learning, logic, and complexity Advancements in understanding commutativity and associativity in algebraic proofs Analysis of isoperimetric profiles and graph-based computational models
Enrico Borriello serves as a Research Assistant Professor in Arizona State University's School of Complex Adaptive Systems and holds a concurrent appointment as Senior Global Futures Scientist. His interdisciplinary work bridges theoretical physics with complex systems science, focusing on network dynamics and astrophysical phenomena across ASU's research initiatives including the Complex Systems Research Group and Biosocial Complexity Initiative. Borriello's research centers on the controllability of complex networks—particularly gene regulatory systems—and non-linear dynamics in biological modeling. He equally investigates theoretical particle physics and astrophysics, specializing in neutrino behavior within supernovae and dark matter signatures through cosmic ray interactions. His expertise spans Network Science, Nonlinear Dynamical Systems, Neutrino Astrophysics, and Information Theory, with applications ranging from transcriptional regulation to galactic magnetic field phenomena. Analysis of his publication record reveals two dominant research streams: network science (focusing on Boolean network controllability, attractor landscapes, and evolutionary frameworks) and particle astrophysics (addressing neutrino oscillations, supernova modeling, and dark matter detection). This dual focus demonstrates his ability to apply theoretical physics principles to both biological complexity and cosmic-scale phenomena. Scientific Awards: No awards or fellowships were mentioned in the source materials. Advising and Grants: The provided information does not specify doctoral students, postdoctoral researchers, or grant funding details. His teaching portfolio indicates extensive course development in complex systems methodology rather than direct research supervision. Labs and Teams: Borriello actively contributes to ASU's Complex Systems Research Group and Biosocial Complexity Initiative, interdisciplinary hubs that facilitate collaboration between computational modelers, biologists, and social scientists studying emergent phenomena in adaptive systems.
Iftach Haitner is a Professor at Tel Aviv University's School of Computer Science, currently on leave while serving as Principal Researcher at the Stellar Development Foundation. His primary academic affiliation remains with Tel Aviv University where he maintains an active research group and supervises multiple PhD students. His educational background includes a PhD (2008) and Master's degree from the Weizmann Institute of Science under Omer Reingold and Oded Goldreich respectively, and undergraduate studies in Mathematics and Computer Science at Tel Aviv University. His research focuses on Cryptography and Computational Complexity , with significant contributions to coin-flipping protocols, one-way functions, differential privacy, and secure computation. Analysis of his 15 most recent publications reveals consistent focus on foundational cryptographic problems. His work demonstrates strong emphasis on computational entropy concepts (inaccessible entropy, next-block pseudoentropy), protocol security against adaptive adversaries, and tight complexity bounds for cryptographic primitives. The publications span top venues including STOC, FOCS, Crypto, and Eurocrypt, showing sustained high-impact research output. The Kadar Family Award for Outstanding Research (2018) Tel Aviv University Rector's Awards for Excellence in Teaching (2017, 2018) SIAM Outstanding Paper Prize (2011) Intel Israel award for outstanding PhD students (2008) Multiple best paper awards (CRYPTO 2006, ICALP 2006) Haitner has advised numerous PhD students including Noam Mazor, Jad Silbak, and Eliad Tsfadia. His research has been supported by multiple Israel Science Foundation grants (2011-2023), an ERC Starting Grant (2015-2020), and Blavatnik ICRC grants. He also maintains industry connections through roles at Coinbase (2022-2024) and previous consulting positions at Unbound Security and Team8. His professional service includes editorial work for SIAM Journal on Computing and program committee memberships for major cryptography conferences including Crypto, Eurocrypt, and TCC. He co-organizes the Greater Tel Aviv Area Cryptography Seminar and other specialized workshops.
Arijit Raychowdhury is a Professor in the School of Electrical and Computer Engineering at Georgia Institute of Technology's College of Engineering. His research spans low power digital and mixed-signal circuit design, power converters, sensor systems, and circuit-device technology interactions, supported by over 80 publications and 25+ patents. He earned his PhD from Purdue University in 2007, receiving the College of Engineering Best Thesis Award and Dimitris N. Chorafas Award for doctoral research excellence. His work focuses on energy-efficient hardware for smart cameras, voice activity detection, and non-Boolean computing fabrics using emerging devices. Recent publications reveal strong trends in in-sensor analytics via compressed sensing, oscillator-based neuromorphic computing, and ultra-low power adaptive circuits for variation tolerance. His innovations bridge circuit design with machine learning and context-aware systems. Scientific awards include: Intel Labs Technical Contribution Award (2011) Best Paper Awards at ISLPED (2012, 2006) and IEEE Nanotechnology Conference (2003) SRC Technical Excellence Award (2005) Intel Foundation and NASA INAC Fellowships (2006, 2004) Dimitris N. Chorafas and Purdue Best Thesis Award (2007) He serves on Technical Program Committees for DAC, ICCAD, VLSI Symposium, and ISQED, and contributes as guest associate-editor for JETC while teaching specialized short courses globally.
Dr. Saeed Shiry Ghidary is a Lecturer at Staffordshire University’s Digital, Tech, Innovation & Business department. He holds a Ph.D. in Robotics and Intelligent Systems from Kobe University (Japan), alongside M.Sc. and B.Sc. degrees in Computer Architecture and Electronics from Amirkabir University of Technology (Iran). His research focuses on interdisciplinary areas including Machine Learning, Robotics, AI, Computer Vision, and Cognitive Science. He has led international research teams, including chairing the Amirkabir Robotic Center, and contributed to over 20 peer-reviewed publications. **Education:** Ph.D., Robotics and Intelligent Systems, Kobe University, Japan (2002) M.Sc., Computer Architecture, Amirkabir University, Iran (1994) B.Sc., Electronics Engineering, Amirkabir University, Iran (1990) **Research & Teaching:** Dr. Ghidary specializes in AI and robotics education, teaching graduate and undergraduate courses. His research emphasizes applications like BCI systems, EEG signal processing, and kernel methods for dimensionality reduction. He has collaborated with institutions in Japan, France, Australia, and the U.S., and serves as an HEA Fellow. **Awards & Recognition:** HEA Fellowship **Consulting & Industry:** He advises industries on AI, robotics, and automation for sectors like banking, insurance, and oil production, focusing on efficiency and profitability through technological integration.
Luke Schaeffer is an Assistant Professor at the University of Waterloo, affiliated with the Cheriton School of Computer Science and the Institute for Quantum Computing (IQC). His academic journey includes a BMath and MMath from Waterloo, a PhD from MIT under Scott Aaronson, and postdoctoral positions at Waterloo and UMD. His research bridges quantum computing and theoretical computer science, with focuses on quantum circuit complexity, classical simulation of quantum systems, and combinatorics on words. Notable projects include studying the Clifford group's structure, low-depth quantum vs. classical circuits, query complexity of regular languages, and fermion-to-qubit encodings. He also explores non-quantum areas like combinatorial game theory and cellular automata. His work on interactive quantum advantage protocols demonstrated separations between quantum and classical circuit models, including results against AC⁰[p] and NC¹ classes. He co-developed sample-optimal classical shadow algorithms for pure states and classified Clifford gates over qubits into 57 distinct classes. Education: BMath and MMath, University of Waterloo PhD in Computer Science, MIT (advisor: Scott Aaronson) Key Research Themes: Quantum advantage and circuit complexity Automata and combinatorics on words Classical simulation techniques for quantum systems Algorithmic foundations of quantum computing He advises students in the Cheriton School of Computer Science, emphasizing quantum computing and theoretical computer science. His contributions include foundational results in quantum-classical separations and decidability of word properties via first-order logic.
Daniel Lathrop is a Professor of Physics and Geology at the University of Maryland (UMD), and a Fellow of the American Physical Society. He joined UMD in 1997 following postdoctoral roles at Yale and faculty positions at Emory University. His research spans nonlinear dynamics, quantum science, and geophysical fluid dynamics. Lathrop directs the Nonlinear Dynamics Laboratory, focusing on experiments simulating Earth’s core (e.g., the 3-meter liquid sodium spherical Couette experiment) and superfluid helium phenomena. Education: B.A. in Physics (UC Berkeley, 1987), Ph.D. in Physics (University of Texas at Austin, 1991). Research emphasizes turbulent flows in rotating systems, magnetic field generation (dynamo effects), and quantum fluid behavior. His lab integrates machine learning for prediction of magnetic field evolution and turbulence dynamics. Collaborations include developing UAV-based geophysical sensors for landmine detection and advancing stochastic computing hardware using magnetic tunnel junctions. Awards include the NSF Presidential Early Career Award (1997), APS Stanley Corrsin Award (2012), and UMD Distinguished Scholar-Teacher designation. He served as Director of the Institute for Research in Electronics and Applied Physics (2006–2012). Advising: Supervised numerous graduate students in experimental physics and geophysics. Active in interdisciplinary projects combining fluid dynamics, quantum science, and machine learning. Labs/Teams: Nonlinear Dynamics Laboratory, Quantum Materials Center, and Institute for Research in Electronics & Applied Physics (IREAP). Research themes include planetary magnetic field modeling, turbulence in extreme conditions, and novel computing hardware inspired by physical systems.
Simona Samardjiska is an Assistant Professor in the Digital Security Group at Radboud University, The Netherlands, since 2017. Previously, she held an assistant professor position at the Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University, Skopje, Macedonia (2015–2017). She earned her PhD in Cryptography from the Norwegian University of Science and Technology (NTNU) in 2015, focusing on multivariate cryptography under Danilo Gligoroski. Her academic background includes a master’s degree in Computer Science and a diploma in Pure Mathematics from the Faculty of Natural Sciences and Mathematics, Skopje. Her research primarily revolves around post-quantum cryptography, including multivariate, code-based, and lattice-based systems, alongside symmetric cryptography and Boolean functions. Notable contributions include the MQDSS digital signature scheme (a NIST PQC candidate) and the MEDS submission to NIST’s round 3. She has published extensively in top venues like EUROCRYPT, ASIACRYPT, and IEEE Transactions. Samardjiska teaches courses such as Cryptology (NWI-IMC063), Applied Cryptography (NWI-IMC061), and Security (NWI-IPC021) at Radboud University. She actively participates in standardization efforts, conferences, and workshops, including organizing CrossFyre (EUROCRYPT 2021/2020) and serving on program committees for CBCrypto, CANS, and others. Her professional activities emphasize fostering diversity in computing and advancing cryptographic research.
Mareike Dressler is a Senior Lecturer (A/Professor, tenured) and ARC Discovery Early Career Research Fellow at the School of Mathematics and Statistics, University of New South Wales (UNSW Sydney). She joined UNSW in February 2022 as a Lecturer (Assistant Professor, tenure-track) and was promoted to Senior Lecturer with tenure in July 2024. Her educational background includes: PhD in Mathematics from Goethe-Universität Frankfurt/Main (2018), supervised by Thorsten Theobald M.Sc. in Mathematics from Goethe-Universität Frankfurt/Main (2013) B.Sc. in Mathematics from Goethe-Universität Frankfurt/Main (2010) Mareike's research focuses on real and computational algebraic geometry and polynomial and convex optimization. She also works on problems intersecting with convex geometry, matrix and tensor computation, applied algebraic geometry, algebraic and geometric combinatorics, and real analysis. Her work particularly involves nonnegativity of polynomials, optimization methods, and ranks of matrices and tensors, with a special interest in sums of nonnegative circuits (SONCs) for sparse polynomials. Her research has strong applications in data science and machine learning. Mareike has received several prestigious awards including the ARC Discovery Project 2025 grant for "Quantifying Uncertainty of Risk-Aware Optimization for Safe Decision-Making," the J G Russell Award from the Australian Academy of Science, and the Early Career Impact Award from UNSW Science. She actively supervises research students, including PhD student Hongzhi Liao, Master's student Qi Wang, and recently supervised Moritz Schick to completion of his PhD in 2025. Mareike has secured significant research funding, including an ARC Discovery Early Career Researcher Award (DECRA) for 2024-2026. Mareike is an active member of the academic community, regularly organizing workshops and conferences such as "Optimization Days" at UNSW and minisymposia at major conferences like SIAM Conference on Applied Algebraic Geometry.
Professor Filippo Menolascina holds a Personal Chair of Engineering Biology at the University of Edinburgh's School of Engineering, affiliated with the Centre for Engineering Biology and Institute of Bioengineering. His research bridges engineering principles with biological systems to advance synthetic biology and biomolecular network design. Menolascina's research focuses on engineering biology, gene regulatory networks, and cybergenetic control systems. He develops computational models for biomolecular circuit calibration, synthetic promoter design in mammalian cells, and bacterial chemotaxis mechanisms. His work integrates control theory with synthetic biology to create programmable biological systems for medical applications. Recent publications (2021-2023) reveal a strong trend in cybergenetic control of biomolecular networks, split intein engineering for logic gates, and in vitro disease modeling. Key themes include computational design of genetic circuits, trade-offs in biological sensing systems, and multimodal databases for metabolic liver disease, demonstrating cross-disciplinary applications from fundamental microbiology to clinical hepatology. Scientific awards: No specific awards mentioned in source material. Menolascina has secured significant research funding as Principal Investigator for: Biodynamic Atlas (Department for Science, Innovation & Technology, 2024) McSynC: in vivo automatic Model calibration of Synthetic Circuits components (EPSRC, 2018-2020) He also serves as Co-investigator on: 21EBTA Engineering Biology for Cell and Gene Therapy Applications (BBSRC, 2022-2024) Fostering Synthetic Biology standardisation (EU, 2018-2021) He leads interdisciplinary teams within the Centre for Engineering Biology, collaborating with medical researchers on liver disease models and engineers on respiratory droplet dispersion studies. His lab develops computational tools for synthetic circuit design while maintaining strong industry and international academic partnerships in bioengineering standardization.
Joel Grodstein is a Lecturer in the Department of Electrical Engineering at Tufts University's College of Engineering. He holds a BSEE from Case Western Reserve University (1981) and an MSCS from the University of Utah (1986). His research spans VLSI design, computer architecture, and interdisciplinary bioelectricity studies, focusing on the intersection of hardware-software systems and biological applications. He teaches courses on real-time embedded systems, parallel computing, bioelectricity, and digital design verification. His career includes roles at Digital Equipment Corporation, Compaq, Intel, and now academia. His recent work bridges computational modeling of bioelectric networks with traditional hardware design, as seen in collaborations with Mike Levin's lab at Tufts. Courses like EE 123 (Bioelectricity) and new offerings like EE 152 (Real-Time Embedded Systems) reflect this dual focus. Publications emphasize symbolic timing analysis, CAD tools for VLSI, and bioelectric systems. He has advised no listed students but collaborates actively with industry partners (e.g., NVIDIA for EE 165). His lab work involves biophysical modeling and synthetic biology projects, as detailed in his recent bioelectricity-related papers.
Yatsko Oksana Myroslavivna is an Associate Professor at the Department of Computer Science, Chernivtsi National University named after Yuriy Fedkovych. She holds a Candidate of Pedagogical Sciences degree (specialty 13.00.02 - theory and methods of teaching informatics) and has been certified as an Associate Professor since 2022. Her research focuses on computer-oriented methodological systems for teaching computer disciplines, with specializations in data mining for business applications, game theory implementation in economic decision-making, web technologies development, and algorithm design. She actively contributes to educational literature with multiple textbooks on Discrete Mathematics, Operations Research, Web Technologies, and Systems Modeling. Her professional engagements include membership in the Bukovina Information Technology Cluster, Chernivtsi Mathematical Society, and participation in international conferences like SPIE Optical Engineering and Correlation Optics. She has completed advanced certifications in machine learning, data visualization, and online education technologies from Prometheus, SoftServe, and other institutions. Her publications demonstrate expertise in strategic business analysis, cross-platform decision support systems, and educational software development. The 15 most recent works (2023-2024) cover data structures, game theory applications, web development tools, and polarization-based biomedical diagnostics. She serves as an expert for Ukraine's Ministry of Education and National Agency for Quality Assurance in Higher Education.
Mingfu Shao is an Associate Professor at the Department of Computer Science and Engineering, Pennsylvania State University, and affiliated with the Huck Institutes of the Life Sciences. His research focuses on computational biology and bioinformatics, specifically on RNA-seq data analysis, transcriptome assembly, and genome rearrangement algorithms. Research interests include developing exact and heuristic algorithms for genomic problems such as breakpoint distance computation, double-cut-and-join (DCJ) operations, and accurate assembly of circular RNAs and synthetic long reads. His work integrates machine learning techniques with traditional algorithmic approaches to enhance sequence analysis efficiency. Recent publications highlight advancements in RNA-seq data processing (e.g., Aletsch, TERRACE, Anchorage) and theoretical contributions to edit distance and k-mer analysis. His projects, funded by the National Science Foundation and the National Human Genome Research Institute, aim to improve isoform-level regulatory network inference and allele-specific transcript assembly.
Libor Barto is a full professor at the Department of Algebra, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic. He is a leading researcher in universal algebra and computational complexity, with a strong focus on constraint satisfaction problems (CSPs) and their algebraic foundations. He leads the ERC Synergy Grant POCOCOP and previously led the ERC Consolidator Grant CoCoSym, and is deeply involved in advancing the algebraic theory of promise constraint satisfaction. Research Interests: His primary research areas include universal algebra, computational complexity, constraint satisfaction problems (CSP), promise constraint satisfaction problems (PCSP), clone theory, and the algebraic approach to logic and computation. He investigates the interplay between algebraic structures and computational tractability, particularly through polymorphisms, minions, and Taylor algebras. The recent articles reflect a strong trend in unifying algebraic approaches to CSP, exploring promise variants, approximation through plurimorphisms, symmetries in structures, and the role of Weisfeiler-Leman hierarchies. His work often appears in top-tier journals and conferences such as the Journal of the ACM, SIAM Journal on Computing, and LICS. Fellow of the Learned Society of the Czech Republic (since 2024) ERC Synergy Grant (POCOCOP, 2023–2029) ERC Consolidator Grant (CoCoSym, 2018–2023) Charles University Research Center (UNCE) Grant (PI, 2024–2029) Libor Barto advises PhD students and leads research teams under major grants like POCOCOP and CoCoSym. He has secured substantial funding from the European Research Council and the Czech Science Foundation (GACR). He is actively involved in the academic community as an editor of Algebra Universalis and Acta Scientiarum Mathematicarum , and has served on program committees for LICS, ICALP, and STACS. He has organized major workshops, including at the Fields Institute and multiple AAA and SSAOS conferences. He is involved in several research labs and collaborative teams, particularly through the Department of Algebra at Charles University, the POCOCOP project (with M. Bodirsky and M. Pinsker), and the CoCoSym ERC team. His work fosters international collaboration with researchers in France, Germany, Austria, Poland, Canada, and the USA.
Liu Yang is a postdoctoral fellow in the Computer Science Department at Carnegie Mellon University , with a PhD from CMU under Avrim Blum and Jaime Carbonell. His research focuses on Theoretical Machine Learning and Theoretical Computer Science , exploring areas like Statistical Learning Theory , Property Testing , and Algorithmic Economics . He has contributed to active learning , transfer learning , and online pricing problems through mathematical frameworks. Research Interests : Liu's work bridges Computational Learning Theory with Algorithmic Economics , including: Mathematical theories for active property testing of Boolean functions Transfer learning with applications to online allocation and pricing Analysis of convex losses and statistical identifiability in learning Developing Buys-in-Bulk models for active learning efficiency Service and Teaching : He has served on program committees for ICML 2012-2013 , reviewed for top-tier venues, and taught courses like Graduate Algorithms and Modern Computer Algebra at CMU. He also co-developed the DistLearnKit MATLAB toolkit for distance metric learning.
