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

Ian Miersمشاهده پروفایل

استادیار

• Computer Security
• Applied Cryptography
• Blockchain
• +۴ مورد دیگر

Ian Miers serves as an Assistant Professor in the Department of Computer Science at the University of Maryland, holding a joint appointment with the University of Maryland Institute for Advanced Computer Studies (UMIACS) and serving as a core faculty member of the Maryland Cybersecurity Center (MC2). His academic home resides within the Department of Computer Science, though the overarching college/school structure is not explicitly stated in available materials. His research program centers on applied cryptography with a context-driven methodology: starting from real-world security challenges to develop deployable cryptographic protocols. Key focus areas include blockchain privacy (notably Zerocoin/Zerocash), zero-knowledge proofs, anonymous credentials, and secure messaging systems. Miers emphasizes practical implementations that address subtle security requirements in production environments, bridging theoretical cryptography with tangible system security. Analysis of his 15 most recent publications reveals dominant trends in zero-knowledge proof scalability (zkSNARKs), privacy-preserving infrastructure for blockchains, and cryptographic solutions for content moderation in encrypted messaging. His work consistently targets deployable systems, with increasing focus on balancing privacy guarantees with accountability requirements in real-world applications. Miers actively recruits PhD students for hands-on research in his small lab, emphasizing direct collaboration on applied security and blockchain problems. As a founding scientist of Aleo, Bolt Labs, and Zcash, he translates academic research into commercial products, with his work receiving coverage from major media outlets including The Washington Post, The New York Times, and Wired.

Assia Mahboubiمشاهده پروفایل

پژوهشگر

• Type Theory
• Formal Verification
• Computer-Aided Mathematics
• +۳ مورد دیگر

Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.

Sean Welleckمشاهده پروفایل

استادیار

• Machine Learning for Mathematics
• Machine Learning for Code
• AI Reasoning and Agents
• +۶ مورد دیگر

Sean Welleck is an Assistant Professor at Carnegie Mellon University's School of Computer Science, Language Technologies Institute, leading the L3 Lab. His research focuses on bridging informal and formal reasoning with AI, spanning machine learning for mathematics and code, inference algorithms, and AI agents. PhD in Computer Science from New York University (advised by Kyunghyun Cho) Postdoctoral work at University of Washington (advised by Yejin Choi) His work explores AI-driven formal methods for mathematics and code generation, test-time compute scaling, and algorithms enabling AI improvement over time. Recent publications analyze reasoning evaluation, premise selection, and automated proof optimization in systems like Lean. Key article trends include neural theorem proving, code generation, and inference-time compute optimization. Awards: NVIDIA AI Labs Pioneering Research Awards (2017, 2018), NAACL 2025 Best Paper. Current advisees include PhD students Pranjal Aggarwal, Weihua Du (co-advised with Yiming Yang), Andre He (co-advised with Daniel Fried), and Seungone Kim (co-advised with Graham Neubig). He co-organizes workshops like Autoformalization for the Working Mathematician (ICERM 2025) and VerifAI: AI Verification in the Wild (ICLR 2025), and teaches Advanced NLP at CMU.

Josef Urbanمشاهده پروفایل

پژوهشگر

• Automated Reasoning
• Machine Learning
• Theorem Proving
• +۵ مورد دیگر

Josef Urban is a leading researcher at the Czech Institute of Informatics, Robotics and Cybernetics (CIIRC) , Czech Technical University in Prague, heading the ERC Consolidator project AI4REASON . Previously, he held positions as a postdoc at Radboud University Nijmegen and assistant professor at Charles University in Prague, where he co-founded the Prague Automated Reasoning Group. Education Ph.D. in Computer Science (2004), Charles University, Prague M.S. in Mathematics (1998), Charles University, Prague B.S. in Economics (1995), Charles University, Prague Research Interests Urban specializes in automated reasoning over large formalized knowledge bases, combining deductive theorem proving and inductive machine learning . His work aims to realize "strong AI" through formalized mathematics, particularly using systems like Mizar and the AI/TP Challenges . He advocates for computer-verifiable mathematics as a foundation for AI progress. Article Trends Urban's publications focus on integrating machine learning with automated theorem proving in systems like ENIGMA and BliStr . Key trends include semantic guidance for ATPs, premise selection in formal libraries, and automated proof compression via concept invention. Scientific Contributions Head of ERC Consolidator project AI4REASON Marie-Curie Fellow at University of Miami Co-founder of Prague Automated Reasoning Group Editor for Formalized Mathematics Advising and Grants Urban has advised numerous PhD and MSc students including Daniel Kuehlwein, Krystof Hoder, and Yutaka Nagashima. He has secured grants like the ERC Consolidator Grant and Marie-Curie Fellowship . Labs and Collaborations Urban leads the AI4REASON team at CIIRC and collaborates with the Foundations Group at Radboud University. He contributes to projects like Mizar TWiki and XML-based API for Mizar , aiming to create a semantic AI ecosystem for formal knowledge.

• Mathematics Education Curriculum
• Mathematics Teacher Education
• Algebra Teaching and Learning
• +۳ مورد دیگر

Jill Newton is a Professor in the Department of Curriculum and Instruction at Purdue University’s College of Education. Her work focuses on mathematics education curriculum development, teacher training, and equity in education, with additional contributions to international and study abroad programs. Ph.D. in Curriculum, Teaching, and Educational Policy (Mathematics Education), Michigan State University (2008) M.A. in International Education, George Washington University (1995) B.S. in Mathematics and Secondary Teaching Certification, Michigan State University (1987) Newton’s research spans algebra teaching, curriculum coherence, and social justice in education. She has led national studies on mathematics teacher preparation and explored how teachers use curricular resources post-COVID. Her work also emphasizes international education, including virtual communities of practice for global social justice. Recent publications highlight her focus on algebraic reasoning, curricular alignment, and equity. She has co-authored studies on elementary teachers’ curriculum use, preservice teacher development, and virtual intercultural collaborations. Terry L. Wood Mathematics Teacher Educator Award (2024-25) Book of Great Teachers Inductee (2023) Outstanding Leadership in Globalization Award (2022-23) Charles B. Murphy Outstanding Undergraduate Teaching Award (2017) Newton has coordinated undergraduate research at Purdue since 2018 and has taught mathematics education courses since 2004. Her teaching experience spans secondary schools in Venezuela, Tanzania, Bulgaria, and Papua New Guinea, enriching her global perspective.

John MacLaren Walshمشاهده پروفایل

استاد

• Information Theory
• Network Coding
• Distributed Computing
• +۴ مورد دیگر

John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.

Jens Grothمشاهده پروفایل

دانشگاهی

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +۵ مورد دیگر

Jens Groth is an Honorary Professor at the Department of Computer Science, University College London (UCL), and serves as Chief Scientist at Nexus. His primary research focuses on cryptography, with an emphasis on cryptographic protocols, zero-knowledge proofs, and privacy-preserving technologies. Groth has contributed significantly to advancements in digital signatures, homomorphic encryption, and secure multi-party computation. He holds a leadership role as Program Chair for the 15th IMA International Conference on Cryptography and Coding (2015) and has been a key figure in shaping modern cryptographic standards. His work often bridges theoretical foundations with practical implementations, emphasizing efficiency and security. Groth's research interests include but are not limited to: cryptographic protocol design, lattice-based cryptography, and the application of zero-knowledge proofs in real-world systems such as blockchain and voting systems. His publications span venues like CRYPTO, EUROCRYPT, and ASIACRYPT, reflecting his impact on the field. Notably, he advocates for open access to research and has contributed to strategies ensuring conferences adopt de facto open-access policies. His current focus at Nexus centers on verifiable computation and distributed cryptographic systems.

Anand V Natarajanمشاهده پروفایل

استادیار

• Quantum Information Theory
• Quantum Complexity Theory
• Nonlocality and Bell Inequalities
• +۳ مورد دیگر

Anand V Natarajan is the ITT Career Development Professor in Computer Technology and Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT, with affiliation to the Computer Science and Artificial Intelligence Laboratory (CSAIL). He holds a PhD in Physics from MIT (2018), advised by Aram Harrow, and previously served as a postdoc at Caltech's Institute for Quantum Information and Matter. His research focuses on theoretical quantum information, emphasizing quantum complexity theory (e.g., MIP* and QMA(2) classes), nonlocality (Bell inequalities, nonlocal games), and semidefinite programming hierarchies. He teaches courses such as Quantum Cryptography, Quantum Systems Engineering, and Introduction to Algorithms at MIT. Notable contributions include resolving the MIP* = RE problem and the FOCS 2019 Best Paper Award for NEEXP ⊆ MIP*. He advises PhD students in quantum computing topics and collaborates extensively on quantum verification protocols and entanglement testing.

Stefania Dumbravaمشاهده پروفایل

دانشیار

• Formal methods for databases
• Graph databases
• Property graphs
• +۷ مورد دیگر

Stefania Dumbrava is an Associate Professor of Computer Science at ENSIIE (École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise) and a permanent member of the ACMES team in the SAMOVAR laboratory at Télécom SudParis, Institut Polytechnique de Paris. She is also actively involved in the Property Graph Schema Working Group and the European Research Network on Formal Proofs (EuroProofNet). Education PhD in Computer Science, Université Paris-Sud (2016) MSc in Computer Science, Jacobs University Bremen (2012) BSc in Mathematics, Jacobs University Bremen (2010) Research Interests Dumbrava's research lies at the intersection of formal methods and data management . She designs and verifies algorithms and systems for graph databases , with emphasis on property graphs , schema discovery , query optimization , and distributed graph processing . Recently, her work focuses on certifying large-scale distributed graph systems under the ANR JCJC VERDI project (2025–2029). Awards & Honors SIGMOD Best Paper Award 2023 – “PG-Schema: Schemas for Property Graphs” SIGMOD Research Highlight Award 2023 – “Threshold Queries” VLDB 2022 Best Regular Research Paper Runner-Up – “Threshold Queries in Theory and in the Wild” SIGMOD 2025 Distinguished Reviewer Award ICDE 2025 Best Program Committee Member Award EASST Best Software Science Paper Award, ICGT 2025 Students & Grants Dumbrava has supervised numerous research interns and is actively recruiting PhD students for her ANR VERDI project on verified foundations of large-scale distributed graph systems. She has also served on six PhD thesis committees as examiner since 2021. Labs & Teams She leads the ACMES research group within the SAMOVAR laboratory (Télécom SudParis, Institut Polytechnique de Paris), where her team develops formally verified graph-database engines and tools such as GRASP, VerDILog, and DatalogCert.

Henry Yuenمشاهده پروفایل

دانشیار

• Quantum Computing
• Complexity Theory
• Cryptography
• +۲ مورد دیگر

Henry Yuen is the Srivani Family Associate Professor of Computer Science at Columbia University, with affiliations in the CS Theory group, Data Science Institute, and Columbia Quantum Initiative. His work bridges theoretical computer science and quantum information, focusing on the computational foundations of quantum systems. Yuen received his BA in Mathematics from the University of Southern California (2010) and PhD in Computer Science from MIT (2016). His research explores quantum complexity theory, quantum cryptography, and quantum information through both theoretical frameworks and practical applications. His recent publications reveal a strong focus on quantum pseudorandomness, quantum circuit complexity, and quantum cryptographic primitives. The research trajectory demonstrates increasing sophistication in connecting quantum computational models with fundamental questions in complexity theory, particularly through the lens of quantum interactive proofs and quantum state complexity. His work frequently intersects with operator algebras and quantum information theory, reflecting the interdisciplinary nature of modern quantum computing research. NSF CAREER award Sloan Fellowship Yuen actively mentors graduate students, with several PhD students having graduated to postdoctoral positions or faculty roles. His service includes co-organizing the Columbia CS Theory Seminar and serving on program committees for major conferences including QIP, STOC, and ITCS. He has organized multiple workshops on quantum computing challenges and cryptography. As a member of the Columbia Quantum Initiative, Yuen contributes to Columbia's growing quantum ecosystem, collaborating across departments to advance both theoretical foundations and potential applications of quantum information processing.

• Cryptography
• Information Security
• Cryptographic Automation
• +۳ مورد دیگر

Christina L. Garman is an Assistant Professor in the Department of Computer Science at Purdue University, where she joined in Spring 2018. Her research focuses on practical cryptography and cryptographic automation to make secure system development accessible to non-experts through error-resistant design methodologies. Her educational background includes: Bachelor of Science in Computer Science and Engineering from Bucknell University (2011) Bachelor of Arts in Mathematics from Bucknell University (2011) Master of Science in Engineering in Computer Science from Johns Hopkins University (2013) Doctor of Philosophy in Computer Science from Johns Hopkins University (2017) Professor Garman's work centers on real-world cryptographic system security, spanning protocol analysis (e.g., RC4 in TLS, Apple iMessage flaws), decentralized anonymous systems (Zerocash/ZCash), and cryptographic automation. She pioneered techniques for removing human error in cryptographic deployments through automated tools and frameworks. Her research bridges theoretical cryptography with practical implementation challenges in privacy-preserving technologies and secure infrastructure. Analysis of her 2021-2025 publications reveals expanding research horizons: hardware security vulnerabilities (Rowhammer, SGX), privacy network enhancements (Tor onion services), software supply chain security (SBOM tools), and advanced cryptographic protocols (zkSNARKs, MPC). This evolution demonstrates consistent focus on real-world security impact while diversifying into hardware-software cross-layer threats and formal verification methods for cryptographic implementations. Her major scientific recognitions include: NSF CAREER Award (2021) for cryptographic automation research ACM CCS Best Paper Award (2016) for iMessage security analysis IEEE Test of Time Award (2024) for foundational Zerocash work Professor Garman co-founded ZCash, a privacy-focused cryptocurrency based on her Zerocash protocol, and her NSF CAREER grant supports cryptographic automation development. Her research has received significant media coverage in The Washington Post, Wired, and The New York Times, highlighting real-world relevance. While specific student advising details aren't public, her active publication record indicates ongoing mentorship of graduate researchers in security and cryptography. Her work maintains strong industry connections through ZCash development and Tor network contributions, with recent projects like keyless CDNs demonstrating practical applications of cryptographic automation. She remains a leading voice in cryptographic research communities through conference participation and collaborative projects addressing evolving security challenges.

Justine Sherryمشاهده پروفایل

استادیار

• Computer Networking
• Networked Systems
• Middleboxes
• +۵ مورد دیگر

Justine Sherry is the A. Nico Habermann Associate Professor of Computer Science at Carnegie Mellon University, affiliated with the College of Engineering. She holds a PhD (2016) and MS (2012) from UC Berkeley and a BS/BA (2010) from the University of Washington. Her research focuses on networked systems, including middleboxes, cloud computing, congestion control, and hardware acceleration (e.g., SmartNICs/FPGAs). Notable projects include Pigasus (open-source 100Gbps IDS), APLOMB (cloud-based middlebox scaling), and BlindBox (encrypted traffic scanning). Her academic roles include serving on the SIGCOMM CARES Committee, DARPA ISAT Study Group, and ACM CoNEXT Steering Committee. Awards include the Alfred P. Sloan Fellowship, VMware Systems Award, and IETF Applied Networking Prize. She advises over 15 students and collaborates with industry partners like Intel and VMware. Research highlights include radical shifts in datacenter architectures (SmartNIC compute control), fairness in congestion algorithms (BBR analysis), and database-proxy innovations (Tigger with eBPF). Her teaching emphasizes systems as science labs, integrating experimental design and hypothesis testing into projects. Education: PhD UC Berkeley (2016), MS UC Berkeley (2012), BS/BA University of Washington (2010) Labs/Teams: CyLab, SNAP Research Group, CMU Portugal Collaboration Grants: NSF, Intel, Google Faculty Awards

Brent Watersمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Theoretical Computer Science
• +۴ مورد دیگر

Brent Waters is a Professor at the Department of Computer Science, University of Texas at Austin , where he has been since 2008. He received his Ph.D. in Computer Science from Princeton University (2004) and held a postdoctoral position at Stanford University (2004-2005). His research focuses on cryptography and computer security, with groundbreaking work in Identity-Based Encryption, Functional Encryption, Attribute-Based Encryption, and code obfuscation. He is a founder of Functional Encryption and Attribute-Based Encryption. Education Ph.D., Computer Science, Princeton University (2004) Research Interests Cryptography, Security Protocols Functional Encryption, Attribute-Based Encryption Indistinguishability Obfuscation, LWE-Based Systems Zero-Knowledge Proofs, Key-Dependent Message Security Selected Publications Trends Recent work (2025) addresses adaptive security in broadcast encryption, SNARGs, and multi-authority ABE systems using LWE and bilinear maps. Key themes include collusion resistance, witness encryption, and optimizing cryptographic assumptions like CRS size reduction. Scientific Awards IEEE Fellow (2025), IACR Fellow (2024), ACM Fellow (2021) Simons Investigator (2019), Grace Murray Hopper Award (2015) Presidential Early Career Award (2011), Packard Fellowship (2011) Advising Current Ph.D. students: Shafik Nassar, George Lu Past Ph.D. students: Rachit Garg (2024), Satya Vusirikala (2021), Rishab Goyal (2019), Venkata Koppula (2018), Yannis Rouselakis (2013), Allison Bishop (2012) Contact Email: bwaters@cs.utexas.edu Phone: (512) 232-7464 | Office: GDC 6.810

Michael J. Freedmanمشاهده پروفایل

استاد

• Distributed Systems
• Networking
• Security
• +۴ مورد دیگر

Michael J. Freedman is the Robert E. Kahn Professor of Computer Science at Princeton University and co-founder/CTO of Timescale. He received his Ph.D. from NYU’s Courant Institute and degrees from MIT. Current roles: Professor, Co-founder & CTO Affiliations: Princeton University, SNS Group, CITP Associate Education: Ph.D. (NYU), S.B./M.Eng. (MIT) His research spans distributed systems, networking, and security, with innovations like CoralCDN, DONAR, and Ethane. His work impacts decentralized content delivery, software-defined networking, and privacy-enhancing technologies. His recent publications address scalable fusion algorithms, GPU acceleration for data systems, and distributed GPU resource management. These works intersect with cloud infrastructure, network optimization, and security. Scientific honors include: Presidential Early Career Award for Scientists and Engineers (PECASE) Sloan Fellowship NSF CAREER Award Office of Naval Research Young Investigator Award Test of Time Award (Theory of Crypto Conference) ACM SIGOPS Mark Weiser Award He advises graduate students like Sam Ginzburg and Ashwini Raina, who joined Meta AI and Timescale post-PhD. His projects have secured substantial grants, including $110M Series C funding for Timescale. Key labs/teams: Princeton SNS Group Co-founder, Timescale (enterprise data platform) Co-founder, iobeam (IoT analytics, acquired by Timescale) Collaboration with FCC on Consumer Broadband Test Contributions to OpenFlow/SDN standardization

George J. Mailathمشاهده پروفایل

استاد

• Game Theory
• Microeconomics
• Noncooperative Game Theory
• +۶ مورد دیگر

George J. Mailath is the Walter H. Annenberg Professor in the Social Sciences and Professor of Economics at the University of Pennsylvania, and an Honorary Professor at the Research School of Economics, Australian National University. He specializes in microeconomics, noncooperative game theory, repeated games, and the theory of reputations. His research explores pricing strategies, evolutionary game theory, and social norms. Mailath is a Fellow of prestigious institutions including the American Academy of Arts & Sciences and the Econometric Society. He served on the Econometric Society Council (2013-2015, 2020-2023), Game Theory Society Council (2005-2011), and co-founded Theoretical Economics . His editorial roles include editorships at Econometrica , Review of Economic Studies , and others. His 2019 book Modeling Strategic Behavior provides graduate-level insights into game theory and mechanism design. Mailath’s articles focus on strategic interactions, reputation effects, and dynamic game theory. Notable works include analyses of trust in risk-sharing mechanisms and coalition-proof strategies under frictions. His research emphasizes long-term strategic behavior and institutional design.