MENU 
News
News Feed
Chris Peikert named Fellow of the IACR
Peikert was selected for this honor based on his outstanding contributions to cryptography research.QuantUM*Lot to provide additional parking capacity on University of Michigan North Campus
A quantum parking lot will be completed this summer in front of the new Leinweber Computer Science and Information Building.Wired: February 12, 2024
A Celebrated Cryptography-Breaking Algorithm Just Got an Upgrade
Prof. Chris Peikert is quoted in this article discussing the recent development of a new, more efficient LLL algorithm for lattice basis reduction, which is important in designing new experimental approaches in cryptography and mathematics.Michał Dereziński receives NSF CAREER Award to support next generation of data science algorithms
Dereziński aims to develop improved algorithms for data science applications.2024 EECS Outstanding Achievement Awards
The EECS Department has honored four faculty for their sustained excellence in instruction and curricular development, distinguished participation in service activities, or for their significant achievements in scholarly research.Nikhil Bansal named Fellow of the ACM
This honor recognizes Bansal’s contributions to and excellence in theoretical computer science.Scientific American: January 17, 2024
Tomorrow’s Quantum Computers Threaten Today’s Secrets. Here’s How to Protect Them
Prof. Chris Peikert is quoted twice in this detailed article on post-quantum cryptography, a stronger form of digital security that should resist the eventual ability of quantum computers to break today’s encryption standards. Promising approaches for post-quantum cryptography utilize lattices, and area of expertise for Peikert.Greg Bodwin wins Best Paper Award at SOSA 2024
The award recognizes Bodwin’s research on light graph spanners, used to design more efficient networks.WWJ News Radio: December 5, 2023
Quantum computing could trigger either a technological revolution or a nightmare. But scientists aren’t sure which.
Prof. Chis Peikert, an expert in cryptography and security for quantum computing, and Prof Alex Burgers, an expert in quantum systems, are interviewed about what quantum computing is and the challenges that will accompany its eventual use.2023 CSE Honors Competition highlights outstanding research by grad students
The competition recognizes PhD students in CSE for their excellent research contributions.Seven papers by CSE researchers presented at FOCS 2023
The papers authored by CSE researchers appearing at the conference cover a range of topics across theoretical computer science.New York Times: October 23, 2023
The Race to Save Our Secrets From the Computers of the Future
Prof. Chris Peikert is quoted in this article about the need to migrate to a new generation of post-quantum cryptography.Greg Bodwin named Morris Wellman Professor
Bodwin’s research centers around graph theory, combinatorics, and theoretical computer science.CSE welcomes new faculty to campus for the 23/24 academic year
Meet the new arrivals.Chris Peikert receives Crypto 2023 Test-of-Time Award
The award recognizes the sustained impact of Prof. Peikert’s research on oblivious transfer protocols and lattice-based encryption.Five papers by CSE researchers presented at STOC 2023
Three CSE faculty have authored papers being presented at the conference on topics ranging from length-constrained computing flows to graph connectivity problems.Wei Hu receives Google Research Scholar award for research on deep learning theory for real-world data
Hu has received Google support for his development of novel deep learning theoretical approaches that reflect the complex properties of high-dimensional data.Thatchaphol Saranurak recognized with 2023 Presburger Award
The award recognizes the outstanding contributions of a young scientist in the field of theoretical computer science.Eight CSE faculty earn NSF CAREER Awards
The NSF Faculty Early Career Development (CAREER) Program is the most prestigious award in support of early-career faculty who have the potential to serve as academic role models in research and education.Paul Grubbs earns NSF CAREER Award to build more secure, private networks
His cryptographic techniques will help managed networks like those in schools and companies enforce network policies without the need to access user information.Euiwoong Lee earns NSF CAREER Award to design more efficient data clustering algorithms
Lee seeks to improve performance guarantees in clustering, one of the most fundamental tasks in machine learning.Mahdi Cheraghchi earns NSF CAREER Award to study theoretical roots of error correction and pseudorandomness
Cheraghchi will study why gaps between theory and practice exist in these two interconnected fields of computing theory.Thatchaphol Saranurak earns NSF CAREER Award to study tackle problems in dynamic graphing algorithms
Saranurak will study the connections between these algorithms and a number of important open problems in graph theory, security, and optimization.Mahdi Cheraghchi receives Vulcans Education Excellence Award
He is recognized for his work in course development, his engaging and inclusive instruction, and his compassion as an educator and mentor.Major breakthrough in dynamic graph algorithms earns Best Paper
Thatchaphol Saranurak and collaborators were recognized at SODA ’23 for their work that broke an approximation barrier in dynamic graph matching.2022 CSE Graduate Student Honors Competition highlights outstanding research
The competition recognizes top research done by PhD students at CSE.CSE theory researchers co-author seven papers at IEEE FOCS 2022
The papers represented work by seven U-M researchers at one of the leading theoretical computing conferences in the world.New NIST post-quantum standards make use of research by Prof. Chris Peikert
Two cryptographic algorithms building on work by Peikert will contribute to NIST’s ongoing post-quantum cryptographic standard, and will be finalized in roughly two years.Nikhil Bansal invited to International Congress of Mathematicians
Bansal discussed recent developments in algorithmic approaches to discrepancy theory, a subfield of combinatorics with several applications in mathematics and computer science.CSE researchers present six papers at STOC 2022
The papers represented work by six U-M researchers at the leading general theoretical computing conference in the world.Algorithms, a random walk: A conversation with Nikhil Bansal
Bansal is known for his use of a broad mathematical toolset to find algorithmic solutions to problems once thought unsolvable.Popular Mechanics: December 10, 2021
Quantum Cyberattacks Are Coming. This Math Can Stop Them
In the future, quantum machines will “retroactively break” encryption schemes on today’s computers. Prof. Chris Peikert tells Popular Mechanics how we’ll protect our data.Outstanding research recognized at Graduate Honors Competition
Five finalists from each CSE lab presented their work at the event’s final round.Using negative probability for quantum solutions
Probabilities with a negative sign have been of great use in quantum physics.Get to know: Paul Grubbs
His research at the intersection of cryptography and systems has already had broad impacts across the IT industry.Solution for restoring faulty graphs earns best paper award
Prof. Greg Bodwin has devised a solution to an important open question in graph theory that offers promising new options for repairing and constructing resilient networks.Nikhil Bansal to join CSE as Patrick C. Fischer Professor of Theoretical Computer Science
Bansal is a leading researcher in the design and analysis of algorithms.Postdoc Leqi Zhu wins PODC Dissertation Award
The thesis completely solves a longstanding open problem in the theory of distributed computing.2020 CSE Graduate Student Honors Competition highlights outstanding research
The competition recognizes the research done by PhD students at CSE and the final competition is the culmination of a process that narrows a field of entrants to a handful of finalists.
CSE researchers report over $11M in research grants last quarter
The awards were distributed to 18 different primary investigators.
The Wall Street Journal: October 8, 2020
The contest to protect almost everything on the internet
The world’s top cryptographers are competing to develop algorithms that can withstand attacks from an ultrafast quantum computer – and Prof. Chris Peikert made one of the top 15 contenders.Alumnus Yi-Jun Chang Wins PODC Dissertation Award
His work is in complexity theory of distributed computing.
NIST finalists for post-quantum security standards include research results developed by Prof. Chris Peikert
A new secure code is needed to protect private information from the power of quantum computing.
7 new faculty in CSE
The new additions to the department offer a breadth of research and educational experience, with projects spanning robotic interaction and the future of programming languages.
College award recognizes a career dedicated to service
Kevin Compton has been committed to service in his work that has enhanced the student experience
Prof. Kevin Compton, Mentor and Coach for CS Students, Retires
Prof. Kevin Compton has retired after 34 years at the University of Michigan in the Computer Science and Engineering Division of the EECS Department.
CSE welcomes 9 new faculty
Get to know the new arrivals.Building a security standard for a post-quantum future
A large quantum computer could retroactively decrypt almost all internet communication ever recorded.
Chris Peikert Receives TCC Test of Time Award for work in lattice cryptography
Prof. Peikert and his co-author received the award at the Fifteenth Theory of Cryptography Conference for their paper on efficient collision-resistant hashing on cyclic lattices.
Chris Peikert named first-ever Patrick C. Fischer development professor
Peikert’s research is dedicated to developing new, stronger mathematical foundations for cryptography.
Yi-Jun Chang selected for Chia-Lun Lo Fellowship
Chang’s research interest is in complexity theory of distributed computing.
CSE alumnus Hsin-Hao Su selected for Principles of Distributed Computing Dissertation Award
Hsin-Hao’s thesis provides efficient algorithms for fundamental graph problems that arise in networks.
Grant Schoenebeck Receives CAREER Award to Develop a Rigorous Theoretical Understanding of Complex Networks
Schoenebeck’s research is in theoretical computer science, linear and semidefinite programs, the intersection of computer science and social networks, the intersection of computer science and economics, NP-complete optimization problems, and computational complexity theory.
Researchers Gather at CSE for Midwest Theory Day
This event is a semiannual tradition among CS theorists in the Midwest.
CSE Sponsors Science on Screen Night; Lecture by Prof. Kevin Compton and Screening of “The Imitation Game”
Students, faculty, and staff can attend the event at the Michigan Theater on January 8.