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

Chandra Chekuriمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +۶ مورد دیگر

Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.

Jean-François Le Gallمشاهده پروفایل

استاد

• Probability
• Brownian motion
• Lévy processes
• +۸ مورد دیگر

Jean-François Le Gall is a full Professor at Université Paris-Saclay and a member of the Orsay Mathematics Laboratory (LMO) since 2006. He has held prominent positions at Pierre and Marie Curie University (1988-2006) and École Normale Supérieure (1997-2007). A Senior Member of the University Institute of France (2007-2017) and an elected member of the Academy of Sciences since 2013, he served as Vice-President of Research for the Mathematics Department at Orsay (2020–present) and led the ERC Advanced Grant GeoBrown (2017–2023). Education: Ecole Normale Supérieure (1978–1982), PhD in stochastic differential equations (1982), State Doctorate on Brownian motion (1987) Research Interests focus on probability theory , particularly Brownian motion , superprocesses , random trees , planar maps , and their connections to PDEs and geometric models. His work bridges stochastic analysis , branching processes , and coalescence phenomena . Selected Publications include foundational studies on the Brownian map , random geometry , and spatial branching processes . His 2025 paper on The area of spheres in the Brownian plane explores fractal properties of random metric spaces, while the 2020 Growth-fragmentation processes work links Brownian trees to fragmentation models. Scientific Distinctions : 1986 Rollo Davidson Prize 1997 Loève Prize in Probability 2005 Sophie Germain and Fermat Prizes 2019 Wolf Prize in Mathematics 2022 BBVA Frontiers of Knowledge Award Academic Leadership includes directing the Probability and Statistics Team (2013–2019) and the Master 2 in Probability and Statistics (2007–2015). He chairs editorial roles in Grundlehren der mathematischen Wissenschaften (since 2020) and Probability Theory and Related Fields (2005–2010).

• Optimization for Machine Learning
• Collaborative Learning
• Distributed Learning
• +۷ مورد دیگر

Sebastian U. Stich is a tenured faculty member at the CISPA Helmholtz Center for Information Security , where he has been since December 2021. He is also a member of the European Lab for Learning and Intelligent Systems (ELLIS) since June 2020. His research focuses on optimization methods for machine learning, collaborative learning algorithms, privacy and security in distributed systems, and theoretical foundations of deep learning. Stich received his PhD in Theoretical Computer Science from ETH Zurich (2014), following a Master's in Mathematics at the same institution (2010-2014). Prior to CISPA, he worked as a research scientist at EPFL (2016-2021) and held positions at ETH Zurich and ICTEAM/CORE. He has been awarded the ERC Consolidator Grant 2024 , Google Research Scholar Award (2023), and Meta Privacy-Enhancing Technologies Research Award (2022). His team includes Dr. Anton Rodomanov (since 2023), Dr. Rotem Mulayoff (since 2024), Xiaowen Jiang (2023), Yuan Gao (2023), and notable alumni like Anastasia Koloskova (defended 2023). Stich actively organizes workshops (e.g., NeurIPS OPT 2024) and serves on editorial boards ( Journal of Optimization Theory and Applications , Transactions on Machine Learning Research ). He teaches advanced courses in optimization at Saarland University and has held visiting positions at MIT. Key scientific contributions include: Developing ProgFed for progressive federated learning (2021) Creating ProxSkip to accelerate communication in federated settings (2022) Formalizing SCAFFOLD with control variates for FL (2020) Introducing RelaySum mechanism for decentralized learning (2021) Proposing Lookahead-Minmax for GAN training (2021) His work addresses fundamental challenges in: Decentralized optimization theory Communication-efficient algorithms Privacy-preserving model training Handling heterogeneous data distributions Stochastic gradient dynamics Second-order optimization methods

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

Huiyan Sangمشاهده پروفایل

استاد

• Spatial Statistics
• Bayesian Nonparametrics
• Machine Learning
• +۹ مورد دیگر

Huiyan Sang is a Professor and Director of the Undergraduate Program in the Department of Statistics at Texas A&M University (College of Arts & Sciences). She earned her Ph.D. in Statistics from Duke University and a B.Sc. in Mathematics and Applied Mathematics from Peking University. Her research focuses on spatial statistics, Bayesian nonparametric methods, machine learning, computational statistics, and applications in environmental sciences, geosciences, urban planning, and biomedical research. Her interdisciplinary work integrates statistical methodologies with real-world challenges, such as analyzing extreme environmental events, optimizing urban infrastructure, and modeling complex systems like human mobility during pandemics. She has contributed to advancing spatio-temporal modeling, Gaussian processes, and Bayesian hierarchical frameworks for large datasets. Recent publications highlight innovations in nonparametric regression, spatial functional data analysis, and stochastic frontier analysis, often leveraging computational efficiency and scalability. Her work addresses critical societal issues, including the impact of community design on public health and environmental monitoring through remote-sensing data. No scientific awards are explicitly listed in the provided texts. She advises no students or grants in the current dataset but collaborates widely on interdisciplinary projects. Her research lab focuses on developing cutting-edge statistical tools with applications in engineering, public health, and environmental science.

Jason Liمشاهده پروفایل

استادیار

• Fast Graph Algorithms
• Algorithm Design
• Minimum Cut Problems
• +۶ مورد دیگر

Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.

Dennis Kommمشاهده پروفایل

دانشیار

• Algorithm Design and Analysis
• Computer Science Education
• Theoretical Computer Science
• +۳ مورد دیگر

Prof. Dennis Komm is an Associate Professor at ETH Zurich's Department of Computer Science, leading the group for Algorithms and Didactics. He chairs the Center for Computer Science Education (ABZ) and serves on committees such as the Swiss Maturity Board (Schweizerische Maturitätskommission) and the STEM Commission of the Swiss Academies. Previously, he held roles at RWTH Aachen University (Master's, 2008), ETH Zurich (PhD, 2012), University of Zurich (external lecturer, 2014–2020), and PH Graubünden (including department head and professor of 'Fachdidaktik Informatik'). Education: He completed a Master's in Computer Science at RWTH Aachen (2008), a PhD at ETH Zurich (2012), and studies in Information Technology at Queensland University of Technology (2006). His academic journey includes visiting roles at King's College, Stanford, and Comenius University. He has taught extensively across institutions, emphasizing Python and LOGO-based approaches for beginners. Research focuses on algorithm design, approximation algorithms, reoptimization, and advice complexity in theoretical CS. His work in education explores computational thinking, programming pedagogy (especially for K–12), and interdisciplinary approaches (e.g., robotics in math). Recent trends in his articles highlight advancements in online algorithms, optimization under dynamic conditions, and initiatives to integrate CS into Swiss school curricula sustainably. He actively promotes CS education through platforms like WebTigerPython and collaborates on projects such as CyberQuest and MINTerlink. His outreach includes organizing conferences (e.g., STIU 2025) and workshops on programming and cybersecurity for teachers and students. Despite no listed scientific awards, his contributions to education and theoretical CS are recognized through editorial roles in journals like Informatics in Education and contributions to the TigerJython Group. Grant-related advising includes co-supervising doctoral theses on robotics, USOs, and programming didactics. He advocates for equitable educational opportunities via the Passerelle exam and the Swiss Beaver Competition. His team's work spans teacher training, didactic certifications, and bridging university-school collaborations through initiatives like MINTerlink. Labs and teams: Head of ABZ (ETH's CS education center), collaborator with the Computational Robotics Lab, and part of the TigerJython Group. He also co-organizes the Colloquium on Mathematics, Computer Science, and Education with ETH's Mathematics Department.

Sanjay Jainمشاهده پروفایل

استاد

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

Erik Waingartenمشاهده پروفایل

استادیار

• Algorithms for Massive Datasets
• High-dimensional Geometry
• Property Testing
• +۵ مورد دیگر

Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song

David Croydonمشاهده پروفایل

دانشیار

• Probability theory
• Diffusions on random fractals
• Scaling limits
• +۵ مورد دیگر

David Croydon is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on probability theory, particularly diffusions on random fractals and scaling limits of random walks on random graphs. He also investigates discrete integrable systems with random initial conditions. Dr. Croydon's primary research interests span several areas of probability theory and mathematical physics. His work centers on diffusions on random fractals and how these processes can be constructed as scaling limits of related random walks on random graphs. He has made significant contributions to understanding random walks on critical structures including Galton-Watson trees, uniform spanning trees, and percolation clusters. More recently, he has developed a growing interest in the behavior of discrete integrable systems such as the box-ball system, particularly when started from random initial conditions. His research often bridges theoretical probability with applications in statistical physics and mathematical physics. Dr. Croydon's recent publications demonstrate a dual focus on theoretical probability and mathematical physics. His work on random walks spans various structures including binary trees, critical percolation clusters, and uniform spanning trees. He has made significant contributions to understanding aging phenomena, heat kernel fluctuations, and scaling limits in random media. Simultaneously, his research on discrete integrable systems explores the connections between probability theory and soliton theory, particularly through the lens of the box-ball system and related models. These two research strands converge in his investigations of scaling limits and invariant measures for complex stochastic systems. Dr. Croydon's scientific contributions have been recognized through publications in top-tier journals across probability theory and mathematical physics, though specific awards are not mentioned in the available information. Dr. Croydon has supervised several doctoral students to completion, including Adam Bowditch (2017), George Andriopoulos (2019), Eleanor Archer (2020), and Takumu Ooi (2024). He has also served in advisory roles for other students including John Sylvester (2017). His collaborative research spans multiple international institutions, suggesting involvement in various research grants supporting his work in probability theory and mathematical physics. While specific lab names aren't mentioned, Dr. Croydon is part of the vibrant probability theory research group at the Research Institute for Mathematical Sciences (RIMS) at Kyoto University. His extensive collaborations with researchers worldwide, particularly in the UK, France, and Japan, indicate active participation in international research networks focused on stochastic processes, random media, and discrete integrable systems.

Alexander Scottمشاهده پروفایل

استاد

• Combinatorics
• Probability
• Algorithms
• +۳ مورد دیگر

Professor Alexander Scott is a faculty member at the University of Oxford, holding positions as Professor of Mathematics and Dominic Welsh Tutor in Mathematics at Merton College. His research focuses on combinatorics, probability, algorithms, and graph theory, with a particular interest in the interplay between local and global structures in networks. He has organized the Oxford Combinatorics Seminar and co-founded the online Oxford Discrete Mathematics and Probability Seminar, fostering collaboration in these fields. Professor Scott’s work bridges theoretical foundations with applications in statistical physics and algorithmic design. He has supervised numerous graduate students in combinatorics and regularly teaches undergraduate courses in analysis and discrete mathematics. His contributions include advancements in extremal graph theory, probabilistic methods, and structural combinatorics, with over 150 publications in prestigious journals. He actively organizes academic events such as the annual One-Day Meeting in Combinatorics, hosting speakers from around the world. Despite the absence of explicit awards noted, his prolific research output and academic leadership reflect significant contributions to the field. His current interests continue to explore the Erdős-Hajnal conjecture, induced subgraph densities, and algorithmic challenges in combinatorial structures.

• Combinatorial Optimization
• Approximation Algorithms
• Stochastic Optimization
• +۳ مورد دیگر

Viswanath Nagarajan is an Associate Professor of Industrial & Operations Engineering and Computer Science Engineering (courtesy) at the University of Michigan. His research focuses on combinatorial optimization, approximation algorithms, and stochastic models for routing, scheduling, and location problems. He previously served as an Assistant Professor at the University of Michigan (2014–2020) and a Research Staff Member at IBM T.J. Watson Research Center (2009–2014). He holds a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2004–2009) and a B.Tech. in Computer Science from IIT Bombay (1999–2003). His research explores uncertainty management in optimization, including stochastic models and approximation algorithms for decision-making under uncertainty. He has contributed to adaptive algorithms, submodular optimization, and applications in logistics, network design, and scheduling. Education: Ph.D., Algorithms, Combinatorics, and Optimization (Carnegie Mellon University, 2009) B.Tech., Computer Science and Engineering (IIT Bombay, 2003) Prof. Nagarajan has organized major conferences like IPCO 2019 and served on editorial boards for journals including Operations Research , ACM Computing Surveys , and ACM Transactions on Algorithms . His service includes program committees for SODA, APPROX, and IPCO. He advises Ph.D. students focusing on optimization theory and applications, with advisees securing positions at Yahoo! Research, the University of Chicago, Ford Motor Company, and Georgia Tech.

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +۳ مورد دیگر

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

Shantanu Duttمشاهده پروفایل

استاد

• VLSI CAD
• Discrete Optimization
• FPGA Testing and Trusted Design
• +۲ مورد دیگر

Shantanu Dutt is a full Professor in the Department of Electrical and Computer Engineering at the University of Illinois at Chicago , located in Chicago, IL. His office is in 930 SEO at 851 S. Morgan St, and he can be reached at dutt@uic.edu . Education Ph.D. in Computer Science and Engineering, University of Michigan, Ann Arbor (1990) M.Tech. in Computer Engineering, Indian Institute of Technology Kharagpur (1984) B.E. in Electronics and Communication Engineering, Maharaja Sayajirao University of Baroda (1983) Research Interests Professor Dutt’s research agenda centers on VLSI Computer-Aided Design (CAD) , with particular emphasis on physical design and incremental synthesis targeting both ASICs and FPGAs. He explores discrete optimization techniques to solve placement, routing, and partitioning problems. Another major thrust is FPGA built-in self-test (BIST) and trusted design , ensuring provable diagnosability and security against hardware Trojans. He also investigates fault-tolerant computing at both chip and system levels, and develops parallel and distributed computing algorithms for scalable performance. Scientific Awards 1996 Best Paper Award , ACM/IEEE Design Automation Conference, for “A probability-based approach to VLSI circuit partitioning” 1995 Most Influential Paper Award , Fault-Tolerant Computing Symposium, for “Design and reconfiguration strategies for near-optimal k-fault-tolerant tree architectures” Research Impact and Funding Professor Dutt has published extensively in top-tier journals (IEEE TVLSI, ACM TRETS, IEEE TCAD) and premier conferences (ICCAD, DAC, DATE, FTCS). His work has shaped incremental placement, timing-driven routing, FPGA security, and fault-tolerant multiprocessor architectures. While specific grant numbers are not listed, the breadth and longevity of his publication record indicate sustained funding from NSF, industry, and other agencies. Laboratory and Collaborations Although no formal laboratory name is provided, Professor Dutt’s research is conducted within the ECE department’s VLSI CAD and Fault-Tolerance groups, collaborating with graduate students and colleagues across the US and internationally.

Elette Boyleمشاهده پروفایل

دانشیار

• Cryptography
• Computer Security
• Coding Theory
• +۷ مورد دیگر

Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .