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

Prof. Dr. Thomas Hofmann is a Full Professor and Head of the Department of Computer Science at ETH Zurich since 2014. He also leads the Institute for Machine Learning. His research focuses on machine learning, deep learning, natural language understanding, and text understanding. Hofmann holds a Ph.D. from the University of Bonn (1997) and has held academic positions at Brown University (1999–2004) and TU Darmstadt. He transitioned to industry as Director of Engineering at Google (2006–2014), leading the Zurich R&D center, before returning to academia. He co-founded Recommind (2000) and 1plusX (Swiss marketing tech company), currently serving as Chief Scientist and board member at 1plusX. Education: Ph.D. in Computer Science, University of Bonn (1997) Postdoctoral Work: MIT (CBCL/AI Lab), UC Berkeley (EECS/ICSI) His research explores advanced machine learning techniques, including diffusion models, generative adversarial networks, and optimization dynamics. Hofmann’s entrepreneurial ventures reflect his focus on applying AI to real-world challenges, such as e-discovery and marketing technology. His work spans theoretical contributions (e.g., neural network training dynamics, continual learning) and applied innovations (e.g., image editing, portrait generation). Hofmann actively bridges academia and industry, influencing both research and commercial AI applications.

• Machine Learning
• Deep Learning
• Natural Language Understanding
• +۳ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

• Programming Languages
• Networking
• Databases
• +۵ مورد دیگر

Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.

• Automated Reasoning
• Formal Methods
• Artificial Intelligence
• +۶ مورد دیگر

Raissa M. D'Souza is a Professor and Associate Dean of Research in the College of Engineering at the University of California, Davis. She holds joint appointments in the Department of Computer Science, Department of Mechanical and Aerospace Engineering, Graduate Group in Applied Mathematics, and Graduate Group in Physics. Her research focuses on complex networks, percolation theory, cascades, and interdependent systems, with applications to social, biological, and technological networks. She leads the Networks and Control research group and is a Founding Lead Editor of Physical Review Research . Her work spans interdisciplinary collaborations, including with the Santa Fe Institute and the Complexity Sciences Hub Vienna. Key awards include Fellowships from AAAS (2024), APS (2016), and the Network Science Society (2019), as well as the Euler Award for her contributions to network science. Dr. D'Souza has advised over 10 PhD students and has secured grants from agencies including the NSF. Her lab explores topics like explosive percolation, synchronization in oscillator networks, and network controllability. Notable recent work includes studies on exotic synchronization patterns and strategies for mitigating cascading failures in interdependent systems.

• Complex Networks
• Percolation Theory
• Cascades
• +۳ مورد دیگر

André DeHon is the Oliver C. Boileau Jr. and Nan Eleze Boileau Professor of Electrical Engineering at the University of Pennsylvania, with affiliations in the Electrical and Systems Engineering (ESE) and Computer and Information Science (CIS) departments. He founded the Penn Computer Engineering (CMPE) program and directs the DARPA-sponsored CyberSavvy Security Center. His research spans reconfigurable computing, FPGA architecture, interconnect design, hardware security, and energy efficiency, with a focus on adapting to fabrication imperfections and runtime variability. His work explores programmable substrates (e.g., CMOS VLSI, molecular electronics) and algorithmic mappings to create resilient, efficient systems. Current projects include runtime feedback mechanisms (REFINE), partial reconfiguration (ExHiPR), and security frameworks like SCALPEL and μSCOPE. Recent publications highlight advancements in FPGA compilation (PLD, HiPR), security (SCALPEL, μSCOPE), and interconnect optimization (Asymmetry in NoC). These studies intersect computer architecture, security, and embedded systems. Scientific awards and recognitions: 2023 IEEE Fellow 2020 IEEE Mary Kenneth Keller Teaching Award 2018 ACM Fellow TCFPGA Hall of Fame (2019) Best Paper at ICFPT 2015 Academic leadership: He chairs the ACM/SIGDA Technical Committee on FPGAs and Reconfigurable Computing, previously held faculty roles at Caltech (1999–2006), and was a postdoc at UC Berkeley (1996–1999). Education includes MIT SB (1990), SM (1993), and PhD (1996) in Electrical Engineering and Computer Science.

• Reconfigurable Computing
• FPGA Architecture
• Interconnect Design
• +۶ مورد دیگر

Suguman Bansal is an Assistant Professor in the School of Computer Science at Georgia Institute of Technology. Her research focuses on formal methods and their applications to artificial intelligence, programming languages, and machine learning. Previously, she held an NSF/CRA Computing Innovation Postdoctoral Fellowship at the University of Pennsylvania (2020-2022) and completed her PhD at Rice University (2016-2020). Education: PhD in Computer Science, Rice University (2016-2020) MS in Computer Science, Rice University (2014-2016) BSc (Honors) in Mathematics and Computer Science, Chennai Mathematical Institute (2011-2014) Research Interests: Formal methods, reinforcement learning, reactive synthesis, quantitative verification, and trustworthy AI systems. Her work bridges logic-based formal methods with modern AI challenges, emphasizing safety, reliability, and generalization in AI systems. Key Contributions: Pioneering work on specification-guided reinforcement learning, compositional synthesis algorithms, and formal verification of AI systems. Notable tools include Lisa (LTLf synthesis tool) and DiRL (compositional reinforcement learning framework). Awards: 2020 NSF CI Fellowship, 2021 MIT EECS Rising Star, 2023 ATVA Best Paper Award, and Keynote Speaker at SAS 2022. Advising & Grants: Advises PhD and Master’s students in reinforcement learning and formal methods. Lead PI on a collaboration grant with IIT Bombay (2024) and recipient of a ~$250K NSF/CRA postdoctoral grant. Labs/Teams: Leads the BansalLab at Georgia Tech, focusing on trustworthy AI through formal methods and algorithmic innovation.

• Formal Methods
• Artificial Intelligence
• Programming Languages
• +۴ مورد دیگر

Kyle Bellucci Johanson serves as a Visiting Critic in Cornell University's College of Architecture, Art, and Planning, Department of Art. Holding an MFA from California Institute of the Arts and a BA in Art and Reconciliation Studies from Bethel University, he merges artistic practice with critical theory through performance architecture and collaborative media. Whitney Independent Study Program (2022–23) Founding fellow at land's edge free school (Los Angeles) Teaching experience at SAIC, UIC, CUNY, and Cooper Union His research investigates: Power structures through spatial interventions Critical theory applications in art practice Post-capitalist imaginaries Hauntology and historical materialism Transdisciplinary approaches to social critique Project trends reveal: Reinterpretation of Soviet design principles Investigation of worker identity in post-industrial contexts Temporal and spatial dislocation in artistic practice Monument critique through performative methods Quantum theory-inspired architectural concepts Reimagining of common spaces as political sites Scientific awards include: Creative Research Grant (2025) Whitney ISP participation (2022–23) Automata Studio Residency (2022) Artists Run Chicago Grant (2021) BOLT Residency (2020–21) Through projects like KLUB WRKR —a nomadic workers' club reimagined for the gig economy—and table (2018–2022), a Chicago-based experimental space for artistic practice, he interrogates institutional frameworks while fostering community through discursive meals and collaborative exhibitions.

• Collaborative practice
• Digital media
• Drawing
• +۱۴ مورد دیگر

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +۵ مورد دیگر

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

• Programming Languages
• Type Theory
• Dependent Types
• +۱۲ مورد دیگر

Meng Cheng is an Assistant Professor of Physics at Yale University, specializing in condensed matter theory. He holds a B.S. from Nanjing University (2008) and a Ph.D. in Condensed Matter Theory from the University of Maryland (2013). After a postdoctoral position at Microsoft Research Station Q (2013–2016), he joined Yale in 2017. His research focuses on quantum criticality, fractonic phases, and symmetric topological phases, with a particular emphasis on classification and characterization of exotic quantum matter. He has received prestigious awards including the NSF CAREER Award (2019) and the Alfred P. Sloan Fellowship (2019). Key research interests include topological superconductivity, global symmetry interactions, and applications in quantum information. His work bridges theoretical frameworks with experimental implications, exploring topics like Wilson loop operators, disorder operators, and entanglement entropy in gapless systems. He has contributed to advancements in understanding symmetry-enriched topological phases and their surface topological order. Publications span high-impact journals and cover topics such as fractionalization in electronic insulators, quantum Hall effects, and topological stabilizer models. His talks highlight interdisciplinary approaches, including seminars at the Perimeter Institute and Université de Montréal on fractonic topological phases and infinite-component Chern-Simons theories. Awards and grants underscore his contributions to advancing theoretical physics, with a focus on fostering innovation in quantum materials and computational methods. Teaching and mentorship activities further his commitment to education within the Yale Physics Department.

• Condensed Matter Physics
• Quantum Criticality
• Fractonic Phases
• +۳ مورد دیگر

Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.

• Formal Methods
• Cyber-Physical Systems
• Computer Security
• +۱۰ مورد دیگر

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

• Formal Methods
• Formal Verification
• Automated Synthesis
• +۷ مورد دیگر

Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.

• Quantum Complexity Theory
• Quantum Computing
• Computational Complexity
• +۳ مورد دیگر

Hannah Hoganson is an NSF Postdoctoral Fellow in the Department of Mathematics at the University of Maryland, mentored by Christian Rosendal after previously holding a Brin Postdoctoral Fellowship under Lei Chen. Her research bridges geometric group theory, low-dimensional topology, and descriptive set theory, with a focus on mapping class groups of infinite-type surfaces and topological groups. Her educational background includes a PhD from the University of Utah (2022) advised by Ken Bromberg, and prior graduate studies at Miami University where she investigated Thompson's groups. She has taught multiple calculus courses at UMD and the University of Utah, receiving exceptional student evaluations for her clarity and supportive teaching style. Hoganson's research explores the coarse geometry of mapping class groups, connections between topological groups and descriptive set theory, and geometric structures on infinite-type surfaces. Her work often combines algebraic, geometric, and topological methods to address fundamental questions about group actions and classification problems in low-dimensional topology. Her recent publications demonstrate a strong trend toward interdisciplinary approaches, integrating geometric group theory with descriptive set theory to analyze infinite-type mapping class groups and Polish groups. Key themes include geometric finiteness, coarse boundedness, and the interplay between algebraic structures and topological dynamics in infinite settings. NSF Postdoctoral Fellowship (DMS-2303365) Brin Postdoctoral Fellowship Hoganson has advised an undergraduate reading course in geometric group theory (Spring 2024) and served as a mentor for REU students at SUMSRI. Her current research is supported by NSF grant DMS-2303365, which funds her postdoctoral work on geometric and topological aspects of infinite-type surfaces and groups. She actively collaborates with researchers including George Domat, Sanghoon Kwak, and Robbie Lyman across multiple projects. She co-organizes the University of Maryland Geometry and Topology Seminar and has co-led specialized workshops including the Big Mapping Class Groups log cabin workshop in Young, AZ (2024) and the AWM special session on Women in Groups, Geometry and Dynamics (2023), fostering collaborative research environments in geometric topology.

• Geometric Group Theory
• Low Dimensional Topology
• Mapping Class Groups
• +۴ مورد دیگر

Dr. Rasmus Ibsen-Jensen is a Lecturer in Computer Science at the University of Liverpool. Previously, he held a Postdoctoral position at IST Austria under Krishnendu Chatterjee and completed his PhD under Peter Bro Miltersen. Research Focus: Algorithmic game theory, strategy complexity in two-player zero-sum games, control flow graph algorithms, edit distance for automata, and theoretical biology applications. Teaching: Module Coordinator for second-year courses in database development (COMP207), C++ programming (COMP282), and industrial placement (COMP299). His work bridges computational game theory and formal verification, with recent publications exploring memory constraints in partial-information games, algebraic path properties in concurrent systems, and evolutionary spatial dynamics. While no scientific awards are explicitly mentioned in the provided text, his contributions to algorithmic complexity and interdisciplinary research (e.g., theoretical biology) highlight his academic impact.

• Algorithmic Game Theory
• Concurrent Systems
• Formal Verification
• +۳ مورد دیگر