جست‌وجوی استاد و پژوهشگر

Kate Saenkoمشاهده پروفایل

استاد

• Artificial Intelligence
• Deep Learning
• Computer Vision
• +۴ مورد دیگر

Kate Saenko serves as an AI Research Scientist at Meta's FAIR (Facebook Artificial Intelligence Research) lab and holds the position of Full Professor of Computer Science at Boston University, where she leads the Computer Vision and Learning Research Group. Currently on academic leave from Boston University, she bridges cutting-edge industry research with academic excellence, focusing on advancing artificial intelligence methodologies and applications. Her educational background includes a PhD in Electrical Engineering and Computer Science (EECS) from the Massachusetts Institute of Technology (MIT), followed by postdoctoral training at the University of California, Berkeley and Harvard University. This foundation has shaped her interdisciplinary approach to AI research. Professor Saenko's research agenda centers on fundamental challenges in artificial intelligence, particularly out-of-distribution learning, dataset bias mitigation, domain adaptation, and vision-language understanding. Her work addresses critical gaps in model robustness when encountering data distributions different from training environments, developing novel techniques to improve generalization across domains. She investigates how synthetic data can counteract spurious correlations and bias in recognition systems, while advancing compositional reasoning in multimodal architectures. Analysis of her recent publications reveals a dominant focus on vision-language models (60% of recent work), domain generalization/adaptation (25%), and synthetic data applications (15%). Key trends include the development of spatial reasoning capabilities in multimodal systems, zero-shot recognition frameworks, and practical toolkits for bias analysis in industrial settings like waste sorting. Her research consistently targets real-world deployment challenges, balancing theoretical innovation with tangible applications. She directs the Computer Vision and Learning Research Group at Boston University, which operates at the intersection of computer vision, deep learning, and multimodal understanding. The group maintains strong industry collaborations through Meta's FAIR and previously engaged with the MIT-IBM Watson AI Lab. Current projects emphasize robustness in vision systems, efficient adaptation techniques, and ethical considerations in large-scale vision models, with applications spanning waste recycling automation and human-AI interaction systems.

Robin Jiaمشاهده پروفایل

استادیار

• Natural Language Processing (NLP)
• Deep Learning
• Artificial Intelligence
• +۷ مورد دیگر

Robin Jia is an Assistant Professor in the Thomas Lord Department of Computer Science at the University of Southern California (USC) , where he leads the AI, Language, Learning, Generalization, and Robustness (Allegro) Lab . His research focuses on enhancing the reliability and robustness of large language models (LLMs) through mechanistic understanding, benchmarking under distribution shifts, and neurosymbolic integration. Key affiliations include collaborations with the USC Keck School of Medicine and contributions to legal frameworks like the EU's Digital Services Act. Robin's research spans multiple domains, including: Scientific analysis of LLM capabilities in in-context learning , data memorization , and numerical reasoning Advancements in robust NLP systems , emphasizing uncertainty estimation and calibration Development of methods combining LLMs with symbolic solvers for complex reasoning tasks Interdisciplinary applications in medicine and law , such as privacy-preserving synthetic data generation and medical misconception evaluation . His recent publications (2024-2025) address Fourier-based numerical embeddings (NeurIPS), neurosymbolic planning (NAACL), and multimodal benchmarking (COLM), with a strong emphasis on privacy , fairness , and transparency . Scientific awards include the Google Research Scholar Award (2023) , SoCalNLP Symposium Best Paper Awards , and ACL/EMNLP outstanding papers . He advises PhD students like Johnny Wei and Ameya Godbole, and has secured grants from the NSF , USC-Capital One , and USC-Amazon .

Eric Larsonمشاهده پروفایل

دانشیار

• Algebraic Geometry
• Brill-Noether Theory
• Moduli Spaces
• +۳ مورد دیگر

Eric Larson is an Associate Professor at Brown University's Department of Mathematics, specializing in algebraic geometry. His research focuses on moduli spaces, Brill-Noether theory, and algebraic curves. He collaborates with notable mathematicians such as Isabel Vogt and Izzet Coskun on topics like normal bundles, Chow rings, and stability conditions. Larson actively engages in academic outreach, organizing Putnam competition practices and undergraduate colloquia. He has developed computational tools for studying elliptic curves' Galois representations and contributed to expository works on interpolation problems and LaTeX accessibility.

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

استادیار

• Natural Language Processing
• Interpretable Machine Learning
• Trustworthy AI
• +۵ مورد دیگر

Hanjie Chen is an Assistant Professor in the Department of Computer Science at Rice University, affiliated with the Ken Kennedy Institute. She holds a Ph.D. from the University of Virginia and a Master's from the University of Science and Technology of China. Her research focuses on Natural Language Processing, Interpretable Machine Learning, and Trustworthy AI, emphasizing model explainability, alignment with human needs, and applications in healthcare, sports, and medicine. She has advised numerous students and led initiatives in AI ethics and education. Education: Ph.D. (Computer Science, UVA 2023), M.Sc. (USTC 2018), B.Sc. (Nanjing University of Aeronautics and Astronautics 2015). Awards include the Outstanding Doctoral Student Award (UVA 2023) and John A. Stankovic Research Award (UVA 2023). She has organized workshops like BlackboxNLP and served on program committees for ACL, NAACL, and EMNLP. Her recent work includes developing benchmarks like SPORTU for multimodal LLMs, evaluating medical question-answering systems, and advancing methods for robust rationale evaluation (RORA). She teaches courses on Natural Language Processing and Trustworthy NLP, emphasizing pedagogical innovation recognized by teaching awards at UVA. Research collaborations include internships at Microsoft Research, IBM, and the Allen Institute for AI. She mentors students in SURF programs and advocates for diversity in tech, serving as a mentor in UVA's CSGSG Council.

Brian Lawrenceمشاهده پروفایل

استادیار

• Arithmetic Geometry
• Number Theory
• Diophantine Geometry
• +۲ مورد دیگر

Brian Lawrence is an Assistant Professor in the Department of Mathematics at the University of Wisconsin–Madison, currently on leave as of 2025. Previously, he held positions at UCLA, the University of Chicago, and Columbia University, following doctoral studies at Stanford University under Akshay Venkatesh. His educational background includes: PhD in Mathematics from Stanford University (advisor: Akshay Venkatesh) Lawrence's research centers on arithmetic geometry, specializing in Diophantine problems through p-adic methods. His work develops innovative approaches to Mordell's conjecture, Shafarevich-type results, and rational point distribution using p-adic Hodge theory, étale cohomology, and period mappings. He bridges theoretical number theory with computational frameworks, particularly in algorithmic solutions for Diophantine equations. His publication trends reveal sustained focus on foundational Diophantine geometry problems, with recent work emphasizing conditional algorithms for the Mordell problem and sparsity phenomena in integral points. Collaborations with leading mathematicians like Venkatesh and Sawin demonstrate interdisciplinary engagement across number theory and algebraic geometry. Lawrence actively mentors undergraduate researchers, supervising projects on resultants, Hodge theory, and symmetric polynomials by students including Pramana Saldin, Yuchen Chen, Anuj Sakarda, and Spencer Dembner. His organizational roles include founding the Crystalline Cohomology seminar at Columbia and co-organizing the University of Chicago Number Theory Seminar, fostering collaborative research environments. He contributes extensively through expository notes on schemes, polynomials on lattices, and Fibonacci numbers modulo p, reflecting commitment to mathematical education and knowledge dissemination across multiple institutions.

Sug Woo Shinمشاهده پروفایل

استاد

• Number Theory
• Automorphic Forms
• Algebraic Geometry
• +۶ مورد دیگر

Sug Woo Shin is a Professor of Mathematics at the University of California, Berkeley ( Math Genealogy , MathSciNet Profile ). His research focuses on Number Theory and Automorphic Forms, with significant contributions to the Langlands Program, Shimura varieties, and cohomology of arithmetic spaces. Editorial roles: Astérisque , Manuscripta Mathematica , Journal of the Korean Mathematical Society Recent research explores cohomological properties of locally symmetric spaces, tempered A-packets for classical groups, and modularity of symplectic Galois representations Collaborators include Ana Caraiani, Mark Kisin, Arno Kret, and Peter Scholze He has supervised PhD theses on topics like affine Deligne-Lusztig varieties, specialization maps in Scholze's category of diamonds, and statistical properties of automorphic representations. Teaching includes graduate courses on Number Theory (254A/254B), undergraduate Linear Algebra (110), and Calculus (1A), as well as seminars on global Langlands reciprocity and p-adic cohomology theories. Co-organized conferences include the BIRS workshop on Langlands programs (2025), PRIMA algebraic number theory sessions (2022), and KAST Symposium on automorphic forms (2021). His work appears in journals like Annals of Mathematics, Duke Mathematical Journal, and Compositio Mathematica.

Subhasish Mitraمشاهده پروفایل

استاد

• Robust Computing
• NanoSystems
• Electronic Design Automation (EDA)
• +۳ مورد دیگر

Subhasish Mitra is the William E. Ayer Professor of Electrical Engineering and Computer Science at Stanford University, holding dual appointments in both departments. He leads the Stanford Robust Systems Group and serves on the leadership team of the Microelectronics Commons AI Hardware Hub under the US CHIPS and Science Act. His research spans Robust Computing, NanoSystems, Electronic Design Automation (EDA), and Neurosciences, with breakthroughs in X-Compact test compression, carbon nanotube computing, and 3D integration. He has held international roles like the Carnot Chair at CEA-LETI and Visiting Professorships globally. Education & Honors: Recipient of over 40 awards including the IEEE Computer Society’s Harry H. Goode Memorial Award, ACM/IEEE’s A. Richard Newton Technical Impact Award, and the Intel Achievement Award. He earned top academic accolades from IIT Kharagpur and Jadavpur University, and is a Fellow of ACM and IEEE. Research Impact: Pioneered first-of-their-kind systems like the carbon nanotube computer and monolithic 3D integration. His work on robust computing techniques like QED validation and X-Compact compression has industry-wide adoption, saving billions in manufacturing costs. Collaborates with industry leaders like Intel, Google, and Samsung. Publications & Grants: Over 400 publications, including award-winning papers in DAC, ISSCC, and IEEE journals. Leads grants from NSF, DoE, and industry partnerships. His lab explores cutting-edge topics like neuromorphic computing, 3D thermal scaffolding, and AI hardware acceleration. Administration & Outreach: Serves as Associate Chair (Faculty Affairs) for Stanford’s Computer Science Department. Recognized by students for mentorship, and frequently invited to global forums like the World Economic Forum and National Academy of Engineering.

Aise Johan de Jongمشاهده پروفایل

استاد

• Algebraic Geometry
• Arithmetic Geometry
• Stacks Theory
• +۴ مورد دیگر

Aise Johan de Jong is a Professor in the Department of Mathematics at Columbia University, where he teaches courses including representations of finite groups and organizes the algebraic geometry seminar. He is a leading figure in algebraic geometry with a particular focus on stacks theory and arithmetic aspects of algebraic varieties. Institution: Columbia University, Department of Mathematics Research Focus: Algebraic stacks, arithmetic geometry, moduli spaces Major Project: The Stacks Project (open-source collaborative textbook) De Jong's research primarily centers on algebraic stacks, arithmetic geometry, and the foundations of algebraic geometry. His work bridges abstract theoretical frameworks with concrete computational aspects, particularly in positive characteristic. He has made significant contributions to understanding Brauer groups, period-index problems, and the geometry of moduli spaces. His research often connects number theory with geometric structures, exploring how arithmetic properties manifest in geometric settings. His publication record shows a consistent focus on fundamental structures in algebraic geometry, with particular emphasis on stacks theory (evident in The Stacks Project), Brauer groups, rational connectivity, and arithmetic properties of algebraic varieties. The trajectory of his work demonstrates increasing sophistication in handling complex geometric structures while maintaining connections to arithmetic questions. His most recent work continues to explore the interplay between algebraic geometry and number theory, particularly through the lens of stacks and moduli spaces. De Jong actively mentors graduate students, with numerous descendants listed in the Mathematics Genealogy Project. His academic lineage includes researchers working across various subfields of algebraic geometry. He has organized multiple conferences including "Moduli spaces and moduli stacks" (2012) and "Spaces of curves and their interaction with diophantine problems" (2009), demonstrating his leadership in the field. He leads The Stacks Project, a major collaborative open-source initiative that has become an essential reference for algebraic geometers worldwide. This project provides comprehensive foundations for algebraic stacks and related concepts, with regular updates and community contributions. De Jong also maintains the Stacks Project Blog where he discusses mathematical topics related to the project and shares updates.

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

استاد

• Philosophy of Language
• Philosophical Logic
• Metaphysics
• +۸ مورد دیگر

John MacFarlane is a Professor of Philosophy at the University of California, Berkeley , with affiliations to the Group in Logic and the Methodology of Science and co-organizer roles in the Meaning Sciences Club and Townsend Center Working Group . His research spans philosophy of language, philosophical logic, metaphysics, epistemology, philosophy of mathematics, history of logic , and ancient philosophy , particularly Aristotle . He has held visiting positions at institutions like École des Hautes Études en Sciences Sociales (EHESS), Paris . Education : Ph.D. in Philosophy (2000, University of Pittsburgh), M.A. in Classics (1997) and Philosophy (1994), A.B. summa cum laude in Philosophy (1991, Harvard). Research Interests focus on semantic relativism , particularly assessment sensitivity as explored in his book Assessment Sensitivity: Relative Truth and Its Applications (Oxford, 2014). He investigates how epistemic modals and vagueness interact with truth evaluation. His work in philosophical logic includes a textbook Philosophical Logic: A Contemporary Introduction (Routledge, 2021). Secondary interests include ancient philosophy (Aristotle, Plato), formal logic , and fiddlosophy . Article Trends reveal contributions to relativism , epistemic modals , vagueness , and logicism . His recent work (2025) examines Plato’s Protagoras and belief utility , while 2022–2020 articles address semantic indecision and probabilistic knowledge . Earlier works (2008–2000) include foundational studies on Frege, Kant, and Aristotle . Scientific Awards include a 2023 Residential Fellowship at Wissenschaftskolleg, Berlin (declined), 2016–17 Fellow at IEA Paris , and 2015 American Academy of Arts and Sciences membership . He has received multiple Humanities Research Fellowships at Berkeley (2016, 2008, 2003) and Research Enabling Grants (2000–2009). Advising includes supervising 15+ PhD students in areas like logic, epistemology, and philosophy of language . Notable advisees include Richard Lawrence (2017) and Sophie Dandelet (2021). He also guided honors theses at Berkeley, such as Benjamin Logan’s work on epistemic modals (2018). Labs and Teams involve co-organizing the Townsend Center Working Group in History and Philosophy of Logic, Mathematics, and Science and contributing to the Group in Logic and Methodology of Science . His interdisciplinary approach integrates philosophy, logic, and computational tools , including creating Pandoc for document conversion.

Paul Larsonمشاهده پروفایل

استاد

• Set Theory
• Topology
• Model Theory
• +۳ مورد دیگر

Paul Larson is a Professor of Mathematics at Miami University. His research focuses on set theory, topology, and model theory, with particular expertise in forcing axioms, descriptive set theory, and infinitary logic. He holds a Ph.D. in Mathematics from the University of California, Berkeley. His work bridges foundational mathematical logic with applications in topology and combinatorics. Key contributions include studies on canonical models under fragments of the Axiom of Choice, polar forcings, and cardinal characteristics. Larson has collaborated extensively with leading researchers such as Saharon Shelah and Jindřich Zapletal. His publications span prestigious journals like the Annals of Pure and Applied Logic and Transactions of the American Mathematical Society. Beyond research, he contributes to the academic community through editorial work and expository writings on historical developments in determinacy theory. Education: Ph.D., Mathematics, University of California, Berkeley Research interests emphasize foundational questions in set theory with applications to topology and model theory. His recent work explores advanced forcing techniques, square principles in Pmax extensions, and combinatorial properties of cardinal invariants. Publications reflect interdisciplinary engagement, including crystal structure prediction in high-pressure chemistry and operator theory in functional analysis. Despite an extensive publication record, no specific scientific awards are documented here. His advising and grant activities remain unspecified in the provided texts. Collaborations span international institutions, reflecting his role as a central figure in contemporary set theory research.

José F. Martínezمشاهده پروفایل

استاد

• Computer Architecture
• Microprocessor Design
• Multiprocessor and Multicore Architectures
• +۵ مورد دیگر

José F. Martínez holds the Lee Teng-hui Professorship of Engineering at Cornell University's College of Engineering, where he leads research in computer architecture and systems. His roles include Vice Chair of ACM SIGARCH, IEEE Fellow, and past leadership roles in ISCA, MICRO, and IEEE Computer Society journals. He has received prestigious awards such as the NSF CAREER Award, IBM/Qualcomm Faculty Awards, and multiple teaching accolades including Tau Beta Pi Professor of the Year (2011). Education: Licenciado en Informática de Sistemas (1996), Universidad Politécnica de Valencia M.S. (1999) and Ph.D. (2002) in Computer Science, University of Illinois at Urbana-Champaign His research focuses on computer architecture , including microprocessors, multiprocessors, memory subsystems, embedded systems, and processing-in-memory (PIM) innovations. He co-leads the DARPA/SRC ACE Center for Evolvable Computing and NSF's CROPPS Center, and previously co-founded Cornell's Institute for Digital Agriculture (CIDA). His work bridges hardware-software co-design and sustainable computing. Key Contributions: Advancing energy-efficient multiprocessor architectures Developing PIM frameworks like PUMICE and Membrane Market-based resource allocation systems (e.g., XChange, ReBudget) His advising spans over 15 graduate students and has guided Merrill Presidential Scholars. Current research explores evolvable computing paradigms and AI hardware acceleration, reflecting his dual focus on foundational architecture and applied systems innovation.

Benedikt Bünzمشاهده پروفایل

استادیار

• Applied Cryptography
• Blockchain Technology
• Consensus Algorithms
• +۴ مورد دیگر

Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.

Sanjit A. Seshiaمشاهده پروفایل

استاد

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

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.

• Algebraic Number Theory
• Modular Forms
• Galois Representations
• +۳ مورد دیگر

Jaclyn Lang is the Selma Lee Bloch Brown Assistant Professor of Mathematics at Temple University. Her research centers on algebraic number theory, focusing on modular forms, Galois representations, elliptic curves, motives, and p-adic methods. Education: Ph.D. in Mathematics, UCLA (2016), advised by Haruzo Hida Part III of the Mathematical Tripos, University of Cambridge (2010), supervised by Tom Fisher MA in Mathematics, Bryn Mawr College (2009), supervised by Helen Grundman Research Interests: She works on advanced problems in number theory, including the Eisenstein ideal, pseudorepresentations, and arithmetic geometry of elliptic curves. Her work often bridges algebraic geometry and automorphic forms using p-adic techniques. Scientific Awards: Churchill Scholarship (2009–2010) Clare Booth Luce Scholarship (2007–2009) NSF Graduate Research Fellowship (2010–2015) Charles E. and Sue K. Young Graduate Student Award (2015) NSF Mathematical Sciences Postdoctoral Research Fellowship (2016–2020) AWM Travel Grant (2023) Fulbright U.S. Student Program Grant (2016) Simons Travel Support for Mathematicians (2023–2028) Grants: She has received NSF Standard Grant DMS-331117 (2023–2026) and participated in programs like the Park City Math Institute and Women in Numbers Europe (WINE3).

• Theoretical Computer Science
• Graph Algorithms
• Dynamic Algorithms
• +۷ مورد دیگر

Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.