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

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

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.

Michael A Osborneمشاهده پروفایل

استاد

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +۳ مورد دیگر

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML

• Topological Data Analysis
• Data Visualization
• Computational Topology
• +۵ مورد دیگر

Bei Wang Phillips is an Associate Professor in the School of Computing and a faculty member at the Scientific Computing and Imaging (SCI) Institute at the University of Utah. She holds a Ph.D. in Computer Science from Duke University and an undergraduate degree from the University of Bridgeport. Her research focuses on Topological Data Analysis (TDA), data visualization, computational topology, and machine learning, with applications in scientific data exploration and analysis. She has received prestigious awards including the NSF CAREER Award (2022) and the PECASE Award (2025). Her work spans projects funded by NSF, NIH, and DOE, including multiparameter TDA and topology-aware data compression. She advises numerous students and collaborates on interdisciplinary initiatives in astrophysics, climate science, and AI fairness. Education: Ph.D. in Computer Science, Duke University (2010) B.S. in Computer Science and Mathematics, University of Bridgeport (2003) Research Interests: Topological techniques for large-scale data analysis Integration of topological, geometric, and machine learning methods Applications in visualization, bioinformatics, and network analysis Key Projects: NSF-funded TDA research (DMS-2301361, OAC-2313124) DOE project on topology-preserving data compression Collaborations with NASA, Argonne National Lab, and Carnegie Institution of Washington Awards: Presidential Early Career Award for Scientists and Engineers (2025) NSF CAREER Award (2022) DOE Early Career Research Program (2020) Advising and Grants: Mentored over 30 students and postdocs Recipient of multiple NSF and DOE grants totaling millions

• Machine Learning
• Deep Learning
• Gaussian Processes
• +۵ مورد دیگر

Geoffrey Pleiss is an Assistant Professor in the Department of Statistics at the University of British Columbia's Faculty of Science. He is also a CIFAR AI Chair at the Vector Institute and an inaugural member of CAIDA's AIM-SI (AI Methods for Scientific Impact) cluster. His work bridges statistical theory, machine learning, and computational methods with applications across various scientific domains. Pleiss received his PhD from the Computer Science department at Cornell University in 2020, where he was advised by Kilian Weinberger and worked closely with Andrew Gordon Wilson. Prior to his faculty position at UBC, he was a postdoctoral researcher at Columbia University with John P. Cunningham. His research focuses on the intersection of deep learning and probabilistic modeling, particularly on developing heuristic and approximate notions of uncertainty from machine learning models. His work has significant implications for reliable and optimal decision-making in experimental design and scientific discovery. Major research thrusts include neural network uncertainty quantification, Bayesian optimization, Gaussian processes, and ensemble methods. Pleiss develops theoretical frameworks while maintaining strong connections to practical applications across scientific domains. An analysis of his recent publications reveals a strong focus on uncertainty quantification in deep learning models, with particular attention to the limitations and capabilities of ensemble methods in the era of overparameterized models. His work increasingly addresses practical challenges in Bayesian optimization for scientific discovery, especially in materials science. There's also a growing emphasis on computational efficiency in Gaussian process methods, reflecting his commitment to making advanced statistical techniques accessible for real-world applications. CIFAR AI Chair Pleiss currently advises several graduate students including Donney Fan (PhD, Computer Science), Tim G. Zhou (MSc, Computer Science), Zachary Lau (MSc, Statistics), Nathan Cantafio (BSc, Statistics), and Tristan Cinquin (Research Intern at Vector Institute). His research is supported by multiple funding sources including his CIFAR AI Chair position, which provides significant research resources for advancing machine learning methodologies with scientific impact. Pleiss co-created and maintains GPyTorch, a highly efficient and modular implementation of Gaussian processes in PyTorch designed for speed, modularity, and prototyping. He is also involved with CoLA (Compositional Linear Algebra), a library for structured linear algebra operations in JAX and PyTorch that enables fast linear algebra computations by automatically exploiting matrix structure.

• Algebraic Geometry
• Mathematical Physics
• Mirror Symmetry
• +۷ مورد دیگر

Maxim Kontsevich has been a permanent professor at the Institut des Hautes Études Scientifiques (IHÉS) since 1995, holding the AXA-IHES Chair for Mathematics . He is also Professor at Rutgers University (one month per year since 1997) and was Professor at University of California, Berkeley (1993–1995). Born 25 August 1964 in Khimki, former USSR, he became a French citizen in 1999. Education: Ph.D. in Mathematics, University of Bonn, March 1992. Research Interests: Prof. Kontsevich’s work lies at the intersection of algebraic geometry , mathematical physics , and quantum theory . He introduced revolutionary ideas in mirror symmetry , non-commutative geometry , and deformation quantization , creating new algebraic structures that have found applications far beyond their original contexts. His current ERC Synergy Grant “ReNew Quantum” (2019-2025) explores recursive and exact new quantum theory . Publications & Trends: Across more than 50 influential papers, Kontsevich has consistently pushed the boundaries of enumerative geometry , motivic integration , and topological field theory . His recent work delves into symplectic aspects of homological algebra , motivic Donaldson-Thomas invariants , non-archimedean geometry , and integrable systems , revealing deep connections between geometry, algebra, and physics. Scientific Awards & Honors: Fields Medal (1998) Crafoord Prize (2008) Shaw Prize in Mathematical Sciences (2012) Breakthrough Prize in Fundamental Physics (2012) Breakthrough Prize in Mathematics (2014) ERC Synergy Grant “ReNew Quantum” (2019) AMS Moore Prize (2025) Doctor Honoris Causa: Aarhus University (2014), Universität Wien (2015), Syddansk Universitet (2023) Member of Académie des Sciences, Institut de France, Academia Europaea, National Academy of Sciences (foreign), London Mathematical Society (honorary) Grants & Leadership: As Principal Investigator of the ERC Synergy Grant “ReNew Quantum” (€10 million, 2019-2025), Kontsevich coordinates an international team advancing exact methods and resurgence in quantum field and string theories. Editorial Service & Community Roles: He serves on the editorial boards of Compositio Mathematica , Publications Mathématiques IHÉS , Journal of Noncommutative Geometry , and several other leading journals, shaping the direction of contemporary mathematical research.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

• Financial Analysis
• Equity Valuation
• Life Insurance
• +۳ مورد دیگر

Demetris Christodoulou is an Associate Professor in Accounting, Governance and Regulation at the University of Sydney. He holds a BEcon from Piraeus University, an MSc(Fin) from the University of York (UK), and a PhD from Athens University of Economics and Business (AUEB). His research focuses on applying data analytics, econometrics, and visualization techniques to financial analysis, equity valuation, life insurance, and financial advice. He co-directs the PEMA research group, specializing in productivity and performance measurement analytics, and previously led the MEAFA research group (2007–2022). He has collaborated extensively with industry partners including Deloitte and Australian insurers, and developed training programs for over 1,000 executives. His work includes open-source contributions to Stata software and the Graph Workflow platform, alongside $662k in workshop-generated funds supporting academic programs. He has advised multiple PhD students and taught at leading universities globally. Education: BEcon in Economics (Econometrics), Piraeus University MSc in Finance, University of York (UK) PhD in Accounting and Financial Analysis, Athens University of Economics and Business His research interests span financial reporting models, life insurance underwriting strategies, and behavioral finance. Recent projects address dishonesty mitigation in insurance disclosures and the adviser effect on customer disclosures. He has published widely in top journals like the Review of Accounting Studies and Stata Journal , and his work was featured in The Australian for insights on insurance fraud reduction. He maintains international collaborations, including visiting roles at Columbia Business School and the University of Cyprus, and serves on advisory boards for organizations like Behaviour.ai. Publications highlight methodological innovations in econometrics and visualization, with 2025's upcoming Stata Journal paper advancing time-series analysis techniques. His grants include partnerships with industry on longitudinal studies of insured lives, aiming to improve risk modeling and public policy insights.

Rashmi Vinayakمشاهده پروفایل

دانشیار

• Computer Systems
• Networked Systems
• Information Theory
• +۵ مورد دیگر

Rashmi Vinayak is an Associate Professor in the Computer Science Department at Carnegie Mellon University, with a courtesy appointment in the Electrical and Computer Engineering Department. She is a member of both the Systems group and Theory group at CMU and leads TheSys research group. She is also affiliated with the Parallel Data Lab (PDL). Her educational background includes a Ph.D. from UC Berkeley in 2016, followed by postdoctoral studies at the same institution. Rashmi's research spans the intersection of computer/networked systems and information/coding theory. Her current focus is on robustness and resource efficiency in data systems across storage, communication, and computation. Key thrusts include storage systems, caching systems, and systems for machine learning. Her work on SIEVE, a cache eviction algorithm, has been widely adopted by industry including VMware, Google, Redpanda, and numerous open source libraries. Her recent publications demonstrate a strong trend toward practical systems research with theoretical foundations, particularly in caching algorithms, storage systems, and machine learning infrastructure. Many of her papers have received best paper awards and industry adoption. Notable awards include: Sloan Research Fellowship (2023) IEEE Information Theory Society Goldsmith Lecturer (2023) NSF CAREER Award (2020) Multiple USENIX NSDI Community (Best Paper) Awards VMware Systems Research Award (2021) Facebook and Google Research Awards Rashmi has supervised numerous PhD, Master's, and undergraduate students, many of whom have gone on to prestigious positions at Harvard, Google, Meta, and other leading institutions. Her research has been generously funded by NSF, Sloan Foundation, Open Compute Project, Google, Facebook/Meta, VMware, and Amazon Web Services. She actively collaborates with industry partners including Google, Microsoft, NetApp, Facebook, Cisco, Intel and Cloudera. She leads TheSys research group which focuses on designing next-generation data systems that are robust, efficient, and performant. The group takes a multi-disciplinary approach spanning computer systems, information theory, and machine learning.

Ali Vakilianمشاهده پروفایل

عضو هیئت علمی

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +۱۸ مورد دیگر

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Aram Harrowمشاهده پروفایل

استاد

• Quantum Information Science
• Quantum Algorithms
• Quantum Computing
• +۳ مورد دیگر

Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.

Monika Henzingerمشاهده پروفایل

استاد

• Algorithms
• Data Structures
• Dynamic Algorithms
• +۳ مورد دیگر

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 Nadlerمشاهده پروفایل

استاد

• Geometric Representation Theory
• Symplectic Geometry
• Langlands Duality
• +۳ مورد دیگر

David Nadler is a Professor in the Department of Mathematics at the University of California, Berkeley, appointed in 2012. His research centers on geometric representation theory and symplectic geometry, with significant contributions to the Langlands program, microlocal sheaf theory, and symplectic topology. He maintains an active research group and teaches courses ranging from undergraduate linear algebra to graduate algebraic topology and geometry. Nadler's research explores the interface of algebraic geometry, topology, and representation theory. His work in geometric representation theory focuses on Langlands duality, Springer theory, and Betti geometric Langlands. In symplectic geometry, he investigates microlocal sheaves, Fukaya categories, and Weinstein structures. His recent publications demonstrate a consistent focus on categorical methods in geometric Langlands correspondence and symplectic arborealization. His publications consistently emphasize categorical and geometric approaches to representation theory. Recent works cluster in three areas: (1) extensions of the geometric Langlands program to Betti cohomology settings, (2) microlocal analysis of sheaves on symplectic manifolds, and (3) combinatorial models in symplectic topology. This reflects sustained development of 'Betti geometric Langlands' as a distinct research program bridging topology and automorphic forms. Nadler has advised over a dozen PhD students since 2012, with dissertations spanning geometric representation theory, symplectic geometry, and algebraic topology. Student projects frequently investigate categorical aspects of geometric Langlands, microlocal sheaves, and combinatorial models in symplectic topology.

Primoz Skrabaمشاهده پروفایل

استاد

• Applied Topology
• Geometry
• Algebra
• +۵ مورد دیگر

Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.

Daniel A. Spielmanمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

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.