Find Academic Supervisors

Jeffrey A. CooperView profile

Professor

• Estate Planning
• Wills and Trusts
• Tax Policy
• +3 more

Jeffrey A. Cooper is a Professor of Law at Quinnipiac University School of Law , where he teaches courses in estate planning, wills and trusts, and taxation. He previously served as Associate Dean for Research and Faculty Development and is currently faculty adviser to the Quinnipiac Probate Law Journal . Education: AB from Harvard University, JD from Yale University, LLM from New York University Research Interests: His work focuses on tax policy , estate and gift taxation , and the intersection of federal tax law with state probate systems . He specializes in trust enforceability , uniform trust code , and historical analysis of tax legislation. Publications: Recent articles address perpetual trusts , state death tax decline , and curriculum reforms in estate planning education. His scholarship is widely published in national law journals and cited in casebooks. Scientific Awards: Academic Fellow, American College of Trust and Estate Counsel (ACTEC) Faculty Scholar, Quinnipiac University Professional Background: Before academia, Cooper practiced law for over a decade as a principal at Cummings & Lockwood, senior officer at United States Trust Company, and special counsel to Shipman & Goodwin. He also served as a senior adviser to Fiduciary Trust Company International.

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

Nina BalcanView profile

Professor

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 more

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

Charalampos PapamanthouView profile

Associate Professor

• Computer Security
• Applied Cryptography
• Verifiable Computations
• +5 more

Charalampos Papamanthou is an Associate Professor of Computer Science at Yale University, where he also serves as Co-director of the Yale Applied Cryptography Laboratory and a member of the Yale Institute for Foundations of Data Science. He holds affiliations with the Yale Center for Algorithms, Data, and Market Design. Additionally, he is Chief Scientist at Lagrange Labs. His research focuses on computer security and applied cryptography, particularly verifiable and privacy-preserving computations, leakage-abuse attacks on searchable encryption, and scalable blockchains/cryptocurrencies. He has advised numerous students and postdocs, and his work is supported by NSF, Protocol Labs, and JP Morgan. Research Interests: His primary areas include cryptographic protocols, privacy-preserving systems, blockchain infrastructure, secure cloud computing, and distributed consensus mechanisms. He has pioneered advancements in zero-knowledge proofs, private information retrieval, and dynamic searchable encryption. Awards: He has received prestigious awards such as the CCS Test-of-Time Award (2022), JP Morgan Faculty Research Award (2022), and NSF CAREER Award (2017). His contributions span over 140 publications in top venues like CRYPTO, CCS, and SODA. Teaching: He has taught advanced courses in cryptography, algorithms, and computer systems security at Yale and previously at the University of Maryland and Brown University. Recently, he chairs Yale’s PhD admissions in Computer Science. Labs & Teams: Leads the Yale Applied Cryptography Lab, focusing on real-world applications of cryptographic research. Collaborates with industry partners like Lagrange Labs to develop privacy-preserving technologies.

Arno SolinView profile

Associate Professor

• Machine Learning
• Signal Processing
• Sensor Fusion
• +8 more

Dr. Arno Solin is a tenured Associate Professor in Machine Learning at Aalto University's Department of Computer Science and an Academy of Finland Research Fellow . He leads the Aalto machine learning research group and serves as Director of the Finnish Doctoral Program Network in AI (AI-DOC) . His work bridges probabilistic modeling with practical applications in sensor fusion and real-time inference. ELLIS Scholar (European Laboratory for Learning and Intelligent Systems) Adjunct Professor at Tampere University Member of Young Academy Finland (2021–2025) Research Interests focus on data-efficient machine learning with probabilistic methods for real-time inference and sensor fusion. Key areas include Gaussian processes, diffusion models, stochastic differential equations, and uncertainty quantification in deep learning. His group develops methods that combine structural constraints with adaptive learning for deployment on resource-limited hardware. Publication Trends show consistent output in top venues (NeurIPS, ICML, ICLR, AISTATS) with emphasis on diffusion models , 3D scene reconstruction , and real-time probabilistic modeling . Recent works explore physics-informed learning, heterophily-aware graph models, and compressed representations for world models in reinforcement learning. Scientific Recognition : Awarded AI Researcher of the Year 2024 by AI Finland Teacher of the Year 2023 at Aalto CS ISIF Jean-Pierre Le Cadre Best Paper Award (2018) MLSP Schizophrenia Classification Challenge Winner (2014) NeurIPS/ICML Reviewer Awards Research Leadership includes coordinating Finland's AI Center of Excellence program and directing the Finnish Doctoral Program Network in AI (AI-DOC). He supervises 15+ doctoral/postdoctoral researchers and has spun off Spectacular AI , a company commercializing sensor fusion technology.

Erik B. SudderthView profile

Professor

• Machine Learning
• Computer Vision
• Statistical Inference
• +3 more

Erik B. Sudderth is a Professor of Computer Science and Statistics and Chancellor's Fellow at the University of California, Irvine (UCI). He leads the Learning, Inference, & Vision Group and directs multiple research centers, including the UCI Center for Machine Learning and Intelligent Systems and the HPI Research Center in Machine Learning and Data Science. He previously served as an Associate Professor at Brown University. Education: B.S. (summa cum laude) in Electrical Engineering from UC San Diego (1999), M.S. and Ph.D. in EECS from MIT (2002, 2006). His research focuses on statistical methods for scalable machine learning, Bayesian nonparametrics, probabilistic graphical models, and applications in computer vision, AI, and environmental science. Key areas include nonparametric clustering, deep generative models, and particle-based inference algorithms. Research interests span diverse topics: advancing Bayesian nonparametric models for medical time series, scalable variational inference, and AI ethics. Notable contributions include the NET-VISA seismic monitoring system (ISBA Mitchell Prize, 2014), the BNPy toolbox (NSF CAREER Award), and work on diverse particle max-product algorithms for continuous inference. Scientific awards include the NSF CAREER Award, ISBA Mitchell Prize, and recognition as one of "AI's 10 to Watch" (IEEE). He has served as editor for top journals (JMLR, IEEE PAMI) and conference chairs (NeurIPS, CVPR). His work bridges theory and practice, with applications in robotics, climate science, and healthcare. Labs/Teams: UCI Learning, Inference, & Vision Group; UCI Center for Machine Learning; CREATE Technology Center. Grants include NSF funding for visually impaired collaboration tools and soil biogeochemical modeling.

John EvansView profile

Associate Professor

• Computational Mechanics
• Fluid Dynamics
• Fluid-Structure Interaction
• +3 more

John Evans is an Associate Professor and Jack Rominger Faculty Fellow in the Department of Aerospace Engineering Sciences at the University of Colorado Boulder, affiliated with the Applied Mathematics program. He serves as Associate Chair for Undergraduate Curriculum and is part of the Aerospace Mechanics Research Center (AMREC). His research focuses on computational mechanics, particularly fluid dynamics, fluid-structure interaction, and turbulence modeling using high-order and structure-preserving methods. Evans holds a PhD (2011) and MS (2008) in Computational and Applied Mathematics from the University of Texas at Austin, and dual BS/MS degrees in Mathematics and Applied Mathematics from Rensselaer Polytechnic Institute (2006). Before joining CU Boulder, he was a postdoctoral fellow at the Institute for Computational Engineering and Sciences (ICES). His research interests include isogeometric analysis, immersed methods, and data-driven turbulence modeling. Notable contributions include development of divergence-conforming discretizations for incompressible flows, stabilized collocation methods, and invariant subgrid stress models. He leads the AMREC lab and collaborates on plasma-fueled propulsion systems and geometrically sensitive simulations. Key Awards: 2021: Rocky Mountain AIAA Educator of the Year 2021: Gallagher Young Investigator Medal 2019-2021: Clarivate Highly Cited Researcher Professional Activities: Editor of Engineering Computations, Senior AIAA Member, Simons Visiting Professor (2019) Evans' work bridges advanced numerical methods with real-world engineering challenges. His lab develops open-source tools like XIGA for multi-material problems and focuses on immersive simulation environments. Current projects explore turbulence closure models, plasma propulsion, and topology optimization with B-spline-based approaches.

• Geometric Topology
• Geometric Group Theory
• Low-Dimensional Topology
• +6 more

Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.

Rohil PrasadView profile

Research Fellow

• Geometry
• Topology
• Dynamical Systems
• +6 more

Rohil Prasad is a Miller Research Fellow at the University of California, Berkeley, appointed in 2023, and will join Princeton University as an Assistant Professor in 2025. His research lies at the intersection of geometry, topology, and dynamical systems, with a particular focus on conservative dynamics, pseudoholomorphic curves, and Floer theory. Education: PhD in Mathematics, Princeton University (2018–2023), advised by Helmut Hofer Research Interests: Prasad’s work spans several deep areas of modern mathematics, including: Conservative Dynamics: Studying systems that preserve volume or symplectic structures. Symplectic Geometry: Exploring geometric structures preserved under Hamiltonian flows. Low-Dimensional Topology: Investigating the topology of 3- and 4-dimensional manifolds. Floer Theory: Using pseudoholomorphic curves to study periodic orbits and invariants. His research has led to significant advances in understanding periodic orbits, invariant measures, and the structure of area-preserving maps. Awards and Honors: 2024 Brin Dynamical Systems Prize for Young Mathematicians Contact: rrprasad@berkeley.edu | Office: 968 Evans Hall

Ben FischView profile

Assistant Professor

• Cryptography
• Distributed Systems
• Blockchain Technology
• +5 more

Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.

Monika HenzingerView profile

Professor

• Algorithms
• Data Structures
• Dynamic Algorithms
• +3 more

Monika Henzinger is Professor at the Institute of Science and Technology Austria (ISTA), heading the research group of Theory and Applications of Algorithms. She also serves as Vice President for Technology Transfer at ISTA since 2024. Previously, she held professorships at the University of Vienna (2009-2023) and EPFL, Switzerland (2005-2009), was Director of Research at Google (1999-2005), and served as Assistant Professor at Cornell University. Professor Henzinger's research centers on efficient algorithms and data structures with three main thrusts. First, she investigates dynamic settings where program inputs are repeatedly updated, seeking solutions faster than restarting computations. Second, she develops privacy-preserving algorithms that add minimal noise to protect input data while maintaining efficiency. Third, she translates theoretically optimal algorithms into practical implementations for dynamically changing inputs. Her work consistently addresses resource conservation in data processing, particularly computing time and memory space, while exploring the theoretical limits of possible savings. Henzinger's recent publications (2024-2025) reveal strong trends in dynamic algorithms, differential privacy, and graph theory. Her research consistently bridges theoretical computer science with practical applications, focusing on algorithms that adapt to changing inputs while preserving computational efficiency and data privacy. She has made significant contributions to problems like dynamic matching, minimum cut computation, and privacy-preserving data analysis across various domains. Professor Henzinger has received numerous prestigious awards and honors: Wittgenstein Award (2021) Two ERC Advanced Grants (2014, 2021) Carus Medal of the German Academy of Sciences Leopoldina (2019) SIGIR Test of Time Award Fellow of the Association of Computing Machinery (2016) Member of the Austrian Academy of Sciences (2017) CAREER Development Award of the National Science Foundation Best paper Award at the Symposium on Discrete Algorithms (2024) Professor Henzinger currently advises PhD students Bardiya Aryanfard, Antoine El-Hayek, and Roodabeh Safavi Hemami, along with postdocs Anamay Chaturvedi and Niklas Hahn. Her research is supported by multiple significant grants including an ERC Advanced Grant for 'Design and Evaluation of Modern, Fully Dynamic Data Structures,' the FWF Wittgenstein Prize, and the WEAVE Project on 'Static and dynamic hierarchical graph decompositions.' She also serves as Principal Investigator for the FWF project 'Fast algorithms for a reactive network layer,' providing substantial funding for her innovative work in algorithms and data structures. Professor Henzinger leads the Theory and Applications of Algorithms research group at ISTA, which focuses on developing practical algorithms for dynamic environments. Her team investigates resource conservation in data processing, specializing in dynamic algorithms that efficiently handle changing inputs, privacy-preserving algorithms that minimize noise while protecting data, and translating theoretical algorithms into practical implementations. The group maintains a strong presence in theoretical computer science through regular publications in top conferences and journals, and collaborates extensively with institutions worldwide to advance algorithmic research.

David CashView profile

Professor

• Applied Cryptography
• Theoretical Cryptography
• Computer Security
• +3 more

David Cash is a Professor in the Department of Computer Science at the University of Chicago. His research focuses on applied and theoretical cryptography, computer security, and theoretical computer science. He joined UChicago in 2018 and has held roles such as teaching courses in cryptography, computer security, and discrete mathematics. Cash has advised numerous PhD and master’s students, including Sam Everett, Alexander Hoover, and Jesse Stern. His work includes constructing quantum-secure cryptography systems, analyzing encrypted data navigation, and foundational theoretical results. He has received notable awards like the 2025 Quantrell Award for Teaching and multiple Best Paper awards at Eurocrypt. Cash's research also explores secure computation, oblivious RAM, and cryptographic agility. His affiliations include the Systems Group at UChicago, focusing on interdisciplinary systems research. Education details are not explicitly provided in the text. However, his career trajectory suggests advanced degrees in computer science or related fields. His teaching spans undergraduate and graduate courses, emphasizing both theoretical foundations (e.g., discrete mathematics) and applied topics like cryptocurrencies and secure systems. Cash actively engages in academic service, including organizing conferences and reviewing research. His work bridges theoretical insights with practical applications, addressing modern computational security challenges. His research contributions span cryptographic protocols, secure data structures, and privacy-preserving technologies. Notable projects include work on searchable encryption, leakage-abuse attacks, and cryptographic systems resilient to quantum computing. Cash collaborates with institutions like Rutgers University and has mentored postdoctoral researchers such as Alexander Hoover. His grants include NSF CAREER awards and Simons Institute fellowships, supporting research in secure outsourcing and cryptographic data protection.

Jens GrothView profile

Academic

• Cryptography
• Cryptographic Protocols
• Zero-Knowledge Proofs
• +5 more

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.

Quanquan LiuView profile

Assistant Professor

• Algorithms for Large Data
• Dynamic Graph Algorithms
• Parallel and Distributed Computing
• +4 more

Quanquan Liu is an Assistant Professor of Computer Science at Yale University. His research focuses on algorithms for large data, dynamic and distributed graph algorithms, parallel computing, differential privacy, and Byzantine-resilient systems. He holds a PhD in Computer Science from MIT's Theory Group and has held postdoctoral positions at Northwestern University and MIT. Education: PhD in Computer Science, MIT (Advisors: Erik Demaine and Julian Shun) MEng in Computer Science, MIT B.S. in Computer Science and Math, MIT (Advisor: David Karger) Research Interests: Theory and practice of algorithms for large-scale data, dynamic/distributed graph algorithms, parallel and high-performance computing, differential privacy, and Byzantine-resilient algorithms. Recent Highlights: His work includes practical differentially private graph algorithms, efficient parallel algorithms for graph problems, and fair course allocation mechanisms. Notably, he received the Best Paper Award at SPAA 2022 for parallel dynamic graph algorithms. Service: PC member for PPoPP, ESA, SPAA, and ALENEX Coach for USA Computing Olympiad (USACO) and Northwestern's ICPC team Current Group: Advising PhD students Felix Zhou and Pranay Mundra, and Master's student Jinghua Sun.

Bilal FarooqView profile

Associate Professor

• Disruptive transportation technologies and services
• Cyber-physical transportation systems
• Artificial intelligence and machine learning
• +4 more

Bilal Farooq is an Associate Professor and Program Director for the Master of Engineering in Interdisciplinary Engineering (MEIE) at Toronto Metropolitan University, holding the Canada Research Chair in Disruptive Transportation Technologies and Services within the Department of Civil Engineering. His educational background includes a PhD from the University of Toronto (2011), MASc from Lahore University of Management Sciences (2004), and BSc from the University of Engineering and Technology (2001). Dr. Farooq's research pioneers disruptive transportation solutions through cyber-physical systems, AI/machine learning applications, behavioral modeling, and optimization techniques. His work specifically targets on-demand multimodal systems, sustainable urban transportation, urban air mobility, automated vehicles, and extended reality applications, addressing critical urban mobility challenges with human-centered approaches. Analysis of his recent publications reveals a strong trend toward quantum-enhanced computational methods, privacy-preserving federated learning frameworks, and sustainability-focused decarbonization strategies across transportation domains, with increasing emphasis on human factors and real-world implementation. Notable scientific awards include: Ontario Early Researcher Award (2018) Canada Research Chair (2017) MassMotion Academic Pedestrian Modelling Project of the Year (2016) Québec Early Researcher Award (2014) Dr. Farooq actively supervises graduate students and secures significant research funding through his Canada Research Chair position and Early Researcher Awards. He directs the Laboratory of Innovations in Transportation (LiTrans), which develops interdisciplinary solutions integrating mathematics, engineering, computer science, and economics to address emerging transportation challenges. LiTrans focuses on disruptive transportation technologies, complete streets design, cyber-physical systems, pedestrian dynamics, resilience, and climate change impacts, collaborating with industry and government partners to translate research into practical urban mobility innovations for smart cities worldwide.