جستجوی استاد راهنمای دانشگاهی

Eva Cantoniمشاهده پروفایل

استاد

• Robust statistics
• Variable and model selection
• Nonparametric regression
• +۶ مورد دیگر

Eva Cantoni is a Full Professor at the Research Center for Statistics within the Geneva School of Economics and Management , University of Geneva. Her expertise spans robust statistical methodology, model selection, and applications in ecology and medicine. Ph.D. from University of Geneva Accredited European Statistician (FENStatS) Research Interests : She specializes in Robust statistics for real-world data Variable/model selection in high-dimensional settings Nonparametric and semi-parametric regression Zero-inflated and overdispersed count models Longitudinal and spatiotemporal data analysis Her work addresses ecological challenges (fish stock assessment), medical applications (hospital congestion modeling), and housing market analysis. Recent Trends in Publications : Recent articles focus on Confidence intervals for robust mixed models Editorial leadership in robust statistics Applications to fisheries science and public health Flexible modeling frameworks for complex data Comparative studies of statistical measures Extremes modeling in healthcare Leadership & Grants : She has served as: Vice-Dean for Teaching (2020-2023) Director of Master's in Statistics (2012-2019) Director of Applied Statistics Certificate (2015-2019) President, Swiss Federal Statistics Committee (2024-2027) Specialty Chief Editor, Frontiers in Applied Mathematics (2024) Grants include projects on Robust solutions for modern data (2023-2025) Sustainable fisheries modeling (2018-2021) Advancements in state-space models (2014-2017) Software Contributions : Developed R packages for robust statistical methods: confintROB (bootstrap confidence intervals) RobSSM (robust state-space models) R2_LMM (explained variation measures)

Chen Liuمشاهده پروفایل

استادیار

• Machine Learning
• Adversarial Robustness
• Privacy-Preserving Machine Learning
• +۹ مورد دیگر

Chen Liu is an Assistant Professor in the Department of Computer Science at City University of Hong Kong and the Principal Investigator (PI) of the Machine Learning and Optimization (MLO) group. His research focuses on building reliable machine learning models, particularly studying robustness and privacy properties of deep neural networks from an optimization perspective. University: City University of Hong Kong Academic Rank: Assistant Professor Students: Supervises multiple PhD, MPhil, and postdoctoral researchers. Education: Holds a Ph.D. (2022) and MSc (2017) in Computer Science from École Polytechnique Fédérale de Lausanne (EPFL), and a BSc (2015) in Computer Science from Tsinghua University. Research Interests: Adversarial robustness, privacy-preserving machine learning, optimization algorithms, dataset distillation, generative models, and theoretical analysis of loss landscapes. His work addresses challenges like catastrophic overfitting, architecture overfitting in distilled data, and stable adversarial training methods. Article Trends: Recent publications explore adversarial robustness under l0/l1 norms, gradient inversion for data reconstruction, evolutionary factor searching in finance, and meta-tuning for out-of-domain few-shot learning. These works emphasize optimization techniques to enhance model reliability and generalization. Scientific Awards: Microsoft Research Ph.D. Scholarship Programme (2017–2019) Advising and Grants: Supervises a diverse team of current and former students, with collaborations across institutions like George Mason University and Zhejiang University. Research supported by academic and industry grants. Labs and Teams: Leads the MLO group, which investigates fundamental ML theory and algorithms to improve system reliability. The group's work spans adversarial training, dataset distillation, and generative model optimization.

Ulrik Brandesمشاهده پروفایل

استاد

• Social Network Analysis
• Graph Theory
• Network Science
• +۳ مورد دیگر

Ulrik Brandes serves as Full Professor and Head of the Department of Humanities, Social and Political Sciences at ETH Zurich, holding the Professorship for Social Networks. He actively teaches courses including Network Analysis and Applied Network Science: Sports Networks for Fall semester 2025, with office location at WEP J 14, Weinbergstr. 109, Zurich. His research spans Social Network Analysis, Graph Theory, and Network Science, with significant applications in sociology, sports analytics (particularly soccer and Australian Football League), and archaeological networks. As a longstanding member of the International Network for Social Network Analysis (since 2001) and the Academy of Sociology (since 2017), he bridges theoretical graph algorithms with practical interdisciplinary applications, recently expanding into sports analytics through the Football Scouting Association (2023). Analysis of his recent publications reveals strong thematic continuity in network centrality, temporal dynamics, and robustness, with increasing application diversity across sports analytics, archaeological trade networks, and decentralized social media platforms. His work consistently emphasizes efficient computational methods for real-world network problems. Honors: Simmel Award (2024) Prof. Brandes maintains active research leadership through departmental oversight and course development, though specific grant details and student advisement records are not publicly documented in available sources. His departmental role indicates substantial administrative responsibilities alongside research and teaching commitments.

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

دانشیار

• Theoretical Computer Science
• Algorithms
• Sum-of-Squares Method
• +۵ مورد دیگر

David Steurer is an Associate Professor in the Department of Computer Science at ETH Zurich, where he leads the Institute for Theoretical Computer Science. His research bridges theoretical computer science, mathematics, and practical applications in machine learning and statistics. Steurer has made significant contributions to the understanding of sum-of-squares methods, semidefinite programming, and high-dimensional estimation problems. Steurer earned his B.Sc. & M.Sc. in Computer Science from Saarland University in 2006, followed by a Ph.D. in Computer Science from Princeton University in 2010 under the supervision of Sanjeev Arora. His doctoral dissertation, "On the Complexity of Unique Games and Graph Expansion," received an Honorable Mention for the ACM Doctoral Dissertation Award in 2011. Steurer's research focuses on algorithm design through mathematical programming relaxations, particularly semidefinite programming and the sum-of-squares method. His work addresses computational complexity of high-dimensional estimation problems including tensor decomposition, clustering, Gaussian mixture models, and stochastic block models. He also investigates algorithmic aspects of robustness and differential privacy, especially for estimation tasks. His theoretical contributions have practical implications for machine learning and data analysis in the presence of noise and adversarial conditions. Analysis of Steurer's recent publications reveals a consistent trajectory in advancing the sum-of-squares framework for high-dimensional estimation and robust statistics. His work demonstrates how sophisticated mathematical programming techniques can provide certifiable guarantees for challenging problems in machine learning. The research spans theoretical foundations while maintaining relevance to practical applications, particularly in scenarios involving corrupted or noisy data. A notable trend is the extension of sum-of-squares methods to handle increasingly complex statistical models while providing rigorous performance guarantees. ERC Consolidator Grant (2019) Michael and Sheila Held prize (2018, with Raghavendra) Invited speaker at International Congress of Mathematicians (2018) STOC Best Paper Award (2015) Alfred P. Sloan Research Fellowship (2014) NSF CAREER Award (2014) Microsoft Research Faculty Fellowship (2014) FOCS Best Paper Award (2010) Steurer has advised numerous PhD students and postdocs who have gone on to prominent positions, including Sam Hopkins (now faculty at MIT), Jonathan Shi, and Aaron Potechin. His research is supported by multiple prestigious grants, including an ERC Consolidator Grant, an NSF CAREER Award, and a Microsoft Research Faculty Fellowship. He has served on numerous program committees for top theoretical computer science conferences and has been recognized for his service to the community through roles such as internal member of the Scientific Advisory Committee of the Institute for Theoretical Studies at ETH Zurich. As head of the Institute for Theoretical Computer Science at ETH Zurich, Steurer leads a research group focused on advancing the theoretical foundations of computer science with particular emphasis on mathematical optimization methods. His team explores the boundaries of what can be efficiently computed in high-dimensional settings, with applications spanning machine learning, statistics, and data science. The group maintains strong connections with both theoretical and applied researchers across ETH and the broader academic community.

Florent Krzakalaمشاهده پروفایل

استاد

• Statistical Physics
• Machine Learning
• Probability and Statistics
• +۶ مورد دیگر

Florent Krzakala is a Full Professor at École polytechnique fédérale de Lausanne (EPFL) in Switzerland, holding positions across multiple departments including the School of Basic Sciences (SB), School of Engineering (STI), and specifically within the Department of Physics (IPHYS) and Department of Electrical Engineering (IEM). He leads the Information, Learning and Physics Laboratory (IdePHICS) and maintains an office at ELD 239, Station 11, 1015 Lausanne. His research bridges statistical physics and computational disciplines, with significant contributions to understanding the theoretical foundations of machine learning and optimization problems. Dr. Krzakala received his MSc in Physics from Orsay, France in 1999, followed by a PhD in Statistical Physics from Orsay, Paris XI, France in 2002, and completed a postdoctoral position at Roma La Sapienza in 2004. This strong foundation in physics has informed his interdisciplinary approach to computational problems. His research interests span Statistical Physics, Machine Learning, Probability and Statistics, Computer Science, Information Theory, Inference on Graphs, Random Constraint Optimization, and Computational Optics. Krzakala's work focuses on applying methods from statistical physics to problems in theoretical computer science, probability, and machine learning. He investigates how concepts from disordered systems and phase transitions can illuminate computational barriers in optimization and inference tasks. His research has particular relevance for understanding the behavior of neural networks, compressed sensing, and high-dimensional statistical models. Analysis of his recent publications reveals a strong trend toward understanding the fundamental limits of learning in high-dimensional settings, with particular emphasis on phase transitions, statistical-to-computational gaps, and the theoretical properties of deep learning architectures. His work frequently bridges rigorous mathematical analysis with practical machine learning applications, demonstrating how insights from statistical physics can inform algorithm design and theoretical understanding in AI. Krzakala actively mentors the next generation of researchers, supervising numerous PhD students whose work continues to advance these interdisciplinary fields. His laboratory serves as a hub for researchers exploring the intersection of physics and computation, fostering collaborations across traditional disciplinary boundaries. He teaches advanced courses including Fundamentals of Inference and Learning, Statistical Physics, and Statistical Physics for Optimization & Learning, which examine the connections between physical principles and computational methods. His educational materials, including lecture notes on statistical physics methods in optimization and machine learning, have become valuable resources for students and researchers worldwide. As founder and scientific advisor of the startup Lighton, Krzakala has also demonstrated a commitment to translating theoretical insights into practical applications, particularly in the realm of optical computing for machine learning tasks.

Benny Sudakovمشاهده پروفایل

استاد

• Extremal Graph and Hypergraph Theory
• Ramsey Theory
• Random Structures
• +۵ مورد دیگر

Benny Sudakov is a Professor of Mathematics at ETH Zurich, where he conducts research in combinatorics. He has previously held positions at UCLA, Princeton University, and the Institute for Advanced Study. His work is supported by the SNSF grant 200021_196965. Research Interests: His primary research areas include Extremal Graph and Hypergraph Theory, Ramsey Theory, Random Structures, and the application of Algebraic and Probabilistic Methods in Combinatorics, with strong connections to Theoretical Computer Science. He investigates fundamental structural properties of discrete systems, such as the existence of regular subgraphs, extremal configurations, and the behavior of random combinatorial objects. The recent popular science articles on his work highlight a consistent trend of solving long-standing open problems in extremal combinatorics using sophisticated probabilistic and algebraic techniques. His research spans topics like equiangular lines, graph decompositions, and the emergence of cycles in sparse graphs, demonstrating a deep focus on the interplay between structure and randomness. Scientific Awards: No specific awards are mentioned in the provided text. Advising and Grants: He has advised numerous Ph.D. students, many of whom have gone on to become professors at top universities (e.g., Oxford, Stanford, CMU, ETH, Princeton). His research is currently funded by the Swiss National Science Foundation (SNSF). He has organized workshops and seminars, such as the Theory of Combinatorial Algorithms Mittagsseminar at ETH and a workshop at UCLA on Extremal and Probabilistic Combinatorics. Labs and Teams: He is a key member of the combinatorics group at ETH Zurich and co-organizes the Theory of Combinatorial Algorithms Mittagsseminar, a central forum for research discussions in discrete mathematics at the institution.

• Causal Machine Learning
• Shrinkage Methods
• Regularization Methods
• +۳ مورد دیگر

Jana Mareckova is an Assistant Professor of Econometrics at the Swiss Institute for Empirical Economic Research (SIEW), part of the School of Economics and Political Science (SEPS) at the University of St. Gallen. She joined the university in 2020 after completing a postdoc at SEW-HSG following her PhD from the University of Konstanz (2019). Her research focuses on causal machine learning, shrinkage methods, regularization techniques, and labor economics. She explores applications in labor market outcomes and fairness, leveraging econometric tools to address real-world economic questions. Education: PhD in Econometrics, University of Konstanz (2019); Postdoc at SEW-HSG (pre-2020). Research interests include shrinkage estimation for categorical regressors, causal inference via machine learning, and predicting economic outcomes using noncognitive skills. Her work bridges statistical theory with practical policy analysis, as seen in her 2021 Journal of Econometrics publication on shrinkage methods. Recent projects emphasize causal forests and comprehensive frameworks for policy evaluation. No scientific awards are listed, though her contributions to causal ML and econometric methods are notable. She has no documented advising or grant information. Her research is affiliated with SIEW, focusing on empirical economic research.

Mika Göösمشاهده پروفایل

استادیار

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

Mika Göös is a Tenure Track Assistant Professor at EPFL in the School of Computer and Communication Sciences, Department of Computer Science. Previously, he held postdoctoral positions at Stanford, Princeton IAS, and Harvard. He earned his PhD from the University of Toronto under Toniann Pitassi, an MSc from the University of Oxford, and a BSc from Aalto University. Education PhD: University of Toronto MSc: University of Oxford BSc: Aalto University His research focuses on computational and communication complexity, exploring fundamental limits of algorithms and their applications in cryptography, circuit design, and distributed computing. He co-developed lifting theorems connecting query complexity to communication complexity and investigates lower bounds in randomized algorithms, TFNP problems, and monotone circuits. Recent work emphasizes quantum communication advantages, direct sum theorems, and hardness condensation. His 15 most recent publications span topics like k-Hamming distance, parity decision trees, depth-3 circuits, and separations in TFNP classes. Scientific awards include the Machtey Award (2015), Best Paper at DISC (2012), EATCS Distinguished Dissertation Award (2017), and Best Paper at FOCS (2020). He has advised numerous PhD and MSc students, including Weiqiang Yuan, Ziyi Guan, and Alexandros Hollender. Currently, he leads a team comprising PhD students (Guan, Imbach, Riazanov, Sofronova, Yuan), postdocs (Nathaniel Harms), and scientists (Dmitry Sokolov). His work has appeared in top venues like STOC, FOCS, CCC, and ITCS, often with recorded talks and published in journals such as JACM and SICOMP.

Laurent Condatمشاهده پروفایل

پژوهشگر

• Optimization
• Convex Relaxation
• Stochastic Algorithms
• +۵ مورد دیگر

Laurent Condat is a Senior Research Scientist at King Abdullah University of Science and Technology (KAUST) in Saudi Arabia, where he conducts research in optimization algorithms and their applications. He is affiliated with the College of Engineering, Department of Computer Science, and has previously held research positions at CNRS in France, working at GREYC in Caen and GIPSA-Lab in Grenoble. Dr. Condat received his PhD in 2006 from Grenoble Institute of Technology, followed by a 2-year postdoc in Munich, Germany. He was recruited as a permanent researcher by CNRS in 2008 and has been on leave from CNRS since November 2019 to work at KAUST. In February 2025, he was promoted to 'chargé de recherche hors classe' (senior research scientist) by CNRS. His research focuses on deterministic and stochastic optimization algorithms, convex relaxations, and applications to machine learning, signal and image processing. His work spans theoretical foundations of optimization methods to practical implementations for distributed and federated learning systems. He has developed several influential algorithms including RandProx, TAMUNA, and LoCoDL that address communication efficiency in distributed optimization. His recent publications demonstrate strong trends in communication-efficient distributed optimization, with particular emphasis on federated learning, compression techniques, and local training methods. His work bridges theoretical optimization with practical machine learning applications, showing consistent innovation in algorithmic design for large-scale problems. Best reviewer award at AISTATS 2025 Meritorious Service Award from Mathematical Programming Stanford's list of world's top 2% most influential scientists Dr. Condat has co-supervised PhD students including Daniele Picone and Julien Baderot. He serves as an Associate Editor for IEEE Transactions on Signal Processing and has presented his work at numerous international conferences including plenary talks at major optimization workshops. His research is supported through KAUST funding and collaborative projects with researchers worldwide.

Lenka Zdeborováمشاهده پروفایل

دانشیار

• Statistical Physics
• Machine Learning
• Computational Biology
• +۳ مورد دیگر

Lenka Zdeborová is an Associate Professor at EPFL, jointly affiliated with the School of Basic Sciences and School of Computer and Communication Sciences. She leads the Laboratory of Statistical Physics of Computational Systems, where her research bridges statistical physics, machine learning, and computational biology. Education: PhD in Physics, Université Paris-Cité (2012) MSc in Fundamental Physics, École Normale Supérieure (2009) BSc in Physics, École Normale Supérieure de Lyon (2007) Her work focuses on phase transitions in learning algorithms, high-dimensional statistics, and neural network theory. Current projects investigate fundamental limits of machine learning, dynamics of graph neural networks, and applications to biological systems. Recent publications explore attention mechanisms in transformers, neural network depth advantages, and Bayes-optimal learning. Methodological innovations include cavity methods for hypergraphs and analysis of high-dimensional inference problems. Supervises doctoral students researching statistical physics approaches to machine learning and optimization. Teaches graduate courses in data science and machine learning for physicists.

Manos Athanassoulisمشاهده پروفایل

دانشیار

• Data Systems
• Cloud Data Management
• Database Systems
• +۷ مورد دیگر

Manos Athanassoulis is an Associate Professor in the Department of Computer Science at the College of Arts and Sciences, Boston University. He is the Founder and Director of the BU Data-intensive Systems and Computing (DiSC) lab and a member of the BU MiDAS group. His research focuses on data systems, particularly cloud data management, hybrid transactional/analytical workloads, and integration with emerging hardware such as non-volatile memory and heterogeneous computing. His educational background includes a PhD from EPFL (2014), an MSc in Computer Systems Technology, and a BSc in Informatics and Telecommunications from the University of Athens, Greece. Prior to BU, he was a Postdoctoral Researcher and Research Associate at Harvard University, supported by a SNSF Postdoc Mobility Fellowship. His research interests span data systems, database architectures, LSM trees, indexing, storage systems, and performance optimization. He explores how novel hardware can be leveraged to improve data management efficiency and scalability, especially in cloud environments. His recent publications (2021–2025) predominantly focus on LSM trees, covering topics such as compaction policies, Bloom filter tuning, DPU offloading, adversarial resilience, and sustainable caching. Earlier works include foundational contributions on access methods (RUM Conjecture) and optimal key-value stores (Monkey). The trend shows a consistent focus on data system efficiency, adaptability, and robustness under varying workloads and hardware constraints. Scientific Awards: NSF CAREER Award (2022) Facebook Faculty Research Award (2020) NSF CRII Award (2019) Best of VLDB 2017 and Best of SIGMOD 2017 SIGMOD Most Reproducible Paper Award (2017) Multiple ACM SIGMOD Distinguished PC Member recognitions (2018–2025) VLDB 2023 Best Demo Award RedHat Collaboratory Research Incubation Awards (multiple, 2021–2023) SNSF Postdoc Mobility Fellowship (2015–16) IBM PhD Fellowship (2011–12) Dr. Athanassoulis has advised numerous students and collaborators, evident from his co-authorship on works with researchers such as Niv Dayan, Stratos Idreos, and A. Ailamaki. His grants include major awards from NSF, Facebook, and RedHat, supporting research in robust data systems, hardware-software co-design, and learned cost models. He has also been recognized for teaching excellence at Harvard University. He leads the DiSC lab at Boston University, which focuses on data-intensive computing and systems research. The lab explores next-generation data architectures, particularly in cloud and hardware-aware environments. Collaborations with the BU MiDAS group enhance interdisciplinary research in data science and AI.

Fabio Nobileمشاهده پروفایل

استاد

• Scientific Computing
• Uncertainty Quantification
• Numerical Analysis
• +۵ مورد دیگر

Fabio Nobile is a Full Professor at the École Polytechnique Fédérale de Lausanne (EPFL) in the School of Basic Sciences (SB), Department of Mathematics (MATH), holding the CADMOS Chair in Scientific Computing and Uncertainty Quantification. He leads the CSQI (Chair of Scientific Computing and Uncertainty Quantification) group. His work focuses on numerical methods for partial differential equations (PDEs), uncertainty quantification, stochastic modeling, and computational fluid dynamics. He is involved in collaborative projects involving fluid-structure interaction, cardiac electro-mechanics, and energy systems. Professor Nobile has extensive teaching experience, including courses on advanced analysis, stochastic simulation, and numerical integration of stochastic differential equations. He supervises numerous PhD students and has contributed to over 200 peer-reviewed publications, covering topics such as low-rank approximation methods, multilevel Monte Carlo techniques, and optimal control under uncertainty. His research emphasizes interdisciplinary applications, including biomedical engineering (e.g., personalized cardiac simulations) and renewable energy (e.g., probabilistic load forecasting). He collaborates with industries and academic institutions globally, advancing computational methodologies for engineering and scientific challenges.

• Machine Learning
• Augmented Intelligence
• Data Science
• +۱۲ مورد دیگر

Simon Ruffieux is a Senior Researcher and Lecturer at the Department of Computer Science, University of Fribourg, and a member of the Human-IST Institute. He currently leads the HIP-Initiative (Human-IST x SwissPost Initiative) and coordinates academic projects related to Swiss Post. His academic roles include Lecturer and Senior Assistant , reflecting his active engagement in teaching and research. His research focuses on leveraging advanced technologies to support individuals, particularly those with special needs. Key areas include: Machine Learning and Data Science for urban systems (e.g., bike-sharing optimization) Human-Computer Interaction (HCI), especially gesture recognition and multimodal interfaces Augmented and Virtual Reality applications in rehabilitation and assistance Development of smart glasses for visually impaired users Physiological signal analysis for workload classification The 15 most recent publications reveal a strong trend in applying AI and data science to real-world challenges, particularly in assistive technologies and urban mobility. His work often involves interdisciplinary collaboration, integrating computer science with psychology, rehabilitation, and industrial applications. There is a consistent emphasis on user-centered design and real-world usability. Simon Ruffieux has not been mentioned as receiving specific scientific awards in the provided text. He has advised or collaborated with several researchers, including Nicolas Spycher, Samuel Torche, and Nicolas Ruffieux, on projects related to forecasting, AR, and gesture recognition. While no formal grant details are listed, his leadership of the HIP-Initiative suggests involvement in externally funded academic projects. His work is closely tied to the Human-IST Institute, where he contributes to interdisciplinary research in human-centered computing. He is actively involved in research teams focused on assistive technologies, gesture interaction, and data-driven urban solutions. The Human-IST Institute serves as the primary hub for his collaborative efforts, particularly through the HIP-Initiative with Swiss Post.

Daniel Kressnerمشاهده پروفایل

استاد

• Numerical Linear Algebra
• High-Performance Computing
• Matrix Equations
• +۴ مورد دیگر

Prof. Daniel Kressner is a Professor at the École Polytechnique Fédérale de Lausanne (EPFL), holding positions in the School of Basic Sciences (SB), Mathematics Institute (MATH), and the Numerical Algorithms and High-Performance Computing (ANCHP) group. He also leads the SMA-ENS unit within the SB-SMA division. His research focuses on numerical linear algebra, high-performance computing, and tensor approximation methods, with applications in scientific computing and data science. Education details are not explicitly listed, but his career at EPFL includes leadership in key research groups and doctoral programs. He supervises multiple doctoral students, including Alice Cortinovis, Peter Effenberger, and others. Research interests emphasize low-rank methods, matrix equations, and efficient algorithms for large-scale problems. Recent work includes advancements in randomized algorithms, tensor networks, and preconditioning techniques for eigenvalue problems. His publications span high-impact journals like Siam Journal on Matrix Analysis and Applications and Numerical Linear Algebra with Applications, addressing topics such as compressed sensing, multigrid methods, and distributed signal processing. Prof. Kressner advises doctoral candidates and contributes to the Program doctoral Mathématiques (EDMA-GE) committee. His lab, ANCHP, develops software tools for hierarchical matrices and tensor computations, such as the hm-toolbox for HODLR and HSS matrices.

• Chemical Engineering
• Materials Science
• Nanotechnology
• +۳ مورد دیگر

Prof. Robert Grass is a Lecturer at the Department of Chemistry and Applied Biosciences at ETH Zurich, affiliated with the Institute for Chemical and Bioengineering Sciences. His research focuses on innovative applications of nanotechnology, DNA-based storage systems, and sustainable catalytic processes for CO2 valorization. Grass has pioneered silica-encapsulated DNA technologies for traceability in healthcare, environmental monitoring, and anti-counterfeiting measures. His work bridges chemical engineering with information technology, addressing challenges in long-term data preservation and molecular-level security. Current projects include developing compostable DNA storage materials and designing catalysts for methanol synthesis from CO2, contributing to both environmental sustainability and energy systems. Grass's interdisciplinary approach integrates nanomaterials design, enzymatic processes, and machine learning to advance next-generation storage and sensing technologies. Research Interests: Development of DNA-based storage systems with error-correction mechanisms Nanoparticle engineering for medical and environmental applications Catalytic materials for CO2 conversion and green chemistry Bio-inspired security systems using molecular randomness Sustainable materials for long-term data preservation His recent work highlights advancements in silica-encapsulated DNA tracers for tracking pathogen transmission dynamics, as well as low-nuclearity catalysts enabling efficient methanol synthesis from CO2. Grass actively explores the intersection of nanotechnology and digital information, including cryptographic applications leveraging DNA's inherent complexity.