Upcoming Events

Approximating the Diameter of a Graph

I Am Error: How Math Can Automatically Fix Mistakes

Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling

Introduction to Cache Organization

Resource-Efficient Quantum Computing by Breaking Abstractions

Expanding Task Diversity in Explanation-Based Interactive Task Learning

Computational Modeling and Design of Financial Markets: Towards Manipulation-Resistant and Expressive Markets

Streaming Architectures for Medical Image Reconstruction

A Holistic Solution for Reliability of 3D Parallel Systems

Fast algorithms for linear programs and bipartite matching via new data structures and interior-point methods

Leveraging Longitudinal Data for Personalized Prediction and Word Representations

Software Model Checking with Uninterpreted Functions

Hash Tables Lecture

New Analysis of the Factor Refinement Algorithm with Applications

Explainability and Interpretability through Interaction

Design Optimization of In-Vehicle Network

Impartial selection, additive approximation guarantees, and priors

Pursuing Health and Inclusion Through Sociotechnical Systems

Undergraduate Town Hall Meeting

Bridging Continuous and Discrete Optimization through the Lens of Approximation

Objectively Measure Developers’ Cognitive Activities: Code, Biases, and Brains

Mobile Health Approaches to Precision Medicine

Machine Learning and Causality: Building Efficient, Reliable Models for Decision-Making

Networks Capable of Change

AI & Accessibility: Ethical Considerations

A Unified and Fine-Grained Approach for Light Spanners

Towards General Purpose Specialization

Collaboration as a Lens for Inclusive Technical Innovation

17th Annual CSE GRADUATE HONORS COMPETITION

U-M Data Science Annual Symposium 2020