Major breakthrough in dynamic graph algorithms earns Best PaperThatchaphol 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 researchThe competition recognizes top research done by PhD students at CSE.
CSE theory researchers co-author seven papers at IEEE FOCS 2022The 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 PeikertTwo 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 MathematiciansBansal 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 2022The 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 BansalBansal is known for his use of a broad mathematical toolset to find algorithmic solutions to problems once thought unsolvable.
Outstanding research recognized at Graduate Honors CompetitionFive finalists from each CSE lab presented their work at the event’s final round.
Using negative probability for quantum solutionsProbabilities with a negative sign have been of great use in quantum physics.
Get to know: Paul GrubbsHis 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 awardProf. 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 ScienceBansal is a leading researcher in the design and analysis of algorithms.
Postdoc Leqi Zhu wins PODC Dissertation AwardThe 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.
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 facultyGet 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.